Packet header field extraction

Patent metadata

Field	Value
Publication number	US-12040976-B2
Application number	US-202217859722-A
Country	US
Kind code	B2
Filing date	Jul 7, 2022
Priority date	Aug 26, 2015
Publication date	Jul 16, 2024
Grant date	Jul 16, 2024

Abstract

Some embodiments provide a method for processing a packet for a pipeline of a hardware switch. The pipeline, in some embodiments, includes several different stages that match against packet header fields and modify packet header fields. The method receives a packet that includes a set of packet headers. The method then populates, for each packet header in the set of packet headers, (i) a first set of registers with packet header field values of the packet header that are used in the pipeline, and (ii) a second set of registers with packet header field values of the packet header that are not used in the pipeline.

First claim

What is claimed is:

1. At least one non-transitory machine readable medium storing program instructions for being executed by at least one machine, the program instructions being for use in association with generation of configuration data for use in programming, at least in part, at least one packet processing pipeline for use in association with a network switch, the network switch comprising hardware, the at least one packet processing pipeline comprising at least one parser stage, at least one match-action stage, and at least one other stage, the network switch, when in operation, being to receive at least one ingress packet, the at least one packet processing pipeline being to process the at least one ingress packet to generate at least one egress packet for being output via the network switch, the program instructions, when executed by the at least one machine, resulting in the at least one machine being configured for performing operations comprising:
generating the configuration data based upon compilation of programming language code, the programming language code being user-generated, at least in part, the programming language code describing, at least in part:
header field parsing, by the at least one parser stage, of the at least one ingress packet; and
header field matching and/or header field modifying, at least in part, by the at least one match-action stage, of the at least one ingress packet;

wherein:
when the network switch is in the operation, the network switch is to associate respective subsets of header fields of the at least one ingress packet with each other in respective sets of memory locations;
the respective sets of memory locations are for use by the at least one match-action stage and the at least one other stage, respectively;
the network switch is configurable for use with both ternary content addressable memory (TCAM) and other memory;
the TCAM and the other memory are to store match-action table data to be used by the at least one match-action stage in the header field matching and/or header field modifying, at least in part;
the match-action table data is configurable, based upon the configuration data, to indicate GRE and/or GENEVE tunneling encapsulation-related operations; and
the at least one other stage is to generate, at least in part, the at least one egress packet based upon (1) at least one unmodified header field of the at least one ingress packet as parsed by the at least one parser stage and (2) at least one other header field generated, at least in part, by the at least one match-action stage as a result of the header field modifying.

2. The at least one non-transitory machine readable medium of claim 1 , wherein:
the operations further comprise compiling the programming language code to produce the compilation;
the at least one other stage is to generate, at least in part, the at least one egress packet; and
the at least one match-action stage comprises a plurality of match-action stages.

3. The at least one non-transitory machine readable medium of claim 2 , wherein:
a chip comprises the network switch; and
the configuration data defines, at least in part, the match-action table data.

4. The at least one non-transitory machine readable medium of claim 3 , wherein:
the at least one ingress packet comprises packet headers; and
the programming language code describes, at least in part, at least one parse graph that indicates, at least in part, manner in which the at least one parser stage is (1) to parse, at least in part, the packet headers and (2) to identify from the packet headers the respective subsets of header fields.

5. A method implemented, at least in part, using program instructions for being executed by at least one machine, the program instructions being for use in association with generation of configuration data for use in programming, at least in part, at least one packet processing pipeline for use in association with a network switch, the network switch comprising hardware, the at least one packet processing pipeline comprising at least one parser stage, at least one match-action stage, and at least one other stage, the network switch, when in operation, being to receive at least one ingress packet, the at least one packet processing pipeline being to process the at least one ingress packet to generate at least one egress packet for being output via the network switch, the method comprising:
executing, by the at least one machine, the program instructions, the program instructions, when executed by the at least one machine, permitting generation of the configuration data based upon compilation of programming language code, the programming language code being user-generated, at least in part, the programming language code describing, at least in part:
header field parsing, by the at least one parser stage, of the at least one ingress packet; and
header field matching and/or header field modifying, at least in part, by the at least one match-action stage, of the at least one ingress packet;

wherein:
when the network switch is in the operation, the network switch is to associate respective subsets of header fields of the at least one ingress packet with each other in respective sets of memory locations;
the respective sets of memory locations are for use by the at least one match-action stage and the at least one other stage, respectively;
the network switch is configurable for use with both ternary content addressable memory (TCAM) and other memory;
the TCAM and the other memory are to store match-action table data to be used by the at least one match-action stage in the header field matching and/or header field modifying, at least in part;
the match-action table data is configurable, based upon the configuration data, to indicate GRE and/or GENEVE tunneling encapsulation-related operations; and
the at least one other stage is to generate, at least in part, the at least one egress packet based upon (1) at least one unmodified header field of the at least one ingress packet as parsed by the at least one parser stage and (2) at least one other header field generated, at least in part, by the at least one match-action stage as a result of the header field modifying.

6. The method of claim 5 , wherein:
the method further comprises compiling the programming language code to produce the compilation;
the at least one other stage is to generate, at least in part, the at least one egress packet; and
the at least one match-action stage comprises a plurality of match-action stages.

7. The method of claim 6 , wherein:
a chip comprises the network switch; and
the configuration data defines, at least in part, the match-action table data.

8. The method of claim 7 , wherein:
the at least one ingress packet comprises packet headers; and
the programming language code describes, at least in part, at least one parse graph that indicates, at least in part, manner in which the at least one parser stage is (1) to parse, at least in part, the packet headers and (2) to identify from the packet headers the respective subsets of header fields.

9. At least one packet processing pipeline for use in association with a network switch, the network switch comprising hardware, the network switch, when in operation, being to receive at least one ingress packet, the at least one packet processing pipeline comprising:
at least one parser stage;
at least one match-action stage; and
at least one other stage;
wherein:
the at least one packet processing pipeline is programmable, at least in part, via configuration data;
the at least one packet processing pipeline is to process the at least one ingress packet to generate at least one egress packet for being outpu

Assignees

• Barefoot Networks Inc

Inventors

• Bosshart Patrick

Classifications

• H04L45/38

  Flow based routing · CPC title

• H04L45/42

  Centralised routing · CPC title

• H04L69/22

  Parsing or analysis of headers · CPC title

• H04L49/1546

  using pipelined operation · CPC title

• H04L45/74

  Address processing for routing · CPC title