Processing header to interpret information regarding a group of instructions

BACKGROUND

0001Designers of instruction set architectures (ISAs) and processors make power and performance trade-offs. As an example, if a designer chooses an ISA with instructions that deliver higher performance then the power consumption by the processor may be higher, as well. Alternatively, if the designer chooses an ISA with instructions that consume lower power, then the performance may be lower. The power consumption may be tied to the amount of hardware resources of the processor, such as arithmetic logic units (ALUs), cache lines, or registers, used by the instructions during execution. Use of a large amount of such hardware resources may deliver higher performance at the cost of higher power consumption. Alternatively, the use of a small amount of such hardware resources may result in lower power consumption at the cost of lower performance.

0002Compilers are used to compile high-level code into instructions compatible with the ISA and the processor architecture <patcit id="pcit0001" dnum="WO2006102664A"><text>WO2006102664</text></patcit> discloses a packet of instructions executing atomically, having a uniquely identifiable header, which provides information about the size of the instructions and/or branch execution.

SUMMARY

0003In one aspect, a method including fetching information regarding a group of instructions, where the group of instructions is configured to execute atomically by a processor, including an encoding format for the information regarding the group of instructions, is provided. The method may further include processing the encoding format to interpret the information regarding the group of instructions.

0004In another aspect, a method including fetching a group header for a group of instructions, where the group of instructions is configured to execute atomically by a processor, where the group header includes a first field for determining an encoding format for the group header and a second field comprising correctness information to determine correctness of the group header, is provided. The method may further include processing the encoding format to interpret the information regarding the group of instructions. The method may further include processing the correctness information to determine the correctness of the group header.

0005In yet another aspect, a method including processing a group of instructions, where the group of instructions is configured to execute atomically by a processor, to generate information regarding the group of instructions, including meta-information regarding the group of instructions and an encoding format for the meta-information, where the encoding format is used to interpret the meta-information, is provided. The method may further include storing the meta-information and the encoding format for subsequent processing by the processor.

0006In yet another aspect, a processor, including a front-end control unit for fetching information regarding a group of instructions, wherein the group of instructions is configured to execute atomically by a processor, including an encoding format for the information regarding the group of instructions, is provided. The processor may further include a format interpretation unit for processing the encoding format to interpret the information regarding the group of instructions, including determining, based at least on the encoding format, at least one of: (a) branch prediction information for the group of instructions, (b) load/store queue information for the group of instructions, (c) exit types information for the group of instructions, (d) an index to at least a portion of an instruction set architecture for the processor, (e) information regarding complexity of load operations and store operations in the group of instructions, or (f) execution requirements for the group of instructions.

0007This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.

BRIEF DESCRIPTION OF THE DRAWINGS

0008The present disclosure is illustrated by way of example and is not limited by the accompanying figures, in which like references indicate similar elements. Elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. <ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">FIG. 1</figref> is a block diagram of a representative processor in accordance with one example;</li><li><figref idref="f0002">FIG. 2</figref> is a block diagram of a group header control unit in accordance with one example;</li><li><figref idref="f0003">FIG. 3</figref> is a block diagram of a format interpretation unit in accordance with one example;</li><li><figref idref="f0004">FIG. 4</figref> is a block diagram of a configurable combination-logic unit in accordance with one example;</li><li><figref idref="f0005">FIG. 5</figref> is a flow diagram of a method in accordance with one example;</li><li><figref idref="f0005">FIG. 6</figref> is a flow diagram of a method in accordance with one example; and</li><li><figref idref="f0006">FIG. 7</figref> is a flow diagram of a method in accordance with one example.</li></ul>

DETAILED DESCRIPTION

0009Examples described in this disclosure relate to instruction set architectures (ISAs) and processors that may have instructions organized in groups, e.g., instruction blocks, that are fetched, executed, and committed atomically. Thus, the processor may fetch the instructions belonging to a single group <i>en masse,</i> map them to the execution resources inside the processor, execute the instructions, and commit their results in an atomic fashion. The processor may either commit the results of all instructions or nullify the execution of the entire group. Instructions inside a group may execute in a data flow order. In addition, the processor may permit the instructions inside a group to communicate directly with each other. An instruction that produces a result may, instead of writing the result to a register file, communicate that result to another instruction that consumes the result. As an example, an instruction that adds the values stored in registers R1 and R2 may be expressed as shown in Table 1: <tables id="tabl0001" num="0001"><table frame="all"><tgroup cols="1" colsep="0"><colspec colnum="1" colname="col1" colwidth="38mm" colsep="1" /><tbody><row><entry>I[0] READ R1 T[2,R];</entry></row><row><entry>I[1] READ R2 T[2,L];</entry></row><row><entry>I[2] ADD T[3,L].</entry></row></tbody></tgroup></table></tables>

0010In this way, source operands are not specified with the instruction; instead, they are specified by the instructions that target the ADD instruction. The compiler may explicitly encode the control and data dependencies during compilation of the instructions and thereby free the processor from rediscovering these dependencies at runtime. This may advantageously result in reduced processor load and energy savings during execution of these instructions. As an example, the compiler may use predication to convert all control dependencies into data flow dependencies. Using these techniques, the number of accesses to power hungry register files may be reduced. Table 2, below, shows an example of a general instruction format for such instructions: <tables id="tabl0002" num="0002"><table frame="all"><tgroup cols="6" rowsep="0"><colspec colnum="1" colname="col1" colwidth="20mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="11mm" /><colspec colnum="4" colname="col4" colwidth="12mm" /><colspec colnum="5" colname="col5" colwidth="20mm" /><colspec colnum="6" colname="col6" colwidth="20mm" /><tbody><row rowsep="1"><entry>OPCODE</entry><entry>PR</entry><entry>BID</entry><entry>XOP</entry><entry>TARGET1</entry><entry>TARGET2</entry></row></tbody></tgroup></table></tables>

