Basic CCheckQueue Benchmarks #9498

  14 | +
  15 | +// This Benchmark tests the CheckQueue with the lightest
  16 | +// weight Checks, so it should make any lock contention
  17 | +// particularly visible
  18 | +static void CCheckQueueSpeed(benchmark::State& state)
  19 | +{

---

  30 | +       tg.create_thread([&]{queue.Thread();});
  31 | +    }
  32 | +    while (state.KeepRunning()) {
  33 | +        CCheckQueueControl<FakeJobNoWork> control(&queue);
  34 | +        // We can make vChecks out of the loop because calling Add doesn't
  35 | +        // change the size of the vector.

---

  32 | +    while (state.KeepRunning()) {
  33 | +        CCheckQueueControl<FakeJobNoWork> control(&queue);
  34 | +        // We can make vChecks out of the loop because calling Add doesn't
  35 | +        // change the size of the vector.
  36 | +        std::vector<FakeJobNoWork> vChecks;
  37 | +        vChecks.resize(30);

---

  72 | +    for (auto x = 0; x < std::max(2, GetNumCores()); ++x) {
  73 | +       tg.create_thread([&]{queue.Thread();});
  74 | +    }
  75 | +    while (state.KeepRunning()) {
  76 | +        // Make insecure_rand here so that each iteration is identical.
  77 | +        FastRandomContext insecure_rand(true);

---

  57 | +    struct PrevectorJob {
  58 | +        prevector<28, uint8_t> p;
  59 | +        PrevectorJob(){
  60 | +        }
  61 | +        PrevectorJob(FastRandomContext& insecure_rand){
  62 | +            p.resize(insecure_rand.rand32() % 56);

---