Lines Matching defs:Size
413 unsigned NumValsBeforeLHS = Vals.size();
417 unsigned NumVals = Vals.size();
447 assert(Vals.size() == NumValsBeforeLHS);
535 if (V1->size() > V2->size())
538 if (V1->size() == 0) return false;
539 if (V1->size() == 1) {
542 for (unsigned i = 0, e = V2->size(); i != e; ++i)
550 unsigned i1 = 0, i2 = 0, e1 = V1->size(), e2 = V2->size();
605 assert(ThisCases.size() == 1 && "Branch can only have one case!");
623 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
651 if (HasWeight && Weights.size() >= 2)
664 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
675 for (unsigned i = 0, e = ThisCases.size(); i != e; ++i)
750 assert(Weights.size() == 2);
807 if (Weights.size() != 1 + PredCases.size())
813 Weights.assign(1 + PredCases.size(), 1);
819 if (SuccWeights.size() != 1 + BBCases.size())
822 SuccWeights.assign(1 + BBCases.size(), 1);
828 size(); i != e; ++i)
853 unsigned CasesFromPred = Weights.size();
855 for (unsigned i = 0, e = BBCases.size(); i != e; ++i)
883 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
900 for (unsigned i = 0, e = BBCases.size(); i != e; ++i)
925 for (unsigned i = 0, e = NewSuccessors.size(); i != e; ++i)
938 PredCases.size());
940 for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
1582 unsigned Size = 0;
1587 if (Size > 10) return false; // Don't clone large BB's.
1588 ++Size;
2219 if (NewWeights.size() == 2) {
2231 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) {
2599 if (Weights.size() == 1 + SI->getNumCases()) {
2733 if (Weights.size() == 1 + SI->getNumCases()) {
2795 if (ExtraCase && Values.size() < 2) return false;
2807 DEBUG(dbgs() << "Converting 'icmp' chain with " << Values.size()
2845 SwitchInst *New = Builder.CreateSwitch(CompVal, DefaultBB, Values.size());
2848 for (unsigned i = 0, e = Values.size(); i != e; ++i)
2858 for (unsigned i = 0, e = Values.size()-1; i != e; ++i)
3029 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
3155 assert(Cases.size() == SI->getNumCases() && "Not all cases gathered");
3159 for (unsigned I = 1, E = Cases.size(); I != E; ++I) {
3184 if (Weights.size() == 1 + SI->getNumCases()) {
3189 for (unsigned I = 1, E = Weights.size(); I != E; ++I)
3232 HasWeight = (Weights.size() == 1 + SI->getNumCases());
3236 for (unsigned I = 0, E = DeadCases.size(); I != E; ++I) {
3249 if (HasWeight && Weights.size() >= 2) {
3320 if (Indexes.size() < 2) continue;
3322 for (size_t I = 0, E = Indexes.size(); I != E; ++I)
3460 return Res.size() > 0;
3526 assert(Values.size() && "Can't build lookup table without values!");
3527 assert(TableSize >= Values.size() && "Can't fit values in table!");
3536 for (size_t I = 0, E = Values.size(); I != E; ++I) {
3550 if (Values.size() < TableSize) {
3654 /// for this switch, based on the number of cases, size of the table and the
3760 for (size_t I = 0, E = PHIs.size(); I != E; ++I) {
3765 uint64_t NumResults = ResultLists[PHIs[0]].size();
3787 for (size_t I = 0, E = DefaultResultsList.size(); I != E; ++I) {
3808 // Compute the maximum table size representable by the integer type we are
3814 "representable value of its input integer type's size.");
3848 for (size_t I = 0, E = ResultList.size(); I != E; ++I) {
3873 for (size_t I = 0, E = PHIs.size(); I != E; ++I) {
