Lines Matching defs:All
698 // arithmetic. To do exact division in modular arithmetic, all we have
722 // (It's possible to not widen at all by pulling out factors of 2 before
845 // eliminate all the truncates.
860 // eliminate all the truncates.
927 // It's possible the bits taken off by the truncate were all zero bits. If
939 // did not overflow the old, smaller, value, we can zero extend all of the
1193 // It's possible the bits taken off by the truncate were all sign bits. If
1205 // did not overflow the old, smaller, value, we can sign extend all of the
1478 // If FlagNSW is true and all the operands are non-negative, infer FlagNUW.
1483 bool All = true;
1487 All = false;
1490 if (All) Flags = setFlags(Flags, (SCEV::NoWrapFlags)SignOrUnsignMask);
1493 // Sort by complexity, this groups all similar expression types together.
1543 // Check for truncates. If all the operands are truncated from the same
1553 // Check all the operands to see if they can be represented in the
1737 // Scan over all recurrences, trying to fold loop invariants into them.
1739 // Scan all of the other operands to this add and add them to the vector if
1766 // If all of the other operands were loop invariant, we are done.
1881 // If FlagNSW is true and all the operands are non-negative, infer FlagNUW.
1886 bool All = true;
1890 All = false;
1893 if (All) Flags = setFlags(Flags, (SCEV::NoWrapFlags)SignOrUnsignMask);
1896 // Sort by complexity, this groups all similar expression types together.
1968 // If there are mul operands inline them all into this expression.
1992 // Scan over all recurrences, trying to fold loop invariants into them.
1994 // Scan all of the other operands to this mul and add them to the vector if
2023 // 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
2947 /// ForgetSymbolicValue - This looks up computed SCEV values for all
3087 // to be symbolic. We now need to go back and purge all of the
3115 // to be symbolic. We now need to go back and purge all of the
3188 // Add the total offset from all the GEP indices to the base.
3219 // The result is the min of all operands results.
3227 // The result is the sum of all operands results.
3238 // The result is the min of all operands results.
3246 // The result is the min of all operands results.
3254 // The result is the min of all operands results.
3490 // If there's no signed wrap, and all the operands have the same sign or
3600 // bunch of things all added together, this can be quite inefficient,
3602 // Instead, gather up all the operands and make a single getAddExpr call.
4034 // Push all Loop-header PHIs onto the Worklist stack.
4146 // Forget all contained loops too, to avoid dangling entries in the
4180 /// getExact - Get the exact loop backedge taken count considering all loop
4182 /// Returning the minimum taken count among all exits is incorrect because one
4272 // Examine all exits and pick the most conservative values.
4667 /// specified type, assuming that all operands were constants.
4681 /// assuming its operands can all constant evolve.
4706 // Otherwise, we can evaluate this instruction if all of its operands are
4889 // If all entries in CurrentIterVals == NextIterVals then we can stop
4949 // Update all the PHI nodes for the next iteration.
5071 // Don't bother with pointers at all.
5206 // If we got here, all operands are loop invariant.
6388 // The only time we can solve this is when we have all constant indices.
6395 // Okay at this point we know that all elements of the chrec are constants and
6506 // Forget all the expressions associated with users of the old value,
6559 // Iterate through all the SCEVUnknown instances and call their
6599 // Print all inner loops first
6634 // out SCEV values of all instructions that are interesting. Doing
6757 // All non-instruction values are loop invariant. All instructions are loop
