| /art/runtime/ |
| D | barrier_test.cc | 30 CheckWaitTask(Barrier* barrier, AtomicInteger* count1, AtomicInteger* count2) in CheckWaitTask() argument
31 : barrier_(barrier), in CheckWaitTask()
64 Barrier barrier(num_threads + 1); // One extra Wait() in main thread. in TEST_F() local
69 thread_pool.AddTask(self, new CheckWaitTask(&barrier, &count1, &count2)); in TEST_F()
78 barrier.Wait(self); in TEST_F()
89 CheckPassTask(Barrier* barrier, AtomicInteger* count, size_t subtasks) in CheckPassTask() argument
90 : barrier_(barrier), in CheckPassTask()
115 Barrier barrier(0); in TEST_F() local
120 thread_pool.AddTask(self, new CheckPassTask(&barrier, &count, num_sub_tasks)); in TEST_F()
125 barrier.Increment(self, expected_total_tasks); in TEST_F()
|
| D | thread_list.cc | 400 Barrier* barrier = empty_checkpoint_barrier_.get(); in RunEmptyCheckpoint() local
401 barrier->Init(self, 0); in RunEmptyCheckpoint()
450 bool timed_out = barrier->Increment(self, barrier_count, kEmptyCheckpointPeriodicTimeoutMs); in RunEmptyCheckpoint()
459 ss << "Barrier count " << barrier->GetCount(self) << "\n"; in RunEmptyCheckpoint()
|
| D | Android.bp | 32 "barrier.cc",
|
| /art/test/033-class-init-deadlock/src/ |
| D | Main.java | 28 public static CyclicBarrier barrier = new CyclicBarrier(3); field in Main
40 try { barrier.await(); } catch (Exception e) { System.out.println(e); } in main()
56 try { Main.barrier.await(); } catch (Exception e) { System.out.println(e); } in Main.barrier.await()
66 try { Main.barrier.await(); } catch (Exception e) { System.out.println(e); } in Main.barrier.await()
|
| /art/test/658-fp-read-barrier/ |
| D | info.txt | 1 Regression test for the read barrier implementation in ARM64,
|
| /art/test/102-concurrent-gc/ |
| D | info.txt | 2 concurrent GC should locate the "hidden" objects through a write-barrier.
|
| /art/test/572-checker-array-get-regression/ |
| D | info.txt | 1 Regression test for the ARM64 Baker's read barrier fast path compiler
|
| /art/test/573-checker-checkcast-regression/ |
| D | info.txt | 1 Regression test for the x86-64 Baker's read barrier fast path compiler
|
| /art/test/952-invoke-custom/generator/ |
| D | TestInvokeCustomWithConcurrentThreads.java | 56 private static final CyclicBarrier barrier = new CyclicBarrier(NUMBER_OF_THREADS); field in TestInvokeCustomWithConcurrentThreads
105 barrier.await(); in linkerMethod()
|
| /art/test/708-jit-cache-churn/src/ |
| D | JitCacheChurnTest.java | 93 private static CyclicBarrier barrier = new CyclicBarrier(CONCURRENCY); field in JitCacheChurnTest.BaseTask
96 barrier.await(); in call()
|
| /art/tools/cpp-define-generator/ |
| D | offsets_all.def | 44 // TODO: MIRROR_OBJECT_HEADER_SIZE (depends on #ifdef read barrier)
|
| /art/runtime/openjdkjvmti/ |
| D | ti_stack.cc | 304 : barrier(0), stop_input(stop), data(data_) {} in GetAllStackTracesVectorClosure()
311 barrier.Pass(self); in Run()
335 art::Barrier barrier; member
349 closure.barrier.Increment(self, barrier_count); in RunCheckpointAndWait()
|
| /art/runtime/jit/ |
| D | jit_code_cache.cc | 909 MarkCodeClosure(JitCodeCache* code_cache, Barrier* barrier) in MarkCodeClosure() argument
910 : code_cache_(code_cache), barrier_(barrier) {} in MarkCodeClosure()
984 Barrier barrier(0); in MarkCompiledCodeOnThreadStacks() local
986 MarkCodeClosure closure(this, &barrier); in MarkCompiledCodeOnThreadStacks()
992 barrier.Increment(self, threads_running_checkpoint); in MarkCompiledCodeOnThreadStacks()
|
| /art/runtime/arch/arm/ |
| D | quick_entrypoints_arm.S | 681 @ unlocked case - r1: original lock word that's zero except for the read barrier bits.
682 … r2, r1, r2 @ r2 holds thread id with count of 0 with preserved read barrier bits
685 dmb ish @ full (LoadLoad|LoadStore) memory barrier
687 .Lnot_unlocked: @ r1: original lock word, r2: thread_id with count of 0 and zero read barrier bits
753 dmb ish @ full (LoadStore|StoreStore) memory barrier
757 strex r2, r3, [r0, #MIRROR_OBJECT_LOCK_WORD_OFFSET] @ strex necessary for read barrier bits
766 strex r2, r1, [r0, #MIRROR_OBJECT_LOCK_WORD_OFFSET] @ strex necessary for read barrier bits
|
| /art/runtime/arch/mips64/ |
| D | quick_entrypoints_mips64.S | 1233 # Unlocked case - $t1: original lock word that's zero except for the read barrier bits.
1234 …t2, $t1, $t0 # $t2 holds thread id with count of 0 with preserved read barrier bits
1237 sync # full (LoadLoad|LoadStore) memory barrier
1240 # $t1: original lock word, $t0: thread_id with count of 0 and zero read barrier bits
1300 sync # full (LoadStore|StoreStore) memory barrier
1709 # This barrier is only necessary when the allocation also requires a class initialization check.
1712 # from publishing by the compiler which inserts its own StoreStore barrier.
|
| /art/compiler/optimizing/ |
| D | graph_visualizer.cc | 385 void VisitMemoryBarrier(HMemoryBarrier* barrier) OVERRIDE { in VisitMemoryBarrier() argument
386 StartAttributeStream("kind") << barrier->GetBarrierKind(); in VisitMemoryBarrier()
|
| /art/runtime/arch/mips/ |
| D | quick_entrypoints_mips.S | 1262 # Unlocked case - $t1: original lock word that's zero except for the read barrier bits.
1263 …t2, $t1, $t0 # $t2 holds thread id with count of 0 with preserved read barrier bits
1268 sync # full (LoadLoad|LoadStore) memory barrier
1270 # $t1: original lock word, $t0: thread_id with count of 0 and zero read barrier bits
1331 sync # full (LoadStore|StoreStore) memory barrier
1761 # This barrier is only necessary when the allocation also requires a class initialization check.
1764 # from publishing by the compiler which inserts its own StoreStore barrier.
|
| /art/runtime/gc/ |
| D | heap.cc | 1293 explicit TrimIndirectReferenceTableClosure(Barrier* barrier) : barrier_(barrier) { in TrimIndirectReferenceTableClosure() argument
1313 Barrier barrier(0); in TrimIndirectReferenceTables() local
1314 TrimIndirectReferenceTableClosure closure(&barrier); in TrimIndirectReferenceTables()
1318 barrier.Increment(self, barrier_count); in TrimIndirectReferenceTables()
|