From 654ef30508d7465c49f8eb7d406513c10165b176 Mon Sep 17 00:00:00 2001 From: abxh Date: Thu, 5 Sep 2024 00:28:09 +0000 Subject: [PATCH] deploy: 8dea19875695c1d32195556a683d5852e2d275fe --- annotated.html | 6 +- arena_8h.html | 5 +- arena_8h_source.html | 297 ++++++------- classes.html | 9 +- doxygen_crawl.html | 6 +- examples_2arena_2char_array_8c-example.html | 10 +- examples_2arena_2fhashtable_8c-example.html | 12 +- examples_2list_2list_example_8c-example.html | 6 +- freelist_8h_source.html | 395 ++++++++++-------- search/all_6.js | 35 +- search/all_8.js | 7 +- search/classes_1.js | 5 +- search/classes_2.js | 2 +- search/classes_3.js | 2 +- search/classes_4.js | 4 + search/searchdata.js | 2 +- ...ist__allocation__header__type-members.html | 8 +- ...l__freelist__allocation__header__type.html | 14 +- 18 files changed, 444 insertions(+), 381 deletions(-) create mode 100644 search/classes_4.js rename structfreelist__allocation__header-members.html => structinternal__freelist__allocation__header__type-members.html (81%) rename structfreelist__allocation__header.html => structinternal__freelist__allocation__header__type.html (82%) diff --git a/annotated.html b/annotated.html index 260c1ba6..99497bbb 100644 --- a/annotated.html +++ b/annotated.html @@ -95,9 +95,9 @@  Cfpqueue_element_typeGenerated priority queue element struct type for a given VALUE_TYPE  Cfpqueue_typeGenerated priority queue struct type for a given VALUE_TYPE  Cfqueue_typeGenerated queue struct type for a VALUE_TYPE - Cfreelist_allocation_header - Cfreelist_type - Cfstack_typeGenerated stack struct type for a given VALUE_TYPE + Cfreelist_type + Cfstack_typeGenerated stack struct type for a given VALUE_TYPE + Cinternal_freelist_allocation_header_type  Clist_node_typeIntrusive list node structure  Crbtree_node_typeGenerated red-black tree node struct type for a given KEY_TYPE diff --git a/arena_8h.html b/arena_8h.html index dbb42bab..8e67aaa7 100644 --- a/arena_8h.html +++ b/arena_8h.html @@ -104,6 +104,7 @@ #include <stdint.h>
#include <stdlib.h>
#include <string.h>
+#include <stdalign.h>

Go to the source code of this file.

@@ -115,7 +116,7 @@
- +

Macros

#define DEFAULT_ALIGNMENT   (2 * sizeof(void*))
#define DEFAULT_ALIGNMENT   (alignof(max_align_t))
 Default alignment when no alignment size is given.
 
@@ -151,7 +152,7 @@

