Lines Matching defs:Values
340 /// Values vector.
2743 std::vector<ConstantInt*> Values;
2749 CompVal = GatherConstantCompares(Cond, Values, ExtraCase, TD, true,
2752 CompVal = GatherConstantCompares(Cond, Values, ExtraCase, TD, false,
2766 array_pod_sort(Values.begin(), Values.end(), ConstantIntSortPredicate);
2767 Values.erase(std::unique(Values.begin(), Values.end()), Values.end());
2771 if (ExtraCase && Values.size() < 2) return false;
2783 DEBUG(dbgs() << "Converting 'icmp' chain with " << Values.size()
2821 SwitchInst *New = Builder.CreateSwitch(CompVal, DefaultBB, Values.size());
2824 for (unsigned i = 0, e = Values.size(); i != e; ++i)
2825 New->addCase(Values[i], EdgeBB);
2834 for (unsigned i = 0, e = Values.size()-1; i != e; ++i)
3440 /// with the contents of Values, using DefaultValue to fill any holes in the
3445 const SmallVectorImpl<std::pair<ConstantInt*, Constant*> >& Values,
3468 // that fits into a target-legal register. Values are retrieved by
3472 // The table is stored as an array of values. Values are retrieved by load
3492 const SmallVectorImpl<std::pair<ConstantInt*, Constant*> >& Values,
3496 assert(Values.size() && "Can't build lookup table without values!");
3497 assert(TableSize >= Values.size() && "Can't fit values in table!");
3500 SingleValue = Values.begin()->second;
3504 for (size_t I = 0, E = Values.size(); I != E; ++I) {
3505 ConstantInt *CaseVal = Values[I].first;
3506 Constant *CaseRes = Values[I].second;
3518 if (Values.size() < TableSize) {