Lines Matching full:call

34 Having gathered the arcs of the call graph and timing information
37 routines that call it.
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
51 after a single traversal of each arc in the call graph.
66 Since we are assuming each call to a routine takes the
83 This relation is easily available from the call graph.
86 the call graph has cycles that
89 components in the call graph,
100 (a trivial cycle in the call graph)
104 shared among its call graph parents.
118 summing the time and call counts for all members.
124 though they are listed in the call graph profile.
126 Figure 2 shows a modified version of the call graph of Figure 1,
147 dynamic call graph,
148 and the program typically does not call every routine
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.
176 If a statically discovered arc already exists in the dynamic call
178 Statically discovered arcs that do not exist in the dynamic call
183 the static call graph construction is