Searched refs:edges (Results 1 - 16 of 16) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dfinalize_28.f9015 type(dynamic_array) :: edges(2) component in type:coo_graph
19 subroutine coo_dump_edges(g, edges)
21 integer, intent(out) :: edges(:,:)
/haiku-buildtools/gcc/gcc/
H A Dprofile.h25 /* Additional information about edges. */
48 extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
H A Dbasic-block.h121 /* The edges into and out of the block. */
300 /* Number of edges in the compressed edge list. */
384 /* Iterator object for edges. */
493 vector of predecessor or successor edges. It must not be used when
533 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
548 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
565 find_fallthru_edge (vec<edge, va_gc> *edges)
570 FOR_EACH_EDGE (e, ei, edges)
564 find_fallthru_edge(vec<edge, va_gc> *edges) argument
H A Dcfghooks.c218 error ("wrong amount of branch edges after unconditional jump %i", bb->index);
346 fprintf (file, "\n%d basic blocks, %d edges.\n", n_basic_blocks_for_fn (cfun),
364 be equivalent to E in the case of duplicate edges being removed) or NULL
600 /* Remove the edges into and out of this block. Note that there may
601 indeed be edges in, if we are removing an unreachable loop. */
805 /* Adjust the edges out of B for the new owner. */
835 Redirect those edges for that REDIRECT_EDGE_P returns true to the entry
858 /* Redirect back edges we want to keep. */
946 /* Fix up edges that now fall through, or rather should now fall through
977 not create duplicate edges)
1327 copy_bbs(basic_block *bbs, unsigned n, basic_block *new_bbs, edge *edges, unsigned num_edges, edge *new_edges, struct loop *base, basic_block after, bool update_dominance) argument
[all...]
H A Dloop-unroll.c656 /* Remove the edges. */
1078 /* Remove the edges. */
1548 vec<edge> edges = get_loop_exit_edges (loop); local
1567 if (edges.length () == 1)
1569 exit = edges[0];
1624 edges.release ();
H A Dsel-sched-ir.h1087 /* Return exit edges of LOOP, filtering out edges with the same dest bb. */
1091 vec<edge> edges = vNULL;
1103 for (i = 0; edges.iterate (i, &e); i++)
1111 edges.safe_push (exit->e);
1113 return edges;
1381 FLAGS are used to specify whether back edges and out-of-region edges
1463 /* This is a back edge. During pipelining we ignore back edges,
1080 vec<edge> edges = vNULL; local
H A Dcfgloop.c105 /* Returns the list of the latch edges of LOOP. */
394 /* Look for back edges where a predecessor is dominated
532 /* Ratio of frequencies of edges so that one of more latch edges is
541 frequent than the remaining edges. Returns such an edge, or NULL if we do
585 the other latch edges. Additionally, the header does not contain a phi node
604 /* Verify that it dominates all the latch edges. */
637 /* If we can determine that one of the several latch edges of LOOP behaves
702 /* Make all the latch edges of LOOP to go to a single forwarder block --
719 fprintf (dump_file, "Merged latch edges o
1145 vec<edge> edges = vNULL; local
[all...]
H A Dira-build.c62 because it is used for insertion of insns on edges. */
146 vec<edge> edges;
191 edges = get_loop_exit_edges (loop);
192 FOR_EACH_VEC_ELT (edges, j, e)
198 edges.release ();
2018 vec<edge> edges;
2025 edges = get_loop_exit_edges (loop_node->loop);
2026 FOR_EACH_VEC_ELT (edges, i, e)
2028 edges.release ();
2213 because reg-stack.c can not deal with such edges
145 vec<edge> edges; local
2009 vec<edge> edges; local
2210 vec<edge> edges; local
[all...]
H A Dtree-ssa-uninit.c330 /* Ignore SSA_NAMEs that appear on abnormal edges
417 /* Computes the control dependence chains (paths of edges)
524 /* Converts the chains of control dependence edges into a set of
526 edges. DEP_CHAINS points to an array of dependence chains.
703 /* Computes the set of incoming edges of PHI that have non empty
711 vec<edge> *edges,
734 edges->safe_push (opnd_edge);
743 collect_phi_def_edges (as_a <gphi *> (def), cd_root, edges,
752 edges->safe_push (opnd_edge);
1111 we can further prune the incoming edges o
710 collect_phi_def_edges(gphi *phi, basic_block cd_root, vec<edge> *edges, hash_set<gimple> *visited_phis) argument
[all...]
H A Dprofile.c29 EDGE_FAKE edges to the EXIT_BLOCK, from the sources of abnormal
30 edges that do not go to the exit_block. We ignore such abnormal
31 edges. Naturally these fake edges are never directly traversed,
34 BB minimal span tree, only edges that are not on the span tree
37 edges must be on the spanning tree. We also attempt to place
38 EDGE_CRITICAL edges on the spanning tree.
110 /* Number of successor and predecessor edges. */
185 fprintf (dump_file, "%d edges instrumented\n", num_instr_edges);
319 /* Count the edges t
345 is_edge_inconsistent(vec<edge, va_gc> *edges) argument
[all...]
H A Dcfganal.c47 /* number of edges in the stack. That is, positions 0, ..., sp-1
48 have edges. */
64 /* Mark the back edges in DFS traversal.
221 flowgraph is processed, and all edges are assigned a number,
233 /* Determine the number of edges in the flow graph by counting successor
234 edges on each basic block. */
248 /* Follow successors of blocks, and register these edges. */
276 fprintf (f, "Compressed edge list, %d BBs + entry & exit, and %d edges\n",
295 verifying that all edges are present, and that there are no
296 extra edges
438 control_dependences(struct edge_list *edges) argument
[all...]
H A Dbb-reorder.c60 in order to reduce long jumps and connect more fallthru edges, the
66 (2) Ignore the edge probability and frequency for fallthru edges.
190 /* Cached maximum frequency of interesting incoming edges.
602 /* If partitioning hot/cold basic blocks, don't consider edges
817 edges for successors of the new trace end. */
1000 /* The edges have equivalent probabilities and the successors
1007 non-crossing edges over crossing edges. */
1439 /* The landing pad OLD_LP, in block OLD_BB, has edges from both partitions.
1440 Duplicate the landing pad and split the edges s
1525 vec<edge, va_gc> *edges = walk_up ? bb->preds : bb->succs; local
[all...]
H A Dira-color.c2429 /* Return the frequency of exit edges (if EXIT_P) or entry from/to the
2437 vec<edge> edges;
2453 edges = get_loop_exit_edges (loop_node->loop);
2454 FOR_EACH_VEC_ELT (edges, i, e)
2459 edges.release ();
2431 vec<edge> edges; local
H A Dtree-vrp.c195 number of executable edges we saw the last time we visited the
4894 abnormal edges. */
5850 abnormal edges. */
5911 /* Determine whether the outgoing edges of BB should receive an
5931 rooted at BB. We need to check each of the outgoing edges
5983 /* Determine whether the outgoing edges of BB should receive an
7059 to do so means that those edges will never get added. */
7093 but signal to not follow SSA edges. */
8759 edges. If a valid value range can be derived from all the incoming
8770 int edges, old_edge local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/
H A Descape5.go116 // without this, leakrecursive? are safe for p and q, b/c in fact their graph does not have leaking edges.
/haiku-buildtools/isl/doc/
H A Dimplementation.tex1688 the parts of the partition and as edges the $R_i$ attached to

Completed in 303 milliseconds