| /aosp_15_r20/external/coreboot/src/vendorcode/cavium/include/bdk/libbdk-arch/ |
| H A D | bdk-csrs-dap.h | 238 …uint32_t cabnsen : 1; /**< [ 10: 10](R/W) Enable nonsecure CAB accesses from NCB an…
239 … 0 = Return fault on nonsecure CAB accesses.
240 … 1 = Enable nonsecure CAB accesses. */
241 …uint32_t caben : 1; /**< [ 9: 9](R/W) Enable CAB accesses from NCB and RSL devi…
242 … 0 = Return fault for all CAB accesses.
243 1 = Enable all CAB accesses.
247 … : 1; /**< [ 5: 5](R/W) Set this bit to use CVM-AP inside DAP for CNXXXX addressing accesses.
250 … : 1; /**< [ 4: 4](R/W) Set this bit to use ARM-AP inside DAP for DAB serial bus accesses.
278 … : 1; /**< [ 4: 4](R/W) Set this bit to use ARM-AP inside DAP for DAB serial bus accesses.
281 … : 1; /**< [ 5: 5](R/W) Set this bit to use CVM-AP inside DAP for CNXXXX addressing accesses.
[all …]
|
| /aosp_15_r20/external/llvm/lib/Transforms/Utils/ |
| H A D | MemorySSA.cpp | 91 /// disambiguate accesses.
185 AccessList *Accesses = It->second.get(); in renameBlock() local
186 for (MemoryAccess &L : *Accesses) { in renameBlock()
212 AccessList *Accesses = It->second.get(); in renameBlock() local
213 auto *Phi = cast<MemoryPhi>(&Accesses->front()); in renameBlock()
222 /// We walk the dominator tree in preorder, renaming accesses, and then filling
256 /// \brief This handles unreachable block accesses by deleting phi nodes in
274 AccessList *Accesses = It->second.get(); in markUnreachableAsLiveOnEntry() local
275 auto *Phi = cast<MemoryPhi>(&Accesses->front()); in markUnreachableAsLiveOnEntry()
283 auto &Accesses = It->second; in markUnreachableAsLiveOnEntry() local
[all …]
|
| /aosp_15_r20/packages/modules/Virtualization/libs/libfdt/src/ |
| D | libfdt.rs | 46 // SAFETY: Only performs read accesses within the limits of the slice. If successful, this in check_full()
76 // SAFETY: Accesses are constrained to the DT totalsize (validated by ctor) and the in path_offset_namelen()
87 // SAFETY: Accesses are constrained to the DT totalsize. in node_offset_by_phandle()
102 // SAFETY: Accesses (read-only) are constrained to the DT totalsize. in node_offset_by_compatible()
113 // SAFETY: Accesses (read-only) are constrained to the DT totalsize. in next_node()
131 // SAFETY: Accesses (read-only) are constrained to the DT totalsize. in parent_offset()
147 // SAFETY: Accesses (read-only) are constrained to the DT totalsize. in supernode_atdepth_offset()
163 // SAFETY: Accesses are constrained to the DT totalsize (validated by ctor). in subnode_offset_namelen()
172 // SAFETY: Accesses (read-only) are constrained to the DT totalsize. in first_subnode()
182 // SAFETY: Accesses (read-only) are constrained to the DT totalsize. in next_subnode()
[all …]
|
| /aosp_15_r20/external/llvm/lib/Analysis/ |
| H A D | LoopAccessAnalysis.cpp | 30 #define DEBUG_TYPE "loop-accesses"
71 /// accesses in code like the following.
288 // the accesses are safe. in groupChecks()
300 // accesses to the same underlying object. This cannot happen unless in groupChecks()
326 // and add them to the overall solution. We use the order in which accesses in groupChecks()
340 // Because DepCands is constructed by visiting accesses in the order in in groupChecks()
433 OS.indent(Depth) << "Grouped accesses:\n"; in print()
448 /// \brief Analyses memory accesses in a loop.
468 Accesses.insert(MemAccessInfo(Ptr, false)); in addLoad()
477 Accesses.insert(MemAccessInfo(Ptr, true)); in addStore()
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/lib/Analysis/ |
| H A D | LoopAccessAnalysis.cpp | 72 #define DEBUG_TYPE "loop-accesses"
113 /// accesses in code like the following.
445 // the accesses are safe. in groupChecks()
457 // accesses to the same underlying object. This cannot happen unless in groupChecks()
485 // and add them to the overall solution. We use the order in which accesses in groupChecks()
499 // Because DepCands is constructed by visiting accesses in the order in in groupChecks()
596 OS.indent(Depth) << "Grouped accesses:\n"; in print()
612 /// Analyses memory accesses in a loop.
634 Accesses[MemAccessInfo(Ptr, false)].insert(AccessTy); in addLoad()
643 Accesses[MemAccessInfo(Ptr, true)].insert(AccessTy); in addStore()
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| H A D | LoopAccessAnalysis.cpp | 72 #define DEBUG_TYPE "loop-accesses"
113 /// accesses in code like the following.
332 // the accesses are safe. in groupChecks()
344 // accesses to the same underlying object. This cannot happen unless in groupChecks()
370 // and add them to the overall solution. We use the order in which accesses in groupChecks()
384 // Because DepCands is constructed by visiting accesses in the order in in groupChecks()
477 OS.indent(Depth) << "Grouped accesses:\n"; in print()
493 /// Analyses memory accesses in a loop.
513 Accesses.insert(MemAccessInfo(Ptr, false)); in addLoad()
522 Accesses.insert(MemAccessInfo(Ptr, true)); in addStore()
[all …]
|
| H A D | MemorySSA.cpp | 477 // We do have accesses that claim they're optimized, but could be optimized in checkClobberSanity()
1010 /// A MemorySSAWalker that does AA walks to disambiguate accesses. It no
1095 AccessList *Accesses = It->second.get(); in renameSuccessorPhis() local
1096 auto *Phi = cast<MemoryPhi>(&Accesses->front()); in renameSuccessorPhis()
1119 AccessList *Accesses = It->second.get(); in renameBlock() local
1120 for (MemoryAccess &L : *Accesses) { in renameBlock()
1136 /// We walk the dominator tree in preorder, renaming accesses, and then filling
1141 assert(Root && "Trying to rename accesses in an unreachable block"); in renamePass()
1185 /// This handles unreachable block accesses by deleting phi nodes in
1203 AccessList *Accesses = It->second.get(); in markUnreachableAsLiveOnEntry() local
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/polly/ |
| D | ScopBuilder.h | 29 /// 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 to parametric
355 /// Assume that all memory accesses are within bounds.
357 /// After we have built a model of all memory accesses, we need to assume
[all …]
|
| D | ScopInfo.h | 136 /// is modeled as if the following memory accesses occurred:
168 /// is modeled as if the accesses occurred this way:
199 /// llvm::Value is treated as a value escaping the SCoP. WRITE accesses
240 /// Memory accesses referencing this ScopArrayInfo object may use
242 /// stored is small enough to model accesses to the current element type as
251 /// available. This function is called when new memory accesses are added for
271 /// For indirect accesses return the origin SAI of the BP, else null.
388 /// For indirect accesses this is the SAI of the BP origin.
430 /// Represent memory accesses in statements.
480 /// The identifier is unique between all memory accesses belonging to the same
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/polly/ |
| D | ScopBuilder.h | 29 /// 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 to parametric
355 /// Assume that all memory accesses are within bounds.
357 /// After we have built a model of all memory accesses, we need to assume
[all …]
|
| D | ScopInfo.h | 136 /// is modeled as if the following memory accesses occurred:
168 /// is modeled as if the accesses occurred this way:
199 /// llvm::Value is treated as a value escaping the SCoP. WRITE accesses
240 /// Memory accesses referencing this ScopArrayInfo object may use
242 /// stored is small enough to model accesses to the current element type as
251 /// available. This function is called when new memory accesses are added for
271 /// For indirect accesses return the origin SAI of the BP, else null.
388 /// For indirect accesses this is the SAI of the BP origin.
430 /// Represent memory accesses in statements.
480 /// The identifier is unique between all memory accesses belonging to the same
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/polly/ |
| D | ScopBuilder.h | 29 /// 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 to parametric
355 /// Assume that all memory accesses are within bounds.
357 /// After we have built a model of all memory accesses, we need to assume
[all …]
|
| D | ScopInfo.h | 136 /// is modeled as if the following memory accesses occurred:
168 /// is modeled as if the accesses occurred this way:
199 /// llvm::Value is treated as a value escaping the SCoP. WRITE accesses
240 /// Memory accesses referencing this ScopArrayInfo object may use
242 /// stored is small enough to model accesses to the current element type as
251 /// available. This function is called when new memory accesses are added for
271 /// For indirect accesses return the origin SAI of the BP, else null.
388 /// For indirect accesses this is the SAI of the BP origin.
430 /// Represent memory accesses in statements.
480 /// The identifier is unique between all memory accesses belonging to the same
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/polly/ |
| D | ScopBuilder.h | 29 /// 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 to parametric
355 /// Assume that all memory accesses are within bounds.
357 /// After we have built a model of all memory accesses, we need to assume
[all …]
|
| D | ScopInfo.h | 136 /// is modeled as if the following memory accesses occurred:
168 /// is modeled as if the accesses occurred this way:
199 /// llvm::Value is treated as a value escaping the SCoP. WRITE accesses
240 /// Memory accesses referencing this ScopArrayInfo object may use
242 /// stored is small enough to model accesses to the current element type as
251 /// available. This function is called when new memory accesses are added for
271 /// For indirect accesses return the origin SAI of the BP, else null.
388 /// For indirect accesses this is the SAI of the BP origin.
430 /// Represent memory accesses in statements.
480 /// The identifier is unique between all memory accesses belonging to the same
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/Analysis/ |
| H A D | LoopAccessAnalysis.h | 53 /// Checks memory dependences among accesses to the same underlying
63 /// on the program order of memory accesses to determine their safety.
64 /// At the moment we will only deem accesses as safe for:
85 /// * Zero distances and all accesses have the same size.
91 /// Set of potential dependent memory accesses.
183 /// Check whether the dependencies between the accesses are safe.
202 /// the accesses safely with.
249 /// Returns an empty ArrayRef if there are no accesses for the location.
251 auto I = Accesses.find({Ptr, IsWrite}); in getOrderForAccess()
252 if (I != Accesses.end()) in getOrderForAccess()
[all …]
|
| /aosp_15_r20/frameworks/base/core/java/android/app/ |
| H A D | AppOps.md | 173 App-ops track many important events, including all accesses to runtime permission protected
227 ### Tracking an app's own private data accesses
229 An app can register an `AppOpsManager.OnOpNotedCallback` to [get informed about what accesses the
232 that want to find unexpected private data accesses.
239 ##### Synchronous data accesses
282 indicating what code accesses what private data.
284 ##### Self data accesses
286 This is similar to the [synchronous data access](#synchronous-data-accesses) case only that the data
291 If an app takes above suggestion and collects stack traces for synchronous accesses self-accesses
294 ##### Async data accesses
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| H A D | LoopAccessAnalysis.h | 58 /// Checks memory dependences among accesses to the same underlying
68 /// on the program order of memory accesses to determine their safety.
69 /// At the moment we will only deem accesses as safe for:
90 /// * Zero distances and all accesses have the same size.
96 /// Set of potential dependent memory accesses.
186 Accesses[MemAccessInfo(Ptr, true)].push_back(AccessIdx); in addAccess()
195 Accesses[MemAccessInfo(Ptr, false)].push_back(AccessIdx); in addAccess()
200 /// Check whether the dependencies between the accesses are safe.
213 /// the accesses safely with.
268 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses; variable
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/llvm/Analysis/ |
| D | LoopAccessAnalysis.h | 59 /// Checks memory dependences among accesses to the same underlying
69 /// on the program order of memory accesses to determine their safety.
70 /// At the moment we will only deem accesses as safe for:
91 /// * Zero distances and all accesses have the same size.
97 /// Set of potential dependent memory accesses.
195 /// Check whether the dependencies between the accesses are safe.
259 /// Returns an empty ArrayRef if there are no accesses for the location.
261 auto I = Accesses.find({Ptr, IsWrite}); in getOrderForAccess()
262 if (I != Accesses.end()) in getOrderForAccess()
280 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses; variable
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/llvm/Analysis/ |
| D | LoopAccessAnalysis.h | 59 /// Checks memory dependences among accesses to the same underlying
69 /// on the program order of memory accesses to determine their safety.
70 /// At the moment we will only deem accesses as safe for:
91 /// * Zero distances and all accesses have the same size.
97 /// Set of potential dependent memory accesses.
195 /// Check whether the dependencies between the accesses are safe.
259 /// Returns an empty ArrayRef if there are no accesses for the location.
261 auto I = Accesses.find({Ptr, IsWrite}); in getOrderForAccess()
262 if (I != Accesses.end()) in getOrderForAccess()
280 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses; variable
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/llvm/Analysis/ |
| D | LoopAccessAnalysis.h | 59 /// Checks memory dependences among accesses to the same underlying
69 /// on the program order of memory accesses to determine their safety.
70 /// At the moment we will only deem accesses as safe for:
91 /// * Zero distances and all accesses have the same size.
97 /// Set of potential dependent memory accesses.
195 /// Check whether the dependencies between the accesses are safe.
259 /// Returns an empty ArrayRef if there are no accesses for the location.
261 auto I = Accesses.find({Ptr, IsWrite}); in getOrderForAccess()
262 if (I != Accesses.end()) in getOrderForAccess()
280 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses; variable
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/llvm/Analysis/ |
| D | LoopAccessAnalysis.h | 59 /// Checks memory dependences among accesses to the same underlying
69 /// on the program order of memory accesses to determine their safety.
70 /// At the moment we will only deem accesses as safe for:
91 /// * Zero distances and all accesses have the same size.
97 /// Set of potential dependent memory accesses.
195 /// Check whether the dependencies between the accesses are safe.
259 /// Returns an empty ArrayRef if there are no accesses for the location.
261 auto I = Accesses.find({Ptr, IsWrite}); in getOrderForAccess()
262 if (I != Accesses.end()) in getOrderForAccess()
280 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses; variable
[all …]
|
| /aosp_15_r20/external/pytorch/torch/csrc/jit/tensorexpr/ |
| H A D | registerizer.h | 41 loops with metavars we have a lot of accesses like this. */
45 /* Holds analysis information about accesses to a specific range of a
83 // Clone this AccessInfo, and set this as the new accesses' hiddenAccess.
189 // filtering accesses that wont save any loads or stores.
218 // Represents a scope block and holds all accesses contained within it.
262 // overlap with other accesses to the same buf. Buf ->
281 /* Analyzes the graph and collects accesses to the same symbolic tensor element
285 * accesses to the same symbolic element by scope and then merging lower scopes
288 * It is safe to move two accesses of the same Tensor element to a local scalar
295 * memory accesses.
[all …]
|
| /aosp_15_r20/external/pytorch/torch/cuda/ |
| H A D | _sanitizer.py | 5 It stores information on accesses to tensors to determine if they are synchronized
82 """Stores information about two unsynchronized accesses to one data pointer."""
148 r"""Stores information about a single tensor and recent accesses to it.
153 reads: list of read accesses to the tensor that were performed since
165 self.accesses: Dict[DataPtr, TensorInfo] = {}
168 if data_ptr not in self.accesses:
178 if data_ptr in self.accesses:
191 self.accesses[data_ptr] = TensorInfo(stack_trace)
194 del self.accesses[data_ptr]
197 return True if self.accesses[data_ptr].reads else False
[all …]
|
| /aosp_15_r20/external/llvm/include/llvm/Analysis/ |
| H A D | LoopAccessAnalysis.h | 90 /// \brief Checks memory dependences among accesses to the same underlying
100 /// on the program order of memory accesses to determine their safety.
101 /// At the moment we will only deem accesses as safe for:
122 /// * Zero distances and all accesses have the same size.
128 /// \brief Set of potential dependent memory accesses.
205 Accesses[MemAccessInfo(Ptr, true)].push_back(AccessIdx); in addAccess()
214 Accesses[MemAccessInfo(Ptr, false)].push_back(AccessIdx); in addAccess()
219 /// \brief Check whether the dependencies between the accesses are safe.
230 /// the accesses safely with.
278 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses; variable
[all …]
|