blob: 66ee8709a784df685d4dcec7d89feab2a1d33fd2 [file] [log] [blame]
Elliott Hughes76b61672012-12-12 17:47:30 -08001/*
2 * Copyright (C) 2012 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
Mathieu Chartier858f1c52012-10-17 17:45:55 -070017#include "barrier.h"
Elliott Hughes76b61672012-12-12 17:47:30 -080018
19#include "base/mutex.h"
Mathieu Chartier858f1c52012-10-17 17:45:55 -070020#include "thread.h"
21
22namespace art {
23
Mathieu Chartier35883cc2012-11-13 14:08:12 -080024Barrier::Barrier(int count)
25 : count_(count),
Ian Rogers8409ec42014-11-04 17:57:02 -080026 lock_("GC barrier lock", kThreadSuspendCountLock),
Mathieu Chartier858f1c52012-10-17 17:45:55 -070027 condition_("GC barrier condition", lock_) {
28}
29
30void Barrier::Pass(Thread* self) {
31 MutexLock mu(self, lock_);
32 SetCountLocked(self, count_ - 1);
33}
34
35void Barrier::Wait(Thread* self) {
36 Increment(self, -1);
37}
38
39void Barrier::Init(Thread* self, int count) {
40 MutexLock mu(self, lock_);
41 SetCountLocked(self, count);
42}
43
44void Barrier::Increment(Thread* self, int delta) {
45 MutexLock mu(self, lock_);
46 SetCountLocked(self, count_ + delta);
Dave Allison0aded082013-11-07 13:15:11 -080047
48 // Increment the count. If it becomes zero after the increment
49 // then all the threads have already passed the barrier. If
50 // it is non-zero then there is still one or more threads
51 // that have not yet called the Pass function. When the
52 // Pass function is called by the last thread, the count will
53 // be decremented to zero and a Broadcast will be made on the
54 // condition variable, thus waking this up.
Hans Boehm5567c112014-12-02 18:31:31 -080055 while (count_ != 0) {
Mathieu Chartier858f1c52012-10-17 17:45:55 -070056 condition_.Wait(self);
57 }
58}
59
Ian Rogers7b078e82014-09-10 14:44:24 -070060bool Barrier::Increment(Thread* self, int delta, uint32_t timeout_ms) {
Dave Allison0aded082013-11-07 13:15:11 -080061 MutexLock mu(self, lock_);
62 SetCountLocked(self, count_ + delta);
Ian Rogers7b078e82014-09-10 14:44:24 -070063 bool timed_out = false;
Dave Allison0aded082013-11-07 13:15:11 -080064 if (count_ != 0) {
Hans Boehm5567c112014-12-02 18:31:31 -080065 uint32_t timeout_ns = 0;
66 uint64_t abs_timeout = NanoTime() + MsToNs(timeout_ms);
67 for (;;) {
68 timed_out = condition_.TimedWait(self, timeout_ms, timeout_ns);
69 if (timed_out || count_ == 0) return timed_out;
70 // Compute time remaining on timeout.
71 uint64_t now = NanoTime();
72 int64_t time_left = abs_timeout - now;
73 if (time_left <= 0) return true;
74 timeout_ns = time_left % (1000*1000);
75 timeout_ms = time_left / (1000*1000);
76 }
Dave Allison0aded082013-11-07 13:15:11 -080077 }
Ian Rogers7b078e82014-09-10 14:44:24 -070078 return timed_out;
Dave Allison0aded082013-11-07 13:15:11 -080079}
80
Mathieu Chartier858f1c52012-10-17 17:45:55 -070081void Barrier::SetCountLocked(Thread* self, int count) {
82 count_ = count;
Ian Rogers7b078e82014-09-10 14:44:24 -070083 if (count == 0) {
Mathieu Chartier858f1c52012-10-17 17:45:55 -070084 condition_.Broadcast(self);
85 }
86}
87
88Barrier::~Barrier() {
Ian Rogers5bd97c42012-11-27 02:38:26 -080089 CHECK(!count_) << "Attempted to destroy barrier with non zero count";
Mathieu Chartier858f1c52012-10-17 17:45:55 -070090}
91
Brian Carlstrom0cd7ec22013-07-17 23:40:20 -070092} // namespace art