Techniques for facilitating cracking and fusion within a same instruction group
US-10671393-B2 · Jun 2, 2020 · US
US11748104B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11748104-B2 |
| Application number | US-202016941969-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 29, 2020 |
| Priority date | Jul 29, 2020 |
| Publication date | Sep 5, 2023 |
| Grant date | Sep 5, 2023 |
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.
Technology for fusing certain load instructions and compare-immediate instructions in a computer processor having a load-store architecture with respect to transferring data between memory and registers of the computer processor. In some embodiments the load and compare-immediate instructions are consecutive. In some embodiments, the instructions are only merged if: (i) the respective RA and RT fields of the two instructions match; (ii) the immediate field of the compare-immediate instruction has a certain value, or falls within a range of certain values; and/or (iii) the instructions are received in a consecutive manner.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method (CIM) comprising: receiving, by an instruction fetch unit of a load-store architecture style processor, a load instruction including an RT field value; receiving, by the instruction fetch unit, a compare-immediate instruction including an RA field value; determining, by the instruction fetch unit, that the RT field value is the same as the RA field value; and responsive to the determination that the RA field value is the same as the RT field value, fusing, by the instruction fetch unit, the load instruction and the compare-immediate instruction to form a single fused instruction determining, by the instruction fetch unit, that an immediate field of the compare-immediate instruction has a value of 0, 1, or −1; wherein the fusion is further responsive to the determination that an immediate field of the compare-immediate instruction has a value of 0, 1, or −1. 2. The CIM of claim 1 wherein the load instruction and the compare-immediate instruction are consecutive instructions. 3. A non-transitory computer program product (CPP) comprising: a set of storage device(s); and computer code stored collectively in the set of storage device(s), with the computer code including data and instructions to cause a processor(s) set to perform at least the following operations: receiving, by an instruction fetch unit of a load-store architecture style processor, a load instruction including an RT field value, receiving, by the instruction fetch unit, a compare-immediate instruction including an RA field value, determining, by the instruction fetch unit, that the RT field value is the same as the RA field value, and responsive to the determination that the RA field value is the same as the RT field value, fusing, by the instruction fetch unit, the load instruction and the compare-immediate instruction to form a single fused instruction determining, by the instruction fetch unit, that an immediate field of the compare-immediate instruction has a value of 0, 1, or −1, wherein the fusion is further responsive to the determination that an immediate field of the compare-immediate instruction has a value of 0, 1, or −1. 4. The CPP of claim 3 wherein the load instruction and the compare-immediate instruction are consecutive instructions. 5. A computer system (CS) comprising: a processor(s) set; a set of storage device(s); and computer code stored collectively in the set of storage device(s), with the computer code including data and instructions to cause the processor(s) set to perform at least the following operations: receiving, by an instruction fetch unit of a load-store architecture style processor, a load instruction including an RT field value, receiving, by the instruction fetch unit, a compare-immediate instruction including an RA field value, determining, by the instruction fetch unit, that the RT field value is the same as the RA field value, and responsive to the determination that the RA field value is the same as the RT field value, fusing, by the instruction fetch unit, the load instruction and the compare-immediate instruction to form a single fused instruction determining, by the instruction fetch unit, that an immediate field of the compare-immediate instruction has a value of 0, 1, or −1, wherein the fusion is further responsive to the determination that an immediate field of the compare-immediate instruction has a value of 0, 1, or −1. 6. The CS of claim 5 wherein the load instruction and the compare-immediate instruction are consecutive instructions.
Instruction operation extension or modification · CPC title
Compare instructions, e.g. Greater-Than, Equal-To, MINMAX · CPC title
LOAD or STORE instructions; Clear instruction · CPC title
Instruction prefetching · CPC title
using instruction pipelines · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.