Lines Matching defs:Size
87 for (unsigned i = 0, e = LegalTypes.size(); i != e; ++i)
98 if (TypeVec.size() == 1) return true;
110 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)
119 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)
127 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)
136 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)
148 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) {
157 if (TypeVec.size() == 1)
174 assert(TypeVec.size() >= 1 && InVT.TypeVec.size() >= 1 && "No unknowns");
208 TypeVec.size() != 1) {
222 for (unsigned i = 0; i != TypeVec.size(); ++i) {
224 for (unsigned j = 0, e = InVT.TypeVec.size(); j != e; ++j)
258 for (unsigned i = 0; i != TypeVec.size(); ++i)
284 for (unsigned i = 0; i != TypeVec.size(); ++i)
311 for (unsigned i = 0; i != TypeVec.size(); ++i)
336 for (unsigned i = 0; i != TypeVec.size(); ++i)
404 // type size is smaller than the scalar size of the smallest type. For
405 // vectors, we also need to make sure that the total size is no larger than
406 // the size of the smallest type.
409 for (unsigned i = 0; i != Other.TypeVec.size(); ++i) {
431 // type size is larger than the scalar size of the largest type. For
432 // vectors, we also need to make sure that the total size is no smaller than
433 // the size of the largest type.
435 MVT Largest = Other.TypeVec[Other.TypeVec.size()-1];
436 for (unsigned i = 0; i != TypeVec.size(); ++i) {
470 for (unsigned i = 0; i != TypeVec.size(); ++i) {
517 for (unsigned i = 0; i != TypeVec.size(); ++i) {
572 for (unsigned i = 0; i != VTOperand.TypeVec.size(); ++i) {
596 for (unsigned i = 0; i != TypeVec.size(); ++i) {
634 for (unsigned i = 0; i != VTOperand.TypeVec.size(); ++i) {
654 for (unsigned i = 0; i != TypeVec.size(); ++i) {
784 /// getPatternSize - Return the 'size' of this pattern. We want to match large
785 /// patterns before small ones. This is used to determine the size of a
789 unsigned Size = 3; // The node itself.
790 // If the root node is a ConstantSDNode, increases its size.
793 Size += 2;
802 Size += AM->getNumOperands() * 3;
805 return Size;
811 ++Size;
818 Size += getPatternSize(Child, CGP);
821 Size += 5; // Matches a ConstantSDNode (+3) and a specific value (+2).
823 Size += getPatternSize(Child, CGP);
825 ++Size;
829 return Size;
1095 for (unsigned i = 0, e = PropList.size(); i != e; ++i) {
1141 for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i) {
1174 return CDP.getIntrinsic(Operator).IS.RetVTs.size();
1236 for (unsigned i = 0, e = Types.size(); i != e; ++i)
1251 for (unsigned i = 0, e = PredicateFns.size(); i != e; ++i)
1305 CChildren.reserve(Children.size());
1319 for (unsigned i = 0, e = Types.size(); i != e; ++i)
1387 if (Frag->getNumArgs() != Children.size()) {
1410 size(); i != e; ++i)
1414 for (unsigned i = 0, e = getPredicateFns().size(); i != e; ++i)
1663 for (unsigned i = 0, e = Types.size(); i != e; ++i)
1671 assert(Types.size() == 1 && "Invalid IntInit");
1683 unsigned Size = MVT(VT).getSizeInBits();
1685 if (Size >= 32) return MadeChange;
1689 int64_t SignBitAndAbove = II->getValue() >> (Size - 1);
1733 unsigned NumRetVTs = Int->IS.RetVTs.size();
1734 unsigned NumParamVTs = Int->IS.ParamVTs.size();
2028 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
2179 for (unsigned i = 0; i < Children.size(); ++i) {
2254 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
2277 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2300 if (I->second.size() > 1) {
2301 for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {
2314 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
2323 for (unsigned i = 1, e = Args.size(); i != e; ++i)
2329 if (Trees.size() > 1)
2331 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
2337 if (Trees.size() > 1)
2429 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
2491 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
2516 for (unsigned i = 0, e = DefaultOps.size(); i != e; ++i) {
2945 unsigned NumResults = InstResults.size();
2954 if (i == CGI.Operands.size())
2987 for (unsigned i = NumResults, e = CGI.Operands.size(); i != e; ++i) {
3069 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
3087 if (InstInfo.Operands.size() != 0) {
3093 e = InstInfo.Operands.size(); j < e; ++j)
3217 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
3242 if (PatInstrs.size() != 1)
3262 for (unsigned i = 0, e = Revisit.size(); i != e; ++i) {
3275 for (unsigned i = 0, e = Revisit.size(); i != e; ++i) {
3306 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
3339 for (unsigned i = 0, e = Msgs.size(); i != e; ++i)
3341 (Instrs.size() == 1 ?
3344 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
3390 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
3521 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
3527 Idxs.resize(ChildVariants.size());
3533 for (unsigned i = 0; i < Idxs.size(); ++i) {
3541 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
3564 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
3580 for (IdxsIdx = Idxs.size() - 1; IdxsIdx >= 0; --IdxsIdx) {
3581 if (++Idxs[IdxsIdx] == ChildVariants[IdxsIdx].size())
3652 if (MaximalChildren.size() == 3) {
3757 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
3777 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
3786 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
