| /netbsd-src/usr.bin/nbperf/ |
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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/mit/isl/dist/ |
| H A D | isl_scheduler.c | 179 static int graph_init_table(isl_ctx *ctx, struct isl_sched_graph *graph) in graph_init_table() argument
183 graph->node_table = isl_hash_table_alloc(ctx, graph->n); in graph_init_table()
184 if (!graph->node_table) in graph_init_table()
187 for (i = 0; i < graph->n; ++i) { in graph_init_table()
191 hash = isl_space_get_tuple_hash(graph->node[i].space); in graph_init_table()
192 entry = isl_hash_table_find(ctx, graph->node_table, hash, in graph_init_table()
194 graph->node[i].space, 1); in graph_init_table()
197 entry->data = &graph->node[i]; in graph_init_table()
207 struct isl_sched_graph *graph, __isl_keep isl_space *space) in isl_sched_graph_find_node() argument
216 entry = isl_hash_table_find(ctx, graph->node_table, hash, in isl_sched_graph_find_node()
[all …]
|
| H A D | isl_scheduler_clustering.c | 30 struct isl_sched_graph *graph) in clustering_init() argument
34 c->n = graph->scc; in clustering_init()
45 if (isl_sched_graph_extract_sub_graph(ctx, graph, in clustering_init()
84 static int bad_cluster(struct isl_sched_graph *graph) in bad_cluster() argument
86 return graph->n_row < graph->maxvar && in bad_cluster()
87 graph->n_total_row == graph->band_start; in bad_cluster()
114 static int find_proximity(struct isl_sched_graph *graph, in find_proximity() argument
117 int i, best = graph->n_edge, best_dist, best_weight; in find_proximity()
119 for (i = 0; i < graph->n_edge; ++i) { in find_proximity()
120 struct isl_sched_edge *edge = &graph->edge[i]; in find_proximity()
[all …]
|
| H A D | isl_scheduler.h | 258 isl_stat isl_sched_graph_init(struct isl_sched_graph *graph,
260 void isl_sched_graph_free(isl_ctx *ctx, struct isl_sched_graph *graph);
262 int isl_sched_graph_is_node(struct isl_sched_graph *graph,
264 isl_bool isl_sched_graph_has_validity_edge(struct isl_sched_graph *graph,
268 struct isl_sched_graph *graph, __isl_keep isl_space *space);
270 isl_stat isl_sched_graph_detect_ccs(isl_ctx *ctx, struct isl_sched_graph *graph,
274 struct isl_sched_graph *graph, int scc);
276 struct isl_sched_graph *graph);
278 struct isl_sched_graph *graph,
282 isl_stat isl_sched_graph_compute_maxvar(struct isl_sched_graph *graph);
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/libcxx/utils/ |
| H A D | graph_header_deps.py | 89 def transitive_closure_of_includes(graph, h1): argument
91 def explore(graph, h1): argument
94 for h2 in graph[h1].includes:
95 explore(graph, h2)
96 explore(graph, h1)
100 def transitively_includes(graph, h1, h2): argument
101 return (h1 != h2) and (h2 in transitive_closure_of_includes(graph, h1))
106 graph = {}
111 if fname not in graph:
112 graph[fname] = build_file_entry(fname, options)
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A 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 …]
|
| H A D | tree-ssa-structalias.c | 616 static constraint_graph_t graph; variable
633 gcc_checking_assert (node < graph->size); in find()
634 if (graph->rep[node] != node) in find()
635 return graph->rep[node] = find (graph->rep[node]); in find()
647 gcc_checking_assert (to < graph->size && from < graph->size); in unite()
648 if (to != from && graph->rep[from] != to) in unite()
650 graph->rep[from] = to; in unite()
743 if (!graph) in dump_constraint_graph()
755 for (i = 1; i < graph->size; i++) in dump_constraint_graph()
765 if (graph->complex[i].exists ()) in dump_constraint_graph()
[all …]
|
| H A D | shortest-paths.h | 40 shortest_paths (const graph_t &graph, const node_t *origin);
64 shortest_paths<GraphTraits, Path_t>::shortest_paths (const graph_t &graph, in shortest_paths() argument
66 : m_graph (graph), in shortest_paths()
67 m_dist (graph.m_nodes.length ()), in shortest_paths()
68 m_prev (graph.m_nodes.length ()) in shortest_paths()
72 auto_vec<int> queue (graph.m_nodes.length ()); in shortest_paths()
74 for (unsigned i = 0; i < graph.m_nodes.length (); i++) in shortest_paths()
|
| H A D | graphds.c | 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 …]
|
| H A D | tree-loop-distribution.c | 288 dump_rdg_vertex (FILE *file, struct graph *rdg, int i) in dump_rdg_vertex()
315 debug_rdg_vertex (struct graph *rdg, int i) in debug_rdg_vertex()
323 dump_rdg (FILE *file, struct graph *rdg) in dump_rdg()
334 debug_rdg (struct graph *rdg) in debug_rdg()
340 dot_rdg_1 (FILE *file, struct graph *rdg) in dot_rdg_1()
391 dot_rdg (struct graph *rdg) in dot_rdg()
410 rdg_vertex_for_stmt (struct graph *rdg ATTRIBUTE_UNUSED, gimple *stmt) in rdg_vertex_for_stmt()
421 create_rdg_edges_for_scalar (struct graph *rdg, tree def, int idef) in create_rdg_edges_for_scalar()
443 create_edge_for_control_dependence (struct graph *rdg, basic_block bb, in create_edge_for_control_dependence()
470 create_rdg_flow_edges (struct graph *rdg) in create_rdg_flow_edges()
[all …]
|
| H A D | tree-ssa-coalesce.c | 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/external/gpl3/gcc/dist/gcc/ |
| H A 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 …]
|
| H A 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 …]
|
| H A 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()
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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/external/apache2/llvm/dist/clang/utils/analyzer/ |
| H A D | exploded-graph-rewriter.py | 477 def visit_begin_graph(self, graph): argument
478 self._graph = graph
891 def explore(self, graph, visitor): argument
892 visitor.visit_begin_graph(graph)
893 for node in sorted(graph.nodes):
895 visitor.visit_node(graph.nodes[node])
896 for succ in sorted(graph.nodes[node].successors):
898 visitor.visit_edge(graph.nodes[node], graph.nodes[succ])
911 def trim(self, graph): argument
913 node_id = graph.root_id
[all …]
|
| /netbsd-src/usr.bin/tsort/ |
| H A 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/apache2/llvm/dist/llvm/docs/DependenceGraphs/ |
| H A D | index.rst | 23 dependencies between individual instructions. Each node in such a graph
29 As described in [1]_ the DDG uses graph abstraction to group nodes
30 that are part of a strongly connected component of the graph
33 connected component of the graph is a maximal subgraph of all the nodes
81 The graph build algorithm considers dependencies between elements of
90 design pattern to isolate the construction of the dependence graph
94 pattern as it applies to the dependence graph implementation.
100 and ``PDGBuilder`` control some aspects of how the graph is constructed
112 - Builder allows graph construction code to be reused for DDG and PDG.
130 graph described in [1]_ in the following ways:
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/doc/ |
| H A 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/ |
| H A 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
|