SYSTEM AND METHOD TO EFFICIENTLY REPRESENT ALIASES AND INDIRECT MEMORY OPERATIONS IN STATIC SINGLE ASSIGNMENT FORM DURING COMPILATION

Patent №

US 6,131,189

Granted

2000-10-10

Filed 1997

Owner

Lab

AI components

2

planning · hardware

Assignment

None on record

Dataset

AIPD

2023_r1 edition

Application

08979939

A system and method for an optimizer of a compilation suite for representing aliases and indirect memory operations in static single assignment (SSA) during compilation of a program having one or more basic blocks of source code. The optimizer converts all scalar variables of said program to SSA form, wherein said SSA form includes a plurality of variable versions, zero or more occurrences of a .chi. function, zero or more occurences of a .phi. function, and zero or more occurrences of a .mu. function. The .chi. function, .phi. function, and .mu. function are inserted for the variable versions. The optimizer also determines whether a variable version can be renamed to a zero version, and upon such a determination, the optimizer renames the variable version to a zero version. The optimizer further converts all indirect variables of a program to SSA form, wherein the SSA form includes a plurality of virtual variable versions such that a virtual variable is assigned to an indirect variable, zero or more occurrences of a .chi. function, zero or more occurences of a .phi. function, and zero or more occurrences of a .mu. function. The .chi. function, .phi. function, and .mu. function are inserted for the virtual variables. The optimizer hashes a unique value number and creates a corresponding hash table entry for each variable version and each virtual variable remaining after renaming all zero versions. The optimizer also applies global value numbering to each basic block of the program.

AI classification

AI hardware1.00
Planning0.52
Evolutionary computation0.01
Machine learning0.00
Natural language0.00
Knowledge representation0.00
Vision0.00
Speech0.00
© 2026 NYSGPT2525 LLC