/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | graphds.c | 40 if (!g->vertices[i].pred in dump_graph() 41 && !g->vertices[i].succ) in dump_graph() 75 struct vertex *vf = &g->vertices[f], *vt = &g->vertices[t]; in add_edge() 169 e = (forward ? g->vertices[v].succ : g->vertices[v].pred); in dfs_fst_edge() 203 g->vertices[av].component = -1; in graphds_dfs() 204 g->vertices[av].post = -1; in graphds_dfs() 211 g->vertices[i].component = -1; in graphds_dfs() 212 g->vertices[i].post = -1; in graphds_dfs() 219 if (g->vertices[v].post != -1) in graphds_dfs() 335 v = &g->vertices[i]; in free_graph() [all …]
|
H A D | tree-loop-distribution.c | 564 struct vertex *x = &(rdg->vertices[u]); in rdg_flag_uses() 738 FOR_EACH_VEC_ELT (int, c->vertices, i, v) in build_rdg_partition_for_component() 760 VEC_free (int, heap, x->vertices); in free_rdg_components() 787 int c = rdg->vertices[v].component; in rdg_build_components() 793 x->vertices = all_components[c]; in rdg_build_components() 951 int v = VEC_index (int, x->vertices, 0); in rdg_build_partitions() 1176 VEC (int, heap) *vertices; in distribute_loop() 1209 vertices = VEC_alloc (int, heap, 3); in distribute_loop() 1220 VEC_safe_push (int, heap, vertices, v); in distribute_loop() 1228 res = ldist_gen (loop, rdg, vertices); in distribute_loop() [all …]
|
H A D | cfgloopanal.c | 146 for (ge = g->vertices[i].succ; ge; ge = ge->succ_next) in mark_irreducible_loops() 154 gcc_assert (g->vertices[ge->src].component >= g->vertices[ge->dest].component); in mark_irreducible_loops() 156 if (g->vertices[ge->src].component != g->vertices[ge->dest].component) in mark_irreducible_loops()
|
H A D | tree-data-ref.h | 566 #define RDG_STMT(RDG, I) RDGV_STMT (&(RDG->vertices[I])) 567 #define RDG_MEM_WRITE_STMT(RDG, I) RDGV_HAS_MEM_WRITE (&(RDG->vertices[I])) 568 #define RDG_MEM_READS_STMT(RDG, I) RDGV_HAS_MEM_READS (&(RDG->vertices[I])) 674 VEC (int, heap) *vertices;
|
H A D | graphds.h | 48 struct vertex *vertices; member
|
H A D | graphite-sese-to-poly.c | 1820 int *vertices; in build_alias_set_optimal_p() local 1834 vertices = XNEWVEC (int, num_vertices); in build_alias_set_optimal_p() 1849 *(bap->alias_set) = g->vertices[i].component + 1; in build_alias_set_optimal_p() 1858 if (g->vertices[j].component == i) in build_alias_set_optimal_p() 1859 vertices[num_vertices_in_component++] = j; in build_alias_set_optimal_p() 1870 e = g->vertices[vertices[v_indx2]].pred; in build_alias_set_optimal_p() 1873 if (e->src == vertices[v_indx1]) in build_alias_set_optimal_p() 1889 free (vertices); in build_alias_set_optimal_p() 1927 bap->base_obj_set = g->vertices[i].component + 1; in build_base_obj_set_for_drs()
|
H A D | dominance.c | 1195 VEC_safe_push (int, heap, sccs[g->vertices[a].component], a); in determine_dominators_for_sons() 1347 g->vertices[y].data = BITMAP_ALLOC (NULL); in iterate_fix_dominators() 1359 if (!bitmap_set_bit ((bitmap) g->vertices[dom_i].data, i)) in iterate_fix_dominators() 1366 BITMAP_FREE (g->vertices[y].data); in iterate_fix_dominators()
|
H A D | tree-data-ref.c | 4793 struct vertex *v = &(rdg->vertices[i]); in dump_rdg_vertex() 4833 if (rdg->vertices[i].component == c) in dump_rdg_component() 4864 dump_rdg_component (file, rdg, rdg->vertices[i].component, dumped); in dump_rdg() 4887 struct vertex *v = &(rdg->vertices[i]); in dot_rdg_1() 5075 struct vertex *v = &(rdg->vertices[i]); in create_rdg_vertices() 5236 struct vertex *v = &(rdg->vertices[i]); in free_rdg()
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | graphds.c | 36 if (!g->vertices[i].pred in dump_graph() 37 && !g->vertices[i].succ) in dump_graph() 73 struct vertex *vf = &g->vertices[f], *vt = &g->vertices[t]; in add_edge() 93 struct vertex *vv = &g->vertices[v]; in identify_vertices() 94 struct vertex *uu = &g->vertices[u]; in identify_vertices() 178 e = (forward ? g->vertices[v].succ : g->vertices[v].pred); in dfs_fst_edge() 218 g->vertices[av].component = -1; in graphds_dfs() 219 g->vertices[av].post = -1; in graphds_dfs() 226 g->vertices[i].component = -1; in graphds_dfs() 227 g->vertices[i].post = -1; in graphds_dfs() [all …]
|
H A D | tree-loop-distribution.c | 221 struct vertex *v = &(rdg->vertices[i]); in dump_rdg_vertex() 282 struct vertex *v = &(rdg->vertices[i]); in dot_rdg_1() 447 struct vertex *v = &(rdg->vertices[i]); in create_rdg_vertices() 2005 pg->vertices[i].data = data; in init_partition_graph_vertices() 2183 if (pg->vertices[j].component == i) in merge_dep_scc_partitions() 2186 if (pg->vertices[j].component == i) in merge_dep_scc_partitions() 2230 if (g->vertices[i].post < g->vertices[j].post in pg_collect_alias_ddrs() 2271 if (pg->vertices[j].component == i) in break_alias_scc_partitions() 2275 if (pg->vertices[j].component != i) in break_alias_scc_partitions() 2337 gcc_assert (pg->vertices[k].post < pg->vertices[j].post); in break_alias_scc_partitions() [all …]
|
H A D | cfgloopanal.c | 149 for (ge = g->vertices[i].succ; ge; ge = ge->succ_next) in mark_irreducible_loops() 157 gcc_assert (g->vertices[ge->src].component >= g->vertices[ge->dest].component); in mark_irreducible_loops() 159 if (g->vertices[ge->src].component != g->vertices[ge->dest].component) in mark_irreducible_loops()
|
H A D | graphds.h | 50 struct vertex *vertices; /* The vertices. */ member
|
H A D | dominance.c | 1341 sccs[g->vertices[a].component].safe_push (a); in determine_dominators_for_sons() 1491 g->vertices[y].data = BITMAP_ALLOC (NULL); in iterate_fix_dominators() 1503 if (!bitmap_set_bit ((bitmap) g->vertices[dom_i].data, i)) in iterate_fix_dominators() 1510 BITMAP_FREE (g->vertices[y].data); in iterate_fix_dominators()
|
/dragonfly/games/gomoku/ |
H A D | pickmove.c | 655 struct overlap_info vertices[1]; in makecombo() local 665 memset(vertices, 0, sizeof(vertices)); in makecombo() 755 ncbp->c_voff[0] = vertices[0].o_off; in makecombo() 1143 vertices->o_intersect = n; in checkframes() 1144 vertices->o_fcombo = cbp; in checkframes() 1145 vertices->o_link = 1; in checkframes() 1148 vertices->o_frameindex = myindex; in checkframes() 1193 vertices->o_intersect = n; in checkframes() 1194 vertices->o_fcombo = lcbp; in checkframes() 1195 vertices->o_link = 0; in checkframes() [all …]
|
/dragonfly/contrib/file/magic/Magdir/ |
H A D | games | 14 >24 long x %u vertices/frame,
|
/dragonfly/contrib/gcc-4.7/gcc/doc/ |
H A D | cfg.texi | 19 being compiled. The CFG is a directed graph where the vertices
|
/dragonfly/share/dict/ |
H A D | web2 | 228198 vertices
|