/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/swiftshader/third_party/llvm-7.0/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:%[0-9]+]]:gpr32 = SDIVWr 8 ; CHECK-SSA-NOT: [[QUOTREG]] = 9 ; CHECK-SSA: {{%[0-9]+}}:gpr32 = MSUBWrrr killed [[QUOTREG]] 11 ; CHECK-SSA-LABEL: Machine code for function t2
|
/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
|
/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/swiftshader/third_party/llvm-7.0/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/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/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/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
D | LoopRotationUtils.cpp | 90 SSAUpdater SSA(InsertedPHIs); 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() 158 else if (SSA.HasValueForBlock(UserBB)) in RewriteUsesOfClonedInstructions() 159 NewVal = SSA.GetValueInMiddleOfBlock(UserBB); in RewriteUsesOfClonedInstructions()
|
D | SSAUpdater.cpp | 339 SSAUpdater &S, StringRef BaseName) : SSA(S) { in LoadAndStorePromoter() 350 SSA.Initialize(SomeVal->getType(), BaseName); in LoadAndStorePromoter() 382 SSA.AddAvailableValue(BB, SI->getOperand(0)); in run() 444 SSA.AddAvailableValue(BB, StoredValue); in run() 451 Value *NewVal = SSA.GetValueInMiddleOfBlock(ALoad->getParent()); in run()
|
/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-7.0/llvm/test/Other/ |
D | opt-Os-pipeline.ll | 59 ; CHECK-NEXT: Memory SSA 84 ; CHECK-NEXT: Loop-Closed SSA Form Pass 103 ; CHECK-NEXT: Loop-Closed SSA Form Pass 145 ; CHECK-NEXT: Loop-Closed SSA Form Pass 177 ; CHECK-NEXT: Loop-Closed SSA Form Pass 225 ; CHECK-NEXT: Loop-Closed SSA Form Pass 235 ; CHECK-NEXT: Loop-Closed SSA Form Pass 250 ; CHECK-NEXT: Loop-Closed SSA Form Pass
|
D | opt-O3-pipeline.ll | 62 ; CHECK-NEXT: Memory SSA 101 ; CHECK-NEXT: Loop-Closed SSA Form Pass 120 ; CHECK-NEXT: Loop-Closed SSA Form Pass 162 ; CHECK-NEXT: Loop-Closed SSA Form Pass 194 ; CHECK-NEXT: Loop-Closed SSA Form Pass 242 ; CHECK-NEXT: Loop-Closed SSA Form Pass 252 ; CHECK-NEXT: Loop-Closed SSA Form Pass 267 ; CHECK-NEXT: Loop-Closed SSA Form Pass
|
D | opt-O2-pipeline.ll | 59 ; CHECK-NEXT: Memory SSA 97 ; CHECK-NEXT: Loop-Closed SSA Form Pass 116 ; CHECK-NEXT: Loop-Closed SSA Form Pass 158 ; CHECK-NEXT: Loop-Closed SSA Form Pass 190 ; CHECK-NEXT: Loop-Closed SSA Form Pass 238 ; CHECK-NEXT: Loop-Closed SSA Form Pass 248 ; CHECK-NEXT: Loop-Closed SSA Form Pass 263 ; CHECK-NEXT: Loop-Closed SSA Form Pass
|
/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 | 216 IR with SSA form: 262 #### SSA-specific nodes 276 operands. These values don't have SSA versions. The representation is 278 "offset/address" value (value::rel), (e.g. some SSA version of the AR 282 represent the effects of aliasing in the SSA form. 292 corresponding SSA versions after ssa\_rename). 402 in SSA Form", Fred Chow, Sun Chan, Shin-Ming Liu, Raymond Lo, Mark 408 [4] ["Register Allocation for Programs in SSA Form", Sebastian 411 [5] ["An extension to the SSA representation for predicated code", 415 [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.
|