Lines Matching defs:be
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
178 be only one. It isn't inconceivable that we might one day directly
213 pred and succ that edge represents can be determined, or
214 given a pred and a succ, its index number can be returned.
321 fprintf (f, "*p* Pred for index %d should be %d not %d\n",
324 fprintf (f, "*p* Succ for index %d should be %d not %d\n",
732 which may not be desirable.
764 This ordering can be used for forward dataflow problems among others.
878 basic_block be = dfs_find_deadend (bb);
879 gcc_assert (be != NULL);
880 bitmap_set_bit (visited, be->index);
881 stack[sp++] = ei_start (be->preds);
891 basic_block be = dfs_find_deadend (ENTRY_BLOCK_PTR_FOR_FN (cfun));
892 gcc_assert (be != NULL);
893 bitmap_set_bit (visited, be->index);
894 stack[sp++] = ei_start (be->preds);
1031 /* The number of nodes visited should be the number of blocks. */
1034 /* The number of nodes visited should be the number of blocks minus
1227 This algorithm can be found in Timothy Harvey's PhD thesis, at
1349 last_basic_block so that it can be indexed with basic block indices.
1350 DST may be (but does not have to be) SRC[B->index]. */