| /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 | 391 Barrier* barrier = empty_checkpoint_barrier_.get(); in RunEmptyCheckpoint() local
392 barrier->Init(self, 0); in RunEmptyCheckpoint()
441 bool timed_out = barrier->Increment(self, barrier_count, kEmptyCheckpointPeriodicTimeoutMs); in RunEmptyCheckpoint()
450 ss << "Barrier count " << barrier->GetCount(self) << "\n"; in RunEmptyCheckpoint()
|
| D | Android.bp | 31 "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/tools/cpp-define-generator/ |
| D | offsets_all.def | 44 // TODO: MIRROR_OBJECT_HEADER_SIZE (depends on #ifdef read barrier)
|
| /art/runtime/jit/ |
| D | jit_code_cache.cc | 839 MarkCodeClosure(JitCodeCache* code_cache, Barrier* barrier) in MarkCodeClosure() argument
840 : code_cache_(code_cache), barrier_(barrier) {} in MarkCodeClosure()
914 Barrier barrier(0); in MarkCompiledCodeOnThreadStacks() local
916 MarkCodeClosure closure(this, &barrier); in MarkCompiledCodeOnThreadStacks()
922 barrier.Increment(self, threads_running_checkpoint); in MarkCompiledCodeOnThreadStacks()
|
| /art/runtime/arch/arm/ |
| D | quick_entrypoints_arm.S | 651 @ unlocked case - r1: original lock word that's zero except for the read barrier bits.
652 … r2, r1, r2 @ r2 holds thread id with count of 0 with preserved read barrier bits
655 dmb ish @ full (LoadLoad|LoadStore) memory barrier
657 .Lnot_unlocked: @ r1: original lock word, r2: thread_id with count of 0 and zero read barrier bits
721 dmb ish @ full (LoadStore|StoreStore) memory barrier
725 strex r2, r3, [r0, #MIRROR_OBJECT_LOCK_WORD_OFFSET] @ strex necessary for read barrier bits
734 strex r2, r1, [r0, #MIRROR_OBJECT_LOCK_WORD_OFFSET] @ strex necessary for read barrier bits
|
| /art/compiler/optimizing/ |
| D | graph_visualizer.cc | 377 void VisitMemoryBarrier(HMemoryBarrier* barrier) OVERRIDE { in VisitMemoryBarrier() argument
378 StartAttributeStream("kind") << barrier->GetBarrierKind(); in VisitMemoryBarrier()
|
| D | inliner.cc | 1504 HMemoryBarrier* barrier = new (graph_->GetArena()) HMemoryBarrier(kStoreStore, kNoDexPc); in TryPatternSubstitution() local
1505 invoke_instruction->GetBlock()->InsertInstructionBefore(barrier, invoke_instruction); in TryPatternSubstitution()
|
| /art/runtime/gc/ |
| D | heap.cc | 1380 explicit TrimIndirectReferenceTableClosure(Barrier* barrier) : barrier_(barrier) { in TrimIndirectReferenceTableClosure() argument
1400 Barrier barrier(0); in TrimIndirectReferenceTables() local
1401 TrimIndirectReferenceTableClosure closure(&barrier); in TrimIndirectReferenceTables()
1405 barrier.Increment(self, barrier_count); in TrimIndirectReferenceTables()
|