# Patent

## Title
Picoengine having a hash generator with remainder input S-box nonlinearizing

## Abstract

A processor includes a hash register and a hash generating circuit. The hash generating circuit includes a novel programmable nonlinearizing function circuit as well as a modulo-2 multiplier, a first modulo-2 summer, a modulor-2 divider, and a second modulo-2 summer. The nonlinearizing function circuit receives a hash value from the hash register and performs a programmable nonlinearizing function, thereby generating a modified version of the hash value. In one example, the nonlinearizing function circuit includes a plurality of separately enableable S-box circuits. The multiplier multiplies the input data by a programmable multiplier value, thereby generating a product value. The first summer sums a first portion of the product value with the modified hash value. The divider divides the resulting sum by a fixed divisor value, thereby generating a remainder value. The second summer sums the remainder value and the second portion of the input data, thereby generating a hash result.

## Background
TECHNICAL FIELD
The described embodiments relate generally to hash function generating circuits and methods, and to processors particularly suitable to employ such hash function generating circuits and related methods.
SUMMARY
In one specific embodiment, a very efficient and small pipelined run-to-completion picoengine processor includes a hash register, an input data register, a packet pointer register, and a hash generating circuit. The hash generating circuit includes a novel programmable nonlinearizing function circuit as well as a modulo-2 multiplier, a first modulo-2 summer, a modulor-2 divider, and a second modulo-2 summer. In one specific example, the programmable nonlinearizing function circuit comprises a plurality of separately enableable 4-bit S-box circuits. In this specific embodiment, the picoengine processor does not have an instruction counter and does not have circuitry usable to write into the memory from which picoengine instructions are fetched.
Before execution of a picoengine program, an incoming data value is stored in the input data register of the picoengine processor. Execution by the picoengine processor of a first hash instruction causes the modulo-2 multiplier to modulo-2 multiply a first portion of the incoming data value by a programmable multiplier value, thereby generating a product value. The first portion is a portion of the incoming data value, the first bit of which is pointed to by a packet pointer value stored in the packet pointer register. The programmable multiplier value can be preset to a desired value by executing a “load register file read stage control register” instruction on the picoengine processor. The resulting product value comprises a first portion and a second portion. The programmable nonlinearizing function circuit receives a hash register value from the hash register, and performs a programmable nonlinearizing function on the hash register value, thereby generating a Programmably Nonlinearized Version of the Hash Register Value (PNVHRV). For execution of this first hash instruction, the hash register value may have been previously cleared to be zero. The nonlinearizing function can be preset to one of a plurality of desired functions by executing a “load register file read stage control register” instruction on the picoengine processor. The resulting PNVHRV and the first portion of the product value are modulo-2 summed by the first modulo-2 summer, thereby generating a first sum value. The modulo-2 divider modulo-2 divides the first sum value by a fixed divisor value and outputs a division remainder value. The second modulo-2 summer modulo-2 sums the division remainder value and the second portion of the product value, thereby generating a hash value. The hash value is loaded into the hash register to overwrite the prior contents of the hash register. At the end of execution of the hash instruction, the packet pointer value is left pointing to the start of the next portion of the incoming data value in the input data register. Multiple such hash instructions are executed consecutively, with each successive hash instruction taking as its input data a different portion of the incoming data value. In execution of a final hash instruction, the input data value supplied into the hash generating circuit is set to be zero. At the end of execution of this final hash instruction, the hash register stores a hash value. This hash value may be used as the final hash value, or a part of this hash value may be used as the final hash value. In one specific example, the original incoming data value is a 128-bit value that is hashed down to yield a 32-bit hash value, where the least significant sixteen bits of that 32-bit hash value are output as the 16-bit final hash value.
Further embodiments and related methods are described in the detailed description below. This summary does not purport to define the invention. The invention is defined by the claims.



BRIEF DESCRIPTION OF THE DRAWINGS
The accompanying drawings, where like numerals indicate like components, illustrate embodiments of the invention.
FIG. 1 is a diagram of system 1 involving a pipelined run-to-completion processor 4 in accordance with one novel aspect.
FIG. 2 is a diagram of the tables of code stored in the external memory system 3 of FIG. 1.
FIG. 3 is a diagram of one section of code in the external memory system of FIG. 1.
FIG. 4 is a diagram of one 128-bit block of information within the section of code of FIG. 3.
FIG. 5 is a diagram of a fetch instruction in which the offset value is a value in the initial fetch information value.
FIG. 6 is diagram of a fetch instruction in which the offset value is a value in the input data value.
FIG. 7 is diagram of a fetch instruction in which the offset value is in a specified register of the register file of the processor.
FIG. 8 is a diagram of a fetch more instruction.
FIG. 9 is a diagram of a skip instruction that specifies a skip count and a predicate function.
FIG. 10 is a table illustrating the meaning of predicate bits in the instruction of FIG. 9.
FIG. 11 is a diagram of a single-octet skip instruction.
FIG. 12 is a diagram of a load register file read stage control register instruction.
FIG. 12A is a diagram that illustrates how certain bits of the multiplier value M(X) can be set using a load register file read stage control register instruction.
FIG. 12B is a diagram that illustrates how various S-box circuits can be programmably enabled/disabled using a load register file read stage control register instruction.
FIG. 12C is a diagram that illustrates the nonlinearizing function carried out by one 4-bit S-box of the nonlinearizing function circuit 303.
FIG. 13 is a diagram of a load decode stage control register instruction.
FIG. 14 is a diagram of a finished instruction.
FIG. 15 is a state diagram for the clock control state machine 6 of the processor 4 of FIG. 1.
FIG. 16 is a simplified diagram of one possible implementation of the lookup table circuit 30 within the fetch request stage 8 of FIG. 1.
FIG. 17 is a flowchart of a method 150 in accordance with a first novel aspect.
FIG. 18 is a flowchart of a method 160 in accordance with a second novel aspect.
FIG. 19A is a part of a larger diagram of FIG. 19, where FIG. 19 is a diagram of a specific example of the pipeline 7 of the processor of FIG. 1.
FIG. 19B is a part of the larger diagram of FIG. 19.
FIG. 19C is a part of the larger diagram of FIG. 19.
FIG. 19D is a part of the larger diagram of FIG. 19.
FIG. 19E is a part of the larger diagram of FIG. 19.
FIG. 19F is a part of the larger diagram of FIG. 19.
FIG. 19G is a part of the larger diagram of FIG. 19.
FIG. 19H is a part of the larger diagram of FIG. 19.
FIG. 19I is a part of the larger diagram of FIG. 19.
FIG. 19J is a part of the larger diagram of FIG. 19.
FIG. 20 is a more detailed diagram of shifter 205.
FIG. 21 is a diagram that illustrates the divisor value (coefficients of G(X)) employed by the modulo-2 divider 305.
FIG. 22 is a diagram that sets for a program of picoengine instructions, the execution of which hashes an incoming 128-bit value into a 16-bit hash value.
FIG. 23A is a diagram of a part of a larger diagram of FIG. 23, where FIG. 23 is a hardware description (in the CDL hardware description language) of an embodiment of the hash generating circuit 300.
FIG. 23B is a part of the larger diagram of FIG. 23.
FIG. 23C is a part of the larger diagram of FIG. 23.
FIG. 23D is a part of the larger diagram of FIG. 23.
FIG. 23E is a part of the larger diagram of FIG. 23.
FIG. 23F is a part of the larger diagram of FIG. 23.
FIG. 23G is a part of the larger diagram of FIG. 23.



