reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
795 return *reinterpret_cast<NodeT*>(path[Level].node); 797 unsigned size(unsigned Level) const { return path[Level].size; } 798 unsigned offset(unsigned Level) const { return path[Level].offset; } 799 unsigned &offset(unsigned Level) { return path[Level].offset; } 803 return *reinterpret_cast<NodeT*>(path.back().node); 805 unsigned leafSize() const { return path.back().size; } 806 unsigned leafOffset() const { return path.back().offset; } 807 unsigned &leafOffset() { return path.back().offset; } 811 return !path.empty() && path.front().offset < path.front().size; 811 return !path.empty() && path.front().offset < path.front().size; 811 return !path.empty() && path.front().offset < path.front().size; 816 unsigned height() const { return path.size() - 1; } 822 return path[Level].subtree(path[Level].offset); 822 return path[Level].subtree(path[Level].offset); 828 path[Level] = Entry(subtree(Level - 1), offset(Level)); 835 path.push_back(Entry(Node, Offset)); 840 path.pop_back(); 848 path[Level].size = Size; 858 path.clear(); 859 path.push_back(Entry(Node, Size, Offset)); 898 for (unsigned i = 0, e = path.size(); i != e; ++i) 899 if (path[i].offset != 0) 908 return path[Level].offset == path[Level].size - 1; 908 return path[Level].offset == path[Level].size - 1; 920 ++path[Level].offset;lib/Support/IntervalMap.cpp
19 assert(!path.empty() && "Can't replace missing root"); 20 path.front() = Entry(Root, Size, Offsets.first); 21 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); 21 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); 31 while (l && path[l].offset == 0) 35 if (path[l].offset == 0) 39 NodeRef NR = path[l].subtree(path[l].offset - 1); 39 NodeRef NR = path[l].subtree(path[l].offset - 1); 54 while (path[l].offset == 0) { 60 path.resize(Level + 1, Entry(nullptr, 0, 0)); 63 --path[l].offset; 68 path[l] = Entry(NR, NR.size() - 1); 71 path[l] = Entry(NR, NR.size() - 1); 89 NodeRef NR = path[l].subtree(path[l].offset + 1); 89 NodeRef NR = path[l].subtree(path[l].offset + 1); 107 if (++path[l].offset == path[l].size) 107 if (++path[l].offset == path[l].size) 112 path[l] = Entry(NR, 0); 115 path[l] = Entry(NR, 0);