State tree matching method capable of finishing integer matching
A matching method and state tree technology, which are applied in digital transmission systems, data exchange networks, electrical digital data processing, etc., can solve the problems of parallel pattern matching that cannot be integrated into strings, cannot be performed in parallel, and affect processing performance, and reduce hardware. overhead, increased processing speed, increased efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0026] This embodiment is a state tree matching method capable of completing integer matching, figure 1 The process flow of the method is described. Divided into 2 stages and 5 steps:
[0027] Initialization phase:
[0028] ●Read integer definition mode: read the integer comparison definition formula in the file, the definition format is as follows:
[0029] [addr, num] op data
[0030] Among them, addr indicates the position of the integer in the input data, or the offset; num indicates the integer type, which has three types: 1-byte integer, 2-byte integer, and 4-byte integer; op is the operation operator, including > (greater than operation), >= (greater than or equal to operation), = (equal to operation), <= (less than or equal to operation), < (less than operation) five types; data is the data value for comparison. Examples are as follows:
[0031] [10, 2] > 100: indicates a two-byte integer offset by 10 bytes from the start position, and its value is greater than 10...
Embodiment 2
[0038] This embodiment is the refinement of the generated state tree in Embodiment 1. It is a preferred solution, and it is a method for establishing a state tree structure generated by a one-byte integer. figure 2 Shown is the state tree structure generated by a one-byte integer. This embodiment adopts the multi-mode matching method of AC, the core of which is to generate a state tree for matching. figure 2 Describes the state tree structure of a one-byte integer and the state nodes of the corresponding five operation modes.
[0039] ●[Single-byte x]: Indicates the matching start node, and the current integer value is x;
[0040] ●[00], [x-1]: indicate the state tree nodes that are less than x; the operation results corresponding to these nodes should be less than the state, that is, the match is successful when the mode is defined as less than x;
[0041] ●[x]: indicates the state tree node equal to x; the operation result corresponding to this node should be equal to th...
Embodiment 3
[0051] This embodiment is a refinement of the generated state tree in Embodiment 1, which is a preferred solution, and is a state tree structure generated by a two-byte integer. image 3 A state tree structure generated by a two-byte integer is described. The state tree has two layers, and two consecutive matches need to be performed on two bytes. image 3 The state tree structure of the two-byte integer and the corresponding state nodes of the five operation modes are illustrated.
[0052] ●[High byte x][Low byte y]: indicates the matching start node, the value of the high byte of the current integer is x, and the value of the low byte is y;
[0053] ●[High byte x]: First match the high byte, there are three possible results: greater than x, equal to x, less than x; on the basis of these three states, match the low byte;
[0054] ●[low byte y][* "Indicates any value; the matching result must be less than the state;
[0055] ●[low byte y][>x]: when the high byte value is gre...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com