Data structure traversal instructions for packet processing
OwnerBapiraju Vinnakota, Carl Alberola +1inventors
InventorsBapiraju Vinnakota, Carl Alberola, Saleem Mohammadali
Life of this patent
Estimating the term…
Loading patent…
OwnerBapiraju Vinnakota, Carl Alberola +1inventors
InventorsBapiraju Vinnakota, Carl Alberola, Saleem Mohammadali
Estimating the term…
Embodiments of the invention relate to data structure traversal instructions that perform efficient data structure traversal operations in packet processing applications. In one embodiment, a data structure traversal instruction for use in packet processing includes a control. In response to the control, the data structure traversal instruction accesses at least one node of a data structure. The data structure is typically a linked list or a binary tree. In an exemplary environment, the data structure traversal instruction may be implemented by a packet processor core of packet processor in a network device. In particular, three data structure traversal instructions are disclosed for accessing a node in a linked list and returning a data field, searching for a key value in a node of linked list, and accessing a node in a binary tree and searching for a matching key value, respectively.
-44. (canceled)
A packet processor comprising:
A machine-readable medium having tangibly stored thereon a data structure traversal instruction, which when executed by a packet processor, causes the packet processor to perform the following operations:
A system comprising:
Dependencies are inferred from the claim text.