Home
last modified time | relevance | path

Searched refs:NodeBase (Results 1 – 6 of 6) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dilist_node_base.h18 template <class NodeBase, bool EnableSentinelTracking> class node_base_prevnext;
20 template <class NodeBase> class node_base_prevnext<NodeBase, false> {
21 NodeBase *Prev = nullptr;
22 NodeBase *Next = nullptr;
25 void setPrev(NodeBase *Prev) { this->Prev = Prev; } in setPrev()
26 void setNext(NodeBase *Next) { this->Next = Next; } in setNext()
27 NodeBase *getPrev() const { return Prev; } in getPrev()
28 NodeBase *getNext() const { return Next; } in getNext()
34 template <class NodeBase> class node_base_prevnext<NodeBase, true> {
35 PointerIntPair<NodeBase *, 1> PrevAndSentinel;
[all …]
H A DIntervalMap.h196 //--- IntervalMapImpl::NodeBase ---//
223 class NodeBase {
236 void copy(const NodeBase<T1, T2, M> &Other, unsigned i, in copy()
295 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, in transferToLeftSib()
306 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize, in transferToRightSib()
319 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) { in adjustFromLeftSib()
452 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
566 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
703 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFGraph.h365 struct NodeBase;
381 using Node = NodeAddr<NodeBase *>;
421 NodeBase *ptr(NodeId N) const { in ptr()
425 return reinterpret_cast<NodeBase *>(Blocks[BlockN] + Offset); in ptr()
428 NodeId id(const NodeBase *P) const;
487 struct NodeBase { struct
490 NodeBase() = default;
547 static_assert(sizeof(NodeBase) <= NodeAllocator::NodeMemSize, argument
553 struct RefNode : public NodeBase {
612 struct CodeNode : public NodeBase {
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRDFGraph.cpp53 auto NA = P.G.addr<NodeBase *>(P.Obj); in operator <<()
366 Node NA = {reinterpret_cast<NodeBase *>(ActiveEnd), makeId(ActiveB, Index)}; in New()
371 NodeId NodeAllocator::id(const NodeBase *P) const { in id()
390 void NodeBase::append(Node NA) { in append()
429 Node NA = G.addr<NodeBase *>(getNext()); in getOwner()
434 NA = G.addr<NodeBase *>(NA.Addr->getNext()); in getOwner()
457 return G.addr<NodeBase *>(CodeData.FirstM); in getFirstMember()
464 return G.addr<NodeBase *>(CodeData.LastM); in getLastMember()
514 MA = G.addr<NodeBase *>(MX); in removeMember()
527 Node NA = G.addr<NodeBase *>(getNext()); in getOwner()
[all …]
H A DRDFLiveness.cpp330 for (NodeAddr<NodeBase *> R : RDs) in getAllReachingDefsRecImpl()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp189 auto BA = DFG.addr<NodeBase*>(I); in erase()