Information processing apparatus
US-2024385843-A1 · Nov 21, 2024 · US
US9513918B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9513918-B2 |
| Application number | US-201113995974-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 22, 2011 |
| Priority date | Dec 22, 2011 |
| Publication date | Dec 6, 2016 |
| Grant date | Dec 6, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
An apparatus and method are described for permuting data elements with masking. For example, a method according to one embodiment includes the following operations: reading values from a mask data structure to determine whether masking is implemented for each data element of a destination operand; if masking not implemented for a particular data element, then selecting data elements from a first source operand and a second source operand based on index values stored in destination operand to be copied to data element positions within the destination operand, wherein any one of the data elements from either the first source operand and the second source operand may be copied to any one of the data element positions within the destination operand; and if masking is implemented for a particular data element of the destination operand, then performing a designated masking operation with respect to that particular data element.
Opening claim text (preview).
We claim: 1. A processor comprising: non-transitory machine-readable medium including an instruction, which when executed by the processor, causing the processor to perform: reading values from a mask data structure to determine whether masking is implemented for each data element of a destination operand; if masking is not implemented for a particular data element, then selecting one data element from a first source operand and a second source operand based on an index value out of a plurality of index values stored in the destination operand to be copied to a data element position for that particular data element within the destination operand, wherein any one of the data elements from either the first source operand and the second source operand may be copied to any one of data element positions within the destination operand based on the plurality of index values; and if masking is implemented for a particular data element of the destination operand, then performing a designated masking operation with respect to that particular data element, wherein the designated masking operation comprises writing zeroes to each bit within the particular data element. 2. The processor as in claim 1 wherein the destination operand and the first and second source operands are each 128-bits in length. 3. The processor as in claim 2 wherein the data elements are each 32-bits in length. 4. The processor as in claim 2 wherein the data elements are each 16-bits in length. 5. The processor as in claim 2 wherein the data elements are each 64-bits in length. 6. A method for permuting data elements with masking comprising: reading values from a mask data structure to determine whether masking is implemented for each data element of a destination operand; if masking is not implemented for a particular data element, then selecting one data element from a first source operand and a second source operand based on an index value out of a plurality of index values stored in the destination operand to be copied to a data element position for that particular data element within the destination operand, wherein any one of the data elements from either the first source operand and the second source operand may be copied to any one of data element positions within the destination operand based on the plurality of index values; and if masking is implemented for a particular data element of the destination operand, then performing a designated masking operation with respect to that particular data element, wherein the designated masking operation comprises writing zeroes to each bit within the particular data element. 7. The method as in claim 6 wherein the destination operand and the first and second source operands are each 128-bits in length. 8. The method as in claim 7 wherein the data elements are each 32-bits in length. 9. The method as in claim 7 wherein the data elements are each 16-bits in length. 10. The method as in claim 7 wherein the data elements are each 64-bits in length. 11. A computer system to perform permutation operations with masking comprising: a memory for storing program code; and a processor for processing the program code to perform the operations of: reading values from a mask data structure to determine whether masking is implemented for each data element of a destination operand; if masking is not implemented for a particular data element, then selecting one data element from a first source operand and a second source operand based on an index value out of a plurality of index values stored in the destination operand to be copied to a data element position for that particular data element within the destination operand, wherein any one of the data elements from either the first source operand and the second source operand may be copied to any one of data element positions within the destination operand based on the plurality of index values; if masking is implemented for a particular data element of the destination operand, then performing a designated masking operation with respect to that particular data element, wherein the designated masking operation comprises writing zeroes to each bit within the particular data element. 12. The system as in claim 11 wherein the destination operand and the first and second source operands are each 128-bits in length. 13. The system as in claim 12 wherein the data elements are each 32-bits in length. 14. The system as in claim 12 wherein the data elements are each 16-bits in length. 15. The system as in claim 12 wherein the data elements are each 64-bits in length. 16. The system as in claim 11 further comprising: a display adapter to render graphics images in response to execution of the program code by the processor. 17. The system as in claim 16 further comprising: a user input interface to receive control signals from a user input device, the processor executing the program code in response to the control signals.
using instruction pipelines · CPC title
Movement instructions, e.g. MOVE, SHIFT, ROTATE, SHUFFLE · CPC title
Instruction analysis, e.g. decoding, instruction word fields · CPC title
using decoder, e.g. decoder per instruction set, adaptable or programmable decoders · CPC title
Instructions to perform operations on packed data, e.g. vector, tile or matrix operations · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.