Lines Matching defs:Multiple
805 // multiple elements of the buildvector are folded together into a single
809 unsigned Multiple = ByteSize/EltSize; // Number of BV entries per spltval.
811 assert(Multiple > 1 && Multiple <= 4 && "How can this happen?");
820 if (UniquedVals[i&(Multiple-1)].getNode() == 0)
821 UniquedVals[i&(Multiple-1)] = N->getOperand(i);
822 else if (UniquedVals[i&(Multiple-1)] != N->getOperand(i))
826 // Okay, if we reached this point, UniquedVals[0..Multiple-1] contains
834 for (unsigned i = 0; i != Multiple-1; ++i) {
842 if (UniquedVals[Multiple-1].getNode() == 0)
844 int Val = cast<ConstantSDNode>(UniquedVals[Multiple-1])->getZExtValue();
849 if (UniquedVals[Multiple-1].getNode() == 0)
851 int Val =cast<ConstantSDNode>(UniquedVals[Multiple-1])->getSExtValue();
2207 // ObjSize is the true size, ArgSize rounded up to multiple of registers.
2479 // ObjSize is the true size, ArgSize rounded up to multiple of regs.
2551 // ObjSize is the true size, ArgSize rounded up to multiple of registers.
5316 // used (perhaps because there are multiple permutes with the same shuffle
6426 // chain, this transformation is more complex. Note that multiple things
