Home
last modified time | relevance | path

Searched refs:G (Results 1 – 25 of 1212) sorted by relevance

12345678910>>...49

/llvm-project-15.0.7/flang/module/
H A Dieee_arithmetic.f9099 G(1) G(2) G(4) G(8) G(16)
101 G(1) G(2) G(4) G(8)
103 G(2) G(3) G(4) G(8) G(10) G(16)
105 G(1,1) G(1,2) G(1,4) G(1,8) G(1,16) \
106 G(2,1) G(2,2) G(2,4) G(2,8) G(2,16) \
118 G(2,2) G(2,3) G(2,4) G(2,8) G(2,10) G(2,16) \
119 G(3,2) G(3,3) G(3,4) G(3,8) G(3,10) G(3,16) \
120 G(4,2) G(4,3) G(4,4) G(4,8) G(4,10) G(4,16) \
121 G(8,2) G(8,3) G(8,4) G(8,8) G(8,10) G(8,16) \
123 G(16,2) G(16,3) G(16,4) G(16,8) G(16,10) G(16,16)
[all …]
H A D__fortran_ieee_exceptions.f9045 G(1) G(2) G(4) G(8)
47 G(2) G(3) G(4) G(8) G(10) G(16)
52 G##_l1, G##_l2, G##_l4, G##_l8
54 G##_a2, G##_a3, G##_a4, G##_a8, G##_a10, G##_a16
/llvm-project-15.0.7/llvm/unittests/XRay/
H A DGraphTest.cpp53 return G; in getTestGraph()
194 EXPECT_EQ(G.vertices().begin(), G.vertices().end()); in TEST()
195 EXPECT_EQ(G.edges().begin(), G.edges().end()); in TEST()
215 EXPECT_NE(G.vertices().begin(), G.vertices().end()); in TEST()
216 EXPECT_EQ(G.edges().begin(), G.edges().end()); in TEST()
221 EXPECT_EQ(G.outEdges(0u).begin(), G.outEdges(0u).end()); in TEST()
224 EXPECT_EQ(G.inEdges(0u).begin(), G.inEdges(0u).end()); in TEST()
244 EXPECT_NE(G.edges().begin(), G.edges().end()); in TEST()
249 EXPECT_NE(G.outEdges(0u).begin(), G.outEdges(0u).end()); in TEST()
255 EXPECT_NE(G.inEdges(0u).begin(), G.inEdges(0u).end()); in TEST()
[all …]
/llvm-project-15.0.7/llvm/unittests/ExecutionEngine/JITLink/
H A DLinkGraphTests.cpp126 EXPECT_EQ(std::distance(G.blocks().begin(), G.blocks().end()), 4); in TEST()
135 std::distance(G.defined_symbols().begin(), G.defined_symbols().end()), 4); in TEST()
233 std::distance(G.defined_symbols().begin(), G.defined_symbols().end()), 1U) in TEST()
236 std::distance(G.external_symbols().begin(), G.external_symbols().end()), in TEST()
242 G.makeExternal(S1); in TEST()
251 std::distance(G.defined_symbols().begin(), G.defined_symbols().end()), 0U) in TEST()
254 std::distance(G.external_symbols().begin(), G.external_symbols().end()), in TEST()
279 std::distance(G.defined_symbols().begin(), G.defined_symbols().end()), 0U) in TEST()
282 std::distance(G.external_symbols().begin(), G.external_symbols().end()), in TEST()
298 std::distance(G.defined_symbols().begin(), G.defined_symbols().end()), 1U) in TEST()
[all …]
/llvm-project-15.0.7/clang/test/CXX/class/class.compare/class.compare.default/
H A Dp3.cpp168 bool operator==(const G&, const G&);
169 bool operator!=(const G&, const G&);
171 bool operator<(const G&, const G&);
172 bool operator<=(const G&, const G&);
173 bool operator>(const G&, const G&);
174 bool operator>=(const G&, const G&);
185 bool operator==(const G&, const G&);
186 bool operator!=(const G&, const G&);
189 bool operator<(const G&, const G&);
190 bool operator<=(const G&, const G&);
[all …]
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DBreadthFirstIteratorTest.cpp20 Graph<4> G; in TEST() local
21 G.AddEdge(0, 1); in TEST()
22 G.AddEdge(0, 2); in TEST()
23 G.AddEdge(1, 3); in TEST()
45 Graph<4> G; in TEST() local
46 G.AddEdge(0, 1); in TEST()
47 G.AddEdge(1, 0); in TEST()
48 G.AddEdge(1, 2); in TEST()
49 G.AddEdge(2, 1); in TEST()
50 G.AddEdge(2, 1); in TEST()
[all …]
H A DCombinationGeneratorTest.cpp32 const size_t NumVariants = G.numCombinations(); in TEST()
33 G.generate([&](ArrayRef<int> State) -> bool { in TEST()
53 const size_t NumVariants = G.numCombinations(); in TEST()
54 G.generate([&](ArrayRef<int> State) -> bool { in TEST()
72 const size_t NumVariants = G.numCombinations(); in TEST()
73 G.generate([&](ArrayRef<int> State) -> bool { in TEST()
94 G.generate([&](ArrayRef<int> State) -> bool { in TEST()
113 G.generate([&](ArrayRef<int> State) -> bool { in TEST()
132 G.generate([&](ArrayRef<int> State) -> bool { in TEST()
151 G.generate([&](ArrayRef<int> State) -> bool { in TEST()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h37 assert(G.getNodeDegree(NId) == 1 && in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
48 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
69 G.setNodeCosts(MId, YCosts); in applyR1()
70 G.disconnectEdge(EId, MId); in applyR1()
81 assert(G.getNodeDegree(NId) == 2 && in applyR2()
98 &G.getEdgeCosts(YXEId); in applyR2()
102 &G.getEdgeCosts(ZXEId); in applyR2()
131 if (YZEId == G.invalidEdgeId()) { in applyR2()
142 G.disconnectEdge(YXEId, YNId); in applyR2()
[all …]
/llvm-project-15.0.7/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.constr/
H A DF.pass.cpp59 class G class
67 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G
87 int G::n_alive = 0;
88 bool G::op_run = false;
166 assert(!G::op_run); in main()
168 G g; in main()
173 assert(G::op_run); in main()
175 G::op_run = false; in main()
200 assert(!G::op_run); in main()
202 G g; in main()
[all …]
H A Dmove.pass.cpp25 class G class
33 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G
44 int G::n_alive = 0;
45 bool G::op_run = false;
49 assert(G::n_alive == 0); in main()
50 assert(!G::op_run); in main()
52 G g; in main()
54 assert(!G::op_run); in main()
65 assert(G::op_run); in main()
67 assert(G::n_alive == 0); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.assign/
H A Dmove.pass.cpp24 class G class
32 G(const G& g) : alive_(g.alive_) {++n_alive;} in G() function in G
43 int G::n_alive = 0;
44 bool G::op_run = false;
48 assert(G::n_alive == 0); in main()
49 assert(!G::op_run); in main()
51 G g; in main()
53 assert(!G::op_run); in main()
65 assert(G::op_run); in main()
67 assert(G::n_alive == 0); in main()
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/
H A DLRGraph.cpp43 SortByNextSymbol(const Grammar &G) : G(G) {} in SortByNextSymbol()
45 if (L.hasNext() && R.hasNext() && L.next(G) != R.next(G)) in operator ()()
46 return L.next(G) < R.next(G); in operator ()()
51 const Grammar &G; member
79 Item NewItem = Item::start(RID, G); in closure()
85 llvm::sort(Queue, SortByNextSymbol(G)); in closure()
140 const auto &Rule = G.lookupRule(RID); in dump()
180 Builder(const Grammar &G) : G(G) {} in buildLR0() argument
229 const Grammar &G; in buildLR0() member in clang::pseudo::LRGraph::buildLR0::Builder
231 } Builder(G); in buildLR0()
[all …]
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dpseudo-destructors.cpp128 using G = Y; typedef
130 void h1(Y *p) { p->~G(); } in h1()
132 namespace N { struct G{}; } struct
133 void h3(N::G *p) { p->~G(); } in h3()
140 using G = Y; typedef
141 void h1(Y *p) { p->~G(); } in h1()
143 namespace N { struct G{}; } struct
144 void h3(N::G *p) { p->~G(); } in h3()
145 void h4(N::G *p) { f(p); } in h4()
155 void h3(N::G<int> *p) { p->~G<int>(); } in h3()
[all …]
/llvm-project-15.0.7/llvm/lib/ExecutionEngine/JITLink/
H A DJITLinkGeneric.cpp37 G->dump(dbgs()); in linkPhase1()
40 prune(*G); in linkPhase1()
44 G->dump(dbgs()); in linkPhase1()
52 Ctx->getJITLinkDylib(), *G, in linkPhase1()
70 G->dump(dbgs()); in linkPhase2()
140 G->dump(dbgs()); in linkPhase3()
148 G->dump(dbgs()); in linkPhase3()
157 G->dump(dbgs()); in linkPhase3()
186 if (auto Err = P(*G)) in runPasses()
240 void prune(LinkGraph &G) { in prune() argument
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DPostOrderIterator.h185 po_iterator<T> po_begin(const T &G) { return po_iterator<T>::begin(G); } in po_begin() argument
187 po_iterator<T> po_end (const T &G) { return po_iterator<T>::end(G); } in po_end() argument
190 return make_range(po_begin(G), po_end(G)); in post_order()
212 return make_range(po_ext_begin(G, S), po_ext_end(G, S)); in post_order_ext()
225 return ipo_iterator<T>::begin(G); in ipo_begin()
229 ipo_iterator<T> ipo_end(const T &G){ in ipo_end() argument
230 return ipo_iterator<T>::end(G); in ipo_end()
235 return make_range(ipo_begin(G), ipo_end(G)); in inverse_post_order()
260 return make_range(ipo_ext_begin(G, S), ipo_ext_end(G, S)); in inverse_post_order_ext()
297 std::copy(po_begin(G), po_end(G), std::back_inserter(Blocks)); in Initialize()
[all …]
H A DGraphTraits.h100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse()
110 nodes(const GraphType &G) {
111 return make_range(GraphTraits<GraphType>::nodes_begin(G),
112 GraphTraits<GraphType>::nodes_end(G));
116 inverse_nodes(const GraphType &G) {
118 GraphTraits<Inverse<GraphType>>::nodes_end(G));
123 children(const typename GraphTraits<GraphType>::NodeRef &G) {
124 return make_range(GraphTraits<GraphType>::child_begin(G),
125 GraphTraits<GraphType>::child_end(G));
138 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
H A DDepthFirstIterator.h154 return df_iterator(GT::getEntryNode(G)); in begin()
219 df_iterator<T> df_begin(const T& G) { in df_begin() argument
220 return df_iterator<T>::begin(G); in df_begin()
224 df_iterator<T> df_end(const T& G) { in df_end() argument
225 return df_iterator<T>::end(G); in df_end()
231 return make_range(df_begin(G), df_end(G)); in depth_first()
254 return make_range(df_ext_begin(G, S), df_ext_end(G, S)); in depth_first_ext()
268 idf_iterator<T> idf_begin(const T& G) { in idf_begin() argument
273 idf_iterator<T> idf_end(const T& G){ in idf_end() argument
280 return make_range(idf_begin(G), idf_end(G)); in inverse_depth_first()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ExecutionEngine/JITLink/
H A Dx86_64.h406 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
414 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
430 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
445 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
534 return G.addAnonymousSymbol( in createAnonymousPointerJumpStub()
550 getGOTSection(G); in visitEdge()
584 return createAnonymousPointer(G, getGOTSection(G), &Target); in createEntry()
588 Section &getGOTSection(LinkGraph &G) { in getGOTSection() argument
621 return createAnonymousPointerJumpStub(G, getStubsSection(G), in createEntry()
626 Section &getStubsSection(LinkGraph &G) { in getStubsSection() argument
[all …]
/llvm-project-15.0.7/libc/utils/HdrGen/
H A DPublicAPICommand.cpp50 void writeAPIFromIndex(APIIndexer &G, in writeAPIFromIndex() argument
53 for (auto &Pair : G.MacroDefsMap) { in writeAPIFromIndex()
55 if (G.MacroSpecMap.find(Name) == G.MacroSpecMap.end()) in writeAPIFromIndex()
65 if (G.TypeSpecMap.find(TypeName) == G.TypeSpecMap.end()) in writeAPIFromIndex()
71 if (G.Enumerations.size() != 0) in writeAPIFromIndex()
74 if (G.EnumerationSpecMap.find(Name) == G.EnumerationSpecMap.end()) in writeAPIFromIndex()
87 if (G.Enumerations.size() != 0) in writeAPIFromIndex()
92 if (G.FunctionSpecMap.find(Name) == G.FunctionSpecMap.end()) { in writeAPIFromIndex()
110 OS << G.getTypeAsString(ArgType); in writeAPIFromIndex()
120 if (G.ObjectSpecMap.find(Name) == G.ObjectSpecMap.end()) in writeAPIFromIndex()
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DSHA256.cpp75 uint32_t G = InternalState.State[6]; in hashBlock() local
95 F_EXPAND(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98); in hashBlock()
96 F_EXPAND(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x71374491); in hashBlock()
97 F_EXPAND(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCF); in hashBlock()
98 F_EXPAND(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA5); in hashBlock()
99 F_EXPAND(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25B); in hashBlock()
100 F_EXPAND(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1); in hashBlock()
101 F_EXPAND(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4); in hashBlock()
102 F_EXPAND(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5); in hashBlock()
103 F_EXPAND(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98); in hashBlock()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h290 RegAllocSolverImpl(Graph &G) : G(G) {} in RegAllocSolverImpl() argument
293 G.setSolver(*this); in solve()
297 G.unsetSolver(); in solve()
304 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
445 applyR1(G, NId); in reduce()
448 applyR2(G, NId); in reduce()
482 SpillCostComparator(const Graph& G) : G(G) {} in SpillCostComparator() argument
488 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id); in operator()
493 const Graph& G;
496 Graph& G; variable
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp189 F = G; in replaceBy()
699 NewG = Function::Create(G->getFunctionType(), G->getLinkage(), in writeThunk()
700 G->getAddressSpace(), "", G->getParent()); in writeThunk()
743 eraseTail(G); in writeThunk()
751 removeUsers(G); in writeThunk()
779 GA->takeName(G); in writeAlias()
783 removeUsers(G); in writeAlias()
795 writeAlias(F, G); in writeThunkOrAlias()
799 writeThunk(F, G); in writeThunkOrAlias()
841 if (G->hasGlobalUnnamedAddr() && !Used.contains(G)) { in mergeTwoFunctions()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/GuardWidening/
H A Dbasic-loop.ll6 @G = external global i32
28 store i32 0, i32* @G
30 store i32 1, i32* @G
32 store i32 2, i32* @G
34 store i32 3, i32* @G
53 store i32 0, i32* @G
58 store i32 1, i32* @G
60 store i32 2, i32* @G
62 store i32 3, i32* @G
87 store i32 0, i32* @G
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/unittests/
H A DGrammarTest.cpp33 G = Grammar::parseBNF(BNF, Diags); in build()
38 if (G.table().Terminals[I] == Name) in id()
58 Grammar G; member in clang::pseudo::__anon8e70fb3b0111::GrammarTest
68 EXPECT_EQ(G.symbolName(id("_")), "_"); in TEST_F()
70 const auto &Rule = G.lookupRule(/*RID=*/0); in TEST_F()
80 EXPECT_THAT(G.table().Rules, in TEST_F()
142 EXPECT_EQ(G.underscore(), id("_")); in TEST_F()
172 ToPairs(firstSets(G)), in TEST_F()
178 ToPairs(followSets(G)), in TEST_F()
195 ToPairs(firstSets(G)), in TEST_F()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp192 void apply(PBQPRAGraph &G) override { in apply() argument
199 for (auto NId : G.nodeIds()) { in apply()
304 void apply(PBQPRAGraph &G) override { in apply() argument
332 for (auto NId : G.nodeIds()) { in apply()
429 C[K] = G.getEdgeCostsPtr(EId); in createInterferenceEdge()
437 void apply(PBQPRAGraph &G) override { in apply() argument
482 if (EId == G.invalidEdgeId()) { in apply()
683 G.getNodeMetadata(NId).setVReg(VReg); in initializeGraph()
733 for (auto NId : G.nodeIds()) { in mapPBQPToRegAlloc()
854 ConstraintsRoot->apply(G); in runOnMachineFunction()
[all …]

12345678910>>...49