Lines Matching +full:cycle +full:- +full:1

7 .\" 1. Redistributions of source code must retain the above copyright
32 .sh 1 "Post Processing"
47 An example is given in Figure 1.
59 Figure 1.
88 In these cases, we discover strongly-connected
92 We use a variation of Tarjan's strongly-connected
94 that discovers strongly-connected components as it is assigning
99 For example, a self-recursive routine
100 (a trivial cycle in the call graph)
109 Time is not propagated from one member of a cycle to another,
112 In addition, children of one member of a cycle
113 must be considered children of all members of the cycle.
114 Similarly, parents of one member of the cycle must inherit
115 all members of the cycle as descendants.
117 Our solution collects all members of a cycle together,
119 All calls into the cycle are made to share the total 
120 time of the cycle, and all descendants of the cycle
121 propagate time into the cycle as a whole.
122 Calls among the members of the cycle 
126 Figure 2 shows a modified version of the call graph of Figure 1,
127 in which the nodes labelled 3 and 7 in Figure 1 are mutually
129 The topologically sorted graph after the cycle is collapsed is
134 Cycle to be collapsed.
141 Topological numbering after cycle collapsing.
169 and which is in language-independent form.