YugabyteDB (2.13.0.0-b42, bfc6a6643e7399ac8a0e81d06a3ee6d6571b33ab)

//  Copyright (c) 2011-present, Facebook, Inc.  All rights reserved.

//  This source code is licensed under the BSD-style license found in the

//  LICENSE file in the root directory of this source tree. An additional grant

//  of patent rights can be found in the PATENTS file in the same directory.

//

// The following only applies to changes made to this file as part of YugaByte development.

//

// Portions Copyright (c) YugaByte, Inc.

//

// 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.

//

#include "yb/rocksdb/util/sync_point.h"

#include "yb/rocksdb/port/port.h"

#include "yb/rocksdb/util/random.h"

int rocksdb_kill_odds = 0;

std::vector<std::string> rocksdb_kill_prefix_blacklist;

#ifndef NDEBUG

namespace rocksdb {

void TestKillRandom(std::string kill_point, int odds,

                    const std::string& srcfile, int srcline) {

  for (auto& p : rocksdb_kill_prefix_blacklist) {

    if (kill_point.substr(0, p.length()) == p) {

      return;

    }

  }

  assert(odds > 0);

  if (odds % 7 == 0) {

    // class Random uses multiplier 16807, which is 7^5. If odds are

    // multiplier of 7, there might be limited values generated.

    odds++;

  }

  auto* r = Random::GetTLSInstance();

  bool crash = r->OneIn(odds);

  if (crash) {

    port::Crash(srcfile, srcline);

  }

}

SyncPoint* SyncPoint::GetInstance() {

  static SyncPoint sync_point;

  return &sync_point;

}

void SyncPoint::LoadDependency(const std::vector<Dependency>& dependencies) {

  std::unique_lock<std::mutex> lock(mutex_);

  successors_.clear();

  predecessors_.clear();

  cleared_points_.clear();

  for (const auto& dependency : dependencies) {

    successors_[dependency.predecessor].push_back(dependency.successor);

    predecessors_[dependency.successor].push_back(dependency.predecessor);

  }

  cv_.notify_all();

}

bool SyncPoint::PredecessorsAllCleared(const std::string& point) {

  for (const auto& pred : predecessors_[point]) {

    if (cleared_points_.count(pred) == 0) {

      return false;

    }

  }

  return true;

}

void SyncPoint::SetCallBack(const std::string point,

                            std::function<void(void*)> callback) {

  std::unique_lock<std::mutex> lock(mutex_);

  callbacks_[point] = callback;

}

void SyncPoint::ClearAllCallBacks() {

  std::unique_lock<std::mutex> lock(mutex_);

  while (num_callbacks_running_ > 0) {

    cv_.wait(lock);

  }

  callbacks_.clear();

}

void SyncPoint::EnableProcessing() {

  std::unique_lock<std::mutex> lock(mutex_);

  enabled_ = true;

}

void SyncPoint::DisableProcessing() {

  std::unique_lock<std::mutex> lock(mutex_);

  enabled_ = false;

}

void SyncPoint::ClearTrace() {

  std::unique_lock<std::mutex> lock(mutex_);

  cleared_points_.clear();

}

void SyncPoint::Process(const std::string& point, void* cb_arg) {

  std::unique_lock<std::mutex> lock(mutex_);

  if (!enabled_) return;

  auto callback_pair = callbacks_.find(point);

  if (callback_pair != callbacks_.end()) {

    num_callbacks_running_++;

    lock.unlock();

    callback_pair->second(cb_arg);

    lock.lock();

    num_callbacks_running_--;

    cv_.notify_all();

  }

  while (!PredecessorsAllCleared(point)) {

    cv_.wait(lock);

  }

  cleared_points_.insert(point);

  cv_.notify_all();

}

}  // namespace rocksdb

#endif  // NDEBUG