Mirror/zeek
1
0
Fork 0
mirror of https://github.com/zeek/zeek.git synced 2025-10-13 12:08:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 3

Rename make{ Counted => _intrusive }

Browse source
This commit is contained in:
Dominik Charousset 2019-10-30 20:27:57 +01:00
parent 21b6159e70
commit 054a4f4612
2 changed files with 7 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/IntrusivePtr.h
View file

@ -127,7 +127,7 @@ private:
// Convenience function for creating intrusive pointers. // Convenience function for creating intrusive pointers.
template <class T, class... Ts> template <class T, class... Ts>
IntrusivePtr<T> makeCounted(Ts&&... args) IntrusivePtr<T> make_intrusive(Ts&&... args)
{ {
// Assumes that objects start with a reference count of 1! // Assumes that objects start with a reference count of 1!
return {new T(std::forward<Ts>(args)...), false}; return {new T(std::forward<Ts>(args)...), false};

12
src/broker/Data.cc
View file

@ -181,7 +181,7 @@ struct val_converter {
return nullptr; return nullptr;
auto tt = type->AsTableType(); auto tt = type->AsTableType();
auto rval = makeCounted<TableVal>(tt); auto rval = make_intrusive<TableVal>(tt);
for ( auto& item : a ) for ( auto& item : a )
{ {
@ -215,7 +215,7 @@ struct val_converter {
indices->size() ) indices->size() )
return nullptr; return nullptr;
auto list_val = makeCounted<ListVal>(TYPE_ANY); auto list_val = make_intrusive<ListVal>(TYPE_ANY);
for ( auto i = 0u; i < indices->size(); ++i ) for ( auto i = 0u; i < indices->size(); ++i )
{ {
@ -241,7 +241,7 @@ struct val_converter {
return nullptr; return nullptr;
auto tt = type->AsTableType(); auto tt = type->AsTableType();
auto rval = makeCounted<TableVal>(tt); auto rval = make_intrusive<TableVal>(tt);
for ( auto& item : a ) for ( auto& item : a )
{ {
@ -275,7 +275,7 @@ struct val_converter {
indices->size() ) indices->size() )
return nullptr; return nullptr;
auto list_val = makeCounted<ListVal>(TYPE_ANY); auto list_val = make_intrusive<ListVal>(TYPE_ANY);
for ( auto i = 0u; i < indices->size(); ++i ) for ( auto i = 0u; i < indices->size(); ++i )
{ {
@ -305,7 +305,7 @@ struct val_converter {
if ( type->Tag() == TYPE_VECTOR ) if ( type->Tag() == TYPE_VECTOR )
{ {
auto vt = type->AsVectorType(); auto vt = type->AsVectorType();
auto rval = makeCounted<VectorVal>(vt); auto rval = make_intrusive<VectorVal>(vt);
for ( auto& item : a ) for ( auto& item : a )
{ {
@ -362,7 +362,7 @@ struct val_converter {
else if ( type->Tag() == TYPE_RECORD ) else if ( type->Tag() == TYPE_RECORD )
{ {
auto rt = type->AsRecordType(); auto rt = type->AsRecordType();
auto rval = makeCounted<RecordVal>(rt); auto rval = make_intrusive<RecordVal>(rt);
auto idx = 0u; auto idx = 0u;
for ( auto i = 0u; i < static_cast<size_t>(rt->NumFields()); ++i ) for ( auto i = 0u; i < static_cast<size_t>(rt->NumFields()); ++i )