Searched defs:barrier (Results 1 - 8 of 8) sorted by relevance

/art/test/033-class-init-deadlock/src/
H A DMain.java28 public static CyclicBarrier barrier = new CyclicBarrier(3); field in class:Main
40 try { barrier.await(); } catch (Exception e) { System.out.println(e); }
56 try { Main.barrier.await(); } catch (Exception e) { System.out.println(e); }
66 try { Main.barrier.await(); } catch (Exception e) { System.out.println(e); }
/art/test/952-invoke-custom/src/
H A DTestInvokeCustomWithConcurrentThreads.java49 // Synchronization barrier all threads will wait on in the bootstrap method.
50 private static final CyclicBarrier barrier = new CyclicBarrier(NUMBER_OF_THREADS); field in class:TestInvokeCustomWithConcurrentThreads
99 barrier.await();
/art/runtime/
H A Dbarrier_test.cc17 #include "barrier.h"
30 CheckWaitTask(Barrier* barrier, AtomicInteger* count1, AtomicInteger* count2) argument
31 : barrier_(barrier),
36 LOG(INFO) << "Before barrier" << *self;
40 LOG(INFO) << "After barrier" << *self;
60 // Check that barrier wait and barrier increment work.
64 Barrier barrier(num_threads + 1); // One extra Wait() in main thread.
69 thread_pool.AddTask(self, new CheckWaitTask(&barrier, &count1, &count2));
75 // Count 2 should still be zero since no thread should have gone past the barrier
89 CheckPassTask(Barrier* barrier, AtomicInteger* count, size_t subtasks) argument
[all...]
H A Dthread_list.cc246 // The barrier to be passed through and for the requestor to wait upon.
411 Barrier* barrier = empty_checkpoint_barrier_.get(); local
412 barrier->Init(self, 0);
420 // This thread will run an empty checkpoint (decrement the empty checkpoint barrier)
460 first_iter = false; // Don't add to the barrier count from the second iteration on.
461 bool timed_out = barrier->Increment(self, barrier_count, kEmptyCheckpointPeriodicTimeoutMs);
470 ss << "Barrier count " << barrier->GetCount(self) << "\n";
718 // The atomic counter for number of threads that need to pass the barrier.
756 // Wait for the barrier to be passed by all runnable threads. This wait
/art/test/708-jit-cache-churn/src/
H A DJitCacheChurnTest.java93 private static CyclicBarrier barrier = new CyclicBarrier(CONCURRENCY); field in class:JitCacheChurnTest.BaseTask
96 barrier.await();
/art/openjdkjvmti/
H A Dti_stack.cc43 #include "barrier.h"
288 : barrier(0), stop_input(stop), data(data_) {}
295 barrier.Pass(self);
319 art::Barrier barrier; member in struct:openjdkjvmti::GetAllStackTracesVectorClosure
333 closure.barrier.Increment(self, barrier_count);
/art/runtime/jit/
H A Djit_code_cache.cc511 // This does not need a read barrier because this is called by GC.
516 // This does not need a read barrier because this is called by GC.
540 // This does not need a read barrier because this is called by GC.
711 // Don't do any read barrier, as the declaring class of `method` may
843 // We also need a TLB shootdown to act as memory barrier across cores.
1105 MarkCodeClosure(JitCodeCache* code_cache, Barrier* barrier) argument
1106 : code_cache_(code_cache), barrier_(barrier) {}
1178 Barrier barrier(0);
1180 MarkCodeClosure closure(this, &barrier);
1186 barrier
[all...]
/art/runtime/gc/
H A Dheap.cc1290 explicit TrimIndirectReferenceTableClosure(Barrier* barrier) : barrier_(barrier) { argument
1310 Barrier barrier(0);
1311 TrimIndirectReferenceTableClosure closure(&barrier);
1315 barrier.Increment(self, barrier_count);

Completed in 8036 milliseconds