Searched refs:safeFind (Results 1 - 2 of 2) sorted by relevance
/external/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 584 /// safeFind - Find an interval that is known to exist. This is the same as 591 unsigned safeFind(unsigned i, KeyT x) const { function in class:llvm::IntervalMapImpl::LeafNode 606 unsigned i = safeFind(0, x); 720 /// safeFind - Find a subtree that is known to exist. This is the same as 726 unsigned safeFind(unsigned i, KeyT x) const { 739 return subtree(safeFind(0, x)); 1449 unsigned p = NR.get<Branch>().safeFind(0, x); 1453 path.push(NR, NR.get<Leaf>().safeFind(0, x)); 1473 path.leafOffset() = path.leaf<Leaf>().safeFind(path.leafOffset(), x); 1486 path.node<Branch>(l + 1).safeFind(pat [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | IntervalMap.h | 563 /// safeFind - Find an interval that is known to exist. This is the same as 570 unsigned safeFind(unsigned i, KeyT x) const { function in class:llvm::IntervalMapImpl::LeafNode 585 unsigned i = safeFind(0, x); 699 /// safeFind - Find a subtree that is known to exist. This is the same as 705 unsigned safeFind(unsigned i, KeyT x) const { 718 return subtree(safeFind(0, x)); 1439 unsigned p = NR.get<Branch>().safeFind(0, x); 1443 path.push(NR, NR.get<Leaf>().safeFind(0, x)); 1463 path.leafOffset() = path.leaf<Leaf>().safeFind(path.leafOffset(), x); 1476 path.node<Branch>(l + 1).safeFind(pat [all...] |
Completed in 208 milliseconds