following optimizations are implemented (for more detailed descriptions
see comments at value_profile_transformations):
- 1) Division/modulo specialisation. Provided that we can determine that the
+ 1) Division/modulo specialization. Provided that we can determine that the
operands of the division have some special properties, we may use it to
produce more effective code.
2) Speculative prefetching. If we are able to determine that the difference
-- list of counters starting from the first one. */
/* For speculative prefetching, the range in that we do not prefetch (because
- we assume that it will be in cache anyway). The assymetry between min and
+ we assume that it will be in cache anyway). The asymmetry between min and
max range is trying to reflect the fact that the sequential prefetching
of the data is commonly done directly by hardware. Nevertheless, these
values are just a guess and should of course be target-specific. */
histogram = XEXP (histogram, 1);
all = INTVAL (XEXP (histogram, 0));
- /* We require that count is at least half of all; this means
+ /* We require that count be at least half of all; this means
that for the transformation to fire the value must be constant
at least 50% of time (and 75% gives the guarantee of usage). */
if (!rtx_equal_p (op2, value) || 2 * count < all)
if (all < 4)
return false;
- /* We require that count is at least half of all; this means
+ /* We require that count be at least half of all; this means
that for the transformation to fire the value must be constant
- at least 50% of time (and 75% gives the garantee of usage). */
+ at least 50% of time (and 75% gives the guarantee of usage). */
if (!rtx_equal_p (address, value) || 2 * count < all)
return false;