| /art/runtime/native/ |
| java_lang_System.cc | 35 * We make guarantees about the atomicity of accesses to primitive variables. These guarantees
36 * also apply to elements of arrays. In particular, 8-bit, 16-bit, and 32-bit accesses must not
37 * cause "word tearing". Accesses to 64-bit array elements may be two 32-bit operations.
|
| /dalvik/docs/ |
| verifier.html | 181 optimizer, which will convert many field/method/class accesses into a
182 simpler form after performing the access check. However, not all accesses
183 can be optimized (e.g. accesses to classes unknown at dexopt time),
|
| /frameworks/base/core/java/android/util/ |
| LruCache.java | 375 int accesses = hitCount + missCount; local
376 int hitPercent = accesses != 0 ? (100 * hitCount / accesses) : 0;
|
| /frameworks/layoutlib/bridge/src/android/util/ |
| LruCache.java | 386 int accesses = hitCount + missCount; local
387 int hitPercent = accesses != 0 ? (100 * hitCount / accesses) : 0;
|
| /frameworks/support/collection/src/main/java/androidx/collection/ |
| LruCache.java | 339 int accesses = hitCount + missCount; local
340 int hitPercent = accesses != 0 ? (100 * hitCount / accesses) : 0;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| MemorySSA.h | 127 // \brief The base for all memory accesses. All memory accesses in a block are
285 /// \brief Represents read-only accesses to memory
394 /// \brief Represents phi nodes for memory accesses.
572 /// accesses.
629 /// \brief Given two memory accesses in the same basic block, determine
633 /// \brief Given two memory accesses in potentially different blocks,
833 /// disambiguate memory accesses, or they may want the nearest dominating
845 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| MemorySSA.h | 128 // \brief The base for all memory accesses. All memory accesses in a block are
284 /// \brief Represents read-only accesses to memory
391 /// \brief Represents phi nodes for memory accesses.
605 /// accesses.
662 /// \brief Given two memory accesses in the same basic block, determine
666 /// \brief Given two memory accesses in potentially different blocks,
866 /// disambiguate memory accesses, or they may want the nearest dominating
878 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| MemorySSA.h | 128 // \brief The base for all memory accesses. All memory accesses in a block are
284 /// \brief Represents read-only accesses to memory
391 /// \brief Represents phi nodes for memory accesses.
605 /// accesses.
662 /// \brief Given two memory accesses in the same basic block, determine
666 /// \brief Given two memory accesses in potentially different blocks,
866 /// disambiguate memory accesses, or they may want the nearest dominating
878 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| MemorySSA.h | 132 // \brief The base for all memory accesses. All memory accesses in a block are
290 /// \brief Represents read-only accesses to memory
399 /// \brief Represents phi nodes for memory accesses.
611 /// accesses.
668 /// \brief Given two memory accesses in the same basic block, determine
672 /// \brief Given two memory accesses in potentially different blocks,
878 /// disambiguate memory accesses, or they may want the nearest dominating
890 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| MemorySSA.h | 132 // \brief The base for all memory accesses. All memory accesses in a block are
290 /// \brief Represents read-only accesses to memory
399 /// \brief Represents phi nodes for memory accesses.
611 /// accesses.
668 /// \brief Given two memory accesses in the same basic block, determine
672 /// \brief Given two memory accesses in potentially different blocks,
878 /// disambiguate memory accesses, or they may want the nearest dominating
890 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| MemorySSA.h | 132 // \brief The base for all memory accesses. All memory accesses in a block are
290 /// \brief Represents read-only accesses to memory
399 /// \brief Represents phi nodes for memory accesses.
611 /// accesses.
668 /// \brief Given two memory accesses in the same basic block, determine
672 /// \brief Given two memory accesses in potentially different blocks,
878 /// disambiguate memory accesses, or they may want the nearest dominating
890 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| MemorySSA.h | 132 // \brief The base for all memory accesses. All memory accesses in a block are
290 /// \brief Represents read-only accesses to memory
399 /// \brief Represents phi nodes for memory accesses.
611 /// accesses.
668 /// \brief Given two memory accesses in the same basic block, determine
672 /// \brief Given two memory accesses in potentially different blocks,
878 /// disambiguate memory accesses, or they may want the nearest dominating
890 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| MemorySSA.h | 127 // \brief The base for all memory accesses. All memory accesses in a block are
285 /// \brief Represents read-only accesses to memory
394 /// \brief Represents phi nodes for memory accesses.
572 /// accesses.
629 /// \brief Given two memory accesses in the same basic block, determine
633 /// \brief Given two memory accesses in potentially different blocks,
833 /// disambiguate memory accesses, or they may want the nearest dominating
845 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| MemorySSA.h | 128 // \brief The base for all memory accesses. All memory accesses in a block are
284 /// \brief Represents read-only accesses to memory
391 /// \brief Represents phi nodes for memory accesses.
605 /// accesses.
662 /// \brief Given two memory accesses in the same basic block, determine
666 /// \brief Given two memory accesses in potentially different blocks,
866 /// disambiguate memory accesses, or they may want the nearest dominating
878 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| MemorySSA.h | 128 // \brief The base for all memory accesses. All memory accesses in a block are
284 /// \brief Represents read-only accesses to memory
391 /// \brief Represents phi nodes for memory accesses.
605 /// accesses.
662 /// \brief Given two memory accesses in the same basic block, determine
666 /// \brief Given two memory accesses in potentially different blocks,
866 /// disambiguate memory accesses, or they may want the nearest dominating
878 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| MemorySSA.h | 132 // \brief The base for all memory accesses. All memory accesses in a block are
290 /// \brief Represents read-only accesses to memory
399 /// \brief Represents phi nodes for memory accesses.
611 /// accesses.
668 /// \brief Given two memory accesses in the same basic block, determine
672 /// \brief Given two memory accesses in potentially different blocks,
878 /// disambiguate memory accesses, or they may want the nearest dominating
890 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| MemorySSA.h | 132 // \brief The base for all memory accesses. All memory accesses in a block are
290 /// \brief Represents read-only accesses to memory
399 /// \brief Represents phi nodes for memory accesses.
611 /// accesses.
668 /// \brief Given two memory accesses in the same basic block, determine
672 /// \brief Given two memory accesses in potentially different blocks,
878 /// disambiguate memory accesses, or they may want the nearest dominating
890 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| MemorySSA.h | 132 // \brief The base for all memory accesses. All memory accesses in a block are
290 /// \brief Represents read-only accesses to memory
399 /// \brief Represents phi nodes for memory accesses.
611 /// accesses.
668 /// \brief Given two memory accesses in the same basic block, determine
672 /// \brief Given two memory accesses in potentially different blocks,
878 /// disambiguate memory accesses, or they may want the nearest dominating
890 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| MemorySSA.h | 132 // \brief The base for all memory accesses. All memory accesses in a block are
290 /// \brief Represents read-only accesses to memory
399 /// \brief Represents phi nodes for memory accesses.
611 /// accesses.
668 /// \brief Given two memory accesses in the same basic block, determine
672 /// \brief Given two memory accesses in potentially different blocks,
878 /// disambiguate memory accesses, or they may want the nearest dominating
890 /// the instruction accesses (by skipping any def which AA can prove does not
[all...] |
| /external/valgrind/drd/docs/ |
| drd-manual.xml | 57 accesses via locking. E.g. the POSIX threads library, the Qt library
157 Which source code statements generate which memory accesses depends on
269 conflicting memory accesses are ordered by synchronization
287 many conflicting memory accesses in such applications and although such
295 algorithm is to verify whether all shared memory accesses follow a consistent
297 whether all interthread memory accesses are ordered by synchronization
692 There are always at least two memory accesses involved in a data
693 race. Memory accesses involved in a data race are called
694 <emphasis>conflicting memory accesses</emphasis>. DRD prints a
783 A conflicting access involves at least two memory accesses. Fo
[all...] |
| /external/valgrind/docs/html/ |
| hg-manual.html | 346 usually able to show both accesses involved in a race. At least
382 constraints upon the order in which memory accesses can
455 accesses to memory locations. If a location -- in this example,
458 two accesses are ordered by the happens-before relation. If so,
476 <p>What does it mean to say that two accesses from different
479 cause those accesses to happen in a particular order, irrespective of
487 immediately) locked by thread T2, then the memory accesses in T1
495 on the same CV, then the memory accesses in T1 prior to the
515 That is, all memory accesses performed by the parent prior to
516 creating the child are regarded as happening-before all the accesses
[all...] |
| /art/compiler/optimizing/ |
| load_store_analysis.h | 273 // accesses are given different indexes. This find function also
507 // We intentionally don't collect HUnresolvedInstanceField/HUnresolvedStaticField accesses
554 ArenaVector<ReferenceInfo*> ref_info_array_; // All references used for heap accesses.
559 bool has_volatile_; // If there are volatile field accesses.
|
| /art/test/110-field-access/src/ |
| Main.java | 18 * Test code generation for field accesses, based on libcore's FieldAccessBenchmark.
|
| /cts/hostsidetests/appsecurity/test-apps/UsePermissionDiffCert/src/com/android/cts/usespermissiondiffcertapp/ |
| ModifyInstallerPackageTest.java | 34 * Accesses app cts/tests/appsecurity-tests/test-apps/PermissionDeclareApp/...
|
| /developers/build/prebuilts/gradle/RuntimePermissions/Application/src/main/res/values/ |
| strings.xml | 39 Clicking \"Show first contact\" accesses the contact database to display the name of the first contact.</string>
|
