Home
last modified time | relevance | path

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

12345678910>>...55

/freebsd/sys/dev/ath/ath_rate/sample/
H A Dtx_schedules.h124 { 3,G( 1), 3,G( 1), 0,G( 1), 0,G( 1) }, /* 1Mb/s */
125 { 4,G( 2), 3,G( 1), 4,G( 1), 0,G( 1) }, /* 2Mb/s */
126 { 4,G(5.5),3,G( 2), 4,G( 1), 2,G( 1) }, /* 5.5Mb/s */
127 { 4,G(11), 3,G(5.5), 4,G( 2), 2,G( 1) }, /* 11Mb/s */
128 { 4,G( 6), 3,G(5.5), 4,G( 2), 2,G( 1) }, /* 6Mb/s */
129 { 4,G( 9), 3,G( 6), 4,G(5.5), 2,G( 1) }, /* 9Mb/s */
130 { 4,G(12), 3,G( 11), 4,G(5.5), 2,G( 1) }, /* 12Mb/s */
131 { 4,G(18), 3,G( 12), 4,G( 11), 2,G( 1) }, /* 18Mb/s */
132 { 4,G(24), 3,G( 18), 4,G( 12), 2,G( 1) }, /* 24Mb/s */
133 { 4,G(36), 3,G( 24), 4,G( 18), 2,G( 1) }, /* 36Mb/s */
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64GlobalsTagging.cpp30 if (!G.isTagged()) in shouldTagGlobal()
40 if (G.getName().starts_with("llvm.") || G.isThreadLocal() || G.isConstant()) { in shouldTagGlobal()
64 if (G.hasSection()) { in shouldTagGlobal()
104 M, Initializer->getType(), G->isConstant(), G->getLinkage(), in tagGlobalDefinition()
105 Initializer, "", G, G->getThreadLocalMode(), G->getAddressSpace()); in tagGlobalDefinition()
108 NewGV->copyMetadata(G, 0); in tagGlobalDefinition()
110 NewGV->takeName(G); in tagGlobalDefinition()
112 G->eraseFromParent(); in tagGlobalDefinition()
113 G = NewGV; in tagGlobalDefinition()
116 G->setAlignment(std::max(G->getAlign().valueOrOne(), kTagGranuleSize)); in tagGlobalDefinition()
[all …]
/freebsd/contrib/netbsd-tests/bin/df/
H A Dt_df.sh97 filer:/ 1.1T 229G 918G 20% /filer
98 filer:/ 1.1T 688G 459G 60% /filer
102 filer:/ 1.1T 229G 860G 21% /filer
103 filer:/ 1.1T 688G 401G 63% /filer
107 filer:/ 1.1T 229G 803G 22% /filer
108 filer:/ 1.1T 688G 344G 66% /filer
112 filer:/ 1.1T 229G 746G 23% /filer
113 filer:/ 1.1T 688G 287G 70% /filer
118 /dev/ld0g 1.2T 250G 998G 20% /anon-root
119 /dev/ld0g 1.2T 749G 499G 60% /anon-root
[all …]
/freebsd/contrib/llvm-project/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 …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A Dloongarch.h189 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
197 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
213 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
220 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
263 G.getPointerSize()}; in getGOTEntryBlockContent()
294 auto &B = G.createContentBlock(PointerSection, getGOTEntryBlockContent(G),
299 return G.addAnonymousSymbol(B, 0, G.getPointerSize(), false, false);
344 return createAnonymousPointer(G, getGOTSection(G), &Target); in createEntry()
348 Section &getGOTSection(LinkGraph &G) { in getGOTSection() argument
379 return createAnonymousPointerJumpStub(G, getStubsSection(G), in createEntry()
[all …]
H A Di386.h229 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
239 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
333 return G.addAnonymousSymbol( in createAnonymousPointerJumpStub()
343 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge() argument
349 getGOTSection(G); in visitEdge()
371 return createAnonymousPointer(G, getGOTSection(G), &Target); in createEntry()
375 Section &getGOTSection(LinkGraph &G) { in getGOTSection() argument
391 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge() argument
408 return createAnonymousPointerJumpStub(G, getStubsSection(G), in createEntry()
413 Section &getStubsSection(LinkGraph &G) { in getStubsSection() argument
[all …]
H A Dx86_64.h415 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
423 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
432 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
441 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
561 return G.addAnonymousSymbol( in createAnonymousPointerJumpStub()
577 getGOTSection(G); in visitEdge()
611 return createAnonymousPointer(G, getGOTSection(G), &Target); in createEntry()
615 Section &getGOTSection(LinkGraph &G) { in getGOTSection() argument
648 return createAnonymousPointerJumpStub(G, getStubsSection(G), in createEntry()
653 Section &getStubsSection(LinkGraph &G) { in getStubsSection() argument
[all …]
H A Daarch64.h437 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
471 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
505 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
518 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
537 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
555 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
662 return G.addAnonymousSymbol( in createAnonymousPointerJumpStub()
714 return createAnonymousPointer(G, getGOTSection(G), &Target); in createEntry()
718 Section &getGOTSection(LinkGraph &G) { in getGOTSection() argument
749 return createAnonymousPointerJumpStub(G, getStubsSection(G), in createEntry()
[all …]
H A Dppc64.h141 return G.addAnonymousSymbol(B, 0, G.getPointerSize(), false, false);
173 getOrCreateTOCSection(G); in visitEdge()
177 E.setTarget(createEntry(G, E.getTarget())); in visitEdge()
185 return createAnonymousPointer(G, getOrCreateTOCSection(G), &Target); in createEntry()
189 Section &getOrCreateTOCSection(LinkGraph &G) { in getOrCreateTOCSection() argument
242 G, getOrCreateStubsSection(G), TOC.getEntryForTarget(G, Target), in createEntry()
387 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
408 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
417 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
432 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DELF_ppc64.cpp67 getTLSInfoSection(G), G.allocateContent(getTLSInfoEntryContent()), in createEntry()
74 Section &getTLSInfoSection(LinkGraph &G) { in getTLSInfoSection() argument
104 Symbol &createELFGOTHeader(LinkGraph &G, in createELFGOTHeader() argument
108 for (Symbol *Sym : G.defined_symbols()) in createELFGOTHeader()
131 registerExistingGOTEntries(LinkGraph &G, in registerExistingGOTEntries() argument
148 Error buildTables_ELF_ppc64(LinkGraph &G) { in buildTables_ELF_ppc64() argument
156 createELFGOTHeader(G, TOC); in buildTables_ELF_ppc64()
159 registerExistingGOTEntries(G, TOC); in buildTables_ELF_ppc64()
163 visitExistingEdges(G, TOC, PLT, TLSInfo); in buildTables_ELF_ppc64()
412 [this](LinkGraph &G) { return defineTOCBase(G); }); in ELFJITLinker_ppc64() argument
[all …]
H A DJITLinkGeneric.cpp37 G->dump(dbgs()); in linkPhase1()
40 prune(*G); in linkPhase1()
44 G->dump(dbgs()); in linkPhase1()
52 if (G->allocActions().empty() && llvm::all_of(G->sections(), [](Section &S) { in linkPhase1()
81 G->dump(dbgs()); in linkPhase2()
151 G->dump(dbgs()); in linkPhase3()
159 G->dump(dbgs()); in linkPhase3()
168 G->dump(dbgs()); in linkPhase3()
206 if (auto Err = P(*G)) in runPasses()
280 void prune(LinkGraph &G) { in prune() argument
[all …]
H A DELF_x86_64.cpp42 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge() argument
57 Symbol &createEntry(LinkGraph &G, Symbol &Target) { in createEntry() argument
60 auto &TLSInfoEntry = G.createMutableContentBlock( in createEntry()
61 getTLSInfoSection(G), G.allocateContent(getTLSInfoEntryContent()), in createEntry()
68 Section &getTLSInfoSection(LinkGraph &G) { in getTLSInfoSection() argument
88 Error buildTables_ELF_x86_64(LinkGraph &G) { in buildTables_ELF_x86_64() argument
94 visitExistingEdges(G, GOT, PLT, TLSInfo); in buildTables_ELF_x86_64()
247 [this](LinkGraph &G) { return getOrCreateGOTSymbol(G); }); in ELFJITLinker_x86_64() argument
253 Error getOrCreateGOTSymbol(LinkGraph &G) { in getOrCreateGOTSymbol() argument
304 for (auto *Sym : G.external_symbols()) { in getOrCreateGOTSymbol()
[all …]
H A Daarch32.cpp244 G.getEdgeKindName(Kind))); in makeUnexpectedOpcodeError()
392 endianness Endian = G.getEndianness(); in readAddendData()
407 G.getEdgeKindName(Kind)); in readAddendData()
414 if (Error Err = checkOpcode(G, R, Kind)) in readAddendArm()
430 G.getEdgeKindName(Kind)); in readAddendArm()
461 G.getEdgeKindName(Kind)); in readAddendThumb()
519 G.getEdgeKindName(E.getKind())); in applyFixupData()
593 G.getEdgeKindName(E.getKind())); in applyFixupArm()
692 G.getEdgeKindName(E.getKind())); in applyFixupThumb()
776 Block &B = allocStub(G, S, Thumbv7ABS); in createStubThumbv7()
[all …]
/freebsd/crypto/openssl/crypto/sm3/
H A Dsm3.c24 c->G = SM3_G; in ossl_sm3_init()
32 register unsigned MD32_REG_T A, B, C, D, E, F, G, H; in ossl_sm3_block_data_order() local
45 G = ctx->G; in ossl_sm3_block_data_order()
69 R1(A, B, C, D, E, F, G, H, 0x79CC4519, W00, W00 ^ W04); in ossl_sm3_block_data_order()
71 R1(D, A, B, C, H, E, F, G, 0xF3988A32, W01, W01 ^ W05); in ossl_sm3_block_data_order()
73 R1(C, D, A, B, G, H, E, F, 0xE7311465, W02, W02 ^ W06); in ossl_sm3_block_data_order()
75 R1(B, C, D, A, F, G, H, E, 0xCE6228CB, W03, W03 ^ W07); in ossl_sm3_block_data_order()
77 R1(A, B, C, D, E, F, G, H, 0x9CC45197, W04, W04 ^ W08); in ossl_sm3_block_data_order()
79 R1(D, A, B, C, H, E, F, G, 0x3988A32F, W05, W05 ^ W09); in ossl_sm3_block_data_order()
81 R1(C, D, A, B, G, H, E, F, 0x7311465E, W06, W06 ^ W10); in ossl_sm3_block_data_order()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DPostOrderIterator.h189 po_iterator<T> po_begin(const T &G) { return po_iterator<T>::begin(G); } in po_begin() argument
191 po_iterator<T> po_end (const T &G) { return po_iterator<T>::end(G); } in po_end() argument
194 return make_range(po_begin(G), po_end(G)); in post_order()
216 return make_range(po_ext_begin(G, S), po_ext_end(G, S)); in post_order_ext()
229 return ipo_iterator<T>::begin(G); in ipo_begin()
233 ipo_iterator<T> ipo_end(const T &G){ in ipo_end() argument
234 return ipo_iterator<T>::end(G); in ipo_end()
239 return make_range(ipo_begin(G), ipo_end(G)); in inverse_post_order()
264 return make_range(ipo_ext_begin(G, S), ipo_ext_end(G, S)); in inverse_post_order_ext()
302 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.h153 return df_iterator(GT::getEntryNode(G)); in begin()
218 df_iterator<T> df_begin(const T& G) { in df_begin() argument
219 return df_iterator<T>::begin(G); in df_begin()
223 df_iterator<T> df_end(const T& G) { in df_end() argument
224 return df_iterator<T>::end(G); in df_end()
230 return make_range(df_begin(G), df_end(G)); in depth_first()
253 return make_range(df_ext_begin(G, S), df_ext_end(G, S)); in depth_first_ext()
267 idf_iterator<T> idf_begin(const T& G) { in idf_begin() argument
272 idf_iterator<T> idf_end(const T& G){ in idf_end() argument
279 return make_range(idf_begin(G), idf_end(G)); in inverse_depth_first()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSHA256.cpp71 uint32_t G = InternalState.State[6]; in hashBlock() local
91 F_EXPAND(A, B, C, D, E, F, G, H, W00, W14, W09, W01, 0x428A2F98); in hashBlock()
92 F_EXPAND(H, A, B, C, D, E, F, G, W01, W15, W10, W02, 0x71374491); in hashBlock()
93 F_EXPAND(G, H, A, B, C, D, E, F, W02, W00, W11, W03, 0xB5C0FBCF); in hashBlock()
94 F_EXPAND(F, G, H, A, B, C, D, E, W03, W01, W12, W04, 0xE9B5DBA5); in hashBlock()
95 F_EXPAND(E, F, G, H, A, B, C, D, W04, W02, W13, W05, 0x3956C25B); in hashBlock()
96 F_EXPAND(D, E, F, G, H, A, B, C, W05, W03, W14, W06, 0x59F111F1); in hashBlock()
97 F_EXPAND(C, D, E, F, G, H, A, B, W06, W04, W15, W07, 0x923F82A4); in hashBlock()
98 F_EXPAND(B, C, D, E, F, G, H, A, W07, W05, W00, W08, 0xAB1C5ED5); in hashBlock()
99 F_EXPAND(A, B, C, D, E, F, G, H, W08, W06, W01, W09, 0xD807AA98); in hashBlock()
[all …]
H A DDynamicLibrary.cpp133 static Globals G; in getGlobals() local
134 return G; in getGlobals()
160 auto &G = getGlobals(); in AddSymbol() local
161 SmartScopedLock<true> Lock(G.SymbolsMutex); in AddSymbol()
167 auto &G = getGlobals(); in getPermanentLibrary() local
179 auto &G = getGlobals(); in addPermanentLibrary() local
180 SmartScopedLock<true> Lock(G.SymbolsMutex); in addPermanentLibrary()
194 auto &G = getGlobals(); in getLibrary() local
204 auto &G = getGlobals(); in closeLibrary() local
220 auto &G = getGlobals(); in SearchForAddressOfSymbol() local
[all …]
/freebsd/contrib/llvm-project/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 …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp187 F = G; in replaceBy()
698 NewG = Function::Create(G->getFunctionType(), G->getLinkage(), in writeThunk()
699 G->getAddressSpace(), "", G->getParent()); in writeThunk()
742 eraseTail(G); in writeThunk()
753 removeUsers(G); in writeThunk()
785 GA->takeName(G); in writeAlias()
789 removeUsers(G); in writeAlias()
801 writeAlias(F, G); in writeThunkOrAlias()
805 writeThunk(F, G); in writeThunkOrAlias()
856 if (G->hasGlobalUnnamedAddr() && !Used.contains(G)) { in mergeTwoFunctions()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DMachOPlatform.cpp164 G->allocActions().push_back( in materialize()
760 [this](LinkGraph &G) { return bootstrapPipelineStart(G); }); in modifyPassConfig() argument
788 [this](LinkGraph &G) { return createObjCRuntimeObject(G); }); in modifyPassConfig() argument
790 [this, &MR](LinkGraph &G) { return populateObjCRuntimeObject(G, MR); }); in modifyPassConfig() argument
824 [this](LinkGraph &G) { return bootstrapPipelineEnd(G); }); in modifyPassConfig() argument
842 jitlink::LinkGraph &G) { in bootstrapPipelineStart() argument
903 jitlink::LinkGraph &G) { in bootstrapPipelineEnd() argument
928 G.allocActions().push_back( in associateJITDylibHeaderSymbol()
1192 for (auto *B : G.blocks()) in fixTLVSectionsAndEdges()
1204 jitlink::LinkGraph &G) { in findUnwindSectionInfo() argument
[all …]
/freebsd/contrib/llvm-project/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 …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h112 const ImmutableGraph &G; variable
117 : G{G}, V{static_cast<unsigned>(G.nodes_size()), ContainsAll} {}
140 assert(&this->G == &RHS.G);
146 assert(&this->G == &RHS.G);
152 assert(&this->G == &RHS.G);
205 : G{G}, V{static_cast<unsigned>(G.edges_size()), ContainsAll} {}
228 assert(&this->G == &RHS.G);
234 assert(&this->G == &RHS.G);
240 assert(&this->G == &RHS.G);
414 static NodeRef getEntryNode(GraphT *G) { return G->nodes_begin(); }
[all …]
/freebsd/contrib/bearssl/src/hash/
H A Dsha2small.c144 uint32_t A, B, C, D, E, F, G, H; in br_sha2small_round()
154 G = val[6]; in br_sha2small_round()
157 SHA2_STEP1(A, B, C, D, E, F, G, H, 0); in br_sha2small_round()
158 SHA2_STEP1(H, A, B, C, D, E, F, G, 1); in br_sha2small_round()
159 SHA2_STEP1(G, H, A, B, C, D, E, F, 2); in br_sha2small_round()
160 SHA2_STEP1(F, G, H, A, B, C, D, E, 3); in br_sha2small_round()
161 SHA2_STEP1(E, F, G, H, A, B, C, D, 4); in br_sha2small_round()
162 SHA2_STEP1(D, E, F, G, H, A, B, C, 5); in br_sha2small_round()
163 SHA2_STEP1(C, D, E, F, G, H, A, B, 6); in br_sha2small_round()
164 SHA2_STEP1(B, C, D, E, F, G, H, A, 7); in br_sha2small_round()
[all …]

12345678910>>...55