0011Each instruction may be of a suitable size, such as 32 bits, 64 bits, or another size. In the example shown in Table 2, each instruction may include an OPCODE field, a PR (predication) field, a BID (broadcast identifier) field, an XOP (extended OPCODE) field, a TARGET1 field, and a TARGET2 field. The OPCODE field may specify a unique operation code for an instruction or a group of instructions, such as add, read, write, or multiply. The PR (predication) field may specify any predication associated with the instruction. As an example, a two bit PR field may be used as follows: 00 - not predicated, 01 - reserved, 10 - predicated on false, and 11 - predicated on true. Thus, for example, if an instruction executes only if the result of a comparison is true, then that instruction may be predicated on the result of another instruction that performs the comparison. The BID (broadcast identifier) field may support sending of an operand to any number of consumer instructions in a group. A 2-bit BID field may be used to encode the broadcast channel the instruction receives one of its operands on. The XOP (extended OPCODE) field may support extending the types of opcodes. The TARGET 1 and TARGET2 fields may allow up to two target instructions to be encoded. The target field may specify a consumer instruction of the result of the producer instruction, thus permitting direct communication between instructions.

0012Each group of instructions may have certain information associated with the group of instructions, such as control information related to the group of instructions. This information may be generated by the compiler during compilation of higher-level code, such as C or C++ into instructions for execution on a processor consistent with the present disclosure. Some of this information may be extracted by the compiler when compiling a group of instructions and by examining the nature of the instructions during runtime. Additionally or alternatively, the information associated with the group of instructions may be meta-information concerning the group of instructions. In one example, such information may be encapsulated in a header associated with the group of instructions. Thus, the group header may include control information and/or meta-information regarding the group of instructions. In one example, this information may advantageously help the processor execute the group of instructions more efficiently. One example of a group header with exemplary fields and the exemplary description of each field is in Table 3 below: <tables id="tabl0003" num="0003"><table frame="all"><tgroup cols="2"><colspec colnum="1" colname="col1" colwidth="39mm" /><colspec colnum="2" colname="col2" colwidth="127mm" /><thead><row><entry valign="top">Field</entry><entry valign="top">Description</entry></row></thead><tbody><row><entry>ID</entry><entry>This field may be set to 1 to indicate the beginning of a valid group of instructions. It may also include information regarding machine version and architecture version.</entry></row><row><entry>SIZE</entry><entry>This field may contain the number of 4 instruction chunks contained in a group of instructions. Thus, for example, a value of 00 may indicate the smallest group of instructions in the group, e.g., a group header followed by 4 instructions. A value of 01 may indicate a group header followed by 8 instructions. A value of 10 may indicate a group header followed by 16 instructions. A value of 11 may indicate a group header followed by 32 instructions. This field may encode the size of the group of instructions in other ways. As an example, this field may specify the precise number of instructions in the group, e.g., a group header followed by seven instructions. As another example, this filed may result in the processing of a function by the processor resulting in information about the size.</entry></row><row rowsep="0"><entry>XFLAGS</entry><entry>This field may include flags that indicate special execution requirements for the group of instructions, such as:</entry></row><row rowsep="0"><entry /><entry>XFLAGS[0] Vector Mode</entry></row><row rowsep="0"><entry /><entry>This flag may indicate that the instructions will be copied into independent vector lanes, each of which may include an instruction window, operand buffers, an ALU, and registers.</entry></row><row rowsep="0"><entry /><entry>XFLAGS [1] Inhibit Branch Predictor</entry></row><row rowsep="0"><entry /><entry>This flag when set may result in the branch predictor being inhibited. This may prevent the branch predictor from predicting which way a branch will go before this is known for sure.</entry></row><row rowsep="0"><entry /><entry>XFLAGS[2] Inhibit Memory Dependence Predictor</entry></row><row rowsep="0"><entry /><entry>This flag when set may result in memory dependence being inhibited. This may prevent the memory dependence predictor from predicting dependencies between memory operations, such as load/store operations.</entry></row><row><entry /><entry>XFLAGS[3] Block Synchronization Required</entry></row><row rowsep="0"><entry /><entry>This flag when set may impose a requirement that another group of instructions may not be executed on another core in parallel with the current group of instructions. In addition, this flag when set may also impose a requirement that the group of instructions may not execute speculatively.</entry></row><row rowsep="0"><entry /><entry>XFLAGS[4] Break After Block</entry></row><row rowsep="0"><entry /><entry>This flag when set may indicate that there is a break after the group of instructions.</entry></row><row rowsep="0"><entry /><entry>XFLAGS[5] Break Before Block</entry></row><row rowsep="0"><entry /><entry>This flag when set may indicate that there is break before the group of instructions.</entry></row><row rowsep="0"><entry /><entry>XFLAGS[6] Reserved</entry></row><row><entry /><entry>This flag may be reserved for future use.</entry></row><row rowsep="0"><entry>EXIT TYPES</entry><entry>This field may encode up to six 3-bit group exit types for use by the branch predictor.</entry></row><row rowsep="0"><entry /><entry>000 - Null</entry></row><row rowsep="0"><entry /><entry>This branch exit type may indicate to the branch predictor that there is no information for the branch predictor in this field.</entry></row><row rowsep="0"><entry /><entry>001 - Sequential</entry></row><row rowsep="0"><entry /><entry>This branch exit type may indicate to the branch predictor that the next branch is to the next group of instructions in the code. The sequential branch exit type may be computed by factoring in the current address of the group of instructions and the size of the group of instructions, e.g., a current block address and the size of the block.</entry></row><row rowsep="0"><entry /><entry>010 - Offset</entry></row><row rowsep="0"><entry /><entry>This branch exit type may indicate to the branch predictor that the next branch is to aa block relative offset address, where the offset is treated as a group offset.</entry></row><row rowsep="0"><entry /><entry>011 - Indirect</entry></row><row><entry /><entry>This branch exit type may indicate to the branch predictor that the next branch is an indirect type. Thus, for example, it may rely on a register or a memory location that contains the address of the beginning of the successor group of instructions and their associated group header.</entry></row><row rowsep="0"><entry /><entry>100 - Call</entry></row><row rowsep="0"><entry /><entry>This branch exit type may indicate to the branch predictor that if the successor group of instructions contains a subroutine call then the predicted branch goes to that successor group of instructions.</entry></row><row rowsep="0"><entry /><entry>101 - Return</entry></row><row><entry /><entry>This branch exit type may indicate to the branch predictor that if the successor group of instructions contains a return from a subroutine call then the predicted branch goes to that successor group of instructions. Other bit patterns may be reserved for future uses.</entry></row><row><entry>STORE MASK</entry><entry>This field may identify the load-store identifiers (LSIDs) that are assigned to stores. As an example, the LSQ block may have to receive each of the LSIDs assigned to stores for a group of instructions before the group of instructions is allowed to complete.</entry></row><row><entry>WRITE MASK</entry><entry>This field may identify the global registers that the group of instructions may write. As an example, the register file may have to receive each entry of writes before the group of instructions is allowed to complete.</entry></row><row><entry>INDEX TO SPECIFICATION</entry><entry>This field may specify an index to an Instruction Set Architecture (ISA) specification. As an example, the ISA specification may include the class of devices that are supported. The class of devices may refer to whether the device is a high-performance device or an Internet-of-Things, mobile devices, wearable devices or other embedded type of devices.</entry></row><row><entry>GROUP CORRECTN ESS</entry><entry>This field may specify a fixed code pattern or a variable pattern, such as a checksum value, to determine whether the current group of instructions is the correct group. In this way, this field may provide a sanity check to ensure that the jump is to a valid group of instructions. In addition, this field may provide enhanced security because a malware related group of instructions will not pass the group correctness check.</entry></row><row><entry>ENCODING FORMAT</entry><entry>This field may provide the processor with information regarding how to determine an encoding format for the header. This field may provide the processor with information concerning how to interpret the remaining fields of the group header based on the encoding format. Thus, for example, with three bits in this field eight different formats for header structures could be encoded. When processed this filed may determine the encoding format for the other fields of this table. Each one of the format for group header structures may include information concerning the fields in that format of the group header structure and the function associated with the fields. As an example, the encoding format could specify the size of the opcodes for a group of instructions.</entry></row><row><entry>LOAD/STORE SPECIFICATION</entry><entry>This field may specify whether the load/store operations associated with the group of instructions are simple or complex. As an example, simple stores may relate to storing committed operand values in disparate memory locations, whereas complex stores may relate to storing committed operand values in shared memory locations.</entry></row></tbody></tgroup></table></tables>

