US 12,436,762 B2
Techniques for use of a large scale multi-literal matching algorithm
Hao Chang, Shanghai (CN); Xiang Wang, Shanghai (CN); Yang Hong, Shanghai (CN); Wenjun Zhu, Shanghai (CN); Kun Qiu, Shanghai (CN); and Baoqian Li, Shanghai (CN)
Assigned to Intel Corporation, Santa Clara, CA (US)
Filed by Intel Corporation, Santa Clara, CA (US)
Filed on Dec. 22, 2021, as Appl. No. 17/559,752.
Prior Publication US 2022/0113969 A1, Apr. 14, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 9/30 (2018.01); G06F 9/38 (2018.01)
CPC G06F 9/30032 (2013.01) [G06F 9/30018 (2013.01); G06F 9/30036 (2013.01); G06F 9/30038 (2023.08); G06F 9/3887 (2013.01)] 19 Claims
OG exemplary drawing
 
1. A method for performing multi-literal matching, comprising:
sampling a chunk of data from a byte stream, the chunk of data comprising a character string comprising n bytes;
identifying a target literal character pattern for which multi-literal matching is performed;
performing a SHIFT-OR operation using the chunk of data as an input to identify a match candidate for the target literal character pattern, wherein the SHIFT-OR operation shifts match indicia in a plurality of rows of a SHIFT-OR mask table across predetermined bit boundaries and aligns the match indicia corresponding to the target literal character pattern into a single column, the SHIFT-OR operation outputting zero or a match candidate for the target literal character pattern; and
performing, based on a matched candidate, match verification for the target literal character pattern.