DETAILED DESCRIPTION
Reference will now be made in detail to background examples and some embodiments of the invention, examples of which are illustrated in the accompanying drawings.
FIG. 1 is a high-level block diagram of a system 1 including a processor circuit 2 and a memory system 3 in accordance with one novel aspect. The memory system 3 includes a processor-readable medium that stores programs of instructions that are fetched and executed by the processor circuit 2. The processor circuit 2 includes a pipelined run-to-completion processor 4 and an initial fetch information determination circuit 5. The pipelined run-to-completion processor 4 includes a clock control state machine 6 and a pipeline 7. The pipeline 7 includes a fetch request stage 8, a fetch shift selector stage 9, a decode stage 10, a register file read stage 11, and an execute stage 12. The pipelined run-to-completion processor 4 receives input data values from an external circuit via input data port 13, and receives initial fetch information values via initial fetch information port 14, outputs output data values to an external circuit via output data port 15, interfaces to memory system 3 via a memory interface port 78, outputs tripwire data via a tripwire port 80. The pipelined run-to-completion processor 4 does not fetch instructions through either of the input data port 13 or the output data port 15. The picoengine uses its memory interface port 78 to fetch instructions from memory system 3. The picoengine also does not have the capability and circuitry to write anything into any memory from which the picoengine fetches instructions, and the memory interface port is not usable to write data into any memory. This allows the picoengine to be made even smaller. The picoengine does not output any multi-bit address value, other than through the memory interface port. The picoengine does not output any multi-bit address value that is usable to write into any addressed register or perform a registered input/output operation.
Due to its novel architecture, the pipelined run-to-completion processor 4 is implemented in one embodiment in about ten thousand equivalent gates. The pipelined run-to-completion processor 4 is therefore very small and is also referred to as a “picoengine”. The picoengine has no instruction counter and only fetches instructions either: as a result of being prompted from the outside by an incoming input data value and/or an incoming initial fetch information value, or as a result of execution of a fetch instruction. Due to the lack of an instruction counter and the associated control circuitry which can be substantial, the picoengine can be realized in a small amount of integrated circuit area.
Initially, the state machine 6 is in the idle state 16 (see that state diagram of FIG. 15). The pipeline 7 is clocked by the clock signal CLK 17. In the idle state, the state machine 6 disables the clock signal CLK from clocking the pipeline 7. The pipeline 7 is therefore not being clocked, and power consumption of the processor 4 is reduced. In the idle state, the state machine 6 also outputs the idle signal 18 via conductor 19. If the processor is idle, an external circuit external to the processor then supplies an input data value 20 onto the input data port 13 of the processor and asserts the start signal 21 (also referred to as the “PE select signal”). The input data port 13 in this case is a set of conductors 23 that extends from outside the processor and to the register file read stage 11. The asserting of the start signal 21 informs the processor 4 that the input data value 20 on the input data port 13 is available to be read. In response to the assertion of the start signal 21, the state machine 6 transitions to the enable clock signal state 22 (see the state diagram of FIG. 15).
The transition of the state machine 6 to the enable clock signal state 22 enables the pipeline 7 by supplying the clock signal CLK 17 to the pipeline 7. At the same time that the input data value 20 is being supplied to the processor via conductors 23 and the input data port 13, an initial fetch information value 24 is also being supplied to the processor 4 via conductors 25 and initial fetch information port 14. In the present example, the initial fetch information determination circuit 5 includes a characterizer circuit and a Ternary Content Addressable Memory (TCAM). The characterizer is an amount of combinatorial logic that receives the input data value, characterizes various parts of the input data value, and generates therefrom a set of flag values. The value of a particular flag as output by the characterizer indicates whether the input data value 20 has a corresponding particular characteristic. If, for example, the input data value 20 is an IPv4 network packet, then this characteristic is detected by the characterizer and the characterizer assert an IPv4 flag (the IPv4 flag is set), otherwise the characterizer does not assert the IPv4 flag (the IPv4 flag is cleared). There are many flags output by the characterizer, with each different flag indicating whether the input data value has a corresponding different characteristic. The flags as output by the characterizer are supplied to inputs of the TCAM. Depending on the values of the flags determined from the input data value 20, the TCAM outputs a multi-bit value (referred to as the “input fetch information value”) onto the initial fetch information port 14 of the processor circuit 2.
The fetch request stage 8 generates memory requests that are supplied to the external memory system 3 via memory interface port 78. The fetch request stage 8 can only output a memory request in response to either: 1) an incoming input data value and/or an incoming initial fetch information value, or 2) a fetch information value supplied to the fetch request stage as a result of execution by the pipeline of a fetch instruction. In the present example, both an incoming input data value is being supplied to the pipeline as well as an associated initial fetch information value. The incoming input data value 20 and/or initial fetch information value 24 prompts the pipeline 7 to issue a memory request 26. The memory request 26 is communicated to the external memory system 3. As explained in further detail below, the memory request 26 is a request to read one 128-bit word 57 from the memory system, where the address of the 128-bit word 57 is given by a base address value 28 and an offset value 29. The 128-bit word 47 is located at the beginning of a section 27 of code. A 128-bit word is also referred to here as a “block of information”. The memory of the memory system 3 is organized as a set of uniquely addressable 128-bit words. The base address value identifies the beginning of a table, TABLE#1 in this case, of code. The offset value identifies an offset from the base address 28 at the beginning of the table to the beginning of the section 27 of code. The external memory system 3 stores many such tables of code. The tables in FIG. 1 are denoted TABLE#0, TABLE#1, to TABLE#N.
In one specific example, the particular section 27 of code that the processor is prompted to fetch within table TABLE#1 depends on the initial fetch information value 24. The particular table as well is determined by the initial fetch information value 24. The initial fetch information value 24 includes a table number value. The fetch request stage 8 includes a table number to base address lookup circuit 30. The table number value is supplied to the lookup table circuit 30, and the lookup table circuit 30 outputs the base address value for the table. The base address value is then incorporated into the actual memory request 26.
The memory system 3 responds by returning to the processor circuit 2 a memory response 31. The memory response 31 includes one 128-bit block of information at the beginning of the identified section 27 of code. The 128-bit block of information 57 contains sixteen octets. The 128-bit block of information 57 includes a plurality of instructions, where an instruction can involve one, two or three octets, depending on the type of instruction. The number of instructions in a 128-bit block is therefore variable. The 128-bit block of information 57 is received by the fetch shift selector stage 9. The fetch shift selector stage 9 stores the 128-bit block of information 57, and then outputs three octets to the decode stage 10, where the particular octets output include the next instruction to be consumed next by the pipeline. Immediately after the fetch of the 128-bit block 57, it is the first, second and third octets of the 128-bit block that are output from the fetch shift selector stage 9.
The decode stage 10 receives the selected octets 32, and decodes the instruction. Based on the instruction, the decode stage 10 loads an A register pointer AP 33, a B register pointer BP 34, a carry flag bit C 67, a zero flag bit Z 68, a stack pointer SP 35, a packet pointer PP 36, and predicate bits P 79. The A register pointer AP 33 identifies one register (8-bit portion) of a register file 37 in the register file read stage 11. This identified 8-bit portion contains the value of the A register for the instruction to be executed. The B register pointer BP 34 identifies another register (8-bit portion) of the register file 37 that contains the value of a B register for the instruction to be executed. The stack pointer SP 35 identifies one register (8-bit portion) of the register file 37 that is the top of the stack. The 8-bit portions of the register file are usable as a stack, and there are instructions in the instruction set of the processor that use the stack. The packet pointer PP 36 identifies one bit in the input data register 38 in the register file read stage 11, where the bit is the first bit of a multi-bit value that may be used in the instruction to be executed. The predicate bits P 79 are three-bits that may be used by an instruction to specify a predicate condition function. In addition to determining these pointer values, the decode stage 10 sends a “number of octets consumed signal” 39 back to the fetch shift selector stage 9. The number of octets consumed depends on the instruction just consumed. If the instruction just consumed involves only one octet, then the decode stage 10 informs the fetch shift selector stage 9 to shift the bits the fetch shift selector stage outputs by one octet. If the instruction just consumed involves two octets, then the decode stage 10 informs the fetch shift selector stage 9 to shift the bits the fetch shift selector stage outputs by two octets. If the instruction just consumed involves three octets, then the decode stage 10 informs the fetch shift selector stage 9 to shift the bits the fetch shift selector stage outputs by three octets. Which octets of the block of information 57 that are output by the fetch shift selector stage 9 are therefore determined by the decode stage 10 using the number of octets consumed signal 39.
The register file read stage 11 stores the input date value 20 into the input data register 38, and sends a signal 56 back to the state machine 6, thereby causing the state machine 6 to transition from the enable clock signal state 22 to the operating state 50 (see the state diagram of FIG. 15). The state machine 6 signals the external circuit that the processor circuit 2 has received the input data value 20 by outputting an operating signal 55. The external circuit can then stop driving input data value 20 onto the input data port 13.
The register file read stage 11 uses the pointer values 33 and 34 from the decode stage to identify the portions of the register file 37 that store the A register value RA 40, and store the B register value RB 41. The register file read stage 11 uses the packet pointer value 36 from the decode stage to identify the portion of the input data register 38 that stores the PCK data value 42 to be used by the instruction. The contents of the register file 37 are output from the register file read stage 11 to the output buffers 59, but the output buffers 59 are disabled. The contents of the register file 37 are therefore not driven onto the output data port 15.
The execute stage 12 receives the RA value 40 (the contents of the A register), the RB value 41 (the contents of the B register) and the PCK data value 42 from the register file read stage 11. These values are inputs to an ALU 43 (Arithmetic Logic Unit) in the execute stage 12. The instruction operation to be performed, using these values, is determined by control signals (not shown) received from the decode stage 10, where the instruction operation is determined by the opcode of the instruction. The instruction set of the processor includes several different types of instructions including: ALU instructions, memory access instructions for data, instruction fetch instructions, and processor control instructions. Some of the instructions use the packet pointer 36 and the input data register 38 so that the instruction can obtain and use a part or parts of the input data value 20. Although not illustrated in FIG. 1, there is also another pointer and another register, where the other register stores the initial fetch information value 24. Other instructions use this pointer and this other register to obtain and use a part or parts of the initial fetch information value 24. In addition, flags are included into the input data value 20 as stored in the input data register 38, so these flags are also available for reference by instructions executed by the processor circuit 2. After an instruction has been consumed by the decode stage of the pipeline, the next instruction in the fetched block of information is supplied to the decode stage. The instructions of the fetched block of instructions are supplied to the decoder and are decoded one by one.
If the execute stage is executing a fetch instruction, then the execute stage supplies fetch information 44 back to the fetch request stage 8 via conductors 45. The execute stage also supplies associated data 46 via conductors 47. In the same way that an externally prompted fetch is prompted by fetch information received on initial fetch information port 14 and input data value received on input data port 13, so too is an internally prompted fetch from the execute stage 12 prompted by fetch information 44 on conductors 45 and data 46 on conductors 47.
As stated above, once the pipeline is operating it does not and cannot fetch instructions unless either: 1) it is prompted to by the receipt of another input data value (and associated initial fetch information value) or, 2) it is prompted to by execution of a fetch instruction. If the processor executes the last instruction of the fetched block of information and there is not a next instruction that has already been fetched, then the processor would hang. Accordingly, in the present example, the last instruction of the fetched block of information 57 is another fetch instruction. This last fetch instruction causes the processor to fetch the next 128-bit block of information from the same section 27 of code. The processor then continues on executing instructions from this second 128-bit block of information. The section 27 of code has a particular function. At the end of the code for performing this function is another fetch instruction, but this fetch instruction is an instruction to fetch the next 128-bit block of information from another table. In this way, the code executed by the processor is modular, with the code of one table causing a fetch into the code of another table, and so forth, from table to table. When fetching into the next table, the offset into the table is typically determined by a characteristic of the input data value 20, as recorded by flags generated by the characterizer. In some embodiments, the flags as determined by the characterizer are incorporated into the input data value 20 as stored in the input data register 38. When execution jumps from one table to the next, the particular section of code that is specifically tailored to data having a characteristic is vectored to (as opposed to vectoring to another section of the table whose code is not for data having the characteristic) due to the fetch instruction having access to the flags.
After the functions of the code have been carried out and execution of the code has traversed from table to table, a final “finished instruction” is executed. Execution of the finished instruction causes the execute stage 12 to assert a finished signal 48 on conductor 49. Asserting of the finished signal 48 causes the state machine 6 to transition from the operating state 50 to the finished state 51 (see the state diagram of FIG. 15). In the finished state 51, the state machine 6 asserts a finished signal 52 that is output from the processor circuit 2. The finished signal 52 as output from the processor circuit 2 is also referred to as the “PE has data to be read” signal. Assertion of the finished signal 52 indicates to an external circuit that the processor circuit 2 has data to supply to the external circuit. In response to the assertion of the “PE has data to be read” signal 52, the external circuit enables the outputting of the data output value 53 onto output data port 15 by asserting a “PE select signal” 58. Assertion of the PE select signal 58 causes the output buffers 59 to be enabled. The buffers 59 then drive the contents of the register file 37 onto the output data port 15 and to the external circuit. Execution of the finished instruction also causes the state machine 6 to stop the clock signal CLK from being supplied to the pipeline. The pipeline therefore stops clocking, and power consumption is reduced.
While the PE select signal 58 is asserted and the output data value 53 is being driven onto the output data port 15, the external circuit reads the output data value 53 from the output data port 15. The external circuit then deasserts the PE select signal 58 thereby disabling driver 59, and asserts an “output data was read” signal 54. Assertion of the “output data was read signal” 54 causes the state machine 6 to transition to the idle state 16. In the idle state 16, the state machine asserts the idle signal 18. At this point, the pipeline is not being clocked, but it is ready to receive another input data value and another associated initial fetch information value.
FIG. 2 is a diagram of the program code stored in the external memory 3. The memory is organized as many uniquely addressable 128-bit blocks of information. There are many such 128-bit blocks of information in one section of code, and there are many sections of code in one table, and there are N tables stored in the memory. In the illustrated example, the initial fetch (the one initially prompted from outside the processor by incoming data) is identified by the circled numeral “1”. The incoming initial fetch information causes the pipeline to start clocking. The resulting first fetch from the external memory has a base address 28 that identifies the first word 57 (first 128-bit block) of TABLE#1. The table number given by the initial fetch information value 24 is translated by the lookup table circuit 30 into the base address value 28 that is then used in the memory request 26. The offset 29 from the beginning location of TABLE#1 identifies the beginning 128-bit block 57 of section 27 of code. This offset 29 is specified by the initial fetch information. Once all the blocks of this section 27 of code have been executed, a fetch instruction causes code execution to jump to the fourth section of TABLE#0. This is identified in FIG. 2 by the circled numeral “2”. After execution of this section of code, a fetch instruction causes code execution to jump to the first section of the code of TABLE#4. This is identified in FIG. 2 by the circled numeral “3”. The instruction fetches that causes the fourth and fifth jumps are identified in FIG. 2 by the circled numerals “4” and “5”. At the end of the fourth section of code of TABLE#8 is a “finished” instruction. This finished instruction causes the pipeline to stop clocking, and causes the external circuit to be signaled that the processor circuit 2 has an output data value 53 to be read on output data port 15.
Each section of code is typically an amount of code that is specialized to do a particular discrete task on input data having a particular characteristic or characteristics. In one simplified illustrative example, a first section of code does VLAN and MAC address processing, a second section of code does IP header analysis processor, a third section of code does tunnel decapsulation processing, and a fourth section of code does inner header processing. Execution of a fetch instruction at the end of the first section references an IP header version flag (a flag in the initial fetch information value 24 that indicates whether packet data is IPv4 or IPv6), and as a result of this flag fetches code at the beginning of the second section. Execution of a fetch instruction at the end of the second section references a header value in the input data value 20 (the header value indicates whether the packet is a tunnel packet, and if so what kind of tunnel), and as a result of this header value fetches code at the beginning of the third section. Execution of a fetch instruction at the end of the third section references a set of data values stored in memory system 3 (the set of data values indicates whether the packet data is an ethernet frame or an IP packet), and as a result of this set of data values fetches code at the beginning of the fourth section. Another processor (a microengine (ME) processor not shown) preloads the set of data values into the memory system 3 so that the set of data values is later usable by picoengine (PE) processor circuit 2 executing a fetch instruction to determine which section of code to execute next. Memory system 3, in addition to storing blocks of information of code, stores many such sets of data values.
In one example, the processor circuit 2 of FIG. 1 is one of many such identical processor circuits (also referred to picoengines or “PEs”) in a pool (also referred to as a picoengine pool). The PE processor circuits are supplied with data and are assigned tasks, one by one, in a particular order. If a processor circuit of the pool is assigned a task, then it performs the task until it has a resulting output data value. An individual processor circuit that has an output data value (for example, output data value 53 of FIG. 1) to be read then holds its output data value until the output data value is read from the processor circuit. The resulting output data values from the PE processor circuits are read out of the pool one by one, in the very same order in which tasks were assigned, and the resulting data values are stored in an external FIFO. To perform this reading of the data values from the pool, an external output data reader circuit supplies a PE select signal to each of the PE processor circuits, but it only asserts one PE select signal going to one PE processor circuit at a time. The currently selected PE processor circuit is made to output its output data value onto a common output bus, and the output data value is communicated via this bus to the FIFO. After the output data value is stored in the FIFO, the output data reader circuit deasserts the PE select signal and asserts another PE select signal, so that another of the PE processor circuits will then output its output data value onto the common output bus. In this way the output data values from PE processor circuits are read, one by one. Each output data value includes a buffer pool number value that indicates a particular processor (an ME microengine processor) that will perform further processing on the data. A first particular type of input data values will typically be further processed by a first ME processor, whereas a second particular type of input data values will typically be further processed by a second ME processor, and so forth. The buffer pool numbers in the output data values are used to control which of the subsequent processing ME processors will further process which output data values being output from the pool. For additional information on a picoengine pool and an output data reader, see: U.S. patent application Ser. No. 14/251,592, entitled “Picoengine Multi-Processor With Task Management”, filed Apr. 12, 2014, by Gavin J. Stark (the entire subject matter of which is incorporated herein by reference).
FIG. 3 is a diagram of one section 60 of code. Each 128-bit block of information (one row in the diagram) includes 16 octets. In this example, there are thirty-two 128-bit blocks of information in the section 60.
FIG. 4 is a diagram of one 128-bit block 61 of information, and one three-octet instruction 62 within the block 61. The first octet of each instruction starts with a “0” bit. The second octet of a multi-octet instruction starts with a “1” bit. The third octet of a three-octet instruction starts with a “1” bit. The decode stage 10 uses these leading bits of the octets to parse the octets of a block of information and to identify the boundaries between instructions.
FIG. 5 is a diagram that illustrates a fetch instruction 81 where the offset value is a value in the initial fetch information value. The instruction is a three-octet instruction. The opcode 63 is ten bits. The four “mmmm” bits 64 and the two “MM” bits 65 together form a six-bit value, where this six-bit value identifies one eight-bit portion of the initial fetch information value that contains the offset value. Each eight-bit portion of the initial fetch information value is numbered, and the value “MMmmmm” is the number of one of these eight-bit portions. The five “ttttt” bits 66 indicate the table number. As mentioned above, in one example the table number is translated by the lookup table circuit 30 into the base address value where the table starts in memory.
FIG. 6 is a diagram that illustrates a fetch instruction 82 where the offset value is a value in the input data value. The instruction is a two-octet instruction. The opcode 70 is seven bits. The two “MM” bits 71 indicate the memory that contains the table. In the present example, memory system 3 is identified by an “MM” value of “00”. The five “tttttt” bits 72 indicate the table number. The packet pointer identifies one of the eight-bit portions of the input data value, and this eight-bit portion is used as the offset value.
FIG. 7 is a diagram that illustrates a fetch instruction 83 where the offset value is in a specified register in the register file 37. The instruction is a three-octet instruction. The opcode 73 is ten bits long. The four “nnnn” bits 74 indicate the number of the register in the register file 37 that contains the offset value into the table. The two “MM” bits 75 indicate the memory that contains the table to be fetched from. The five “ttttt” bits 76 specify the table number.
FIG. 8 is a diagram that illustrates a fetch more instruction 84. This instruction is one octet in length, and only contains a seven-bit opcode 77. The instruction causes a fetch of the next 128-bit block of information that is located in the memory immediately after the last 128-bit block of information that was fetched. The memory from which the fetch is conducted is the same memory from which the last fetch was conducted.
FIG. 9 is a diagram of a two-octet conditional skip instruction 91 that explicitly specifies a skip count and a predicate function. The opcode 92 of skip instruction 91 is “1110000”. If a predicate condition as determined by the value of the predicate code field 93 is true (if the predicate condition is “satisfied”), then execution of a number of subsequent instructions (instructions that follow the skip instruction in the sequence of instructions fetched) specified by the 3-bit skip count field 94 are “skipped”. Inclusion of such a skip instruction into a sequence of instructions generally does not affect or change the number or order or flow of instructions decoded by the decode stage 30 of the pipeline. The number and order and flow of instructions that are decoded by the decode stage 30 may be the same, regardless of whether the predicate condition is satisfied and a subsequent instruction or instructions are skipped, and regardless of whether the predicate instruction is not satisfied and a subsequent instruction or instructions are not skipped. Similarly, the fetching of instructions can be the same, regardless of whether the skip occurs, or not. If the predicate condition of the skip instruction is true and a subsequent instruction or instructions are skipped, however, then the execute stage 12 of the pipeline does not carry out the instruction operation of any skipped instruction. In addition, the skip instruction 91 includes a “flag don't touch” bit 95. If the “flag don't touch” bit 95 is set, then neither the skip instruction 91 nor any subsequent skipped instructions (skipped due to the skip instruction) are enabled to change the values of the carry bit C 67 and the zero bit Z 68. If the “flag don't touch” bit 95 is not set, on the other hand, then either the skip instruction 91 or any subsequent skipped instructions (skipped due to the skip instruction) can change the values of the carry bit C 67 and the zero bit Z 68.
FIG. 10 is a diagram that sets forth the predicate codes indicated by the three predicate bits.
FIG. 11 is a diagram that illustrates an efficient skip instruction 48. This instruction is one octet in length and includes a seven-bit opcode 96. Rather than there being a skip count filed, the opcode 96 itself is used as an indication that only the next one instruction will be skipped. There is another similar single-octet skip instruction whose opcode is used as an indication that the next two instructions will be skipped. Rather than the predicate code being explicitly specified by the instruction itself as in the instruction 91 of FIG. 9, in the case of the instruction 48 of FIG. 11 the 3-bit value of the predicate bits 79 are used to specify the function of the C and Z flags that condition carrying out of the skip.
FIG. 12 is a diagram that illustrates a load register file stage control register instruction 97. This instruction 97 is also referred to as a “set RF CSR” instruction. The instruction 97 includes a 7-bit opcode 98, a 2-bit first code field 99, a 1-bit second code field 100, a don't care bit 101, and a 3-bit data value field 102. The value of the 2-bit first code field 99 specifies a circuit or amount of circuitry that will be loaded or configured due to execution of the instruction 97. For example, if these two bits are “01”, then execution of the instruction 97 will cause the predicate bits 79 in the register file read stage 11 (see FIG. 1) to be loaded. If the value of the second code field 100 is “1” then the values of the data value field 102 of the instruction are the values that will be loaded into the predicate bits 79, whereas if the value of the second code field 100 is “0” then the three least significant bits of the value RA of register A will be loaded into the predicate bits 79.
FIG. 13 is a diagram that illustrates a load decode stage control register instruction 103. This instruction 103 is also referred to as a “set decode CSR” instruction. The instruction 103 includes a 7-bit opcode 104, a 2-bit code field 105, and a 5-bit data value to be loaded. The 2-bit value of the code field 105 indicates a circuit or amount of circuitry that will be loaded or configured due to execution of the instruction 103. For example, if the 2-bit code is “00” then the value of the stack pointer SP 35 is changed to be the 5-bit value set forth by the 5-bit data value 106 of the instruction.
The load CSR (control store register) instructions 97 and 103 of FIGS. 12 and 13 are different from other instructions executed by the processor in that loading operations they specify occur one clock cycle earlier than they would occur were they to be carried out by the execute stage in ordinary course. In a first clock cycle, the decode stage 10 decodes the load CSR instruction, and the specified loading operation then occurs in the very next clock cycle. Due to the load operation occurring one clock cycle earlier than they ordinarily would, the load CSR instruction can be used in an advantageous manner with a preceding instruction where the preceding instruction uses the ALU 43 to determine a value that is then loaded into the A register. In one novel aspect, the preceding instruction uses the ALU 43 to determine a value that then, as a result of execution of the instruction, loads the ALU output value into the register A (as pointed to by the A register pointer AP 33). The very next instruction to be executed by the processor is a load CSR instruction, such as the “load register file stage control register instruction” 97 of FIG. 12. The instruction 97 specifies that the predicate bits 79 are to be loaded with the contents RA of the register A. The instruction 97 is decoded in a clock cycle, and in the very next clock cycle the loading of the predicate bits P 79 occurs. The predicate bits P 79 are loaded with the contents RA of the register A before the contents RA can be changed as a consequence of execution of the instruction 97 itself. Now that the predicate bits 79 are loaded with the desired values, a next skip instruction can be of the one-octet efficient and short type set forth in FIG. 11, where the predicate code values of the predicate bits 79 are used to specify the predicate function. Alternatively, the next instruction is another type of conditional predicated instruction, where the predicate code values of the predicate bits 79 are used to specify the predicate function. In one novel aspect, there are multiple such efficient and short conditional predicated instructions, where each of the instructions is a short one-octet instruction that does not explicitly set forth the 3-bit predicate code but rather where the 3-bit predicate code is set forth by the same 3-bit value of the predicate bits 79 as stored in the register read file stage 11.
FIG. 14 is a diagram that illustrates the finished instruction 107. This instruction is one octet in length and includes a seven-bit opcode 108. As mentioned above, execution of the finished instruction causes the pipeline to stop clocking, and causes the state machine 6 to transition to the finished state. In the finished state, the state machine 6 causes the processor circuit 2 to assert the “PE has data to read” signal 52.
FIG. 15 is a state diagram of the state machine 6. The four states are the idle state 16, the enable clock signal state 22, the operating state 50, and the finished state 51. Assertion of the start signal 21 (also called the “PE select signal”) causes the state machine to transition from the idle state to the enable clock signal state. Assertion of the operating signal 55 (also called the “PE has read the data” signal) causes the state machine to transition from the enable clock signal state to the operating state. Assertion of the finished signal 48 from the execute stage causes the state machine to transition from the operating state to the finished state. Assertion of the “output data was read” signal 54 causes the state machine to transition from the finished state to the idle state.
FIG. 16 is a simplified diagram of the lookup table circuit 30 in the fetch request stage 8 of FIG. 1. The data contents of the memory portion 110 can be written via a control bus CB 111. An address 112 of a memory location in the memory portion 110 is supplied via lines 113, and the read/write signal 114 is set to indicate a write operation, and the data 115 to be written is supplied via the control bus 111 to the memory portion 110. In this way, the contents of the addressed memory location of the memory portion 110 are pre-loaded and setup before processor circuit 2 operation, or during downtimes during which the processor circuit 2 is not being used. To perform a table number value to base address value lookup, the table number 116 is supplied to the lookup table circuit 30 via input conductors 117 when the read/write control signal 114 is set to indicate a read operation. The read/write signal 114 controls the address multiplexer 118. The multi-bit content of the memory location addressed by the table number value is then output from the lookup table circuit 30 onto output conductors 119 as the base address value 120.
FIG. 17 is a flowchart of a method 150 in accordance with a first novel aspect. A program of instructions for the pipelined processor 4 of FIG. 1 includes a first instruction and a second instruction, where the first instruction is a conditional skip instruction. The fetch request stage 8 causes the first and second instructions to be fetched from the memory system 3. The conditional skip instruction may, for example, be of the form set forth above in FIG. 6 where the skip count is one. The first instruction is decoded (step 151) in the decode stage of the processor, and then the second instruction is decoded (step 152) in the decode stage of the processor. The first and second instructions pass through the pipeline 7, one after another, without there being any intervening decoding of any instruction. The skip instruction is executed (step 153) such that an execution of the second instruction in an execute stage of the processor is “skipped” if a predicate condition is satisfied (is “true”), whereas if the predicate condition is not satisfied (in “not true”) then the instruction operation of the second instruction is not “skipped” but rather is carried out by the execute stage. Accordingly, whether or not the predicate condition is true determines whether or not the second instruction is executed. The predicate condition is a specific function of one or more flag bits stored in the processor. In one example, the flag bits are a zero flag Z and a carry flag C stored in the register file read stage 11 of the processor. The function is specified by the value of the predicate code bits of the predicate field of the skip instruction. The second instruction (the skipped instruction) is decoded in the decode stage, but its instruction operation is not carried out by the execute stage.
FIG. 18 is a flowchart of a method 160 in accordance with a second novel aspect. There are three consecutive instructions that are fetched, and that flow through the pipeline of the processor, one after another. Execution of the first instruction causes the ALU 43 to generate an output value that is then loaded into the register A. Execution of the second instruction accesses the value from register A and loads this value into the predicate bits P 79. In one novel aspect, this second instruction is the “load register file read logic stage control register instruction” 97 of FIG. 12. The loading of the predicate bits P 79 occurs in the very next clock cycle after the clock cycle in which the second instruction was decoded. Execution of the third instruction uses the values of the predicate bits P 79 (as loaded by the second instruction into the register file read stage 11) as the 3-bit predicate code to specify a predicate function on the flags C and Z. The third instruction is a conditional instruction, the instruction operation of which is only carried out if the predicate condition is true. In one example, the third instruction is an efficient single-octet instruction such as the single-octet skip instruction 48 of FIG. 11. In another novel aspect, there is also a fourth instruction that is also an efficient single-octet conditional instruction. The carrying out of the instruction operation of the fourth instruction is also conditioned on the predicate condition being true, as specified by the very same values of the predicate bits P 79 that were used to condition the carrying out of the instruction operation of the second instruction. The first, second, third and fourth instructions are decoded in four consecutive clock cycles.
The providing of predicate code bits P 79, along with a companion load predicate instruction, along with short conditional instructions that use the values of these predicate bits as a predicate code to specify a predicate function, may be used to reduce code space in memory system 3 because typically the predicate conditions of conditioned instructions in a given section of code can all be conditioned in the same way. These predicate conditions typically depend on characteristics of the input data value 20. The same predicate code can therefore be used for all the conditioned instructions of the section of code.
Although in the specific embodiment of FIG. 1, the lookup table circuit 30 is disposed in the fetch request stage 8, in other embodiments the lookup table circuit that converts a table number value into a base address value is disposed in the memory system 3. In still other embodiments, there is no table number to base address lookup table circuit. If a lookup table circuit is disposed in the memory system 3, then the memory request 26 as received onto the memory system 3 may include the table number value. The lookup table circuit of the memory system 3 then uses the table number value to determine the base address value, and the base address value along with the offset value is then used to read the block of information from the memory of the memory system. In the same way that a table number value can be converted into a base address value by a lookup table circuit located in the fetch request stage 8, so too can another value (for example, a flag value or flag values) in the initial fetch information value 24 be converted by a lookup table circuit in the fetch request stage 8 into the offset value. Similarly, a lookup table circuit that converts a flag value or values into the offset value can be located in the memory system 3. The contents of these lookup table circuits can be loaded by the processor circuit itself, or in other embodiments can be loaded via a separate control bus (CB).
In one example, to realize an integrated circuit embodiment of the pipelined run-to-completion processor 4 of FIG. 1, the function of the each circuit block of the processor 4 is described in a hardware description language (for example, CDL or Verilog or VHDL). A commercially available hardware synthesis program (for example, Synopsis Design Compiler) is then employed to generate digital logic circuitry from the hardware description language description, where the synthesized digital logic circuitry performs the function described by the hardware description language. The processor 4 is realized in this way to be a small circuit of about ten thousand equivalent gates. An embodiment of processor 4 may be made available by one company as a predesigned block of circuitry that is then incorporated into another company's integrated circuit design as a general purpose block. Such a predesigned block of IP is sometimes referred to in the art as a block of “IP”. A hardware designer who incorporates the predesigned block of IP into a larger integrated circuit design need not understand or be aware of the internal structure and operation of the pre-designed block, but rather interfaces to the pre-designed block in accordance with an interface description supplied by the original designer of the predesigned block. Rather than being supplied as a block of IP to be incorporated into another integrated circuit, the novel processor 4 can be supplied to end customers as a separate discrete integrated circuit of general utility in data processing applications.
FIG. 19 is a detailed diagram of one specific implementation of the pipeline 7 of the run-to-completion processor 4 of FIG. 1. One 128-bit block of octets is received onto the processor from the memory system 3 via memory interface port 78. The 128 bits pass through multiplexer 200 and are latched into pre-fetch data register 201. The 128 bits pass through multiplexer 202 and are clocked into fetch data register 203. The least significant (leftmost) twenty-four of the bits pass from the fetch data register 203 down to a “delineate instruction” block 204 in the decode stage 9. The 128 bits also pass to the left to a shifter 205. The shifter shifts the 128-bit value on its input to the right, either by 0 bits, 8 bits, 16 bits, or 24 bits. The number of bits shifted is determined by the 2-bit value on input leads 206. When performing a shift, the leftmost bits of the resulting shifted value are replaced with one, two, or three NOP instruction opcodes. The resulting shifted 12-bit value is supplied from the shifter 205 to input 207 of multiplexer 202. In the decode stage, the “delineate instruction” block 204 examines the least significant twenty-four bits of the incoming 128-bit block, and looks at the leading bits of the octets. From these leading bits, the “delineate instruction” block determines whether the octet in the least significant bit position is the first octet of a single-octet instruction, or is the first octet of a two-octet instruction, or is the first octet of a three-octet instruction. The number of octets of this first instruction is output as the “number of octets consumed” signal 39. This “number of octets consumed” signal 39 is the control signal supplied to shifter 205. Accordingly, after the first leftmost instruction has been decoded, the 128-bit incoming value to the shifter is shifted to the right by a number of octets such that the leftmost octet of the least significant 24-bits supplied to the “delineate instruction” block 204 is the leftmost octet of the next instruction. In this way, as instructions are decoded, the shifter 205 shifts the 128-bit value to the right a number of octets so that the “delineate instruction” block receives the next instruction to be deciphered.
In addition to determining the number of octets in the instruction, the delineate instruction block 204 also examines the instruction and determines the instruction type, as indicated by the opcode of the instruction. The instruction can be a local operation, a decode packet operation, a decode memory operation, a decode hash operation, a decode fetch operation, or a decode miscellaneous operation. Each of the decode blocks 208-213 examines and decodes the twenty-four bits output by the “delineate instruction” block 204 and outputs a set of fifty-two “individual decoded instruction” bits. For example, three bits of the “individual decoded instruction” bits are denoted “RFA_SRC” and this value is used to generate the pointer AP that is then stored in AP register 33. The pointer AP is used to select a part of the register file 37 that is then clocked into the A register 214. For example, three bits of the “individual decoded instruction” bits are denoted “RFB_SRC” and this value is used to generate the pointer BP that is then stored in register 34. The pointer BP is used to select a part of register file 37 that is then clocked into the B register 215.
Multiplexer 216 receives all the bit values stored in the register file 37, and selects one sixteen-bit portion based on the pointer AP (as supplied onto the select input of the multiplexer 216). Similarly, multiplexer 217 receives all the bit values stored in the register file 37, and selects one sixteen-bit portion based on the pointer BP (as supplied onto the select input of the multiplexer 217). The register file read stage supplies values, such as the contents of the A register 214 and the B register 215, to inputs of the ALU 43. The contents of the instruction register 218 determines the operation performed by the ALU 43. The sixteen-bit output value of the ALU 43 passes through multiplexer 219 and multiplexer 220 and is clocked back into the register file 37. Some of the bits of the register file 37 are the output data value 53. If the output data value 53 is to be read by an external circuit, then the external circuit asserts the PE select signal 58 so that the output buffers 59 are enabled. The output buffers 59 drive the output data value 53 to the external circuit. Depending on the instruction to be executed, the register A 214 can be loaded with a 16-bit part of the contents of the data register 38. Which 16-bit part is determined by the instruction decode. The selected part is supplied by multiplexer 221 and multiplexer 222 to register A 214.
If the instruction being decoded is a skip instruction, then the skip count is supplied via conductors 223 to multiplexer 224. If the number of instructions to be skipped is zero, then either the “00” multiplexer input or the “01” multiplexer input is selected. In either case, a value of zero passes through multiplexer 224 and is latched into register 225. If the value as output by register 225 is zero, then the EN signal output of comparator 226 is asserted. All the registers 37, 227, 214, 215, 68, 67, 228 and 229 have synchronous enable signal inputs, and these inputs are coupled to receive the enable signal EN. Consequently, if the number of instructions to skip is zero, then these registers are enabled, and the execution of no instruction is skipped. If, however, the number of instructions to skip as supplied to multiplexer 224 is not zero, then muiltiplexer 224 initially couples the value on its “10” input to its output. The number of instructions to skip is therefore clocked into register 225. Because the value supplied to comparator 226 is non-zero, the enable signal EN is not asserted and the registers listed above are disabled (not enabled). This disabling prevents execution of an instruction. On the next clocking of the pipeline, the decremented number of instructions to skip (as output by decrementer 230) is passed back through multiplexer 224 and is latched into register 225. This process of decrementing the number of instructions to be skipped, clock cycle by clock cycle, is continued until the decremented number equals zero. When the decremented number equals zero, then the comparator 226 causes the enable signal EN to be asserted, which in turn stops the skipping of execution of instructions. Due to the enable signal EN having been deassserted for a number of clock cycles, execution of the appropriate number of instructions is prevented.
FIG. 20 is a more detailed diagram of shifter 205.
Hash Generation: In one novel aspect, the execute stage 12 of the picoengine pipeline 7 of FIG. 19 includes a novel hash generating circuit 300 (see FIG. 19E), where the pipeline 7 of FIG. 19 is the pipeline of the run-to-completion processor 4 of FIG. 1. The hash generating circuit 300 includes a modulo-2 multiplier 301, a multiplier value providing circuit 302, a nonlinearizing function circuit 303, a first modulo-2 summer circuit 304, a modulo-2 divider circuit 305, a second modulo-2 summer circuit 306, and a multiplexer circuit 307. In operation, a 64-bit incoming data value (denoted here as D(X)) is supplied to the hash generating circuit 300 via input conductors 308 onto a first set of input leads 309 of the multiplier 301. A 64-bit multiplier value (denoted here as (M(X)) is supplied by the multiplier value providing circuit 302 onto a second set of input leads 310 of the multiplier 301.
Operation of the multiplier value providing circuit 302 is explained in connection with FIG. 12A. Four bits 311, the values of which can be programmed under firmware control as explained in further detail below, are received via some of the input conductors 312 onto the multiplier value providing circuit 302. These four bits 311 set the value of an X4 coefficient bit, the value of an X36 coefficient bit, the value of an X53 coefficient bit, and the value of an X63 coefficient bit, respectively, as shown in FIG. 12A. The value of the X0 coefficient is permanently set to one, and all the other coefficient bits are permanently set to zero. For example, if a 4-bit value 311 of “1111” is supplied to the multiplier value providing circuit 302, then the multiplier value M(X) output by the multiplier providing circuit 302 is: “1000000.00100000.00000000.00010000.00000000.00000000.00000000.00010001”. (Although the multiplier value providing circuit 302 is described here for conceptual and instructional purposes as being separate from and outside of the modulo-2 multiplier 301, in other embodiments the multiplier value providing circuit is simply made to be a part of the modulo-2 multiplier.)
The modulo-2 multiplier circuit 301 performs modulo-2 multiplication of D(X) and M(X) and outputs a 128-bit product value, denoted here as D(X)xM(X)[127:0].
A 64-bit hash register value 313 is stored in the hash result register 314. The hash register value 313 is supplied via input conductors 315 to the programmable nonlinearizing function circuit 303. The programmable nonlinearizing function circuit 303 applies a programmable nonlinearizing function to the 64-bit hash register value 313 and outputs a 64-bit modified hash register value 316. The 64-bit modified hash register value 316 is a Programmably Nonlinearized Version of the Hash Register Value, so it is also referred to here as the PNVHRV. In this particular example, the programmable nonlinearizing function circuit 303 includes sixteen S-box circuits, where each S-box circuit includes one 4-bit S-box and one 4×2:1 multiplexer circuit. For example, the first S-box circuit includes S-box 317 and 4×2:1 multiplexer circuit 318. The programmable nonlinearizing function circuit 303 receives sixteen S-box enable signals 319. Each respective one of the sixteen S-box enable signals 319 is supplied onto the select input lead of a corresponding respective one of the 4×2:1 multiplexer circuits of the S-box circuits. If the S-box enable signal of an S-box circuit is asserted, then the 4×2:1 multiplexer circuit is controlled to supply the 4-bit output of its corresponding S-box onto four of the sixty-four output conductors 320. If, however, the enable signal of the S-box circuit is not asserted, then the 4×2:1 multiplexer circuit is controlled to couple the incoming 4-bit value (that is supplied onto the four inputs of the S-box) onto the four of the sixty-four output conductors 320, thereby bypassing the S-box. In this way, each S-box circuit supplies four bits of the 64-bit value output from the nonlinearizing function circuit 303.
The first modulo-2 summer circuit 304 modulo-2 sums the least significant sixty-four bits of the D(X)xM(X) product value and the 64-bit modified hash register value PNVHRV 316, thereby generating a 64-bit first sum value 321. The 64-bit first sum value 321 is supplied to the modulo-2 divider circuit 305. A modulo-2 sum operation is an XOR operation, so the first summer circuit 304 is labeled “XOR” in FIG. 19E.
The modulo-2 divider circuit 305 modulo-2 divides the 64-bit first sum value 321 by a fixed divisor value (the binary representation of the fixed reducing polynomial G(X)) and outputs the resulting 64-bit remainder value 322. FIG. 21 sets forth the equation of the fixed reducing polynomial G(X) as well as its binary representation (the divisor value).
The 64-bit remainder value 322 and the sixty-four most significant bits of the product value D(X)xM(X) are modulo-2 summed by the second modulo-2 summer circuit 306, thereby generating a second sum value 323. If a hash operation of a hash instruction is being performed by the picoengine, then the 64-bit second sum value 323 passes through multiplexer circuit 307 and out of the hash generating circuit 300. The 64-bit second sum value 323 is conducted via conductors 324 and a multiplexer 325 back to the hash result register 314, and is loaded into the hash result register 314 thereby replacing the previous hash register value that was previously stored in the hash result register 314.
FIG. 12A illustrates how the 4-bit data value field 102 of the “load register file read stage control register” instruction 97 of FIG. 12 sets the multiplier value M(X). The multiplier value is the binary representation of the polynomial as shown in FIG. 12A. If field 99 of the “load register file read stage control register” instruction 97 of FIG. 12 is “10”, then the 4-bit data field 102 of the instruction specifies the values of four particular bits of the multi-bit M(X) multiplier value. As mentioned above, these four bits correspond to four particular ones of the many bits of the M(X) multiplier value, where the multiplier value is the binary representation of the polynomial M(X). All the other bits of the binary representation are permanently fixed to be “0”, except for the least significant bit which is permanently fixed to be “1”. Accordingly, the “load register file read stage control register” instruction is usable to set the M(X) multiplier value used by the hash generating circuit 300. In one novel aspect, in the efficient and small picoengine the number of bits that are programmable using the “load register file read stage control register” instruction is relatively small, and is far fewer than the number of bits in the overall M(X) multiplier value.
FIG. 12B illustrates how the least significant five bits (101, 102) of the second octet of the “load register file read stage control register” instruction 97 of FIG. 12 are usable to program the nonlinearizing function circuit 303 of the hash generating circuit 300. If field 99 of the “load register file read stage control register” instruction 97 of FIG. 12 is “11”, then the remaining five bits of the second octet are decoded and converted into the sixteen S-box enable signals 319 (see FIG. 19E). For example, if the five bits are “10000”, then the S-box enable signals are “0000000000000001”, and all the S-boxes are disabled except for S-box #1, which is enabled. In one novel aspect, in the efficient and small picoengine the S-box enable signals are not directly specified in the “load register file read stage control register” instruction itself, but rather a code of fewer number of bit is specified by the instruction and this code is then decoded to generate the larger number of S-box enable signals.
FIG. 12C is a truth table that illustrates how an S-box performs a nonlinear function on a 4-bit input value, thereby generating a 4-bit output value. In the present example, each S-box is implemented as an identical amount of combinatorial logic that carries out this same nonlinear function.
FIG. 22 sets forth a program of picoengine instructions, the execution of which generates a 16-bit hash value from a 128-bit incoming data value. As explained above, incoming packet data to the picoengine is loaded into the input data register 38. (see FIG. 19H). This 128-bit incoming data value may, for example, be bits taken from the headers of an IPv6 packet. The packet pointer value PP stored in the packet pointer register 36 points to one bit of this data that is stored in the input data register 38, where the bit pointed to is the starting bit of a first 32-bit portion of the 128-bit incoming data value to be hashed.
The first picoengine instruction 400 is a “load register file read stage control register” instruction as described above in connection with FIG. 12 and FIG. 12A, where the value of field 99 is “10” so that execution of the instruction causes the multiplier value M(X) to be set in accordance with the values of the least significant four bits of the second octet of the instruction.
The second picoengine instruction 401 is also a “load register file read stage control register” instruction, but in the case of the second instruction field 99 is “11” so that execution of the instruction causes selected ones of the S-box circuits of the nonlinearizing function circuit 303 to be enabled. In the specific case of instruction 401, all the S-box circuits are enabled.
The third picoengine instruction 402 is a “hash load” or “hash set” instruction. This instruction causes the value of the register RA 214 to be zero, and causes the multiplexer circuit 307 to be controlled so that the 64-bit incoming data value supplied onto the first set of input leads 309 of the multiplier 301 is supplied through multiplexer circuit 307 and onto conductors 324. Accordingly, execution of the third instruction 402 results in the zero value passing through the hash generating circuit 330 and being loaded into the hash register 314, thereby effectively clearing the hash register 314.
The fourth picoengine instruction 403 is a hash instruction. The instruction causes the 32-bit value stored in the input data register 38 (see FIG. 19H), the first bit of which is pointed to by the packet pointer PP value, to be supplied onto the first set of input leads 309 of the multiplier 301. The 64-bit zero value stored in the hash register 314 is supplied to the nonlinearizing function circuit 303. The 64-bit hash result generated by the hash generating circuit 300 is output onto conductors 324, and is supplied back via conductors 324 to the hash register 314, and overwrites the prior value (zero) stored in the hash register 314. The fourth instruction also updates the packet pointer value so that the packet pointer PP value points to the first bit of the next 32-bit portion of data stored in the input data register 38. Although the hardware data path through the hash generating circuit 300 is sixty-four bits wide, only the least significant thirty-two bits are used in this example so that a 32-bit data value is hashed.
The fifth picoengine instruction 404 is another hash instruction, but in the execution of this hash instruction the value previously stored in the hash register 314 is supplied to the nonlinearizing function circuit 303. The 64-bit hash result generated by the hash generating circuit 300 is output onto conductors 324, and is supplied back via conductors 324 to the hash register 314, and overwrites the prior value stored in the hash register 314. The fifth instruction also updates the packet pointer value so that the packet pointer value points to the first bit of the next 32-bit portion of data stored in the input data register 38. As mentioned above, although the hardware data path through the hash generating circuit 300 is sixty-four bits wide, only a 32-bit data value is being hashed.
The sixth and seventh picoengine instructions 405 and 406 are another pair of hash instructions. Each of these hash instructions receives a different 32-bit portion of the incoming data value from input data register 38. Once all four of the 32-bit portions of the 128-bit incoming data value have been processed through the hash generating circuit 300, then one final hash operation is performed. In this final hash operation, the 64-bit incoming data value supplied onto the first set of input leads of the multiplier 301 is set to zero. The eighth picoengine instruction 407 performs this operation. The second octet of this eighth picoengine instruction 407 specifies that the incoming data value is zero. At the conclusion of execution of the eighth picoengine instruction 407, the final 64-bit hash value is present in the 64-bit hash register.
The ninth picoengine instruction 408 pops the stack and uses the eight bits obtained, along with the fifty-six least significant bits of the 64-bit hash value stored in the hash register, to do a lookup in table 0 in a local transactional memory. The eight bits popped off the stack are supplied to shifter 326 via input leads 327, and the fifty-six bits of the 64-bit hash value is supplied to shifter 326 via input leads 328, and the shifter 326 outputs a concatenated result that is then supplied to a transactional local memory. There is a “table 0 config” in the transactional memory. This “table 0 config” specifies that the least significant sixteen bits of the value supplied to the transactional memory will be used in the lookup operation. The other bits of the value supplied to the transactional memory will be ignored in the lookup operation. The transactional memory then uses the sixteen bits to do a lookup operation into an addressed one of 216 hash buckets in the transactional memory. The transactional memory returns an indication of whether the addressed hash bucket contains a 128-bit hash bucket entry that matches the original 128-bit IPv6 value that was hashed. If the hash bucket contains such an entry, then the transactional memory also returns a “lookup output information value” associated with the matching entry. The lookup output information value may, for example, indicate an output port onto which the IPv6 packet is to be output.
FIGS. 23A-23G together form a larger diagram of FIG. 23. FIG. 23 sets forth a complete hardware description (in the CDL hardware description language) of a particular embodiment of the hash generating circuit 300. In order to realize this embodiment of the hash generating circuit 300, a commercially available hardware synthesis program (for example, Synopsis Design Compiler) is employed to generate digital logic circuitry from the CDL hardware description language description.
Although a particular embodiment of the novel hash generating circuit 300 is illustrated and described above for illustrative and instruction purposes, it is to be understood that there are many different ways to implement the novel hash generating circuit 300 in circuitry, and that these ways will be evident to a circuit designer familiar with hashing and with modulo-2 circuit design after reading this patent document. Operations of the overall function performed by the hash generating circuit can be performed in different orders and in different ways in different embodiments, with the overall function of all of these embodiments nevertheless being mathematically and functionally the same. For example, such a different embodiment can be obtained by performing a manipulation of the governing equation, and then implementing circuitry that performs the various sub-operations represented by the form of that manipulated equation. The present disclosure encompasses all such embodiments, including all such embodiments that would be generated by standard commercially available hardware synthesis tools once a functional description of the novel hash generating circuit 300 has been properly supplied to the tool. Accordingly, in one example of the present invention, a novel processor comprises: 1) a hash register that stores a hash register value, 2) an input data register that stores an incoming data value, and 3) the hash generating circuit that generates a hash value, where the hash value is given by the modulo-2 polynomial equation: ((D(X)*M(X))+(PNVHRV(X)+XΓ))% G(X), where D(X) is the incoming data value polynomial to be hashed, where M(X) is a multiplier value polynomial, where G(X) is a reducing generator polynomial, where PNVHRV is a programmably nonlinearized version of the hash register value, where +X64 denotes an operation of taking the most significant sixty-four bits, and where % G(X) denotes an operation of obtaining the remainder of a modulo-2 divide by G(X) and adding in that remainder value.
Although certain specific embodiments are described above for instructional purposes, the teachings of this patent document have general applicability and are not limited to the specific embodiments described above. Accordingly, various modifications, adaptations, and combinations of various features of the described embodiments can be practiced without departing from the scope of the invention as set forth in the claims.

