Lines Matching defs:Invariant
408 /// instruction (shuffle) for loop invariant values and for the induction
419 /// values within the current basic block or on loop invariant values.
421 /// are not within the map, they have to be loop invariant, so we simply
1323 /// \brief Collect memory access with loop invariant strides.
1326 /// invariant.
1454 /// Holds the number of loop invariant values that are used in the loop.
1941 // We need to place the broadcast of invariant variables outside the loop.
1946 bool Invariant = OrigLoop->isLoopInvariant(V) && !NewInstr;
1948 // Place the code for broadcasting invariant variables in the new preheader.
1950 if (Invariant)
2017 // Make sure that all of the index operands are loop invariant.
2062 invariant.
2090 // loop invariant. Broadcast V and save the value for future uses.
2382 // If the pointer is loop invariant or if it is non-consecutive,
2410 "Base ptr must be invariant");
2423 // Update last index or loop invariant instruction anchored in loop.
2429 "Must be last index or loop invariant");
3362 // any loop invariant values.
3776 // If the selector is loop invariant we can create a select
3783 // The condition can be loop invariant but still defined inside the
4328 // second argument is the same (i.e. loop invariant)
4463 << "write to a loop invariant address could not be vectorized");
5082 // usage number because when we unroll, loop-invariant values do not take
5202 unsigned Invariant = 0;
5204 Invariant = LoopInvariants.size();
5207 Invariant += GetRegUsage(Inst->getType(), VFs[i]);
5212 DEBUG(dbgs() << "LV(REG): Found invariant usage: " << Invariant << '\n');
5215 RU.LoopInvariantRegs = Invariant;
5270 /// other indices are loop invariant. If the stride of this access is also
5282 // We are looking for a gep with all loop invariant indices except for one
