Integrated search engine devices that utilize hierarchical memories containing b-trees and span prefix masks to support longest prefix match search operations
View Patent ↗A search engine device includes a hierarchical memory that is configured to store a b-tree of search prefixes and span prefix masks (SPMs). These SPMs are evaluated during each search operation to identify search prefixes that match an applied search key yet reside at nodes of the b-tree that are not traversed during the search operation. The search engine device also includes handle memory. This handle memory is configured to support a respective handle memory block for each search prefix within each of a plurality of nodes of the b-tree that reside at a leaf parent level within the b-tree. Each of these handle memory blocks may have sufficient capacity to support one result handle per bit within a span prefix mask associated with a corresponding search prefix. In other cases, each of these handle memory blocks may have sufficient capacity to support only M+1 handles, where M is a positive integer corresponding to a quantity of search prefixes supported by each of a plurality of leaf nodes within the b-tree.
1. An integrated circuit search engine device, comprising:
a hierarchical memory configured to store a b-tree of search prefixes and span prefix masks therein, said span prefix masks having values that are evaluated during a search operation to identify one or more search prefixes that match an applied search key yet reside at least one node of the b-tree that is not traversed during the search operation; and
search logic configured to search the b-tree of search prefixes in said hierarchical memory by evaluating at least one search prefix and corresponding span prefix mask at a first node of the b-tree within a search path of the b-tree during the search operation to thereby identify any prefixes that match the applied search key yet reside at a second node of the b-tree that is lower in the b-tree relative to the first node and outside the search path of the b-tree when the b-tree is traversed during the search operation.
2. The search engine device of claim 1 , further comprising:
a handle memory configured to support a respective handle memory block for each search prefix within each of a plurality of nodes of the b-tree that resides at a leaf parent level within the b-tree.
3. The search engine device of claim 2 , wherein a first one of the handle memory blocks has sufficient capacity to support one result handle per bit within a span prefix mask associated with a corresponding search prefix.
4. The search engine device of claim 2 , wherein a first one of the handle memory blocks has sufficient capacity to support only M+1 handles, where M is a positive integer corresponding to a quantity of search prefixes supported by each of a plurality of leaf nodes within the b-tree.
5. The search engine device of claim 4 , wherein said handle memory is further configured to support a plurality of handle memory blocks that are associated with corresponding ones of the plurality of leaf nodes and have a capacity of only M handles.
6. The device of claim 1 , wherein each of said span prefix masks has a set bit that specifies a prefix length of a search prefix to which it corresponds.
7. A method of searching a b-tree of search prefixes within a hierarchical memory, comprising the steps of:
determining a first span prefix mask associated with a first search prefix in the b-tree by identifying at least a second prefix in the b-tree that is a shorter prefix of the first search prefix and setting a bit in the first span prefix mask that identifies the second prefix; and
evaluating span prefix masks associated with each of a plurality of search prefixes located at first nodes within the b-tree during a search operation to thereby identify search prefixes that match an applied search key yet reside at nodes of the b-tree that are not traversed during the search operation.
8. An integrated circuit device, comprising:
a pipelined search engine configured to support a tree of search prefixes therein that utilizes span prefix masks to assist longest prefix match (LPM) detection when the tree is searched, wherein the pipelined search engine comprises search logic that is configured to detect any matching prefixes at a first leaf node of the tree that is outside a search path of the tree during a search operation, by:
evaluating at least one search prefix and corresponding span prefix mask associated with a leaf parent node of the tree to thereby identify a search prefix in the first leaf node that is a first prefix match to a search key associated with the search operation; and then
searching a second leaf node of the tree that is within the search path of the tree during the search operation to thereby identify whether a longer second prefix match is present therein relative to the first prefix match within the first leaf node.