blob: d21f551209911d11ebdeb5988143b3ca25a58064 [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"
Vladimir Marko80afd022015-05-19 18:08:00 +010020#include "base/time_utils.h"
Mathieu Chartier858f1c52012-10-17 17:45:55 -070021#include "thread.h"
22
23namespace art {
24
Mathieu Chartier35883cc2012-11-13 14:08:12 -080025Barrier::Barrier(int count)
26 : count_(count),
Ian Rogers8409ec42014-11-04 17:57:02 -080027 lock_("GC barrier lock", kThreadSuspendCountLock),
Mathieu Chartier858f1c52012-10-17 17:45:55 -070028 condition_("GC barrier condition", lock_) {
29}
30
31void Barrier::Pass(Thread* self) {
32 MutexLock mu(self, lock_);
33 SetCountLocked(self, count_ - 1);
34}
35
36void Barrier::Wait(Thread* self) {
37 Increment(self, -1);
38}
39
40void Barrier::Init(Thread* self, int count) {
41 MutexLock mu(self, lock_);
42 SetCountLocked(self, count);
43}
44
45void Barrier::Increment(Thread* self, int delta) {
46 MutexLock mu(self, lock_);
47 SetCountLocked(self, count_ + delta);
Dave Allison0aded082013-11-07 13:15:11 -080048
49 // Increment the count. If it becomes zero after the increment
50 // then all the threads have already passed the barrier. If
51 // it is non-zero then there is still one or more threads
52 // that have not yet called the Pass function. When the
53 // Pass function is called by the last thread, the count will
54 // be decremented to zero and a Broadcast will be made on the
55 // condition variable, thus waking this up.
Hans Boehm5567c112014-12-02 18:31:31 -080056 while (count_ != 0) {
Mathieu Chartier858f1c52012-10-17 17:45:55 -070057 condition_.Wait(self);
58 }
59}
60
Ian Rogers7b078e82014-09-10 14:44:24 -070061bool Barrier::Increment(Thread* self, int delta, uint32_t timeout_ms) {
Dave Allison0aded082013-11-07 13:15:11 -080062 MutexLock mu(self, lock_);
63 SetCountLocked(self, count_ + delta);
Ian Rogers7b078e82014-09-10 14:44:24 -070064 bool timed_out = false;
Dave Allison0aded082013-11-07 13:15:11 -080065 if (count_ != 0) {
Hans Boehm5567c112014-12-02 18:31:31 -080066 uint32_t timeout_ns = 0;
67 uint64_t abs_timeout = NanoTime() + MsToNs(timeout_ms);
68 for (;;) {
69 timed_out = condition_.TimedWait(self, timeout_ms, timeout_ns);
70 if (timed_out || count_ == 0) return timed_out;
71 // Compute time remaining on timeout.
72 uint64_t now = NanoTime();
73 int64_t time_left = abs_timeout - now;
74 if (time_left <= 0) return true;
75 timeout_ns = time_left % (1000*1000);
76 timeout_ms = time_left / (1000*1000);
77 }
Dave Allison0aded082013-11-07 13:15:11 -080078 }
Ian Rogers7b078e82014-09-10 14:44:24 -070079 return timed_out;
Dave Allison0aded082013-11-07 13:15:11 -080080}
81
Mathieu Chartier858f1c52012-10-17 17:45:55 -070082void Barrier::SetCountLocked(Thread* self, int count) {
83 count_ = count;
Ian Rogers7b078e82014-09-10 14:44:24 -070084 if (count == 0) {
Mathieu Chartier858f1c52012-10-17 17:45:55 -070085 condition_.Broadcast(self);
86 }
87}
88
89Barrier::~Barrier() {
Roland Levillain4c0eb422015-04-24 16:43:49 +010090 CHECK_EQ(count_, 0) << "Attempted to destroy barrier with non zero count";
Mathieu Chartier858f1c52012-10-17 17:45:55 -070091}
92
Brian Carlstrom0cd7ec22013-07-17 23:40:20 -070093} // namespace art