Searched refs:succ (Results 1 - 25 of 39) sorted by relevance

12

/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A Dpr25737.c4 struct delay_block *succ; member in struct:delay_block
11 struct delay_block *q = Timer_Queue.succ;
12 d->succ = (void *)0;
13 return Timer_Queue.succ;
18 Timer_Queue.succ = &Timer_Queue;
/haiku-buildtools/gcc/gcc/
H A Dgraphds.h37 struct graph_edge *pred, *succ; member in struct:vertex
H A Dgraphds.c39 && !g->vertices[i].succ)
48 for (e = g->vertices[i].succ; e; e = e->succ_next)
83 e->succ_next = vf->succ;
84 vf->succ = e;
98 for (e = uu->succ; e; e = next)
103 e->succ_next = vv->succ;
104 vv->succ = e;
106 uu->succ = NULL;
168 e = (forward ? g->vertices[v].succ : g->vertices[v].pred);
319 for (e = g->vertices[i].succ;
[all...]
H A Dtree-cfgcleanup.c421 edge succ = single_succ_edge (bb), e, s; local
422 basic_block dest = succ->dest;
470 if (!phi_alternatives_equal (dest, succ, s))
504 source_location l = gimple_phi_arg_location_from_edge (phi, succ);
505 tree def = gimple_phi_arg_def (phi, succ->dest_idx);
825 edge succ = single_succ_edge (bb); local
826 basic_block dest = succ->dest;
862 if (phi_alternatives_equal (dest, s, succ))
887 tree def = gimple_phi_arg_def (phi, succ->dest_idx);
888 source_location locus = gimple_phi_arg_location_from_edge (phi, succ);
[all...]
H A Dsel-sched.c622 in_fallthru_bb_p (rtx insn, rtx succ)
627 if (bb == BLOCK_FOR_INSN (succ))
639 return bb == BLOCK_FOR_INSN (succ);
652 insn_t succ;
673 insn_t succ;
675 succ = (sel_bb_end_p (insn)
679 if (INSN_SEQNO (succ) > 0
680 && INSN_SEQNO (succ) <= orig_max_seqno
681 && INSN_SCHED_TIMES (succ) <= 0)
683 FENCE_INSN (fence) = succ;
618 in_fallthru_bb_p(rtx insn, rtx succ) argument
648 insn_t succ; local
669 insn_t succ; local
2773 insn_t succ, zero_succ = NULL; local
3205 rtx_insn *succ; local
4617 basic_block succ; local
5425 insn_t succ; local
5817 fur_merge_succs(insn_t insn ATTRIBUTE_UNUSED, insn_t succ, int moveop_drv_call_res, cmpd_local_params_p lparams ATTRIBUTE_UNUSED, void *static_params) argument
6357 insn_t succ; local
6791 basic_block succ = BLOCK_FOR_INSN (succ_insn); local
[all...]
H A Dhw-doloop.c315 basic_block succ = EDGE_SUCC (bb, ei.index)->dest; local
316 if (REGNO_REG_SET_P (df_get_live_in (succ),
318 works.safe_push (succ);
414 basic_block succ = FALLTHRU_EDGE (bb)->dest; local
420 if (!REGNO_REG_SET_P (df_get_live_in (succ), REGNO (reg)))
H A Dlcm.c99 This is done based on the flow graph, and not on the pred-succ lists.
195 basic_block pred, succ;
205 succ = INDEX_EDGE_SUCC_BB (edge_list, x);
207 bitmap_copy (earliest[x], antin[succ->index]);
210 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun))
214 bitmap_and_compl (difference, antin[succ->index],
619 basic_block pred, succ;
629 succ = INDEX_EDGE_SUCC_BB (edge_list, x);
630 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun))
639 st_antin[succ
194 basic_block pred, succ; local
618 basic_block pred, succ; local
[all...]
H A Dcfganal.c213 pred and succ that edge represents can be determined, or
214 given a pred and a succ, its index number can be returned.
216 represent the normally full matrix of edge (pred,succ) with a
217 single indexed vector, edge (EDGE_INDEX (pred, succ)), with no
301 int pred, succ, index;
312 succ = e->dest->index;
316 fprintf (f, "*p* No index for edge from %d to %d\n", pred, succ);
323 if (INDEX_EDGE_SUCC_BB (elist, index)->index != succ)
325 index, succ, INDEX_EDGE_SUCC_BB (elist, index)->index);
483 find_edge (basic_block pred, basic_block succ)
299 int pred, succ, index; local
481 find_edge(basic_block pred, basic_block succ) argument
506 find_edge_index(struct edge_list *edge_list, basic_block pred, basic_block succ) argument
[all...]
H A Dgcov.c117 arc_t *succ; member in struct:block_info
918 for (arc = block->succ; arc; arc = arc_n)
1255 if (src >= fn->num_blocks || fn->blocks[src].succ)
1276 arc->succ_next = src_blk->succ;
1277 src_blk->succ = arc;
1313 for (arc = src_blk->succ; arc; arc = arc->succ_next)
1514 for (arc_p = NULL, arc = fn->blocks[ix].succ; arc;
1520 fn->blocks[ix].succ = arc_p;
1561 for (arc = blk->succ; arc; arc = arc->succ_next)
1582 for (arc = blk->succ; ar
[all...]
H A Dsel-sched-ir.c620 insn_t succ;
625 FOR_EACH_SUCC_1 (succ, si, old_fence,
634 flist_add (&fences, succ,
708 insn_t succ;
756 FOR_EACH_SUCC_1 (succ, si, last_scheduled_insn_old,
759 if (succ == insn)
767 FOR_EACH_SUCC_1 (succ, si, last_scheduled_insn,
770 if (succ == insn)
885 add_clean_fence_to_fences (flist_tail_t new_fences, insn_t succ, fence_t fence)
890 succ, state_creat
613 insn_t succ; local
701 insn_t succ; local
878 add_clean_fence_to_fences(flist_tail_t new_fences, insn_t succ, fence_t fence) argument
894 add_dirty_fence_to_fences(flist_tail_t new_fences, insn_t succ, fence_t fence) argument
3642 insn_t succ; local
4025 insn_t succ = NULL; local
4068 insn_t succ = NULL; local
4732 insn_t succ; local
4792 insn_t succ; local
4936 in_same_ebb_p(insn_t insn, insn_t succ) argument
5296 basic_block succ = single_succ (bb); local
5332 basic_block succ; local
[all...]
H A Dsel-sched-dump.c548 rtx_insn *succ;
550 FOR_EACH_VEC_ELT (succs, i, succ)
551 if (succ)
552 dump_insn (succ);
545 rtx_insn *succ; local
H A Dddg.c982 find_successors (sbitmap succ, ddg_ptr g, sbitmap ops)
990 bitmap_ior (succ, succ, node_succ);
994 bitmap_and_compl (succ, succ, ops);
980 find_successors(sbitmap succ, ddg_ptr g, sbitmap ops) argument
H A Dbasic-block.h290 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
293 block which is either the pred or succ end of the indexed edge. */
H A Dtree-ssa-tail-merge.c1341 basic_block succ; local
1345 succ = BASIC_BLOCK_FOR_FN (cfun, s);
1346 e1 = find_edge (bb1, succ);
1347 e2 = find_edge (bb2, succ);
1354 if (!same_phi_alternatives_1 (succ, e1, e2))
H A Dcfgloopanal.c173 for (ge = g->vertices[i].succ; ge; ge = ge->succ_next)
H A Dtree-loop-distribution.c159 if (v->succ)
160 for (e = v->succ; e; e = e->succ_next)
223 if (v->succ)
224 for (e = v->succ; e; e = e->succ_next)
445 for (e = v->succ; e; e = e->succ_next)
H A Dcfgloop.c68 edge succ;
72 FOR_EACH_EDGE (succ, ei, bb->succs)
73 fprintf (file, "%d ", succ->dest->index);
67 edge succ; local
/haiku-buildtools/gcc/gcc/config/epiphany/
H A Dresolve-sw-modes.c169 basic_block succ = e->dest; local
172 if (!REGNO_REG_SET_P (DF_LIVE_IN (succ), jilted_reg))
174 if (REGNO_REG_SET_P (DF_LIVE_IN (succ), selected_reg))
176 if (bitmap_bit_p (pushed, succ->index))
178 todo.quick_push (succ);
/haiku-buildtools/legacy/gcc/gcc/
H A Dprofile.c83 struct adj_list *succ; member in struct:bb_info
202 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
213 if (bb_graph[i].succ == arcptr && arcptr->succ_next == 0)
233 for (backptr = bb_graph[i].succ; backptr;
631 target/source basic blocks, add this insn to pred/succ lists.
934 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
938 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
978 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
1003 As arc counts are set, decrement the succ/pred count, but don't delete
1030 for (arcptr = binfo->succ; arcpt
[all...]
H A Dgcov.c123 struct adj_list *succ; member in struct:bb_info
468 arcptr->succ_next = bb_graph[source].succ;
469 bb_graph[source].succ = arcptr;
555 /* Must reverse the order of all succ arcs, to ensure that they match
559 if (bb_graph[i].succ)
560 bb_graph[i].succ = reverse_arcs (bb_graph[i].succ);
571 for (arcptr = bb_graph[i].succ; arcptr; arcptr = arcptr->succ_next)
603 As arc counts are set, decrement the succ/pred count, but don't delete
629 for (arcptr = bb_graph[i].succ; arcpt
[all...]
H A Dflow.c177 NULL, /* succ */
189 NULL, /* succ */
842 for (e = bb->succ; e ; e = n)
848 bb->succ = 0;
852 for (e = ENTRY_BLOCK_PTR->succ; e ; e = n)
858 ENTRY_BLOCK_PTR->succ = 0;
1073 for (e = src->succ; e ; e = e->succ_next)
1082 e->succ_next = src->succ;
1088 src->succ = e;
1132 if (bb->succ
[all...]
H A Dbasic-block.h133 edge pred, succ; member in struct:basic_block_def
H A Dgraph.c353 for (e = bb->succ; e ; e = e->succ_next)
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/
H A Dp1989.C172 link<T> *l, *succ; local
173 for (l=head; 0 != l; l=succ) {
174 succ = l->next;
/haiku-buildtools/gcc/gcc/config/arc/
H A Darc.c7741 arc600_corereg_hazard (rtx_insn *pred, rtx_insn *succ)
7748 if (recog_memoized (succ) == CODE_FOR_doloop_end_i
7749 && LABEL_P (prev_nonnote_insn (succ)))
7751 if (recog_memoized (succ) == CODE_FOR_doloop_begin_i)
7755 if (GET_CODE (PATTERN (succ)) == SEQUENCE)
7756 succ = as_a <rtx_sequence *> (PATTERN (succ))->insn (0);
7786 PATTERN (succ), 0)))
7798 arc_hazard (rtx_insn *pred, rtx_insn *succ)
7802 if (!pred || !INSN_P (pred) || !succ || !INSN_
7739 arc600_corereg_hazard(rtx_insn *pred, rtx_insn *succ) argument
7796 arc_hazard(rtx_insn *pred, rtx_insn *succ) argument
7862 rtx_insn *succ = next_real_insn (insn); local
[all...]

Completed in 334 milliseconds

12