| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | PostOrderIterator.h | 143 static po_iterator begin(const GraphT &G) { in begin()
146 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
148 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
151 static po_iterator end(const GraphT &G, SetType &S) { return po_iterator(S); } in end()
184 po_iterator<T> po_begin(const T &G) { return po_iterator<T>::begin(G); } in po_begin()
186 po_iterator<T> po_end (const T &G) { return po_iterator<T>::end(G); } in po_end()
188 template <class T> iterator_range<po_iterator<T>> post_order(const T &G) { in post_order()
200 po_ext_iterator<T, SetType> po_ext_begin(T G, SetType &S) { in po_ext_begin()
205 po_ext_iterator<T, SetType> po_ext_end(T G, SetType &S) { in po_ext_end()
210 iterator_range<po_ext_iterator<T, SetType>> post_order_ext(const T &G, SetType &S) { in post_order_ext()
[all …]
|
| H A D | DepthFirstIterator.h | 152 static df_iterator begin(const GraphT &G) { in begin()
155 static df_iterator end(const GraphT &G) { return df_iterator(); } in end()
158 static df_iterator begin(const GraphT &G, SetType &S) { in begin()
161 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end()
218 df_iterator<T> df_begin(const T& G) { in df_begin()
223 df_iterator<T> df_end(const T& G) { in df_end()
229 iterator_range<df_iterator<T>> depth_first(const T& G) { in depth_first()
241 df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) { in df_ext_begin()
246 df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) { in df_ext_end()
251 iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G, in depth_first_ext()
[all …]
|
| H A D | BreadthFirstIterator.h | 114 static bf_iterator begin(const GraphT &G) { in begin()
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); } in end()
148 template <class T> bf_iterator<T> bf_begin(const T &G) { in bf_begin()
152 template <class T> bf_iterator<T> bf_end(const T &G) { in bf_end()
157 template <class T> iterator_range<bf_iterator<T>> breadth_first(const T &G) { in breadth_first()
|
| H A D | SCCIterator.h | 101 static scc_iterator begin(const GraphT &G) { in begin()
228 template <class T> scc_iterator<T> scc_begin(const T &G) { in scc_begin()
233 template <class T> scc_iterator<T> scc_end(const T &G) { in scc_end()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | DDGPrinter.cpp | 39 static void writeDDGToDotFile(DataDependenceGraph &G, bool DOnly) { in writeDDGToDotFile()
69 const DataDependenceGraph *G) { in getEdgeAttributes()
87 const DataDependenceGraph *G) { in getSimpleNodeLabel()
105 const DataDependenceGraph *G) { in getVerboseNodeLabel()
130 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getSimpleEdgeAttributes()
139 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getVerboseEdgeAttributes()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Orc/ |
| H A D | ObjectLinkingLayer.cpp | 35 Create(ObjectLinkingLayer &ObjLinkingLayer, std::unique_ptr<LinkGraph> G) { in Create()
48 static LinkGraphInterface scanLinkGraph(ExecutionSession &ES, LinkGraph &G) { in scanLinkGraph()
75 static bool hasMachOInitSection(LinkGraph &G) { in hasMachOInitSection()
86 static SymbolStringPtr makeInitSymbol(ExecutionSession &ES, LinkGraph &G) { in makeInitSymbol()
94 std::unique_ptr<LinkGraph> G, in LinkGraphMaterializationUnit()
111 std::unique_ptr<LinkGraph> G; member in __anon0ff717e70111::LinkGraphMaterializationUnit
140 void notifyMaterializing(LinkGraph &G) { in notifyMaterializing()
203 Error notifyResolved(LinkGraph &G) override { in notifyResolved()
315 return [this](LinkGraph &G) { return markResponsibilitySymbolsLive(G); }; in getMarkLivePass()
321 Config.PrePrunePasses.push_back([this](LinkGraph &G) { in modifyPassConfig()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/JITLink/ |
| H A D | PerGraphGOTAndPLTStubsBuilder.h | 34 PerGraphGOTAndPLTStubsBuilder(LinkGraph &G) : G(G) {} in PerGraphGOTAndPLTStubsBuilder()
36 static Error asPass(LinkGraph &G) { return BuilderImplT(G).run(); } in asPass()
112 LinkGraph &G; variable
|
| H A D | JITLinkGeneric.h | 36 std::unique_ptr<LinkGraph> G, PassConfiguration Passes) in JITLinkerBase()
116 std::unique_ptr<LinkGraph> G; variable
147 Error fixUpBlocks(LinkGraph &G) const override { in fixUpBlocks()
|
| H A D | ELF_x86_64.cpp | 156 static Error optimizeELF_x86_64_GOTAndStubs(LinkGraph &G) { in optimizeELF_x86_64_GOTAndStubs()
288 std::unique_ptr<LinkGraph> G; member in llvm::jitlink::ELFLinkGraphBuilder_x86_64
726 std::unique_ptr<LinkGraph> G, in ELFJITLinker_x86_64()
730 [this](LinkGraph &G) { return getOrCreateGOTSymbol(G); }); in ELFJITLinker_x86_64()
736 Error getOrCreateGOTSymbol(LinkGraph &G) { in getOrCreateGOTSymbol()
783 Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
879 identifyELFSectionStartAndEndSymbols(LinkGraph &G, Symbol &Sym) { in identifyELFSectionStartAndEndSymbols()
896 void link_ELF_x86_64(std::unique_ptr<LinkGraph> G, in link_ELF_x86_64()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-jitlink/ |
| H A D | llvm-jitlink-elf.cpp | 27 static Expected<Edge &> getFirstRelocationEdge(LinkGraph &G, Block &B) { in getFirstRelocationEdge()
38 static Expected<Symbol &> getELFGOTTarget(LinkGraph &G, Block &B) { in getELFGOTTarget()
53 static Expected<Symbol &> getELFStubTarget(LinkGraph &G, Block &B) { in getELFStubTarget()
69 Error registerELFGraphInfo(Session &S, LinkGraph &G) { in registerELFGraphInfo()
|
| H A D | llvm-jitlink-macho.cpp | 29 static Expected<Edge &> getFirstRelocationEdge(LinkGraph &G, Block &B) { in getFirstRelocationEdge()
40 static Expected<Symbol &> getMachOGOTTarget(LinkGraph &G, Block &B) { in getMachOGOTTarget()
55 static Expected<Symbol &> getMachOStubTarget(LinkGraph &G, Block &B) { in getMachOStubTarget()
71 Error registerMachOGraphInfo(Session &S, LinkGraph &G) { in registerMachOGraphInfo()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/alpha/ |
| H A D | linux-elf.h | 29 #define CHOOSE_DYNAMIC_LINKER(G, U) "%{mglibc:" G ";:" U "}" argument
31 #define CHOOSE_DYNAMIC_LINKER(G, U) "%{muclibc:" U ";:" G "}" argument
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/config/alpha/ |
| H A D | linux-elf.h | 29 #define CHOOSE_DYNAMIC_LINKER(G, U) "%{mglibc:" G ";:" U "}" argument
31 #define CHOOSE_DYNAMIC_LINKER(G, U) "%{muclibc:" U ";:" G "}" argument
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGDumper.cpp | 523 const SelectionDAG *G) { in printMemOperand()
888 static bool shouldPrintInline(const SDNode &Node, const SelectionDAG *G) { in shouldPrintInline()
899 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) { in DumpNodes()
944 static bool printOperand(raw_ostream &OS, const SelectionDAG *G, in printOperand()
966 const SelectionDAG *G, VisitedSDNodeSet &once) { in DumpNodesr()
1004 const SelectionDAG *G, unsigned depth, in printrWithDepthHelper()
1025 void SDNode::printrWithDepth(raw_ostream &OS, const SelectionDAG *G, in printrWithDepth()
1037 void SDNode::dumprWithDepth(const SelectionDAG *G, unsigned depth) const { in dumprWithDepth() argument
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/IR/ |
| H A D | Comdat.cpp | 33 GlobalObject *G = unwrap<GlobalObject>(V); in LLVMGetComdat() local
38 GlobalObject *G = unwrap<GlobalObject>(V); in LLVMSetComdat() local
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
111 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
118 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
132 void disconnectFromN(Graph &G, unsigned NIdx) { in disconnectFromN()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
238 NodeItr(NodeId CurNId, const Graph &G) in NodeItr()
262 EdgeItr(EdgeId CurEId, const Graph &G) in EdgeItr()
286 NodeIdSet(const Graph &G) : G(G) {} in NodeIdSet()
303 EdgeIdSet(const Graph &G) : G(G) {} in EdgeIdSet()
|
| H A D | ReductionRules.h | 30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
180 Solution backpropagate(GraphT& G, StackT stack) { in backpropagate()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/JITLink/ |
| H A D | x86_64.h | 261 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup()
378 inline Block &createPointerJumpStubBlock(LinkGraph &G, Section &StubSection, in createPointerJumpStubBlock()
390 inline Symbol &createAnonymousPointerJumpStub(LinkGraph &G, in createAnonymousPointerJumpStub()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/config/ |
| H A D | linux.h | 78 #define CHOOSE_DYNAMIC_LINKER(G, U, B, M) \ argument
81 #define CHOOSE_DYNAMIC_LINKER(G, U, B, M) \ argument
84 #define CHOOSE_DYNAMIC_LINKER(G, U, B, M) \ argument
87 #define CHOOSE_DYNAMIC_LINKER(G, U, B, M) \ argument
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| H A D | MergeFunctions.cpp | 530 void MergeFunctions::eraseTail(Function *G) { in eraseTail()
676 void MergeFunctions::writeThunk(Function *F, Function *G) { in writeThunk()
764 void MergeFunctions::writeAlias(Function *F, Function *G) { in writeAlias()
786 bool MergeFunctions::writeThunkOrAlias(Function *F, Function *G) { in writeThunkOrAlias()
799 void MergeFunctions::mergeTwoFunctions(Function *F, Function *G) { in mergeTwoFunctions()
863 Function *G) { in replaceFunctionInTree()
882 static bool isFuncOrderCorrect(const Function *F, const Function *G) { in isFuncOrderCorrect()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/Orc/ |
| H A D | ObjectLinkingLayer.h | 72 jitlink::LinkGraph &G, in modifyPassConfig()
78 jitlink::LinkGraph &G, in notifyMaterializing()
136 Error add(JITDylib &JD, std::unique_ptr<jitlink::LinkGraph> G) { in add()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/ |
| H A D | linux.h | 83 #define CHOOSE_DYNAMIC_LINKER(G, U, B, M) \ argument
86 #define CHOOSE_DYNAMIC_LINKER(G, U, B, M) \ argument
89 #define CHOOSE_DYNAMIC_LINKER(G, U, B, M) \ argument
92 #define CHOOSE_DYNAMIC_LINKER(G, U, B, M) \ argument
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 192 void apply(PBQPRAGraph &G) override { in apply()
223 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
238 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
304 void apply(PBQPRAGraph &G) override { in apply()
396 bool createInterferenceEdge(PBQPRAGraph &G, in createInterferenceEdge()
437 void apply(PBQPRAGraph &G) override { in apply()
590 void RegAllocPBQP::initializeGraph(PBQPRAGraph &G, VirtRegMap &VRM, in initializeGraph()
716 bool RegAllocPBQP::mapPBQPToRegAlloc(const PBQPRAGraph &G, in mapPBQPToRegAlloc()
851 PBQPRAGraph G(PBQPRAGraph::GraphMetadata(MF, LIS, MBFI)); in runOnMachineFunction() local
888 const PBQP::RegAlloc::PBQPRAGraph &G) { in PrintNodeInfo()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 387 Node(LazyCallGraph &G, Function &F) : G(&G), F(&F) {} in Node()
541 LazyCallGraph *G; variable
881 LazyCallGraph *G; variable
885 postorder_ref_scc_iterator(LazyCallGraph &G) : G(&G), RC(getRC(G, 0)) {} in postorder_ref_scc_iterator()
888 postorder_ref_scc_iterator(LazyCallGraph &G, IsAtEndT /*Nonce*/) : G(&G) {} in postorder_ref_scc_iterator()
892 static RefSCC *getRC(LazyCallGraph &G, int Index) { in getRC()
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| H A D | xray_profiling.cc | 276 RecursionGuard G(ReentranceGuard); in profilingHandleArg0() local
337 RecursionGuard G(ReentranceGuard); in profilingFinalize() local
355 RecursionGuard G(ReentranceGuard); in profilingLoggingInit() local
446 RecursionGuard G(ReentranceGuard); in profilingLoggingInit() local
|