Merge changes I9638e90b,Ib2636dfc
* changes: logd: replace std::vector<uint8_t> in SerializedLogChunk logd: fix use after resize of contents_ vector
This commit is contained in:
commit
c58d1e4aec
11 changed files with 154 additions and 62 deletions
|
|
@ -27,7 +27,7 @@ CompressionEngine& CompressionEngine::GetInstance() {
|
||||||
return *engine;
|
return *engine;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool ZlibCompressionEngine::Compress(std::span<uint8_t> in, std::vector<uint8_t>& out) {
|
bool ZlibCompressionEngine::Compress(SerializedData& in, size_t data_length, SerializedData& out) {
|
||||||
z_stream strm;
|
z_stream strm;
|
||||||
strm.zalloc = Z_NULL;
|
strm.zalloc = Z_NULL;
|
||||||
strm.zfree = Z_NULL;
|
strm.zfree = Z_NULL;
|
||||||
|
|
@ -37,34 +37,34 @@ bool ZlibCompressionEngine::Compress(std::span<uint8_t> in, std::vector<uint8_t>
|
||||||
LOG(FATAL) << "deflateInit() failed";
|
LOG(FATAL) << "deflateInit() failed";
|
||||||
}
|
}
|
||||||
|
|
||||||
CHECK_LE(in.size(), static_cast<int64_t>(std::numeric_limits<uint32_t>::max()));
|
CHECK_LE(data_length, in.size());
|
||||||
uint32_t out_size = deflateBound(&strm, in.size());
|
CHECK_LE(in.size(), std::numeric_limits<uint32_t>::max());
|
||||||
|
uint32_t deflate_bound = deflateBound(&strm, in.size());
|
||||||
|
|
||||||
out.resize(out_size);
|
out.Resize(deflate_bound);
|
||||||
strm.avail_in = in.size();
|
|
||||||
strm.next_in = const_cast<uint8_t*>(in.data());
|
strm.avail_in = data_length;
|
||||||
strm.avail_out = out_size;
|
strm.next_in = in.data();
|
||||||
|
strm.avail_out = out.size();
|
||||||
strm.next_out = out.data();
|
strm.next_out = out.data();
|
||||||
ret = deflate(&strm, Z_FINISH);
|
ret = deflate(&strm, Z_FINISH);
|
||||||
CHECK_EQ(ret, Z_STREAM_END);
|
CHECK_EQ(ret, Z_STREAM_END);
|
||||||
|
|
||||||
uint32_t compressed_data_size = strm.total_out;
|
uint32_t compressed_size = strm.total_out;
|
||||||
deflateEnd(&strm);
|
deflateEnd(&strm);
|
||||||
out.resize(compressed_data_size);
|
|
||||||
|
out.Resize(compressed_size);
|
||||||
|
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool ZlibCompressionEngine::Decompress(const std::vector<uint8_t>& in, std::vector<uint8_t>& out,
|
bool ZlibCompressionEngine::Decompress(SerializedData& in, SerializedData& out) {
|
||||||
size_t out_size) {
|
|
||||||
out.resize(out_size);
|
|
||||||
|
|
||||||
z_stream strm;
|
z_stream strm;
|
||||||
strm.zalloc = Z_NULL;
|
strm.zalloc = Z_NULL;
|
||||||
strm.zfree = Z_NULL;
|
strm.zfree = Z_NULL;
|
||||||
strm.opaque = Z_NULL;
|
strm.opaque = Z_NULL;
|
||||||
strm.avail_in = in.size();
|
strm.avail_in = in.size();
|
||||||
strm.next_in = const_cast<uint8_t*>(in.data());
|
strm.next_in = in.data();
|
||||||
strm.avail_out = out.size();
|
strm.avail_out = out.size();
|
||||||
strm.next_out = out.data();
|
strm.next_out = out.data();
|
||||||
|
|
||||||
|
|
@ -79,22 +79,22 @@ bool ZlibCompressionEngine::Decompress(const std::vector<uint8_t>& in, std::vect
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool ZstdCompressionEngine::Compress(std::span<uint8_t> in, std::vector<uint8_t>& out) {
|
bool ZstdCompressionEngine::Compress(SerializedData& in, size_t data_length, SerializedData& out) {
|
||||||
size_t out_size = ZSTD_compressBound(in.size());
|
CHECK_LE(data_length, in.size());
|
||||||
out.resize(out_size);
|
|
||||||
|
|
||||||
out_size = ZSTD_compress(out.data(), out_size, in.data(), in.size(), 1);
|
size_t compress_bound = ZSTD_compressBound(data_length);
|
||||||
|
out.Resize(compress_bound);
|
||||||
|
|
||||||
|
size_t out_size = ZSTD_compress(out.data(), out.size(), in.data(), data_length, 1);
|
||||||
if (ZSTD_isError(out_size)) {
|
if (ZSTD_isError(out_size)) {
|
||||||
LOG(FATAL) << "ZSTD_compress failed: " << ZSTD_getErrorName(out_size);
|
LOG(FATAL) << "ZSTD_compress failed: " << ZSTD_getErrorName(out_size);
|
||||||
}
|
}
|
||||||
out.resize(out_size);
|
out.Resize(out_size);
|
||||||
|
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool ZstdCompressionEngine::Decompress(const std::vector<uint8_t>& in, std::vector<uint8_t>& out,
|
bool ZstdCompressionEngine::Decompress(SerializedData& in, SerializedData& out) {
|
||||||
size_t out_size) {
|
|
||||||
out.resize(out_size);
|
|
||||||
size_t result = ZSTD_decompress(out.data(), out.size(), in.data(), in.size());
|
size_t result = ZSTD_decompress(out.data(), out.size(), in.data(), in.size());
|
||||||
if (ZSTD_isError(result)) {
|
if (ZSTD_isError(result)) {
|
||||||
LOG(FATAL) << "ZSTD_decompress failed: " << ZSTD_getErrorName(result);
|
LOG(FATAL) << "ZSTD_decompress failed: " << ZSTD_getErrorName(result);
|
||||||
|
|
|
||||||
|
|
@ -16,8 +16,9 @@
|
||||||
|
|
||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#include <span>
|
#include <memory>
|
||||||
#include <vector>
|
|
||||||
|
#include "SerializedData.h"
|
||||||
|
|
||||||
class CompressionEngine {
|
class CompressionEngine {
|
||||||
public:
|
public:
|
||||||
|
|
@ -25,23 +26,20 @@ class CompressionEngine {
|
||||||
|
|
||||||
virtual ~CompressionEngine(){};
|
virtual ~CompressionEngine(){};
|
||||||
|
|
||||||
virtual bool Compress(std::span<uint8_t> in, std::vector<uint8_t>& out) = 0;
|
virtual bool Compress(SerializedData& in, size_t data_length, SerializedData& out) = 0;
|
||||||
// Decompress the contents of `in` into `out`. `out_size` must be set to the decompressed size
|
// Decompress the contents of `in` into `out`. `out.size()` must be set to the decompressed
|
||||||
// of the contents.
|
// size of the contents.
|
||||||
virtual bool Decompress(const std::vector<uint8_t>& in, std::vector<uint8_t>& out,
|
virtual bool Decompress(SerializedData& in, SerializedData& out) = 0;
|
||||||
size_t out_size) = 0;
|
|
||||||
};
|
};
|
||||||
|
|
||||||
class ZlibCompressionEngine : public CompressionEngine {
|
class ZlibCompressionEngine : public CompressionEngine {
|
||||||
public:
|
public:
|
||||||
bool Compress(std::span<uint8_t> in, std::vector<uint8_t>& out) override;
|
bool Compress(SerializedData& in, size_t data_length, SerializedData& out) override;
|
||||||
bool Decompress(const std::vector<uint8_t>& in, std::vector<uint8_t>& out,
|
bool Decompress(SerializedData& in, SerializedData& out) override;
|
||||||
size_t out_size) override;
|
|
||||||
};
|
};
|
||||||
|
|
||||||
class ZstdCompressionEngine : public CompressionEngine {
|
class ZstdCompressionEngine : public CompressionEngine {
|
||||||
public:
|
public:
|
||||||
bool Compress(std::span<uint8_t> in, std::vector<uint8_t>& out) override;
|
bool Compress(SerializedData& in, size_t data_length, SerializedData& out) override;
|
||||||
bool Decompress(const std::vector<uint8_t>& in, std::vector<uint8_t>& out,
|
bool Decompress(SerializedData& in, SerializedData& out) override;
|
||||||
size_t out_size) override;
|
|
||||||
};
|
};
|
||||||
55
logd/SerializedData.h
Normal file
55
logd/SerializedData.h
Normal file
|
|
@ -0,0 +1,55 @@
|
||||||
|
/*
|
||||||
|
* Copyright (C) 2020 The Android Open Source Project
|
||||||
|
*
|
||||||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
* you may not use this file except in compliance with the License.
|
||||||
|
* You may obtain a copy of the License at
|
||||||
|
*
|
||||||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
*
|
||||||
|
* Unless required by applicable law or agreed to in writing, software
|
||||||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
* See the License for the specific language governing permissions and
|
||||||
|
* limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <sys/types.h>
|
||||||
|
|
||||||
|
#include <algorithm>
|
||||||
|
#include <memory>
|
||||||
|
|
||||||
|
// This class is used instead of std::string or std::vector because their clear(), erase(), etc
|
||||||
|
// functions don't actually deallocate. shrink_to_fit() does deallocate but is not guaranteed to
|
||||||
|
// work and swapping with an empty string/vector is clunky.
|
||||||
|
class SerializedData {
|
||||||
|
public:
|
||||||
|
SerializedData() {}
|
||||||
|
SerializedData(size_t size) : data_(new uint8_t[size]), size_(size) {}
|
||||||
|
|
||||||
|
void Resize(size_t new_size) {
|
||||||
|
if (size_ == 0) {
|
||||||
|
data_.reset(new uint8_t[new_size]);
|
||||||
|
size_ = new_size;
|
||||||
|
} else if (new_size == 0) {
|
||||||
|
data_.reset();
|
||||||
|
size_ = 0;
|
||||||
|
} else if (new_size != size_) {
|
||||||
|
std::unique_ptr<uint8_t[]> new_data(new uint8_t[new_size]);
|
||||||
|
size_t copy_size = std::min(size_, new_size);
|
||||||
|
memcpy(new_data.get(), data_.get(), copy_size);
|
||||||
|
data_.swap(new_data);
|
||||||
|
size_ = new_size;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
uint8_t* data() { return data_.get(); }
|
||||||
|
const uint8_t* data() const { return data_.get(); }
|
||||||
|
size_t size() const { return size_; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
std::unique_ptr<uint8_t[]> data_;
|
||||||
|
size_t size_ = 0;
|
||||||
|
};
|
||||||
|
|
@ -121,7 +121,7 @@ MinHeapElement SerializedFlushToState::PopNextUnreadLog() {
|
||||||
|
|
||||||
log_positions_[log_id]->read_offset += entry->total_len();
|
log_positions_[log_id]->read_offset += entry->total_len();
|
||||||
|
|
||||||
AddMinHeapEntry(log_id);
|
logs_needed_from_next_position_[log_id] = true;
|
||||||
|
|
||||||
return top;
|
return top;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
|
|
@ -61,15 +61,13 @@ class SerializedFlushToState : public FlushToState {
|
||||||
if (logs_ == nullptr) logs_ = logs;
|
if (logs_ == nullptr) logs_ = logs;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Checks to see if any log buffers set in logs_needed_from_next_position_ have new logs and
|
bool HasUnreadLogs() {
|
||||||
// calls AddMinHeapEntry() if so.
|
CheckForNewLogs();
|
||||||
void CheckForNewLogs();
|
return !min_heap_.empty();
|
||||||
|
}
|
||||||
|
|
||||||
bool HasUnreadLogs() { return !min_heap_.empty(); }
|
// Pops the next unread log from the min heap and sets logs_needed_from_next_position_ to
|
||||||
|
// indicate that we're waiting for more logs from the associated log buffer.
|
||||||
// Pops the next unread log from the min heap. Add the next log for that log_id to the min heap
|
|
||||||
// if one is available otherwise set logs_needed_from_next_position_ to indicate that we're
|
|
||||||
// waiting for more logs.
|
|
||||||
MinHeapElement PopNextUnreadLog();
|
MinHeapElement PopNextUnreadLog();
|
||||||
|
|
||||||
// If the parent log buffer prunes logs, the reference that this class contains may become
|
// If the parent log buffer prunes logs, the reference that this class contains may become
|
||||||
|
|
@ -86,6 +84,10 @@ class SerializedFlushToState : public FlushToState {
|
||||||
// first chunk and then first log entry within that chunk that is greater or equal to start().
|
// first chunk and then first log entry within that chunk that is greater or equal to start().
|
||||||
void CreateLogPosition(log_id_t log_id);
|
void CreateLogPosition(log_id_t log_id);
|
||||||
|
|
||||||
|
// Checks to see if any log buffers set in logs_needed_from_next_position_ have new logs and
|
||||||
|
// calls AddMinHeapEntry() if so.
|
||||||
|
void CheckForNewLogs();
|
||||||
|
|
||||||
std::list<SerializedLogChunk>* logs_ = nullptr;
|
std::list<SerializedLogChunk>* logs_ = nullptr;
|
||||||
// An optional structure that contains an iterator to the serialized log buffer and offset into
|
// An optional structure that contains an iterator to the serialized log buffer and offset into
|
||||||
// it that this logger should handle next.
|
// it that this logger should handle next.
|
||||||
|
|
|
||||||
|
|
@ -89,7 +89,6 @@ class SerializedFlushToStateTest : public testing::Test {
|
||||||
for (uint32_t mask = 0; mask < max_mask; ++mask) {
|
for (uint32_t mask = 0; mask < max_mask; ++mask) {
|
||||||
auto state = SerializedFlushToState{sequence, mask};
|
auto state = SerializedFlushToState{sequence, mask};
|
||||||
state.InitializeLogs(log_chunks_);
|
state.InitializeLogs(log_chunks_);
|
||||||
state.CheckForNewLogs();
|
|
||||||
TestReading(sequence, mask, state);
|
TestReading(sequence, mask, state);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
@ -109,7 +108,6 @@ class SerializedFlushToStateTest : public testing::Test {
|
||||||
state.InitializeLogs(log_chunks_);
|
state.InitializeLogs(log_chunks_);
|
||||||
int loop_count = 0;
|
int loop_count = 0;
|
||||||
while (write_logs(loop_count++)) {
|
while (write_logs(loop_count++)) {
|
||||||
state.CheckForNewLogs();
|
|
||||||
TestReading(sequence, mask, state);
|
TestReading(sequence, mask, state);
|
||||||
sequence_numbers_per_buffer_.clear();
|
sequence_numbers_per_buffer_.clear();
|
||||||
}
|
}
|
||||||
|
|
@ -149,7 +147,7 @@ class SerializedFlushToStateTest : public testing::Test {
|
||||||
|
|
||||||
// Add a chunk with the given messages to the a given log buffer. Keep track of the sequence
|
// Add a chunk with the given messages to the a given log buffer. Keep track of the sequence
|
||||||
// numbers for future validation. Optionally mark the block as having finished writing.
|
// numbers for future validation. Optionally mark the block as having finished writing.
|
||||||
void AddChunkWithMessages(int buffer, bool finish_writing,
|
void AddChunkWithMessages(bool finish_writing, int buffer,
|
||||||
const std::vector<std::string>& messages) {
|
const std::vector<std::string>& messages) {
|
||||||
auto chunk = SerializedLogChunk{kChunkSize};
|
auto chunk = SerializedLogChunk{kChunkSize};
|
||||||
for (const auto& message : messages) {
|
for (const auto& message : messages) {
|
||||||
|
|
@ -252,3 +250,41 @@ TEST_F(SerializedFlushToStateTest, future_writes) {
|
||||||
|
|
||||||
TestAllReadingWithFutureMessages(write_logs);
|
TestAllReadingWithFutureMessages(write_logs);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_F(SerializedFlushToStateTest, no_dangling_references) {
|
||||||
|
AddChunkWithMessages(true, 0, {"1st", "2nd"});
|
||||||
|
AddChunkWithMessages(true, 0, {"3rd", "4th"});
|
||||||
|
|
||||||
|
auto state = SerializedFlushToState{1, kLogMaskAll};
|
||||||
|
state.InitializeLogs(log_chunks_);
|
||||||
|
|
||||||
|
ASSERT_EQ(log_chunks_[0].size(), 2U);
|
||||||
|
auto first_chunk = log_chunks_[0].begin();
|
||||||
|
auto second_chunk = std::next(first_chunk);
|
||||||
|
|
||||||
|
ASSERT_TRUE(state.HasUnreadLogs());
|
||||||
|
auto first_log = state.PopNextUnreadLog();
|
||||||
|
EXPECT_STREQ(first_log.entry->msg(), "1st");
|
||||||
|
EXPECT_EQ(first_chunk->reader_ref_count(), 1U);
|
||||||
|
EXPECT_EQ(second_chunk->reader_ref_count(), 0U);
|
||||||
|
|
||||||
|
ASSERT_TRUE(state.HasUnreadLogs());
|
||||||
|
auto second_log = state.PopNextUnreadLog();
|
||||||
|
EXPECT_STREQ(second_log.entry->msg(), "2nd");
|
||||||
|
EXPECT_EQ(first_chunk->reader_ref_count(), 1U);
|
||||||
|
EXPECT_EQ(second_chunk->reader_ref_count(), 0U);
|
||||||
|
|
||||||
|
ASSERT_TRUE(state.HasUnreadLogs());
|
||||||
|
auto third_log = state.PopNextUnreadLog();
|
||||||
|
EXPECT_STREQ(third_log.entry->msg(), "3rd");
|
||||||
|
EXPECT_EQ(first_chunk->reader_ref_count(), 0U);
|
||||||
|
EXPECT_EQ(second_chunk->reader_ref_count(), 1U);
|
||||||
|
|
||||||
|
ASSERT_TRUE(state.HasUnreadLogs());
|
||||||
|
auto fourth_log = state.PopNextUnreadLog();
|
||||||
|
EXPECT_STREQ(fourth_log.entry->msg(), "4th");
|
||||||
|
EXPECT_EQ(first_chunk->reader_ref_count(), 0U);
|
||||||
|
EXPECT_EQ(second_chunk->reader_ref_count(), 1U);
|
||||||
|
|
||||||
|
EXPECT_FALSE(state.HasUnreadLogs());
|
||||||
|
}
|
||||||
|
|
@ -276,7 +276,6 @@ bool SerializedLogBuffer::FlushTo(
|
||||||
|
|
||||||
auto& state = reinterpret_cast<SerializedFlushToState&>(abstract_state);
|
auto& state = reinterpret_cast<SerializedFlushToState&>(abstract_state);
|
||||||
state.InitializeLogs(logs_);
|
state.InitializeLogs(logs_);
|
||||||
state.CheckForNewLogs();
|
|
||||||
|
|
||||||
while (state.HasUnreadLogs()) {
|
while (state.HasUnreadLogs()) {
|
||||||
MinHeapElement top = state.PopNextUnreadLog();
|
MinHeapElement top = state.PopNextUnreadLog();
|
||||||
|
|
@ -309,10 +308,6 @@ bool SerializedLogBuffer::FlushTo(
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
lock.lock();
|
lock.lock();
|
||||||
|
|
||||||
// Since we released the log above, buffers that aren't in our min heap may now have had
|
|
||||||
// logs added, so re-check them.
|
|
||||||
state.CheckForNewLogs();
|
|
||||||
}
|
}
|
||||||
|
|
||||||
state.set_start(state.start() + 1);
|
state.set_start(state.start() + 1);
|
||||||
|
|
|
||||||
|
|
@ -25,14 +25,13 @@ SerializedLogChunk::~SerializedLogChunk() {
|
||||||
}
|
}
|
||||||
|
|
||||||
void SerializedLogChunk::Compress() {
|
void SerializedLogChunk::Compress() {
|
||||||
if (compressed_log_.empty()) {
|
if (compressed_log_.size() == 0) {
|
||||||
CompressionEngine::GetInstance().Compress({contents_.data(), write_offset_},
|
CompressionEngine::GetInstance().Compress(contents_, write_offset_, compressed_log_);
|
||||||
compressed_log_);
|
|
||||||
LOG(INFO) << "Compressed Log, buffer max size: " << contents_.size()
|
LOG(INFO) << "Compressed Log, buffer max size: " << contents_.size()
|
||||||
<< " size used: " << write_offset_
|
<< " size used: " << write_offset_
|
||||||
<< " compressed size: " << compressed_log_.size();
|
<< " compressed size: " << compressed_log_.size();
|
||||||
}
|
}
|
||||||
contents_.resize(0);
|
contents_.Resize(0);
|
||||||
}
|
}
|
||||||
|
|
||||||
// TODO: Develop a better reference counting strategy to guard against the case where the writer is
|
// TODO: Develop a better reference counting strategy to guard against the case where the writer is
|
||||||
|
|
@ -41,7 +40,8 @@ void SerializedLogChunk::IncReaderRefCount() {
|
||||||
if (++reader_ref_count_ != 1 || writer_active_) {
|
if (++reader_ref_count_ != 1 || writer_active_) {
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
CompressionEngine::GetInstance().Decompress(compressed_log_, contents_, write_offset_);
|
contents_.Resize(write_offset_);
|
||||||
|
CompressionEngine::GetInstance().Decompress(compressed_log_, contents_);
|
||||||
}
|
}
|
||||||
|
|
||||||
void SerializedLogChunk::DecReaderRefCount(bool compress) {
|
void SerializedLogChunk::DecReaderRefCount(bool compress) {
|
||||||
|
|
@ -90,7 +90,7 @@ bool SerializedLogChunk::ClearUidLogs(uid_t uid, log_id_t log_id, LogStatistics*
|
||||||
// Clear the old compressed logs and set write_offset_ appropriately for DecReaderRefCount()
|
// Clear the old compressed logs and set write_offset_ appropriately for DecReaderRefCount()
|
||||||
// to compress the new partially cleared log.
|
// to compress the new partially cleared log.
|
||||||
if (new_write_offset != write_offset_) {
|
if (new_write_offset != write_offset_) {
|
||||||
compressed_log_.clear();
|
compressed_log_.Resize(0);
|
||||||
write_offset_ = new_write_offset;
|
write_offset_ = new_write_offset;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -18,14 +18,14 @@
|
||||||
|
|
||||||
#include <sys/types.h>
|
#include <sys/types.h>
|
||||||
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "LogWriter.h"
|
#include "LogWriter.h"
|
||||||
|
#include "SerializedData.h"
|
||||||
#include "SerializedLogEntry.h"
|
#include "SerializedLogEntry.h"
|
||||||
|
|
||||||
class SerializedLogChunk {
|
class SerializedLogChunk {
|
||||||
public:
|
public:
|
||||||
explicit SerializedLogChunk(size_t size) : contents_(size) {}
|
explicit SerializedLogChunk(size_t size) : contents_(size) {}
|
||||||
|
SerializedLogChunk(SerializedLogChunk&& other) noexcept = default;
|
||||||
~SerializedLogChunk();
|
~SerializedLogChunk();
|
||||||
|
|
||||||
void Compress();
|
void Compress();
|
||||||
|
|
@ -60,13 +60,16 @@ class SerializedLogChunk {
|
||||||
int write_offset() const { return write_offset_; }
|
int write_offset() const { return write_offset_; }
|
||||||
uint64_t highest_sequence_number() const { return highest_sequence_number_; }
|
uint64_t highest_sequence_number() const { return highest_sequence_number_; }
|
||||||
|
|
||||||
|
// Exposed for testing
|
||||||
|
uint32_t reader_ref_count() const { return reader_ref_count_; }
|
||||||
|
|
||||||
private:
|
private:
|
||||||
// The decompressed contents of this log buffer. Deallocated when the ref_count reaches 0 and
|
// The decompressed contents of this log buffer. Deallocated when the ref_count reaches 0 and
|
||||||
// writer_active_ is false.
|
// writer_active_ is false.
|
||||||
std::vector<uint8_t> contents_;
|
SerializedData contents_;
|
||||||
int write_offset_ = 0;
|
int write_offset_ = 0;
|
||||||
uint32_t reader_ref_count_ = 0;
|
uint32_t reader_ref_count_ = 0;
|
||||||
bool writer_active_ = true;
|
bool writer_active_ = true;
|
||||||
uint64_t highest_sequence_number_ = 1;
|
uint64_t highest_sequence_number_ = 1;
|
||||||
std::vector<uint8_t> compressed_log_;
|
SerializedData compressed_log_;
|
||||||
};
|
};
|
||||||
|
|
|
||||||
|
|
@ -44,4 +44,7 @@ cc_fuzz {
|
||||||
srcs: [
|
srcs: [
|
||||||
"serialized_log_buffer_fuzzer.cpp",
|
"serialized_log_buffer_fuzzer.cpp",
|
||||||
],
|
],
|
||||||
|
corpus: [
|
||||||
|
"corpus/logentry_use_after_compress",
|
||||||
|
]
|
||||||
}
|
}
|
||||||
|
|
|
||||||
BIN
logd/fuzz/corpus/logentry_use_after_compress
Normal file
BIN
logd/fuzz/corpus/logentry_use_after_compress
Normal file
Binary file not shown.
Loading…
Add table
Reference in a new issue