Home | History | Annotate | Download | only in gcc

Lines Matching defs:edge_count

106 	  if (EDGE_COUNT (dest->succs) > 0)
273 num_edges += EDGE_COUNT (bb->succs);
452 num_edges += EDGE_COUNT (bb->succs);
525 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds))
609 if (EDGE_COUNT (bb->succs) == 0)
697 if (EDGE_COUNT (dest->succs) > 0)
777 if (EDGE_COUNT (next->succs) == 0)
850 && EDGE_COUNT (bb->preds) > 0)
855 if (EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds))
864 if (EDGE_COUNT (bb->succs) == 0)
867 if (EDGE_COUNT (bb->preds) > 0)
895 if (EDGE_COUNT (pred->preds) > 0)
924 if (EDGE_COUNT (bb->preds) > 0)
1029 if (EDGE_COUNT (dest->succs) > 0)
1285 unsigned edge_count = 0;
1295 edge_count++;
1328 edge_count++;
1342 edge_count++;
1372 auto_vec<std::pair<basic_block, basic_block>, 20> estack (edge_count + 1);
1408 for (int i = EDGE_COUNT (dest->succs) - 1; i >= 0; --i)
1442 for (int i = EDGE_COUNT (dest->succs) - 1; i >= 0; --i)
1649 if (EDGE_COUNT (b->preds) >= 2)
1744 for (e = NULL, ix = 0; ix < EDGE_COUNT (b->succs); ix++)
1757 for (++ix; ix < EDGE_COUNT (b->succs); ix++)
1783 for (e = NULL, ix = 0; ix < EDGE_COUNT (b->preds); ix++)
1796 for (++ix; ix < EDGE_COUNT (b->preds); ix++)
1822 for (ix = 0; ix < EDGE_COUNT (b->succs); ix++)
1832 if (ix == EDGE_COUNT (b->succs))
1835 for (ix++; ix < EDGE_COUNT (b->succs); ix++)
1861 for (ix = 0; ix < EDGE_COUNT (b->preds); ix++)
1871 if (ix == EDGE_COUNT (b->preds))
1874 for (ix++; ix < EDGE_COUNT (b->preds); ix++)