iNFAnt2 | iNFAnt2 is an optimized version of iNFAnt

iNFAnt2 is a C library. iNFAnt2 has no bugs, it has no vulnerabilities, it has a Strong Copyleft License and it has low support. You can download it from GitHub.

iNFAnt2 is an optimized version of iNFAnt, which was developed by N. Cascarano et al. (N. Cascarano, P. Rolando, F. Risso, and R. Sisto, "iNFAnt: NFA pattern matching on GPGPU devices," ACM SIGCOMM Computer Communication Review, vol. 40, no. 5, pp. 20–26, 2010.) Optimizations include: - Fast accept-state recognition by encoding accept states with negative IDs - Multi-byte input symbol fetches - NFA transition tables stored in GPU texture memory - Reporting the cycle and rule ID of each matched rule. - Capability of simultaneously processing multiple NFAs. iNFAnt2 is a framework that enables execution of very large and complex NFAs (e.g. regular expressions rulesets) with a low memory occupation and at very high throughput. The regular expressions are provided to the framework as a plain text file respecting the PCRE syntax. The framework can "compile" the regular expressions set into a transition graph file that is used as an input to the iNFAnt2 engine. The framework is composed by two components:(i) Generator and (ii) Engine. Please refer to M. Becchi web page for more information: It should be noted that the original input stream is evenly divided into multiple segments in the multi-packet mode with the assumption that each segment is independent to others. This assumption is only suitable for performance evaluation purpose. The capability of handling multiple segments will be included in our future version. The transition graph(s) can be generated in two ways: + generated by the generator (included in this package); + generated by VASim developed by Jack Wadden. Please refer to the J. Wadden’s web page for more information: