Home
last modified time | relevance | path

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

12345678910>>...59

/freebsd/sys/dev/ath/ath_rate/sample/
H A Dtx_schedules.h118 #define G(_r) \ macro
124 { 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 */
[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
99 filer:/ 1.1T 1.1T 57G 95% /filer
102 filer:/ 1.1T 229G 860G 21% /filer
103 filer:/ 1.1T 688G 401G 63% /filer
105 filer:/ 1.1T 1.1T -57G 105% /filer
107 filer:/ 1.1T 229G 803G 22% /filer
108 filer:/ 1.1T 688G 344G 66% /filer
109 filer:/ 1.1T 1.1T -57G 105% /filer
110 filer:/ 1.1T 1.1T -115G 111% /filer
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
37 assert(G.getNodeDegree(NId) == 1 && in applyR1()
40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
43 const Matrix &ECosts = G.getEdgeCosts(EId); in applyR1()
44 const Vector &XCosts = G.getNodeCosts(NId); 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()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A Dx86_64.h439 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup() argument
460 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
468 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
477 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
486 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
502 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
517 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
526 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
535 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
550 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
[all …]
H A Dx86.h184 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup() argument
210 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
219 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
247 "In graph " + G.getName() + ", section " + B.getSection().getName() + in applyFixup()
277 inline Symbol &createAnonymousPointer(LinkGraph &G, Section &PointerSection,
280 auto &B = G.createContentBlock(PointerSection, NullPointerContent,
284 return G.addAnonymousSymbol(B, 0, PointerSize, false, false);
293 inline Block &createPointerJumpStubBlock(LinkGraph &G, Section &StubSection, in createPointerJumpStubBlock() argument
295 auto &B = G.createContentBlock(StubSection, PointerJumpStubContent, in createPointerJumpStubBlock()
309 inline Symbol &createAnonymousPointerJumpStub(LinkGraph &G, in createAnonymousPointerJumpStub() argument
[all …]
H A Daarch64.h496 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup() argument
513 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
530 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
547 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
580 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
592 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
611 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
629 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
644 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
690 "In graph " + G.getName() + ", section " + B.getSection().getName() + in applyFixup()
[all …]
H A Dloongarch.h334 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E) { in applyFixup() argument
350 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
358 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
373 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
389 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
405 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
412 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
427 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
446 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
558 "In graph " + G.getName() + ", section " + B.getSection().getName() + in applyFixup()
[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/lib/ExecutionEngine/JITLink/
H A DELF_ppc64.cpp43 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge() argument
48 E.setTarget(this->getEntryForTarget(G, E.getTarget())); in visitEdge()
52 E.setTarget(this->getEntryForTarget(G, E.getTarget())); in visitEdge()
56 E.setTarget(this->getEntryForTarget(G, E.getTarget())); in visitEdge()
63 Symbol &createEntry(LinkGraph &G, Symbol &Target) { in createEntry() argument
66 auto &TLSInfoEntry = G.createMutableContentBlock( in createEntry()
67 getTLSInfoSection(G), G.allocateContent(getTLSInfoEntryContent()), in createEntry()
70 return G.addAnonymousSymbol(TLSInfoEntry, 0, 16, false, false); in createEntry()
74 Section &getTLSInfoSection(LinkGraph &G) { in getTLSInfoSection() argument
77 &G.createSection(ELFTLSInfoSectionName, orc::MemProt::Read); in getTLSInfoSection()
[all …]
H A DJITLinkGeneric.cpp25 dbgs() << "Starting link phase 1 for graph " << G->getName() << "\n"; in linkPhase1()
33 dbgs() << "Link graph \"" << G->getName() << "\" pre-pruning:\n"; in linkPhase1()
34 G->dump(dbgs()); in linkPhase1()
37 prune(*G); in linkPhase1()
40 dbgs() << "Link graph \"" << G->getName() << "\" post-pruning:\n"; in linkPhase1()
41 G->dump(dbgs()); in linkPhase1()
49 if (G->allocActions().empty() && llvm::all_of(G->sections(), [](Section &S) { in linkPhase1()
57 Ctx->getJITLinkDylib(), *G, in linkPhase1()
76 dbgs() << "Link graph \"" << G->getName() in linkPhase2()
78 G->dump(dbgs()); in linkPhase2()
[all …]
H A DCompactUnwindSupport.h29 Error splitCompactUnwindBlocks(LinkGraph &G, Section &CompactUnwindSection,
91 Error prepareForPrune(LinkGraph &G) { in prepareForPrune() argument
92 Section *CUSec = G.findSectionByName(CompactUnwindSectionName); in prepareForPrune()
95 dbgs() << "Compact unwind: No compact unwind info for " << G.getName() in prepareForPrune()
102 dbgs() << "Compact unwind: preparing " << G.getName() << " for prune\n"; in prepareForPrune()
105 Section *EHFrameSec = G.findSectionByName(EHFrameSectionName); in prepareForPrune()
107 if (auto Err = splitCompactUnwindBlocks(G, *CUSec, CURecTraits::Size)) in prepareForPrune()
126 "In " + G.getName() + ", compact unwind record at " + in prepareForPrune()
131 "In " + G.getName() + ", compact unwind record at " + in prepareForPrune()
139 dbgs() << "In " << CompactUnwindSectionName << " for " << G.getName() in prepareForPrune()
[all …]
H A DELF_x86_64.cpp42 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in visitEdge() argument
45 dbgs() << " Fixing " << G.getEdgeKindName(E.getKind()) << " edge at " in visitEdge()
51 E.setTarget(getEntryForTarget(G, E.getTarget())); in visitEdge()
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()
64 return G.addAnonymousSymbol(TLSInfoEntry, 0, 16, false, false); in createEntry()
68 Section &getTLSInfoSection(LinkGraph &G) { in getTLSInfoSection() argument
71 &G.createSection(ELFTLSInfoSectionName, orc::MemProt::Read); in getTLSInfoSection()
88 Error buildTables_ELF_x86_64(LinkGraph &G) { in buildTables_ELF_x86_64() argument
[all …]
H A DMachO.cpp75 void link_MachO(std::unique_ptr<LinkGraph> G, in link_MachO() argument
78 switch (G->getTargetTriple().getArch()) { in link_MachO()
80 return link_MachO_arm64(std::move(G), std::move(Ctx)); in link_MachO()
82 return link_MachO_x86_64(std::move(G), std::move(Ctx)); in link_MachO()
90 static Expected<Block &> createLocalHeaderBlock(LinkGraph &G, Section &Sec) { in createLocalHeaderBlock() argument
91 auto &B = G.createMutableContentBlock(Sec, sizeof(MachOHeaderType), in createLocalHeaderBlock()
94 Hdr.magic = G.getPointerSize() == 4 ? MachO::MH_MAGIC : MachO::MH_MAGIC_64; in createLocalHeaderBlock()
95 if (auto CPUType = MachO::getCPUType(G.getTargetTriple())) in createLocalHeaderBlock()
99 if (auto CPUSubType = MachO::getCPUSubType(G.getTargetTriple())) in createLocalHeaderBlock()
105 if (G.getEndianness() != endianness::native) in createLocalHeaderBlock()
[all …]
H A Daarch32.cpp238 Error makeUnexpectedOpcodeError(const LinkGraph &G, const ThumbRelocation &R, in makeUnexpectedOpcodeError() argument
242 R.Hi.value(), R.Lo.value(), G.getEdgeKindName(Kind))); in makeUnexpectedOpcodeError()
245 Error makeUnexpectedOpcodeError(const LinkGraph &G, const ArmRelocation &R, in makeUnexpectedOpcodeError() argument
249 G.getEdgeKindName(Kind))); in makeUnexpectedOpcodeError()
313 static Error checkOpcode(LinkGraph &G, const ArmRelocation &R, in checkOpcode() argument
321 return makeUnexpectedOpcodeError(G, R, Kind); in checkOpcode()
326 static Error checkOpcode(LinkGraph &G, const ThumbRelocation &R, in checkOpcode() argument
334 return makeUnexpectedOpcodeError(G, R, Kind); in checkOpcode()
388 Expected<int64_t> readAddendData(LinkGraph &G, Block &B, Edge::OffsetT Offset, in readAddendData() argument
390 endianness Endian = G.getEndianness(); in readAddendData()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DPostOrderIterator.h152 static po_iterator begin(const GraphT &G) { in begin() argument
153 return po_iterator(GT::getEntryNode(G)); in begin()
155 static po_iterator end(const GraphT &G) { return po_iterator(); } in end() argument
157 static po_iterator begin(const GraphT &G, SetType &S) { in begin() argument
158 return po_iterator(GT::getEntryNode(G), S); in begin()
160 static po_iterator end(const GraphT &G, SetType &S) { return po_iterator(S); } in end() argument
193 po_iterator<T> po_begin(const T &G) { return po_iterator<T>::begin(G); } in po_begin() argument
195 po_iterator<T> po_end (const T &G) { return po_iterator<T>::end(G); } in po_end() argument
197 template <class T> iterator_range<po_iterator<T>> post_order(const T &G) { in post_order() argument
198 return make_range(po_begin(G), po_end(G)); in post_order()
[all …]
H A DGraphTraits.h126 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse()
136 nodes(const GraphType &G) {
137 return make_range(GraphTraits<GraphType>::nodes_begin(G),
138 GraphTraits<GraphType>::nodes_end(G));
142 inverse_nodes(const GraphType &G) {
143 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
144 GraphTraits<Inverse<GraphType>>::nodes_end(G));
149 children(const typename GraphTraits<GraphType>::NodeRef &G) {
150 return make_range(GraphTraits<GraphType>::child_begin(G),
151 GraphTraits<GraphType>::child_end(G));
[all …]
H A DDepthFirstIterator.h156 static df_iterator begin(const GraphT &G) { in begin() argument
157 return df_iterator(GT::getEntryNode(G)); in begin()
159 static df_iterator end(const GraphT &G) { return df_iterator(); } in end() argument
162 static df_iterator begin(const GraphT &G, SetType &S) { in begin() argument
163 return df_iterator(GT::getEntryNode(G), S); in begin()
165 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end() argument
222 df_iterator<T> df_begin(const T& G) { in df_begin() argument
223 return df_iterator<T>::begin(G); in df_begin()
227 df_iterator<T> df_end(const T& G) { in df_end() argument
228 return df_iterator<T>::end(G); in df_end()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/
H A DLinkGraphLayer.h36 virtual Error add(ResourceTrackerSP RT, std::unique_ptr<jitlink::LinkGraph> G,
41 Error add(ResourceTrackerSP RT, std::unique_ptr<jitlink::LinkGraph> G) { in add() argument
42 auto LGI = getInterface(*G); in add()
43 return add(std::move(RT), std::move(G), std::move(LGI)); in add()
47 Error add(JITDylib &JD, std::unique_ptr<jitlink::LinkGraph> G, in add() argument
49 return add(JD.getDefaultResourceTracker(), std::move(G), std::move(I)); in add()
54 Error add(JITDylib &JD, std::unique_ptr<jitlink::LinkGraph> G) { in add() argument
55 return add(JD.getDefaultResourceTracker(), std::move(G)); in add()
60 std::unique_ptr<jitlink::LinkGraph> G) = 0;
63 MaterializationUnit::Interface getInterface(jitlink::LinkGraph &G);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp184 void replaceBy(Function *G) const { in replaceBy()
185 F = G; in replaceBy()
256 void mergeTwoFunctions(Function *F, Function *G);
267 void eraseTail(Function *G);
280 void writeThunk(Function *F, Function *G);
283 void writeAlias(Function *F, Function *G);
288 bool writeThunkOrAliasIfNeeded(Function *F, Function *G);
291 void replaceFunctionInTree(const FunctionNode &FN, Function *G);
545 void MergeFunctions::eraseTail(Function *G) { in eraseTail() argument
547 for (BasicBlock &BB : drop_begin(*G)) { in eraseTail()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSHA256.cpp43 #define F_EXPAND(A, B, C, D, E, F, G, H, M1, M2, M3, M4, k) \ argument
45 H += SIGMA_1(E) + CH(E, F, G) + M1 + k; \
71 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, 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()
162 G.ExplicitSymbols[SymbolName] = SymbolValue; in AddSymbol()
167 auto &G = getGlobals(); in getPermanentLibrary() local
170 SmartScopedLock<true> Lock(G.SymbolsMutex); in getPermanentLibrary()
171 G.OpenedHandles.AddLibrary(Handle, /*IsProcess*/ FileName == nullptr); in getPermanentLibrary()
179 auto &G = getGlobals(); in addPermanentLibrary() local
180 SmartScopedLock<true> Lock(G.SymbolsMutex); in addPermanentLibrary()
[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()
296 S = backpropagate(G, reduce()); in solve()
297 G.unsetSolver(); in solve()
302 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
304 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
311 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge()
312 handleReconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleAddEdge()
316 NodeMetadata& NMd = G.getNodeMetadata(NId); in handleDisconnectEdge()
317 const MatrixMetadata& MMd = G.getEdgeCosts(EId).getMetadata(); in handleDisconnectEdge()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp162 void initializeGraph(PBQPRAGraph &G, VirtRegMap &VRM, Spiller &VRegSpiller);
171 bool mapPBQPToRegAlloc(const PBQPRAGraph &G,
189 void apply(PBQPRAGraph &G) override { in apply() argument
190 LiveIntervals &LIS = G.getMetadata().LIS; in apply()
196 for (auto NId : G.nodeIds()) { in apply()
198 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight(); in apply()
203 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
205 G.setNodeCosts(NId, std::move(NodeCosts)); in apply()
220 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
223 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h112 const ImmutableGraph &G; variable
116 NodeSet(const ImmutableGraph &G, bool ContainsAll = false)
117 : G{G}, V{static_cast<unsigned>(G.nodes_size()), ContainsAll} {}
119 size_type Idx = G.getNodeIndex(N); in insert()
125 size_type Idx = G.getNodeIndex(N); in erase()
129 size_type Idx = G.getNodeIndex(N); in contains()
140 assert(&this->G == &RHS.G);
146 assert(&this->G == &RHS.G);
152 assert(&this->G == &RHS.G);
186 return Set.G.nodes_begin() + Current;
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DMachOPlatform.cpp137 auto G = createPlatformGraph(MOP, "<OrcRTCompleteBootstrap>"); in materialize() local
139 G->createSection("__orc_rt_cplt_bs", MemProt::Read); in materialize()
141 G->createZeroFillBlock(PlaceholderSection, 1, ExecutorAddr(), 1, 0); in materialize()
142 G->addDefinedSymbol(PlaceholderBlock, 0, *CompleteBootstrapSymbol, 1, in materialize()
146 G->allocActions().reserve(DeferredAAs.size() + 3); in materialize()
149 G->allocActions().push_back( in materialize()
155 G->allocActions().push_back( in materialize()
163 G->allocActions().push_back( in materialize()
171 std::back_inserter(G->allocActions())); in materialize()
173 MOP.getObjectLinkingLayer().emit(std::move(R), std::move(G)); in materialize()
[all …]

12345678910>>...59