| /external/coreboot/src/vendorcode/cavium/include/bdk/libbdk-arch/ |
| 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 …]
|
| /external/coreboot/payloads/libpayload/include/arm64/arch/ |
| D | barrier.h | 44 * Memory barrier(mb) - Guarantees that all memory accesses specified before the
45 * barrier will happen before all memory accesses specified after the barrier
47 * Read memory barrier (rmb) - Guarantees that all read memory accesses
48 * specified before the barrier will happen before all read memory accesses
51 * Write memory barrier (wmb) - Guarantees that all write memory accesses
52 * specified before the barrier will happen before all write memory accesses
59 * Option Ordered accesses
|
| /external/linux-kselftest/tools/testing/selftests/bpf/progs/ |
| D | user_ringbuf_fail.c | 32 /* A callback that accesses a dynptr in a bpf_user_ringbuf_drain callback should
54 /* A callback that accesses a dynptr in a bpf_user_ringbuf_drain callback should
73 /* A callback that accesses a dynptr in a bpf_user_ringbuf_drain callback should
92 /* A callback that accesses a dynptr in a bpf_user_ringbuf_drain callback should
113 /* A callback that accesses a dynptr in a bpf_user_ringbuf_drain callback should
132 /* A callback that accesses a dynptr in a bpf_user_ringbuf_drain callback should
151 /* A callback that accesses a dynptr in a bpf_user_ringbuf_drain callback should
168 /* A callback that accesses a dynptr in a bpf_user_ringbuf_drain callback should
|
| /external/llvm/lib/Transforms/Utils/ |
| 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 …]
|
| /external/perfetto/src/trace_processor/perfetto_sql/stdlib/wattson/ |
| D | arm_dsu.sql | 16 -- Converts event counter from count to rate (num of accesses per ns).
28 -- Rate of event accesses in a section (i.e. count / dur).
40 -- accesses in a given duration can be calculated by multiplying the appropriate
49 -- The rate of L3 accesses for each time slice based on the ARM DSU PMU
50 -- counter's l3d_cache event. Units will be in number of DDR accesses per ns.
51 -- The number of accesses in a given duration can be calculated by multiplying
|
| /external/pytorch/torch/csrc/jit/tensorexpr/ |
| 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 …]
|
| D | bounds_inference.h | 59 // Returns true if there is a conflicting overlap between accesses in
60 // statements A and B. A conflicting overlap is an overlap in buffer accesses
61 // where at least one of the accesses is a Store.
66 // Same as above, between accesses in stores S1 and S2.
71 // Same as above, between accesses in store S and load L.
|
| D | mem_dependency_checker.h | 34 * connected accesses in the dependency graph.
109 // ie. this access is present in the dependencies map of all accesses that are
147 // Helpers for dumping accesses in various formats.
168 * accesses contained within.
243 // completeness but be aware it wont return accesses used in the computation
248 // Accesses relating to input and output buffers.
274 // An internal struct holding the accesses found within a scope Block.
300 // Finds all accesses that are reads within the scope of v.
315 // Look for and insert accesses belonging to all nodes that act like in getAllReadsWithin()
323 // Finds all accesses that are writes within the scope of v.
[all …]
|
| /external/coreboot/payloads/libpayload/include/arm/arch/ |
| D | barrier.h | 44 * Memory barrier(mb) - Guarantees that all memory accesses specified before the
45 * barrier will happen before all memory accesses specified after the barrier
47 * Read memory barrier (rmb) - Guarantees that all read memory accesses
48 * specified before the barrier will happen before all read memory accesses
51 * Write memory barrier (wmb) - Guarantees that all write memory accesses
52 * specified before the barrier will happen before all write memory accesses
|
| /external/pytorch/torch/cuda/ |
| 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 …]
|
| /external/gemmlowp/standalone/ |
| D | cache_counters.cc | 143 void Workload(int accesses, int size, std::uint8_t* buf) { in Workload() argument
186 "subs %w[accesses], %w[accesses], #1\n" in Workload()
188 : [ accesses ] "+r"(accesses), [ dummy ] "+r"(dummy) in Workload()
193 void MeasureCacheCounts(int accesses, int size, std::uint8_t* buf, in MeasureCacheCounts() argument
227 Workload(accesses, size, buf); in MeasureCacheCounts()
242 // How many accesses were recorded, total? The other fields must sum to that.
244 // How many accesses were serviced with the typical cost of a L1 cache hit?
246 // How many accesses were serviced with the typical cost of a L2 cache hit?
248 // How many accesses were serviced with the typical cost of a L3 cache hit?
250 // How many accesses were serviced with the typical cost of a DRAM access?
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/Analysis/ |
| 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 …]
|
| /external/kernel-headers/original/uapi/asm-arm/asm/ |
| D | byteorder.h | 6 * that byte accesses appear as:
8 * and word accesses (data or instruction) appear as:
11 * When in big endian mode, byte accesses appear as:
13 * and word accesses (data or instruction) appear as:
|
| D | swab.h | 6 * that byte accesses appear as:
8 * and word accesses (data or instruction) appear as:
11 * When in big endian mode, byte accesses appear as:
13 * and word accesses (data or instruction) appear as:
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| 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 …]
|
| /external/cronet/stable/base/timer/ |
| D | timer.cc | 59 // No more member accesses here: |this| could be deleted after Stop() call. in Stop()
137 // No more member accesses here: |this| could be deleted at this point. in OnScheduledTaskInvoked()
164 // No more member accesses here: |this| could be deleted after freeing in OnStop()
175 // No more member accesses here: |this| could be deleted at this point. in RunUserTask()
214 // No more member accesses here: |this| could be deleted at this point. in RunUserTask()
253 // No more member accesses here: |this| could be deleted at this point. in RunUserTask()
276 // No more member accesses here: |this| could be deleted after freeing in OnStop()
302 // No more member accesses here: |this| could be deleted at this point. in OnScheduledTaskInvoked()
332 // No more member accesses here: |this| could be deleted after freeing in OnStop()
371 // No more member accesses here: |this| could be deleted at this point. in OnScheduledTaskInvoked()
|
| /external/cronet/tot/base/timer/ |
| D | timer.cc | 59 // No more member accesses here: |this| could be deleted after Stop() call. in Stop()
137 // No more member accesses here: |this| could be deleted at this point. in OnScheduledTaskInvoked()
164 // No more member accesses here: |this| could be deleted after freeing in OnStop()
175 // No more member accesses here: |this| could be deleted at this point. in RunUserTask()
214 // No more member accesses here: |this| could be deleted at this point. in RunUserTask()
253 // No more member accesses here: |this| could be deleted at this point. in RunUserTask()
276 // No more member accesses here: |this| could be deleted after freeing in OnStop()
302 // No more member accesses here: |this| could be deleted at this point. in OnScheduledTaskInvoked()
332 // No more member accesses here: |this| could be deleted after freeing in OnStop()
371 // No more member accesses here: |this| could be deleted at this point. in OnScheduledTaskInvoked()
|
| /external/llvm/lib/Analysis/ |
| 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 …]
|
| /external/compiler-rt/lib/tsan/rtl/ |
| D | tsan_flags.inc | 42 "Report races between atomic and plain memory accesses.")
66 "Per-thread history size, controls how many previous memory accesses "
68 "history_size=0 amounts to 32K memory accesses. Each next value doubles "
69 "the amount of memory accesses, up to history_size=7 that amounts to "
70 "4M memory accesses. The default value is 2 (128K memory accesses).")
|
| /external/llvm/include/llvm/Analysis/ |
| 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 …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| 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 …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Analysis/ |
| 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 …]
|
| /external/mesa3d/src/compiler/nir/ |
| D | nir_lower_non_uniform_access.c | 64 struct hash_table *accesses; member
159 /* Avoid moving accesses below their first use. */ in add_non_uniform_instr()
182 struct hash_entry *entry = _mesa_hash_table_search(state->accesses, &key); in add_non_uniform_instr()
184 struct nu_handle_data *data = ralloc(state->accesses, struct nu_handle_data); in add_non_uniform_instr()
189 util_dynarray_init(&data->srcs, state->accesses); in add_non_uniform_instr()
191 struct nu_handle_key *key_copy = ralloc(state->accesses, struct nu_handle_key); in add_non_uniform_instr()
194 entry = _mesa_hash_table_insert(state->accesses, key_copy, data); in add_non_uniform_instr()
302 .accesses = nu_handle_key_table_create(NULL), in nir_lower_non_uniform_access_impl()
412 hash_table_foreach(state.accesses, entry) { in nir_lower_non_uniform_access_impl()
452 _mesa_hash_table_destroy(state.accesses, NULL); in nir_lower_non_uniform_access_impl()
|
| /external/rust/android-crates-io/crates/pin-project-lite/tests/ui/pin_project/ |
| D | packed.stderr | 12 …ructs are only aligned by one byte, and many modern architectures penalize unaligned field accesses
28 …ructs are only aligned by one byte, and many modern architectures penalize unaligned field accesses
44 …ructs are only aligned by one byte, and many modern architectures penalize unaligned field accesses
60 …ructs are only aligned by one byte, and many modern architectures penalize unaligned field accesses
76 …ructs are only aligned by one byte, and many modern architectures penalize unaligned field accesses
92 …ructs are only aligned by one byte, and many modern architectures penalize unaligned field accesses
|
| /external/pytorch/torch/csrc/api/include/torch/data/datasets/ |
| D | shared.h | 45 /// Accesses the underlying dataset.
50 /// Accesses the underlying dataset.
55 /// Accesses the underlying dataset.
60 /// Accesses the underlying dataset.
|