0013While the exemplary group header shown in Table 3 includes many fields, it is merely exemplary. In one embodiment, the compiler may select a certain group header structure based on the nature of instructions and/or based on the nature of the processing requirements, such as high-performance or low-power. This may advantageously allow better balancing of trade-offs between performance and power consumption. For certain types of processing applications, such as high performance computing with a large number of cores, a large group header may be a desirable option. Alternatively, for other types of processing applications, such as embedded processors used in the Internet of Things, mobile devices, wearable devices, or other embedded computing type of applications, a smaller group header may be a desirable option. Thus, in one aspect of this disclosure the group header structure could be tailored to specific processing environments. In another aspect, the group header structure could be tailored depending upon the nature of the instructions in the group of instructions. For example, if the group of instructions includes a loop that is executed several times, then a more extensive group header might be needed to encapsulate the control information corresponding to the group of instructions. The additional control information may allow the processor to execute the loop more efficiently and thus improve performance. Alternatively, if there is a group of instructions that will be rarely executed, then the group header for such a group might be smaller. In another example, if the group of instructions includes a predicated control loop, then the group header structure may be more extensive. Similarly, if the group of instructions has an extensive amount of instruction level parallelism, then the group header structure may be more extensive. The additional control information in the group header could be used to effectively exploit the instruction level parallelism in the group of instructions. In another example, if the group of instructions includes several branch instructions, then the group header could be more extensive. The additional control information regarding branch instructions will make the code execution more efficient as it will result in fewer pipeline flushes.

0014In addition, the functionality corresponding to the fields may be combined or further separated. As an example, while the exemplary group header of Table 3 includes a separate ID field and a SIZE field, these two fields could be combined into a single field. Other changes could be made to the group header structure and format without departing from the scope of this disclosure. As an example, additional fields that include information relating to the characteristics of the group of instructions could be included. Certain fields might be included based on the frequency of the execution of the group of instructions.

0015The fields included in the group header structure, or a similar set of information, may be part of a publicly available standard Instruction Set Architecture (ISA) of a particular processor or a family of processors. A subset of the fields may be a proprietary extension to the ISA. Certain fields may have access to configurable logic array in the processor, such that a state machine could be invoked that could interpret certain bit values in the field differently depending upon the configurable logic array. Thus, a compiled program may have its own proprietary group header structure that would include processing of certain bit values or fields by a configurable logic array. The configuration of the configurable logic array may be changed on-the-fly to allow for group header structures that can only be interpreted by a processor that has the configurable logic array that can handle such functionality. Alternatively, a certain field or bit values in the field may point to a location in a memory, such as a flash memory, which may be configurable to allow for different interpretations of the field or bit values in the field. Thus, certain bit values in the field may be part of the standard ISA for the processor, but certain other bit values in the field may provide proprietary functionality. This exemplary field could allow an ISA designer to add proprietary extensions to the group header structure without disclosing entirely the nature and the functionality associated with the proprietary extension. Thus, in this instance, the compiler distributed by the ISA designer would support the proprietary bit values in the field or an entirely separate proprietary field. The use of such a field may be particularly relevant to hardware accelerators that are proprietary to certain processor designs. Thus, a program may include a group header field that is unrecognizable; but the program may further include a recipe to decipher the field.

