Home
last modified time | relevance | path

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

1234567

/llvm-project-15.0.7/clang/test/OpenMP/
H A Dtarget_map_codegen_28.cpp51 struct SSA{ struct
54 SSA(double *&pr) : pr(pr) {} in SSA() argument
58 SSA *p;
59 SSA *≺
60 SSB(SSA *&pr) : pr(pr) {} in SSB()
192 void explicit_maps_member_pointer_references(SSA *sap) { in explicit_maps_member_pointer_references()
194 SSA sa(d); in explicit_maps_member_pointer_references()
H A Dtarget_update_codegen.cpp802 struct SSA { struct
805 SSA(double *&pr) : pr(pr) {} in SSA() argument
810 SSA *p;
811 SSA *≺
812 SSB(SSA *&pr) : pr(pr) {} in SSB()
846 void lvalue_member(SSA *sap) { in lvalue_member()
848 SSA sa(d); in lvalue_member()
874 struct SSA { struct
877 SSA(double *&pr) : pr(pr) {} in SSA() argument
983 struct SSA { struct
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Darm64-fast-isel-rem.ll3 ; 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 [[QUOTREG]]
11 ; CHECK-SSA-LABEL: Machine code for function t2
/llvm-project-15.0.7/llvm/unittests/ExecutionEngine/Orc/
H A DMapperJITLinkMemoryManagerTest.cpp29 auto SSA = jitlink::SimpleSegmentAlloc::Create( in TEST() local
31 EXPECT_THAT_EXPECTED(SSA, Succeeded()); in TEST()
32 auto SegInfo = SSA->getSegInfo(jitlink::MemProt::Read); in TEST()
35 auto FA = SSA->finalize(); in TEST()
H A DEPCGenericJITLinkMemoryManagerTest.cpp119 auto SSA = jitlink::SimpleSegmentAlloc::Create( in TEST() local
121 EXPECT_THAT_EXPECTED(SSA, Succeeded()); in TEST()
122 auto SegInfo = SSA->getSegInfo(jitlink::MemProt::Read); in TEST()
125 auto FA = SSA->finalize(); in TEST()
/llvm-project-15.0.7/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,
/llvm-project-15.0.7/mlir/test/IR/
H A Dinvalid.mlir39 ^bb42 (i32): // expected-error {{expected SSA operand}}
46 ^bb42 (%0): // expected-error {{expected ':' and type for SSA operand}}
141 %x = "xxx"(%y) : (i32)->i32 // expected-error {{use of undeclared SSA value}}
155 ^bb2(%a: i64): // expected-error{{redefinition of SSA value '%a'}}
222 %x = "xxx"(%y) : (i32)->i32 // expected-error {{use of undeclared SSA value name}}
229 %x = "xxx"(%y) : (i32)->i32 // expected-error {{use of undeclared SSA value name}}
248 "xxx"(%i) : (index)->() // expected-error {{use of undeclared SSA value name}}
329 // expected-error@+1 {{expected SSA operand}}
531 // expected-error@+1 {{redefinition of SSA value '%bar'}}
539 // expected-error@+1 {{expected '=' after SSA name}}
[all …]
H A Dinvalid-func-op.mlir14 // expected-error@+1 {{expected type instead of SSA identifier}}
24 // expected-error@+1 {{expected SSA identifier}}
/llvm-project-15.0.7/mlir/docs/
H A DSymbolsAndSymbolTables.md21 The `Symbol` infrastructure essentially provides a non-SSA mechanism in which to
31 within the parent `SymbolTable`. This name is semantically similarly to an SSA
52 * No SSA results
118 Using an attribute, as opposed to an SSA value, has several benefits:
124 * Handling of SSA dominance remains unchanged.
126 - If we were to use SSA values, we would need to create some mechanism in
133 The impact of this choice to use attributes as opposed to SSA values is that we
135 must either support both `SymbolRefs` and SSA value references, or provide
136 operations that materialize SSA values from a symbol reference. Each has
155 operations to the traditional SSA use-list. As such, it is imperative to provide
/llvm-project-15.0.7/mlir/include/mlir/Interfaces/
H A DCallInterfaces.td21 // region. A callable is either a symbol, or an SSA value, that is referenced by
38 SSA value. If the reference is an SSA value, the SSA value corresponds
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DLoopRotationUtils.cpp108 SSAUpdater SSA(InsertedPHIs); in RewriteUsesOfClonedInstructions() local
121 SSA.Initialize(OrigHeaderVal->getType(), OrigHeaderVal->getName()); in RewriteUsesOfClonedInstructions()
126 SSA.AddAvailableValue(OrigHeader, OrigHeaderVal); in RewriteUsesOfClonedInstructions()
127 SSA.AddAvailableValue(OrigPreheader, OrigPreHeaderVal); in RewriteUsesOfClonedInstructions()
151 SSA.RewriteUse(U); in RewriteUsesOfClonedInstructions()
172 else if (SSA.HasValueForBlock(UserBB)) in RewriteUsesOfClonedInstructions()
173 NewVal = SSA.GetValueInMiddleOfBlock(UserBB); in RewriteUsesOfClonedInstructions()
H A DSSAUpdater.cpp322 SSAUpdater &S, StringRef BaseName) : SSA(S) { in LoadAndStorePromoter()
333 SSA.Initialize(SomeVal->getType(), BaseName); in LoadAndStorePromoter()
364 SSA.AddAvailableValue(BB, SI->getOperand(0)); in run()
426 SSA.AddAvailableValue(BB, StoredValue); in run()
433 Value *NewVal = SSA.GetValueInMiddleOfBlock(ALoad->getParent()); in run()
/llvm-project-15.0.7/mlir/docs/Dialects/
H A DAffine.md40 // Uses of SSA values that are passed to dimensional identifiers.
43 // Uses of SSA values that are used to bind symbols.
46 // Most things that bind SSA values bind dimensions and symbols.
50 SSA values bound to dimensions and symbols must always have 'index' type.
63 identifiers to enable powerful analysis and transformation. An SSA value's use
64 can be bound to a symbolic identifier if that SSA value is either 1. a region
75 *Note:* if the use of an SSA value is not contained in any op with the
79 location of the SSA use. Dimensions may be bound not only to anything that a
192 // SSA value %N to the symbol s0.
322 indicate SSA identifiers which are symbolic.
[all …]
/llvm-project-15.0.7/mlir/include/mlir/Dialect/Affine/IR/
H A DAffineOps.td43 to a list of SSA values, yielding a single SSA value. The number of
143 application of an affine mapping to a list of SSA values passed to the map.
145 these SSA values as for all bindings of SSA values to dimensions and
156 for applying that SSA value to a function that maps a single symbol to
180 variables are passed as additional SSA operands to the `affine.for`
188 initial values of the loop-carried variables (corresponding to the SSA
373 these SSA values as for all bindings of SSA values to dimensions and
510 'symbol' can be used to indicate SSA identifiers which are symbolic.
586 to a list of SSA values, and returns the minimum value of all result
631 The same restrictions hold for these SSA values as for all bindings of SSA
[all …]
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DRegionKindInterface.td26 [SSA-style control flow](../LangRef.md/#modeling-control-flow) region
42 "SSA-Dominance property",
/llvm-project-15.0.7/llvm/test/Transforms/Inline/
H A Dlocal-as-metadata-undominated-use.ll4 ; Make sure the inliner doesn't crash when a metadata-bridged SSA operand is an
23 ; "correct" SSA value since its assumptions have been violated.
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86SpeculativeLoadHardening.cpp156 MachineSSAUpdater SSA; member
159 : RC(RC), SSA(MF) {} in PredState()
505 PS->SSA.Initialize(PS->InitialReg); in runOnMachineFunction()
506 PS->SSA.AddAvailableValue(&Entry, PS->InitialReg); in runOnMachineFunction()
525 PS->SSA.AddAvailableValue( in runOnMachineFunction()
553 PS->SSA.RewriteUse(Op); in runOnMachineFunction()
1196 PS->SSA.AddAvailableValue(&MBB, UpdatedStateReg); in tracePredStateThroughIndirectBranches()
1646 Register StateReg = PS->SSA.GetValueAtEndOfBlock(&MBB); in hardenLoadAddr()
1917 Register StateReg = PS->SSA.GetValueAtEndOfBlock(&MBB); in hardenValueInRegister()
2082 Register StateReg = PS->SSA.GetValueAtEndOfBlock(&MBB); in tracePredStateThroughCall()
[all …]
/llvm-project-15.0.7/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
101 SSA form. In the example above, note that the loads from G and H are
207 algorithm for constructing SSA form and has a number of optimizations
234 front-end? Wouldn't it be better if I just did SSA construction
[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!
/llvm-project-15.0.7/llvm/test/Transforms/SimplifyCFG/
H A D2002-05-21-PHIElimination.ll5 ; Which is not valid SSA
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/
H A Dexpand-condsets-same-inputs.mir23 %0 = COPY $p0 ; Cheat: convince MIR parser that this is not SSA.
/llvm-project-15.0.7/llvm/test/DebugInfo/X86/
H A Dlive-debug-vars-loc-limit.ll5 ; This test uses constant i32 values in the DIArgList instead of SSA values, as
8 ; there is another version of this test that uses SSA values at:
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dliveness.mir4 # all subregister liveranges. We may need to create additional SSA values at

1234567