Home
last modified time | relevance | path

Searched refs:FirstNode (Results 1 – 10 of 10) sorted by relevance

/external/swiftshader/third_party/subzero/src/
DIceLiveness.cpp38 void Liveness::initInternal(NodeList::const_iterator FirstNode, in initInternal() argument
65 for (auto I = FirstNode, E = Func->getNodes().end(); I != E; ++I) { in initInternal()
111 for (auto I = FirstNode, E = Func->getNodes().end(); I != E; ++I) { in initInternal()
124 NodeList::const_iterator FirstNode = Func->getNodes().begin(); in init() local
126 initInternal(FirstNode, FirstVar, IsFullInit); in init()
129 void Liveness::initPhiEdgeSplits(NodeList::const_iterator FirstNode, in initPhiEdgeSplits() argument
132 initInternal(FirstNode, FirstVar, IsFullInit); in initPhiEdgeSplits()
DIceLiveness.h68 void initPhiEdgeSplits(NodeList::const_iterator FirstNode,
127 void initInternal(NodeList::const_iterator FirstNode,
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp163 NodeType *FirstNode; member in llvm::Graph::ChildIterator
170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
174 ChildIterator(const ChildIterator& other) : FirstNode(other.FirstNode), in ChildIterator()
179 return other.FirstNode == this->FirstNode && in operator ==()
212 return FirstNode + i; in operator *()
/external/llvm-project/llvm/unittests/ADT/
DTestGraph.h167 NodeType *FirstNode; variable
174 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
183 return other.FirstNode == this->FirstNode &&
216 return FirstNode + i;
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DItaniumManglingCanonicalizer.cpp273 Node *FirstNode, *SecondNode; in addEquivalence() local
276 std::tie(FirstNode, FirstIsNew) = Parse(First); in addEquivalence()
277 if (!FirstNode) in addEquivalence()
280 Alloc.trackUsesOf(FirstNode); in addEquivalence()
286 if (FirstNode == SecondNode) in addEquivalence()
290 Alloc.addRemapping(FirstNode, SecondNode); in addEquivalence()
292 Alloc.addRemapping(SecondNode, FirstNode); in addEquivalence()
/external/llvm-project/llvm/lib/Support/
DItaniumManglingCanonicalizer.cpp268 Node *FirstNode, *SecondNode; in addEquivalence() local
271 std::tie(FirstNode, FirstIsNew) = Parse(First); in addEquivalence()
272 if (!FirstNode) in addEquivalence()
275 Alloc.trackUsesOf(FirstNode); in addEquivalence()
281 if (FirstNode == SecondNode) in addEquivalence()
285 Alloc.addRemapping(FirstNode, SecondNode); in addEquivalence()
287 Alloc.addRemapping(SecondNode, FirstNode); in addEquivalence()
/external/llvm-project/llvm/include/llvm/CodeGen/
DDIE.h557 T *FirstNode = static_cast<T *>(Other.Last->Next.getPointer()); in takeNodes() local
558 T *IterNode = FirstNode; in takeNodes()
567 } while (IterNode != FirstNode); in takeNodes()
/external/llvm-project/llvm/lib/Target/X86/
DX86LoadValueInjectionLoadHardening.cpp569 [&](const Node *N, bool FirstNode) { in elimMitigatedEdgesAndNodes() argument
570 if (!FirstNode) in elimMitigatedEdgesAndNodes()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Object/
DWindowsResource.cpp297 TreeNode *FirstNode = FirstIt->second.get(); in cleanUpManifests() local
303 " in " + InputFilenames[FirstNode->Origin] + " and " + Twine(LastLang) + in cleanUpManifests()
/external/llvm-project/llvm/lib/Object/
DWindowsResource.cpp297 TreeNode *FirstNode = FirstIt->second.get(); in cleanUpManifests() local
303 " in " + InputFilenames[FirstNode->Origin] + " and " + Twine(LastLang) + in cleanUpManifests()