Lines Matching full:that
5 .\" modification, are permitted provided that the following conditions
38 that are called during execution of the program,
43 A list of the routines that are never called during execution of
45 to verify that nothing important is omitted by
47 The flat profile gives a quick overview of the routines that are used,
48 and shows the routines that are themselves responsible
51 this profile usually shows that no single function
54 Notice that for this profile,
84 We cannot assume that a call graph is planar,
85 and even if it is, that we can print a planar version of it.
88 the routines that are its direct parents and children.
103 in the routines that they call.
117 except that members of the cycle are listed in place of the children.
138 The reader should keep in mind that all information
140 The index in the first column shows that \s-1EXAMPLE\s+1
150 Note that \s-1EXAMPLE\s+1 calls itself recursively four times.
164 Finally each name is followed by an index that shows
165 where on the listing to find the entry for that routine.
169 a set of routines that implement an abstraction.
171 and in evaluating the new algorithms and code that replace them.
177 The easiest optimization that can be performed
179 to a control construct or data structure that improves the
182 is a routine that is called many times.
185 of a routine that formats the data.
188 return can be saved for each datum that needs to be formatted.
190 The drawback to inline expansion is that the data abstractions
201 Further potential for optimization lies in routines that
206 that might be replaced with a binary search.
207 Alternately, the discovery that a rehashing function is being
221 that begins to dominate execution time.
229 They are typified by programs that exhibit a large degree of
231 The problem is that most of the major routines are grouped
233 As in the symbol table abstraction that is placed
237 Unfortunately there are no easy modifications to these programs that
242 If you receive a program from another user that you need to modify
250 For purposes of this example suppose that the call graph
266 you can determine which format routine generates the output that
270 you can determine if your modifications will affect output that
277 that needs the new format.
278 It should be noted that the static call information is particularly
283 We have created a profiler that aids in the evaluation
286 the profile shows the extent to which that routine
288 and how that routine uses other abstractions.