Lines Matching defs:All
709 // arithmetic. To do exact division in modular arithmetic, all we have
733 // (It's possible to not widen at all by pulling out factors of 2 before
855 // eliminate all the truncates.
870 // eliminate all the truncates.
929 // It's possible the bits taken off by the truncate were all zero bits. If
941 // did not overflow the old, smaller, value, we can zero extend all of the
1195 // It's possible the bits taken off by the truncate were all sign bits. If
1207 // did not overflow the old, smaller, value, we can sign extend all of the
1474 // If FlagNSW is true and all the operands are non-negative, infer FlagNUW.
1479 bool All = true;
1483 All = false;
1486 if (All) Flags = setFlags(Flags, (SCEV::NoWrapFlags)SignOrUnsignMask);
1489 // Sort by complexity, this groups all similar expression types together.
1539 // Check for truncates. If all the operands are truncated from the same
1549 // Check all the operands to see if they can be represented in the
1733 // Scan over all recurrences, trying to fold loop invariants into them.
1735 // Scan all of the other operands to this add and add them to the vector if
1762 // If all of the other operands were loop invariant, we are done.
1877 // If FlagNSW is true and all the operands are non-negative, infer FlagNUW.
1882 bool All = true;
1886 All = false;
1889 if (All) Flags = setFlags(Flags, (SCEV::NoWrapFlags)SignOrUnsignMask);
1892 // Sort by complexity, this groups all similar expression types together.
1964 // If there are mul operands inline them all into this expression.
1988 // Scan over all recurrences, trying to fold loop invariants into them.
1990 // Scan all of the other operands to this mul and add them to the vector if
2019 // If all of the other operands were loop invariant, we are done.
2288 // If FlagNSW is true and all the operands are non-negative, infer FlagNUW.
2293 bool All = true;
2297 All = false;
2300 if (All) Flags = setFlags(Flags, (SCEV::NoWrapFlags)SignOrUnsignMask);
2392 // Sort by complexity, this groups all similar expression types together.
2496 // Sort by complexity, this groups all similar expression types together.
2647 // here. createSCEV only calls getUnknown after checking for all other
2985 /// ForgetSymbolicValue - This looks up computed SCEV values for all
3125 // to be symbolic. We now need to go back and purge all of the
3153 // to be symbolic. We now need to go back and purge all of the
3226 // Add the total offset from all the GEP indices to the base.
3257 // The result is the min of all operands results.
3265 // The result is the sum of all operands results.
3276 // The result is the min of all operands results.
3284 // The result is the min of all operands results.
3292 // The result is the min of all operands results.
3528 // If there's no signed wrap, and all the operands have the same sign or
3638 // bunch of things all added together, this can be quite inefficient,
3640 // Instead, gather up all the operands and make a single getAddExpr call.
3983 /// getExitCount(L, ExitingBlock) to compute a safe trip count considering all
4084 // Push all Loop-header PHIs onto the Worklist stack.
4197 // Forget all contained loops too, to avoid dangling entries in the
4232 /// getExact - Get the exact loop backedge taken count considering all loop
4234 /// Returning the minimum taken count among all exits is incorrect because one
4343 // Examine all exits and pick the most conservative values.
4752 /// specified type, assuming that all operands were constants.
4766 /// assuming its operands can all constant evolve.
4791 // Otherwise, we can evaluate this instruction if all of its operands are
4974 // If all entries in CurrentIterVals == NextIterVals then we can stop
5034 // Update all the PHI nodes for the next iteration.
5156 // Don't bother with pointers at all.
5291 // If we got here, all operands are loop invariant.
6529 // The only time we can solve this is when we have all constant indices.
6536 // Okay at this point we know that all elements of the chrec are constants and
6647 // Forget all the expressions associated with users of the old value,
6700 // Iterate through all the SCEVUnknown instances and call their
6742 // Print all inner loops first
6777 // out SCEV values of all instructions that are interesting. Doing
6900 // All non-instruction values are loop invariant. All instructions are loop
7049 /// replaceSubString - Replaces all occurences of From in Str with To.
7086 // Gather stringified backedge taken counts for all loops using SCEV's caches.
7093 // Gather stringified backedge taken counts for all loops without using
