Home
last modified time | relevance | path

Searched refs:preds (Results 1 – 25 of 101) sorted by relevance

12345

/openbsd/gnu/gcc/gcc/
H A Dtree-ssa-threadupdate.c449 FOR_EACH_EDGE (e, ei, bb->preds) in prune_undesirable_thread_requests()
499 FOR_EACH_EDGE (e, ei, bb->preds) in prune_undesirable_thread_requests()
549 FOR_EACH_EDGE (e, ei, bb->preds) in prune_undesirable_thread_requests()
732 && EDGE_COUNT (bb->preds) > 1 in thread_block()
735 FOR_EACH_EDGE (e, ei, bb->preds) in thread_block()
749 FOR_EACH_EDGE (e, ei, bb->preds) in thread_block()
762 FOR_EACH_EDGE (e, ei, bb->preds) in thread_block()
882 if (EDGE_COUNT (bb->preds) > 0) in thread_through_all_blocks()
H A Dcfganal.c460 FOR_EACH_EDGE (e, ei, s->preds) in verify_edge_list()
487 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds)) in find_edge()
495 FOR_EACH_EDGE (e, ei, succ->preds) in find_edge()
565 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); ) in remove_fake_predecessors()
906 FOR_EACH_EDGE (e, ei, bb->preds) in flow_dfs_compute_reverse_execute()
985 FOR_EACH_EDGE (e, ei, lbb->preds) in dfs_enumerate_from()
1045 if (EDGE_COUNT (b->preds) >= 2) in compute_dominance_frontiers_1()
1047 FOR_EACH_EDGE (p, ei, b->preds) in compute_dominance_frontiers_1()
H A Dcfg.c119 VEC_truncate (edge, bb->preds, 0); in clear_edges()
124 VEC_truncate (edge, EXIT_BLOCK_PTR->preds, 0); in clear_edges()
215 VEC_safe_push (edge, gc, dest->preds, e); in connect_dest()
216 e->dest_idx = EDGE_COUNT (dest->preds) - 1; in connect_dest()
250 VEC_unordered_remove (edge, dest->preds, dest_idx); in disconnect_dest()
254 if (dest_idx < EDGE_COUNT (dest->preds)) in disconnect_dest()
456 FOR_EACH_EDGE (e, ei, bb->preds) in check_bb_profile()
463 FOR_EACH_EDGE (e, ei, bb->preds) in check_bb_profile()
500 FOR_EACH_EDGE (e, ei, bb->preds) in dump_bb_info()
840 FOR_EACH_EDGE (e, ei, bb->preds) in dump_cfg_bb_info()
H A Dcfghooks.c169 FOR_EACH_EDGE (e, ei, bb->preds) in verify_flow_info()
207 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in verify_flow_info()
264 FOR_EACH_EDGE (e, ei, bb->preds) in dump_bb()
379 while (EDGE_COUNT (bb->preds) != 0) in delete_basic_block()
438 FOR_EACH_EDGE (f, ei, single_succ (ret)->preds) in split_edge()
547 b->preds = b->succs = NULL; in merge_blocks()
581 for (ei = ei_start (dummy->preds); (e = ei_safe_edge (ei)); ) in make_forwarder_block()
H A Dtree-cfgcleanup.c323 FOR_EACH_EDGE (e, ei, bb->preds) in tree_forwarder_block_p()
343 FOR_EACH_EDGE (e, ei, bb->preds) in has_abnormal_incoming_edge_p()
430 FOR_EACH_EDGE (e, ei, bb->preds) in remove_forwarder_block()
442 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); ) in remove_forwarder_block()
654 while (EDGE_COUNT (bb->preds) > 0) in remove_forwarder_block_with_phi()
H A Dcfgloop.c250 FOR_EACH_EDGE (e, ei, node->preds) in flow_loop_nodes_find()
476 FOR_EACH_EDGE (e, ei, header->preds) in canonicalize_loop_headers()
523 FOR_EACH_EDGE (e, ei, header->preds) in canonicalize_loop_headers()
527 FOR_EACH_EDGE (e, ei, header->preds) in canonicalize_loop_headers()
639 FOR_EACH_EDGE (e, ei, header->preds) in flow_loops_find()
645 FOR_EACH_EDGE (e, ei, header->preds) in flow_loops_find()
725 FOR_EACH_EDGE (e, ei, header->preds) in flow_loops_find()
1111 && EDGE_COUNT (loop->header->preds) != 2) in verify_loop_structure()
1287 FOR_EACH_EDGE (e, ei, loop->header->preds) in loop_preheader_edge()
H A Dlcm.c130 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in compute_antinout_edge()
161 FOR_EACH_EDGE (e, ei, bb->preds) in compute_antinout_edge()
314 FOR_EACH_EDGE (e, ei, bb->preds) in compute_laterin()
340 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in compute_laterin()
631 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in compute_nearerout()
656 FOR_EACH_EDGE (e, ei, bb->preds) in compute_nearerout()
H A Dmode-switching.c148 FOR_EACH_EDGE (e, ei, b->preds) in make_preds_opaque()
220 FOR_EACH_EDGE (eg, ei, EXIT_BLOCK_PTR->preds) in create_pre_exit()
231 if (EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 1 in create_pre_exit()
464 FOR_EACH_EDGE (e, ei, bb->preds) in optimize_mode_switching()
H A Dbasic-block.h220 VEC(edge,gc) *preds;
594 && EDGE_COUNT ((e)->dest->preds) >= 2)
598 #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i))
614 return EDGE_COUNT (bb->preds) == 1; in single_pred_p()
1185 FOR_EACH_EDGE (e, ei, bb->preds) in bb_has_eh_pred()
H A Dsbitmap.c578 for (e = NULL, ix = 0; ix < EDGE_COUNT (b->preds); ix++) in sbitmap_intersection_of_preds()
591 for (++ix; ix < EDGE_COUNT (b->preds); ix++) in sbitmap_intersection_of_preds()
658 for (ix = 0; ix < EDGE_COUNT (b->preds); ix++) in sbitmap_union_of_preds()
668 if (ix == EDGE_COUNT (b->preds)) in sbitmap_union_of_preds()
671 for (ix++; ix < EDGE_COUNT (b->preds); ix++) in sbitmap_union_of_preds()
H A Dcfgcleanup.c808 FOR_EACH_EDGE (tmp_edge, ei, b->preds) in merge_blocks_move()
1652 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0) in try_crossjump_to_edge()
1830 if (EDGE_COUNT (bb->preds) < 2) in try_crossjump_bb()
1861 if (EDGE_COUNT (bb->preds) > max) in try_crossjump_bb()
1864 FOR_EACH_EDGE (e, ei, bb->preds) in try_crossjump_bb()
1871 for (ix = 0, ev = bb; ix < EDGE_COUNT (ev->preds); ) in try_crossjump_bb()
1914 for (ix2 = 0, ev2 = bb; ix2 < EDGE_COUNT (ev2->preds); ) in try_crossjump_bb()
1996 while (EDGE_COUNT (b->preds) == 0) in try_optimize_cfg()
H A Dtree-tailcall.c245 FOR_EACH_EDGE (e, ei, bb->preds) in independent_of_stmt_p()
425 FOR_EACH_EDGE (e, ei, bb->preds) in find_tail_calls()
884 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in tree_optimize_tail_calls_1()
977 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in tree_optimize_tail_calls_1()
H A Dtree-phinodes.c314 int len = EDGE_COUNT (bb->preds); in reserve_phi_args_for_new_edge()
353 phi = make_phi_node (var, EDGE_COUNT (bb->preds)); in create_phi_node()
H A Dprofile.c302 FOR_EACH_EDGE (e, ei, bb->preds) in compute_branch_probabilities()
400 FOR_EACH_EDGE (e, ei, bb->preds) in compute_branch_probabilities()
444 FOR_EACH_EDGE (e, ei, bb->preds) in compute_branch_probabilities()
448 FOR_EACH_EDGE (e, ei, bb->preds) in compute_branch_probabilities()
814 FOR_EACH_EDGE (e, ei, bb->preds) in branch_prob()
H A Dddg.c805 find_predecessors (sbitmap preds, ddg_ptr g, sbitmap ops) in find_predecessors() argument
813 sbitmap_a_or_b (preds, preds, node_preds); in find_predecessors()
817 sbitmap_difference (preds, preds, ops); in find_predecessors()
H A Dtree-if-conv.c571 FOR_EACH_EDGE (e, ei, bb->preds) in if_convertible_loop_p()
690 gcc_assert (EDGE_COUNT (bb->preds) == 2); in find_phi_replacement_condition()
921 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei));) in combine_blocks()
1042 FOR_EACH_EDGE (e, ei, bb->preds) in pred_blocks_visited_p()
/openbsd/gnu/usr.bin/cc/cc_tools/
H A DMakefile.dep134 tm-preds.h \
139 tm-preds.h tm-constrs.h tree-check.h \
147 tm-preds.h \
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dgenrecog.c188 } preds[] = { variable
218 #define NUM_KNOWN_PREDS ARRAY_SIZE (preds)
501 if (! strcmp (preds[i].name, pred_name))
509 for (j = 0; preds[i].codes[j] != 0; j++)
511 RTX_CODE c = preds[i].codes[j];
876 if (! strcmp (preds[i].name, pred_name))
885 if (preds[i].codes[1] == 0 && code == UNKNOWN)
886 code = preds[i].codes[0];
889 for (j = 0; preds[i].codes[j] != 0; j++)
890 if (preds[i].codes[j] == CONST_INT)
[all …]
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h283 And(Pred &&p, Preds &&... preds)
284 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
302 Or(Pred &&p, Preds &&... preds)
303 : Or<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {}
310 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) {
311 return And<Preds...>(std::forward<Preds>(preds)...);
314 template <typename... Preds> Or<Preds...> m_any_of(Preds &&... preds) {
315 return Or<Preds...>(std::forward<Preds>(preds)...);
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp153 SmallPtrSet<MachineBasicBlock*, 8> preds(BB.pred_begin(), in runOnMachineFunction() local
158 if (!preds.count(phi->getOperand(i).getMBB())) { in runOnMachineFunction()
/openbsd/gnu/llvm/llvm/lib/Target/
H A DREADME.txt340 then.0: ; preds = %entry
345 else.0: ; preds = %entry
349 then.1: ; preds = %else.0
956 bb: ; preds = %bb2, %entry
963 bb1: ; preds = %bb
968 bb2: ; preds = %bb, %bb1
1104 bb2: ; preds = %bb1
1109 bb3: ; preds = %bb1, %bb2, %bb
1313 bb9: ; preds = %bb8
1318 bb10: ; preds = %bb9, %bb8
[all …]
/openbsd/gnu/llvm/llvm/docs/
H A DExceptionHandling.rst611 invoke.cont: ; preds = %entry
615 invoke.cont.2: ; preds = %invoke.cont
623 lpad.cleanup: ; preds = %invoke.cont.2
631 catch.body: ; preds = %lpad.catch
636 invoke.cont.3: ; preds = %catch.body
686 catch.dispatch: ; preds = %entry
689 catch: ; preds = %catch.dispatch
694 catch.dispatch2: ; preds = %catch
701 try.cont: ; preds = %catch3
704 try.cont6: ; preds = %try.cont
[all …]
/openbsd/gnu/usr.bin/binutils/ld/emultempl/
H A Dxtensaelf.em156 reloc_deps_e *preds;
321 while (sec_deps->preds != NULL)
323 next = sec_deps->preds->next;
324 free (sec_deps->preds);
325 sec_deps->preds = next;
366 return sec_deps && sec_deps->preds != NULL;
826 src_sec_deps->preds = NULL;
839 tgt_sec_deps->preds = NULL;
857 tgt_edge->next = tgt_sec_deps->preds;
858 tgt_sec_deps->preds = tgt_edge;
/openbsd/gnu/gcc/gcc/config/arm/
H A Dt-arm15 s-config s-conditions s-flags s-codes s-constants s-emit s-recog s-preds \
/openbsd/gnu/llvm/clang/include/clang/Analysis/FlowSensitive/
H A DDataflowWorklist.h88 for (auto B : Block->preds()) in enqueuePredecessors()

12345