Register allocation system using recursive queuing during source

Details Register allocation system using recursive queuing during source Register allocation system using recursive queuing during source

1980-11-03

1984-03-06

Thomas, James D.

Boots, shoes, and leggings

364300, G06F 900, G06F 930, G06F 944

Patent

active

044357532

ABSTRACT:
A computing system operates upon register requests serially referenced in an instruction stream to assign quantities to registers selected from unlike subsets or classes of registers. During compilation, the register usage of quantities serially scanned in the instruction stream is determined. Upon determining during the serial scan the need for a new quantity in a register, the quantity is logged to a queue, or pending set, of load point quantities and assigned a complete set count indicative of the number of registers the quantity requires, plus the number of permanent registers, plus the number of restricted registers, plus the number of registers in register classes for which it is not a candidate. Upon determining during the serial scan the reuse of a quantity in a register (already assigned or pending assignment), the complete set counts of quantities in the pending set which are candidates for a same register class as the reuse quantity are incremented. When the complete set count for a quantity equals the total number of available registers, a complete set is detected and the quantity is assigned to the remaining register. The register assignment procedure is recursively executed to generate load instructions for addressability register manipulations conditionally for base address constants not already in a register.

REFERENCES:
patent: 3400371 (1968-09-01), Amdahl et al.
patent: 3496551 (1970-02-01), Driscoll
patent: 3702006 (1972-10-01), Page
patent: 4205371 (1980-05-01), Feather
patent: 4378590 (1983-03-01), Kim
patent: 4398249 (1983-08-01), Pardo et al.
patent: 4399504 (1983-08-01), Obermarck et al.
F. R. A. Hopgood, Compiling Techniques, American Elsevier, N.Y., pp. 96-103, 1969.
L. A. Belady, A Study of Replacement Algorithms for a Virtual-Storage Computer, IBM Systems Journal, vol. 5, No. 2, 1966, pp. 86-89.
J. C. Beatty, Register Assignment Algorithm for Generation of Highly Optimized Object Code, IBM J. Res. Develop., 1/74, pp. 20-39.

Affiliated with

Also associated with

Rating

Register allocation system using recursive queuing during source does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Register allocation system using recursive queuing during source, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Register allocation system using recursive queuing during source will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-744123