0016<figref idref="f0001">FIG. 1</figref> is a block diagram of a portion of a representative processor 100 in accordance with one example of the present disclosure. Processor 100 may include a front-end control unit 102, an instruction cache 104, a branch predictor 106, an instruction decoder 108, an instruction window 110, a left operand buffer 112, a right operand buffer 114, an arithmetic logic unit (ALU) 116, an arithmetic logic unit (ALU) 118, registers 120, and a load/store queue 122. In some instances, the busses may carry only data and instructions; in some instances, the busses may carry only data (e.g., operands); in other instances the busses may carry only control signals, e.g., front-end control unit 102 may communicate, via a bus that carries only control signals, with other control networks. In one example, front-end control unit 102 may include combinational logic and state machines to handle the front end of the processing, including instruction fetch and decode. As an example, front-end control unit 102 may fetch instructions from a L1-cache or another cache for storing into instruction cache 104 and later for processing by instruction decoder 108. Front-end control unit 102 may exchange control information with other portions of processor 100 via control networks. Processor 100 may include a single core or multiple cores. In that case, there may be multiple instances of at least some of the elements shown in <figref idref="f0001">FIG. 1</figref>. Front-end control unit 102 may co-ordinate and manage control of various cores and other parts of the processor. Thus, in this example, groups of instructions may be simultaneously executing on multiple cores and front-end control unit 102 may exchange control information via control networks with other cores to ensure synchronization, as needed, for execution of the various groups of instructions. Front-end control unit 102 may fetch and decode a single instruction or multiple instructions per clock cycle. The decoded instructions may be stored in instruction window 110. Instruction window 110 may include an instruction scheduler 130. Instruction scheduler 130 may keep a ready state of each decoded instruction's inputs, e.g., its predication and operands. When all of its inputs (if any) are ready, the instruction may be woken up by instruction scheduler 130 and be ready to issue. Although <figref idref="f0001">FIG. 1</figref> shows a certain number of components of processor 100 arranged in a certain manner, there could be more or fewer number of components arranged differently.

0017Before an instruction is issued, any operands required by the instruction may be stored in left operand buffer 112 and/or right operand buffer 114 (as needed). Depending on the opcode of the instruction, operations may be performed on the operands using ALU 116 and/or ALU 118 or other functional units. The outputs of an ALU may be stored in an operand buffer or stored in one or more registers 120. Store operations that issue in a data flow order may be queued in load/store queue 122 until the group of instruction commits. When the group of instruction commits, load/store queue 122 may write the committed group's stores to a memory. Branch predictor 106 may process group header information relating to branch exit types and factor that information in making branch predictions.

0018With continued reference to <figref idref="f0001">FIG. 1</figref>, front-end control unit 102 may further include a group header control unit 132. Group header control unit 132 may process control information and meta-information regarding a group of instructions that may be executed atomically. In one example, group header control unit 132 may process group headers for such a group of instructions. As discussed earlier with respect to Table 3 the group header may include control information and/or meta-information regarding the group of instructions. Group header control unit 132 may include combinational logic, state machines, and temporary storage units, such as flip-flops to process the various fields in the group header.

0019<figref idref="f0002">FIG. 2</figref> is a block diagram of a group header control unit 132 and its interface with the remaining portions of processor 100 in accordance with one example. Group header control unit 132 may include a group correctness unit 202, a format interpretation unit 204, an instruction state machine (ISM) 206, and a de-multiplexer 208. Front-end control unit 102 may fetch a cache line (e.g., a 128-bit cache line) from instruction cache 104. Fetching may be performed by fetching one byte at a time, eight bytes at a time, or half of a cache-line at a time, or in other quantities. Instruction decoder 108 may decode the cache line and forward the decoded information to de-multiplexer 208. Under the control of ISM 206, the output of de-multiplexer 208 may be provided to instruction window 110 or format interpretation unit 204. Thus, for example, if the cache line contains a group header, then the output of de-multiplexer 208 may be provided to format interpretation unit 204. Although <figref idref="f0002">FIG. 2</figref> shows a de-multiplexer 208 that outputs the group header, there may not be a de-multiplexer. Instead, as an example, there may be two different ports and thus the group header may be fetched on a port different from a port for fetching instructions. In one example relating to group of instructions with a fixed size (e.g., 32 instructions) the group header will be at the beginning of a group of instructions and thus the initial value of the program counter (PC) will point to the group header. In another example relating to a group of instructions with a variable size (e.g., 32, 64, 96, or 128 instructions), front-end control unit 102 will provide information regarding the size of the group of instructions currently in the instruction window to group header control unit 132. Once group header control unit 132 has this information, it may use it and the PC value to determine the location of the group header. Although <figref idref="f0002">FIG. 2</figref> shows a certain number of components of group header control unit 132 arranged in a certain manner, there could be more or fewer number of components arranged differently.

0020With continued reference to <figref idref="f0002">FIG. 2</figref>, format interpretation unit 204 may receive the group header and forward the entire group header to group correctness unit 202. Alternatively, one output of de-multiplexer 208 may be coupled directly to group correctness unit 202. Group correctness unit 202 may also retrieve, from a memory location (e.g., a flash memory location), a previously stored value for a group correctness field. The previously stored value may specify a fixed code pattern or a variable pattern, such as a previously calculated checksum value on the remaining contents of the group header (e.g., as shown in Table 3). In case the previously stored value is a fixed code pattern, then group correctness unit 202 may compare the fixed code pattern retrieved from the memory with the fixed code pattern extracted from the group correctness field of the group header. If there is a match, then group correctness unit 202 may generate a high value for a correct signal. If there is not a match, then group correctness unit 202 may generate a low value for the correct signal. In one example, this will result in processor 100 realizing that this is an illegal jump to a potentially malformed group of instructions. In one example, processor 100 will generate an exception when the correct signal goes to a low value. In case the previously stored value is a variable pattern, such as a previously calculated checksum on the remaining portion of the group header, then group correctness unit may calculate a checksum on the remaining portion of the group header received as part of the fetching process. Group correctness unit 202 may compare the variable pattern retrieved from the memory with the variable pattern generated based on the remaining portion of the group header. If the two variable patterns (e.g., checksums) match, then group correctness unit 202 may generate a high value for a correct signal. If there is not a match, then group correctness unit 202 may generate a low value for the correct signal. In one example, this will result in processor 100 realizing that this is an illegal jump to a potentially malformed group of instructions In one example, processor 100 will generate an exception when the correct signal goes to a low value. This way processor 100 may advantageously provide secure execution of code by knowing when there is an illegal jump to a malformed group of instructions that might have been placed into the instruction cache or another memory by a hacker. An illegal jump may also advantageously help debug the code during code development.

