| /netbsd/src/usr.bin/nbperf/ |
| D | graph2.c | 51 SIZED2(_setup)(struct SIZED(graph) *graph, uint32_t v, uint32_t e) in SIZED2()
53 graph->v = v; in SIZED2()
54 graph->e = e; in SIZED2()
56 graph->verts = calloc(sizeof(*graph->verts), v); in SIZED2()
57 graph->edges = calloc(sizeof(*graph->edges), e); in SIZED2()
58 graph->output_order = calloc(sizeof(uint32_t), e); in SIZED2()
60 if (graph->verts == NULL || graph->edges == NULL || in SIZED2()
61 graph->output_order == NULL) in SIZED2()
66 SIZED2(_free)(struct SIZED(graph) *graph) in SIZED2()
68 free(graph->verts); in SIZED2()
[all …]
|
| D | nbperf-chm.c | 77 struct SIZED(graph) graph;
90 for (i = 0; i < state->graph.e; ++i) { in assign_nodes()
91 e_idx = state->graph.output_order[i]; in assign_nodes()
92 e = &state->graph.edges[e_idx]; in assign_nodes()
107 if (g >= state->graph.e) { in assign_nodes()
108 g += state->graph.e; in assign_nodes()
109 if (g >= state->graph.e) in assign_nodes()
110 g += state->graph.e; in assign_nodes()
126 for (i = 0; i < state->graph.e; ++i) { in assign_nodes()
127 e_idx = state->graph.output_order[i]; in assign_nodes()
[all …]
|
| D | nbperf-bdz.c | 73 struct SIZED(graph) graph;
88 for (i = 0; i < state->graph.v; ++i) in assign_nodes()
91 for (i = 0; i < state->graph.e; ++i) { in assign_nodes()
92 j = state->graph.output_order[i]; in assign_nodes()
93 e = &state->graph.edges[j]; in assign_nodes()
120 for (i = 0; i < state->graph.v; ++i) { in assign_nodes()
155 (state->graph.v + 63) / 64); in print_hash()
157 for (i = 0; i < state->graph.v; ++i) { in print_hash()
177 (state->graph.v + 63) / 64); in print_hash()
179 for (i = 0; i < state->graph.v; ++i) { in print_hash()
[all …]
|
| D | graph2.h | 64 #define SIZED2(n) SIZED2_(graph, GRAPH_SIZE, n)
74 struct SIZED(graph) { in SIZED() argument
84 void SIZED2(_setup)(struct SIZED(graph) *, uint32_t, uint32_t);
85 void SIZED2(_free)(struct SIZED(graph) *);
87 int SIZED2(_hash)(struct nbperf *, struct SIZED(graph) *);
88 int SIZED2(_output_order)(struct SIZED(graph) *graph);
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | graphds.h | 47 struct graph struct
54 struct graph *new_graph (int); argument
55 void dump_graph (FILE *, struct graph *);
56 struct graph_edge *add_edge (struct graph *, int, int);
57 void identify_vertices (struct graph *, int, int);
59 int graphds_dfs (struct graph *, int *, int,
61 int graphds_scc (struct graph *, bitmap, skip_edge_callback = NULL);
62 void graphds_domtree (struct graph *, int, int *, int *, int *);
63 typedef void (*graphds_edge_callback) (struct graph *,
65 void for_each_edge (struct graph *, graphds_edge_callback, void *);
[all …]
|
| D | tree-ssa-structalias.cc | 624 static constraint_graph_t graph; variable
641 gcc_checking_assert (node < graph->size); in find()
642 if (graph->rep[node] != node) in find()
643 return graph->rep[node] = find (graph->rep[node]); in find()
655 gcc_checking_assert (to < graph->size && from < graph->size); in unite()
656 if (to != from && graph->rep[from] != to) in unite()
658 graph->rep[from] = to; in unite()
757 if (!graph) in dump_constraint_graph()
769 for (i = 1; i < graph->size; i++) in dump_constraint_graph()
779 if (graph->complex[i].exists ()) in dump_constraint_graph()
[all …]
|
| D | shortest-paths.h | 56 shortest_paths (const graph_t &graph, const node_t *given_node,
90 shortest_paths (const graph_t &graph, in shortest_paths() argument
93 : m_graph (graph), in shortest_paths()
95 m_dist (graph.m_nodes.length ()), in shortest_paths()
96 m_best_edge (graph.m_nodes.length ()) in shortest_paths()
100 auto_vec<int> queue (graph.m_nodes.length ()); in shortest_paths()
102 for (unsigned i = 0; i < graph.m_nodes.length (); i++) in shortest_paths()
|
| D | graphds.cc | 29 dump_graph (FILE *f, struct graph *g) in dump_graph()
54 struct graph *
57 struct graph *g = XNEW (struct graph); in new_graph()
70 add_edge (struct graph *g, int f, int t) in add_edge()
91 identify_vertices (struct graph *g, int v, int u) in identify_vertices()
173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge()
204 graphds_dfs (struct graph *g, int *qs, int nq, vec<int> *qt, in graphds_dfs()
291 graphds_scc (struct graph *g, bitmap subgraph, in graphds_scc()
331 for_each_edge (struct graph *g, graphds_edge_callback callback, void *data) in for_each_edge()
344 free_graph (struct graph *g) in free_graph()
[all …]
|
| D | tree-loop-distribution.cc | 292 dump_rdg_vertex (FILE *file, struct graph *rdg, int i) in dump_rdg_vertex()
319 debug_rdg_vertex (struct graph *rdg, int i) in debug_rdg_vertex()
327 dump_rdg (FILE *file, struct graph *rdg) in dump_rdg()
338 debug_rdg (struct graph *rdg) in debug_rdg()
344 dot_rdg_1 (FILE *file, struct graph *rdg) in dot_rdg_1()
395 dot_rdg (struct graph *rdg) in dot_rdg()
414 rdg_vertex_for_stmt (struct graph *rdg ATTRIBUTE_UNUSED, gimple *stmt) in rdg_vertex_for_stmt()
425 create_rdg_edges_for_scalar (struct graph *rdg, tree def, int idef) in create_rdg_edges_for_scalar()
447 create_edge_for_control_dependence (struct graph *rdg, basic_block bb, in create_edge_for_control_dependence()
474 create_rdg_flow_edges (struct graph *rdg) in create_rdg_flow_edges()
[all …]
|
| D | tree-ssa-coalesce.cc | 807 live_track_process_def (live_track *ptr, tree def, ssa_conflicts *graph) in live_track_process_def() argument
827 ssa_conflicts_add (graph, p, x); in live_track_process_def()
866 ssa_conflicts *graph; in build_ssa_conflict_graph() local
883 graph = ssa_conflicts_new (num_var_partitions (map)); in build_ssa_conflict_graph()
935 live_track_process_def (live, var, graph); in build_ssa_conflict_graph()
955 live_track_process_def (live, result, graph); in build_ssa_conflict_graph()
977 live_track_process_def (live, var, graph); in build_ssa_conflict_graph()
989 return graph; in build_ssa_conflict_graph()
1319 attempt_coalesce (var_map map, ssa_conflicts *graph, int x, int y, in attempt_coalesce() argument
1348 if (!ssa_conflicts_test_p (graph, p1, p2)) in attempt_coalesce()
[all …]
|
| /netbsd/src/usr.bin/tsort/ |
| D | tsort.c | 104 static NODE *graph, **cycle_buf, **longest_cycle; variable
272 if ((n->n_next = graph) != NULL) in get_node()
273 graph->n_prevp = &n->n_next; in get_node()
274 n->n_prevp = &graph; in get_node()
275 graph = n; in get_node()
294 for (n = graph; n != NULL; n = n->n_next) in clear_cycle()
305 while (graph != NULL) { in tsort()
312 for (cnt = 0, n = graph; n != NULL; n = next) { in tsort()
319 } while (graph != NULL && cnt); in tsort()
321 if (graph == NULL) in tsort()
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/doc/ |
| D | analyzer.texi | 39 of the CFGs into a single directed graph, with both interprocedural and
55 within the supergraph, building an "exploded graph".
56 Nodes in the exploded graph correspond to <point,@w{ }state> pairs, as in
62 on a final exploded graph, and terminate the analysis. We also bail
78 to reach the problem by finding the simplest route through the graph.
83 By default the exploded graph merges multiple consecutive statements
85 exploded graph. This can be suppressed via
92 stack of callsites below them, so that paths in the exploded graph
101 Nodes and edges in the exploded graph are called ``exploded nodes'' and
106 Each graph numbers its nodes, giving unique identifiers - supernodes
[all …]
|
| /netbsd/src/external/bsd/file/dist/magic/magdir/ |
| D | graphviz | 7 # line matches a LaTeX file containing the word "graph" (with a {
9 #0 regex/100l [\r\n\t\ ]*graph[\r\n\t\ ]+.*\\{ graphviz graph text
|
| D | visx | 29 >2 byte 130 (graph)
30 >2 byte 131 (adjacency graph)
31 >2 byte 132 (adjacency graph library)
|
| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/config/os/bsd/freebsd/ |
| D | ctype_inline.h | 63 | space | print | graph | cntrl | punct | alnum in _GLIBCXX_VISIBILITY()
74 if (this->is(graph, *__low)) __m |= graph; in _GLIBCXX_VISIBILITY()
128 | space | print | graph | cntrl | punct | alnum in _GLIBCXX_VISIBILITY()
|
| D | ctype_base.h | 55 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; in _GLIBCXX_VISIBILITY() member
69 static const mask graph = _A | _D | _P; in _GLIBCXX_VISIBILITY() member
|
| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/config/os/bsd/darwin/ |
| D | ctype_inline.h | 63 | space | print | graph | cntrl | punct | alnum in _GLIBCXX_VISIBILITY()
74 if (this->is(graph, *__low)) __m |= graph; in _GLIBCXX_VISIBILITY()
128 | space | print | graph | cntrl | punct | alnum in _GLIBCXX_VISIBILITY()
|
| D | ctype_base.h | 53 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; in _GLIBCXX_VISIBILITY() member
67 static const mask graph = _A | _D | _P; in _GLIBCXX_VISIBILITY() member
|
| /netbsd/src/external/gpl3/binutils/dist/gprof/ |
| D | README | 18 o Supports profiling at the line level: flat profiles, call-graph profiles,
40 o In the call-graph function index, static function names are now
71 the option to delete arcs from the call graph. The old syntax
208 -q[symspec] --graph[=symspec]
209 Request output in the form of a call-graph
213 "symspec" in the call-graph. If the option is
214 specified multiple times, the call-graph includes
217 -Q[symspec] --no-graph[=symspec]
218 Suppress output in the call-graph. If given without
219 an argument, the call-graph is suppressed completely.
[all …]
|
| D | gprof.texi | 109 @c man title gprof display call graph profile data
118 [ --[no-]flat-profile[=@var{name}] ] [ --[no-]graph[=@var{name}] ]
125 [ --separate-files ] [ --static-call-graph ] [ --sum ]
137 of each caller. The profile data is taken from the call graph profile file
144 its symbol table and the call graph profile from @file{gmon.out}.
149 Next, these times are propagated along the edges of the call graph.
161 Thus the time propagated along the call graph arcs to the function's
167 to be spontaneously invoked in the call graph listing, and will
185 dynamic call graph and profile.
187 summarized dynamic call graph and profile.
[all …]
|
| D | bsd_callg_bl.m | 4 call graph profile:
10 index the index of the function in the call graph
33 index the index of the function in the call graph
60 index the index of this parent in the call graph
86 index the index of this child in the call graph listing,
|
| D | gprof.info | 93 The “call graph” shows, for each function, which functions called it,
134 well as your link options. If it is not then no call-graph data will be
138 gprof: gmon.out file is missing call-graph data
140 If you add the ‘-Q’ switch to suppress the printing of the call graph
181 greatly reduce the usefulness of the call graph.
262 profile and a call graph on standard output. Typically you would
306 which prints a flat profile and call graph analysis for all functions.
322 The ‘-B’ option causes ‘gprof’ to print the call graph analysis.
338 call graph, and basic-block count records is displayed.
374 ‘--graph[=SYMSPEC]’
[all …]
|
| /netbsd/src/external/bsd/byacc/dist/ |
| D | descrip.mms | 8 error.obj,graph.obj, \
42 graph.obj : graph.c
|
| /netbsd/src/external/gpl3/binutils/dist/gprof/po/ |
| D | id.po | 125 "\t\t Call graph (explanation follows)\n"
128 "\t\t Panggil graph (penjelasan mengikuti)\n"
134 "\t\t\tCall graph\n"
137 "\t\t\tPanggil graph\n"
355 msgid "\t%d call-graph record\n"
356 msgstr "\t%d catatan call-graph\n"
360 msgid "\t%d call-graph records\n"
361 msgstr "\t%d catatan call-graph\n"
379 "\t[--[no-]flat-profile[=name]] [--[no-]graph[=name]]\n"
385 "\t[--static-call-graph] [--sum] [--table-length=len] [--traditional]\n"
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/config/os/vxworks/ |
| D | ctype_base.h | 55 static const mask graph = _C_UPPER | _C_LOWER | _C_NUMBER | _C_PUNCT; in _GLIBCXX_VISIBILITY() member
76 static const mask graph = _DI|_LO|_PU|_UP|_XA; in _GLIBCXX_VISIBILITY()
|