Method of Building A use-def (or ud) Chain
- Set definitions in statement s(0)
- For each i in, find live definitions that have use in statement s(i)
- Make a link among definitions and uses
- Set the statement s(i), as definition statement
- Kill previous definitions
With this algorithm, two things are accomplished:
- A directed acyclic graph (DAG) is created on the variable uses and definitions. The DAG specifies a data dependency among assignment statements, as well as a partial order (therefore parallelism among statements).
- When statement s(i) is reached, there is a list of live variable assignments. If only one assignment is live, for example, constant propagation might be used.
Read more about this topic: Use-define Chain
Famous quotes containing the words method, building and/or chain:
“There is no method but to be very intelligent.”
—T.S. (Thomas Stearns)
“And no less firmly do I hold that we shall one day recognize in Freuds life-work the cornerstone for the building of a new anthropology and therewith of a new structure, to which many stones are being brought up today, which shall be the future dwelling of a wiser and freer humanity.”
—Thomas Mann (18751955)
“To avoid tripping on the chain of the past, you have to pick it up and wind it about you.”
—Mason Cooley (b. 1927)
Related Phrases
Related Words