## Claims

1. A processor comprising:
a fetch stage that fetches a hash instruction;
a decode stage that decodes the hash instruction;
a register file read stage coupled to the decode stage, wherein the register file read stage includes a hash register; and
an execute stage that executes the hash instruction, wherein the execute stage comprises an ALU (arithmetic logic unit) and a hash generating circuit, wherein the hash generating circuit comprises:
a modulo-2 multiplier that receives an incoming data value on a first set of the input leads and receives a multiplier value on a second set of input leads and that, as a result of execution of the hash instruction, multiplies the incoming data value by the multiplier value and outputs a product value, wherein the product value comprises a first portion and a second portion;
a nonlinearizing function circuit that receives a hash register value stored in the hash register and that outputs a programmably nonlinearized version of the hash register value (PNVHRV);
a first modulo-2 summer that receives the first portion of the product value and that receives the PNVHRV and that outputs a first sum value;
a modulo-2 divider that receives the first sum value and that divides the sum value by a fixed divisor value and that outputs a division remainder value; and
a second modulo-2 summer that receives the division remainder value from the modulo-2 divider and that receives the second portion of the product value from the modulo-2 multiplier and that outputs a second sum value, wherein execution of the hash instruction causes the second sum value to be loaded into the hash register.

2. The processor of claim 1, wherein the nonlinearizing function circuit receives a multi-bit enable signal, wherein the PNVHRV comprises a first portion and a second portion, and wherein the nonlinearizing function circuit comprises:
a first S-box circuit that receives a first portion of the hash register value and that receives a first bit of the multi-bit enable signal and that outputs the first portion of the PNVHRV; and
a second S-box circuit that receives a second portion of the hash register value and that receives a second bit of the multi-bit enable signal and that outputs the second portion of the PNVHRV.

