3party/easy_profiler
0
0
Fork 0
mirror of https://github.com/yse/easy_profiler.git synced 2025-01-14 08:37:55 +08:00
Code Issues Projects Releases Wiki Activity

Reverted some unnecessary changes and added documentation.

Browse Source
This commit is contained in:
Blake Martin 2017-08-16 18:38:37 -05:00
parent 6fc445ae9a
commit 7a030bc89a
1 changed files with 10 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
easy_profiler_core/profile_manager.h
View File

@ -149,11 +149,7 @@ namespace profiler {
template <uint16_t N> template <uint16_t N>
class chunk_allocator class chunk_allocator
{ {
struct chunk struct chunk { EASY_ALIGNED(int8_t, data[N], EASY_ALIGNMENT_SIZE); chunk* prev = nullptr; };
{
EASY_ALIGNED(char, data[N], EASY_ALIGNMENT_SIZE);
chunk* prev = nullptr;
};
struct chunk_list struct chunk_list
{ {
@ -207,13 +203,13 @@ class chunk_allocator
//typedef std::list<chunk> chunk_list; //typedef std::list<chunk> chunk_list;
chunk_list m_chunks; chunk_list m_chunks; ///< List of chunks.
uint32_t m_size; uint32_t m_size; ///< Number of elements stored(# of times allocate() has been called.)
uint16_t m_shift; uint16_t m_chunkOffset; ///< Number of bytes used in the current chunk.
public: public:
chunk_allocator() : m_size(0), m_shift(0) chunk_allocator() : m_size(0), m_chunkOffset(0)
{ {
m_chunks.emplace_back(); m_chunks.emplace_back();
} }
@ -229,8 +225,8 @@ public:
if (!need_expand(n)) if (!need_expand(n))
{ {
char* data = (char*)&m_chunks.back().data[0] + m_shift; char* data = (char*)&m_chunks.back().data[0] + m_chunkOffset;
m_shift += n + sizeof(uint16_t); m_chunkOffset += n + sizeof(uint16_t);
std::memcpy(data, &n, sizeof(uint16_t)); std::memcpy(data, &n, sizeof(uint16_t));
data += sizeof(uint16_t); data += sizeof(uint16_t);
@ -238,7 +234,7 @@ public:
return data; return data;
} }
m_shift = n + sizeof(uint16_t); m_chunkOffset = n + sizeof(uint16_t);
m_chunks.emplace_back(); m_chunks.emplace_back();
char* data = (char*)&m_chunks.back().data[0]; char* data = (char*)&m_chunks.back().data[0];
@ -255,7 +251,7 @@ public:
{ {
// We need to make sure that there is always room for a sentinel element (payload size = 0) // We need to make sure that there is always room for a sentinel element (payload size = 0)
// for parsing later. // for parsing later.
return (m_shift + n + 2*sizeof(uint16_t)) > N; return (m_chunkOffset + n + 2*sizeof(uint16_t)) > N;
} }
uint32_t size() const uint32_t size() const
@ -271,7 +267,7 @@ public:
void clear() void clear()
{ {
m_size = 0; m_size = 0;
m_shift = 0; m_chunkOffset = 0;
m_chunks.clear(); m_chunks.clear();
m_chunks.emplace_back(); m_chunks.emplace_back();
} }