Home
last modified time | relevance | path

Searched defs:G (Results 1 – 25 of 198) sorted by relevance

12345678

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
HDPostOrderIterator.h140 static po_iterator begin(GraphT G) { in begin()
143 static po_iterator end(GraphT G) { return po_iterator(); } in end()
145 static po_iterator begin(GraphT G, SetType &S) { in begin()
148 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); } in end()
181 po_iterator<T> po_begin(const T &G) { return po_iterator<T>::begin(G); } in po_begin()
183 po_iterator<T> po_end (const T &G) { return po_iterator<T>::end(G); } in po_end()
185 template <class T> iterator_range<po_iterator<T>> post_order(const T &G) { in post_order()
197 po_ext_iterator<T, SetType> po_ext_begin(T G, SetType &S) { in po_ext_begin()
202 po_ext_iterator<T, SetType> po_ext_end(T G, SetType &S) { in po_ext_end()
207 iterator_range<po_ext_iterator<T, SetType>> post_order_ext(const T &G, SetType &S) { in post_order_ext()
[all …]
HDDepthFirstIterator.h150 static df_iterator begin(const GraphT &G) { in begin()
153 static df_iterator end(const GraphT &G) { return df_iterator(); } in end()
156 static df_iterator begin(const GraphT &G, SetType &S) { in begin()
159 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end()
216 df_iterator<T> df_begin(const T& G) { in df_begin()
221 df_iterator<T> df_end(const T& G) { in df_end()
227 iterator_range<df_iterator<T>> depth_first(const T& G) { in depth_first()
239 df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) { in df_ext_begin()
244 df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) { in df_ext_end()
249 iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G, in depth_first_ext()
[all …]
HDBreadthFirstIterator.h113 static bf_iterator begin(const GraphT &G) { in begin()
117 static bf_iterator end(const GraphT &G) { return bf_iterator(); } in end()
147 template <class T> bf_iterator<T> bf_begin(const T &G) { in bf_begin()
151 template <class T> bf_iterator<T> bf_end(const T &G) { in bf_end()
156 template <class T> iterator_range<bf_iterator<T>> breadth_first(const T &G) { in breadth_first()
HDSCCIterator.h101 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()
/freebsd-11-stable/contrib/libstdc++/config/cpu/ia64/
Datomic_word.h65 #define _GLIBCXX_GUARD_TEST_AND_ACQUIRE(G) __gnu_cxx::__test_and_acquire (G) argument
66 #define _GLIBCXX_GUARD_SET_AND_RELEASE(G) __gnu_cxx::__set_and_release (G) argument
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
HDSelectionDAGDumper.cpp487 const SelectionDAG *G) { in printMemOperand()
812 static bool shouldPrintInline(const SDNode &Node, const SelectionDAG *G) { in shouldPrintInline()
823 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) { in DumpNodes()
870 static bool printOperand(raw_ostream &OS, const SelectionDAG *G, in printOperand()
892 const SelectionDAG *G, VisitedSDNodeSet &once) { in DumpNodesr()
930 const SelectionDAG *G, unsigned depth, in printrWithDepthHelper()
951 void SDNode::printrWithDepth(raw_ostream &OS, const SelectionDAG *G, in printrWithDepth()
963 void SDNode::dumprWithDepth(const SelectionDAG *G, unsigned depth) const { in dumprWithDepth() argument
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
HDBasicGOTAndStubsBuilder.h23 BasicGOTAndStubsBuilder(LinkGraph &G) : G(G) {} in BasicGOTAndStubsBuilder()
69 LinkGraph &G; variable
/freebsd-11-stable/contrib/libstdc++/libsupc++/
Dguard.cc73 #define _GLIBCXX_GUARD_TEST_AND_ACQUIRE(G) __test_and_acquire (G) argument
83 #define _GLIBCXX_GUARD_SET_AND_RELEASE(G) __set_and_release (G) argument
90 #define _GLIBCXX_GUARD_SET_AND_RELEASE(G) _GLIBCXX_GUARD_SET (G) argument
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
HDComdat.cpp33 GlobalObject *G = unwrap<GlobalObject>(V); in LLVMGetComdat() local
38 GlobalObject *G = unwrap<GlobalObject>(V); in LLVMSetComdat() local
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
HDGraph.h80 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()
HDReductionRules.h30 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()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
HDMergeFunctions.cpp531 void MergeFunctions::eraseTail(Function *G) { in eraseTail()
681 void MergeFunctions::writeThunk(Function *F, Function *G) { in writeThunk()
767 void MergeFunctions::writeAlias(Function *F, Function *G) { in writeAlias()
789 bool MergeFunctions::writeThunkOrAlias(Function *F, Function *G) { in writeThunkOrAlias()
802 void MergeFunctions::mergeTwoFunctions(Function *F, Function *G) { in mergeTwoFunctions()
866 Function *G) { in replaceFunctionInTree()
885 static bool isFuncOrderCorrect(const Function *F, const Function *G) { in isFuncOrderCorrect()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
HDObjectLinkingLayer.cpp94 void notifyResolved(LinkGraph &G) override { in notifyResolved()
163 return [this](LinkGraph &G) { return markResponsibilitySymbolsLive(G); }; in getMarkLivePass()
170 [this](LinkGraph &G) { return externalizeWeakAndCommonSymbols(G); }); in modifyPassConfig()
172 [this](LinkGraph &G) { return computeNamedSymbolDependencies(G); }); in modifyPassConfig()
182 Error externalizeWeakAndCommonSymbols(LinkGraph &G) { in externalizeWeakAndCommonSymbols()
207 Error computeNamedSymbolDependencies(LinkGraph &G) { in computeNamedSymbolDependencies()
240 AnonToNamedDependenciesMap computeAnonDeps(LinkGraph &G) { in computeAnonDeps()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
HDRegAllocPBQP.cpp193 void apply(PBQPRAGraph &G) override { in apply()
224 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
239 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
305 void apply(PBQPRAGraph &G) override { in apply()
397 bool createInterferenceEdge(PBQPRAGraph &G, in createInterferenceEdge()
438 void apply(PBQPRAGraph &G) override { in apply()
577 void RegAllocPBQP::initializeGraph(PBQPRAGraph &G, VirtRegMap &VRM, in initializeGraph()
703 bool RegAllocPBQP::mapPBQPToRegAlloc(const PBQPRAGraph &G, in mapPBQPToRegAlloc()
840 PBQPRAGraph G(PBQPRAGraph::GraphMetadata(MF, LIS, MBFI)); in runOnMachineFunction() local
877 const PBQP::RegAlloc::PBQPRAGraph &G) { in PrintNodeInfo()
HDLowerEmuTLS.cpp76 for (const auto &G : M.globals()) { in runOnModule() local
80 for (const auto G : TlsVars) in runOnModule() local
/freebsd-11-stable/sys/dev/hatm/
HDif_hatmreg.h138 #define HE_REGO_RBP_S(K,G) (HE_REGO_G0_RBPS_S + (K) * 0x10 + (G) * 0x20) argument
139 #define HE_REGO_RBP_T(K,G) (HE_REGO_G0_RBPS_T + (K) * 0x10 + (G) * 0x20) argument
140 #define HE_REGO_RBP_QI(K,G) (HE_REGO_G0_RBPS_QI + (K) * 0x10 + (G) * 0x20) argument
141 #define HE_REGO_RBP_BL(K,G) (HE_REGO_G0_RBPS_BL + (K) * 0x10 + (G) * 0x20) argument
157 #define HE_REGO_RBRQ_ST(G) (HE_REGO_G0_RBRQ_ST + (G) * 0x10) argument
158 #define HE_REGO_RBRQ_H(G) (HE_REGO_G0_RBRQ_H + (G) * 0x10) argument
159 #define HE_REGO_RBRQ_Q(G) (HE_REGO_G0_RBRQ_Q + (G) * 0x10) argument
160 #define HE_REGO_RBRQ_I(G) (HE_REGO_G0_RBRQ_I + (G) * 0x10) argument
173 #define HE_REGO_INMQ_S(G) (HE_REGO_G0_INMQ_S + (G) * 8) argument
174 #define HE_REGO_INMQ_L(G) (HE_REGO_G0_INMQ_L + (G) * 8) argument
[all …]
/freebsd-11-stable/contrib/gcc/config/
HDlinux.h106 #define CHOOSE_DYNAMIC_LINKER(G, U) "%{mglibc:%{muclibc:%e-mglibc and -muclibc used together}" G ";… argument
108 #define CHOOSE_DYNAMIC_LINKER(G, U) "%{muclibc:%{mglibc:%e-mglibc and -muclibc used together}" U ";… argument
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
HDLazyCallGraph.h397 Node(LazyCallGraph &G, Function &F) : G(&G), F(&F) {} in Node()
551 LazyCallGraph *G; variable
895 LazyCallGraph *G; variable
899 postorder_ref_scc_iterator(LazyCallGraph &G) : G(&G), RC(getRC(G, 0)) {} in postorder_ref_scc_iterator()
902 postorder_ref_scc_iterator(LazyCallGraph &G, IsAtEndT /*Nonce*/) : G(&G) {} in postorder_ref_scc_iterator()
906 static RefSCC *getRC(LazyCallGraph &G, int Index) { in getRC()
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/
HDxray_profiling.cpp275 RecursionGuard G(ReentranceGuard); in profilingHandleArg0() local
336 RecursionGuard G(ReentranceGuard); in profilingFinalize() local
354 RecursionGuard G(ReentranceGuard); in profilingLoggingInit() local
445 RecursionGuard G(ReentranceGuard); in profilingLoggingInit() local
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/
HDDeclGroup.h108 DeclGroup &G = getDeclGroup(); in end() local
121 const DeclGroup &G = getDeclGroup(); in end() local
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
HDAArch64A57FPLoadBalancing.cpp466 while (Chain *G = getAndEraseNext(PreferredColor, GV)) { in colorChainSet() local
496 int AArch64A57FPLoadBalancing::scavengeRegister(Chain *G, Color C, in scavengeRegister()
530 bool AArch64A57FPLoadBalancing::colorChain(Chain *G, Color C, in colorChain()
619 auto G = std::make_unique<Chain>(MI, Idx, getColor(DestReg)); in scanInstruction() local
664 auto G = std::make_unique<Chain>(MI, Idx, getColor(DestReg)); in scanInstruction() local
HDAArch64PBQPRegAlloc.cpp158 bool A57ChainingConstraint::addIntraChainConstraint(PBQPRAGraph &G, unsigned Rd, in addIntraChainConstraint()
242 void A57ChainingConstraint::addInterChainConstraint(PBQPRAGraph &G, unsigned Rd, in addInterChainConstraint()
326 void A57ChainingConstraint::apply(PBQPRAGraph &G) { in apply()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
HDCGSCCPassManager.cpp55 LazyCallGraph &G, CGSCCUpdateResult &UR) { in run()
322 LazyCallGraph &G, in updateNewSCCFunctionAnalyses()
366 incorporateNewSCCRange(const SCCRangeT &NewSCCRange, LazyCallGraph &G, in incorporateNewSCCRange()
427 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N, in updateCGAndAnalysisManagerForFunctionPass()
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
HDPBQPRAConstraint.h52 void apply(PBQPRAGraph &G) override { in apply()
/freebsd-11-stable/usr.bin/calendar/
HDostern.c50 int G, /* Golden number - 1 */ in easter() local

12345678