Home
last modified time | relevance | path

Searched refs:ArgumentGraph (Results 1 – 3 of 3) sorted by relevance

/external/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp239 class ArgumentGraph { class
255 ArgumentGraph() { SyntheticRoot.Definition = nullptr; } in ArgumentGraph() function in __anon8d90fee20311::ArgumentGraph
346 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> {
347 static NodeType *getEntryNode(ArgumentGraph *AG) { in getEntryNode()
350 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
353 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
490 ArgumentGraph AG; in addArgumentAttrs()
574 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp324 class ArgumentGraph { class
340 ArgumentGraph() { SyntheticRoot.Definition = nullptr; } in ArgumentGraph() function in __anon0d2940c40211::ArgumentGraph
432 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> {
433 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
435 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
439 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
688 ArgumentGraph AG; in addArgumentAttrs()
765 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
/external/llvm-project/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp325 class ArgumentGraph { class
341 ArgumentGraph() { SyntheticRoot.Definition = nullptr; } in ArgumentGraph() function in __anon0331d7500211::ArgumentGraph
433 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> {
434 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
436 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
440 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
689 ArgumentGraph AG; in addArgumentAttrs()
766 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()