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

12345

/haiku-buildtools/gcc/gcc/
H A Dtree-ssa-uninit.c538 pred_chain_union *preds)
547 preds->reserve (num_chains);
659 preds->safe_push (t_chain);
670 find_predicates (pred_chain_union *preds, argument
697 = convert_control_dep_chain_into_preds (dep_chains, num_chains, preds);
763 find_def_preds (pred_chain_union *preds, gphi *phi) argument
809 = convert_control_dep_chain_into_preds (dep_chains, num_chains, preds);
818 dump_predicates (gimple usestmt, pred_chain_union preds, argument
826 size_t num_preds = preds.length ();
832 one_pred_chain = preds[
858 destroy_predicate_vecs(pred_chain_union preds) argument
959 find_matching_predicate_in_rest_chains(pred_info pred, pred_chain_union preds, size_t num_pred_chains) argument
1215 use_pred_not_overlap_with_undef_path_pred(pred_chain_union preds, gphi *phi, unsigned uninit_opnds, hash_set<gphi *> *visited_phis) argument
1438 is_included_in(pred_chain one_pred, pred_chain_union preds) argument
1591 simplify_preds_2(pred_chain_union *preds) argument
1670 simplify_preds_3(pred_chain_union *preds) argument
1727 simplify_preds_4(pred_chain_union *preds) argument
1806 simplify_preds(pred_chain_union *preds, gimple use_or_def, bool is_use) argument
2144 normalize_preds(pred_chain_union preds, gimple use_or_def, bool is_use) argument
2199 pred_chain_union preds = vNULL; local
[all...]
H A Dcfganal.c345 FOR_EACH_EDGE (e, ei, s->preds)
488 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds))
496 FOR_EACH_EDGE (e, ei, succ->preds)
531 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); )
806 if (EDGE_COUNT (bb->preds) > 0)
808 stack[sp++] = ei_start (bb->preds);
834 if (EDGE_COUNT (pred->preds) > 0)
837 stack[sp++] = ei_start (pred->preds);
863 if (EDGE_COUNT (bb->preds) > 0)
870 FOR_EACH_EDGE (e, ei, bb->preds)
[all...]
H A Dshrink-wrap.c178 /* When live_edge->dest->preds == 2, we can create a new block on
180 if (EDGE_COUNT (live_edge->dest->preds) > 2)
319 if (EDGE_COUNT (next_block->preds) == 2)
423 if (!live_edge || EDGE_COUNT (live_edge->dest->preds) > 1)
517 preds of BB to COPY_BB if they don't appear in NEED_PROLOGUE. */
547 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei));)
708 FOR_EACH_EDGE (e, ei, tmp_bb->preds)
720 FOR_EACH_EDGE (pe, pei, e->src->preds)
739 FOR_EACH_EDGE (e, ei, bb->preds)
760 FOR_EACH_EDGE (e, ei, tmp_bb->preds)
[all...]
H A Ddomwalk.c182 if (EDGE_COUNT (bb->preds) > 0
H A Dbasic-block.h49 dest->preds. */
122 vec<edge, va_gc> *preds; variable
323 && EDGE_COUNT ((e)->dest->preds) >= 2)
327 #define EDGE_PRED(bb,i) (*(bb)->preds)[(i)]
343 return EDGE_COUNT (bb->preds) == 1;
540 FOR_EACH_EDGE (e, ei, bb->preds)
555 FOR_EACH_EDGE (e, ei, bb->preds)
H A Dtree-ssa-threadupdate.c730 FOR_EACH_EDGE (ein, ei, e->dest->preds)
804 FOR_EACH_EDGE (ein, ei, epath->dest->preds)
1009 FOR_EACH_EDGE (ein, ei, e->dest->preds)
1051 FOR_EACH_EDGE (ein, ei, e->dest->preds)
1089 FOR_EACH_EDGE (ein, ei, e->dest->preds)
1517 FOR_EACH_EDGE (e, ei, bb->preds)
1756 FOR_EACH_EDGE (e, ei, bb->preds)
1780 FOR_EACH_EDGE (e, ei, bblocks[i]->preds)
1921 FOR_EACH_EDGE (e, ei, header->preds)
1978 if (EDGE_COUNT (tgt_bb->preds) >
[all...]
H A Dpredict.c489 edge_prediction **preds = bb_predictions->get (bb); local
491 if (!preds)
494 for (i = *preds; i; i = i->ep_next)
596 edge_prediction *&preds = bb_predictions->get_or_insert (e->src); local
598 i->ep_next = preds;
599 preds = i;
614 edge_prediction **preds = bb_predictions->get (e->src);
616 if (preds)
618 struct edge_prediction **prediction = preds;
640 edge_prediction **preds local
910 edge_prediction **preds = bb_predictions->get (bb); local
[all...]
H A Dcfg.c134 vec_safe_truncate (bb->preds, 0);
139 vec_safe_truncate (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds, 0);
237 vec_safe_push (dest->preds, e);
238 e->dest_idx = EDGE_COUNT (dest->preds) - 1;
274 dest->preds->unordered_remove (dest_idx);
278 if (dest_idx < EDGE_COUNT (dest->preds))
462 FOR_EACH_EDGE (e, ei, bb->preds)
470 FOR_EACH_EDGE (e, ei, bb->preds)
484 FOR_EACH_EDGE (e, ei, bb->preds)
814 FOR_EACH_EDGE (e, ei, bb->preds)
[all...]
H A Dcfghooks.c222 FOR_EACH_EDGE (e, ei, bb->preds)
260 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
602 while (EDGE_COUNT (bb->preds) != 0)
666 FOR_EACH_EDGE (f, ei, single_succ (ret)->preds)
821 b->preds = b->succs = NULL;
859 for (ei = ei_start (dummy->preds); (e = ei_safe_edge (ei)); )
919 FOR_EACH_EDGE (e, ei, dummy->preds)
1184 edge vector E->dest->preds. */
1194 the edge vector E->dest->preds. */
1450 FOR_EACH_EDGE (e, ei, bb->preds)
[all...]
H A Dtree-ssa-tail-merge.c288 /* The preds of the bbs in the cluster. */
289 bitmap preds; member in struct:bb_cluster_def
836 FOR_EACH_EDGE (e, ei, bb->preds)
933 bitmap_print (file, c->preds, "preds:", "\n");
979 /* Add BB to cluster C. Sets BB in C->bbs, and preds of BB in C->preds. */
989 FOR_EACH_EDGE (e, ei, bb->preds)
990 bitmap_set_bit (c->preds, e->src->index);
1003 c->preds
[all...]
H A Dcfgloop.c114 FOR_EACH_EDGE (e, ei, loop->header->preds)
251 FOR_EACH_EDGE (latch, latch_ei, loop->header->preds)
269 FOR_EACH_EDGE (e, ei, node->preds)
399 FOR_EACH_EDGE (e, ei, header->preds)
512 FOR_EACH_EDGE (e, ei, header->preds)
683 FOR_EACH_EDGE (e, ei, loop->header->preds)
1216 FOR_EACH_EDGE (e, ei, bb->preds)
1242 FOR_EACH_EDGE (e, ei, bb->preds)
1434 && EDGE_COUNT (loop->header->preds) != 2)
1675 FOR_EACH_EDGE (e, ei, loop->header->preds)
[all...]
H A Dprofile.c399 inconsistent |= is_edge_inconsistent (bb->preds);
417 if (bb->count != sum_edge_counts (bb->preds))
425 sum_edge_counts (bb->preds));
594 FOR_EACH_EDGE (e, ei, bb->preds)
654 FOR_EACH_EDGE (e, ei, bb->preds)
698 FOR_EACH_EDGE (e, ei, bb->preds)
702 FOR_EACH_EDGE (e, ei, bb->preds)
1117 FOR_EACH_EDGE (e, ei, bb->preds)
H A Dsel-sched-ir.c3750 || EDGE_COUNT (bb->preds) == 0
3755 FOR_EACH_EDGE (e, ei, bb->preds)
3793 FOR_EACH_EDGE (e, ei, bb->preds)
3807 FOR_EACH_EDGE (e, ei, bb->preds)
4067 /* Compute seqno for INSN by its preds or succs. Use OLD_SEQNO to compute
4085 /* We can have preds outside a region when splitting edges
4106 insn_t *preds;
4109 cfg_preds (BLOCK_FOR_INSN (insn), &preds, &n);
4114 seqno = INSN_SEQNO (preds[0]);
4118 free (preds);
4086 insn_t *preds; local
4089 cfg_preds (BLOCK_FOR_INSN (insn), &preds, &n); local
4126 insn_t *preds; local
4829 cfg_preds_1(basic_block bb, insn_t **preds, int *n, int *size) argument
4868 cfg_preds(basic_block bb, insn_t **preds, int *n) argument
[all...]
H A Dbb-reorder.c617 if (best_edge && EDGE_COUNT (best_edge->dest->preds) >= 2
642 || EDGE_COUNT (best_edge->dest->preds) > 1))
939 FOR_EACH_EDGE (e, ei, bb->preds)
1153 FOR_EACH_EDGE (e, ei, traces[t2].first->preds)
1223 int count = EDGE_COUNT (best->dest->preds);
1225 FOR_EACH_EDGE (e, ei, best->dest->preds)
1391 if (EDGE_COUNT (bb->preds) < 2)
1487 for (ei = ei_start (old_bb->preds); (e = ei_safe_edge (ei)) != NULL; )
1526 vec<edge, va_gc> *edges = walk_up ? bb->preds : bb->succs;
1534 /* Walk the preds/succ
[all...]
H A Dtree-cfgcleanup.c322 FOR_EACH_EDGE (e, ei, bb->preds)
464 FOR_EACH_EDGE (e, ei, bb->preds)
482 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); )
851 while (EDGE_COUNT (bb->preds) > 0)
H A Dcfgcleanup.c859 tmp_edge = find_fallthru_edge (b->preds);
1309 fallthru = find_fallthru_edge ((*bb1)->preds);
1966 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0)
2184 if (EDGE_COUNT (bb->preds) < 2)
2215 if (EDGE_COUNT (bb->preds) > max)
2218 fallthru = find_fallthru_edge (bb->preds);
2221 for (ix = 0; ix < EDGE_COUNT (bb->preds);)
2264 for (ix2 = 0; ix2 < EDGE_COUNT (bb->preds); ix2++)
2384 if (EDGE_COUNT (other_bb->preds) !
[all...]
H A Dtracer.c191 FOR_EACH_EDGE (e, ei, bb->preds)
331 if (EDGE_COUNT (bb2->preds) > 1
H A Dtree-phinodes.c306 size_t len = EDGE_COUNT (bb->preds);
365 gphi *phi = make_phi_node (var, EDGE_COUNT (bb->preds));
H A Dcfgloopanal.c272 FOR_EACH_EDGE (e, ei, loop->header->preds)
292 FOR_EACH_EDGE (e, ei, loop->header->preds)
H A Dlcm.c139 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
170 FOR_EACH_EDGE (e, ei, bb->preds)
330 FOR_EACH_EDGE (e, ei, bb->preds)
356 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
684 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
709 FOR_EACH_EDGE (e, ei, bb->preds)
H A Dgraphite-scop-detection.c848 FOR_EACH_EDGE (e, ei, region->entry->preds)
873 FOR_EACH_EDGE (e, ei, region->exit->preds)
1009 FOR_EACH_EDGE (e, ei, forwarder->src->preds)
1018 FOR_EACH_EDGE (e, ei, forwarder->dest->preds)
1037 FOR_EACH_EDGE (e, ei, s->exit->preds)
1054 FOR_EACH_EDGE (e, ei, s->exit->preds)
H A Ddominance.c253 ei = ei_start (bb->preds);
290 einext = ei_start (bn->preds);
532 ei = (reverse) ? ei_start (bb->succs) : ei_start (bb->preds);
1083 FOR_EACH_EDGE (e, ei, bb->preds)
1134 FOR_EACH_EDGE (e, ei, bb->preds)
1228 FOR_EACH_EDGE (e, ei, bb->preds)
1373 FOR_EACH_EDGE (e, ei, bb->preds)
H A Dddg.c1001 find_predecessors (sbitmap preds, ddg_ptr g, sbitmap ops)
1009 bitmap_ior (preds, preds, node_preds);
1013 bitmap_and_compl (preds, preds, ops);
999 find_predecessors(sbitmap preds, ddg_ptr g, sbitmap ops) argument
H A Dmode-switching.c254 FOR_EACH_EDGE (eg, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
265 if (EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) == 1
596 FOR_EACH_EDGE (eg, ei, bb->preds)
/haiku-buildtools/legacy/gcc/gcc/
H A Dgenrecog.c94 int pred; /* `preds' index of predicate or -1 */
147 } preds[]
172 #define NUM_KNOWN_PREDS (sizeof preds / sizeof preds[0])
420 if (! strcmp (preds[i].name, new->tests))
427 if (preds[i].codes[1] == 0 && new->code == UNKNOWN)
429 new->code = preds[i].codes[0];
434 for (j = 0; j < NUM_RTX_CODE && preds[i].codes[j] != 0; j++)
435 if (preds[i].codes[j] == CONST_INT)
666 for (i = 0; i < NUM_RTX_CODE && preds[d
146 } preds[] variable in typeref:struct:pred_table
[all...]

Completed in 290 milliseconds

12345