0021With continued reference to <figref idref="f0002">FIG. 2</figref>, format interpretation unit 204 may process the bit values in the various fields of a group header and generate control signals for use by various hardware elements of processor 100. These hardware elements, include, but are not limited to those shown in <figref idref="f0001">FIG. 1</figref>, including branch predictor 106, instruction decoder 108, instruction scheduler 130, registers 120, and load/store queue 122. In one example, format interpretation unit 204 may process the bit values in the various fields of the group header shown in Table 3 to generate information regarding the group of instructions. In one example, format interpretation unit 204 may generate control information for the group of instructions by processing the field ENCODING FORAMT and determining an encoding format for the information in the group header. In another example, format interpretation unit may generate meta-information for the group of instructions by processing the determined encoding format and the information in the group header. As an example, format interpretation unit 204 may generate a branch predictor signal that may be supplied to branch predictor 106. This signal may provide to branch predictor 106 control information, such as described with respect to the field labeled EXIT TYPES in Table 3. Format interpretation unit 204 may also generate a load/store queue (LSQ) signal that may be supplied to load/store queue 122. This signal may provide to load/store queue 122 control information, such as described with respect to the fields labeled STORE MASK and WRITE MASK in Table 3. Format interpretation unit 204 may also generate execution requirements that may be supplied to other hardware elements, including, e.g., instruction decoder 108 and instruction scheduler 130. These signals may provide control information, such as described with respect to the field labeled XFLAGS in Table 3. Format interpretation unit 204 may also generate an index to an instruction set architecture (ISA) specification. As an example, the ISA specification may include the class of devices that are supported. The class of devices may refer to whether the device is a high-performance device or an Internet-of-Things, mobile devices, wearable devices or other embedded type of devices. The outputs generated by format interpretation unit are merely exemplary and it could generate additional or fewer outputs, as needed. In addition, depending on the bit values in the ENCODING FORMAT field shown in Table 3, format interpretation unit 204 may generate different values of the information provided to the hardware elements. For example, if the ENCODING FOMAT field has k bits, then 2^k different values could be generated for the outputs of format interpretation unit 204.

0022<figref idref="f0003">FIG. 3</figref> is a block diagram of a format interpretation unit 204 in accordance with one example. Format interpretation unit 204 may include a storage unit 302, a first combination-logic unit 304, a second combination-logic unit 306, a third combination-logic unit 308, and a Nth combination-logic unit 310, and multiplexers 320, 322, and 324 that may provide outputs for use by various hardware elements of processor 100 depending on the bit values in the group header. Storage unit 302 may be used to store various fields of a group header (e.g., N fields, where is N is an integer greater than 1, but less than a certain number) GH0, GH1, GH2, and GHN. In one example, the group header could have 128 bits and thus GH0, GH1, GH2, and GHN may contain fields that add up to 128 bits. In one example, these fields may be the fields described with respect to Table 3. The bit values contained in storage unit 302 may be coupled to N combination-logic blocks, including a first combination-logic unit 304, a second combination-logic unit 306, a third combination-logic unit 308, and a Nth combination-logic unit 310. Each of these units may be a hard-coded combination-logic block. Alternatively, at least some or all of these units could be configurable combination-logic blocks. Each combination-logic unit's output may be coupled to N multiplexers, including multiplexers 320, 322, and 324 that may provide outputs for use by various hardware elements of processor 100 depending on the bit values in the group header. Multiplexers 320, 322, and 324 may be controlled using K control bits. The K control bits may be provided by the compiled program and may reflect the selection of a particular group header format and structure. In one example, the K control bits may relate to the ENCODING FORMAT field of Table 3. Although <figref idref="f0003">FIG. 3</figref> shows a certain number of components of format interpretation unit 204 arranged in a certain manner, there could be more or fewer number of components arranged differently.

0023The outputs of the multiplexers may correspond to control signals discussed with respect to <figref idref="f0002">FIG. 2</figref>. As an example, the outputs of multiplexers may include a branch predictor signal, a load/store queue (LSQ) signal, execution requirements, and an index to an ISA, each of which may be supplied to various hardware elements of processor 100. In one example, the branch predictor signal may be generated from a combination of one or more of the group header bits (e.g., 128 bits) stored in storage unit 302 and as processed by first combination-logic unit 304. Alternatively, as shown in <figref idref="f0003">FIG. 3</figref>, in another example, the branch predictor signal may be generated from a combination of one or more of the group header bits (e.g., 128 bits) stored in storage unit 302 and as processed by second combination-logic unit 306. In another example, the load/store (LSQ) signal may be generated from a combination of one or more of the group header bits (e.g., 128 bits) stored in storage unit 302 and as processed by third combination-logic unit 308. In another example, the execution requirements signal may be generated from a combination of one or more of the group header bits (e.g., 128 bits) stored in storage unit 302 and as processed by Nth combination-logic unit 308. In another example, the index to an ISA signal may be generated from a combination of one or more of the group header bits (e.g., 128 bits) stored in storage unit 302 and as processed by Nth combination-logic unit 308. Each of the signal values may further be selected based on the values of the K bits used to control the multiplexers. In each of these examples, all of the bits in a group header (e.g., 128 bits) stored in storage unit 302 may not be processed. Instead, a subset of the bits may be processed. In addition, storage unit 302 could store a larger group header or a smaller group header.

