Abstract:
PROBLEM TO BE SOLVED: To execute a rotate instruction in an execution part of an instruction processing device without reading of a carry flag that requires much time by limiting parallel processing and/or speculative execution. SOLUTION: A rotate instruction which indicates a source operand and a rotate amount is received (221), and a result having the source operand rotated by the rotate amount is stored in a destination operand indicated by the rotate instruction (222), whereby execution of the rotate instruction completes without reading the carry flag (223). COPYRIGHT: (C)2011,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a new instruction that adds three source operands.SOLUTION: A method may comprise receiving an addition instruction. The addition instruction may indicate a first source operand, a second source operand and a third source operand. A sum of the first, second and third source operands may be stored as result of the addition instruction. The sum may be partly stored in a destination operand indicated by the addition instruction and may be partly stored in a plurality of flags. The instructions on other methods, apparatuses, systems, and machine-readable media are also included.
Abstract:
PROBLEM TO BE SOLVED: To provide a new instruction that adds three source operands. SOLUTION: A method may include receiving an add instruction. The add instruction may indicate a first source operand, a second source operand and a third source operand. A sum of the first, second and third source operands may be stored as a result of the add instruction. The sum may be partly stored in a destination operand indicated by the add instruction and may be partly stored in a plurality of flags. The instructions on other methods, apparatuses, systems, and machine-readable mediums are included. COPYRIGHT: (C)2011,JPO&INPIT
Abstract:
Method and apparatus for performing a shift and XOR operation. In one embodiment, an apparatus includes execution resources to execute a first instruction. In response to the first instruction, said execution resources perform a shift and XOR on at least one value.
Abstract:
An apparatus is described that includes an execution unit within an instruction pipeline. The execution unit has multiple stages of a circuit that includes a) and b) as follows. a) a first logic circuitry section having multiple mix logic sections each having: i) a first input to receive a first quad word and a second input to receive a second quad word; ii) an adder having a pair of inputs that are respectively coupled to the first and second inputs; iii) a rotator having a respective input coupled to the second input; iv) an XOR gate having a first input coupled to an output of the adder and a second input coupled to an output of the rotator. b) permute logic circuitry having inputs coupled to the respective adder and XOR gate outputs of the multiple mix logic sections.
Abstract:
A method is described. The method includes executing one or more JH_SBOX_L instructions to perform S-Box mappings and a linear (L) transformation on a JH state and executing one or more JH_P instructions to perform a permutation function on the JH state once the S-Box mappings and the L transformation have been performed.
Abstract:
A number of addition instructions are provided that have no data dependency between each other. A first addition instruction stores its carry output in a first flag of a flags register without modifying a second flag in the flags register. A second addition instruction stores its carry output in the second flag of the flags register without modifying the first flag in the flags register.
Abstract:
An embodiment may include circuitry to execute, at least in part, a first list of instructions and/or to concurrently process, at least in part, first and second buffers. The execution of the first list of instructions may result, at least in part, from invocation of a first function call. The first list of instructions may include at least one portion of a second list of instructions interleaved, at least in part, with at least one other portion of a third list of instructions. The portions may be concurrently carried out, at least in part, by one or more sets of execution units of the circuitry. The second and third lists of instructions may implement, at least in part, respective algorithms that are amenable to being invoked by separate respective function calls. The concurrent processing may involve, at least in part, complementary algorithms.
Abstract:
Eine Verarbeitungsvorrichtung umfasst eine Speichervorrichtung, um Daten zu speichern, und einen Prozessor, um einen Tokenstrom zu erhalten, welcher mehrere Token umfasst, welche auf der Grundlage eines Byte-Stroms erzeugt werden, welcher mehrere Bytes umfasst, einen Graph, welcher mehrere Knoten und Kanten umfasst, auf der Grundlage des Tokenstroms zu erzeugen, auf der Grundlage des Graphen einen Weg zwischen einem ersten Knoten, welcher einem Anfangstoken des Tokenstroms zugeordnet ist, und einem Endknoten zu identifizieren, welcher einem letzten Token des Tokenstroms zugeordnet ist, und eine Entropiecodierung einer Teilmenge von Token durchzuführen, welche der Teilmenge von Knoten zugeordnet sind, um Ausgabedaten zu erzeugen.