| /external/autotest/server/site_tests/bluetooth_AdapterCLHealth/ |
| D | control.cl_sdp_service_search_attribute_request_test | 28 TP/SERVER/SSA/BV-01-C
29 TP/SERVER/SSA/BV-02-C
30 TP/SERVER/SSA/BV-03-C
31 TP/SERVER/SSA/BV-04-C
32 TP/SERVER/SSA/BV-06-C
33 TP/SERVER/SSA/BV-07-C
34 TP/SERVER/SSA/BV-08-C
35 TP/SERVER/SSA/BV-09-C
36 TP/SERVER/SSA/BV-10-C
37 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
|
| /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-10.0/llvm/lib/Transforms/Utils/ |
| D | LoopRotationUtils.cpp | 101 SSAUpdater SSA(InsertedPHIs); in RewriteUsesOfClonedInstructions() local
114 SSA.Initialize(OrigHeaderVal->getType(), OrigHeaderVal->getName()); in RewriteUsesOfClonedInstructions()
115 SSA.AddAvailableValue(OrigHeader, OrigHeaderVal); in RewriteUsesOfClonedInstructions()
116 SSA.AddAvailableValue(OrigPreheader, OrigPreHeaderVal); in RewriteUsesOfClonedInstructions()
148 SSA.RewriteUse(U); in RewriteUsesOfClonedInstructions()
169 else if (SSA.HasValueForBlock(UserBB)) in RewriteUsesOfClonedInstructions()
170 NewVal = SSA.GetValueInMiddleOfBlock(UserBB); in RewriteUsesOfClonedInstructions()
|
| D | SSAUpdater.cpp | 338 SSAUpdater &S, StringRef BaseName) : SSA(S) { in LoadAndStorePromoter()
349 SSA.Initialize(SomeVal->getType(), BaseName); in LoadAndStorePromoter()
380 SSA.AddAvailableValue(BB, SI->getOperand(0)); in run()
442 SSA.AddAvailableValue(BB, StoredValue); in run()
449 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/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.
|
| /external/exoplayer/tree_8e57d3715f9092d5ec54ebe2e538f34bfcc34479/testdata/src/test/assets/media/ssa/ |
| D | empty_style_line | 2 Title: SSA/ASS Test
|
| D | style_underline | 2 Title: SSA/ASS Test
|
| D | style_strikeout | 2 Title: SSA/ASS Test
|
| D | style_font_size | 2 Title: SSA/ASS Test
|
| D | style_bold_italic | 2 Title: SSA/ASS Test
|
| /external/exoplayer/tree_15dc86382f17a24a3e881e52e31a810c1ea44b49/testdata/src/test/assets/media/ssa/ |
| D | empty_style_line | 2 Title: SSA/ASS Test
|
| D | style_underline | 2 Title: SSA/ASS Test
|
| D | style_strikeout | 2 Title: SSA/ASS Test
|
| D | style_font_size | 2 Title: SSA/ASS Test
|
| D | style_bold_italic | 2 Title: SSA/ASS Test
|
| /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/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/ |
| D | X86SpeculativeLoadHardening.cpp | 155 MachineSSAUpdater SSA; member
158 : RC(RC), SSA(MF) {} in PredState()
503 PS->SSA.Initialize(PS->InitialReg); in runOnMachineFunction()
504 PS->SSA.AddAvailableValue(&Entry, PS->InitialReg); in runOnMachineFunction()
523 PS->SSA.AddAvailableValue( in runOnMachineFunction()
551 PS->SSA.RewriteUse(Op); in runOnMachineFunction()
781 PS->SSA.AddAvailableValue(&CheckingMBB, CurStateReg); in tracePredStateThroughCFG()
1191 PS->SSA.AddAvailableValue(&MBB, UpdatedStateReg); in tracePredStateThroughIndirectBranches()
2020 unsigned StateReg = PS->SSA.GetValueAtEndOfBlock(&MBB); in hardenLoadAddr()
2289 unsigned StateReg = PS->SSA.GetValueAtEndOfBlock(&MBB); in hardenValueInRegister()
[all …]
|
| /external/crosvm/metrics/src/sys/windows/ |
| D | wmi.rs | 97 SSA, enumerator
118 5 => BusType::SSA, in from()
|