CODEWITHSUNDEEP
dependenciescompiler-constructiongraph-theorycompiler-optimizationssa
Abdulellah Alsaheel
Abdulellah Alsaheel

Reputation: 73

Can programs in SSA form lead to the construction of cyclic SDG?

Variables in Static Single Assignment (SSA) form transformed programs are only assigned once. This is done by making up a new version of a variable for each variable that is assigned more than once. Now, if I use the SSA transformed program to construct the System Dependence Graph (SDG), can it have any cycles? such as: A -> B -> ... -> A, where each "->" represents a control/data dependency.

I just wonder if there is a possibility that the generated SDG graph can include cycles since it is constructed to represent a program in SSA form, which writes to a program variable only once. I am also worried about function calls and their control edges in the SDG graph. If you think cycles are possible, then I would really appreciate an example of this case. Thank you.

Upvotes: 2

Views: 43

Answers (0)

Related Questions