Lines Matching full:children
365 and their children. *Note The Call Graph: Call Graph.
484 functions are entered, this option identifies children that could
489 Parents or children identified via this heuristic are indicated in
593 about the function FUNCTION_NAME (and its children...) in the call
601 spent in the function (and children who were not called from
609 the function FUNCTION_NAME and its children (and their
610 children...). More than one `-f' option may be given; only one
615 spent in the function and its children (and their children...)
815 children. From this information, you can find functions that, while
824 index % time self children called name
858 subroutines (also called "children" when we speak of the call graph).
888 index % time self children called name
918 `children'
921 `self' and `children' entries of the children listed directly
960 index % time self children called name
972 `children'
976 The sum of the `self' and `children' fields is an estimate of the
1015 index % time self children called name
1027 `children'
1031 The sum of the `self' and `children' fields is an estimate of the
1038 `children' time gets credited to `main'. *Note Estimating
1039 `children' Times: Assumptions.
1071 call graph paradoxical. The "time spent in children" of `a' should
1074 time should be included in the children of `a', when `a' is indirectly
1089 index % time self children called name
1112 index % time self children called name
1148 The `children' fields of the cycle's primary line and subroutine
1151 `children' time. Thus, we do not encounter the problem of what to do
1155 The `children' field of a caller-line in the cycle's entry estimates
1176 `children' fields in these lines are blank because of the difficulty of
1221 index % time self children called name
1253 % time self children called name
1358 * Assumptions:: Estimating children times
1424 6.2 Estimating `children' Times
1428 `children' time values and all the time figures in caller and
1438 then `foo' contributes 2 seconds to `a''s `children' time, by
1447 charge 2 seconds of time in `foo' to the children of `a'.
1845 symbols (`cg_dfn.c:cg_dfn'), so that children are always numbered less
1848 order (children appear before parents). Cycles are also detected at
1851 pointers. The first pass, from end to beginning (parents to children),
1855 print) property being propagated to its children, unless they
1857 pass, from beginning to end (children to parents) actually propagates
1900 Details sorting individual parents/children within each call graph
