Home
last modified time | relevance | path

Searched refs:NodeRef (Results 1 – 2 of 2) sorted by relevance

/external/llvm/lib/Support/
DIntervalMap.cpp25 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling()
28 return NodeRef(); in getLeftSibling()
37 return NodeRef(); in getLeftSibling()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft()
75 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling()
78 return NodeRef(); in getRightSibling()
87 return NodeRef(); in getRightSibling()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
110 NodeRef NR = subtree(l); in moveRight()
/external/llvm/include/llvm/ADT/
DIntervalMap.h486 class NodeRef {
496 NodeRef() {} in NodeRef() function
503 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef() function
516 NodeRef &subtree(unsigned i) const { in subtree()
517 return reinterpret_cast<NodeRef*>(pip.getPointer())[i]; in subtree()
526 bool operator==(const NodeRef &RHS) const {
533 bool operator!=(const NodeRef &RHS) const {
697 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
700 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree()
703 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree()
[all …]