Lines Matching full:children
378 and their children. *Note The Call Graph: Call Graph.
497 functions are entered, this option identifies children that could
502 Parents or children identified via this heuristic are indicated in
612 about the function FUNCTION_NAME (and its children...) in the call
620 spent in the function (and children who were not called from
628 the function FUNCTION_NAME and its children (and their
629 children...). More than one `-f' option may be given; only one
634 spent in the function and its children (and their children...)
834 children. From this information, you can find functions that, while
843 index % time self children called name
877 subroutines (also called "children" when we speak of the call graph).
907 index % time self children called name
937 `children'
940 `self' and `children' entries of the children listed directly
979 index % time self children called name
991 `children'
995 The sum of the `self' and `children' fields is an estimate of the
1034 index % time self children called name
1046 `children'
1050 The sum of the `self' and `children' fields is an estimate of the
1057 `children' time gets credited to `main'. *Note Estimating
1058 `children' Times: Assumptions.
1090 call graph paradoxical. The "time spent in children" of `a' should
1093 time should be included in the children of `a', when `a' is indirectly
1108 index % time self children called name
1131 index % time self children called name
1167 The `children' fields of the cycle's primary line and subroutine
1170 `children' time. Thus, we do not encounter the problem of what to do
1174 The `children' field of a caller-line in the cycle's entry estimates
1195 `children' fields in these lines are blank because of the difficulty of
1240 index % time self children called name
1272 % time self children called name
1377 * Assumptions:: Estimating children times
1448 6.2 Estimating `children' Times
1452 `children' time values and all the time figures in caller and
1462 then `foo' contributes 2 seconds to `a''s `children' time, by
1471 charge 2 seconds of time in `foo' to the children of `a'.
1869 symbols (`cg_dfn.c:cg_dfn'), so that children are always numbered less
1872 order (children appear before parents). Cycles are also detected at
1875 pointers. The first pass, from end to beginning (parents to children),
1879 print) property being propagated to its children, unless they
1881 pass, from beginning to end (children to parents) actually propagates
1924 Details sorting individual parents/children within each call graph
