Patent · US Expired

System and method to efficiently represent aliases and indirect memory operations in static single assignment form during compilation

US5768596A · kind A · utility

44Cited by
3References
3Claims
0Family size

Assignee

Inventors

Key dates

Filing dateApr 23, 1996
Grant dateJun 16, 1998
Priority date
Expiry dateApr 23, 2016

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F8/443
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

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…

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.