mirror of
https://github.com/FairRootGroup/FairMQ.git
synced 2025-10-16 10:01:47 +00:00
Compare commits
2 Commits
d2ca138aa2
...
v1.10.0
Author | SHA1 | Date | |
---|---|---|---|
|
dcea48fcee | ||
|
67dcf77a7f |
@@ -55,7 +55,6 @@ if(BUILD_FAIRMQ)
|
|||||||
ProgOptionsFwd.h
|
ProgOptionsFwd.h
|
||||||
Properties.h
|
Properties.h
|
||||||
PropertyOutput.h
|
PropertyOutput.h
|
||||||
SmallVector.h
|
|
||||||
Socket.h
|
Socket.h
|
||||||
StateMachine.h
|
StateMachine.h
|
||||||
States.h
|
States.h
|
||||||
@@ -128,7 +127,6 @@ if(BUILD_FAIRMQ)
|
|||||||
PluginServices.cxx
|
PluginServices.cxx
|
||||||
ProgOptions.cxx
|
ProgOptions.cxx
|
||||||
Properties.cxx
|
Properties.cxx
|
||||||
SmallVector.cxx
|
|
||||||
StateMachine.cxx
|
StateMachine.cxx
|
||||||
States.cxx
|
States.cxx
|
||||||
SuboptParser.cxx
|
SuboptParser.cxx
|
||||||
|
@@ -17,7 +17,7 @@
|
|||||||
|
|
||||||
#include <boost/container/container_fwd.hpp>
|
#include <boost/container/container_fwd.hpp>
|
||||||
#include <boost/container/flat_map.hpp>
|
#include <boost/container/flat_map.hpp>
|
||||||
#include <boost/container/pmr/memory_resource.hpp>
|
#include <memory_resource>
|
||||||
#include <cstring>
|
#include <cstring>
|
||||||
#include <fairmq/Message.h>
|
#include <fairmq/Message.h>
|
||||||
#include <stdexcept>
|
#include <stdexcept>
|
||||||
@@ -27,7 +27,7 @@ namespace fair::mq {
|
|||||||
|
|
||||||
class TransportFactory;
|
class TransportFactory;
|
||||||
using byte = unsigned char;
|
using byte = unsigned char;
|
||||||
namespace pmr = boost::container::pmr;
|
namespace pmr = std::pmr;
|
||||||
|
|
||||||
/// All FairMQ related memory resources need to inherit from this interface
|
/// All FairMQ related memory resources need to inherit from this interface
|
||||||
/// class for the
|
/// class for the
|
||||||
|
@@ -11,7 +11,6 @@
|
|||||||
|
|
||||||
#include <algorithm> // std::move
|
#include <algorithm> // std::move
|
||||||
#include <fairmq/Message.h> // fair::mq::MessagePtr
|
#include <fairmq/Message.h> // fair::mq::MessagePtr
|
||||||
#include <fairmq/SmallVector.h>
|
|
||||||
#include <iterator> // std::back_inserter
|
#include <iterator> // std::back_inserter
|
||||||
#include <utility> // std::move, std::forward
|
#include <utility> // std::move, std::forward
|
||||||
#include <vector> // std::vector
|
#include <vector> // std::vector
|
||||||
@@ -22,7 +21,7 @@ namespace fair::mq {
|
|||||||
/// Message, used for sending multi-part messages
|
/// Message, used for sending multi-part messages
|
||||||
struct Parts
|
struct Parts
|
||||||
{
|
{
|
||||||
using container = fair::llvm_copy::SmallVector<MessagePtr, 8>;
|
using container = std::vector<MessagePtr>;
|
||||||
using size_type = container::size_type;
|
using size_type = container::size_type;
|
||||||
using reference = container::reference;
|
using reference = container::reference;
|
||||||
using const_reference = container::const_reference;
|
using const_reference = container::const_reference;
|
||||||
@@ -72,9 +71,9 @@ struct Parts
|
|||||||
// const_reference operator[](size_type index) const { return fParts[index]; }
|
// const_reference operator[](size_type index) const { return fParts[index]; }
|
||||||
|
|
||||||
[[deprecated("Redundant, dereference at call site e.g. '*(parts.At(index))' instead.")]]
|
[[deprecated("Redundant, dereference at call site e.g. '*(parts.At(index))' instead.")]]
|
||||||
Message& AtRef(size_type index) { return *(fParts[index]); }
|
Message& AtRef(size_type index) { return *(fParts.at(index)); }
|
||||||
reference At(size_type index) { return fParts[index]; }
|
reference At(size_type index) { return fParts.at(index); }
|
||||||
const_reference At(size_type index) const { return fParts[index]; }
|
const_reference At(size_type index) const { return fParts.at(index); }
|
||||||
|
|
||||||
size_type Size() const noexcept { return fParts.size(); }
|
size_type Size() const noexcept { return fParts.size(); }
|
||||||
bool Empty() const noexcept { return fParts.empty(); }
|
bool Empty() const noexcept { return fParts.empty(); }
|
||||||
@@ -83,10 +82,10 @@ struct Parts
|
|||||||
// range access
|
// range access
|
||||||
iterator begin() noexcept { return fParts.begin(); }
|
iterator begin() noexcept { return fParts.begin(); }
|
||||||
const_iterator begin() const noexcept { return fParts.begin(); }
|
const_iterator begin() const noexcept { return fParts.begin(); }
|
||||||
const_iterator cbegin() const noexcept { return fParts.begin(); }
|
const_iterator cbegin() const noexcept { return fParts.cbegin(); }
|
||||||
iterator end() noexcept { return fParts.end(); }
|
iterator end() noexcept { return fParts.end(); }
|
||||||
const_iterator end() const noexcept { return fParts.end(); }
|
const_iterator end() const noexcept { return fParts.end(); }
|
||||||
const_iterator cend() const noexcept { return fParts.end(); }
|
const_iterator cend() const noexcept { return fParts.cend(); }
|
||||||
|
|
||||||
container fParts{};
|
container fParts{};
|
||||||
};
|
};
|
||||||
|
@@ -1,120 +0,0 @@
|
|||||||
//===- llvm/ADT/SmallVector.cpp - 'Normally small' vectors ----------------===//
|
|
||||||
//
|
|
||||||
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
||||||
// See https://llvm.org/LICENSE.txt for license information.
|
|
||||||
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
||||||
//
|
|
||||||
//===----------------------------------------------------------------------===//
|
|
||||||
//
|
|
||||||
// This file implements the SmallVector class.
|
|
||||||
//
|
|
||||||
//===----------------------------------------------------------------------===//
|
|
||||||
|
|
||||||
#include <SmallVector.h>
|
|
||||||
//#include "llvm/Support/MemAlloc.h"
|
|
||||||
#include <cstdint>
|
|
||||||
using namespace fair::llvm_copy;
|
|
||||||
|
|
||||||
// Check that no bytes are wasted and everything is well-aligned.
|
|
||||||
namespace {
|
|
||||||
struct Struct16B {
|
|
||||||
alignas(16) void *X;
|
|
||||||
};
|
|
||||||
struct Struct32B {
|
|
||||||
alignas(32) void *X;
|
|
||||||
};
|
|
||||||
}
|
|
||||||
static_assert(sizeof(SmallVector<void *, 0>) ==
|
|
||||||
sizeof(unsigned) * 2 + sizeof(void *),
|
|
||||||
"wasted space in SmallVector size 0");
|
|
||||||
static_assert(alignof(SmallVector<Struct16B, 0>) >= alignof(Struct16B),
|
|
||||||
"wrong alignment for 16-byte aligned T");
|
|
||||||
static_assert(alignof(SmallVector<Struct32B, 0>) >= alignof(Struct32B),
|
|
||||||
"wrong alignment for 32-byte aligned T");
|
|
||||||
static_assert(sizeof(SmallVector<Struct16B, 0>) >= alignof(Struct16B),
|
|
||||||
"missing padding for 16-byte aligned T");
|
|
||||||
static_assert(sizeof(SmallVector<Struct32B, 0>) >= alignof(Struct32B),
|
|
||||||
"missing padding for 32-byte aligned T");
|
|
||||||
static_assert(sizeof(SmallVector<void *, 1>) ==
|
|
||||||
sizeof(unsigned) * 2 + sizeof(void *) * 2,
|
|
||||||
"wasted space in SmallVector size 1");
|
|
||||||
|
|
||||||
static_assert(sizeof(SmallVector<char, 0>) ==
|
|
||||||
sizeof(void *) * 2 + sizeof(void *),
|
|
||||||
"1 byte elements have word-sized type for size and capacity");
|
|
||||||
|
|
||||||
// Note: Moving this function into the header may cause performance regression.
|
|
||||||
template <class Size_T>
|
|
||||||
static size_t getNewCapacity(size_t MinSize, size_t , size_t OldCapacity) {
|
|
||||||
constexpr size_t MaxSize = std::numeric_limits<Size_T>::max();
|
|
||||||
|
|
||||||
// In theory 2*capacity can overflow if the capacity is 64 bit, but the
|
|
||||||
// original capacity would never be large enough for this to be a problem.
|
|
||||||
size_t NewCapacity = 2 * OldCapacity + 1; // Always grow.
|
|
||||||
return std::clamp(NewCapacity, MinSize, MaxSize);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <class Size_T>
|
|
||||||
void *SmallVectorBase<Size_T>::replaceAllocation(void *NewElts, size_t TSize,
|
|
||||||
size_t NewCapacity,
|
|
||||||
size_t VSize) {
|
|
||||||
void *NewEltsReplace = malloc(NewCapacity * TSize);
|
|
||||||
if (VSize)
|
|
||||||
memcpy(NewEltsReplace, NewElts, VSize * TSize);
|
|
||||||
free(NewElts);
|
|
||||||
return NewEltsReplace;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Note: Moving this function into the header may cause performance regression.
|
|
||||||
template <class Size_T>
|
|
||||||
void *SmallVectorBase<Size_T>::mallocForGrow(void *FirstEl, size_t MinSize,
|
|
||||||
size_t TSize,
|
|
||||||
size_t &NewCapacity) {
|
|
||||||
NewCapacity = getNewCapacity<Size_T>(MinSize, TSize, this->capacity());
|
|
||||||
// Even if capacity is not 0 now, if the vector was originally created with
|
|
||||||
// capacity 0, it's possible for the malloc to return FirstEl.
|
|
||||||
void *NewElts = malloc(NewCapacity * TSize);
|
|
||||||
if (NewElts == FirstEl)
|
|
||||||
NewElts = replaceAllocation(NewElts, TSize, NewCapacity);
|
|
||||||
return NewElts;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Note: Moving this function into the header may cause performance regression.
|
|
||||||
template <class Size_T>
|
|
||||||
void SmallVectorBase<Size_T>::grow_pod(void *FirstEl, size_t MinSize,
|
|
||||||
size_t TSize) {
|
|
||||||
size_t NewCapacity = getNewCapacity<Size_T>(MinSize, TSize, this->capacity());
|
|
||||||
void *NewElts;
|
|
||||||
if (BeginX == FirstEl) {
|
|
||||||
NewElts = malloc(NewCapacity * TSize);
|
|
||||||
if (NewElts == FirstEl)
|
|
||||||
NewElts = replaceAllocation(NewElts, TSize, NewCapacity);
|
|
||||||
|
|
||||||
// Copy the elements over. No need to run dtors on PODs.
|
|
||||||
memcpy(NewElts, this->BeginX, size() * TSize);
|
|
||||||
} else {
|
|
||||||
// If this wasn't grown from the inline copy, grow the allocated space.
|
|
||||||
NewElts = realloc(this->BeginX, NewCapacity * TSize);
|
|
||||||
if (NewElts == FirstEl)
|
|
||||||
NewElts = replaceAllocation(NewElts, TSize, NewCapacity, size());
|
|
||||||
}
|
|
||||||
|
|
||||||
this->set_allocation_range(NewElts, NewCapacity);
|
|
||||||
}
|
|
||||||
|
|
||||||
template class fair::llvm_copy::SmallVectorBase<uint32_t>;
|
|
||||||
|
|
||||||
// Disable the uint64_t instantiation for 32-bit builds.
|
|
||||||
// Both uint32_t and uint64_t instantiations are needed for 64-bit builds.
|
|
||||||
// This instantiation will never be used in 32-bit builds, and will cause
|
|
||||||
// warnings when sizeof(Size_T) > sizeof(size_t).
|
|
||||||
#if SIZE_MAX > UINT32_MAX
|
|
||||||
template class fair::llvm_copy::SmallVectorBase<uint64_t>;
|
|
||||||
|
|
||||||
// Assertions to ensure this #if stays in sync with SmallVectorSizeType.
|
|
||||||
static_assert(sizeof(SmallVectorSizeType<char>) == sizeof(uint64_t),
|
|
||||||
"Expected SmallVectorBase<uint64_t> variant to be in use.");
|
|
||||||
#else
|
|
||||||
static_assert(sizeof(SmallVectorSizeType<char>) == sizeof(uint32_t),
|
|
||||||
"Expected SmallVectorBase<uint32_t> variant to be in use.");
|
|
||||||
#endif
|
|
1353
fairmq/SmallVector.h
1353
fairmq/SmallVector.h
File diff suppressed because it is too large
Load Diff
@@ -16,6 +16,7 @@
|
|||||||
#include <gtest/gtest.h>
|
#include <gtest/gtest.h>
|
||||||
|
|
||||||
#include <cstring>
|
#include <cstring>
|
||||||
|
#include <string>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
namespace
|
namespace
|
||||||
@@ -101,7 +102,7 @@ TEST(MemoryResources, allocator)
|
|||||||
|
|
||||||
size_t session{tools::UuidHash()};
|
size_t session{tools::UuidHash()};
|
||||||
ProgOptions config;
|
ProgOptions config;
|
||||||
config.SetProperty<string>("session", to_string(session));
|
config.SetProperty<std::string>("session", to_string(session));
|
||||||
|
|
||||||
FactoryType factoryZMQ = TransportFactory::CreateTransportFactory("zeromq", fair::mq::tools::Uuid(), &config);
|
FactoryType factoryZMQ = TransportFactory::CreateTransportFactory("zeromq", fair::mq::tools::Uuid(), &config);
|
||||||
|
|
||||||
@@ -129,7 +130,7 @@ TEST(MemoryResources, getMessage)
|
|||||||
|
|
||||||
size_t session{tools::UuidHash()};
|
size_t session{tools::UuidHash()};
|
||||||
ProgOptions config;
|
ProgOptions config;
|
||||||
config.SetProperty<string>("session", to_string(session));
|
config.SetProperty<std::string>("session", to_string(session));
|
||||||
config.SetProperty<bool>("shm-monitor", true);
|
config.SetProperty<bool>("shm-monitor", true);
|
||||||
|
|
||||||
FactoryType factoryZMQ = TransportFactory::CreateTransportFactory("zeromq", fair::mq::tools::Uuid(), &config);
|
FactoryType factoryZMQ = TransportFactory::CreateTransportFactory("zeromq", fair::mq::tools::Uuid(), &config);
|
||||||
|
Reference in New Issue
Block a user