Searched refs:graph (Results 1 - 25 of 52) sorted by relevance

123

/haiku-buildtools/gcc/gcc/
H A Dgraphds.h23 /* 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);
58 int graphds_dfs (struct graph *, int *, int,
60 int graphds_scc (struct graph *, bitma
[all...]
H A Dtree-ssa-structalias.c166 5. A directed graph is built out of the copy constraints. Each
167 constraint variable is a node in the graph, and an edge from
170 6. The graph is then walked, and solution sets are
175 that node are processed by adding appropriate copy edges to the graph, or the
178 8. The process of walking the graph is iterated until no solution
181 Prior to walking the graph in steps 6 and 7, We perform static
182 cycle elimination on the constraint graph, as well
391 named NAME, and using constraint graph node NODE. Append it
554 /* List of constraints that we use to build the constraint graph from. */
559 /* The constraint graph i
633 static constraint_graph_t graph; variable
1066 insert_into_complex(constraint_graph_t graph, unsigned int var, constraint_t c) argument
1084 merge_node_constraints(constraint_graph_t graph, unsigned int to, unsigned int from) argument
1118 clear_edges_for_node(constraint_graph_t graph, unsigned int node) argument
1127 merge_graph_nodes(constraint_graph_t graph, unsigned int to, unsigned int from) argument
1159 add_implicit_graph_edge(constraint_graph_t graph, unsigned int to, unsigned int from) argument
1177 add_pred_graph_edge(constraint_graph_t graph, unsigned int to, unsigned int from) argument
1190 add_graph_edge(constraint_graph_t graph, unsigned int to, unsigned int from) argument
1433 scc_visit(constraint_graph_t graph, struct scc_info *si, unsigned int n) argument
1513 unify_nodes(constraint_graph_t graph, unsigned int to, unsigned int from, bool update_changed) argument
1605 topo_visit(constraint_graph_t graph, struct topo_info *ti, unsigned int n) argument
1627 do_sd_constraint(constraint_graph_t graph, constraint_t c, bitmap delta, bitmap *expanded_delta) argument
1817 do_complex_constraint(constraint_graph_t graph, constraint_t c, bitmap delta, bitmap *expanded_delta) argument
1900 find_indirect_cycles(constraint_graph_t graph) argument
1917 compute_topo_order(constraint_graph_t graph, struct topo_info *ti) argument
2052 condense_visit(constraint_graph_t graph, struct scc_info *si, unsigned int n) argument
2157 label_visit(constraint_graph_t graph, struct scc_info *si, unsigned int n) argument
2316 perform_var_substitution(constraint_graph_t graph) argument
2469 find_equivalent_node(constraint_graph_t graph, unsigned int node, unsigned int label) argument
2510 unite_pointer_equivalences(constraint_graph_t graph) argument
2536 move_complex_constraints(constraint_graph_t graph) argument
2572 rewrite_constraints(constraint_graph_t graph, struct scc_info *si) argument
2683 solve_graph(constraint_graph_t graph) argument
6700 remove_preds_and_fake_succs(constraint_graph_t graph) argument
[all...]
H A Dgraphds.c28 /* Dumps graph G into F. */
31 dump_graph (FILE *f, struct graph *g)
54 /* Creates a new graph with N_VERTICES vertices. */
56 struct graph *
59 struct graph *g = XNEW (struct graph);
69 /* Adds an edge from F to T to graph G. The new edge is returned. */
72 add_edge (struct graph *g, int f, int t)
92 identify_vertices (struct graph *g, int v, int u)
138 E), in the graph directio
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr44546.c14 compute_apsp_artifical_weights_packed (vtx_data * graph, int n) argument
20 whatever (graph) > graph[n].ewgts[n] ?
21 whatever (graph) : graph[n].ewgts[n];
/haiku-buildtools/isl/
H A Disl_schedule.c95 /* An edge in the dependence graph. An edge may be used to
129 /* Internal information about the dependence graph used during
146 * root is set if this graph is the original dependence graph,
155 * in particular, it contains the number of edges in the inital graph.
209 static int graph_init_table(isl_ctx *ctx, struct isl_sched_graph *graph) argument
213 graph->node_table = isl_hash_table_alloc(ctx, graph->n);
214 if (!graph->node_table)
217 for (i = 0; i < graph
236 graph_find_node(isl_ctx *ctx, struct isl_sched_graph *graph, __isl_keep isl_space *dim) argument
259 graph_edge_table_add(isl_ctx *ctx, struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_edge *edge) argument
280 graph_init_edge_tables(isl_ctx *ctx, struct isl_sched_graph *graph) argument
298 graph_find_edge_entry( struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) argument
319 graph_find_edge(struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) argument
335 graph_has_edge(struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) argument
357 graph_find_any_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) argument
374 graph_remove_edge(struct isl_sched_graph *graph, struct isl_sched_edge *edge) argument
395 graph_has_any_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) argument
413 graph_has_validity_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) argument
419 graph_alloc(isl_ctx *ctx, struct isl_sched_graph *graph, int n_node, int n_edge) argument
445 graph_free(isl_ctx *ctx, struct isl_sched_graph *graph) argument
481 struct isl_sched_graph *graph = user; local
501 compute_max_row(struct isl_sched_graph *graph, __isl_keep isl_union_set *domain) argument
521 struct isl_sched_graph *graph = user; local
553 struct isl_sched_graph *graph; member in struct:isl_extract_edge_data
567 struct isl_sched_graph *graph = data->graph; local
623 struct isl_sched_graph *graph = user; local
636 struct isl_sched_graph *graph = user; local
647 detect_ccs(isl_ctx *ctx, struct isl_sched_graph *graph, int weak) argument
678 detect_sccs(isl_ctx *ctx, struct isl_sched_graph *graph) argument
686 detect_wccs(isl_ctx *ctx, struct isl_sched_graph *graph) argument
693 struct isl_sched_graph *graph = data; local
702 sort_sccs(struct isl_sched_graph *graph) argument
724 intra_coefficients( struct isl_sched_graph *graph, __isl_take isl_map *map) argument
750 inter_coefficients( struct isl_sched_graph *graph, __isl_take isl_map *map) argument
785 add_intra_validity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge) argument
843 add_inter_validity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge) argument
935 add_intra_proximity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, int s) argument
1015 add_inter_proximity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, int s) argument
1080 add_all_validity_constraints(struct isl_sched_graph *graph) argument
1115 add_all_proximity_constraints(struct isl_sched_graph *graph) argument
1192 count_map_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int *n_eq, int *n_ineq, int carry) argument
1224 count_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq) argument
1248 add_bound_coefficient_constraints(isl_ctx *ctx, struct isl_sched_graph *graph) argument
1313 setup_lp(isl_ctx *ctx, struct isl_sched_graph *graph, int force_zero) argument
1431 struct isl_sched_graph *graph = user; local
1465 needs_row(struct isl_sched_graph *graph, struct isl_sched_node *node) argument
1482 solve_lp(struct isl_sched_graph *graph) argument
1519 update_schedule(struct isl_sched_graph *graph, __isl_take isl_vec *sol, int use_cmap, int check_zero) argument
1675 update_edges(isl_ctx *ctx, struct isl_sched_graph *graph) argument
1692 next_band(struct isl_sched_graph *graph) argument
1701 sort_statements(isl_ctx *ctx, struct isl_sched_graph *graph) argument
1748 extract_schedule(struct isl_sched_graph *graph, __isl_take isl_space *dim) argument
1936 compute_maxvar(struct isl_sched_graph *graph) argument
1968 compute_sub_schedule(isl_ctx *ctx, struct isl_sched_graph *graph, int n, int n_edge, int (*node_pred)(struct isl_sched_node *node, int data), int (*edge_pred)(struct isl_sched_edge *edge, int data), int data, int wcc) argument
2043 pad_schedule(struct isl_sched_graph *graph) argument
2085 compute_split_schedule(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2168 compute_next_band(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2192 add_intra_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int pos) argument
2241 add_inter_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int pos) argument
2295 add_all_constraints(struct isl_sched_graph *graph) argument
2331 count_all_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq) argument
2387 setup_carry_lp(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2473 split_scaled(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2600 is_any_trivial(struct isl_sched_graph *graph, __isl_keep isl_vec *sol) argument
2626 carry_dependences(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2681 has_validity_edges(struct isl_sched_graph *graph) argument
2704 need_feautrier_step(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2722 compute_schedule_wcc_feautrier(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2752 compute_schedule_wcc(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2805 split_on_scc(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2842 compute_component_schedule(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2897 compute_schedule(isl_ctx *ctx, struct isl_sched_graph *graph) argument
2928 struct isl_sched_graph graph = { 0 }; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/config/os/generic/
H A Dctype_base.h51 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/testsuite/22_locale/ctype_base/
H A D11844.cc31 VERIFY( ctb::graph == (ctb::alnum | ctb::punct) );
/haiku-buildtools/gcc/libstdc++-v3/config/os/mingw32-w64/
H A Dctype_base.h57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/mingw32/
H A Dctype_base.h57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/haiku/
H A Dctype_base.h51 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/uclibc/
H A Dctype_base.h58 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/aix/
H A Dctype_base.h51 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/bsd/dragonfly/
H A Dctype_base.h51 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/djgpp/
H A Dctype_base.h53 static const mask graph = __dj_ISALPHA | __dj_ISDIGIT | __dj_ISPUNCT; // Graphical member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/gnu-linux/
H A Dctype_base.h56 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/hpux/
H A Dctype_base.h51 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/solaris/solaris2.10/
H A Dctype_base.h53 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/tpf/
H A Dctype_base.h51 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/bsd/darwin/
H A Dctype_base.h53 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member in struct:ctype_base
67 static const mask graph = _A | _D | _P; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/bsd/netbsd/
H A Dctype_base.h56 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
68 static const mask graph = _CTYPE_P | _CTYPE_U | _CTYPE_L | _CTYPE_N; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/bsd/freebsd/
H A Dctype_base.h55 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member in struct:ctype_base
69 static const mask graph = _A | _D | _P; member in struct:ctype_base
H A Dctype_inline.h63 | space | print | graph | cntrl | punct | alnum
74 if (this->is(graph, *__low)) __m |= graph;
128 | space | print | graph | cntrl | punct | alnum
/haiku-buildtools/gcc/libstdc++-v3/config/os/newlib/
H A Dctype_base.h51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/vxworks/
H A Dctype_base.h52 static const mask graph = _C_UPPER | _C_LOWER | _C_NUMBER | _C_PUNCT; member in struct:ctype_base
/haiku-buildtools/gcc/libstdc++-v3/config/os/bionic/
H A Dctype_base.h51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base

Completed in 193 milliseconds

123