Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DRDFGraph.h356 struct NodeBase;
384 NodeBase *ptr(NodeId N) const { in ptr()
391 NodeId id(const NodeBase *P) const;
392 NodeAddr<NodeBase*> New();
450 struct NodeBase { struct
453 NodeBase() = default;
516 struct RefNode : public NodeBase {
591 struct CodeNode : public NodeBase {
602 void addMemberAfter(NodeAddr<NodeBase*> MA, NodeAddr<NodeBase*> NA,
650 NodeBase *ptr(NodeId N) const;
[all …]
H A DRDFGraph.cpp71 auto NA = P.G.addr<NodeBase*>(P.Obj); in operator <<()
390 NodeAddr<NodeBase*> NA = { reinterpret_cast<NodeBase*>(ActiveEnd), in New()
415 void NodeBase::append(NodeAddr<NodeBase*> NA) { in append()
454 NodeAddr<NodeBase*> NA = G.addr<NodeBase*>(getNext()); in getOwner()
481 return NodeAddr<NodeBase*>(); in getFirstMember()
488 return NodeAddr<NodeBase*>(); in getLastMember()
506 void CodeNode::addMemberAfter(NodeAddr<NodeBase*> MA, NodeAddr<NodeBase*> NA, in addMemberAfter()
540 MA = G.addr<NodeBase*>(MX); in removeMember()
553 NodeAddr<NodeBase*> NA = G.addr<NodeBase*>(getNext()); in getOwner()
581 NodeAddr<NodeBase*> MN = M; in addPhi()
[all …]
H A DRDFDeadCode.cpp188 auto BA = DFG.addr<NodeBase*>(I); in erase()
H A DRDFLiveness.cpp296 for (NodeAddr<NodeBase*> R : RDs) in getAllReachingDefsRecImpl()
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DIntervalMap.h221 class NodeBase {
234 void copy(const NodeBase<T1, T2, M> &Other, unsigned i, in copy()
293 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, in transferToLeftSib()
304 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize, in transferToRightSib()
317 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) { in adjustFromLeftSib()
450 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
564 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
701 class BranchNode : public NodeBase<NodeRef, KeyT, N> {