3. The processor of claim 2, wherein if the multi-bit enable signal has a particular multi-bit value then the nonlinearizing function circuit outputs the PNVHRV such that the PNVHRV is the same as the hash register value received by the nonlinearizing function circuit.

4. The processor of claim 2, wherein execution of an instruction by the processor causes the multi-bit enable signal to be set to a programmable multi-bit value determined by the instruction.

5. The processor of claim 1, wherein execution of an instruction by the processor causes the multiplier value to be set to a programmable one of a plurality of values, wherein the one value to which the multiplier value is set is determined by the instruction.

6. The processor of claim 1, wherein the hash generating circuit further comprises:
a multiplexer circuit that has a first set of input leads, a second set of input leads, and a set of output leads, wherein the first set of input leads is coupled to receive the incoming data value, wherein the second set of input leads is coupled to receive the second sum value from the second modulo-2 summer, and wherein the set of output leads is coupled to supply second sum value to the hash register.

7. The processor of claim 6, wherein execution of a hash register load instruction by the processor causes a value on the first set of input leads of the modulo-2 multiplier of the hash generating circuit to pass through the multiplexer circuit and to be loaded into the hash register.

8. The processor of claim 1, wherein the processor has no instruction counter.

9. The processor of claim 8, wherein the processor outputs no address value, and wherein the processor cannot write to any memory.

