Home
last modified time | relevance | path

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

12345678910>>...55

/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/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64GlobalsTagging.cpp29 static bool shouldTagGlobal(GlobalVariable &G) { in shouldTagGlobal() argument
30 if (!G.isTagged()) in shouldTagGlobal()
33 assert(G.hasSanitizerMetadata() && in shouldTagGlobal()
35 GlobalValue::SanitizerMetadata Meta = G.getSanitizerMetadata(); in shouldTagGlobal()
40 if (G.getName().starts_with("llvm.") || G.isThreadLocal() || G.isConstant()) { in shouldTagGlobal()
42 G.setSanitizerMetadata(Meta); in shouldTagGlobal()
64 if (G.hasSection()) {
66 G
68 tagGlobalDefinition(Module & M,GlobalVariable * G) tagGlobalDefinition() argument
[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 Dloongarch.h173 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E) { in applyFixup() argument
189 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()
235 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
252 "In graph " + G.getName() + ", section " + B.getSection().getName() + in applyFixup()
261 inline ArrayRef<char> getGOTEntryBlockContent(LinkGraph &G) { in getGOTEntryBlockContent() argument
263 G.getPointerSize()}; in getGOTEntryBlockContent()
276 inline ArrayRef<char> getStubBlockContent(LinkGraph &G) { in getStubBlockContent() argument
304 createAnonymousPointerJumpStub(LinkGraph & G,Section & StubSection,Symbol & PointerSymbol) createAnonymousPointerJumpStub() argument
319 visitEdge(LinkGraph & G,Block * B,Edge & E) visitEdge() argument
343 createEntry(LinkGraph & G,Symbol & Target) createEntry() argument
348 getGOTSection(LinkGraph & G) getGOTSection() argument
365 visitEdge(LinkGraph & G,Block * B,Edge & E) visitEdge() argument
378 createEntry(LinkGraph & G,Symbol & Target) createEntry() argument
384 getStubsSection(LinkGraph & G) getStubsSection() argument
[all...]
H A Dx86_64.h407 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup() argument
428 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
436 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
445 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
454 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
470 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
485 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
494 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
509 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
522 "In graph " + G.getName() + ", section " + B.getSection().getName() + in applyFixup()
[all …]
H A Di386.h197 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E, in applyFixup() argument
229 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
239 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
268 "In graph " + G.getName() + ", section " + B.getSection().getName() + in applyFixup()
298 inline Symbol &createAnonymousPointer(LinkGraph &G, Section &PointerSection,
301 auto &B = G.createContentBlock(PointerSection, NullPointerContent,
305 return G.addAnonymousSymbol(B, 0, PointerSize, false, false);
314 inline Block &createPointerJumpStubBlock(LinkGraph &G, Section &StubSection, in createPointerJumpStubBlock() argument
316 auto &B = G.createContentBlock(StubSection, PointerJumpStubContent, in createPointerJumpStubBlock()
330 inline Symbol &createAnonymousPointerJumpStub(LinkGraph &G, in createAnonymousPointerJumpStub() argument
[all …]
H A Dppc64.h131 inline Symbol &createAnonymousPointer(LinkGraph &G, Section &PointerSection,
134 assert(G.getPointerSize() == sizeof(NullPointerContent) && in getSectionName()
137 Block &B = G.createContentBlock(PointerSection, NullPointerContent, in visitEdge()
138 orc::ExecutorAddr(), G.getPointerSize(), 0); in visitEdge()
141 return G.addAnonymousSymbol(B, 0, G.getPointerSize(), false, false); in visitEdge()
145 inline Symbol &createAnonymousPointerJumpStub(LinkGraph &G, in visitEdge()
150 Block &B = G.createContentBlock(StubSection, StubInfo.Content, in visitEdge()
154 return G.addAnonymousSymbol(B, 0, StubInfo.Content.size(), true, false); in createEntry() argument
163 bool visitEdge(LinkGraph &G, Bloc in getOrCreateTOCSection()
118 createAnonymousPointerJumpStub(LinkGraph & G,Section & StubSection,Symbol & PointerSymbol,PLTCallStubKind StubKind) createAnonymousPointerJumpStub() argument
136 visitEdge(LinkGraph & G,Block * B,Edge & E) visitEdge() argument
159 getOrCreateTOCSection(LinkGraph & G) getOrCreateTOCSection() argument
176 visitEdge(LinkGraph & G,Block * B,Edge & E) visitEdge() argument
193 createEntry(LinkGraph & G,Symbol & Target) createEntry() argument
200 getOrCreateStubsSection(LinkGraph & G) getOrCreateStubsSection() argument
223 applyFixup(LinkGraph & G,Block & B,const Edge & E,const Symbol * TOCSymbol) applyFixup() argument
[all...]
H A Daarch32.h273 Expected<int64_t> readAddendData(LinkGraph &G, Block &B, Edge::OffsetT Offset,
277 Expected<int64_t> readAddendArm(LinkGraph &G, Block &B, Edge::OffsetT Offset,
281 Expected<int64_t> readAddendThumb(LinkGraph &G, Block &B, Edge::OffsetT Offset,
286 inline Expected<int64_t> readAddend(LinkGraph &G, Block &B,
290 return readAddendData(G, B, Offset, Kind);
293 return readAddendArm(G, B, Offset, Kind);
296 return readAddendThumb(G, B, Offset, Kind, ArmCfg);
303 Error applyFixupData(LinkGraph &G, Block &B, const Edge &E);
306 Error applyFixupArm(LinkGraph &G, Block &B, const Edge &E);
309 Error applyFixupThumb(LinkGraph &G, Bloc
[all...]
H A Daarch64.h433 inline Error applyFixup(LinkGraph &G, Block &B, const Edge &E) { in applyFixup() argument
449 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
466 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
483 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
516 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
528 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
547 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
565 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
580 return makeTargetOutOfRangeError(G, B, E); in applyFixup()
608 "In graph " + G.getName() + ", section " + B.getSection().getName() + in applyFixup()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DELF_ppc64.cpp43 bool visitEdge(LinkGraph &G, Block *B, Edge &E) { in createELFGOTHeader()
48 E.setTarget(this->getEntryForTarget(G, E.getTarget())); in createELFGOTHeader()
52 E.setTarget(this->getEntryForTarget(G, E.getTarget())); in createELFGOTHeader()
56 E.setTarget(this->getEntryForTarget(G, E.getTarget())); in createELFGOTHeader()
63 Symbol &createEntry(LinkGraph &G, Symbol &Target) { in registerExistingGOTEntries() argument
66 auto &TLSInfoEntry = G.createMutableContentBlock( in registerExistingGOTEntries()
67 getTLSInfoSection(G), G.allocateContent(getTLSInfoEntryContent()), in registerExistingGOTEntries()
70 return G.addAnonymousSymbol(TLSInfoEntry, 0, 16, false, false); in registerExistingGOTEntries()
74 Section &getTLSInfoSection(LinkGraph &G) { in registerExistingGOTEntries()
36 createELFGOTHeader(LinkGraph & G,ppc64::TOCTableManager<Endianness> & TOC) createELFGOTHeader() argument
80 buildTables_ELF_ppc64(LinkGraph & G) buildTables_ELF_ppc64() argument
262 ELFJITLinker_ppc64(std::unique_ptr<JITLinkContext> Ctx,std::unique_ptr<LinkGraph> G,PassConfiguration PassConfig) ELFJITLinker_ppc64() argument
265 __anon7bd6b3100302(LinkGraph &G) ELFJITLinker_ppc64() argument
271 defineTOCBase(LinkGraph & G) defineTOCBase() argument
312 applyFixup(LinkGraph & G,Block & B,const Edge & E) const applyFixup() argument
342 link_ELF_ppc64(std::unique_ptr<LinkGraph> G,std::unique_ptr<JITLinkContext> Ctx) link_ELF_ppc64() argument
385 link_ELF_ppc64(std::unique_ptr<LinkGraph> G,std::unique_ptr<JITLinkContext> Ctx) link_ELF_ppc64() argument
391 link_ELF_ppc64le(std::unique_ptr<LinkGraph> G,std::unique_ptr<JITLinkContext> Ctx) link_ELF_ppc64le() argument
[all...]
H A DJITLinkGeneric.cpp28 dbgs() << "Starting link phase 1 for graph " << G->getName() << "\n"; in linkPhase1()
36 dbgs() << "Link graph \"" << G->getName() << "\" pre-pruning:\n"; in linkPhase1()
37 G->dump(dbgs()); in linkPhase1()
40 prune(*G); in linkPhase1()
43 dbgs() << "Link graph \"" << G->getName() << "\" post-pruning:\n"; in linkPhase1()
44 G->dump(dbgs()); in linkPhase1()
52 if (G->allocActions().empty() && llvm::all_of(G->sections(), [](Section &S) { in linkPhase1()
60 Ctx->getJITLinkDylib(), *G, in linkPhase1()
79 dbgs() << "Link graph \"" << G in linkPhase2()
266 prune(LinkGraph & G) prune() argument
[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 Daarch32.cpp239 Error makeUnexpectedOpcodeError(const LinkGraph &G, const ThumbRelocation &R, in readAddendThumb()
244 G.getEdgeKindName(Kind))); in readAddendThumb()
247 Error makeUnexpectedOpcodeError(const LinkGraph &G, const ArmRelocation &R, in readAddendThumb()
251 static_cast<uint32_t>(R.Wd), G.getEdgeKindName(Kind))); in readAddendThumb()
315 static Error checkOpcode(LinkGraph &G, const ArmRelocation &R, in applyFixupData()
323 return makeUnexpectedOpcodeError(G, R, Kind); in applyFixupArm()
328 static Error checkOpcode(LinkGraph &G, const ThumbRelocation &R, in applyFixupArm()
336 return makeUnexpectedOpcodeError(G, R, Kind); in applyFixupArm()
390 Expected<int64_t> readAddendData(LinkGraph &G, Block &B, Edge::OffsetT Offset, in applyFixupThumb()
392 endianness Endian = G in applyFixupThumb()
154 makeUnexpectedOpcodeError(const LinkGraph & G,const ThumbRelocation & R,Edge::Kind Kind) makeUnexpectedOpcodeError() argument
193 readAddendData(LinkGraph & G,Block & B,const Edge & E) readAddendData() argument
213 readAddendArm(LinkGraph & G,Block & B,const Edge & E) readAddendArm() argument
229 readAddendThumb(LinkGraph & G,Block & B,const Edge & E,const ArmConfig & ArmCfg) readAddendThumb() argument
273 applyFixupData(LinkGraph & G,Block & B,const Edge & E) applyFixupData() argument
322 applyFixupArm(LinkGraph & G,Block & B,const Edge & E) applyFixupArm() argument
338 applyFixupThumb(LinkGraph & G,Block & B,const Edge & E,const ArmConfig & ArmCfg) applyFixupThumb() argument
450 createEntry(LinkGraph & G,Symbol & Target) createEntry() argument
[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.h148 static po_iterator begin(const GraphT &G) {
149 return po_iterator(GT::getEntryNode(G)); in begin() argument
151 static po_iterator end(const GraphT &G) { return po_iterator(); } in begin()
153 static po_iterator begin(const GraphT &G, SetType &S) {
154 return po_iterator(GT::getEntryNode(G), S); in begin() argument
156 static po_iterator end(const GraphT &G, SetType &S) { return po_iterator(S); } in begin()
189 po_iterator<T> po_begin(const T &G) { return po_iterator<T>::begin(G); }
191 po_iterator<T> po_end (const T &G) { return po_iterator<T>::end(G); }
152 end(const GraphT & G) end() argument
157 end(const GraphT & G,SetType & S) end() argument
190 po_begin(const T & G) po_begin() argument
192 po_end(const T & G) po_end() argument
194 post_order(const T & G) post_order() argument
206 po_ext_begin(T G,SetType & S) po_ext_begin() argument
211 po_ext_end(T G,SetType & S) po_ext_end() argument
216 post_order_ext(const T & G,SetType & S) post_order_ext() argument
229 ipo_begin(const T & G) ipo_begin() argument
234 ipo_end(const T & G) ipo_end() argument
239 inverse_post_order(const T & G) inverse_post_order() argument
253 ipo_ext_begin(const T & G,SetType & S) ipo_ext_begin() argument
258 ipo_ext_end(const T & G,SetType & S) ipo_ext_end() argument
264 inverse_post_order_ext(const T & G,SetType & S) inverse_post_order_ext() argument
302 Initialize(const GraphT & G) Initialize() argument
310 ReversePostOrderTraversal(const GraphT & G) ReversePostOrderTraversal() argument
[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) {
117 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(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));
[all …]
H A DDepthFirstIterator.h152 static df_iterator begin(const GraphT &G) { in begin() argument
153 return df_iterator(GT::getEntryNode(G)); in begin()
155 static df_iterator end(const GraphT &G) { return df_iterator(); } in end() argument
158 static df_iterator begin(const GraphT &G, SetType &S) { in begin() argument
159 return df_iterator(GT::getEntryNode(G), S); in begin()
161 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end() argument
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()
[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/Transforms/IPO/
H A DMergeFunctions.cpp186 void replaceBy(Function *G) const { in replaceBy()
187 F = G; in replaceBy()
255 void mergeTwoFunctions(Function *F, Function *G);
266 void eraseTail(Function *G);
279 void writeThunk(Function *F, Function *G);
282 void writeAlias(Function *F, Function *G);
286 bool writeThunkOrAlias(Function *F, Function *G);
289 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/ExecutionEngine/Orc/
H A DMachOPlatform.cpp152 auto G = createPlatformGraph(MOP, "<OrcRTCompleteBootstrap>"); in materialize() local
154 G->createSection("__orc_rt_cplt_bs", MemProt::Read); in materialize()
156 G->createZeroFillBlock(PlaceholderSection, 1, ExecutorAddr(), 1, 0); in materialize()
157 G->addDefinedSymbol(PlaceholderBlock, 0, *CompleteBootstrapSymbol, 1, in materialize()
161 G->allocActions().reserve(DeferredAAs.size() + 3); in materialize()
164 G->allocActions().push_back( in materialize()
170 G->allocActions().push_back( in materialize()
178 G->allocActions().push_back( in materialize()
186 std::back_inserter(G->allocActions())); in materialize()
188 MOP.getObjectLinkingLayer().emit(std::move(R), std::move(G)); in materialize()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp165 void initializeGraph(PBQPRAGraph &G, VirtRegMap &VRM, Spiller &VRegSpiller);
174 bool mapPBQPToRegAlloc(const PBQPRAGraph &G,
192 void apply(PBQPRAGraph &G) override { in apply() argument
193 LiveIntervals &LIS = G.getMetadata().LIS; in apply()
199 for (auto NId : G.nodeIds()) { in apply()
201 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight(); in apply()
206 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
208 G.setNodeCosts(NId, std::move(NodeCosts)); in apply()
223 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
226 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 …]

12345678910>>...55