[#llvm-HashRecognize]
= xref:llvm.adoc[llvm]::HashRecognize
:relfileprefix: ../
:mrdocs:

Analysis that recognizes hash algorithms such as CRC in loops.

== Synopsis

Declared in `<llvm/Analysis/HashRecognize.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
class HashRecognize;
----

== Member Functions

[cols="1,4"]
|===
| Name| Description
| xref:llvm/HashRecognize/2constructor.adoc[`HashRecognize`]         [.small]#[constructor]#
| Construct the analysis for loop `L` using scalar evolution `SE.`
| xref:llvm/HashRecognize/dump.adoc[`dump`] 
| Dump analysis results to the debug stream.
| xref:llvm/HashRecognize/getResult.adoc[`getResult`] 
| Return recognized polynomial info when CRC matching succeeds.
| xref:llvm/HashRecognize/print.adoc[`print`] 
| Write analysis results for the loop to `OS.`
| xref:llvm/HashRecognize/recognizeCRC.adoc[`recognizeCRC`] 
| Attempt to recognize a CRC algorithm in the analyzed loop.
|===


== Static Member Functions

[cols="1,4"]
|===
| Name| Description
| xref:llvm/HashRecognize/genBarrettConstants.adoc[`genBarrettConstants`] 
| Generate Mu and FullGenPoly constants for a GF(2) Barrett reduction.
| xref:llvm/HashRecognize/genSarwateTable.adoc[`genSarwateTable`] 
| Build a 256‐entry Sarwate CRC table for generating polynomial `GenPoly.`
|===



[.small]#Created with https://www.mrdocs.com[MrDocs]#