| /external/autotest/server/site_tests/bluetooth_SDP_ServiceSearchAttributeRequest/ |
| D | control | 27 TP/SERVER/SSA/BV-01-C
28 TP/SERVER/SSA/BV-02-C
29 TP/SERVER/SSA/BV-03-C
30 TP/SERVER/SSA/BV-04-C
31 TP/SERVER/SSA/BV-06-C
32 TP/SERVER/SSA/BV-07-C
33 TP/SERVER/SSA/BV-08-C
34 TP/SERVER/SSA/BV-09-C
35 TP/SERVER/SSA/BV-10-C
36 TP/SERVER/SSA/BV-11-C
[all …]
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | arm64-fast-isel-rem.ll | 3 ; RUN: FileCheck %s < %t --check-prefix=CHECK-SSA
5 ; CHECK-SSA-LABEL: Machine code for function t1
7 ; CHECK-SSA: [[QUOTREG:%vreg[0-9]+]]<def> = SDIVWr
8 ; CHECK-SSA-NOT: [[QUOTREG]]<def> =
9 ; CHECK-SSA: {{%vreg[0-9]+}}<def> = MSUBWrrr [[QUOTREG]]
11 ; CHECK-SSA-LABEL: Machine code for function t2
|
| D | arm64-misched-multimmo.ll | 10 ; CHECK-LABEL: # Machine code for function foo: Properties: <Post SSA
|
| /external/swiftshader/third_party/LLVM/docs/HistoricalNotes/ |
| D | 2001-06-01-GCCOptimizations.txt | 19 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
|
| D | 2001-06-01-GCCOptimizations2.txt | 22 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
|
| D | 2000-12-06-MeetingSummary.txt | 10 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,
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2001-06-01-GCCOptimizations.txt | 19 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
|
| D | 2001-06-01-GCCOptimizations2.txt | 22 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
|
| D | 2000-12-06-MeetingSummary.txt | 10 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,
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| D | LoopRotation.cpp | 98 SSAUpdater SSA; in RewriteUsesOfClonedInstructions() local
111 SSA.Initialize(OrigHeaderVal->getType(), OrigHeaderVal->getName()); in RewriteUsesOfClonedInstructions()
112 SSA.AddAvailableValue(OrigHeader, OrigHeaderVal); in RewriteUsesOfClonedInstructions()
113 SSA.AddAvailableValue(OrigPreheader, OrigPreHeaderVal); in RewriteUsesOfClonedInstructions()
144 SSA.RewriteUse(U); in RewriteUsesOfClonedInstructions()
|
| D | LICM.cpp | 494 SSAUpdater SSA(&NewPHIs); in sink() local
497 SSA.Initialize(I.getType(), I.getName()); in sink()
530 SSA.AddAvailableValue(ExitBlock, New); in sink()
548 SSA.RewriteUseAfterInsertions(U); in sink()
646 Value *LiveInValue = SSA.GetValueInMiddleOfBlock(ExitBlock); in doExtraRewritesBeforeFinalDeletion()
784 SSAUpdater SSA(&NewPHIs); in PromoteAliasSet() local
785 LoopPromoter Promoter(SomePtr, LoopUses, SSA, PointerMustAliases, ExitBlocks, in PromoteAliasSet()
795 SSA.AddAvailableValue(Preheader, PreheaderLoad); in PromoteAliasSet()
|
| /external/mesa3d/src/compiler/nir/ |
| D | README | 5 similar to TGSI and Mesa IR. It also supports SSA (although it doesn't require
25 works directly with registers or SSA values (see below).
27 SSA
30 Everywhere a register can be loaded/stored, an SSA value can be used instead.
32 SSA; although research has been done on extensions of SSA to arrays before, it's
35 more expensive than introducing copies between non-array registers). SSA uses
38 need for an external structure for each SSA register.
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopRotation.cpp | 90 SSAUpdater SSA; in RewriteUsesOfClonedInstructions() local
103 SSA.Initialize(OrigHeaderVal->getType(), OrigHeaderVal->getName()); in RewriteUsesOfClonedInstructions()
104 SSA.AddAvailableValue(OrigHeader, OrigHeaderVal); in RewriteUsesOfClonedInstructions()
105 SSA.AddAvailableValue(OrigPreheader, OrigPreHeaderVal); in RewriteUsesOfClonedInstructions()
137 SSA.RewriteUse(U); in RewriteUsesOfClonedInstructions()
166 else if (SSA.HasValueForBlock(UserBB)) in RewriteUsesOfClonedInstructions()
167 NewVal = SSA.GetValueInMiddleOfBlock(UserBB); in RewriteUsesOfClonedInstructions()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | SSAUpdater.cpp | 326 SSAUpdater &S, StringRef BaseName) : SSA(S) { in LoadAndStorePromoter()
337 SSA.Initialize(SomeVal->getType(), BaseName); in LoadAndStorePromoter()
371 SSA.AddAvailableValue(BB, SI->getOperand(0)); in run()
433 SSA.AddAvailableValue(BB, StoredValue); in run()
440 Value *NewVal = SSA.GetValueInMiddleOfBlock(ALoad->getParent()); in run()
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| D | SSAUpdater.cpp | 361 SSAUpdater &S, StringRef BaseName) : SSA(S) { in LoadAndStorePromoter()
372 SSA.Initialize(SomeVal->getType(), BaseName); in LoadAndStorePromoter()
409 SSA.AddAvailableValue(BB, SI->getOperand(0)); in run()
471 SSA.AddAvailableValue(BB, StoredValue); in run()
479 Value *NewVal = SSA.GetValueInMiddleOfBlock(ALoad->getParent()); in run()
|
| /external/mesa3d/src/gallium/drivers/r600/sb/ |
| D | notes.markdown | 213 IR with SSA form:
259 #### SSA-specific nodes
273 operands. These values don't have SSA versions. The representation is
275 "offset/address" value (value::rel), (e.g. some SSA version of the AR
279 represent the effects of aliasing in the SSA form.
289 corresponding SSA versions after ssa\_rename).
399 in SSA Form", Fred Chow, Sun Chan, Shin-Ming Liu, Raymond Lo, Mark
405 [4] ["Register Allocation for Programs in SSA Form", Sebastian
408 [5] ["An extension to the SSA representation for predicated code",
412 [6] ["Improvements to the Psi-SSA Representation", F. de
|
| /external/llvm/test/Transforms/Inline/ |
| D | local-as-metadata-undominated-use.ll | 3 ; Make sure the inliner doesn't crash when a metadata-bridged SSA operand is an
22 ; "correct" SSA value since its assumptions have been violated.
|
| /external/llvm/docs/tutorial/ |
| D | LangImpl07.rst | 22 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 …]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| D | 2002-05-21-PHIElimination.ll | 5 ; Which is not valid SSA
|
| /external/swiftshader/third_party/LLVM/test/Transforms/SimplifyCFG/ |
| D | 2002-05-21-PHIElimination.ll | 5 ; Which is not valid SSA
|
| /external/llvm/test/CodeGen/AMDGPU/ |
| D | liveness.mir | 4 # all subregister liveranges. We may need to create additional SSA values at
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | DwarfEHPrepare.cpp | 589 SSAUpdater SSA; in MoveExceptionValueCalls() local
603 SSA.Initialize(II->getType(), II->getName()); in MoveExceptionValueCalls()
620 SSA.AddAvailableValue(*LI, CreateExceptionValueCall(*LI)); in MoveExceptionValueCalls()
634 EI->replaceAllUsesWith(SSA.GetValueAtEndOfBlock(BB)); in MoveExceptionValueCalls()
|
| /external/mesa3d/src/compiler/glsl/ |
| D | README | 127 Q: Why no SSA representation?
129 A: Converting an IR tree to SSA form makes dead code elimination,
132 major questions as to how it would work. Do we do SSA on the scalar
152 IR backend, SSA does not appear to be that important to producing
153 excellent code, but we do expect to do some SSA-based optimizations
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | SSAUpdater.h | 136 SSAUpdater &SSA;
|
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| D | SSAUpdater.h | 124 SSAUpdater &SSA;
|