Content deleted Content added
→Computing minimal SSA using dominance frontiers: er accuracy |
|||
Line 88:
* As of summer [[2004]] the [[GNU Compiler Collection]] is being updated to use SSA form. The [[frontend|frontends]] generate [[GENERIC]] code which is then converted into SSA form by the "[[gimplifier]]" and optimized by the "[[middle-end]]". The [[backend]] eventually translates the optimized intermediate code into [[Register Transfer Language|RTL]], executes some more low-level optimizations and finally turns RTL into [[assembly language]]. The first official release supporting SSA will be 4.0, tentatively scheduled for early [[2005]].
* [[IBM]]'s open source adaptive [[Java virtual machine]], [http://www-124.ibm.com/developerworks/oss/jikesrvm/index.shtml Jikes RVM], uses Heap Array SSA, an extension of SSA that allows analysis of scalars, arrays, and object fields in a unified framework. Heap Array SSA analysis is only enabled at the maximum optimization level, which is applied to the most frequently executed portions of code.
* Although not a compiler, [http://boomerang.sourceforge.net/ Boomerang] (a [[decompiler]]) uses SSA form in its internal representation. Applicability of various SSA algorithms to [[decompilation]] is an active area of SSA research.
| |||