Lines Matching full:graph

34 Having gathered the arcs of the call graph and timing information
38 We build a dynamic call graph with arcs from caller to callee,
40 by topologically sorting the call graph.
42 call graph toward the roots, according to the order
45 all edges in the graph go from higher numbered nodes to lower
51 after a single traversal of each arc in the call graph.
83 This relation is easily available from the call graph.
86 the call graph has cycles that
89 components in the call graph,
91 and then sort the resulting graph.
100 (a trivial cycle in the call graph)
104 shared among its call graph parents.
124 though they are listed in the call graph profile.
126 Figure 2 shows a modified version of the call graph of Figure 1,
129 The topologically sorted graph after the cycle is collapsed is
147 dynamic call graph,
151 dynamic call graph.
153 it is desirable to incorporate the static call graph so that cycles
156 The static call graph can be constructed from the source text
158 However, discovering the static call graph from the source text
175 dynamic call graph.
177 graph, no action is required.
179 graph are added to the graph with a traversal count of zero.
181 However, they may affect the structure of the graph.
183 the static call graph construction is