Files
nearby/internal/test/fake_task_runner.cc
T
2023-03-17 09:34:58 -07:00

124 lines
3.4 KiB
C++

// Copyright 2022 Google LLC
//
// 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
//
// https://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 "internal/test/fake_task_runner.h"
#include <functional>
#include <future> // NOLINT
#include <memory>
#include <utility>
#include <vector>
#include "absl/time/time.h"
namespace nearby {
std::atomic_uint FakeTaskRunner::running_thread_count_ = 0;
bool FakeTaskRunner::PostTask(absl::AnyInvocable<void()> task) {
if (mode_ == Mode::kNoPending) {
run(std::move(task));
return true;
}
pending_tasks_.push_back(std::move(task));
return true;
}
bool FakeTaskRunner::PostDelayedTask(absl::Duration delay,
absl::AnyInvocable<void()> task) {
std::unique_ptr<Timer> timer = std::make_unique<FakeTimer>(clock_);
Timer* timer_ptr = timer.get();
uint32_t id = GenerateId();
pending_delayed_tasks_.emplace(id, std::move(timer));
timer_ptr->Start(delay / absl::Milliseconds(1), 0,
[this, task = std::move(task), id]() mutable {
PostTask(std::move(task));
completed_delayed_tasks_.push_back(id);
});
return true;
}
void FakeTaskRunner::RunNextTask() {
if (pending_tasks_.empty()) {
return;
}
run(std::move(pending_tasks_.front()));
pending_tasks_.erase(pending_tasks_.begin());
}
void FakeTaskRunner::RunAllPendingTasks() {
while (!pending_tasks_.empty()) {
RunNextTask();
}
}
const std::vector<absl::AnyInvocable<void()>>& FakeTaskRunner::GetPendingTasks()
const {
return pending_tasks_;
}
const absl::flat_hash_map<uint32_t, std::unique_ptr<Timer>>&
FakeTaskRunner::GetPendingDelayedTask() {
if (!completed_delayed_tasks_.empty()) {
for (uint32_t id : completed_delayed_tasks_) {
pending_delayed_tasks_.erase(id);
}
}
return pending_delayed_tasks_;
}
bool FakeTaskRunner::WaitForRunningTasksWithTimeout(absl::Duration timeout) {
int i = (timeout / absl::Milliseconds(1)) / 50;
while (running_thread_count_ != 0 && i > 0) {
absl::SleepFor(absl::Milliseconds(50));
--i;
}
return running_thread_count_ == 0;
}
uint32_t FakeTaskRunner::GenerateId() {
++current_id_;
return current_id_;
}
void FakeTaskRunner::CleanThreads() {
auto it = threads_.begin();
while (it != threads_.end()) {
// Delete the thread if it is ready
auto status = it->wait_for(std::chrono::seconds(0));
if (status == std::future_status::ready) {
it = threads_.erase(it);
} else {
++it;
}
}
}
void FakeTaskRunner::run(absl::AnyInvocable<void()> task) {
absl::MutexLock lock(&mutex_);
CleanThreads();
++running_thread_count_;
// Run the task in a new thread, to simulate the real environment.
std::future<void> thread =
std::async(std::launch::async, [&, task = std::move(task)]() mutable {
task();
--running_thread_count_;
});
threads_.push_back(std::move(thread));
}
} // namespace nearby