Home
last modified time | relevance | path

Searched refs:PosPair (Results 1 – 3 of 3) sorted by relevance

/external/swiftshader/third_party/LLVM/lib/Support/
DIntervalMap.cpp131 IdxPair PosPair = IdxPair(Nodes, 0); in distribute() local
135 if (PosPair.first == Nodes && Sum > Position) in distribute()
136 PosPair = IdxPair(n, Position - (Sum - NewSize[n])); in distribute()
142 assert(PosPair.first < Nodes && "Bad algebra"); in distribute()
143 assert(NewSize[PosPair.first] && "Too few elements to need Grow"); in distribute()
144 --NewSize[PosPair.first]; in distribute()
156 return PosPair; in distribute()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/
DIntervalMap.cpp131 IdxPair PosPair = IdxPair(Nodes, 0); in distribute() local
135 if (PosPair.first == Nodes && Sum > Position) in distribute()
136 PosPair = IdxPair(n, Position - (Sum - NewSize[n])); in distribute()
142 assert(PosPair.first < Nodes && "Bad algebra"); in distribute()
143 assert(NewSize[PosPair.first] && "Too few elements to need Grow"); in distribute()
144 --NewSize[PosPair.first]; in distribute()
156 return PosPair; in distribute()
/external/llvm/lib/Support/
DIntervalMap.cpp131 IdxPair PosPair = IdxPair(Nodes, 0); in distribute() local
135 if (PosPair.first == Nodes && Sum > Position) in distribute()
136 PosPair = IdxPair(n, Position - (Sum - NewSize[n])); in distribute()
142 assert(PosPair.first < Nodes && "Bad algebra"); in distribute()
143 assert(NewSize[PosPair.first] && "Too few elements to need Grow"); in distribute()
144 --NewSize[PosPair.first]; in distribute()
156 return PosPair; in distribute()