Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DIntervalIterator.h205 BasicBlock *NodeHeader = getNodeHeader(Node); in ProcessNode() local
207 if (Visited.count(NodeHeader)) { // Node already been visited? in ProcessNode()
208 if (Int->contains(NodeHeader)) { // Already in this interval... in ProcessNode()
211 if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set in ProcessNode()
212 Int->Successors.push_back(NodeHeader); in ProcessNode()
218 if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set in ProcessNode()
219 Int->Successors.push_back(NodeHeader); in ProcessNode()
227 Visited.insert(NodeHeader); // The node has now been visited! in ProcessNode()
229 if (Int->isSuccessor(NodeHeader)) { in ProcessNode()
232 Int->Successors.end(), NodeHeader), in ProcessNode()
/freebsd-12.1/contrib/llvm/lib/Support/
H A DItaniumManglingCanonicalizer.cpp92 class alignas(alignof(Node *)) NodeHeader : public llvm::FoldingSetNode { class in __anon46fa78470111::FoldingNodeAllocator
102 llvm::FoldingSet<NodeHeader> Nodes;
124 if (NodeHeader *Existing = Nodes.FindNodeOrInsertPos(ID, InsertPos)) in getOrCreateNode()
130 static_assert(alignof(T) <= alignof(NodeHeader), in getOrCreateNode()
133 RawAlloc.Allocate(sizeof(NodeHeader) + sizeof(T), alignof(NodeHeader)); in getOrCreateNode()
134 NodeHeader *New = new (Storage) NodeHeader; in getOrCreateNode()