Function TEST

be/src/kudu/rpc/request_tracker-test.cc:32–82

namespace rpc {

TEST(RequestTrackerTest, TestSequenceNumberGeneration) {
  const int MAX = 10;

  scoped_refptr<RequestTracker> tracker_(new RequestTracker("test_client"));

  // A new tracker should have no incomplete RPCs
  RequestTracker::SequenceNumber seq_no = tracker_->FirstIncomplete();
  ASSERT_EQ(seq_no, RequestTracker::kNoSeqNo);

  vector<RequestTracker::SequenceNumber> generated_seq_nos;

  // Generate MAX in flight RPCs, making sure they are correctly returned.
  for (int i = 0; i < MAX; i++) {
    ASSERT_OK(tracker_->NewSeqNo(&seq_no));
    generated_seq_nos.push_back(seq_no);
  }

  // Now we should get a first incomplete.
  ASSERT_EQ(generated_seq_nos[0], tracker_->FirstIncomplete());

  // Marking 'first_incomplete' as done, should advance the first incomplete.
  tracker_->RpcCompleted(tracker_->FirstIncomplete());

  ASSERT_EQ(generated_seq_nos[1], tracker_->FirstIncomplete());

  // Marking a 'middle' rpc, should not advance 'first_incomplete'.
  tracker_->RpcCompleted(generated_seq_nos[5]);
  ASSERT_EQ(generated_seq_nos[1], tracker_->FirstIncomplete());

  // Marking half the rpc as complete should advance FirstIncomplete.
  // Note that this also tests that RequestTracker::RpcCompleted() is idempotent, i.e. that
  // marking the same sequence number as complete twice is a no-op.
  for (int i = 0; i < MAX / 2; i++) {
    tracker_->RpcCompleted(generated_seq_nos[i]);
  }

  ASSERT_EQ(generated_seq_nos[6], tracker_->FirstIncomplete());

  for (int i = MAX / 2; i <= MAX; i++) {
    ASSERT_OK(tracker_->NewSeqNo(&seq_no));
    generated_seq_nos.push_back(seq_no);
  }

  // Marking them all as completed should cause RequestTracker::FirstIncomplete() to return
  // Status::NotFound() again.
  for (auto seq_no : generated_seq_nos) {
    tracker_->RpcCompleted(seq_no);
  }

  ASSERT_EQ(tracker_->FirstIncomplete(), RequestTracker::kNoSeqNo);
}

} // namespace rpc
} // namespace kudu