mirror of https://github.com/pvnis/srsRAN_4G.git
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
89 lines
2.6 KiB
C++
89 lines
2.6 KiB
C++
/**
|
|
* Copyright 2013-2022 Software Radio Systems Limited
|
|
*
|
|
* This file is part of srsRAN.
|
|
*
|
|
* srsRAN is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Affero General Public License as
|
|
* published by the Free Software Foundation, either version 3 of
|
|
* the License, or (at your option) any later version.
|
|
*
|
|
* srsRAN is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Affero General Public License for more details.
|
|
*
|
|
* A copy of the GNU Affero General Public License can be found in
|
|
* the LICENSE file in the top-level directory of this distribution
|
|
* and at http://www.gnu.org/licenses/.
|
|
*
|
|
*/
|
|
|
|
#ifndef SRSRAN_LINEAR_ALLOCATOR_H
|
|
#define SRSRAN_LINEAR_ALLOCATOR_H
|
|
|
|
#include "pool_utils.h"
|
|
#include "srsran/support/srsran_assert.h"
|
|
|
|
namespace srsran {
|
|
|
|
class linear_allocator
|
|
{
|
|
public:
|
|
linear_allocator() = default;
|
|
linear_allocator(void* start_, void* end_) :
|
|
start(static_cast<uint8_t*>(start_)), end(static_cast<uint8_t*>(end_)), cur(start)
|
|
{}
|
|
linear_allocator(void* start_, size_t sz) : start(static_cast<uint8_t*>(start_)), end(start + sz), cur(start) {}
|
|
linear_allocator(const linear_allocator& other) = delete;
|
|
linear_allocator(linear_allocator&& other) noexcept : start(other.start), end(other.end), cur(other.cur)
|
|
{
|
|
other.clear();
|
|
}
|
|
linear_allocator& operator=(const linear_allocator& other) = delete;
|
|
linear_allocator& operator =(linear_allocator&& other) noexcept
|
|
{
|
|
start = other.start;
|
|
end = other.end;
|
|
cur = other.cur;
|
|
other.clear();
|
|
return *this;
|
|
}
|
|
|
|
void* allocate(size_t sz, size_t alignment)
|
|
{
|
|
void* alloc_start = align_to(cur, alignment);
|
|
uint8_t* new_cur = static_cast<uint8_t*>(alloc_start) + sz;
|
|
if (new_cur > end) {
|
|
// Cannot fit allocation in memory block
|
|
return nullptr;
|
|
}
|
|
cur = new_cur;
|
|
return alloc_start;
|
|
}
|
|
|
|
void deallocate(void* p) { srsran_assert(p >= start and p < end, "pointer does not belong to pool"); }
|
|
|
|
size_t nof_bytes_allocated() const { return cur - start; }
|
|
size_t nof_bytes_left() const { return end - cur; }
|
|
size_t size() const { return end - start; }
|
|
bool is_init() const { return start != end; }
|
|
void* memblock_ptr() { return static_cast<void*>(start); }
|
|
|
|
void clear()
|
|
{
|
|
start = nullptr;
|
|
cur = nullptr;
|
|
end = nullptr;
|
|
}
|
|
|
|
protected:
|
|
uint8_t* start = nullptr;
|
|
uint8_t* end = nullptr;
|
|
uint8_t* cur = nullptr;
|
|
};
|
|
|
|
} // namespace srsran
|
|
|
|
#endif // SRSRAN_LINEAR_ALLOCATOR_H
|