HomeSort by: relevance | last modified time | path
    Searched defs:farthest (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
lcm.cc 582 /* Compute the farthest vector for edge based lcm. */
587 sbitmap *kill, sbitmap *farthest)
600 bitmap_copy (farthest[x], st_avout[pred->index]);
604 bitmap_clear (farthest[x]);
610 bitmap_and_or (farthest[x], difference,
623 compute_nearerout (struct edge_list *edge_list, sbitmap *farthest,
649 same as FARTHEST for that edge. */
651 bitmap_copy (nearer[(size_t)e->aux], farthest[(size_t)e->aux]);
677 farthest[(size_t) e->aux],
738 sbitmap *st_avout, *st_avin, *farthest;
737 sbitmap *st_avout, *st_avin, *farthest; local
    [all...]
asan.cc 4471 /* Return the RTX representing the farthest extent of the statically allocated
4590 poly_int64 farthest = cur.farthest_offset; local
4592 if (known_ge (nearest, farthest))
4595 bot = farthest;
4601 gcc_assert (known_le (nearest, farthest));
4602 top = farthest;
  /src/external/gpl3/gcc.old/dist/gcc/
lcm.cc 583 /* Compute the farthest vector for edge based lcm. */
588 sbitmap *kill, sbitmap *farthest)
601 bitmap_copy (farthest[x], st_avout[pred->index]);
605 bitmap_clear (farthest[x]);
611 bitmap_and_or (farthest[x], difference,
624 compute_nearerout (struct edge_list *edge_list, sbitmap *farthest,
650 same as FARTHEST for that edge. */
652 bitmap_copy (nearer[(size_t)e->aux], farthest[(size_t)e->aux]);
678 farthest[(size_t) e->aux],
739 sbitmap *st_avout, *st_avin, *farthest;
738 sbitmap *st_avout, *st_avin, *farthest; local
    [all...]
asan.cc 4406 /* Return the RTX representing the farthest extent of the statically allocated
4525 poly_int64 farthest = cur.farthest_offset; local
4527 if (known_ge (nearest, farthest))
4530 bot = farthest;
4536 gcc_assert (known_le (nearest, farthest));
4537 top = farthest;

Completed in 23 milliseconds