Home
last modified time | relevance | path

Searched full:accesses (Results 1 – 25 of 1222) sorted by relevance

12345678910>>...49

/llvm-project/clang/test/Sema/
H A Dtest-wunaligned-access.c23 … 'struct T1' and is usually due to 'struct U1' being packed, which can lead to unaligned accesses}}
29 … 'struct T1' and is usually due to 'struct U2' being packed, which can lead to unaligned accesses}}
61 … 'struct T1' and is usually due to 'struct U7' being packed, which can lead to unaligned accesses}}
82 …'struct T1' and is usually due to 'struct U10' being packed, which can lead to unaligned accesses}}
97 …'struct T1' and is usually due to 'struct U12' being packed, which can lead to unaligned accesses}}
103 …'struct T1' and is usually due to 'struct U13' being packed, which can lead to unaligned accesses}}
109 …'struct T1' and is usually due to 'struct U14' being packed, which can lead to unaligned accesses}}
115 …'struct T1' and is usually due to 'struct U15' being packed, which can lead to unaligned accesses}}
136 …'struct T1' and is usually due to 'struct U18' being packed, which can lead to unaligned accesses}}
141 …'struct T1' and is usually due to 'struct U19' being packed, which can lead to unaligned accesses}}
[all …]
H A Dtest-wunaligned-access.cpp24 …s aligned than 'T1' and is usually due to 'U1' being packed, which can lead to unaligned accesses}}
48 …s aligned than 'T1' and is usually due to 'U5' being packed, which can lead to unaligned accesses}}
65 …s aligned than 'T1' and is usually due to 'U7' being packed, which can lead to unaligned accesses}}
71 …s aligned than 'T1' and is usually due to 'U8' being packed, which can lead to unaligned accesses}}
77 …s aligned than 'T1' and is usually due to 'U9' being packed, which can lead to unaligned accesses}}
83 … aligned than 'T1' and is usually due to 'U10' being packed, which can lead to unaligned accesses}}
141 …s aligned than 'T1' and is usually due to 'A1' being packed, which can lead to unaligned accesses}}
157 … aligned than 'A2' and is usually due to 'U17' being packed, which can lead to unaligned accesses}}
183 … aligned than 'A4' and is usually due to 'U19' being packed, which can lead to unaligned accesses}}
197 … aligned than 'A5' and is usually due to 'U20' being packed, which can lead to unaligned accesses}}
[all …]
/llvm-project/mlir/test/lib/Analysis/DataFlow/
H A DTestDenseDataFlowAnalysis.h66 ArrayRef<Operation *> get() const { return accesses.getArrayRef(); } in get()
74 accesses.clear(); in merge()
78 size_t sizeBefore = accesses.size(); in merge()
79 accesses.insert(other.accesses.begin(), other.accesses.end()); in merge()
80 return accesses.size() == sizeBefore ? ChangeResult::NoChange in merge()
85 if (!unknown && accesses.size() == 1 && *accesses.begin() == op) in set()
89 accesses in set()
113 DeterministicSetVector accesses; global() variable
[all...]
/llvm-project/llvm/test/Analysis/StackSafetyAnalysis/
H A Dlocal.ll24 ; GLOBAL-NEXT: safe accesses:
37 ; GLOBAL-NEXT: safe accesses:
51 ; GLOBAL-NEXT: safe accesses:
77 ; GLOBAL-NEXT: safe accesses:
96 ; GLOBAL-NEXT: safe accesses:
110 ; GLOBAL-NEXT: safe accesses:
126 ; GLOBAL-NEXT: safe accesses:
143 ; GLOBAL-NEXT: safe accesses:
158 ; GLOBAL-NEXT: safe accesses:
175 ; GLOBAL-NEXT: safe accesses
[all...]
H A Dmemintrin.ll17 ; GLOBAL-NEXT: safe accesses:
32 ; GLOBAL-NEXT: safe accesses:
46 ; GLOBAL-NEXT: safe accesses:
59 ; GLOBAL-NEXT: safe accesses:
74 ; GLOBAL-NEXT: safe accesses:
89 ; GLOBAL-NEXT: safe accesses:
141 ; GLOBAL-NEXT: safe accesses:
157 ; GLOBAL-NEXT: safe accesses
172 ; GLOBAL-NEXT: safe accesses
187 ; GLOBAL-NEXT: safe accesses
[all …]
H A Dipa.ll122 ; GLOBAL-NEXT: safe accesses:
137 ; GLOBAL-NEXT: safe accesses:
152 ; GLOBAL-NEXT: safe accesses:
167 ; GLOBAL-NEXT: safe accesses:
183 ; GLOBAL-NEXT: safe accesses:
199 ; GLOBAL-NEXT: safe accesses:
214 ; GLOBAL-NEXT: safe accesses:
230 ; GLOBAL-NEXT: safe accesses:
245 ; GLOBAL-NEXT: safe accesses:
258 ; GLOBAL-NEXT: safe accesses:
[all …]
/llvm-project/llvm/test/Transforms/LoopVectorize/
H A Dinterleaved-accesses-masked-group.ll2 …force-vector-width=8 -force-vector-interleave=1 -enable-interleaved-mem-accesses -debug-only=loop-…
3 … -force-vector-interleave=1 -enable-interleaved-mem-accesses -enable-masked-interleaved-mem-access…
8 ; predicated memory accesses only if they are both in the same (predicated)
10 ; If the accesses are not in the same predicated block, an interleave-group
34 ; STRIDED_UNMASKED: LV: Analyzing interleaved accesses...
38 ; STRIDED_MASKED: LV: Analyzing interleaved accesses...
49 ; stores (if masked-interleaved-accesses are enabled).
50 ; If masked-interleaved-accesses is not enabled we create only one interleave
67 ; STRIDED_UNMASKED: LV: Analyzing interleaved accesses...
73 ; STRIDED_MASKED: LV: Analyzing interleaved accesses...
[all …]
/llvm-project/clang/test/OpenMP/
H A Dtarget_update_from_messages.cpp70 … from(*this) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
72 …(this->ptr)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
73 …this->S->p)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
74 …->s6[0].pp)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
75 …+this->ptr)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
76 …+this->ptr)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
110 …rom' clause}} le45-error 2 {{expected expression containing only member accesses and/or array sect… in tmain()
115 …rom' clause}} le45-error 2 {{expected expression containing only member accesses and/or array sect… in tmain()
128 … (m+1)[2]) // le45-error 2 {{expected expression containing only member accesses and/or array sect… in tmain()
172 …'from' clause}} le45-error {{expected expression containing only member accesses and/or array sect… in main()
[all …]
H A Dtarget_update_to_messages.cpp71 …te to(*this) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
73 …(this->ptr)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
74 …this->S->p)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
75 …->s6[0].pp)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
76 …+this->ptr)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
77 …+this->ptr)) // le45-error {{expected expression containing only member accesses and/or array sect… in foo()
116 …'to' clause}} le45-error 2 {{expected expression containing only member accesses and/or array sect… in tmain()
121 …'to' clause}} le45-error 2 {{expected expression containing only member accesses and/or array sect… in tmain()
133 … (m+1)[2]) // le45-error 2 {{expected expression containing only member accesses and/or array sect… in tmain()
176 …n 'to' clause}} le45-error {{expected expression containing only member accesses and/or array sect… in main()
[all …]
/llvm-project/polly/lib/Transform/
H A DSimplify.cpp9 // Simplify a SCoP by removing unnecessary statements and accesses.
39 /// that the analysis of accesses in a statement is becoming too complex. Chosen
54 "Number of empty partial accesses removed");
55 TWO_STATISTICS(TotalDeadAccessesRemoved, "Number of dead accesses removed");
148 /// Number of unused accesses removed from this SCoP.
190 /// Remove accesses that have an empty domain.
256 SmallVector<MemoryAccess *, 32> Accesses(getAccessesInOrder(Stmt)); in removeOverwrites() local
260 for (auto *MA : reverse(Accesses)) { in removeOverwrites()
262 // In region statements, the explicit accesses can be in blocks that are in removeOverwrites()
274 // Invalidate all overwrites for the array it accesses to avoid too in removeOverwrites()
[all …]
/llvm-project/polly/include/polly/
H A DScopBuilder.h29 /// Command line switch whether to model read-only accesses.
246 /// Create equivalence classes for required invariant accesses.
308 /// set of accesses as a whole. This function finalizes the memory accesses
314 /// When detecting memory accesses different accesses to the same array may
317 /// again over all memory accesses and updates their dimensionality to match
323 /// In case all memory accesses in a given dimension are multiplied with a
348 /// Fold memory accesses to handle parametric offset.
350 /// As a post-processing step, we 'fold' memory accesses t
[all...]
/llvm-project/polly/lib/External/isl/
H A Disl_flow.c373 /* Sort the must source accesses in their textual order.
424 * and one for the resulting may dependences. May accesses can
699 /* Given a shared_level between two accesses, return 1 if the
839 /* Given the must and may dependence relations for the must accesses
840 * for level sink_level, check if there are any accesses of may access j
842 * If some of these accesses are intermediate with respect to
1051 /* Compute dependences for the case where all accesses are "may"
1052 * accesses, which boils down to computing memory based dependences.
1120 * add result to possible last accesses at level l of source w
1124 * for all possible last accesses dep of w at l
[all …]
/llvm-project/llvm/test/Analysis/LoopAccessAnalysis/
H A Dinvariant-dependence-before.ll10 ; CHECK-NEXT: Grouped accesses:
40 ; CHECK-NEXT: Grouped accesses:
75 ; CHECK-NEXT: Grouped accesses:
110 ; CHECK-NEXT: Grouped accesses:
140 ; CHECK-NEXT: Grouped accesses:
176 ; CHECK-NEXT: Grouped accesses:
207 ; CHECK-NEXT: Grouped accesses:
237 ; CHECK-NEXT: Grouped accesses:
273 ; CHECK-NEXT: Grouped accesses:
308 ; CHECK-NEXT: Grouped accesses
[all...]
/llvm-project/polly/test/CodeGen/MemAccess/
H A Dmap_scalar_access___%outer.for---%return.jscop.transformed13 "accesses" : [
24 "accesses" : [
39 "accesses" : [
54 "accesses" : [
69 "accesses" : [
H A Dmap_scalar_access___%outer.for---%return.jscop13 "accesses" : [
24 "accesses" : [
39 "accesses" : [
54 "accesses" : [
69 "accesses" : [
/llvm-project/lldb/bindings/interface/
H A DSBWatchpointOptionsDocstrings.i5 %feature("docstring", "Sets whether the watchpoint should stop on read accesses."
7 %feature("docstring", "Gets whether the watchpoint should stop on read accesses."
9 %feature("docstring", "Sets whether the watchpoint should stop on write accesses. eWatchpointWriteT…
11 %feature("docstring", "Gets whether the watchpoint should stop on write accesses, returning Watchpo…
/llvm-project/mlir/include/mlir/Dialect/SPIRV/IR/
H A DSPIRVAtomicOps.td76 accesses within Scope to the same location:
115 accesses within Scope to the same location:
240 accesses within Scope to the same location:
302 accesses within Scope to the same location:
355 accesses within Scope to the same location:
390 accesses within Scope to the same location:
424 accesses within Scope to the same location:
457 accesses within Scope to the same location:
493 accesses within Scope to the same location:
528 accesses within Scope to the same location:
[all …]
H A DSPIRVBarrierOps.td77 let summary = "Control the order that memory accesses are observed.";
80 Ensures that memory accesses issued before this instruction will be
81 observed before memory accesses issued after this instruction. This
82 control is ensured only for memory accesses issued by this invocation
85 accesses that use the NonPrivatePointer memory operand or
/llvm-project/llvm/include/llvm/Analysis/
H A DLoopAccessAnalysis.h56 /// Checks memory dependences among accesses to the same underlying
66 /// on the program order of memory accesses to determine their safety.
67 /// At the moment we will only deem accesses as safe for:
88 /// * Zero distances and all accesses have the same size.
94 /// Set of potential dependent memory accesses.
195 /// Check whether the dependencies between the accesses are safe.
257 /// Returns an empty ArrayRef if there are no accesses for the location.
259 auto I = Accesses.find({Ptr, IsWrite});
260 if (I != Accesses.end())
288 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses;
292 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses; global() variable
[all...]
/llvm-project/polly/test/Simplify/
H A Dgemm___%bb3---%bb28.jscop23 "accesses" : [
38 "accesses" : [
57 "accesses" : [
80 "accesses" : [
95 "accesses" : [
H A Dgemm___%bb3---%bb28.jscop.transformed23 "accesses" : [
38 "accesses" : [
57 "accesses" : [
80 "accesses" : [
95 "accesses" : [
/llvm-project/llvm/lib/Analysis/
H A DLoopAccessAnalysis.cpp71 #define DEBUG_TYPE "loop-accesses"
112 /// accesses in code like the following.
475 // the accesses are safe. in groupChecks()
487 // accesses to the same underlying object. This cannot happen unless in groupChecks()
513 // and add them to the overall solution. We use the order in which accesses in groupChecks()
527 // Because DepCands is constructed by visiting accesses in the order in in groupChecks()
621 OS.indent(Depth) << "Grouped accesses:\n"; in printChecks()
634 /// Analyses memory accesses in a loop. in print()
658 Accesses[MemAccessInfo(Ptr, false)].insert(AccessTy);
667 Accesses[MemAccessInf in AccessAnalysis()
770 PtrAccessMap Accesses; global() member in __anon26c80b460111::AccessAnalysis
2529 AccessAnalysis Accesses(TheLoop, AA, LI, DependentAccesses, *PSE, analyzeLoop() local
[all...]
/llvm-project/polly/test/ScopInfo/
H A Dinvariant_load_canonicalize_array_baseptrs_3.ll5 ; Verify that we canonicalize accesses even tough one of the accesses (even
7 ; the combined execution context still covers both accesses.
9 ; CHECK: Invariant Accesses: {
/llvm-project/polly/test/CodeGen/
H A Dload_subset_with_context___%for.cond7.preheader---%for.cond33.preheader.jscop18 "accesses" : [
33 "accesses" : [
44 "accesses" : [
59 "accesses" : [
H A Dload_subset_with_context___%for.cond7.preheader---%for.cond33.preheader.jscop.transformed18 "accesses" : [
33 "accesses" : [
44 "accesses" : [
59 "accesses" : [

12345678910>>...49