Lines Matching defs:by
3 Contributed by Andrew MacLeod <amacleod@redhat.com>
8 it under the terms of the GNU General Public License as published by
141 /* Base costs on BB frequencies bounded by 1. */
204 2 elements via P1 and P2. 1 is returned by the function if there is a pair,
226 2 elements via P1 and P2. Their calculated cost is returned by the function.
535 bitmap by = ptr->conflicts[y];
541 return by ? bitmap_bit_p (bx, y) : false;
579 bitmap by = ptr->conflicts[y];
582 if (! by)
588 EXECUTE_IF_SET_IN_BITMAP (by, 0, z, bi)
598 bitmap_ior_into (bx, by);
599 BITMAP_FREE (by);
605 ptr->conflicts[x] = by;
853 by itself. If they did, you would never be able to coalesce
857 This is handled by simply removing the SRC of the copy from the
1252 /* Hashtable support for storing SSA names hashed by their SSA_NAME_VAR. */
1275 /* Reduce the number of copies by coalescing variables in the function. Return