// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- #include #include "gtest/gtest.h" #include "global/global_context.h" #include "global/global_init.h" #include "common/common_init.h" #include "osd/scheduler/mClockScheduler.h" #include "osd/scheduler/OpSchedulerItem.h" using namespace ceph::osd::scheduler; int main(int argc, char **argv) { std::vector args(argv, argv+argc); auto cct = global_init(nullptr, args, CEPH_ENTITY_TYPE_OSD, CODE_ENVIRONMENT_UTILITY, CINIT_FLAG_NO_DEFAULT_CONFIG_FILE); common_init_finish(g_ceph_context); ::testing::InitGoogleTest(&argc, argv); return RUN_ALL_TESTS(); } class mClockSchedulerTest : public testing::Test { public: uint32_t num_shards; bool is_rotational; mClockScheduler q; uint64_t client1; uint64_t client2; uint64_t client3; mClockSchedulerTest() : num_shards(1), is_rotational(false), q(g_ceph_context, num_shards, is_rotational), client1(1001), client2(9999), client3(100000001) {} struct MockDmclockItem : public PGOpQueueable { op_scheduler_class scheduler_class; MockDmclockItem(op_scheduler_class _scheduler_class) : PGOpQueueable(spg_t()), scheduler_class(_scheduler_class) {} MockDmclockItem() : MockDmclockItem(op_scheduler_class::background_best_effort) {} op_type_t get_op_type() const final { return op_type_t::client_op; // not used } ostream &print(ostream &rhs) const final { return rhs; } std::optional maybe_get_op() const final { return std::nullopt; } op_scheduler_class get_scheduler_class() const final { return scheduler_class; } void run(OSD *osd, OSDShard *sdata, PGRef& pg, ThreadPool::TPHandle &handle) final {} }; }; template OpSchedulerItem create_item( epoch_t e, uint64_t owner, Args&&... args) { return OpSchedulerItem( std::make_unique( std::forward(args)...), 12, 12, utime_t(), owner, e); } OpSchedulerItem get_item(WorkItem item) { return std::move(std::get(item)); } TEST_F(mClockSchedulerTest, TestEmpty) { ASSERT_TRUE(q.empty()); for (unsigned i = 100; i < 105; i+=2) { q.enqueue(create_item(i, client1, op_scheduler_class::client)); std::this_thread::sleep_for(std::chrono::microseconds(1)); } ASSERT_FALSE(q.empty()); std::list reqs; reqs.push_back(get_item(q.dequeue())); reqs.push_back(get_item(q.dequeue())); ASSERT_EQ(2u, reqs.size()); ASSERT_FALSE(q.empty()); for (auto &&i : reqs) { q.enqueue_front(std::move(i)); } reqs.clear(); ASSERT_FALSE(q.empty()); for (int i = 0; i < 3; ++i) { ASSERT_FALSE(q.empty()); q.dequeue(); } ASSERT_TRUE(q.empty()); } TEST_F(mClockSchedulerTest, TestSingleClientOrderedEnqueueDequeue) { ASSERT_TRUE(q.empty()); for (unsigned i = 100; i < 105; ++i) { q.enqueue(create_item(i, client1, op_scheduler_class::client)); std::this_thread::sleep_for(std::chrono::microseconds(1)); } auto r = get_item(q.dequeue()); ASSERT_EQ(100u, r.get_map_epoch()); r = get_item(q.dequeue()); ASSERT_EQ(101u, r.get_map_epoch()); r = get_item(q.dequeue()); ASSERT_EQ(102u, r.get_map_epoch()); r = get_item(q.dequeue()); ASSERT_EQ(103u, r.get_map_epoch()); r = get_item(q.dequeue()); ASSERT_EQ(104u, r.get_map_epoch()); } TEST_F(mClockSchedulerTest, TestMultiClientOrderedEnqueueDequeue) { const unsigned NUM = 1000; for (unsigned i = 0; i < NUM; ++i) { for (auto &&c: {client1, client2, client3}) { q.enqueue(create_item(i, c)); std::this_thread::sleep_for(std::chrono::microseconds(1)); } } std::map next; for (auto &&c: {client1, client2, client3}) { next[c] = 0; } for (unsigned i = 0; i < NUM * 3; ++i) { ASSERT_FALSE(q.empty()); auto r = get_item(q.dequeue()); auto owner = r.get_owner(); auto niter = next.find(owner); ASSERT_FALSE(niter == next.end()); ASSERT_EQ(niter->second, r.get_map_epoch()); niter->second++; } ASSERT_TRUE(q.empty()); }