Lines Matching full:graph
94 The "call graph" shows, for each function, which functions called
98 function calls that use a lot of time. *Note The Call Graph: Call
99 Graph.
136 well as your link options. If it is not then no call-graph data will
140 gprof: gmon.out file is missing call-graph data
143 graph data you will still be able to see the time samples:
172 will greatly reduce the usefulness of the call graph.
252 profile and a call graph on standard output. Typically you would
297 which prints a flat profile and call graph analysis for all functions.
326 histogram, call graph, and basic-block count records is displayed.
362 `--graph[=SYMSPEC]'
363 The `-q' option causes `gprof' to print the call graph analysis.
364 If SYMSPEC is specified, print call graph only for matching symbols
365 and their children. *Note The Call Graph: Call Graph.
368 `--no-graph[=SYMSPEC]'
369 The `-Q' option causes `gprof' to suppress printing the call graph.
370 If SYMSPEC is specified, `gprof' prints a call graph, but excludes
442 printing the function index at the bottom of the call graph.
476 and the call graph.
479 `--static-call-graph'
480 The `-c' option causes the call graph of the program to be
483 code. Since normal call graph records are only generated when
490 the call graph with call counts of `0'.
500 The `-k' option allows you to delete from the call graph any arcs
526 The `-n' option causes `gprof', in its call graph analysis, to
531 The `-n' option causes `gprof', in its call graph analysis, not to
594 graph. The function will still be listed as a child of any
603 percentages-of-time for the call graph. More than one `-E' option
608 The `-f FUNCTION' option causes `gprof' to limit the call graph to
617 the call graph. More than one `-F' option may be given; only one
628 lists in the call graph all functions that were reached from either
697 * Call Graph:: The call graph shows which functions called which
705 File: gprof.info, Node: Flat Profile, Next: Call Graph, Up: Output
764 However, the call graph indicated that they were called, so therefore
800 is the only field in the flat profile that uses call graph
809 File: gprof.info, Node: Call Graph, Next: Line-by-line, Prev: Flat Profile, Up: Output
811 5.2 The Call Graph
814 The "call graph" shows how much time was spent in each function and its
858 subroutines (also called "children" when we speak of the call graph).
864 Flat Profile.) is never mentioned in the call graph.
875 File: gprof.info, Node: Primary, Next: Callers, Up: Call Graph
880 The "primary line" in a call graph entry is the line that describes the
947 File: gprof.info, Node: Callers, Next: Subroutines, Prev: Primary, Up: Call Graph
988 Not all functions have entries in the call graph; some options to
1001 File: gprof.info, Node: Subroutines, Next: Cycles, Prev: Callers, Up: Call Graph
1049 File: gprof.info, Node: Cycles, Prev: Subroutines, Up: Call Graph
1054 The graph may be complicated by the presence of "cycles of recursion"
1055 in the call graph. A cycle exists if a function calls another function
1068 graph it is followed by `<cycle NUMBER>'.
1071 call graph paradoxical. The "time spent in children" of `a' should
1085 Here is an example portion of a call graph which shows a cycle
1108 (The entire call graph for this program contains in addition an entry
1180 File: gprof.info, Node: Line-by-line, Next: Annotated Source, Prev: Call Graph, Up: Output
1199 mode. The call graph isn't as useful as normal, since the current
1200 version of `gprof' does not propagate call graph arcs from source code
1201 lines to the enclosing function. The call graph does, however, show
1216 Call graph (explanation follows)
1232 hit occurred on each of lines 349, 351, 382 and 385. In the call graph,
1248 Call graph (explanation follows)
1427 Some of the figures in the call graph are estimates--for example, the
1473 Use `gprof -l' and lookup the function in the call graph. The
1514 * When a function is suppressed from the call graph with `-e', GNU
1557 responsible for recording in an in-memory call graph table both its
1565 for maintaining the in-memory call graph, which records `frompc',
1633 written, followed by the call-graph arcs and the basic-block counts.
1671 records, call-graph arc records, and basic-block execution count
1704 9.2.2 Call-Graph Records
1707 Call-graph records have a format that is identical to the one used in
1708 the BSD-derived file format. It consists of an arc in the call graph
1716 This will ensure that the line-level call-graph is able to identify
1740 each for the flat profile (INCL_FLAT/EXCL_FLAT), the call graph arcs
1741 (INCL_ARCS/EXCL_ARCS), printing in the call graph
1742 (INCL_GRAPH/EXCL_GRAPH), timing propagation in the call graph
1810 As each call graph record is read (`call_graph.c:cg_read_rec'), the
1812 call graph arc is created by `cg_arcs.c:arc_add', unless the arc fails
1840 If call graph data is present, `cg_arcs.c:cg_assemble' is called.
1843 instructions, and adding them to the call graph with a zero call count.
1858 the timings along the call graph, subject to a check against
1865 fairly straightforward. The call graph (`cg_print.c:cg_print') and
1890 Monitor depth-first numbering of symbols during call graph analysis
1896 As the call graph arcs are read, show each arc and how the total
1899 32 - Call graph arc sorting
1900 Details sorting individual parents/children within each call graph
1903 64 - Reading histogram and call graph records
1905 graph arc
1912 256 - Static call graph
1918 1024 - Call graph propagation
1919 Shows how function times are propagated along the call graph
2321 Node: Call Graph33842
