|
| 1 | +// SPDX-License-Identifier: BSD-3-Clause |
| 2 | +/* Copyright 2021, Intel Corporation */ |
| 3 | + |
| 4 | +/* |
| 5 | + * consume_interrupt.cpp -- Test for mpsc_queue which interrupts |
| 6 | + * try_consume_batch and check if the data is accessible afterwards. |
| 7 | + */ |
| 8 | + |
| 9 | +#include "unittest.hpp" |
| 10 | + |
| 11 | +#include <algorithm> |
| 12 | +#include <string> |
| 13 | + |
| 14 | +#include <libpmemobj++/experimental/mpsc_queue.hpp> |
| 15 | +#include <libpmemobj++/make_persistent.hpp> |
| 16 | +#include <libpmemobj++/persistent_ptr.hpp> |
| 17 | +#include <libpmemobj++/transaction.hpp> |
| 18 | + |
| 19 | +#define LAYOUT "layout" |
| 20 | + |
| 21 | +using queue_type = pmem::obj::experimental::mpsc_queue; |
| 22 | + |
| 23 | +static constexpr size_t QUEUE_SIZE = 10000; |
| 24 | + |
| 25 | +struct root { |
| 26 | + pmem::obj::persistent_ptr<queue_type::pmem_log_type> log; |
| 27 | +}; |
| 28 | + |
| 29 | +/* Basic try_produce-consume-recovery scenario */ |
| 30 | +static void |
| 31 | +consume_interrupt(pmem::obj::pool<root> pop, bool create) |
| 32 | +{ |
| 33 | + auto proot = pop.root(); |
| 34 | + |
| 35 | + auto queue = queue_type(*proot->log, 1); |
| 36 | + |
| 37 | + auto worker = queue.register_worker(); |
| 38 | + |
| 39 | + std::vector<std::string> values = {"xxx", "aaaaaaa", "bbbbb", |
| 40 | + std::string(120, 'a')}; |
| 41 | + |
| 42 | + if (create) { |
| 43 | + auto ret = queue.try_consume_batch( |
| 44 | + [&](queue_type::batch_type acc) { |
| 45 | + ASSERT_UNREACHABLE; |
| 46 | + }); |
| 47 | + UT_ASSERT(!ret); |
| 48 | + |
| 49 | + /* XXX: this is to make sure that try_consume_batch later in the |
| 50 | + * test returns all elements within a single callback call. */ |
| 51 | + ret = worker.try_produce(values[0]); |
| 52 | + UT_ASSERT(ret); |
| 53 | + ret = queue.try_consume_batch( |
| 54 | + [&](queue_type::batch_type rd_acc) { |
| 55 | + std::vector<std::string> v; |
| 56 | + for (const auto &str : rd_acc) |
| 57 | + v.emplace_back(str.data(), str.size()); |
| 58 | + |
| 59 | + UT_ASSERTeq(v.size(), 1); |
| 60 | + UT_ASSERT(v[0] == values[0]); |
| 61 | + }); |
| 62 | + UT_ASSERT(ret); |
| 63 | + |
| 64 | + /* Insert the data */ |
| 65 | + for (const auto &e : values) { |
| 66 | + ret = worker.try_produce( |
| 67 | + e.size(), [&](pmem::obj::slice<char *> range) { |
| 68 | + std::copy_n(e.begin(), e.size(), |
| 69 | + range.begin()); |
| 70 | + }); |
| 71 | + UT_ASSERT(ret); |
| 72 | + } |
| 73 | + |
| 74 | + /* Consume all the data */ |
| 75 | + std::vector<std::string> values_on_pmem; |
| 76 | + const int retries = 3; |
| 77 | + |
| 78 | + for (int i = 0; i < retries; i++) { |
| 79 | + try { |
| 80 | + ret = queue.try_consume_batch( |
| 81 | + [&](queue_type::batch_type rd_acc) { |
| 82 | + for (const auto &str : rd_acc) { |
| 83 | + values_on_pmem.emplace_back( |
| 84 | + str.data(), |
| 85 | + str.size()); |
| 86 | + } |
| 87 | + |
| 88 | + throw std::runtime_error(""); |
| 89 | + }); |
| 90 | + ASSERT_UNREACHABLE; |
| 91 | + } catch (std::runtime_error &) { |
| 92 | + } catch (...) { |
| 93 | + ASSERT_UNREACHABLE; |
| 94 | + } |
| 95 | + } |
| 96 | + |
| 97 | + UT_ASSERTeq(values_on_pmem.size(), values.size() * retries); |
| 98 | + for (auto &str : values) { |
| 99 | + auto count = std::count(values_on_pmem.begin(), |
| 100 | + values_on_pmem.end(), str); |
| 101 | + UT_ASSERTeq(count, retries); |
| 102 | + } |
| 103 | + } else { |
| 104 | + std::vector<std::string> values_on_pmem; |
| 105 | + /* Recover the data in second run of application */ |
| 106 | + auto ret = queue.try_consume_batch( |
| 107 | + [&](queue_type::batch_type acc) { |
| 108 | + for (const auto &entry : acc) |
| 109 | + values_on_pmem.emplace_back( |
| 110 | + entry.data(), entry.size()); |
| 111 | + }); |
| 112 | + UT_ASSERT(ret); |
| 113 | + UT_ASSERTeq(values_on_pmem.size(), values.size()); |
| 114 | + for (auto &str : values) { |
| 115 | + auto count = std::count(values_on_pmem.begin(), |
| 116 | + values_on_pmem.end(), str); |
| 117 | + UT_ASSERTeq(count, 1); |
| 118 | + } |
| 119 | + } |
| 120 | +} |
| 121 | + |
| 122 | +static void |
| 123 | +test(int argc, char *argv[]) |
| 124 | +{ |
| 125 | + if (argc != 3) |
| 126 | + UT_FATAL("usage: %s file-name create", argv[0]); |
| 127 | + |
| 128 | + const char *path = argv[1]; |
| 129 | + bool create = std::string(argv[2]) == "1"; |
| 130 | + |
| 131 | + pmem::obj::pool<struct root> pop; |
| 132 | + |
| 133 | + if (create) { |
| 134 | + pop = pmem::obj::pool<root>::create(std::string(path), LAYOUT, |
| 135 | + PMEMOBJ_MIN_POOL, |
| 136 | + S_IWUSR | S_IRUSR); |
| 137 | + |
| 138 | + pmem::obj::transaction::run(pop, [&] { |
| 139 | + pop.root()->log = pmem::obj::make_persistent< |
| 140 | + queue_type::pmem_log_type>(QUEUE_SIZE); |
| 141 | + }); |
| 142 | + } else { |
| 143 | + pop = pmem::obj::pool<root>::open(std::string(path), LAYOUT); |
| 144 | + } |
| 145 | + |
| 146 | + consume_interrupt(pop, create); |
| 147 | + |
| 148 | + pop.close(); |
| 149 | +} |
| 150 | + |
| 151 | +int |
| 152 | +main(int argc, char *argv[]) |
| 153 | +{ |
| 154 | + return run_test([&] { test(argc, argv); }); |
| 155 | +} |
0 commit comments