IP Library Granted Patent US 9,514,246
Granted Patent B2
US 9,514,246 · App. 14/632,448 · Granted Dec 6, 2016

Anchored patterns

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,514,246
App. No.
14/632,448
Granted
Dec 6, 2016
Kind
B2
Abstract

A method and apparatus relate to recognizing anchored patterns from an input stream. Patterns from a plurality of given patterns are marked as anchored patterns. An anchored state tree for the anchored patterns of the plurality of given patterns is built, including nodes representing a state of the anchored state tree. For each node of the anchored state tree, a failure value equivalent to a node representing a state in an unanchored state tree representing unanchored patterns of the plurality of given patterns is determined.

Claims (65)

1. A method comprising:

in a processor:

building an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

building a separate anchored state graph for given patterns, of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph;

for each node of the anchored state graph, determining a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns; and

including a failure value of a root node of the anchored state graph, the failure value being equivalent to a root node of the unanchored state graph.

2. The method of claim 1 , wherein the anchored state graph includes a root node that is set as a start node for processing anchored and unanchored patterns in an input payload.

3. The method of claim 1 , further comprising marking the given patterns, of the plurality of given patterns, as the anchored patterns.

4. The method of claim 3 , wherein marking includes adding a reference indicating a location within an input of a string of text to begin searching for the respective anchored pattern.

5. A method comprising:

in a processor:

building an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

building a separate anchored state graph for given patterns, of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph;

for each node of the anchored state graph, determining a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns;

wherein each node of the anchored state graph includes an output function, the output function of each node is calculated as a function of both the anchored patterns and unanchored patterns.

6. The method of claim 5 , further comprising marking the given patterns, of the plurality of given patterns, as the anchored patterns.

7. A method comprising:

in a processor:

building an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

building a separate anchored state graph for given patterns, of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph;

for each node of the anchored state graph, determining a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns;

wherein building the anchored state graph and building the separate unanchored state graph includes determining a number of states and transitions from one state to another.

8. The method of claim 7 , further comprising marking the given patterns, of the plurality of given patterns, as the anchored patterns.

9. A method comprising:

in a processor:

building an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

building a separate anchored state graph for given patterns of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph;

for each node of the anchored state graph, determining a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns;

upon receiving an input string of text, processing the input string of text through the anchored state graph; and

transitioning processing of the input string of text to a node of the unanchored state graph if a character of the input string of text results in one of the determined failure values on one of the nodes of the anchored state graph, the resulting failure value determining the node of the unanchored state graph to transition processing.

10. The method of claim 9 , further comprising marking the given patterns, of the plurality of given patterns, as the anchored patterns.

11. An apparatus comprising a processor configured to implement a compiler, the compiler configured to:

build an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

build a separate anchored state graph for given patterns, of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph;

for each node of the anchored state graph, determine a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns; and

determine a failure value of a root node of the anchored state graph, the failure value being equivalent to a root node of the unanchored state graph.

12. The apparatus of claim 11 , wherein the compiler is further configured to mark the given patterns, of the plurality of given patterns, as the anchored patterns.

13. The apparatus of claim 11 , wherein the anchored state graph includes a root node that is set as a start node for processing anchored and unanchored patterns in an input payload.

14. An apparatus comprising a processor configured to implement a compiler, the compiler configured to:

build an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

build a separate anchored state graph for given patterns, of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph;

for each node of the anchored state graph, determine a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns;

wherein each node of the anchored state graph includes an output function, the output function of each node is calculated as a function of both the anchored patterns and unanchored patterns.

15. The apparatus of claim 14 , wherein the compiler is further configured to mark the given patterns, of the plurality of given patterns, as the anchored patterns.

16. The apparatus of claim 14 , wherein the compiler is further configured to mark the given patterns by adding a reference indicating a location within an input of a string of text to begin searching for the respective anchored pattern.

17. An apparatus comprising a processor configured to implement a compiler, the compiler configured to:

build an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

build a separate anchored state graph for given patterns, of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph;

for each node of the anchored state graph, determine a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns;

wherein the compiler is further configured to build the anchored state graph and the separate unanchored state graph by determining a number of states and transitions from one state to another.

18. The apparatus of claim 17 , wherein the compiler is further configured to mark the given patterns, of the plurality of given patterns, as the anchored patterns.

19. An apparatus comprising a processor configured to implement a compiler, the compiler configured to:

build an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

build a separate anchored state graph for given patterns, of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph;

for each node of the anchored state graph, determine a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns;

wherein the compiler is further configured to:

upon receiving an input string of text, process the input string of text through the anchored state graph; and

transition processing of the input string of text to a node of the unanchored state graph if a character of the input string of text results in one of the determined failure values of one of the nodes of the anchored state graph, the resulting failure value determining the node of the unanchored state graph to transition processing.

20. The apparatus of claim 19 , wherein the compiler is further configured to mark the given patterns, of the plurality of given patterns, as the anchored patterns.

21. A method comprising:

in a processor:

building an unanchored state graph for unanchored patterns of a plurality of given patterns, the unanchored state graph including nodes representing a state of the unanchored state graph;

building a separate anchored state graph for given patterns, of the plurality of given patterns, marked as anchored patterns, the anchored state graph including nodes representing a state of the anchored state graph; and

for each node of the anchored state graph, determining a failure value equivalent to a node representing a state in an unanchored state graph representing unanchored patterns of the plurality of given patterns, wherein the failure value equivalent to the root node of the unanchored state graph enables tracking of the unanchored patterns of the plurality of given patterns in an event none of the anchored patterns of the plurality of given patterns are matched.

22. The method of claim 21 , further comprising marking the given patterns, of the plurality of given patterns, as the anchored patterns.

Assignments (6)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 15, 2020
From: CAVIUM INTERNATIONAL
To: MARVELL ASIA PTE, LTD.
Reel/Frame 053179/0320 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 17, 2020
From: CAVIUM, LLC
To: CAVIUM INTERNATIONAL
Reel/Frame 051948/0807 →
CERTIFICATE OF CONVERSION AND CERTIFICATE OF FORMATION Recorded Oct 2, 2018
From: CAVIUM, INC.
To: CAVIUM, LLC
Reel/Frame 047185/0422 →
RELEASE OF SECURITY INTEREST Recorded Jul 6, 2018
From: JP MORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
To: CAVIUM, INC; CAVIUM NETWORKS LLC; QLOGIC CORPORATION
Reel/Frame 046496/0001 →
SECURITY AGREEMENT Recorded Aug 17, 2016
From: CAVIUM, INC.; CAVIUM NETWORKS LLC
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 039715/0449 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 21, 2015
From: BILLA, SATYANARAYANA LAKSHMIPATHI; GOYAL, RAJAN
To: CAVIUM, INC.
Reel/Frame 035690/0513 →