Searched refs:preds (Results 1 - 25 of 78) sorted by relevance

1234

/freebsd-10-stable/tools/regression/ia64/emulated/
H A Dbrl.t33 my @preds = ("False", "True");
84 $count += @preds * @variants;
92 foreach $pred (@preds) {
/freebsd-10-stable/contrib/gcc/
H A Dtree-ssa-threadupdate.c449 FOR_EACH_EDGE (e, ei, bb->preds)
499 FOR_EACH_EDGE (e, ei, bb->preds)
549 FOR_EACH_EDGE (e, ei, bb->preds)
732 && EDGE_COUNT (bb->preds) > 1
735 FOR_EACH_EDGE (e, ei, bb->preds)
749 FOR_EACH_EDGE (e, ei, bb->preds)
762 FOR_EACH_EDGE (e, ei, bb->preds)
882 if (EDGE_COUNT (bb->preds) > 0)
H A Dcfganal.c463 FOR_EACH_EDGE (e, ei, s->preds)
490 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds))
498 FOR_EACH_EDGE (e, ei, succ->preds)
569 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); )
911 FOR_EACH_EDGE (e, ei, bb->preds)
990 FOR_EACH_EDGE (e, ei, lbb->preds)
1050 if (EDGE_COUNT (b->preds) >= 2)
1052 FOR_EACH_EDGE (p, ei, b->preds)
H A Dtree-cfgcleanup.c323 FOR_EACH_EDGE (e, ei, bb->preds)
343 FOR_EACH_EDGE (e, ei, bb->preds)
430 FOR_EACH_EDGE (e, ei, bb->preds)
442 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); )
654 while (EDGE_COUNT (bb->preds) > 0)
H A Dcfghooks.c169 FOR_EACH_EDGE (e, ei, bb->preds)
207 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
264 FOR_EACH_EDGE (e, ei, bb->preds)
379 while (EDGE_COUNT (bb->preds) != 0)
438 FOR_EACH_EDGE (f, ei, single_succ (ret)->preds)
547 b->preds = b->succs = NULL;
581 for (ei = ei_start (dummy->preds); (e = ei_safe_edge (ei)); )
810 edge vector E->dest->preds. */
820 the edge vector E->dest->preds. */
H A Dcfg.c122 VEC_truncate (edge, bb->preds, 0);
127 VEC_truncate (edge, EXIT_BLOCK_PTR->preds, 0);
220 VEC_safe_push (edge, gc, dest->preds, e);
221 e->dest_idx = EDGE_COUNT (dest->preds) - 1;
255 VEC_unordered_remove (edge, dest->preds, dest_idx);
259 if (dest_idx < EDGE_COUNT (dest->preds))
462 FOR_EACH_EDGE (e, ei, bb->preds)
469 FOR_EACH_EDGE (e, ei, bb->preds)
507 FOR_EACH_EDGE (e, ei, bb->preds)
848 FOR_EACH_EDGE (e, ei, bb->preds)
[all...]
H A Dlcm.c131 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
162 FOR_EACH_EDGE (e, ei, bb->preds)
315 FOR_EACH_EDGE (e, ei, bb->preds)
341 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
632 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
657 FOR_EACH_EDGE (e, ei, bb->preds)
H A Dcfgloop.c251 FOR_EACH_EDGE (e, ei, node->preds)
477 FOR_EACH_EDGE (e, ei, header->preds)
524 FOR_EACH_EDGE (e, ei, header->preds)
528 FOR_EACH_EDGE (e, ei, header->preds)
640 FOR_EACH_EDGE (e, ei, header->preds)
646 FOR_EACH_EDGE (e, ei, header->preds)
726 FOR_EACH_EDGE (e, ei, header->preds)
1112 && EDGE_COUNT (loop->header->preds) != 2)
1288 FOR_EACH_EDGE (e, ei, loop->header->preds)
H A Dtree-phinodes.c314 int len = EDGE_COUNT (bb->preds);
353 phi = make_phi_node (var, EDGE_COUNT (bb->preds));
H A Ddomwalk.c155 if (EDGE_COUNT (bb->preds) > 0 || bb == ENTRY_BLOCK_PTR)
H A Dloop-init.c58 for (ei = ei_start (EXIT_BLOCK_PTR->preds); (e = ei_safe_edge (ei)); )
H A Dmode-switching.c150 FOR_EACH_EDGE (e, ei, b->preds)
222 FOR_EACH_EDGE (eg, ei, EXIT_BLOCK_PTR->preds)
233 if (EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 1
466 FOR_EACH_EDGE (e, ei, bb->preds)
H A Dtree-tailcall.c245 FOR_EACH_EDGE (e, ei, bb->preds)
425 FOR_EACH_EDGE (e, ei, bb->preds)
884 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
977 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
H A Dtracer.c143 FOR_EACH_EDGE (e, ei, bb->preds)
275 if (EDGE_COUNT (bb2->preds) > 1
H A Dcfgcleanup.c813 FOR_EACH_EDGE (tmp_edge, ei, b->preds)
1659 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0)
1837 if (EDGE_COUNT (bb->preds) < 2)
1868 if (EDGE_COUNT (bb->preds) > max)
1871 FOR_EACH_EDGE (e, ei, bb->preds)
1878 for (ix = 0, ev = bb; ix < EDGE_COUNT (ev->preds); )
1921 for (ix2 = 0, ev2 = bb; ix2 < EDGE_COUNT (ev2->preds); )
2003 while (EDGE_COUNT (b->preds) == 0)
H A Dbasic-block.h142 dest->preds. */
220 VEC(edge,gc) *preds;
595 && EDGE_COUNT ((e)->dest->preds) >= 2)
599 #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i))
615 return EDGE_COUNT (bb->preds) == 1;
1186 FOR_EACH_EDGE (e, ei, bb->preds)
H A Dddg.c808 find_predecessors (sbitmap preds, ddg_ptr g, sbitmap ops)
816 sbitmap_a_or_b (preds, preds, node_preds);
820 sbitmap_difference (preds, preds, ops);
805 find_predecessors(sbitmap preds, ddg_ptr g, sbitmap ops) argument
H A Dprofile.c305 FOR_EACH_EDGE (e, ei, bb->preds)
403 FOR_EACH_EDGE (e, ei, bb->preds)
447 FOR_EACH_EDGE (e, ei, bb->preds)
451 FOR_EACH_EDGE (e, ei, bb->preds)
817 FOR_EACH_EDGE (e, ei, bb->preds)
H A Dsbitmap.c578 for (e = NULL, ix = 0; ix < EDGE_COUNT (b->preds); ix++)
591 for (++ix; ix < EDGE_COUNT (b->preds); ix++)
658 for (ix = 0; ix < EDGE_COUNT (b->preds); ix++)
668 if (ix == EDGE_COUNT (b->preds))
671 for (ix++; ix < EDGE_COUNT (b->preds); ix++)
H A Dcfgloopanal.c431 FOR_EACH_EDGE (e, ei, loop->header->preds)
452 FOR_EACH_EDGE (e, ei, loop->header->preds)
H A Dtree-outof-ssa.c1977 FOR_EACH_EDGE (e, ei, bb->preds)
2102 FOR_EACH_EDGE (e, ei, bb->preds)
2111 FOR_EACH_EDGE (e, ei, bb->preds)
2118 FOR_EACH_EDGE (e, ei, bb->preds)
2166 FOR_EACH_EDGE (e, ei, bb->preds)
2242 FOR_EACH_EDGE (e, ei, new_edge->src->preds)
2307 FOR_EACH_EDGE (e, ei, bb->preds)
2326 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
H A Ddf-core.c529 if (EDGE_COUNT (bb->preds) > 0)
530 FOR_EACH_EDGE (e, ei, bb->preds)
597 FOR_EACH_EDGE (e, ei, bb->preds)
608 FOR_EACH_EDGE (e, ei, bb->preds)
734 immed preds and succs of those blocks).
/freebsd-10-stable/usr.bin/make/
H A DGNode.h200 Lst preds; member in struct:GNode
H A Dmake.c603 if (!Lst_IsEmpty(&gn->preds)) {
606 for (ln = Lst_First(&gn->preds); ln != NULL;
/freebsd-10-stable/contrib/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp175 SmallPtrSet<MachineBasicBlock*, 8> preds(BB->pred_begin(),
180 if (!preds.count(phi->getOperand(i).getMBB())) {

Completed in 386 milliseconds

1234