10. The processor of claim 1, wherein the processor has no instruction counter and only fetches instructions either: as a result of being prompted from the outside by an incoming input data value or an incoming initial fetch information value, or as a result of execution of a fetch instruction.

11. The processor of claim 1, wherein the processor has an input data register that receives and stores an amount of incoming data, and wherein the hash instruction specifies a portion of the amount of incoming data stored in the input data register that is then supplied onto the first set of input leads of the modulo-2 multiplier.

12. The processor of claim 11, wherein the processor has a packet pointer register that stores a packet pointer value, wherein the packet pointer value identifies a start of the portion of the amount of incoming data in the input data register, and wherein the packet pointer value is changed to identify a start of a next amount of the incoming data upon completion of the hash instruction.

13. The processor of claim 12, wherein the amount of incoming data stored in the input data register is a first number of bits, wherein the portion is a second number of bit, and wherein the first number is at least four times larger than the second number.

14. A processor comprising:
a hash generating circuit comprising:
a modulo-2 multiplier that receives an incoming data value and receives a multiplier value and that, as a result of execution of a hash instruction, multiplies the incoming data value by the multiplier value and outputs a product value,

wherein the product value comprises a first portion and a second portion;
a nonlinearizing function circuit that receives a hash register value stored in a hash register and that receives a multi-bit enable signal and that outputs a programmably nonlinearized version of the hash register value (PNVHRV);
a first modulo-2 summer that receives the first portion of the product value and that receives the PNVHRV and that outputs a first sum value;
a modulo-2 divider that receives the first sum value and that divides the sum value by a fixed divisor value and that outputs a division remainder value; and
a second modulo-2 summer that receives the division remainder value from the modulo-2 divider and that receives the second portion of the product value from the modulo-2 multiplier and that outputs a second sum value, wherein execution of the hash instruction causes the second sum value to be loaded into the hash register; and