0024<figref idref="f0004">FIG. 4</figref> is a block diagram of a configurable combination-logic unit 400 in accordance with one example. As an example, any of the combination-logic units 304, 306, 308, and 310 may be implemented as shown in <figref idref="f0004">FIG. 4</figref> with respect to configurable combination-logic unit 400. This may advantageously allow a user to change how the encoding format is processed on-the-fly. Alternatively, the combination-logic units could be hard-coded, such that there configuration is fixed and cannot be changed on-the-fly. Configurable combination-logic unit 400 may include an input latch 402, a combination-logic block 404, an output latch 406, and a state latch 408. Each of the three latches may be clocked using the same clock. Input latch 402 may latch bit values in various fields of a group header. Output latch 406 may latch outputs received from combination-logic block 404. State latch 408 may latch state information. Combination-logic block 404 may process the output of input latch 402 and the output of state latch 408 and determine output based on these inputs. Output of output latch 406 may be coupled to multiplexers, e.g., the multiplexers shown in <figref idref="f0003">FIG. 3</figref>. Combination-logic block 404 may be implemented using programmable logic, such as a programmable logic device (PLD) or a Field-Programmable Gate Array (FPGA). Alternatively, combination-logic block 404 may be implemented with a look-up table that is stored in a programmable flash memory. In any of these implementations, because the behavior of combination-logic block 404 can be changed on-the-fly, it may advantageously allow a user to tailor the processing of encoding format and the group header. Although <figref idref="f0004">FIG. 4</figref> shows a certain number of components of configurable combination-logic unit 400 arranged in a certain manner, there could be more or fewer number of components arranged differently. Other techniques may also be used to accomplish the same goal.

0025<figref idref="f0005">FIG. 5</figref> is a flow diagram of a method in accordance with one example. In step 502, as an example, front-end control unit 102 may fetch information regarding a group of instructions, configured to execute atomically by a processor. The information fetched by front-end control unit 102 may include an encoding format for the information regarding the group of instructions. As an example, the information regarding the group of instructions may include control information and/or meta-information regarding the group of instructions.

0026In step 504, as an example, group header control unit 132 may process the information regarding the group of instructions that was fetched in step 502. As an example, the information regarding the group of instructions may be in a form of a group header with several fields, such as the one described with respect to Table 3. Thus, for example, encoding format may be encapsulated in a field of the group header. Using the encoding format, other fields in the group header may be interpreted with the help of format interpretation unit 204, as described, for example, with respect to <figref idref="f0002">FIG.2</figref> and <figref idref="f0003">FIG. 3</figref>. Any of the fields described in Table 3 may be processed as part of this step. As an example, processing in step 504 may include determining branch prediction information for the group of instructions based on the determined encoding format. Step 504 may further include determining load/store queue information for the group of instructions based on the determined encoding format. Step 504 may further include determining an index to at least a portion of an instruction set architecture (ISA) based on the determined encoding format. Step 504 may further include determining information regarding a complexity of load operations and store operations in the group of instructions based on the determined encoding format.

0027<figref idref="f0005">FIG. 6</figref> is a flow diagram of a method in accordance with one example. In step 602, as an example, front-end control unit 102 may fetch a group header for a group of instructions, configured to execute atomically by a processor. The group header fetched by front-end control unit 102 may include a field for determining an encoding format for the group header and another field having correctness information to determine the correctness of the group header. As an example, the group header for the group of instructions may include control information and/or meta-information regarding the group of instructions. The group header may contain several fields, e.g., as described with respect to Table 3.

0028In step 604, as an example, group header control unit 132 may process the encoding format for the group of instructions that was fetched in step 602. Using the encoding format, other fields in the group header may be interpreted with the help of format interpretation unit 204, as described, for example, with respect to <figref idref="f0002">FIG.2</figref> and <figref idref="f0003">FIG. 3</figref>. Any of the fields described in Table 3 may be processed as part of this step. As an example, processing in step 604 may include determining, based on the determined encoding format, branch prediction information for the group of instructions by processing a field comprising such information. Step 604 may further include determining, based on the determined encoding format, load/store queue information for the group of instructions by processing a field comprising such information. Step 604 may further include determining, based on the determined encoding format, an index to at least a portion of an instruction set architecture (ISA) processing a field comprising such information. Step 604 may further include determining, based on the determined encoding format, information regarding a complexity of load operations and store operations in the group of instructions processing a field comprising such information.

0029With continued reference to <figref idref="f0005">FIG. 6</figref>, in step 606, group correctness unit 202 may process the correctness information to determine the correctness of the group header. In one example, the correctness information may be stored as part of a field in the group header. As part of this step, group correctness unit 202 may also retrieve, from a memory location (e.g., a flash memory location), a previously stored value for a group correctness field. The previously stored value may specify a fixed code pattern or a variable pattern, such as a previously calculated checksum value on the remaining contents of the group header (e.g., as shown in Table 3). In case the previously stored value is a fixed code pattern, then group correctness unit 202 may compare the fixed code pattern retrieved from the memory with the fixed code pattern extracted from the group correctness field of the group header. As part of this step, group correctness unit 202 may also compare the variable pattern retrieved from the memory (e.g., a previously calculated checksum based on a content of the remaining fields of a good known group header for the group of instructions) with the variable pattern (e.g., a calculated checksum based on a content of the remaining fields in the group header) generated based on the remaining portion of the group header.

