Searched refs:IsSorted (Results 1 – 5 of 5) sorted by relevance
150 assert(vec1.IsSorted() && vec2.IsSorted()); in GetOverlaps() 223 bool IsSorted() const { in IsSorted() function 238 assert(IsSorted()); in CombineConsecutiveRanges() 263 assert(IsSorted()); in GetMinRangeBase() 274 assert(IsSorted()); in GetMaxRangeEnd() 318 assert(IsSorted()); in FindEntryIndexThatContains() 340 assert(IsSorted()); in FindEntryThatContains() 363 assert(IsSorted()); in FindEntryThatContains() 475 bool IsSorted() cons function 755 bool IsSorted() const { IsSorted() function [all...]
21 if (!IsSorted) { in getDeclOccurrencesSortedByOffset()26 IsSorted = true; in getDeclOccurrencesSortedByOffset()36 IsSorted = false; in addDeclOccurence()43 IsSorted = false; in addMacroOccurence()
30 mutable bool IsSorted = false; variable
5222 bool IsSorted = true; in splitAlloca() local5247 IsSorted = false; in splitAlloca()5263 IsSorted = false; in splitAlloca()5268 if (!IsSorted) in splitAlloca()
4577 bool IsSorted = sortPtrAccesses(PointerOps, ScalarTy, *DL, *SE, Order); in canVectorizeLoads() local 4586 if (!IsSorted && Sz > MinProfitableStridedLoads && TTI->isTypeLegal(VecTy) && in canVectorizeLoads() 4590 if (IsSorted || all_of(PointerOps, [&](Value *P) { in canVectorizeLoads() 4593 if (IsSorted) { in canVectorizeLoads() 4763 if (ProfitableGatherPointers || all_of(PointerOps, [IsSorted](Value *P) { in canVectorizeLoads() 4765 return (IsSorted && !GEP && doesNotNeedToBeScheduled(P)) || in canVectorizeLoads()