Tom Cherry | 1a796bc | 2020-05-13 09:28:37 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2020 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | #include "SerializedFlushToState.h" |
| 18 | |
| 19 | #include <map> |
| 20 | |
| 21 | #include <android-base/logging.h> |
| 22 | #include <android-base/stringprintf.h> |
| 23 | #include <android-base/strings.h> |
| 24 | #include <gtest/gtest.h> |
| 25 | |
| 26 | using android::base::Join; |
| 27 | using android::base::StringPrintf; |
| 28 | |
| 29 | constexpr size_t kChunkSize = 3 * 4096; |
| 30 | |
| 31 | class SerializedFlushToStateTest : public testing::Test { |
| 32 | protected: |
| 33 | void SetUp() override { |
| 34 | // This test spams many unneeded INFO logs, so we suppress them. |
| 35 | old_log_severity_ = android::base::SetMinimumLogSeverity(android::base::WARNING); |
| 36 | } |
| 37 | void TearDown() override { android::base::SetMinimumLogSeverity(old_log_severity_); } |
| 38 | |
| 39 | std::string TestReport(const std::vector<uint64_t>& expected, |
| 40 | const std::vector<uint64_t>& read) { |
| 41 | auto sequence_to_log_id = [&](uint64_t sequence) -> int { |
| 42 | for (const auto& [log_id, sequences] : sequence_numbers_per_buffer_) { |
| 43 | if (std::find(sequences.begin(), sequences.end(), sequence) != sequences.end()) { |
| 44 | return log_id; |
| 45 | } |
| 46 | } |
| 47 | return -1; |
| 48 | }; |
| 49 | |
| 50 | std::map<int, std::vector<uint64_t>> missing_sequences; |
| 51 | std::vector<uint64_t> missing_expected; |
| 52 | std::set_difference(expected.begin(), expected.end(), read.begin(), read.end(), |
| 53 | std::back_inserter(missing_expected)); |
| 54 | for (uint64_t sequence : missing_expected) { |
| 55 | int log_id = sequence_to_log_id(sequence); |
| 56 | missing_sequences[log_id].emplace_back(sequence); |
| 57 | } |
| 58 | |
| 59 | std::map<int, std::vector<uint64_t>> extra_sequences; |
| 60 | std::vector<uint64_t> extra_read; |
| 61 | std::set_difference(read.begin(), read.end(), expected.begin(), expected.end(), |
| 62 | std::back_inserter(extra_read)); |
| 63 | for (uint64_t sequence : extra_read) { |
| 64 | int log_id = sequence_to_log_id(sequence); |
| 65 | extra_sequences[log_id].emplace_back(sequence); |
| 66 | } |
| 67 | |
| 68 | std::vector<std::string> errors; |
| 69 | for (const auto& [log_id, sequences] : missing_sequences) { |
| 70 | errors.emplace_back( |
| 71 | StringPrintf("Log id %d missing %zu sequences", log_id, sequences.size())); |
| 72 | } |
| 73 | |
| 74 | for (const auto& [log_id, sequences] : extra_sequences) { |
| 75 | errors.emplace_back( |
| 76 | StringPrintf("Log id %d has extra %zu sequences", log_id, sequences.size())); |
| 77 | } |
| 78 | |
| 79 | return Join(errors, ", "); |
| 80 | } |
| 81 | |
| 82 | // Read sequence numbers in order from SerializedFlushToState for every mask combination and all |
| 83 | // sequence numbers from 0 through the highest logged sequence number + 1. |
| 84 | // This assumes that all of the logs have already been written. |
| 85 | void TestAllReading() { |
| 86 | uint64_t max_sequence = sequence_ + 1; |
| 87 | uint32_t max_mask = (1 << LOG_ID_MAX) - 1; |
| 88 | for (uint64_t sequence = 0; sequence < max_sequence; ++sequence) { |
| 89 | for (uint32_t mask = 0; mask < max_mask; ++mask) { |
| 90 | auto state = SerializedFlushToState{sequence, mask}; |
| 91 | state.InitializeLogs(log_chunks_); |
Tom Cherry | 1a796bc | 2020-05-13 09:28:37 -0700 | [diff] [blame] | 92 | TestReading(sequence, mask, state); |
| 93 | } |
| 94 | } |
| 95 | } |
| 96 | |
| 97 | // Similar to TestAllReading() except that it doesn't assume any logs are in the buffer, instead |
| 98 | // it calls write_logs() in a loop for sequence/mask combination. It clears log_chunks_ and |
| 99 | // sequence_numbers_per_buffer_ between calls, such that only the sequence numbers written in |
| 100 | // the previous call to write_logs() are expected. |
| 101 | void TestAllReadingWithFutureMessages(const std::function<bool(int)>& write_logs) { |
| 102 | uint64_t max_sequence = sequence_ + 1; |
| 103 | uint32_t max_mask = (1 << LOG_ID_MAX) - 1; |
| 104 | for (uint64_t sequence = 1; sequence < max_sequence; ++sequence) { |
| 105 | for (uint32_t mask = 1; mask < max_mask; ++mask) { |
| 106 | log_id_for_each(i) { log_chunks_[i].clear(); } |
| 107 | auto state = SerializedFlushToState{sequence, mask}; |
| 108 | state.InitializeLogs(log_chunks_); |
| 109 | int loop_count = 0; |
| 110 | while (write_logs(loop_count++)) { |
Tom Cherry | 1a796bc | 2020-05-13 09:28:37 -0700 | [diff] [blame] | 111 | TestReading(sequence, mask, state); |
| 112 | sequence_numbers_per_buffer_.clear(); |
| 113 | } |
| 114 | } |
| 115 | } |
| 116 | } |
| 117 | |
| 118 | void TestReading(uint64_t start, LogMask log_mask, SerializedFlushToState& state) { |
| 119 | std::vector<uint64_t> expected_sequence; |
| 120 | log_id_for_each(i) { |
| 121 | if (((1 << i) & log_mask) == 0) { |
| 122 | continue; |
| 123 | } |
| 124 | for (const auto& sequence : sequence_numbers_per_buffer_[i]) { |
| 125 | if (sequence >= start) { |
| 126 | expected_sequence.emplace_back(sequence); |
| 127 | } |
| 128 | } |
| 129 | } |
| 130 | std::sort(expected_sequence.begin(), expected_sequence.end()); |
| 131 | |
| 132 | std::vector<uint64_t> read_sequence; |
| 133 | |
| 134 | while (state.HasUnreadLogs()) { |
| 135 | auto top = state.PopNextUnreadLog(); |
| 136 | read_sequence.emplace_back(top.entry->sequence()); |
| 137 | } |
| 138 | |
| 139 | EXPECT_TRUE(std::is_sorted(read_sequence.begin(), read_sequence.end())); |
| 140 | |
| 141 | EXPECT_EQ(expected_sequence.size(), read_sequence.size()); |
| 142 | |
| 143 | EXPECT_EQ(expected_sequence, read_sequence) |
| 144 | << "start: " << start << " log_mask: " << log_mask << " " |
| 145 | << TestReport(expected_sequence, read_sequence); |
| 146 | } |
| 147 | |
| 148 | // Add a chunk with the given messages to the a given log buffer. Keep track of the sequence |
| 149 | // numbers for future validation. Optionally mark the block as having finished writing. |
Tom Cherry | b07e339 | 2020-06-24 11:47:49 -0700 | [diff] [blame] | 150 | void AddChunkWithMessages(bool finish_writing, int buffer, |
Tom Cherry | 1a796bc | 2020-05-13 09:28:37 -0700 | [diff] [blame] | 151 | const std::vector<std::string>& messages) { |
| 152 | auto chunk = SerializedLogChunk{kChunkSize}; |
| 153 | for (const auto& message : messages) { |
| 154 | auto sequence = sequence_++; |
| 155 | sequence_numbers_per_buffer_[buffer].emplace_back(sequence); |
| 156 | ASSERT_TRUE(chunk.CanLog(message.size() + 1)); |
| 157 | chunk.Log(sequence, log_time(), 0, 1, 1, message.c_str(), message.size() + 1); |
| 158 | } |
| 159 | if (finish_writing) { |
| 160 | chunk.FinishWriting(); |
| 161 | } |
| 162 | log_chunks_[buffer].emplace_back(std::move(chunk)); |
| 163 | } |
| 164 | |
| 165 | android::base::LogSeverity old_log_severity_; |
| 166 | std::map<int, std::vector<uint64_t>> sequence_numbers_per_buffer_; |
| 167 | std::list<SerializedLogChunk> log_chunks_[LOG_ID_MAX]; |
| 168 | uint64_t sequence_ = 1; |
| 169 | }; |
| 170 | |
| 171 | // 0: multiple chunks, with variable number of entries, with/without finishing writing |
| 172 | // 1: 1 chunk with 1 log and finished writing |
| 173 | // 2: 1 chunk with 1 log and not finished writing |
| 174 | // 3: 1 chunk with 0 logs and not finished writing |
| 175 | // 4: 1 chunk with 0 logs and finished writing (impossible, but SerializedFlushToState handles it) |
| 176 | // 5-7: 0 chunks |
| 177 | TEST_F(SerializedFlushToStateTest, smoke) { |
| 178 | AddChunkWithMessages(true, 0, {"1st", "2nd"}); |
| 179 | AddChunkWithMessages(true, 1, {"3rd"}); |
| 180 | AddChunkWithMessages(false, 0, {"4th"}); |
| 181 | AddChunkWithMessages(true, 0, {"4th", "5th", "more", "even", "more", "go", "here"}); |
| 182 | AddChunkWithMessages(false, 2, {"6th"}); |
| 183 | AddChunkWithMessages(true, 0, {"7th"}); |
| 184 | AddChunkWithMessages(false, 3, {}); |
| 185 | AddChunkWithMessages(true, 4, {}); |
| 186 | |
| 187 | TestAllReading(); |
| 188 | } |
| 189 | |
| 190 | TEST_F(SerializedFlushToStateTest, random) { |
| 191 | srand(1); |
| 192 | for (int count = 0; count < 20; ++count) { |
| 193 | unsigned int num_messages = 1 + rand() % 15; |
| 194 | auto messages = std::vector<std::string>{num_messages, "same message"}; |
| 195 | |
| 196 | bool compress = rand() % 2; |
| 197 | int buf = rand() % LOG_ID_MAX; |
| 198 | |
| 199 | AddChunkWithMessages(compress, buf, messages); |
| 200 | } |
| 201 | |
| 202 | TestAllReading(); |
| 203 | } |
| 204 | |
| 205 | // Same start as smoke, but we selectively write logs to the buffers and ensure they're read. |
| 206 | TEST_F(SerializedFlushToStateTest, future_writes) { |
| 207 | auto write_logs = [&](int loop_count) { |
| 208 | switch (loop_count) { |
| 209 | case 0: |
| 210 | // Initial writes. |
| 211 | AddChunkWithMessages(true, 0, {"1st", "2nd"}); |
| 212 | AddChunkWithMessages(true, 1, {"3rd"}); |
| 213 | AddChunkWithMessages(false, 0, {"4th"}); |
| 214 | AddChunkWithMessages(true, 0, {"4th", "5th", "more", "even", "more", "go", "here"}); |
| 215 | AddChunkWithMessages(false, 2, {"6th"}); |
| 216 | AddChunkWithMessages(true, 0, {"7th"}); |
| 217 | AddChunkWithMessages(false, 3, {}); |
| 218 | AddChunkWithMessages(true, 4, {}); |
| 219 | break; |
| 220 | case 1: |
| 221 | // Smoke test, add a simple chunk. |
| 222 | AddChunkWithMessages(true, 0, {"1st", "2nd"}); |
| 223 | break; |
| 224 | case 2: |
| 225 | // Add chunks to all but one of the logs. |
| 226 | AddChunkWithMessages(true, 0, {"1st", "2nd"}); |
| 227 | AddChunkWithMessages(true, 1, {"1st", "2nd"}); |
| 228 | AddChunkWithMessages(true, 2, {"1st", "2nd"}); |
| 229 | AddChunkWithMessages(true, 3, {"1st", "2nd"}); |
| 230 | AddChunkWithMessages(true, 4, {"1st", "2nd"}); |
| 231 | AddChunkWithMessages(true, 5, {"1st", "2nd"}); |
| 232 | AddChunkWithMessages(true, 6, {"1st", "2nd"}); |
| 233 | break; |
| 234 | case 3: |
| 235 | // Finally add chunks to all logs. |
| 236 | AddChunkWithMessages(true, 0, {"1st", "2nd"}); |
| 237 | AddChunkWithMessages(true, 1, {"1st", "2nd"}); |
| 238 | AddChunkWithMessages(true, 2, {"1st", "2nd"}); |
| 239 | AddChunkWithMessages(true, 3, {"1st", "2nd"}); |
| 240 | AddChunkWithMessages(true, 4, {"1st", "2nd"}); |
| 241 | AddChunkWithMessages(true, 5, {"1st", "2nd"}); |
| 242 | AddChunkWithMessages(true, 6, {"1st", "2nd"}); |
| 243 | AddChunkWithMessages(true, 7, {"1st", "2nd"}); |
| 244 | break; |
| 245 | default: |
| 246 | return false; |
| 247 | } |
| 248 | return true; |
| 249 | }; |
| 250 | |
| 251 | TestAllReadingWithFutureMessages(write_logs); |
| 252 | } |
Tom Cherry | b07e339 | 2020-06-24 11:47:49 -0700 | [diff] [blame] | 253 | |
| 254 | TEST_F(SerializedFlushToStateTest, no_dangling_references) { |
| 255 | AddChunkWithMessages(true, 0, {"1st", "2nd"}); |
| 256 | AddChunkWithMessages(true, 0, {"3rd", "4th"}); |
| 257 | |
| 258 | auto state = SerializedFlushToState{1, kLogMaskAll}; |
| 259 | state.InitializeLogs(log_chunks_); |
| 260 | |
| 261 | ASSERT_EQ(log_chunks_[0].size(), 2U); |
| 262 | auto first_chunk = log_chunks_[0].begin(); |
| 263 | auto second_chunk = std::next(first_chunk); |
| 264 | |
| 265 | ASSERT_TRUE(state.HasUnreadLogs()); |
| 266 | auto first_log = state.PopNextUnreadLog(); |
| 267 | EXPECT_STREQ(first_log.entry->msg(), "1st"); |
| 268 | EXPECT_EQ(first_chunk->reader_ref_count(), 1U); |
| 269 | EXPECT_EQ(second_chunk->reader_ref_count(), 0U); |
| 270 | |
| 271 | ASSERT_TRUE(state.HasUnreadLogs()); |
| 272 | auto second_log = state.PopNextUnreadLog(); |
| 273 | EXPECT_STREQ(second_log.entry->msg(), "2nd"); |
| 274 | EXPECT_EQ(first_chunk->reader_ref_count(), 1U); |
| 275 | EXPECT_EQ(second_chunk->reader_ref_count(), 0U); |
| 276 | |
| 277 | ASSERT_TRUE(state.HasUnreadLogs()); |
| 278 | auto third_log = state.PopNextUnreadLog(); |
| 279 | EXPECT_STREQ(third_log.entry->msg(), "3rd"); |
| 280 | EXPECT_EQ(first_chunk->reader_ref_count(), 0U); |
| 281 | EXPECT_EQ(second_chunk->reader_ref_count(), 1U); |
| 282 | |
| 283 | ASSERT_TRUE(state.HasUnreadLogs()); |
| 284 | auto fourth_log = state.PopNextUnreadLog(); |
| 285 | EXPECT_STREQ(fourth_log.entry->msg(), "4th"); |
| 286 | EXPECT_EQ(first_chunk->reader_ref_count(), 0U); |
| 287 | EXPECT_EQ(second_chunk->reader_ref_count(), 1U); |
| 288 | |
| 289 | EXPECT_FALSE(state.HasUnreadLogs()); |
| 290 | } |