0030<figref idref="f0006">FIG. 7</figref> is a flow diagram of a method in accordance with one example. As an example, this method relates to a compiler analyzing a group of instructions and generating or selecting a group header for the group of instructions. In step 702, a suitable compiler may process a group of instructions, configured to execute atomically by a processor, to generate information regarding the group of instructions, including meta-information regarding the group of instructions and an encoding format for the group of instructions. Some programs may be compiled for only one set of ISA, e.g., an ISA used with processors for Internet of Things, mobile devices, wearable devices, or other embedded computing environments. Compiler may use techniques, such as static code analysis or code profiling to generate the information relevant to the group of instructions. Complier may consider factors, such as the characteristics of the group of instructions and the frequency of the execution of the group of instructions. The relevant characteristics of the group of instructions, include, but are not limited to: (1) the instruction level parallelism, (2) the number of loops, (3) the number of predicated control instructions, and (4) the number of branch predictions. One example of a simplified 128 bit group header is shown in Table 4 below: <tables id="tabl0004" num="0004"><table frame="all"><tgroup cols="8" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="37mm" /><colspec colnum="2" colname="col2" colwidth="30mm" /><colspec colnum="3" colname="col3" colwidth="20mm" /><colspec colnum="4" colname="col4" colwidth="21mm" /><colspec colnum="5" colname="col5" colwidth="20mm" /><colspec colnum="6" colname="col6" colwidth="18mm" /><colspec colnum="7" colname="col7" colwidth="13mm" /><colspec colnum="8" colname="col8" colwidth="9mm" /><tbody><row rowsep="1"><entry>127</entry><entry>115 114</entry><entry>112 111</entry><entry>64 63</entry><entry>32 31</entry><entry>14 13</entry><entry>6 5</entry><entry>1 0</entry></row><row rowsep="1"><entry colsep="1">GROUP CORRECTNESS</entry><entry colsep="1">ENCODING FORMAT</entry><entry colsep="1">WRITE MASK</entry><entry colsep="1">STORE MASK</entry><entry colsep="1">EXIT TYPES</entry><entry colsep="1">XFLAGS</entry><entry colsep="1">SIZE</entry><entry colsep="1">ID</entry></row></tbody></tgroup></table></tables>

0031One example of an exemplary program in a high-level language and its compilation into groups of instructions, including group headers (with exemplary structure shown in Table 4), is shown below:

0032Program: <pre listing-type="program-listing"> int main() { int a = 1; int b = 1; int c; for (;;) { c= a + b; if (c >= 100) break; a=b; b = c; } return c: }</pre>

0033Compiled program with groups of instructions and group headers: <tables id="tabl0005" num="0005"><table frame="none"><tgroup cols="5" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="12mm" /><colspec colnum="2" colname="col2" colwidth="24mm" /><colspec colnum="3" colname="col3" colwidth="24mm" /><colspec colnum="4" colname="col4" colwidth="36mm" /><colspec colnum="5" colname="col5" colwidth="26mm" /><tbody><row><entry>blk0</entry><entry /><entry /><entry /><entry /></row><row><entry /><entry /><entry /><entry /><entry /></row><row><entry /><entry namest="col2" nameend="col3" align="left">header 0, 1, 0, 1, 0, 0, 01, 001</entry><entry /><entry /></row><row><entry /><entry>movi</entry><entry>g3, 1</entry><entry>  ; [0] W[3]</entry><entry /></row><row><entry /><entry>movi</entry><entry>g4, 2</entry><entry>  ; [1] W[4]</entry><entry /></row><row><entry /><entry /><entry /><entry /><entry /></row><row><entry /><entry>bro</entry><entry>blk1</entry><entry>  ; [2]</entry><entry /></row><row><entry>blk1</entry><entry /><entry /><entry /><entry /></row><row><entry /><entry namest="col2" nameend="col3" align="left">header 1, 0, 0, 10, 0, 24, 01, 001</entry><entry /><entry /></row><row><entry /><entry>read</entry><entry>t3, g3</entry><entry>  ; [0] N[2,L]</entry><entry /></row><row><entry /><entry>read</entry><entry>t4, g4</entry><entry>  ; [1] N[4,R] N[3,L]</entry><entry /></row><row><entry /><entry>mov</entry><entry>t5, t3</entry><entry>  ; [2] N[4,L]</entry><entry /></row><row><entry /><entry>mov</entry><entry>g3, t4</entry><entry>  ; [3] W[3]</entry><entry /></row><row><entry /><entry /><entry>add</entry><entry>g4, t5, t4</entry><entry>; [4] N[5,L] W[4]</entry></row><row><entry /><entry /><entry>tlei</entry><entry>p0, t4, 99</entry><entry>; [5] B[1,P]</entry></row><row><entry /><entry>bro_t<p0></entry><entry>blk1</entry><entry>  ; [6] B1</entry><entry /></row><row><entry /><entry>bro_f<p0></entry><entry>blk2</entry><entry>  ; [7] B1</entry><entry /></row><row><entry>blk2</entry><entry /><entry /><entry /><entry /></row></tbody></tgroup></table></tables>

0034In the example above, the groups of instructions include instructions, such as read, mov, and add. The read instruction is used to read values of operands from registers. The mov instruction is used to move or copy operands to one or more targets. The add instruction is used to add the two operands provided as part of this instruction. In addition, there are other instructions that illustrate the conversion of a control loop into predicated data flow instructions. The tlei p0, t4, 99 instruction is a "test less than or equal immediate" instruction. As part of this instruction, the operand value of the instruction is compared with an immediate value (e.g., 99) and if the operand value is less than or equal to the immediate value, then a true value is produced; otherwise, a false value is produced. This predicate (true or false) may be broadcast on a channel and may be received as their first operand by bro_t<p0> blk1 instruction and bro_f<p0> blk2 instruction. The bro_t<p0> blk1 instruction is a "branch with offset" instruction predicated on the result of the tlei instruction being a true value. Similarly, the bro_f<p0> blk2 instruction is a "branch with offset" instruction predicated on the result of the tlei instruction being a false value. Thus, if the result of the tlei instruction is a true value, then the instruction bro_t<p0> blk1 will be executed. Alternatively, if the result of the tlei instruction is a false value, then the instruction bro_f<p0> blk2 will be executed. In this example, the ENCODING FORMAT filed is set to 01. In one example, when processed by format interpretation unit 204 of <figref idref="f0002">FIG. 2</figref>, these bit values may determine the values for the various control inputs, such as exit types. In addition, in this example, the GROUP CORRECTNESS field is set to 001, which could be used to determine whether the group header is correct, as discussed earlier.

