System for obtaining correct byte addresses by XOR-ING 2 LSB bits of byte address with binary 3 to facilitate compatibility between computer architecture having different memory orders

• US 5,398,328 A
• Filed: 09/27/1983
• Issued: 03/14/1995
• Est. Priority Date: 08/09/1990
• Status: Expired due to Term

• Current Assignee: MIPS Technologies Incorporated (Wave Computing, Inc.)
• Original Assignee: Silicon Graphics Incorporated (Graphics Properties Holdings, Inc.)
• Inventors: Killian, Earl A., Himelstein, Mark I., Weber, Larry B.
• Primary Examiner(s): Lall, Parshotam S.
• Assistant Examiner(s): Lim, Krisna
• Application Number:
  US08/127,105
• Time in Patent Office: 4,186 Days
• Field of Search: 395/425, 395/500
• US Class Current: 717/143
• CPC Class Codes: G06F 7/768 Data position reversal, e.g. bit reversal, byte swapping
• CPC Class Codes: G06F 9/34 Addressing or accessing the instruction operand or the result ; Formation of operand address; Addressing modes address translation G06F12/00

Abstract

A method and apparatus for enabling a computer to run using either a Big Endian or Little Endian architecture is provided. The method and apparatus use the fact that XORing the lower two bits of a byte address in one architecture with a binary 3 converts that byte address to the equivalent byte address in the other architecture. The conversion method and apparatus is implemented in hardware by setting a bit in a status register indicating a Big Endian or Little Endian architecture in conjunction with an XOR gate which couples the byte address to binary 3. The conversion method and apparatus is implemented in software by scanning the instructions of the input for load and store instructions. The software modifies the instructions by taking the contents of the register and XORing the two least significant bits of the byte address with a binary 3.

Claims

1. A method for converting a program designed to be executed on a computer system employing a first memory order to a program which is executable on a computer system employing a second memory order, the second memory order being the reverse of the first memory order, the method comprising the steps of:

(a) finding all instructions in the program which operate on bytes of data, each of said bytes of data having a byte address, each byte address having two least significant bits;

(b) combining the two least significant bits of each byte address with binary three using an exclusive-OR logic function, thereby generating two complementary bits for each byte address; and

(c) replacing the two least significant bits of each byte address with the two complementary bits, thereby generating a new byte address for each of said bytes of data.

2. The method of claim 1 further comprising the step of detecting whether the program is designed to be executed on a computer system employing the first memory order.

3. The method of claim 2 further comprising the step of detecting the two least significant bits of each byte address.

4. The method of claim 1 wherein the first memory order comprises big endian order, and the second memory order comprises little endian order.

5. The method of claim 1 wherein the first memory order comprises little endian order, and the second memory order comprises big endian order.

7. The computer system of claim 2 further comprising:

means for detecting whether the program is designed to be executed on a computer system employing a second memory order; and

means for detecting the two least significant bits of each byte address.

8. The computer system of claim 2 wherein the first memory order comprises bit endian order, and the second memory order comprises little endian order.

9. The computer system of claim 2 wherein the first memory order comprises little endian order, and the second memory order comprises big endian order.

6. A computer system employing a first memory order which converts and executes programs designed to be executed on computer systems employing a second memory order, the second memory order being the reverse of the first memory order, comprising:

means for finding all instructions in the program which operate on bytes of data, each of said bytes of data having a byte address, each byte address having two least significant bits;

means for combining the two least significant bits of each byte address with binary three, using an exclusive-OR logic function, thereby generating two complementary bits for each byte address; and

means for replacing the two least significant bits of each byte address with the two complementary bits, thereby generating a new byte address for each of said bytes of data.