Content deleted Content added
It's not critical. In fact, the main SSA compilers out there (XLC, ICC, etc) don't do renaming SSA, they use FUD chains! |
"each contain" --> "each contains" |
||
Line 1:
In [[compiler theory]], '''static single assignment form''', more often abbreviated '''SSA form''' or just '''SSA''', is an [[intermediate representation]] in which every variable is assigned exactly once. Existing variables in the original IR are split into <i>versions</i>, new variables typically indicated by the original name with a subscript, so that every definition gets its own version. In SSA form, [[use-def chains]] are explicit and each
SSA was developed by researchers at [[International Business Machines|IBM]] in the [[1980s]].
Line 74:
runner := p
'''while''' runner ≠ doms(b)
add b to
runner := doms(runner)
| |||