Lines Matching refs:file

9 fsf_callg_blurb (FILE *file)  in fsf_callg_blurb()  argument
11 fputs ("\n", file); in fsf_callg_blurb()
12 fputs (" This table describes the call tree of the program, and was sorted by\n", file); in fsf_callg_blurb()
13 fputs (" the total amount of time spent in each function and its children.\n", file); in fsf_callg_blurb()
14 fputs ("\n", file); in fsf_callg_blurb()
15 fputs (" Each entry in this table consists of several lines. The line with the\n", file); in fsf_callg_blurb()
16 fputs (" index number at the left hand margin lists the current function.\n", file); in fsf_callg_blurb()
17 fputs (" The lines above it list the functions that called this function,\n", file); in fsf_callg_blurb()
18 fputs (" and the lines below it list the functions this one called.\n", file); in fsf_callg_blurb()
19 fputs (" This line lists:\n", file); in fsf_callg_blurb()
20 fputs (" index A unique number given to each element of the table.\n", file); in fsf_callg_blurb()
21 fputs (" Index numbers are sorted numerically.\n", file); in fsf_callg_blurb()
22 fputs (" The index number is printed next to every function name so\n", file); in fsf_callg_blurb()
23 fputs (" it is easier to look up where the function is in the table.\n", file); in fsf_callg_blurb()
24 fputs ("\n", file); in fsf_callg_blurb()
25 fputs (" % time This is the percentage of the `total' time that was spent\n", file); in fsf_callg_blurb()
26 fputs (" in this function and its children. Note that due to\n", file); in fsf_callg_blurb()
27 fputs (" different viewpoints, functions excluded by options, etc,\n", file); in fsf_callg_blurb()
28 fputs (" these numbers will NOT add up to 100%.\n", file); in fsf_callg_blurb()
29 fputs ("\n", file); in fsf_callg_blurb()
30 fputs (" self This is the total amount of time spent in this function.\n", file); in fsf_callg_blurb()
31 fputs ("\n", file); in fsf_callg_blurb()
32 fputs (" children This is the total amount of time propagated into this\n", file); in fsf_callg_blurb()
33 fputs (" function by its children.\n", file); in fsf_callg_blurb()
34 fputs ("\n", file); in fsf_callg_blurb()
35 fputs (" called This is the number of times the function was called.\n", file); in fsf_callg_blurb()
36 fputs (" If the function called itself recursively, the number\n", file); in fsf_callg_blurb()
37 fputs (" only includes non-recursive calls, and is followed by\n", file); in fsf_callg_blurb()
38 fputs (" a `+' and the number of recursive calls.\n", file); in fsf_callg_blurb()
39 fputs ("\n", file); in fsf_callg_blurb()
40 fputs (" name The name of the current function. The index number is\n", file); in fsf_callg_blurb()
41 fputs (" printed after it. If the function is a member of a\n", file); in fsf_callg_blurb()
42 fputs (" cycle, the cycle number is printed between the\n", file); in fsf_callg_blurb()
43 fputs (" function's name and the index number.\n", file); in fsf_callg_blurb()
44 fputs ("\n", file); in fsf_callg_blurb()
45 fputs ("\n", file); in fsf_callg_blurb()
46 fputs (" For the function's parents, the fields have the following meanings:\n", file); in fsf_callg_blurb()
47 fputs ("\n", file); in fsf_callg_blurb()
48 fputs (" self This is the amount of time that was propagated directly\n", file); in fsf_callg_blurb()
49 fputs (" from the function into this parent.\n", file); in fsf_callg_blurb()
50 fputs ("\n", file); in fsf_callg_blurb()
51 fputs (" children This is the amount of time that was propagated from\n", file); in fsf_callg_blurb()
52 fputs (" the function's children into this parent.\n", file); in fsf_callg_blurb()
53 fputs ("\n", file); in fsf_callg_blurb()
54 fputs (" called This is the number of times this parent called the\n", file); in fsf_callg_blurb()
55 fputs (" function `/' the total number of times the function\n", file); in fsf_callg_blurb()
56 fputs (" was called. Recursive calls to the function are not\n", file); in fsf_callg_blurb()
57 fputs (" included in the number after the `/'.\n", file); in fsf_callg_blurb()
58 fputs ("\n", file); in fsf_callg_blurb()
59 fputs (" name This is the name of the parent. The parent's index\n", file); in fsf_callg_blurb()
60 fputs (" number is printed after it. If the parent is a\n", file); in fsf_callg_blurb()
61 fputs (" member of a cycle, the cycle number is printed between\n", file); in fsf_callg_blurb()
62 fputs (" the name and the index number.\n", file); in fsf_callg_blurb()
63 fputs ("\n", file); in fsf_callg_blurb()
64 fputs (" If the parents of the function cannot be determined, the word\n", file); in fsf_callg_blurb()
65 fputs (" `<spontaneous>' is printed in the `name' field, and all the other\n", file); in fsf_callg_blurb()
66 fputs (" fields are blank.\n", file); in fsf_callg_blurb()
67 fputs ("\n", file); in fsf_callg_blurb()
68 fputs (" For the function's children, the fields have the following meanings:\n", file); in fsf_callg_blurb()
69 fputs ("\n", file); in fsf_callg_blurb()
70 fputs (" self This is the amount of time that was propagated directly\n", file); in fsf_callg_blurb()
71 fputs (" from the child into the function.\n", file); in fsf_callg_blurb()
72 fputs ("\n", file); in fsf_callg_blurb()
73 fputs (" children This is the amount of time that was propagated from the\n", file); in fsf_callg_blurb()
74 fputs (" child's children to the function.\n", file); in fsf_callg_blurb()
75 fputs ("\n", file); in fsf_callg_blurb()
76 fputs (" called This is the number of times the function called\n", file); in fsf_callg_blurb()
77 fputs (" this child `/' the total number of times the child\n", file); in fsf_callg_blurb()
78 fputs (" was called. Recursive calls by the child are not\n", file); in fsf_callg_blurb()
79 fputs (" listed in the number after the `/'.\n", file); in fsf_callg_blurb()
80 fputs ("\n", file); in fsf_callg_blurb()
81 fputs (" name This is the name of the child. The child's index\n", file); in fsf_callg_blurb()
82 fputs (" number is printed after it. If the child is a\n", file); in fsf_callg_blurb()
83 fputs (" member of a cycle, the cycle number is printed\n", file); in fsf_callg_blurb()
84 fputs (" between the name and the index number.\n", file); in fsf_callg_blurb()
85 fputs ("\n", file); in fsf_callg_blurb()
86 fputs (" If there are any cycles (circles) in the call graph, there is an\n", file); in fsf_callg_blurb()
87 fputs (" entry for the cycle-as-a-whole. This entry shows who called the\n", file); in fsf_callg_blurb()
88 fputs (" cycle (as parents) and the members of the cycle (as children.)\n", file); in fsf_callg_blurb()
89 fputs (" The `+' recursive calls entry shows the number of function calls that\n", file); in fsf_callg_blurb()
90 fputs (" were internal to the cycle, and the calls entry for each member shows,\n", file); in fsf_callg_blurb()
91 fputs (" for that member, how many times it was called from other members of\n", file); in fsf_callg_blurb()
92 fputs (" the cycle.\n", file); in fsf_callg_blurb()
93 fputs (" \n", file); in fsf_callg_blurb()
94 fputs ("Copyright (C) 2012-2016 Free Software Foundation, Inc.\n", file); in fsf_callg_blurb()
95 fputs ("\n", file); in fsf_callg_blurb()
96 fputs ("Copying and distribution of this file, with or without modification,\n", file); in fsf_callg_blurb()
97 fputs ("are permitted in any medium without royalty provided the copyright\n", file); in fsf_callg_blurb()
98 fputs ("notice and this notice are preserved.\n", file); in fsf_callg_blurb()