| /src/external/gpl3/gcc.old/dist/gcc/ |
| graphds.h | 0 /* Graph representation.
23 /* Structure representing edge of a graph. */
33 /* Structure representing vertex of a graph. */
45 /* Structure representing a graph. */
47 struct graph struct
54 struct graph *new_graph (int);
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
[all...] |
| shortest-paths.h | 29 node in the graph. */
32 /* Find the shortest path from each node in the graph to the
40 from the given origin node to each node in a graph, or
42 from each node in a graph to the given target node.
56 shortest_paths (const graph_t &graph, const node_t *given_node,
84 SPS_FROM_GIVEN_ORIGIN: to each node in a graph from the origin node, or
85 SPS_TO_GIVEN_TARGET: from each node in a graph to the target node. */
90 shortest_paths (const graph_t &graph,
93 : m_graph (graph),
95 m_dist (graph.m_nodes.length ())
[all...] |
| tree-ssa-structalias.cc | 129 5. A directed graph is built out of the copy constraints. Each
130 constraint variable is a node in the graph, and an edge from
133 6. The graph is then walked, and solution sets are
138 that node are processed by adding appropriate copy edges to the graph, or the
141 8. The process of walking the graph is iterated until no solution
144 Prior to walking the graph in steps 6 and 7, We perform static
145 cycle elimination on the constraint graph, as well
371 named NAME, and using constraint graph node NODE. Append it
545 /* List of constraints that we use to build the constraint graph from. */
550 /* The constraint graph is represented as an array of bitmap
624 static constraint_graph_t graph; variable
[all...] |
| /src/usr.bin/nbperf/ |
| graph2.c | 51 SIZED2(_setup)(struct SIZED(graph) *graph, uint32_t v, uint32_t e)
53 graph->v = v;
54 graph->e = e;
56 graph->verts = calloc(sizeof(*graph->verts), v);
57 graph->edges = calloc(sizeof(*graph->edges), e);
58 graph->output_order = calloc(sizeof(uint32_t), e);
60 if (graph->verts == NULL || graph->edges == NULL |
[all...] |
| nbperf-chm.c | 62 * of finding an acyclic graph is very low (for 2-graphs). The constant
65 * After the hashing phase, the graph is checked for cycles.
66 * A cycle-free graph is either empty or has a vertex of degree 1.
68 * so applying this recursively reduces the size of the graph.
69 * If the graph is empty at the end of the process, it was acyclic.
77 struct SIZED(graph) graph;
90 for (i = 0; i < state->graph.e; ++i) {
91 e_idx = state->graph.output_order[i];
92 e = &state->graph.edges[e_idx]
[all...] |
| graph2.h | 35 * Implementation of common 2/3-graph routines:
36 * - build a 2/3-graph with hash-pairs as edges
37 * - check a 2/3-graph for acyclicness and compute an output order
39 * For each vertex in the 2/3-graph, the incidence lists need to kept.
64 #define SIZED2(n) SIZED2_(graph, GRAPH_SIZE, n)
74 struct SIZED(graph) {
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)
[all...] |
| nbperf-bdz.c | 60 * an acyclic graph can be found with a very high probability.
62 * An acyclic graph has an edge order, where at least one vertex of
73 struct SIZED(graph) graph;
88 for (i = 0; i < state->graph.v; ++i)
91 for (i = 0; i < state->graph.e; ++i) {
92 j = state->graph.output_order[i];
93 e = &state->graph.edges[j];
120 for (i = 0; i < state->graph.v; ++i) {
155 (state->graph.v + 63) / 64)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| graphds.h | 0 /* Graph representation.
23 /* Structure representing edge of a graph. */
33 /* Structure representing vertex of a graph. */
45 /* Structure representing a graph. */
47 struct graph struct
54 struct graph *new_graph (int);
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
[all...] |
| shortest-paths.h | 29 node in the graph. */
32 /* Find the shortest path from each node in the graph to the
40 from the given origin node to each node in a graph, or
42 from each node in a graph to the given target node.
56 shortest_paths (const graph_t &graph, const node_t *given_node,
84 SPS_FROM_GIVEN_ORIGIN: to each node in a graph from the origin node, or
85 SPS_TO_GIVEN_TARGET: from each node in a graph to the target node. */
90 shortest_paths (const graph_t &graph,
93 : m_graph (graph),
95 m_dist (graph.m_nodes.length ())
[all...] |
| tree-ssa-structalias.cc | 129 5. A directed graph is built out of the copy constraints. Each
130 constraint variable is a node in the graph, and an edge from
133 6. The graph is then walked, and solution sets are
138 that node are processed by adding appropriate copy edges to the graph, or the
141 8. The process of walking the graph is iterated until no solution
144 Prior to walking the graph in steps 6 and 7, We perform static
145 cycle elimination on the constraint graph, as well
372 named NAME, and using constraint graph node NODE. Append it
546 /* List of constraints that we use to build the constraint graph from. */
551 /* The constraint graph is represented as an array of bitmap
625 static constraint_graph_t graph; variable
[all...] |
| /src/external/mit/isl/dist/ |
| isl_scheduler.c | 179 static int graph_init_table(isl_ctx *ctx, struct isl_sched_graph *graph)
183 graph->node_table = isl_hash_table_alloc(ctx, graph->n);
184 if (!graph->node_table)
187 for (i = 0; i < graph->n; ++i) {
191 hash = isl_space_get_tuple_hash(graph->node[i].space);
192 entry = isl_hash_table_find(ctx, graph->node_table, hash,
194 graph->node[i].space, 1);
197 entry->data = &graph->node[i];
207 struct isl_sched_graph *graph, __isl_keep isl_space *space
544 struct isl_sched_graph *graph = user; local
1042 struct isl_sched_graph *graph = user; local
1079 struct isl_sched_graph *graph; member in struct:isl_extract_edge_data
1270 struct isl_sched_graph *graph = data->graph; local
1427 struct isl_sched_graph *graph = user; local
1440 struct isl_sched_graph *graph = user; local
1500 struct isl_sched_graph *graph = data; local
2824 struct isl_sched_graph *graph = user; local
4054 struct isl_sched_graph *graph; member in struct:isl_add_all_constraints_data
4696 struct isl_sched_graph *graph; member in struct:isl_collect_bounds_data
5890 struct isl_sched_graph graph = { 0 }; local
[all...] |
| isl_scheduler_clustering.h | 8 * "n" is the number of SCCs in the original dependence graph
10 * of the original dependence graph. All entries in the same cluster
37 __isl_take isl_schedule_node *node, struct isl_sched_graph *graph);
|
| isl_scheduler_clustering.c | 21 /* Initialize the clustering data structure "c" from "graph".
23 * In particular, allocate memory, extract the SCCs from "graph"
30 struct isl_sched_graph *graph)
34 c->n = graph->scc;
45 if (isl_sched_graph_extract_sub_graph(ctx, graph,
80 /* Should we refrain from merging the cluster in "graph" with
84 static int bad_cluster(struct isl_sched_graph *graph)
86 return graph->n_row < graph->maxvar &&
87 graph->n_total_row == graph->band_start
161 struct isl_sched_graph *graph; member in struct:isl_mark_merge_sccs_data
179 struct isl_sched_graph *graph = data->graph; local
1309 struct isl_sched_graph *graph = user; local
[all...] |
| isl_scheduler.h | 101 /* An edge in the dependence graph. An edge may be used to
137 * be retrieved by adding 1 + graph->max_weight, with "graph"
138 * the graph containing this edge.
164 /* Internal information about the dependence graph used during
187 * root is set to the original dependence graph from which this graph
188 * is derived through splitting. If this graph is not the result of
189 * splitting, then the root field points to the graph itself.
197 * in particular, it contains the number of edges in the inital graph
[all...] |
| isl_scheduler_scc.h | 12 struct isl_sched_graph *graph, struct isl_clustering *c);
|
| /src/usr.sbin/hdaudioctl/ |
| Makefile | 5 SRCS+= graph.c
|
| /src/external/apache2/llvm/dist/libcxx/utils/ |
| graph_header_deps.py | 89 def transitive_closure_of_includes(graph, h1):
91 def explore(graph, h1):
94 for h2 in graph[h1].includes:
95 explore(graph, h2)
96 explore(graph, h1)
100 def transitively_includes(graph, h1, h2):
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
188 graph = build_graph(roots, options) variable
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/config/os/generic/ |
| ctype_base.h | 51 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/config/os/generic/ |
| ctype_base.h | 51 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| reachability.h | 37 reachability (const graph_t &graph,
39 : m_indices (graph.m_nodes.length ())
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| reachability.h | 37 reachability (const graph_t &graph,
39 : m_indices (graph.m_nodes.length ())
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/config/os/mingw32/ |
| ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/config/os/mingw32-w64/ |
| ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/config/os/mingw32/ |
| ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/config/os/mingw32-w64/ |
| ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
