| /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()
207 struct isl_sched_graph *graph, __isl_keep isl_space *space) in isl_sched_graph_find_node()
228 int isl_sched_graph_is_node(struct isl_sched_graph *graph, in isl_sched_graph_is_node()
245 struct isl_sched_graph *graph, enum isl_edge_type type, in graph_edge_table_add()
267 struct isl_sched_graph *graph, struct isl_sched_edge *edge) in graph_edge_tables_add()
284 static int graph_init_edge_tables(isl_ctx *ctx, struct isl_sched_graph *graph) in graph_init_edge_tables()
303 struct isl_sched_graph *graph, in graph_find_edge_entry()
324 static struct isl_sched_edge *graph_find_edge(struct isl_sched_graph *graph, in graph_find_edge()
343 static isl_bool graph_has_edge(struct isl_sched_graph *graph, in graph_has_edge()
369 struct isl_sched_graph *graph, struct isl_sched_edge *model) in graph_find_matching_edge()
[all …]
|
| H A D | isl_scheduler_clustering.c | 30 struct isl_sched_graph *graph) in clustering_init()
84 static int bad_cluster(struct isl_sched_graph *graph) in bad_cluster()
114 static int find_proximity(struct isl_sched_graph *graph, in find_proximity()
161 struct isl_sched_graph *graph; member
179 struct isl_sched_graph *graph = data->graph; in cluster_follows() local
215 static isl_stat mark_merge_sccs(isl_ctx *ctx, struct isl_sched_graph *graph, in mark_merge_sccs()
296 struct isl_sched_graph *graph, struct isl_clustering *c) in collect_domain()
323 struct isl_sched_graph *graph, struct isl_clustering *c) in collect_cluster_map()
475 struct isl_sched_graph *graph, int *scc_in_merge, in collect_constraints()
505 static isl_stat init_merge_graph(isl_ctx *ctx, struct isl_sched_graph *graph, in init_merge_graph()
[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
|
| H A D | shortest-paths.h | 64 shortest_paths<GraphTraits, Path_t>::shortest_paths (const graph_t &graph, in shortest_paths()
|
| H A D | tree-ssa-structalias.c | 616 static constraint_graph_t graph; variable
1051 insert_into_complex (constraint_graph_t graph, in insert_into_complex()
1069 merge_node_constraints (constraint_graph_t graph, unsigned int to, in merge_node_constraints()
1103 clear_edges_for_node (constraint_graph_t graph, unsigned int node) in clear_edges_for_node()
1112 merge_graph_nodes (constraint_graph_t graph, unsigned int to, in merge_graph_nodes()
1144 add_implicit_graph_edge (constraint_graph_t graph, unsigned int to, in add_implicit_graph_edge()
1162 add_pred_graph_edge (constraint_graph_t graph, unsigned int to, in add_pred_graph_edge()
1175 add_graph_edge (constraint_graph_t graph, unsigned int to, in add_graph_edge()
1422 scc_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) in scc_visit()
1502 unify_nodes (constraint_graph_t graph, unsigned int to, unsigned int from, in unify_nodes()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | graphds.h | 47 struct graph struct
54 struct graph *new_graph (int); argument
|
| H A D | tree-ssa-structalias.cc | 624 static constraint_graph_t graph; variable
1065 insert_into_complex (constraint_graph_t graph, in insert_into_complex()
1083 merge_node_constraints (constraint_graph_t graph, unsigned int to, in merge_node_constraints()
1117 clear_edges_for_node (constraint_graph_t graph, unsigned int node) in clear_edges_for_node()
1126 merge_graph_nodes (constraint_graph_t graph, unsigned int to, in merge_graph_nodes()
1158 add_implicit_graph_edge (constraint_graph_t graph, unsigned int to, in add_implicit_graph_edge()
1176 add_pred_graph_edge (constraint_graph_t graph, unsigned int to, in add_pred_graph_edge()
1189 add_graph_edge (constraint_graph_t graph, unsigned int to, in add_graph_edge()
1452 scc_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) in scc_visit()
1532 unify_nodes (constraint_graph_t graph, unsigned int to, unsigned int from, in unify_nodes()
[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
100 def transitively_includes(graph, h1, h2): argument
127 def get_graphviz(graph, options): argument
188 graph = build_graph(roots, options) variable
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/config/os/bsd/freebsd/ |
| H A 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/ |
| H A 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/gcc.old/dist/libstdc++-v3/config/os/bsd/darwin/ |
| H A 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/gcc.old/dist/libstdc++-v3/config/os/bsd/freebsd/ |
| H A 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.old/dist/gcc/analyzer/ |
| H A D | reachability.h | 37 reachability (const graph_t &graph, in reachability()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/ |
| H A D | reachability.h | 37 reachability (const graph_t &graph, in reachability()
|
| /netbsd-src/external/apache2/llvm/dist/clang/utils/analyzer/ |
| H A D | exploded-graph-rewriter.py | 477 def visit_begin_graph(self, graph): argument
891 def explore(self, graph, visitor): argument
911 def trim(self, graph): argument
939 def parse_target_node(node, graph): argument
951 def parse_target_nodes(target_nodes, graph): argument
955 def trim(self, graph): argument
|
| /netbsd-src/external/bsd/byacc/dist/ |
| H A D | graph.c | 15 graph(void) in graph() function
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/config/os/solaris/ |
| H A D | ctype_base.h | 53 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; in _GLIBCXX_VISIBILITY() member
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/config/os/tpf/ |
| H A D | ctype_base.h | 51 static const mask graph = _ISalpha | _ISdigit | _ISpunct; in _GLIBCXX_VISIBILITY() member
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/config/os/bionic/ |
| H A D | ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; in _GLIBCXX_VISIBILITY() member
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/config/os/mingw32-w64/ |
| H A D | ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct in _GLIBCXX_VISIBILITY() member
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/config/os/bsd/dragonfly/ |
| H A D | ctype_base.h | 51 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; in _GLIBCXX_VISIBILITY() member
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/config/os/vxworks/ |
| H A D | ctype_base.h | 52 static const mask graph = _C_UPPER | _C_LOWER | _C_NUMBER | _C_PUNCT; in _GLIBCXX_VISIBILITY() member
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/config/os/solaris/solaris2.10/ |
| H A D | ctype_base.h | 53 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; in _GLIBCXX_VISIBILITY() member
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/config/os/bsd/netbsd/ |
| H A D | ctype_base.h | 55 static const mask graph = _CTYPE_G; in _GLIBCXX_VISIBILITY() member
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/config/os/gnu-linux/ |
| H A D | ctype_base.h | 56 static const mask graph = _ISalpha | _ISdigit | _ISpunct; in _GLIBCXX_VISIBILITY() member
|