UASL( .id = 3; .pattern = "ABC"; .pattern = "XYZ"; .distance = 3, match; .within = 3, match; )
A sequential search for two patterns is performed:
-
Search for the ABC template;
-
At 3 bytes after the last found ABC template (.distance=3,match;) the search for the XYZ template is performed: the XYZ template should completely fall within the following 3 bytes, because .within=3.