means for: 1) fetching the hash instruction, 2) supplying the incoming data value to the modulo-2 multiplier, 3) setting the multiplier value, and 4) supplying the multi-bit enable signal to the non-linearizing function circuit, wherein the hash register is a part of the means.

15. The processor of claim 14, wherein the nonlinearizing function circuit comprises:
a first S-box circuit that receives a first portion of the hash register value and that receives a first bit of the multi-bit enable signal and that outputs a first portion of the PNVHRV; and
a second S-box circuit that receives a second portion of the hash register value and that receives a second bit of the multi-bit enable signal and that outputs a second portion of the PNVHRV.

16. The processor of claim 14, wherein if the multi-bit enable signal has a particular multi-bit value then the nonlinearizing function circuit outputs the PNVHRV such that the PNVHRV is the same as the hash register value received by the nonlinearizing function circuit.

17. The processor of claim 14, wherein the means includes an input data register that receives and stores an amount of incoming data, and wherein the hash instruction specifies a portion of the amount of incoming data stored in the input data register that is then supplied to the modulo-2 multiplier.

18. The processor of claim 17, wherein the means further includes a packet pointer register that stores a packet pointer value, wherein the packet pointer value identifies a start of the portion of the amount of incoming data in the input data register, and wherein the packet pointer value is changed to identify a start of a next amount of the incoming data upon completion of the hash instruction.