- +
#define DEFAULT_ALIGNMENT   (2 * sizeof(void*))#define DEFAULT_ALIGNMENT   (alignof(max_align_t))
diff --git a/arena_8h_source.html b/arena_8h_source.html index efdf2c5e..fa48de9b 100644 --- a/arena_8h_source.html +++ b/arena_8h_source.html @@ -111,163 +111,164 @@
36#include <stdint.h>
37#include <stdlib.h>
38#include <string.h>
-
39
-
46#ifndef DEFAULT_ALIGNMENT
-
47#define DEFAULT_ALIGNMENT (2 * sizeof(void*))
-
48#endif
-
49
-
-
53typedef struct {
-
54 unsigned char* buffer_ptr;
-
55 size_t buffer_length;
-
56 size_t previous_offset;
-
57 size_t current_offset;
-
58} arena_type;
+
39#include <stdalign.h>
+
40
+
47#ifndef DEFAULT_ALIGNMENT
+
48#define DEFAULT_ALIGNMENT (alignof(max_align_t))
+
49#endif
+
50
+
+
54typedef struct {
+
55 unsigned char* buffer_ptr;
+
56 size_t buffer_length;
+
57 size_t previous_offset;
+
58 size_t current_offset;
+
59} arena_type;
-
59
-
61
-
62/* align pointer to the next alignment boundary */
-
63static inline uintptr_t internal_align_forward(const uintptr_t ptr, const size_t align);
-
64
-
66
-
-
74static inline void arena_init(arena_type* arena_ptr, const size_t n, unsigned char backing_buffer[n])
-
75{
-
76 assert(arena_ptr);
-
77 assert(backing_buffer);
-
78 arena_ptr->buffer_ptr = backing_buffer;
-
79 arena_ptr->buffer_length = n;
-
80 arena_ptr->current_offset = 0;
-
81 arena_ptr->previous_offset = 0;
-
82}
+
60
+
62
+
63/* align pointer to the next alignment boundary */
+
64static inline uintptr_t internal_align_forward(const uintptr_t ptr, const size_t align);
+
65
+
67
+
+
75static inline void arena_init(arena_type* arena_ptr, const size_t n, unsigned char backing_buffer[n])
+
76{
+
77 assert(arena_ptr);
+
78 assert(backing_buffer);
+
79 arena_ptr->buffer_ptr = backing_buffer;
+
80 arena_ptr->buffer_length = n;
+
81 arena_ptr->current_offset = 0;
+
82 arena_ptr->previous_offset = 0;
+
83}
-
83
-
-
89static inline void arena_deallocate_all(arena_type* arena_ptr)
-
90{
-
91 assert(arena_ptr);
-
92 arena_ptr->current_offset = 0;
-
93 arena_ptr->previous_offset = 0;
-
94}
+
84
+
+
90static inline void arena_deallocate_all(arena_type* arena_ptr)
+
91{
+
92 assert(arena_ptr);
+
93 arena_ptr->current_offset = 0;
+
94 arena_ptr->previous_offset = 0;
+
95}
-
95
-
-
105static inline void* arena_allocate_aligned(arena_type* arena_ptr, const size_t alignment, const size_t size)
-
106{
-
107 assert(arena_ptr);
-
108 // clang-format off
-
109
-
110 // Align `current_offset` forward to the specified alignment
-
111
-
112 const uintptr_t current_ptr =
-
113 + (uintptr_t) arena_ptr->buffer_ptr
-
114 + (uintptr_t) arena_ptr->current_offset;
-
115
-
116 const uintptr_t relative_offset =
-
117 + (uintptr_t) internal_align_forward(current_ptr, alignment)
-
118 - (uintptr_t) arena_ptr->buffer_ptr;
-
119
-
120 // clang-format on
-
121
-
122 // Check to see if the backing memory has space left
-
123 if (relative_offset + size <= arena_ptr->buffer_length) {
-
124
-
125 arena_ptr->previous_offset = relative_offset;
-
126 arena_ptr->current_offset = relative_offset + size;
-
127
-
128 void* ptr = (unsigned char*)&arena_ptr->buffer_ptr[relative_offset];
-
129 memset(ptr, 0, size); // zero memory by default
-
130
-
131 return ptr;
-
132 }
-
133 return NULL;
-
134}
+
96
+
+
106static inline void* arena_allocate_aligned(arena_type* arena_ptr, const size_t alignment, const size_t size)
+
107{
+
108 assert(arena_ptr);
+
109 // clang-format off
+
110
+
111 // Align `current_offset` forward to the specified alignment
+
112
+
113 const uintptr_t current_ptr =
+
114 + (uintptr_t) arena_ptr->buffer_ptr
+
115 + (uintptr_t) arena_ptr->current_offset;
+
116
+
117 const uintptr_t relative_offset =
+
118 + (uintptr_t) internal_align_forward(current_ptr, alignment)
+
119 - (uintptr_t) arena_ptr->buffer_ptr;
+
120
+
121 // clang-format on
+
122
+
123 // Check to see if the backing memory has space left
+
124 if (relative_offset + size <= arena_ptr->buffer_length) {
+
125
+
126 arena_ptr->previous_offset = relative_offset;
+
127 arena_ptr->current_offset = relative_offset + size;
+
128
+
129 void* ptr = (unsigned char*)&arena_ptr->buffer_ptr[relative_offset];
+
130 memset(ptr, 0, size); // zero memory by default
+
131
+
132 return ptr;
+
133 }
+
134 return NULL;
+
135}
-
135
-
-
144static inline void* arena_allocate(arena_type* arena_ptr, const size_t size)
-
145{
-
146 assert(arena_ptr);
-
147 return arena_allocate_aligned(arena_ptr, DEFAULT_ALIGNMENT, size);
-
148}
+
136
+
+
145static inline void* arena_allocate(arena_type* arena_ptr, const size_t size)
+
146{
+
147 assert(arena_ptr);
+
148 return arena_allocate_aligned(arena_ptr, DEFAULT_ALIGNMENT, size);
+
149}
-
149
-
-
161static inline void* arena_reallocate_aligned(arena_type* arena_ptr, void* old_memory_ptr, const size_t alignment,
-
162 const size_t old_size, const size_t new_size)
-
163{
-
164 assert(arena_ptr);
-
165 assert(is_pow2(alignment));
-
166
-
167 const unsigned char* old_mem_buf = (unsigned char*)old_memory_ptr;
-
168
-
169 if (old_mem_buf == NULL || old_size == 0) {
-
170 return arena_allocate_aligned(arena_ptr, alignment, new_size);
-
171 }
-
172 else if (!(arena_ptr->buffer_ptr <= old_mem_buf && old_mem_buf < arena_ptr->buffer_ptr + arena_ptr->buffer_length)) {
-
173 return NULL;
-
174 }
-
175
-
176 // optimization using previous_offset
-
177 if (arena_ptr->buffer_ptr + arena_ptr->previous_offset == old_mem_buf) {
-
178 arena_ptr->current_offset = arena_ptr->previous_offset + new_size;
-
179 if (new_size > old_size) {
-
180 memset(&arena_ptr->buffer_ptr[arena_ptr->current_offset], 0, new_size - old_size);
-
181 }
-
182 return old_memory_ptr;
-
183 }
-
184
-
185 const size_t copy_size = old_size < new_size ? old_size : new_size;
-
186
-
187 void* new_memory = arena_allocate_aligned(arena_ptr, alignment, new_size);
-
188
-
189 // Copy across old memory to the new memory
-
190 memmove(new_memory, old_mem_buf, copy_size);
-
191
-
192 return new_memory;
-
193}
+
150
+
+
162static inline void* arena_reallocate_aligned(arena_type* arena_ptr, void* old_memory_ptr, const size_t alignment,
+
163 const size_t old_size, const size_t new_size)
+
164{
+
165 assert(arena_ptr);
+
166 assert(is_pow2(alignment));
+
167
+
168 const unsigned char* old_mem_buf = (unsigned char*)old_memory_ptr;
+
169
+
170 if (old_mem_buf == NULL || old_size == 0) {
+
171 return arena_allocate_aligned(arena_ptr, alignment, new_size);
+
172 }
+
173 else if (!(arena_ptr->buffer_ptr <= old_mem_buf && old_mem_buf < arena_ptr->buffer_ptr + arena_ptr->buffer_length)) {
+
174 return NULL;
+
175 }
+
176
+
177 // optimization using previous_offset
+
178 if (arena_ptr->buffer_ptr + arena_ptr->previous_offset == old_mem_buf) {
+
179 arena_ptr->current_offset = arena_ptr->previous_offset + new_size;
+
180 if (new_size > old_size) {
+
181 memset(&arena_ptr->buffer_ptr[arena_ptr->current_offset], 0, new_size - old_size);
+
182 }
+
183 return old_memory_ptr;
+
184 }
+
185
+
186 const size_t copy_size = old_size < new_size ? old_size : new_size;
+
187
+
188 void* new_memory = arena_allocate_aligned(arena_ptr, alignment, new_size);
+
189
+
190 // Copy across old memory to the new memory
+
191 memmove(new_memory, old_mem_buf, copy_size);
+
192
+
193 return new_memory;
+
194}
-
194
-
-
205static inline void* arena_reallocate(arena_type* arena_ptr, void* old_memory_ptr, const size_t old_size, const size_t new_size)
-
206{
-
207 assert(arena_ptr);
-
208 return arena_reallocate_aligned(arena_ptr, old_memory_ptr, DEFAULT_ALIGNMENT, old_size, new_size);
-
209}
+
195
+
+
206static inline void* arena_reallocate(arena_type* arena_ptr, void* old_memory_ptr, const size_t old_size, const size_t new_size)
+
207{
+
208 assert(arena_ptr);
+
209 return arena_reallocate_aligned(arena_ptr, old_memory_ptr, DEFAULT_ALIGNMENT, old_size, new_size);
+
210}
-
210
-
212static inline uintptr_t internal_align_forward(const uintptr_t ptr, const size_t align)
-
213{
-
214 assert(is_pow2(align));
-
215
-
216 const uintptr_t p = ptr;
-
217 const uintptr_t a = (uintptr_t)align;
-
218 const uintptr_t r = p & (a - 1); // Same as (p % a) but faster as 'a' is a power of two
-
219
-
220 /*
-
221 for alignment 8:
-
222 alignment_padding = ... , 0, 7, 6, 5, 4, 3, 2, 1, 0, ...
-
223 /|\ /|\
-
224 (at alignment boundaries) | |
-
225 */
-
226 const uintptr_t alignment_padding = ((r != 0) ? 1 : 0) * (a - r);
-
227
-
228 return p + alignment_padding;
-
229}
-
DEFAULT_ALIGNMENT
#define DEFAULT_ALIGNMENT
Default alignment when no alignment size is given.
Definition arena.h:47
-
arena_allocate
static void * arena_allocate(arena_type *arena_ptr, const size_t size)
Get the pointer to a chunk of the arena.
Definition arena.h:144
-
arena_init
static void arena_init(arena_type *arena_ptr, const size_t n, unsigned char backing_buffer[n])
Initialize the arena.
Definition arena.h:74
-
arena_deallocate_all
static void arena_deallocate_all(arena_type *arena_ptr)
Deallocate all allocations in the arena.
Definition arena.h:89
-
arena_reallocate
static void * arena_reallocate(arena_type *arena_ptr, void *old_memory_ptr, const size_t old_size, const size_t new_size)
Reallocate a previously allocated chunk in the arena.
Definition arena.h:205
-
arena_reallocate_aligned
static void * arena_reallocate_aligned(arena_type *arena_ptr, void *old_memory_ptr, const size_t alignment, const size_t old_size, const size_t new_size)
Reallocate a previously allocated chunk in the arena. With aligment.
Definition arena.h:161
-
arena_allocate_aligned
static void * arena_allocate_aligned(arena_type *arena_ptr, const size_t alignment, const size_t size)
Get the pointer to a chunk of the arena. With alignment.
Definition arena.h:105
+
211
+
213static inline uintptr_t internal_align_forward(const uintptr_t ptr, const size_t align)
+
214{
+
215 assert(is_pow2(align));
+
216
+
217 const uintptr_t p = ptr;
+
218 const uintptr_t a = (uintptr_t)align;
+
219 const uintptr_t r = p & (a - 1); // Same as (p % a) but faster as 'a' is a power of two
+
220
+
221 /*
+
222 for alignment 8:
+
223 alignment_padding = ... , 0, 7, 6, 5, 4, 3, 2, 1, 0, ...
+
224 /|\ /|\
+
225 (at alignment boundaries) | |
+
226 */
+
227 const uintptr_t alignment_padding = ((r != 0) ? 1 : 0) * (a - r);
+
228
+
229 return p + alignment_padding;
+
230}
+
DEFAULT_ALIGNMENT
#define DEFAULT_ALIGNMENT
Default alignment when no alignment size is given.
Definition arena.h:48
+
arena_allocate
static void * arena_allocate(arena_type *arena_ptr, const size_t size)
Get the pointer to a chunk of the arena.
Definition arena.h:145
+
arena_init
static void arena_init(arena_type *arena_ptr, const size_t n, unsigned char backing_buffer[n])
Initialize the arena.
Definition arena.h:75
+
arena_deallocate_all
static void arena_deallocate_all(arena_type *arena_ptr)
Deallocate all allocations in the arena.
Definition arena.h:90
+
arena_reallocate
static void * arena_reallocate(arena_type *arena_ptr, void *old_memory_ptr, const size_t old_size, const size_t new_size)
Reallocate a previously allocated chunk in the arena.
Definition arena.h:206
+
arena_reallocate_aligned
static void * arena_reallocate_aligned(arena_type *arena_ptr, void *old_memory_ptr, const size_t alignment, const size_t old_size, const size_t new_size)
Reallocate a previously allocated chunk in the arena. With aligment.
Definition arena.h:162
+
arena_allocate_aligned
static void * arena_allocate_aligned(arena_type *arena_ptr, const size_t alignment, const size_t size)
Get the pointer to a chunk of the arena. With alignment.
Definition arena.h:106
is_pow2.h
Check if a number is a power of two.
is_pow2
static size_t is_pow2(const size_t x)
Check if a number is a power of two.
Definition is_pow2.h:33
-
arena_type
Arena data struct.
Definition arena.h:53
-
arena_type::previous_offset
size_t previous_offset
Previous offset describing space allocated in buffer.
Definition arena.h:56
-
arena_type::buffer_length
size_t buffer_length
Underlying buffer length.
Definition arena.h:55
-
arena_type::buffer_ptr
unsigned char * buffer_ptr
Underlying buffer pointer.
Definition arena.h:54
-
arena_type::current_offset
size_t current_offset
Current offset describing space allocated in buffer.
Definition arena.h:57
+
arena_type
Arena data struct.
Definition arena.h:54
+
arena_type::previous_offset
size_t previous_offset
Previous offset describing space allocated in buffer.
Definition arena.h:57
+
arena_type::buffer_length
size_t buffer_length
Underlying buffer length.
Definition arena.h:56
+
arena_type::buffer_ptr
unsigned char * buffer_ptr
Underlying buffer pointer.
Definition arena.h:55
+
arena_type::current_offset
size_t current_offset
Current offset describing space allocated in buffer.
Definition arena.h:58
diff --git a/classes.html b/classes.html index 1576cf58..07d12f43 100644 --- a/classes.html +++ b/classes.html @@ -87,18 +87,21 @@
Class Index
-
A | F | L | R
+
A | F | I | L | R
A
arena_type
F
-
fhashtable_slot_type
fhashtable_type
fpqueue_element_type
fpqueue_type
fqueue_type
freelist_allocation_header
freelist_type
fstack_type
+
fhashtable_slot_type
fhashtable_type
fpqueue_element_type
fpqueue_type
fqueue_type
freelist_type
fstack_type
+
I
+
internal_freelist_allocation_header_type
+
L
list_node_type
-
+
R
rbtree_node_type
diff --git a/doxygen_crawl.html b/doxygen_crawl.html index cb61a6f9..baab07a3 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -55,12 +55,12 @@ - - + + @@ -301,12 +301,12 @@ - + diff --git a/examples_2arena_2char_array_8c-example.html b/examples_2arena_2char_array_8c-example.html index 8e3f5427..9a7c8841 100644 --- a/examples_2arena_2char_array_8c-example.html +++ b/examples_2arena_2char_array_8c-example.html @@ -152,11 +152,11 @@
free(buf);
}
arena.h
Arena allocator.
-
arena_init
static void arena_init(arena_type *arena_ptr, const size_t n, unsigned char backing_buffer[n])
Initialize the arena.
Definition arena.h:74
-
arena_deallocate_all
static void arena_deallocate_all(arena_type *arena_ptr)
Deallocate all allocations in the arena.
Definition arena.h:89
-
arena_reallocate_aligned
static void * arena_reallocate_aligned(arena_type *arena_ptr, void *old_memory_ptr, const size_t alignment, const size_t old_size, const size_t new_size)
Reallocate a previously allocated chunk in the arena. With aligment.
Definition arena.h:161
-
arena_allocate_aligned
static void * arena_allocate_aligned(arena_type *arena_ptr, const size_t alignment, const size_t size)
Get the pointer to a chunk of the arena. With alignment.
Definition arena.h:105
-
arena_type
Arena data struct.
Definition arena.h:53
+
arena_init
static void arena_init(arena_type *arena_ptr, const size_t n, unsigned char backing_buffer[n])
Initialize the arena.
Definition arena.h:75
+
arena_deallocate_all
static void arena_deallocate_all(arena_type *arena_ptr)
Deallocate all allocations in the arena.
Definition arena.h:90
+
arena_reallocate_aligned
static void * arena_reallocate_aligned(arena_type *arena_ptr, void *old_memory_ptr, const size_t alignment, const size_t old_size, const size_t new_size)
Reallocate a previously allocated chunk in the arena. With aligment.
Definition arena.h:162
+
arena_allocate_aligned
static void * arena_allocate_aligned(arena_type *arena_ptr, const size_t alignment, const size_t size)
Get the pointer to a chunk of the arena. With alignment.
Definition arena.h:106
+
arena_type
Arena data struct.
Definition arena.h:54
diff --git a/examples_2arena_2fhashtable_8c-example.html b/examples_2arena_2fhashtable_8c-example.html index b92e07bf..6aa6981b 100644 --- a/examples_2arena_2fhashtable_8c-example.html +++ b/examples_2arena_2fhashtable_8c-example.html @@ -115,8 +115,8 @@
assert(ht->count == 0);
arena_type arena;
-
arena_init(&arena, sizeof(buf), buf); // note that the arena also considers alignment details
-
// and can be used to store different types simultaneously.
+
arena_init(&arena, sizeof(buf), buf); /* note that the arena also considers alignment details
+
and can be used to store different types simultaneously. */
char* egg_str_ptr = arena_allocate_aligned(&arena, alignof(char), sizeof("egg"));
if (!egg_str_ptr) {
@@ -167,12 +167,12 @@
strint_ht_destroy(ht);
}
arena.h
Arena allocator.
-
arena_allocate
static void * arena_allocate(arena_type *arena_ptr, const size_t size)
Get the pointer to a chunk of the arena.
Definition arena.h:144
-
arena_init
static void arena_init(arena_type *arena_ptr, const size_t n, unsigned char backing_buffer[n])
Initialize the arena.
Definition arena.h:74
-
arena_allocate_aligned
static void * arena_allocate_aligned(arena_type *arena_ptr, const size_t alignment, const size_t size)
Get the pointer to a chunk of the arena. With alignment.
Definition arena.h:105
+
arena_allocate
static void * arena_allocate(arena_type *arena_ptr, const size_t size)
Get the pointer to a chunk of the arena.
Definition arena.h:145
+
arena_init
static void arena_init(arena_type *arena_ptr, const size_t n, unsigned char backing_buffer[n])
Initialize the arena.
Definition arena.h:75
+
arena_allocate_aligned
static void * arena_allocate_aligned(arena_type *arena_ptr, const size_t alignment, const size_t size)
Get the pointer to a chunk of the arena. With alignment.
Definition arena.h:106
fhashtable.h
Fixed-size open-adressing hashtable (robin hood hashing)
fnvhash.h
FNV-1a hashing function.
-
arena_type
Arena data struct.
Definition arena.h:53
+
arena_type
Arena data struct.
Definition arena.h:54
diff --git a/examples_2list_2list_example_8c-example.html b/examples_2list_2list_example_8c-example.html index 0cb19ac4..1ce9771b 100644 --- a/examples_2list_2list_example_8c-example.html +++ b/examples_2list_2list_example_8c-example.html @@ -277,8 +277,8 @@
list_queue();
}
arena.h
Arena allocator.
-
arena_init
static void arena_init(arena_type *arena_ptr, const size_t n, unsigned char backing_buffer[n])
Initialize the arena.
Definition arena.h:74
-
arena_allocate_aligned
static void * arena_allocate_aligned(arena_type *arena_ptr, const size_t alignment, const size_t size)
Get the pointer to a chunk of the arena. With alignment.
Definition arena.h:105
+
arena_init
static void arena_init(arena_type *arena_ptr, const size_t n, unsigned char backing_buffer[n])
Initialize the arena.
Definition arena.h:75
+
arena_allocate_aligned
static void * arena_allocate_aligned(arena_type *arena_ptr, const size_t alignment, const size_t size)
Get the pointer to a chunk of the arena. With alignment.
Definition arena.h:106
list.h
Intrusive circular doubly linked list.
list_node_add_before
static void list_node_add_before(list_node_type *node_ptr, list_node_type *next_ptr)
Add a node before the given node.
Definition list.h:159
list_node_remove
static list_node_type * list_node_remove(list_node_type *node_ptr)
Remove a node and deattach it from the list it resides in.
Definition list.h:178
@@ -289,7 +289,7 @@
list_node_init
static void list_node_init(list_node_type *node_ptr)
Initialize a list node.
Definition list.h:68
list_node_is_tail
static bool list_node_is_tail(const list_node_type *node_ptr, const list_node_type *tail_ptr)
Check if a given list node is the tail of the list.
Definition list.h:127
list_node_entry
#define list_node_entry(node_ptr, container_type, node_member_name)
Get the pointer to the container instance, given a pointer to to the node member instance,...
Definition list.h:51
-
arena_type
Arena data struct.
Definition arena.h:53
+
arena_type
Arena data struct.
Definition arena.h:54
list_node_type
Intrusive list node structure.
Definition list.h:36
list_node_type::prev_ptr
struct list_node_type * prev_ptr
prev node pointer.
Definition list.h:37
list_node_type::next_ptr
struct list_node_type * next_ptr
next node pointer.
Definition list.h:38
diff --git a/freelist_8h_source.html b/freelist_8h_source.html index ec3adf58..f54dde01 100644 --- a/freelist_8h_source.html +++ b/freelist_8h_source.html @@ -93,188 +93,243 @@
1#pragma once
2
-
3#include <stdbool.h>
-
4#include <stddef.h>
-
5#include <stdint.h>
-
6
-
7#include "is_pow2.h"
-
8
-
15#ifndef DEFAULT_ALIGNMENT
-
16#define DEFAULT_ALIGNMENT (2 * sizeof(void*))
-
17#endif
-
18
-
19#define NAME internal_freelist
-
20#define KEY_TYPE size_t
-
21#define KEY_IS_STRICTLY_LESS(a, b) ((a) < (b))
-
22#include "rbtree.h"
-
23
-
-
24typedef struct {
-
25 size_t block_size;
-
26 size_t padding;
-
27} freelist_allocation_header;
+
3#include <stdalign.h>
+
4#include <stdbool.h>
+
5#include <stddef.h>
+
6#include <stdint.h>
+
7
+
8#include "is_pow2.h"
+
9
+
16#ifndef DEFAULT_ALIGNMENT
+
17#define DEFAULT_ALIGNMENT (alignof(max_align_t))
+
18#endif
+
19
+
20#define NAME internal_freelist
+
21#define KEY_TYPE size_t
+
22#define KEY_IS_STRICTLY_LESS(a, b) ((a) < (b))
+
23#include "rbtree.h"
+
24
+
+
25typedef struct {
+
26 size_t block_size;
+
27 size_t padding;
+
28} internal_freelist_allocation_header_type;
-
28
-
-
29typedef struct {
-
30 unsigned char* buffer_ptr;
-
31 size_t buffer_length;
-
32 size_t used_length;
-
33 internal_freelist_node_type* rb_rootptr;
-
34} freelist_type;
+
29
+
+
30typedef struct {
+
31 unsigned char* buffer_ptr;
+
32 size_t buffer_length;
+
33 size_t used_length;
+
34 internal_freelist_node_type* rb_rootptr;
+
35} freelist_type;
-
35
-
37static inline size_t internal_calculate_padding_with_header_size(const uintptr_t ptr, const uintptr_t alignment,
-
38 const size_t header_size);
-
39static inline bool internal_freelist_node_is_best(internal_freelist_node_type* node, const size_t required_space,
-
40 const size_t smallest_diff);
-
41static inline internal_freelist_node_type* internal_freelist_find_best(freelist_type* freelist_ptr, const size_t alignment,
-
42 const size_t size, size_t* padding_);
-
43static inline void internal_freelist_coalescence(freelist_type* freelist_ptr, internal_freelist_node_type* free_node);
-
45
-
46static inline void freelist_free_all(freelist_type* freelist_ptr)
-
47{
-
48 assert(freelist_ptr);
-
49
-
50 freelist_ptr->used_length = 0;
-
51 internal_freelist_node_type* first = (internal_freelist_node_type*)freelist_ptr->buffer_ptr;
-
52 freelist_ptr->rb_rootptr = first;
-
53 internal_freelist_node_init(first, freelist_ptr->buffer_length);
-
54}
-
55
-
56static inline void freelist_init(freelist_type* freelist_ptr, const size_t n, unsigned char backing_buffer[n])
-
57{
-
58 assert(freelist_ptr);
-
59 assert(backing_buffer);
-
60
-
61 freelist_ptr->buffer_ptr = backing_buffer;
-
62 freelist_ptr->buffer_length = n;
-
63 freelist_free_all(freelist_ptr);
-
64}
-
65
-
66static inline void* freelist_allocate_aligned(freelist_type* freelist_ptr, const size_t size, const size_t alignment)
-
67{
-
68 assert(freelist_ptr);
-
69 assert(is_pow2(alignment));
-
70
-
71 const size_t size_ = size < sizeof(internal_freelist_node_type) ? sizeof(internal_freelist_node_type) : size;
-
72 const size_t alignment_ = alignment < 8 ? 8 : alignment;
-
73
-
74 size_t padding_with_header_size = 0;
-
75 internal_freelist_node_type* node = internal_freelist_find_best(freelist_ptr, alignment, size, &padding_with_header_size);
-
76 if (node == NULL) {
-
77 return NULL;
-
78 }
-
79
-
80 const size_t alignment_padding = padding_with_header_size - sizeof(freelist_allocation_header);
-
81 const size_t required_space = padding_with_header_size + size;
-
82 const size_t block_size = node->key;
-
83 const size_t remaining = block_size - required_space;
-
84
-
85 if (remaining > 0) {
-
86 internal_freelist_node_type* new_node = (internal_freelist_node_type*)((char*)node + required_space);
-
87 internal_freelist_node_init(new_node, remaining);
-
88 internal_freelist_insert_node(&freelist_ptr->rb_rootptr, new_node);
-
89 }
-
90
-
91 internal_freelist_delete_node(&freelist_ptr->rb_rootptr, node);
+
36
+
38static inline size_t internal_calculate_padding_with_header_size(const uintptr_t ptr, const uintptr_t alignment,
+
39 const size_t header_size);
+
40static inline bool internal_freelist_node_is_best(internal_freelist_node_type* node, const size_t required_space,
+
41 const size_t smallest_diff);
+
42static inline internal_freelist_node_type* internal_freelist_find_best(freelist_type* freelist_ptr, const size_t alignment,
+
43 const size_t size, size_t* padding_);
+
44static inline void internal_freelist_coalescence(freelist_type* freelist_ptr, internal_freelist_node_type* free_node);
+
46
+
47static inline void freelist_deallocate_all(freelist_type* freelist_ptr)
+
48{
+
49 assert(freelist_ptr);
+
50
+
51 freelist_ptr->used_length = 0;
+
52 internal_freelist_node_type* first = (internal_freelist_node_type*)freelist_ptr->buffer_ptr;
+
53 freelist_ptr->rb_rootptr = first;
+
54 internal_freelist_node_init(first, freelist_ptr->buffer_length);
+
55}
+
56
+
57static inline void freelist_init(freelist_type* freelist_ptr, const size_t n, unsigned char backing_buffer[n])
+
58{
+
59 assert(freelist_ptr);
+
60 assert(backing_buffer);
+
61
+
62 freelist_ptr->buffer_ptr = backing_buffer;
+
63 freelist_ptr->buffer_length = n;
+
64 freelist_deallocate_all(freelist_ptr);
+
65}
+
66
+
67static inline void* freelist_allocate_aligned(freelist_type* freelist_ptr, const size_t size, const size_t alignment)
+
68{
+
69 assert(freelist_ptr);
+
70 assert(is_pow2(alignment));
+
71
+
72 const size_t size_ = size < sizeof(internal_freelist_node_type) ? sizeof(internal_freelist_node_type) : size;
+
73 const size_t alignment_ = alignment < DEFAULT_ALIGNMENT ? DEFAULT_ALIGNMENT : alignment;
+
74
+
75 size_t padding_with_header_size = 0;
+
76 internal_freelist_node_type* node = internal_freelist_find_best(freelist_ptr, alignment_, size_, &padding_with_header_size);
+
77
+
78 if (node == NULL) {
+
79 return NULL;
+
80 }
+
81
+
82 const size_t alignment_padding = padding_with_header_size - sizeof(internal_freelist_allocation_header_type);
+
83 const size_t required_space = padding_with_header_size + size_;
+
84 const size_t block_size = node->key;
+
85 const size_t remaining = block_size - required_space;
+
86
+
87 if (remaining > 0) {
+
88 internal_freelist_node_type* new_node = (internal_freelist_node_type*)((char*)node + required_space);
+
89 internal_freelist_node_init(new_node, remaining);
+
90 internal_freelist_insert_node(&freelist_ptr->rb_rootptr, new_node);
+
91 }
92
-
93 freelist_allocation_header* header_ptr = (freelist_allocation_header*)((char*)node + alignment_padding);
-
94 header_ptr->block_size = required_space;
-
95 header_ptr->padding = alignment_padding;
-
96
-
97 freelist_ptr->used_length += required_space;
-
98
-
99 return (void*)((char*)header_ptr + sizeof(freelist_allocation_header));
-
100}
+
93 internal_freelist_delete_node(&freelist_ptr->rb_rootptr, node);
+
94
+
95 internal_freelist_allocation_header_type* header_ptr;
+
96 header_ptr = (internal_freelist_allocation_header_type*)((char*)node + alignment_padding);
+
97 header_ptr->block_size = required_space;
+
98 header_ptr->padding = alignment_padding;
+
99
+
100 freelist_ptr->used_length += required_space;
101
-
102static inline void* freelist_allocate(freelist_type* freelist_ptr, const size_t size)
-
103{
-
104 return freelist_allocate_aligned(freelist_ptr, size, DEFAULT_ALIGNMENT);
-
105}
-
106
-
108
-
109static inline size_t internal_calculate_padding_with_header_size(const uintptr_t ptr, const uintptr_t alignment,
-
110 const size_t header_size)
+
102 return (void*)((char*)header_ptr + sizeof(internal_freelist_allocation_header_type));
+
103}
+
104
+
105static inline void* freelist_allocate(freelist_type* freelist_ptr, const size_t size)
+
106{
+
107 return freelist_allocate_aligned(freelist_ptr, size, DEFAULT_ALIGNMENT);
+
108}
+
109
+
110static inline void freelist_deallocate(freelist_type* freelist_ptr, void* ptr)
111{
-
112 assert(is_pow2(alignment));
-
113 assert(header_size != 0);
+
112 assert(freelist_ptr);
+
113 assert(ptr);
114
-
115 const uintptr_t p = ptr;
-
116 const uintptr_t a = alignment;
-
117 const uintptr_t r = p & (a - 1); // p % a
+
115 internal_freelist_allocation_header_type* header;
+
116 header = (internal_freelist_allocation_header_type*)((char*)ptr - sizeof(internal_freelist_allocation_header_type));
+
117 internal_freelist_node_type* free_node = (internal_freelist_node_type*)header;
118
-
119 /*
-
120 for alignment 8:
-
121 alignment_padding = ... , 0, 7, 6, 5, 4, 3, 2, 1, 0, ...
-
122 /|\ /|\
-
123 (at alignment boundaries) | |
-
124 */
-
125 const uintptr_t alignment_padding = ((r != 0) ? 1 : 0) * (a - r);
-
126
-
127 if (alignment_padding >= (uintptr_t)header_size) {
-
128 /*
-
129 If alignment_padding >= header_size,
-
130 then the section `(uintptr_t)alignment_padding - header_size` can be used.
-
131 */
-
132 return (size_t)alignment_padding;
-
133 }
-
134 else {
-
135 const uintptr_t needed_space = (uintptr_t)header_size - alignment_padding;
-
136 const bool header_is_aligned = (needed_space & (a - 1)) == 0;
-
137
-
138 if (header_is_aligned) {
-
139 return header_size;
-
140 }
-
141 else {
-
142 return (size_t)(alignment_padding + a * (1 + (needed_space / a)));
-
143 }
-
144 }
-
145}
-
146
-
147static inline bool internal_freelist_node_is_best(internal_freelist_node_type* node, const size_t required_space,
-
148 const size_t smallest_diff)
-
149{
-
150 const size_t block_size = node->key;
-
151 return block_size >= required_space && (block_size - required_space < smallest_diff);
-
152}
-
153
-
154static inline internal_freelist_node_type* internal_freelist_find_best(freelist_type* freelist_ptr, const size_t alignment,
-
155 const size_t size, size_t* padding_)
-
156{
-
157 size_t smallest_diff = SIZE_MAX;
+
119 internal_freelist_node_init(free_node, header->padding + header->block_size);
+
120
+
121 internal_freelist_insert_node(&freelist_ptr->rb_rootptr, free_node);
+
122
+
123 freelist_ptr->used_length -= free_node->key;
+
124
+
125 internal_freelist_coalescence(freelist_ptr, free_node);
+
126}
+
127
+
129
+
130static inline size_t internal_calculate_padding_with_header_size(const uintptr_t ptr, const uintptr_t alignment,
+
131 const size_t header_size)
+
132{
+
133 assert(is_pow2(alignment));
+
134 assert(header_size != 0);
+
135
+
136 const uintptr_t p = ptr;
+
137 const uintptr_t a = alignment;
+
138 const uintptr_t r = p & (a - 1); // p % a
+
139
+
140 /*
+
141 for alignment 8:
+
142 alignment_padding = ... , 0, 7, 6, 5, 4, 3, 2, 1, 0, ...
+
143 /|\ /|\
+
144 (at alignment boundaries) | |
+
145 */
+
146 const uintptr_t alignment_padding = ((r != 0) ? 1 : 0) * (a - r);
+
147
+
148 if (alignment_padding >= (uintptr_t)header_size) {
+
149 /*
+
150 If alignment_padding >= header_size,
+
151 then the section `(uintptr_t)alignment_padding - header_size` can be used.
+
152 */
+
153 return (size_t)alignment_padding;
+
154 }
+
155 else {
+
156 const uintptr_t needed_space = (uintptr_t)header_size - alignment_padding;
+
157 const bool header_is_aligned = (needed_space & (a - 1)) == 0;
158
-
159 internal_freelist_node_type* node = freelist_ptr->rb_rootptr;
-
160 internal_freelist_node_type* best_node = NULL;
-
161
-
162 while (node != NULL) {
-
163 const size_t padding_with_header_size =
-
164 internal_calculate_padding_with_header_size((uintptr_t)node, (uintptr_t)alignment, sizeof(freelist_allocation_header));
-
165 const size_t required_space = padding_with_header_size + size;
-
166
-
167 if (internal_freelist_node_is_best(node, required_space, smallest_diff)) {
-
168 best_node = node;
-
169 const size_t block_size = node->key;
-
170 smallest_diff = block_size - required_space;
-
171 }
-
172 if (node->left_ptr != NULL && node->left_ptr->key >= required_space) {
-
173 node = node->left_ptr;
-
174 }
-
175 }
-
176
-
177 if (padding_) {
-
178 *padding_ = (!best_node) ? 0
-
179 : internal_calculate_padding_with_header_size((uintptr_t)best_node, (uintptr_t)alignment,
-
180 sizeof(freelist_allocation_header));
-
181 }
+
159 if (header_is_aligned) {
+
160 return header_size;
+
161 }
+
162 else {
+
163 return (size_t)(alignment_padding + a * (1 + (needed_space / a)));
+
164 }
+
165 }
+
166}
+
167
+
168static inline bool internal_freelist_node_is_best(internal_freelist_node_type* node, const size_t required_space,
+
169 const size_t smallest_diff)
+
170{
+
171 const size_t block_size = node->key;
+
172 return block_size >= required_space && (block_size - required_space < smallest_diff);
+
173}
+
174
+
175static inline internal_freelist_node_type* internal_freelist_find_best(freelist_type* freelist_ptr, const size_t alignment,
+
176 const size_t size, size_t* padding_)
+
177{
+
178 size_t smallest_diff = SIZE_MAX;
+
179
+
180 internal_freelist_node_type* node = freelist_ptr->rb_rootptr;
+
181 internal_freelist_node_type* best_node = NULL;
182
-
183 return best_node;
-
184}
+
183 while (node != NULL) {
+
184 const size_t padding_with_header_size = internal_calculate_padding_with_header_size(
+
185 (uintptr_t)node, (uintptr_t)alignment, sizeof(internal_freelist_allocation_header_type));
+
186 const size_t required_space = padding_with_header_size + size;
+
187
+
188 if (internal_freelist_node_is_best(node, required_space, smallest_diff)) {
+
189 best_node = node;
+
190 const size_t block_size = node->key;
+
191 smallest_diff = block_size - required_space;
+
192 }
+
193 if (node->left_ptr != NULL) {
+
194 node = node->left_ptr;
+
195 }
+
196 else {
+
197 break;
+
198 }
+
199 }
+
200
+
201 if (padding_) {
+
202 *padding_ = (!best_node) ? 0
+
203 : internal_calculate_padding_with_header_size((uintptr_t)best_node, (uintptr_t)alignment,
+
204 sizeof(internal_freelist_allocation_header_type));
+
205 }
+
206
+
207 return best_node;
+
208}
+
209
+
210static inline void internal_freelist_coalescence(freelist_type* freelist_ptr, internal_freelist_node_type* node_ptr)
+
211{
+
212 void* next_ptr = (char*)node_ptr + node_ptr->key;
+
213 if (node_ptr->left_ptr != NULL && next_ptr == node_ptr->left_ptr) {
+
214 const size_t new_block_size = node_ptr->key + node_ptr->left_ptr->key;
+
215 internal_freelist_delete_node(&freelist_ptr->rb_rootptr, node_ptr->left_ptr);
+
216 internal_freelist_delete_node(&freelist_ptr->rb_rootptr, node_ptr);
+
217 internal_freelist_node_init(node_ptr, new_block_size);
+
218 internal_freelist_insert_node(&freelist_ptr->rb_rootptr, node_ptr);
+
219
+
220 // note:
+
221 // possible optimization with some specialized rbtree operation to increase key?
+
222 }
+
223 if (node_ptr->right_ptr != NULL && next_ptr == node_ptr->right_ptr) {
+
224 const size_t new_block_size = node_ptr->key + node_ptr->right_ptr->key;
+
225 internal_freelist_delete_node(&freelist_ptr->rb_rootptr, node_ptr->right_ptr);
+
226 internal_freelist_delete_node(&freelist_ptr->rb_rootptr, node_ptr);
+
227 internal_freelist_node_init(node_ptr, new_block_size);
+
228 internal_freelist_insert_node(&freelist_ptr->rb_rootptr, node_ptr);
+
229 }
+
230 internal_freelist_node_type* parent_ptr = internal_freelist_node_get_parent_ptr(node_ptr);
+
231 if (parent_ptr != NULL && (void*)((char*)parent_ptr + parent_ptr->key) == node_ptr) {
+
232 const size_t new_block_size = parent_ptr->key + node_ptr->key;
+
233 internal_freelist_delete_node(&freelist_ptr->rb_rootptr, node_ptr);
+
234 internal_freelist_delete_node(&freelist_ptr->rb_rootptr, parent_ptr);
+
235 internal_freelist_node_init(parent_ptr, new_block_size);
+
236 internal_freelist_insert_node(&freelist_ptr->rb_rootptr, parent_ptr);
+
237 }
+
238}
+
DEFAULT_ALIGNMENT
#define DEFAULT_ALIGNMENT
Default alignment when no alignment size is given.
Definition arena.h:48
is_pow2.h
Check if a number is a power of two.
is_pow2
static size_t is_pow2(const size_t x)
Check if a number is a power of two.
Definition is_pow2.h:33
rbtree.h
Intrusive red-black tree.
-
freelist_allocation_header
Definition freelist.h:24
-
freelist_type
Definition freelist.h:29
+
freelist_type
Definition freelist.h:30
+
internal_freelist_allocation_header_type
Definition freelist.h:25
diff --git a/search/all_6.js b/search/all_6.js index fdd17a21..db90f1d4 100644 --- a/search/all_6.js +++ b/search/all_6.js @@ -54,22 +54,21 @@ var searchData= ['fqueue_5fis_5ffull_51',['fqueue_is_full',['../fqueue_8h.html#a9aeaf352ec10b2542c37ae4cbddf8ed2',1,'fqueue.h']]], ['fqueue_5fpeek_52',['fqueue_peek',['../fqueue_8h.html#a6014294c747d7281db09a994b653ebc3',1,'fqueue.h']]], ['fqueue_5ftype_53',['fqueue_type',['../structfqueue__type.html',1,'']]], - ['freelist_5fallocation_5fheader_54',['freelist_allocation_header',['../structfreelist__allocation__header.html',1,'']]], - ['freelist_5ftype_55',['freelist_type',['../structfreelist__type.html',1,'']]], - ['fstack_2eh_56',['fstack.h',['../fstack_8h.html',1,'']]], - ['fstack_5fat_57',['fstack_at',['../fstack_8h.html#acab6831aaa75e8a575b33f7a766af721',1,'fstack.h']]], - ['fstack_5fclear_58',['fstack_clear',['../fstack_8h.html#a4225ef3dd04aaca4d80e44247de01fcd',1,'fstack.h']]], - ['fstack_5fcopy_59',['fstack_copy',['../fstack_8h.html#ab2368657e792dbaa4496633daa06064d',1,'fstack.h']]], - ['fstack_5fcreate_60',['fstack_create',['../fstack_8h.html#ae21db93f52ef49428faa45b834aebffa',1,'fstack.h']]], - ['fstack_5fdestroy_61',['fstack_destroy',['../fstack_8h.html#a01ace41de207307970f19c57852f38b7',1,'fstack.h']]], - ['fstack_5ffor_5feach_62',['fstack_for_each',['../fstack_8h.html#ab4ce686da462284572ef631b7a201151',1,'fstack.h']]], - ['fstack_5ffor_5feach_5freverse_63',['fstack_for_each_reverse',['../fstack_8h.html#af49eab3b3cfb87396b6e4de58219a084',1,'fstack.h']]], - ['fstack_5fget_5fbottom_64',['fstack_get_bottom',['../fstack_8h.html#a63798821f21640d7efa75905f419d73c',1,'fstack.h']]], - ['fstack_5fget_5ftop_65',['fstack_get_top',['../fstack_8h.html#a9e4c7659b5d081f4c3fe39d63436dda1',1,'fstack.h']]], - ['fstack_5fis_5fempty_66',['fstack_is_empty',['../fstack_8h.html#a79651e631af3ebaf55c9572cf1f557bd',1,'fstack.h']]], - ['fstack_5fis_5ffull_67',['fstack_is_full',['../fstack_8h.html#a0cb7287f7fe7f1532d0c2685bd0436b2',1,'fstack.h']]], - ['fstack_5fpeek_68',['fstack_peek',['../fstack_8h.html#a69d24b9459cb83efcc42b48ae0f683ba',1,'fstack.h']]], - ['fstack_5fpop_69',['fstack_pop',['../fstack_8h.html#a226d7b0f58ac42723c3d27cc283ba851',1,'fstack.h']]], - ['fstack_5fpush_70',['fstack_push',['../fstack_8h.html#a96624be204200fad8045c25c14351152',1,'fstack.h']]], - ['fstack_5ftype_71',['fstack_type',['../structfstack__type.html',1,'']]] + ['freelist_5ftype_54',['freelist_type',['../structfreelist__type.html',1,'']]], + ['fstack_2eh_55',['fstack.h',['../fstack_8h.html',1,'']]], + ['fstack_5fat_56',['fstack_at',['../fstack_8h.html#acab6831aaa75e8a575b33f7a766af721',1,'fstack.h']]], + ['fstack_5fclear_57',['fstack_clear',['../fstack_8h.html#a4225ef3dd04aaca4d80e44247de01fcd',1,'fstack.h']]], + ['fstack_5fcopy_58',['fstack_copy',['../fstack_8h.html#ab2368657e792dbaa4496633daa06064d',1,'fstack.h']]], + ['fstack_5fcreate_59',['fstack_create',['../fstack_8h.html#ae21db93f52ef49428faa45b834aebffa',1,'fstack.h']]], + ['fstack_5fdestroy_60',['fstack_destroy',['../fstack_8h.html#a01ace41de207307970f19c57852f38b7',1,'fstack.h']]], + ['fstack_5ffor_5feach_61',['fstack_for_each',['../fstack_8h.html#ab4ce686da462284572ef631b7a201151',1,'fstack.h']]], + ['fstack_5ffor_5feach_5freverse_62',['fstack_for_each_reverse',['../fstack_8h.html#af49eab3b3cfb87396b6e4de58219a084',1,'fstack.h']]], + ['fstack_5fget_5fbottom_63',['fstack_get_bottom',['../fstack_8h.html#a63798821f21640d7efa75905f419d73c',1,'fstack.h']]], + ['fstack_5fget_5ftop_64',['fstack_get_top',['../fstack_8h.html#a9e4c7659b5d081f4c3fe39d63436dda1',1,'fstack.h']]], + ['fstack_5fis_5fempty_65',['fstack_is_empty',['../fstack_8h.html#a79651e631af3ebaf55c9572cf1f557bd',1,'fstack.h']]], + ['fstack_5fis_5ffull_66',['fstack_is_full',['../fstack_8h.html#a0cb7287f7fe7f1532d0c2685bd0436b2',1,'fstack.h']]], + ['fstack_5fpeek_67',['fstack_peek',['../fstack_8h.html#a69d24b9459cb83efcc42b48ae0f683ba',1,'fstack.h']]], + ['fstack_5fpop_68',['fstack_pop',['../fstack_8h.html#a226d7b0f58ac42723c3d27cc283ba851',1,'fstack.h']]], + ['fstack_5fpush_69',['fstack_push',['../fstack_8h.html#a96624be204200fad8045c25c14351152',1,'fstack.h']]], + ['fstack_5ftype_70',['fstack_type',['../structfstack__type.html',1,'']]] ]; diff --git a/search/all_8.js b/search/all_8.js index ca3af497..d0ee0239 100644 --- a/search/all_8.js +++ b/search/all_8.js @@ -1,6 +1,7 @@ var searchData= [ - ['is_5fpow2_0',['IS_POW2',['../is__pow2_8h.html#a36d931d2e505ad8cd048c723c3581e54',1,'is_pow2.h']]], - ['is_5fpow2_1',['is_pow2',['../is__pow2_8h.html#afdfaaa82d5cd20478f11fa9ed7ae0080',1,'is_pow2.h']]], - ['is_5fpow2_2eh_2',['is_pow2.h',['../is__pow2_8h.html',1,'']]] + ['internal_5ffreelist_5fallocation_5fheader_5ftype_0',['internal_freelist_allocation_header_type',['../structinternal__freelist__allocation__header__type.html',1,'']]], + ['is_5fpow2_1',['IS_POW2',['../is__pow2_8h.html#a36d931d2e505ad8cd048c723c3581e54',1,'is_pow2.h']]], + ['is_5fpow2_2',['is_pow2',['../is__pow2_8h.html#afdfaaa82d5cd20478f11fa9ed7ae0080',1,'is_pow2.h']]], + ['is_5fpow2_2eh_3',['is_pow2.h',['../is__pow2_8h.html',1,'']]] ]; diff --git a/search/classes_1.js b/search/classes_1.js index a106bac0..360cb385 100644 --- a/search/classes_1.js +++ b/search/classes_1.js @@ -5,7 +5,6 @@ var searchData= ['fpqueue_5felement_5ftype_2',['fpqueue_element_type',['../structfpqueue__element__type.html',1,'']]], ['fpqueue_5ftype_3',['fpqueue_type',['../structfpqueue__type.html',1,'']]], ['fqueue_5ftype_4',['fqueue_type',['../structfqueue__type.html',1,'']]], - ['freelist_5fallocation_5fheader_5',['freelist_allocation_header',['../structfreelist__allocation__header.html',1,'']]], - ['freelist_5ftype_6',['freelist_type',['../structfreelist__type.html',1,'']]], - ['fstack_5ftype_7',['fstack_type',['../structfstack__type.html',1,'']]] + ['freelist_5ftype_5',['freelist_type',['../structfreelist__type.html',1,'']]], + ['fstack_5ftype_6',['fstack_type',['../structfstack__type.html',1,'']]] ]; diff --git a/search/classes_2.js b/search/classes_2.js index 578b3801..3ed6988f 100644 --- a/search/classes_2.js +++ b/search/classes_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['list_5fnode_5ftype_0',['list_node_type',['../structlist__node__type.html',1,'']]] + ['internal_5ffreelist_5fallocation_5fheader_5ftype_0',['internal_freelist_allocation_header_type',['../structinternal__freelist__allocation__header__type.html',1,'']]] ]; diff --git a/search/classes_3.js b/search/classes_3.js index 228ff0cc..578b3801 100644 --- a/search/classes_3.js +++ b/search/classes_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['rbtree_5fnode_5ftype_0',['rbtree_node_type',['../structrbtree__node__type.html',1,'']]] + ['list_5fnode_5ftype_0',['list_node_type',['../structlist__node__type.html',1,'']]] ]; diff --git a/search/classes_4.js b/search/classes_4.js new file mode 100644 index 00000000..228ff0cc --- /dev/null +++ b/search/classes_4.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['rbtree_5fnode_5ftype_0',['rbtree_node_type',['../structrbtree__node__type.html',1,'']]] +]; diff --git a/search/searchdata.js b/search/searchdata.js index 2a8dacde..7f11512b 100644 --- a/search/searchdata.js +++ b/search/searchdata.js @@ -1,7 +1,7 @@ var indexSectionsWithContent = { 0: "_abcdefhijklmnoprstvx", - 1: "aflr", + 1: "afilr", 2: "acfilmpr", 3: "afilmr", 4: "_bceklnoprsv", diff --git a/structfreelist__allocation__header-members.html b/structinternal__freelist__allocation__header__type-members.html similarity index 81% rename from structfreelist__allocation__header-members.html rename to structinternal__freelist__allocation__header__type-members.html index 30974612..dd657d83 100644 --- a/structfreelist__allocation__header-members.html +++ b/structinternal__freelist__allocation__header__type-members.html @@ -84,14 +84,14 @@
-
freelist_allocation_header Member List
+
internal_freelist_allocation_header_type Member List
-

This is the complete list of members for freelist_allocation_header, including all inherited members.

+

This is the complete list of members for internal_freelist_allocation_header_type, including all inherited members.

- - + +
block_size (defined in freelist_allocation_header)freelist_allocation_header
padding (defined in freelist_allocation_header)freelist_allocation_header
block_size (defined in internal_freelist_allocation_header_type)internal_freelist_allocation_header_type
padding (defined in internal_freelist_allocation_header_type)internal_freelist_allocation_header_type
diff --git a/structfreelist__allocation__header.html b/structinternal__freelist__allocation__header__type.html similarity index 82% rename from structfreelist__allocation__header.html rename to structinternal__freelist__allocation__header__type.html index abb0c67c..df15358f 100644 --- a/structfreelist__allocation__header.html +++ b/structinternal__freelist__allocation__header__type.html @@ -5,7 +5,7 @@ -data-structures-c: freelist_allocation_header Struct Reference +data-structures-c: internal_freelist_allocation_header_type Struct Reference @@ -86,19 +86,19 @@
Public Attributes | -List of all members
-
freelist_allocation_header Struct Reference
+List of all members
+
internal_freelist_allocation_header_type Struct Reference
- - - + - +

Public Attributes

+
size_t block_size
 
+
 
size_t padding
 
 
The documentation for this struct was generated from the following file: