Home
last modified time | relevance | path

Searched refs:SSA (Results 1 – 25 of 158) sorted by relevance

1234567

/netbsd-src/external/gpl3/gcc/dist/gcc/doc/
H A Dtree-ssa.texi6 @c Tree SSA
9 @node Tree SSA
11 @cindex Tree SSA
40 * SSA Operands:: SSA names referenced by GIMPLE statements.
41 * SSA:: Static Single Assignment representation.
57 @node SSA Operands
58 @section SSA Operands
169 function is converted into SSA form. This will be used to link all
440 @node SSA
442 @cindex SSA
[all …]
H A Dloop.texi23 * LCSSA:: Loop-closed SSA form.
240 loop-closed SSA form is preserved). Only useful on GIMPLE.
271 @section Loop-closed SSA form
273 @cindex Loop-closed SSA form
276 enforced on the SSA form: No SSA name is used outside of the loop in
277 that it is defined. The SSA form satisfying this condition is called
278 ``loop-closed SSA form'' -- LCSSA@. To enforce LCSSA, PHI nodes must be
279 created at the exits of the loops for the SSA names that are used
280 outside of them. Only the real operands (not virtual SSA names) are
293 SSA name is defined.
[all …]
H A Drtl.texi42 * RTL SSA:: An on-the-side SSA form for RTL
4354 @node RTL SSA
4355 @section On-the-Side SSA Form for RTL
4356 @cindex SSA, RTL form
4357 @cindex RTL SSA
4364 is to use the RTL SSA form, which provides a Static Single Assignment
4367 The RTL SSA code is located in the @file{rtl-ssa} subdirectory of the GCC
4372 * Using RTL SSA:: What a pass needs to do to use the RTL SSA form
4373 * RTL SSA Instructions:: How instructions are represented and organized
4374 * RTL SSA Basic Blocks:: How instructions are grouped into blocks
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/
H A Dtree-ssa.texi6 @c Tree SSA
9 @node Tree SSA
11 @cindex Tree SSA
40 * SSA Operands:: SSA names referenced by GIMPLE statements.
41 * SSA:: Static Single Assignment representation.
57 @node SSA Operands
58 @section SSA Operands
169 function is converted into SSA form. This will be used to link all
452 @node SSA
454 @cindex SSA
[all …]
H A Dloop.texi23 * LCSSA:: Loop-closed SSA form.
239 loop-closed SSA form is preserved). Only useful on GIMPLE.
270 @section Loop-closed SSA form
272 @cindex Loop-closed SSA form
275 enforced on the SSA form: No SSA name is used outside of the loop in
276 that it is defined. The SSA form satisfying this condition is called
277 ``loop-closed SSA form'' -- LCSSA@. To enforce LCSSA, PHI nodes must be
278 created at the exits of the loops for the SSA names that are used
279 outside of them. Only the real operands (not virtual SSA names) are
292 SSA name is defined.
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/docs/HistoricalNotes/
H A D2001-06-01-GCCOptimizations.txt19 6 . *** Conversion to SSA
20 7 . [t] SSA Based DCE
33 things to reimplement would be SSA based PRE, Strength reduction & loop
41 SSA based optimizations that could be adapted (besides the fact that their
46 has been rerun... which causes me to wonder if the SSA generation code
H A D2001-06-01-GCCOptimizations2.txt22 could be faster, because we are using a "smarter" IR (SSA based).
24 > BTW, about SGI, "borrowing" SSA-based optimizations from one compiler and
29 more similar to LLVM than it is different in many respects (SSA based,
33 much less time consuming to adapt, say, SSA-PRE than to rewrite it.
35 > But your larger point is valid that adding SSA based optimizations is
H A D2000-12-06-MeetingSummary.txt10 variables in SSA form, as opposed to having a two dimensional namespace
11 of the original variable and the SSA instance subscript.
26 reconstructed from SSA form in linear time, that it would be an
73 'infinite' spaces that instructions operate in (SSA register numbers,
H A D2003-06-26-Reoptimizer2.txt8 in SSA form (kind of like LLVM's MachineInstrs.) Then re-allocate
101 3. Section 1 is the trace itself, in SSA form used by BinInterface,
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DLoopRotationUtils.cpp114 SSAUpdater SSA(InsertedPHIs); in RewriteUsesOfClonedInstructions() local
127 SSA.Initialize(OrigHeaderVal->getType(), OrigHeaderVal->getName()); in RewriteUsesOfClonedInstructions()
128 SSA.AddAvailableValue(OrigHeader, OrigHeaderVal); in RewriteUsesOfClonedInstructions()
129 SSA.AddAvailableValue(OrigPreheader, OrigPreHeaderVal); in RewriteUsesOfClonedInstructions()
161 SSA.RewriteUse(U); in RewriteUsesOfClonedInstructions()
182 else if (SSA.HasValueForBlock(UserBB)) in RewriteUsesOfClonedInstructions()
183 NewVal = SSA.GetValueInMiddleOfBlock(UserBB); in RewriteUsesOfClonedInstructions()
H A DSSAUpdater.cpp323 SSAUpdater &S, StringRef BaseName) : SSA(S) { in LoadAndStorePromoter()
334 SSA.Initialize(SomeVal->getType(), BaseName); in LoadAndStorePromoter()
365 SSA.AddAvailableValue(BB, SI->getOperand(0)); in run()
427 SSA.AddAvailableValue(BB, StoredValue); in run()
434 Value *NewVal = SSA.GetValueInMiddleOfBlock(ALoad->getParent()); in run()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dpasses.def83 /* After CCP we rewrite no longer addressed locals into SSA
201 /* After CCP we rewrite no longer addressed locals into SSA
254 /* After CCP we rewrite no longer addressed locals into SSA
275 /* Before loop_init we rewrite no longer addressed locals into SSA
337 /* After late FRE we rewrite no longer addressed locals into SSA
349 /* After late CD DCE we rewrite no longer addressed locals into SSA
369 /* uncprop replaces constants by SSA names. This makes analysis harder
405 /* uncprop replaces constants by SSA names. This makes analysis harder
H A Dtimevar.def166 DEFTIMEVAR (TV_TREE_SSA_OTHER , "tree SSA other")
167 DEFTIMEVAR (TV_TREE_INTO_SSA , "tree SSA rewrite")
168 DEFTIMEVAR (TV_TREE_SSA_INCREMENTAL , "tree SSA incremental")
214 DEFTIMEVAR (TV_TREE_SSA_UNCPROP , "tree SSA uncprop")
216 DEFTIMEVAR (TV_TREE_COPY_RENAME , "tree rename SSA copies")
217 DEFTIMEVAR (TV_TREE_SSA_VERIFY , "tree SSA verifier")
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/
H A DX86SpeculativeLoadHardening.cpp156 MachineSSAUpdater SSA; member
159 : RC(RC), SSA(MF) {} in PredState()
504 PS->SSA.Initialize(PS->InitialReg); in runOnMachineFunction()
505 PS->SSA.AddAvailableValue(&Entry, PS->InitialReg); in runOnMachineFunction()
524 PS->SSA.AddAvailableValue( in runOnMachineFunction()
552 PS->SSA.RewriteUse(Op); in runOnMachineFunction()
782 PS->SSA.AddAvailableValue(&CheckingMBB, CurStateReg); in tracePredStateThroughCFG()
1197 PS->SSA.AddAvailableValue(&MBB, UpdatedStateReg); in tracePredStateThroughIndirectBranches()
1647 unsigned StateReg = PS->SSA.GetValueAtEndOfBlock(&MBB); in hardenLoadAddr()
1918 unsigned StateReg = PS->SSA.GetValueAtEndOfBlock(&MBB); in hardenValueInRegister()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtimevar.def163 DEFTIMEVAR (TV_TREE_SSA_REWRITE_BLOCKS, "tree SSA rewrite")
164 DEFTIMEVAR (TV_TREE_SSA_OTHER , "tree SSA other")
165 DEFTIMEVAR (TV_TREE_SSA_INCREMENTAL , "tree SSA incremental")
210 DEFTIMEVAR (TV_TREE_SSA_UNCPROP , "tree SSA uncprop")
212 DEFTIMEVAR (TV_TREE_COPY_RENAME , "tree rename SSA copies")
213 DEFTIMEVAR (TV_TREE_SSA_VERIFY , "tree SSA verifier")
H A Dpasses.def80 /* After CCP we rewrite no longer addressed locals into SSA
195 /* After CCP we rewrite no longer addressed locals into SSA
242 /* After CCP we rewrite no longer addressed locals into SSA
262 /* Before loop_init we rewrite no longer addressed locals into SSA
319 /* After late FRE we rewrite no longer addressed locals into SSA
/netbsd-src/external/apache2/llvm/dist/llvm/docs/tutorial/MyFirstLanguageFrontend/
H A DLangImpl07.rst22 directly in `SSA
24 Since LLVM requires that the input code be in SSA form, this is a very
29 for your front-end to build SSA form: LLVM provides highly tuned and
36 To understand why mutable variables cause complexities in SSA
85 of this chapter is not to explain the details of SSA form. For more
91 *requires* that its IR be in SSA form: there is no "non-ssa" mode for
92 it. However, SSA construction requires non-trivial algorithms and data
100 be in SSA form, it does not require (or permit) memory objects to be in
101 SSA form. In the example above, note that the loads from G and H are
180 into SSA registers, inserting Phi nodes as appropriate. If you run this
[all …]
H A Dindex.rst66 gives us a chance to talk about SSA construction and control
76 to construct SSA form in LLVM: LLVM does *not* require your front-end
77 to construct SSA form in order to use it!
/netbsd-src/external/bsd/file/dist/magic/magdir/
H A Diff43 >8 string SSA\ \b, SSA super smooth animation
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
H A DInstrProfiling.cpp181 Instruction *L, Instruction *S, SSAUpdater &SSA, Value *Init, in PGOCounterPromoterHelper() argument
186 : LoadAndStorePromoter({L, S}, SSA), Store(S), ExitBlocks(ExitBlocks), in PGOCounterPromoterHelper()
190 SSA.AddAvailableValue(PH, Init);
200 Value *LiveInValue = SSA.GetValueInMiddleOfBlock(ExitBlock); in doExtraRewritesBeforeFinalDeletion()
285 SSAUpdater SSA(&NewPHIs); in run() local
302 PGOCounterPromoterHelper Promoter(Cand.first, Cand.second, SSA, InitVal, in run()
/netbsd-src/sys/arch/x68k/include/
H A Dkbdmap.h41 #define SSA 134 macro
/netbsd-src/sys/arch/x68k/usr.bin/loadkmap/
H A Dkbdmap.h38 #define SSA 134 macro
/netbsd-src/sys/arch/amiga/dev/
H A Dkbdmap.h67 #define SSA 134 macro
/netbsd-src/sys/arch/atari/dev/
H A Dkbdmap.h71 #define SSA 134 macro
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdater.h138 SSAUpdater &SSA;

1234567