19. The processor of claim 18, wherein the amount of incoming data stored in the input data register is a first number of bits, wherein the portion is a second number of bit, and wherein the first number is at least four times larger than the second number.

20. A processor comprising:
a hash register; and
a hash generating circuit comprising:
a modulo-2 multiplier that receives an incoming data value and that, as a result of execution of a hash instruction, multiplies the incoming data value by a multiplier value and outputs a product value, wherein the product value comprises a first portion and a second portion;
an S-box circuit that comprises a plurality of S-boxes, wherein the S-box circuit receives a hash register value stored in the hash register and outputs a programmably modified version of the hash register value;
a first modulo-2 summer that receives the first portion of the product value and that receives the programmably modified version of the hash register value and that outputs a first sum value;
a modulo-2 divider that receives the first sum value and that divides the sum value by a value and that outputs a division remainder value; and
a second modulo-2 summer that receives the division remainder value from the modulo-2 divider and that receives the second portion of the product value from the modulo-2 multiplier and that outputs a second sum value, wherein execution of the hash instruction by the processor causes the second sum value to be loaded into the hash register.

21. A processor comprising:
a hash register that stores a hash register value;
an input data register that stores an incoming data value; and
means for generating a hash value given by the modulo-2 polynomial equation:
((D(X)*M(X))+(PNVHRV(X)+X64)) % G(X), wherein D(X) is an incoming data value polynomial to be hashed, wherein M(X) is a multiplier value polynomial, wherein G(X) is a reducing generator polynomial, wherein PNVHRV is a programmably nonlinearized version of the hash register value, wherein +X64 denotes an operation of taking the most significant sixty-four bits, and wherein % G(X) denotes an operation of obtaining the remainder of a modulo-2 divide by G(X) and adding in that remainder value.