Efficiently calculating a branch target address

Details Efficiently calculating a branch target address Efficiently calculating a branch target address

2005-09-20

2005-09-20

Coleman, Eric (Department: 2183)

Electrical computers and digital processing systems: processing

Processing control

Branching

C712S213000

Reexamination Certificate

active

06948053

ABSTRACT:
A method and system for calculating a branch target address. Upon fetching a branch instruction from memory, the n−1 lower order bits of the branch target address may be pre-calculated and stored in the branch instruction prior to storing the branch instruction in the instruction cache. Upon retrieving the branch instruction from the instruction cache, the upper order bits of the branch target address may be recovered using the sign bit and the carry bit stored in the branch instruction. The sign bit and the carry bit may be used to select one of three possible upper-order bit value combinations of the branch target address. The selected upper-order bit value combination may then be appended to the n−1 lower order bits of the branch target address to form the complete branch target address.

REFERENCES:
patent: 5142634 (1992-08-01), Fite et al.
patent: 5367649 (1994-11-01), Cedar
patent: 5522053 (1996-05-01), Yoshida et al.
patent: 5737561 (1998-04-01), Dulong
patent: 5778423 (1998-07-01), Sites et al.
patent: 5790845 (1998-08-01), Shimada et al.
patent: 5796998 (1998-08-01), Levitan et al.
patent: 5832260 (1998-11-01), Arora et al.
patent: 5878254 (1999-03-01), Shimada et al.
patent: 5907714 (1999-05-01), Boutaud et al.
patent: 6167506 (2000-12-01), Witt
patent: 6237087 (2001-05-01), O'Connor
patent: 6279106 (2001-08-01), Roberts
patent: 6438671 (2002-08-01), Doing et al.
patent: 2250840 (1993-11-01), None
patent: WO99/19793 (1999-04-01), None
B. Appelbe et al. “Hoisting Branch Conditions—Improving Super-Scalar Processor Performance,”Languages and Compilers for Parallel Computing, 8thInternational Workshop, LCPC '95, Aug. 1995, pp. 304-317.
J. C. Chan et al. “Compiler-Driven Hybrid Dynamic Branch Predictor,”IBM Technical Disclosure Bulletin, vol. 36, No. 02, Feb. 1993, pp. 127-130.
A. G. Liles et al. “Branch Prediction Mechanism,”IBM Technical Disclosure Bulletin, vol. 22, No. 7, Dec. 1979, pp. 3013-3016.
V. R Augsburg et al., Pending Patent Application, “Re-Encoding Illegal Op Codes into a Single Illegal Op Code to Accommodate the Extra Bits Associated with Pre-Decoded Instructions”.

Affiliated with

Also associated with

Rating

Efficiently calculating a branch target address does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficiently calculating a branch target address, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently calculating a branch target address will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3393538