chromium/third_party/ruy/src/ruy/blocking_counter.h

/* Copyright 2019 Google LLC. All Rights Reserved.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/

#ifndef RUY_RUY_BLOCKING_COUNTER_H_
#define RUY_RUY_BLOCKING_COUNTER_H_

#include <atomic>
#include <condition_variable>  // NOLINT(build/c++11) // IWYU pragma: keep
#include <mutex>               // NOLINT(build/c++11) // IWYU pragma: keep

#include "ruy/time.h"

namespace ruy {

// A BlockingCounter lets one thread to wait for N events to occur.
// This is how the master thread waits for all the worker threads
// to have finished working.
// The waiting is done using a naive spinlock waiting for the atomic
// count_ to hit the value 0. This is acceptable because in our usage
// pattern, BlockingCounter is used only to synchronize threads after
// short-lived tasks (performing parts of the same GEMM). It is not used
// for synchronizing longer waits (resuming work on the next GEMM).
class BlockingCounter { … };

}  // namespace ruy

#endif  // RUY_RUY_BLOCKING_COUNTER_H_