# US 2010/0161950 A1 · Semi-absolute branch instructions for efficient computers

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0161950 A1
- Document ID: US20100161950A1
- Status: Published application
- Kind: A1
- Application number: 12/344,151
- Filed: 2008-12-24
- Published: 2010-06-24
- Earliest claimed: 2008-12-24
- Assignees: Sun Microsystems, Inc.
- Inventors: Paul Caprioli; Peter B. Kessler; Christopher A. Vick
- Web page: https://patentgrep.com/patent/US20100161950A1

## CPC

- G06F 9/322: {for non-sequential address}
- G06F 9/324: {using program counter relative addressing}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Apparatus and methods are disclosed for a computation processor that can execute a semi-absolute branch instruction, as well as methods of operation and of generating the semi-absolute branch instruction.

## Claims

### Claim 1

An apparatus comprising:
a memory capable of storing a semi-absolute branch instruction at a memory address, said semi-absolute branch instruction comprising a semi-absolute branch instruction opcode, a semi-absolute branch instruction partial address, and a semi-absolute branch instruction adjust bit; and
a computation processor comprising:
a program-counter comprising a lower bit-range and a higher bit-range, said lower bit-range containing a lower program-counter value;
an instruction fetch logic responsive to the program-counter and configured to access said semi-absolute branch instruction from the memory at said memory address covered by said program-counter;
a first instruction decoder logic configured to recognize said semi-absolute branch instruction opcode; and
a first semi-absolute branch instruction logic, responsive to the first instruction decoder logic configured to replace said lower program-counter value of said lower bit-range of said program-counter with said semi-absolute branch instruction partial address.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein said higher bit-range contains a higher program-counter value and the instruction fetch logic further comprises:
an incrementer array logic comprising a decrementer logic configured to provide a decremented higher bit-range value and an incrementer logic configured to provide an incremented higher bit-range value; and
a higher bit-range selection logic configured to select between said higher program-counter value, said decremented higher bit-range value and said incremented higher bit-range value responsive to said semi-absolute branch instruction partial address and said semi-absolute branch instruction adjust bit.

### Claim 3 (depends on 2)

The apparatus of claim 2, wherein the computation processor further comprises a page transition logic responsive to said semi-absolute branch instruction partial address and said semi-absolute branch instruction adjust bit.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the computation processor further comprises:
a second instruction decoder logic configured to recognize said semi-absolute branch instruction opcode; and
a second semi-absolute branch instruction logic, responsive to said second instruction decoder logic configured to replace said lower program-counter value of said lower bit-range of said program-counter with said semi-absolute branch instruction partial address.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein said semi-absolute branch instruction adjust bit is one of a set of carry-out bits.

### Claim 6

A method for a computation processor to determine a branch target address, said method comprising:
selecting a semi-absolute branch instruction responsive to a program-counter within said computation processor, wherein said semi-absolute branch instruction comprises a semi-absolute branch instruction opcode, a semi-absolute branch instruction partial address, and a semi-absolute branch instruction adjust bit, and wherein said program-counter comprises a lower bit-range and a higher bit-range, said lower bit-range containing a lower program-counter value; and
replacing said lower program-counter value in said lower bit-range with said semi-absolute branch instruction partial address.

### Claim 7 (depends on 6)

The method of claim 6, wherein said higher bit-range contains a higher program-counter value and the method further comprises:
incrementing said higher program-counter value to provide an incremented higher bit-range value;
decrementing said higher program-counter value to provide a decremented higher bit-range value; and
selecting between said higher program-counter value, said decremented higher bit-range value and said incremented higher bit-range value responsive to said semi-absolute branch instruction partial address and said semi-absolute branch instruction adjust bit.

### Claim 8 (depends on 6)

The method of claim 6, wherein said computation processor is in communication with a memory organized into a plurality of memory pages, said program-counter covering a memory address within a first page of said plurality of memory pages, the method further comprising determining whether said branch target address covers a target memory address within a second page of said plurality of memory pages.

### Claim 9

A computer-implemented method for constructing a semi-absolute branch instruction for subsequent execution by a computation processor, said computation processor comprising a program-counter, said semi-absolute branch instruction including a semi-absolute branch instruction operand, said method comprising:
determining a program-counter value from where in a memory said semi-absolute branch instruction will be executed by said computation processor;
determining a branch target address that will replace said program-counter value in said program-counter if execution of said semi-absolute branch instruction were to cause said computation processor to branch, said branch target address comprising a lower bit-range containing a lower program-counter value; and
specifying that said semi-absolute branch instruction operand is to contain said lower program-counter value when said semi-absolute branch instruction is stored at a memory address in said memory that corresponds to said program-counter value for execution by said computation processor when said program-counter contains said program-counter value.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, further comprising:
storing said semi-absolute branch instruction in said memory at said memory address with said lower program-counter value in said semi-absolute branch instruction operand.

### Claim 11 (depends on 10)

The computer-implemented method of claim 10, wherein the storing is performed by a compiler.

### Claim 12 (depends on 10)

The computer-implemented method of claim 10, further comprising reading a load file by a loader and wherein the storing is performed by said loader.

### Claim 13 (depends on 10)

The computer-implemented method of claim 10, wherein said memory address is within a colored memory page.

### Claim 14 (depends on 9)

The computer-implemented method of claim 9, wherein said branch target address further comprises a higher bit-range containing a higher program-counter value, said method further comprising:
specifying a semi-absolute branch instruction adjust bit responsive to whether said higher program-counter value would be subject to an incremental change if execution of said semi-absolute branch instruction were to cause said computation processor to branch.
