| 主权项 |
1. A system for providing regular expression support using kernel-mode code language matching functions, the system comprising:
at least one hardware processor coupled to a non-transitory memory and configured to cause the system to execute:
a translator module that receives a probe script comprising an input source code of an event occurring in a host machine operating system and compiles the probe script written in a scripting language comprising SystemTap, wherein the probe script includes a set of definitions assigned by a user to reference other probe scripts, wherein the probe script includes a regular expression in the scripting language, wherein the translator module further determines input characters of the regular expression and regular expression matching instructions from patterns of the input characters, wherein the regular expression matching instructions comprise at least one of an identification of at least one string to perform matching using the regular expression, a number of times to perform the matching using the regular expression, and a stop point of the matching using the regular expression, and wherein the probe script performs analysis of a system point or process,wherein the translator module further determines a matching function in kernel-mode code language corresponding to the regular expression using the input characters and the patterns and translates the regular expression matching instructions to an invocation to the matching function in kernel-mode code language, and wherein the matching function corresponds to a deterministic finite automaton; anda kernel module that processes at least one string using the matching function and the invocation for the regular expression matching instructions in kernel-mode when executing the compiled probe script with the set of definitions to execute the regular expression in the probe script when analyzing the system point or the process, wherein regular expression matching instruction is translated to an invocation to the matching function in kernel-mode code language, wherein the matching function simulates state transitions of the deterministic finite automaton using the at least one string and the regular expression matching instructions in the kernel-mode, and wherein the kernel module finds matching patterns in the at least one string using the deterministic finite automaton. |