0035With continued reference to <figref idref="f0006">FIG. 7</figref>, in step 704, compiler may store the meta-information, the control information (e.g., as shown in the exemplary group headers above) and the encoding format for subsequent processing by a processor, such as processor 100. That processing may include the steps described with respect to <figref idref="f0005">FIG. 5 and 6</figref>, respectively.

0036In conclusion, a method, including fetching a group header for a group of instructions, where the group of instructions is configured to execute atomically by a processor, where the group header includes a first field for determining an encoding format for the group header and a second field comprising correctness information to determine correctness of the group header, is provided. The method may further include processing the encoding format to interpret the information regarding the group of instructions. The information regarding the group of instructions may include at least one of: (1) control information regarding the group of instructions, or (2) meta-information regarding the group of instructions. The method may further include determining, based at least on the encoding format, at least one of: (1) branch prediction information for the group of instructions, (2) load/store queue information for the group of instructions, (3) exit types information for the group of instructions, (4) an index to at least a portion of an instruction set architecture for the processor, (5) information regarding a complexity of load operations and store operations in the group of instructions.

0037In addition, a processor, including means for fetching information regarding a group of instructions, wherein the group of instructions is configured to execute atomically by a processor, including an encoding format for the information regarding the group of instructions, is provided. The processor may further include a means for processing the encoding format to interpret the information regarding the group of instructions, including determining, based at least on the encoding format, at least one of: (a) branch prediction information for the group of instructions, (b) load/store queue information for the group of instructions, (c) exit types information for the group of instructions, (d) an index to at least a portion of an instruction set architecture for the processor, (e) information regarding complexity of load operations and store operations in the group of instructions, or (f) execution requirements for the group of instructions. In one example, the means for fetching may be front-end control unit 102 of <figref idref="f0001">FIG. 1</figref>. In addition, in one example, the means for processing the encoding format may be format interpretation unit 204 of <figref idref="f0002">FIG. 2</figref>. In this exemplary processor, the information regarding the group of instructions may further include correctness information and the processor may further include means determining the correctness of the group of instructions based on the correctness information. In one example, the means for determining the correctness may be a group correctness unit 202 of <figref idref="f0002">FIG. 2</figref>.

0038It is to be understood that the methods, modules, and components depicted herein are merely exemplary. Alternatively, or in addition, the functionally described herein can be performed, at least in part, by one or more hardware logic components. For example, and without limitation, illustrative types of hardware logic components that can be used include Field-Programmable Gate Arrays (FPGAs), Application-Specific Integrated Circuits (ASICs), Application-Specific Standard Products (ASSPs), System-on-a-Chip systems (SOCs), Complex Programmable Logic Devices (CPLDs), etc. In an abstract, but still definite sense, any arrangement of components to achieve the same functionality is effectively "associated" such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as "associated with" each other such that the desired functionality is achieved, irrespective of architectures or inter-medial components. Likewise, any two components so associated can also be viewed as being "operably connected," or "coupled," to each other to achieve the desired functionality.

0039The functionality associated with the examples described in this disclosure can also include instructions stored in a non-transitory media, e.g., instruction cache 104 or other types of non-transitory media. The term "non-transitory media" as used herein refers to any media storing data and/or instructions that cause a machine, such as processor 100, to operate in a specific manner. Exemplary non-transitory media include non-volatile media and/or volatile media. Non-volatile media include, for example, a hard disk, a solid state drive, a magnetic disk or tape, an optical disk or tape, a flash memory, an EPROM, NVRAM, PRAM, or other such media, or networked versions of such media. Volatile media include, for example, dynamic memory, such as, DRAM, SRAM, a cache, or other such media. Non-transitory media is distinct from, but can be used in conjunction with transmission media. Transmission media is used for transferring data and/or instruction to or from a machine, such as processor 100. Exemplary transmission media, include coaxial cables, fiber-optic cables, copper wires, and wireless media, such as radio waves.

0040Furthermore, those skilled in the art will recognize that boundaries between the functionality of the above described operations are merely illustrative. The functionality of multiple operations may be combined into a single operation, and/or the functionality of a single operation may be distributed in additional operations. Moreover, alternative embodiments may include multiple instances of a particular operation, and the order of operations may be altered in various other embodiments.

0041Although the disclosure provides specific examples, various modifications and changes can be made without departing from the scope of the disclosure as set forth in the claims below. Accordingly, the specification and figures are to be regarded in an illustrative rather than a restrictive sense, and all such modifications are intended to be included within the scope of the present invention. Any benefits, advantages, or solutions to problems that are described herein with regard to a specific example are not intended to be construed as a critical, required, or essential feature or element of any or all the claims.

0042Furthermore, the terms "a" or "an," as used herein, are defined as one or more than one. Also, the use of introductory phrases such as "at least one" and "one or more" in the claims should not be construed to imply that the introduction of another claim element by the indefinite articles "a" or "an" limits any particular claim containing such introduced claim element to inventions containing only one such element, even when the same claim includes the introductory phrases "one or more" or "at least one" and indefinite articles such as "a" or "an." The same holds true for the use of definite articles.

0043Unless stated otherwise, terms such as "first" and "second" are used to arbitrarily distinguish between the elements such terms describe. Thus, these terms are not necessarily intended to indicate temporal or other prioritization of such elements.