mirror of
https://github.com/zeek/zeek.git
synced 2025-10-04 07:38:19 +00:00
Merge remote-tracking branch 'origin/topic/johanna/remove-serializer'
* origin/topic/johanna/remove-serializer: Fix memory leak introduced by removing opaque of ocsp_resp. Change return value of OpaqueVal::DoSerialize. Add missing ShallowClone implementation for SetType Remove opaque of ocsp_resp. Remove remnants of event serializer. Fix cardinalitycounter deserialization. Smaller compile fixes for the new opaque serialization. Reimplement serialization infrastructure for OpaqueVals. Couple of compile fixes. Remove const from ShallowClone. Remove test-case for removed functionality Implement a Shallow Clone operation for types. Remove value serialization. Various changes I made: - Fix memory leak in type-checker for opaque vals wrapped in broker::data - Noticed the two "copy-all" leak tests weren't actually checking for memory leaks because the heap checker isn't active until after zeek_init() is evaluated. - Change OpaqueVal::DoClone to use the clone caching mechanism - Improve copy elision for broker::expected return types in the various OpaqueVal serialize methods - Not all compilers end up properly treating the return of local/automatic variable as an rvalue that can be moved, and ends up copying it instead. - Particularly, until GCC 8, this pattern ends up copying instead of moving, and we still support platforms whose default compiler pre-dates that version. - Generally seems it's something that wasn't addressed until C++14. See http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#1579 - Change OpaqueVal::SerializeType to return broker::expected - Change probabilistic DoSerialize methods to return broker::expected
This commit is contained in:
commit
399496efa8
102 changed files with 1574 additions and 9140 deletions
|
@ -5,7 +5,6 @@
|
|||
#include <limits>
|
||||
|
||||
#include "BitVector.h"
|
||||
#include "Serializer.h"
|
||||
#include "digest.h"
|
||||
|
||||
using namespace probabilistic;
|
||||
|
@ -506,6 +505,47 @@ uint64 BitVector::Hash() const
|
|||
return digest;
|
||||
}
|
||||
|
||||
broker::expected<broker::data> BitVector::Serialize() const
|
||||
{
|
||||
broker::vector v = {static_cast<uint64>(num_bits), static_cast<uint64>(bits.size())};
|
||||
v.reserve(2 + bits.size());
|
||||
|
||||
for ( size_t i = 0; i < bits.size(); ++i )
|
||||
v.emplace_back(static_cast<uint64>(bits[i]));
|
||||
|
||||
return {std::move(v)};
|
||||
}
|
||||
|
||||
std::unique_ptr<BitVector> BitVector::Unserialize(const broker::data& data)
|
||||
{
|
||||
auto v = caf::get_if<broker::vector>(&data);
|
||||
if ( ! (v && v->size() >= 2) )
|
||||
return nullptr;
|
||||
|
||||
auto num_bits = caf::get_if<uint64>(&(*v)[0]);
|
||||
auto size = caf::get_if<uint64>(&(*v)[1]);
|
||||
|
||||
if ( ! (num_bits && size) )
|
||||
return nullptr;
|
||||
|
||||
if ( v->size() != 2 + *size )
|
||||
return nullptr;
|
||||
|
||||
auto bv = std::unique_ptr<BitVector>(new BitVector());
|
||||
bv->num_bits = *num_bits;
|
||||
|
||||
for ( size_t i = 0; i < *size; ++i )
|
||||
{
|
||||
auto x = caf::get_if<uint64>(&(*v)[2 + i]);
|
||||
if ( ! x )
|
||||
return nullptr;
|
||||
|
||||
bv->bits.push_back(*x);
|
||||
}
|
||||
|
||||
return bv;
|
||||
}
|
||||
|
||||
BitVector::size_type BitVector::lowest_bit(block_type block)
|
||||
{
|
||||
block_type x = block - (block & (block - 1));
|
||||
|
@ -539,56 +579,3 @@ BitVector::size_type BitVector::find_from(size_type i) const
|
|||
return i * bits_per_block + lowest_bit(bits[i]);
|
||||
}
|
||||
|
||||
bool BitVector::Serialize(SerialInfo* info) const
|
||||
{
|
||||
return SerialObj::Serialize(info);
|
||||
}
|
||||
|
||||
BitVector* BitVector::Unserialize(UnserialInfo* info)
|
||||
{
|
||||
return reinterpret_cast<BitVector*>(SerialObj::Unserialize(info, SER_BITVECTOR));
|
||||
}
|
||||
|
||||
IMPLEMENT_SERIAL(BitVector, SER_BITVECTOR);
|
||||
|
||||
bool BitVector::DoSerialize(SerialInfo* info) const
|
||||
{
|
||||
DO_SERIALIZE(SER_BITVECTOR, SerialObj);
|
||||
|
||||
if ( ! SERIALIZE(static_cast<uint64>(bits.size())) )
|
||||
return false;
|
||||
|
||||
for ( size_t i = 0; i < bits.size(); ++i )
|
||||
if ( ! SERIALIZE(static_cast<uint64>(bits[i])) )
|
||||
return false;
|
||||
|
||||
return SERIALIZE(static_cast<uint64>(num_bits));
|
||||
}
|
||||
|
||||
bool BitVector::DoUnserialize(UnserialInfo* info)
|
||||
{
|
||||
DO_UNSERIALIZE(SerialObj);
|
||||
|
||||
uint64 size;
|
||||
if ( ! UNSERIALIZE(&size) )
|
||||
return false;
|
||||
|
||||
bits.resize(static_cast<size_t>(size));
|
||||
|
||||
for ( size_t i = 0; i < bits.size(); ++i )
|
||||
{
|
||||
uint64 block;
|
||||
if ( ! UNSERIALIZE(&block) )
|
||||
return false;
|
||||
|
||||
bits[i] = static_cast<block_type>(block);
|
||||
}
|
||||
|
||||
uint64 n;
|
||||
if ( ! UNSERIALIZE(&n) )
|
||||
return false;
|
||||
|
||||
num_bits = static_cast<size_type>(n);
|
||||
|
||||
return true;
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue