-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy paththe_entitytainer.h
1190 lines (1002 loc) · 54.7 KB
/
the_entitytainer.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* clang-format on */
/*
the_entitytainer.h - v0.01 - public domain - Anders Elfgren @srekel, 2019
# THE ENTITYTAINER
"Multimap" implementation in C, aimed at game development.
Main purpose is to keep track of hierarchies of entities. This can be useful for attachments (e.g. holding a weapon in
the hand) and inventory (having a piece of cheese in a bag in the backpack on the back of a character) for example.
The name is a pun of entities and containers. If it wasn't obvious.
See github for detailed documentation and the latest version: https://github.com/Srekel/the-entitytainer
## Usage
In *ONE* source file, put:
```C
#define ENTITYTAINER_IMPLEMENTATION
// Define any of these if you wish to override them.
// (There are more. Find them in the beginning of the code.)
#define ENTITYTAINER_assert
#define ENTITYTAINER_memcpy
#include "the_entitytainer.h"
```
Other source files should just include the_entitytainer.h
I recommend looking at the unittest.c file for an example of how to use it, but basically:
```C
int max_num_entries = 1024;
int bucket_sizes[] = { 4, 16, 256 };
int bucket_list_sizes[] = { 4, 2, 2 };
int needed_memory_size = entitytainer_needed_size( max_num_entries, bucket_sizes, bucket_list_sizes, 3 );
void* memory = malloc( needed_memory_size );
TheEntitytainer* entitytainer =
entitytainer_create( memory, needed_memory_size, max_num_entries, bucket_sizes, bucket_list_sizes, 3 );
entitytainer_add_entity( entitytainer, 3 );
entitytainer_add_child( entitytainer, 3, 10 );
int num_children;
TheEntitytainerEntity* children;
entitytainer_get_children( entitytainer, 3, &children, &num_children );
ASSERT( num_children == 1 );
ASSERT( children[0] == 10 );
```
## Notes
See the accompanying unit test projects for references on how to use it.
Or the documentation on the github page.
## References and related stuff
* https://github.com/nothings/stb
* https://github.com/incrediblejr/ijhandlealloc
## License
Public Domain / MIT.
See end of file for license information.
*/
#ifndef INCLUDE_THE_ENTITYTAINER_H
#define INCLUDE_THE_ENTITYTAINER_H
#ifdef __cplusplus
extern "C" {
#endif
#ifndef ENTITYTAINER_ENABLE_WARNINGS
#ifdef _MSC_VER
#pragma warning( push, 0 )
#pragma warning( disable : 4365 )
#pragma warning( \
disable : 5045 ) // Compiler will insert Spectre mitigation for memory load if /Qspectre switch specified
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wold-style-cast"
#pragma clang diagnostic ignored "-Wsign-conversion"
#pragma clang diagnostic ignored "-Wcast-align"
#pragma clang diagnostic ignored "-Wunused-function"
#endif
#endif // ENTITYTAINER_ENABLE_WARNINGS
#ifndef ENTITYTAINER_assert
// #include <assert.h>
#define ENTITYTAINER_assert
#endif
#ifndef ENTITYTAINER_memcpy
#include <string.h>
#define ENTITYTAINER_memcpy memcpy
#endif
#ifndef ENTITYTAINER_memset
#include <string.h>
#define ENTITYTAINER_memset memset
#endif
#ifndef ENTITYTAINER_alignof
#define ENTITYTAINER_alignof( type ) \
offsetof( \
struct { \
char c; \
type d; \
}, \
d )
#endif
#ifndef ENTITYTAINER_Entity
typedef unsigned short TheEntitytainerEntity;
#define ENTITYTAINER_InvalidEntity ( (TheEntitytainerEntity)0u )
#define ENTITYTAINER_EntityFormat "%hu"
#endif
#ifndef ENTITYTAINER_Entry
typedef unsigned short TheEntitytainerEntry;
#define ENTITYTAINER_BucketMask 0x3fff
#define ENTITYTAINER_BucketListBitCount 2
#define ENTITYTAINER_BucketListOffset ( sizeof( TheEntitytainerEntry ) * 8 - ENTITYTAINER_BucketListBitCount )
#endif
#define ENTITYTAINER_NoFreeBucket ( (TheEntitytainerEntity)-1 )
#define ENTITYTAINER_ShrinkMargin 1
#if defined( ENTITYTAINER_STATIC )
#define ENTITYTAINER_API static
#else
#define ENTITYTAINER_API extern
#endif
#define ENTITYTAINER_MAX_BUCKET_LISTS 8
#ifndef ENTITYTAINER_DEFENSIVE_CHECKS
#define ENTITYTAINER_DEFENSIVE_CHECKS 0
#endif
#ifndef ENTITYTAINER_DEFENSIVE_ASSERTS
#define ENTITYTAINER_DEFENSIVE_ASSERTS 0
#endif
struct TheEntitytainerConfig {
void* memory;
int memory_size;
int num_entries;
int bucket_sizes[ENTITYTAINER_MAX_BUCKET_LISTS];
int bucket_list_sizes[ENTITYTAINER_MAX_BUCKET_LISTS];
int num_bucket_lists;
bool remove_with_holes;
bool keep_capacity_on_remove;
// char name[256];
};
typedef struct {
TheEntitytainerEntity* bucket_data;
int bucket_size;
int total_buckets;
int first_free_bucket;
int used_buckets;
} TheEntitytainerBucketList;
typedef struct {
struct TheEntitytainerConfig config;
TheEntitytainerEntry* entry_lookup;
TheEntitytainerEntity* entry_parent_lookup;
TheEntitytainerBucketList* bucket_lists;
int num_bucket_lists;
int entry_lookup_size;
bool remove_with_holes;
bool keep_capacity_on_remove;
} TheEntitytainer;
ENTITYTAINER_API int entitytainer_needed_size( struct TheEntitytainerConfig* config );
ENTITYTAINER_API TheEntitytainer* entitytainer_create( struct TheEntitytainerConfig* config );
ENTITYTAINER_API TheEntitytainer*
entitytainer_realloc( TheEntitytainer* entitytainer_old, void* memory, int memory_size, float growth );
ENTITYTAINER_API bool
entitytainer_needs_realloc( TheEntitytainer* entitytainer, float percent_free, int num_free_buckets );
ENTITYTAINER_API void entitytainer_add_entity( TheEntitytainer* entitytainer, TheEntitytainerEntity entity );
ENTITYTAINER_API void entitytainer_remove_entity( TheEntitytainer* entitytainer, TheEntitytainerEntity entity );
ENTITYTAINER_API void entitytainer_reserve( TheEntitytainer* entitytainer, TheEntitytainerEntity parent, int capacity );
ENTITYTAINER_API void
entitytainer_add_child( TheEntitytainer* entitytainer, TheEntitytainerEntity parent, TheEntitytainerEntity child );
ENTITYTAINER_API void entitytainer_add_child_at_index( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity child,
int index );
ENTITYTAINER_API void entitytainer_remove_child_no_holes( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity child );
ENTITYTAINER_API void entitytainer_remove_child_with_holes( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity child );
ENTITYTAINER_API void entitytainer_get_children( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity** children,
int* num_children,
int* capacity );
ENTITYTAINER_API int entitytainer_num_children( TheEntitytainer* entitytainer, TheEntitytainerEntity parent );
ENTITYTAINER_API int entitytainer_get_child_index( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity child );
ENTITYTAINER_API TheEntitytainerEntity entitytainer_get_parent( TheEntitytainer* entitytainer,
TheEntitytainerEntity child );
ENTITYTAINER_API bool entitytainer_is_added( TheEntitytainer* entitytainer, TheEntitytainerEntity entity );
ENTITYTAINER_API void entitytainer_remove_holes( TheEntitytainer* entitytainer, TheEntitytainerEntity entity );
ENTITYTAINER_API int entitytainer_save( TheEntitytainer* entitytainer, unsigned char* buffer, int buffer_size );
ENTITYTAINER_API TheEntitytainer* entitytainer_load( unsigned char* buffer, int buffer_size );
ENTITYTAINER_API void entitytainer_load_into( TheEntitytainer* entitytainer_dst,
const TheEntitytainer* entitytainer_src );
#ifdef ENTITYTAINER_IMPLEMENTATION
static void* entitytainer__ptr_to_aligned_ptr( void* ptr, int align );
static bool entitytainer__child_in_bucket( TheEntitytainerEntity* bucket,
TheEntitytainerBucketList* bucket_list,
TheEntitytainerEntity child );
ENTITYTAINER_API int
entitytainer_needed_size( struct TheEntitytainerConfig* config ) {
int size_needed = sizeof( TheEntitytainer );
size_needed += config->num_entries * sizeof( TheEntitytainerEntry ); // Lookup
size_needed += config->num_entries * sizeof( TheEntitytainerEntity ); // Reverse lookup
size_needed += config->num_bucket_lists * sizeof( TheEntitytainerBucketList ); // List structs
// Bucket lists
for ( int i = 0; i < config->num_bucket_lists; ++i ) {
size_needed += config->bucket_list_sizes[i] * config->bucket_sizes[i] * sizeof( TheEntitytainerEntity );
}
// Account for struct alignment, with good margins :D
int things_to_align = 1 + config->num_bucket_lists;
int safe_alignment = sizeof( void* ) * 16;
size_needed += things_to_align * safe_alignment;
return size_needed;
}
ENTITYTAINER_API TheEntitytainer*
entitytainer_create( struct TheEntitytainerConfig* config ) {
unsigned char* buffer_start = (unsigned char*)config->memory;
ENTITYTAINER_memset( buffer_start, 0, config->memory_size );
unsigned char* buffer = buffer_start;
buffer = (unsigned char*)entitytainer__ptr_to_aligned_ptr( buffer, (int)ENTITYTAINER_alignof( TheEntitytainer ) );
TheEntitytainer* entitytainer = (TheEntitytainer*)buffer;
entitytainer->num_bucket_lists = config->num_bucket_lists;
entitytainer->remove_with_holes = config->remove_with_holes;
entitytainer->keep_capacity_on_remove = config->keep_capacity_on_remove;
entitytainer->entry_lookup_size = config->num_entries;
ENTITYTAINER_memcpy( &entitytainer->config, config, sizeof( *config ) );
// if ( entitytainer->config.name[0] == 0 ) {
// const char* default_name = "entitytainer";
// ENTITYTAINER_memcpy( entitytainer->config.name, default_name, 12 );
// entitytainer->config.name[12] = 0;
// }
buffer += sizeof( TheEntitytainer );
entitytainer->entry_lookup = (TheEntitytainerEntry*)buffer;
buffer += sizeof( TheEntitytainerEntry ) * config->num_entries;
entitytainer->entry_parent_lookup = (TheEntitytainerEntity*)buffer;
buffer += sizeof( TheEntitytainerEntity ) * config->num_entries;
buffer = (unsigned char*)entitytainer__ptr_to_aligned_ptr( buffer,
(int)ENTITYTAINER_alignof( TheEntitytainerBucketList ) );
entitytainer->bucket_lists = (TheEntitytainerBucketList*)buffer;
unsigned char* bucket_list_end = buffer + sizeof( TheEntitytainerBucketList ) * config->num_bucket_lists;
TheEntitytainerEntity* bucket_data_start = (TheEntitytainerEntity*)bucket_list_end;
TheEntitytainerEntity* bucket_data = bucket_data_start;
for ( int i = 0; i < config->num_bucket_lists; ++i ) {
// Just making sure that we don't go into the bucket data area
ENTITYTAINER_assert( buffer + sizeof( TheEntitytainerBucketList ) <= bucket_list_end,
"Passing end of bucket area" );
// We need to do this because first_free_bucket is stored as an int.
ENTITYTAINER_assert( config->bucket_sizes[i] * sizeof( TheEntitytainerEntity ) >= sizeof( int ) );
TheEntitytainerBucketList* list = (TheEntitytainerBucketList*)buffer;
list->bucket_data = bucket_data;
list->bucket_size = config->bucket_sizes[i];
list->total_buckets = config->bucket_list_sizes[i];
list->first_free_bucket = ENTITYTAINER_NoFreeBucket;
list->used_buckets = 0;
if ( i == 0 ) {
// We need this in order to ensure that we can use 0 as the default "invalid" entry.
list->used_buckets = 1;
}
buffer += sizeof( TheEntitytainerBucketList );
bucket_data += list->bucket_size * list->total_buckets;
}
ENTITYTAINER_assert( *bucket_data_start == 0 );
ENTITYTAINER_assert( (unsigned char*)bucket_data <= buffer_start + config->memory_size );
return entitytainer;
}
ENTITYTAINER_API TheEntitytainer*
entitytainer_realloc( TheEntitytainer* entitytainer_old, void* memory, int memory_size, float growth ) {
ENTITYTAINER_assert( false ); // Not yet implemented
(void)memory_size;
int num_entries = entitytainer_old->entry_lookup_size; // * growth;
int size_needed = sizeof( TheEntitytainer );
size_needed += (int)( num_entries * sizeof( TheEntitytainerEntry ) );
size_needed += (int)( num_entries * sizeof( TheEntitytainerEntity ) );
size_needed += entitytainer_old->num_bucket_lists * sizeof( TheEntitytainerBucketList );
for ( int i = 0; i < entitytainer_old->num_bucket_lists; ++i ) {
TheEntitytainerBucketList* bucket_list = &entitytainer_old->bucket_lists[i];
int old_bucket_size = bucket_list->total_buckets * bucket_list->bucket_size * sizeof( TheEntitytainerEntity );
size_needed += (int)( old_bucket_size * growth );
}
char* buffer = (char*)memory;
TheEntitytainer* entitytainer = (TheEntitytainer*)buffer;
*entitytainer = *entitytainer_old;
entitytainer->entry_lookup_size = num_entries;
buffer += sizeof( TheEntitytainer );
entitytainer->entry_lookup = (TheEntitytainerEntry*)buffer;
buffer += sizeof( TheEntitytainerEntry ) * num_entries;
entitytainer->entry_parent_lookup = (TheEntitytainerEntity*)buffer;
buffer += sizeof( TheEntitytainerEntity ) * num_entries;
// char* bucket_data = buffer + sizeof( TheEntitytainerBucketList ) * entitytainer_old->num_bucket_lists;
// for ( int i = 0; i < entitytainer_old->num_bucket_lists; ++i ) {
// // ENTITYTAINER_assert( bucket_data - buffer > bucket_sizes[i] * bucket_list_sizes[i] ); // >= ?
// TheEntitytainerBucketList* list = (TheEntitytainerBucketList*)buffer;
// list->bucket_data = bucket_data;
// list->bucket_size = entitytainer_old->bucket_lists[i].bucket_size;
// list->total_buckets = entitytainer_old->bucket_lists[i].total_buckets;
// list->first_free_bucket = entitytainer_old->bucket_lists[i].first_free_bucket;
// list->used_buckets = entitytainer_old->bucket_lists[i].used_buckets;
// int old_buffer_size = entitytainer_old->bucket_lists[i].total_buckets * sizeof( TheEntitytainerEntry );
// ENTITYTAINER_memcpy( list->bucket_data, entitytainer_old->bucket_lists[i].bucket_data, old_buffer_size );
// buffer += sizeof( TheEntitytainerBucketList );
// bucket_data += list->bucket_size * list->total_buckets;
// }
// ENTITYTAINER_assert( bucket_data == buffer + buffer_size );
return entitytainer;
}
ENTITYTAINER_API bool
entitytainer_needs_realloc( TheEntitytainer* entitytainer, float percent_free, int num_free_buckets ) {
for ( int i = 0; i < entitytainer->num_bucket_lists; ++i ) {
// ENTITYTAINER_assert( bucket_data - buffer > bucket_sizes[i] * bucket_list_sizes[i] ); // >= ?
TheEntitytainerBucketList* list = &entitytainer->bucket_lists[i];
if ( percent_free >= 0 ) {
num_free_buckets = (int)( list->total_buckets * percent_free );
}
if ( list->total_buckets - list->used_buckets <= num_free_buckets ) {
return true;
}
}
return false;
}
ENTITYTAINER_API void
entitytainer_add_entity( TheEntitytainer* entitytainer, TheEntitytainerEntity entity ) {
ENTITYTAINER_assert( entitytainer->entry_lookup[entity] == 0,
"Entitytainer[%s] Tried to add entity " ENTITYTAINER_EntityFormat " but it was already added.",
"",
entity );
TheEntitytainerBucketList* bucket_list = &entitytainer->bucket_lists[0];
int bucket_index = bucket_list->used_buckets;
if ( bucket_list->first_free_bucket != ENTITYTAINER_NoFreeBucket ) {
// There's a freed bucket available
bucket_index = bucket_list->first_free_bucket;
int bucket_offset = bucket_index * bucket_list->bucket_size;
bucket_list->first_free_bucket = bucket_list->bucket_data[bucket_offset];
}
// TODO: Move to larger bucket list if this one is full
ENTITYTAINER_assert( bucket_list->used_buckets < bucket_list->total_buckets );
++bucket_list->used_buckets;
TheEntitytainerEntry* lookup = &entitytainer->entry_lookup[entity];
ENTITYTAINER_assert( *lookup == 0 );
*lookup = (TheEntitytainerEntry)bucket_index; // bucket list index is 0
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = bucket_list->bucket_data + bucket_offset;
ENTITYTAINER_memset( bucket, 0, bucket_list->bucket_size * sizeof( TheEntitytainerEntity ) );
}
ENTITYTAINER_API void
entitytainer_remove_entity( TheEntitytainer* entitytainer, TheEntitytainerEntity entity ) {
TheEntitytainerEntry lookup = entitytainer->entry_lookup[entity];
if ( entitytainer->entry_parent_lookup[entity] != ENTITYTAINER_InvalidEntity ) {
if ( entitytainer->remove_with_holes ) {
entitytainer_remove_child_with_holes( entitytainer, entitytainer->entry_parent_lookup[entity], entity );
}
else {
entitytainer_remove_child_no_holes( entitytainer, entitytainer->entry_parent_lookup[entity], entity );
}
lookup = entitytainer->entry_lookup[entity];
}
if ( lookup == 0 ) {
// lookup is 0 for entities that don't have children (or haven't been added by _add_entity)
return;
}
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = bucket_list->bucket_data + bucket_offset;
ENTITYTAINER_assert( bucket[0] == 0,
"Entitytainer[%s] Tried to remove " ENTITYTAINER_EntityFormat
" but it still had children. First child=" ENTITYTAINER_EntityFormat,
"",
entity,
bucket[1] );
*bucket = (TheEntitytainerEntity)bucket_list->first_free_bucket;
bucket_list->first_free_bucket = bucket_index;
entitytainer->entry_lookup[entity] = 0;
--bucket_list->used_buckets;
}
ENTITYTAINER_API void
entitytainer_reserve( TheEntitytainer* entitytainer, TheEntitytainerEntity parent, int capacity ) {
TheEntitytainerEntry lookup = entitytainer->entry_lookup[parent];
ENTITYTAINER_assert( lookup != 0 );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = bucket_list->bucket_data + bucket_offset;
if ( bucket_list->bucket_size > capacity ) {
return;
}
TheEntitytainerBucketList* bucket_list_new = NULL;
int bucket_list_index_new = -1;
for ( int i_bl = 0; i_bl < entitytainer->num_bucket_lists; ++i_bl ) {
bucket_list_new = &entitytainer->bucket_lists[i_bl];
if ( bucket_list_new->bucket_size > capacity + 1 ) {
bucket_list_index_new = i_bl;
break;
}
}
ENTITYTAINER_assert( bucket_list_index_new != -1 );
int bucket_index_new = bucket_list_new->used_buckets;
if ( bucket_list_new->first_free_bucket != ENTITYTAINER_NoFreeBucket ) {
// There's a freed bucket available
bucket_index_new = bucket_list_new->first_free_bucket;
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
bucket_list_new->first_free_bucket = bucket_list_new->bucket_data[bucket_offset_new];
}
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
TheEntitytainerEntity* bucket_new = bucket_list_new->bucket_data + bucket_offset_new;
ENTITYTAINER_memset( bucket_new, 0, bucket_list_new->bucket_size * sizeof( TheEntitytainerEntity ) );
ENTITYTAINER_memcpy( bucket_new, bucket, bucket_list->bucket_size * sizeof( TheEntitytainerEntity ) );
*bucket = (TheEntitytainerEntity)bucket_list->first_free_bucket;
bucket_list->first_free_bucket = bucket_index;
bucket = bucket_new;
bucket_list_new->used_buckets++;
bucket_list->used_buckets--;
// Update lookup
TheEntitytainerEntry lookup_new =
( TheEntitytainerEntry )( bucket_list_index_new << ENTITYTAINER_BucketListOffset );
lookup_new = lookup_new | (TheEntitytainerEntry)bucket_index_new;
entitytainer->entry_lookup[parent] = lookup_new;
}
ENTITYTAINER_API void
entitytainer_add_child( TheEntitytainer* entitytainer, TheEntitytainerEntity parent, TheEntitytainerEntity child ) {
TheEntitytainerEntry lookup = entitytainer->entry_lookup[parent];
ENTITYTAINER_assert( lookup != 0,
"Entitytainer[%s] Tried to add " ENTITYTAINER_EntityFormat
" as child to " ENTITYTAINER_EntityFormat " who was not added.",
"",
child,
parent );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = bucket_list->bucket_data + bucket_offset;
#if ENTITYTAINER_DEFENSIVE_ASSERTS
ENTITYTAINER_assert( !entitytainer__child_in_bucket( bucket, bucket_list, child ),
"Entitytainer[%s] Tried to add " ENTITYTAINER_EntityFormat
" as child to " ENTITYTAINER_EntityFormat " but it was already its child.",
"",
child,
parent );
#endif
#if ENTITYTAINER_DEFENSIVE_CHECKS
if ( entitytainer__child_in_bucket( bucket, bucket_list, child ) ) {
ENTITYTAINER_assert( entitytainer_get_parent( entitytainer, child ) == parent );
return;
}
#endif
if ( bucket[0] + 1 == bucket_list->bucket_size ) {
ENTITYTAINER_assert( bucket_list_index != 3 );
TheEntitytainerBucketList* bucket_list_new = bucket_list + 1;
int bucket_index_new = bucket_list_new->used_buckets;
if ( bucket_list_new->first_free_bucket != ENTITYTAINER_NoFreeBucket ) {
// There's a freed bucket available
bucket_index_new = bucket_list_new->first_free_bucket;
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
bucket_list_new->first_free_bucket = bucket_list_new->bucket_data[bucket_offset_new];
}
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
TheEntitytainerEntity* bucket_new = bucket_list_new->bucket_data + bucket_offset_new;
ENTITYTAINER_memset( bucket_new, 0, bucket_list_new->bucket_size * sizeof( TheEntitytainerEntity ) );
ENTITYTAINER_memcpy( bucket_new, bucket, bucket_list->bucket_size * sizeof( TheEntitytainerEntity ) );
*bucket = (TheEntitytainerEntity)bucket_list->first_free_bucket;
bucket_list->first_free_bucket = bucket_index;
bucket = bucket_new;
bucket_list_new->used_buckets++;
bucket_list->used_buckets--;
// Update lookup
int bucket_list_index_new = ( bucket_list_index + 1 ) << ENTITYTAINER_BucketListOffset;
TheEntitytainerEntry lookup_new = (TheEntitytainerEntry)bucket_list_index_new;
lookup_new = lookup_new | (TheEntitytainerEntry)bucket_index_new;
entitytainer->entry_lookup[parent] = lookup_new;
}
#if ENTITYTAINER_DEFENSIVE_ASSERTS
ENTITYTAINER_assert( !entitytainer__child_in_bucket( bucket, bucket_list, child ) );
#endif
// Update count and insert child into bucket
TheEntitytainerEntity count = bucket[0] + (TheEntitytainerEntity)1;
bucket[0] = count;
if ( entitytainer->remove_with_holes ) {
int i = 1;
for ( ; i < count; ++i ) {
if ( bucket[i] == ENTITYTAINER_InvalidEntity ) {
bucket[i] = child;
break;
}
}
if ( i == count ) {
// Didn't find a "holed" slot, add child to the end.
bucket[i] = child;
}
}
else {
bucket[count] = child;
}
ENTITYTAINER_assert( entitytainer->entry_parent_lookup[child] == ENTITYTAINER_InvalidEntity );
ENTITYTAINER_assert( entitytainer->entry_parent_lookup[child] == ENTITYTAINER_InvalidEntity,
"Entitytainer[%s] Tried to add " ENTITYTAINER_EntityFormat
" as child to " ENTITYTAINER_EntityFormat
" but it was already parented to " ENTITYTAINER_EntityFormat,
"",
child,
parent,
entitytainer->entry_parent_lookup[child] );
entitytainer->entry_parent_lookup[child] = parent;
}
ENTITYTAINER_API void
entitytainer_add_child_at_index( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity child,
int index ) {
TheEntitytainerEntry lookup = entitytainer->entry_lookup[parent];
ENTITYTAINER_assert( lookup != 0 );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = bucket_list->bucket_data + bucket_offset;
#if ENTITYTAINER_DEFENSIVE_ASSERTS
ENTITYTAINER_assert( !entitytainer__child_in_bucket( bucket, bucket_list, child ) );
#endif
#if ENTITYTAINER_DEFENSIVE_CHECKS
if ( entitytainer__child_in_bucket( bucket, bucket_list, child ) ) {
ENTITYTAINER_assert( entitytainer_get_parent( entitytainer, child ) == parent );
return;
}
#endif
while ( index + 1 >= bucket_list->bucket_size ) {
ENTITYTAINER_assert( bucket_list_index != 3 ); // No bucket lists with buckets of this size
TheEntitytainerBucketList* bucket_list_new = bucket_list + 1;
int bucket_index_new = bucket_list_new->used_buckets;
if ( index + 1 >= bucket_list_new->bucket_size ) {
bucket_list_index += 1;
bucket_list = bucket_list_new;
continue;
}
if ( bucket_list_new->first_free_bucket != ENTITYTAINER_NoFreeBucket ) {
// There's a freed bucket available
bucket_index_new = bucket_list_new->first_free_bucket;
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
bucket_list_new->first_free_bucket = bucket_list_new->bucket_data[bucket_offset_new];
}
ENTITYTAINER_assert( bucket_index_new < bucket_list_new->total_buckets ); // No free buckets at all
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
TheEntitytainerEntity* bucket_new = bucket_list_new->bucket_data + bucket_offset_new;
ENTITYTAINER_memset( bucket_new, 0, bucket_list_new->bucket_size * sizeof( TheEntitytainerEntity ) );
ENTITYTAINER_memcpy( bucket_new, bucket, bucket_list->bucket_size * sizeof( TheEntitytainerEntity ) );
*bucket = (TheEntitytainerEntity)bucket_list->first_free_bucket;
bucket_list->first_free_bucket = bucket_index;
bucket_list_new->used_buckets++;
bucket_list->used_buckets--;
bucket = bucket_new;
bucket_list = bucket_list_new;
bucket_index = bucket_index_new;
bucket_list_index += 1;
// Update lookup
int bucket_list_index_new = ( bucket_list_index ) << ENTITYTAINER_BucketListOffset;
TheEntitytainerEntry lookup_new = (TheEntitytainerEntry)bucket_list_index_new;
lookup_new = lookup_new | (TheEntitytainerEntry)bucket_index_new;
entitytainer->entry_lookup[parent] = lookup_new;
}
#if ENTITYTAINER_DEFENSIVE_ASSERTS
ENTITYTAINER_assert( !entitytainer__child_in_bucket( bucket, bucket_list, child ) );
#endif
// Update count and insert child into bucket
ENTITYTAINER_assert( bucket[index + 1] == ENTITYTAINER_InvalidEntity );
TheEntitytainerEntity count = bucket[0] + (TheEntitytainerEntity)1;
bucket[0] = count;
bucket[index + 1] = child;
ENTITYTAINER_assert( entitytainer->entry_parent_lookup[child] == ENTITYTAINER_InvalidEntity,
"Entitytainer[%s] Tried to add " ENTITYTAINER_EntityFormat
" as child to " ENTITYTAINER_EntityFormat
" but it was already parented to " ENTITYTAINER_EntityFormat,
"",
child,
parent,
entitytainer->entry_parent_lookup[child] );
entitytainer->entry_parent_lookup[child] = parent;
}
ENTITYTAINER_API void
entitytainer_remove_child_no_holes( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity child ) {
ASSERT( !entitytainer->config.remove_with_holes );
TheEntitytainerEntry lookup = entitytainer->entry_lookup[parent];
ENTITYTAINER_assert( lookup != 0 );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = (TheEntitytainerEntity*)( bucket_list->bucket_data + bucket_offset );
// Remove child from bucket, move children after forward one step.
int num_children = bucket[0];
TheEntitytainerEntity* child_to_move = &bucket[1];
int count = 0;
while ( *child_to_move != child && count < num_children ) {
++count;
++child_to_move;
}
ENTITYTAINER_assert( count < num_children );
for ( ; count < num_children - 1; ++count ) {
*child_to_move = *( child_to_move + 1 );
++child_to_move;
}
// Lower child count, clear entry
bucket[0]--;
entitytainer->entry_parent_lookup[child] = 0;
#if ENTITYTAINER_DEFENSIVE_ASSERTS
ENTITYTAINER_assert( !entitytainer__child_in_bucket( bucket, bucket_list, child ) );
#endif
#if ENTITYTAINER_DEFENSIVE_CHECKS
if ( entitytainer__child_in_bucket( bucket, bucket_list, child ) ) {
entitytainer_remove_child_no_holes( entitytainer, parent, child );
}
#endif
if ( entitytainer->keep_capacity_on_remove ) {
return;
}
TheEntitytainerBucketList* bucket_list_prev =
bucket_list_index > 0 ? ( entitytainer->bucket_lists + bucket_list_index - 1 ) : NULL;
if ( bucket_list_prev != NULL && bucket[0] + 1 == bucket_list_prev->bucket_size ) {
TheEntitytainerBucketList* bucket_list_new = bucket_list_prev;
int bucket_index_new = bucket_list_new->used_buckets;
if ( bucket_list_new->first_free_bucket != ENTITYTAINER_NoFreeBucket ) {
// There's a freed bucket available
bucket_index_new = bucket_list_new->first_free_bucket;
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
bucket_list_new->first_free_bucket = bucket_list_new->bucket_data[bucket_offset_new];
}
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
TheEntitytainerEntity* bucket_new = bucket_list_new->bucket_data + bucket_offset_new;
ENTITYTAINER_memcpy( bucket_new, bucket, bucket_list_new->bucket_size * sizeof( TheEntitytainerEntity ) );
bucket_list_new->used_buckets++;
bucket_list->used_buckets--;
// Update lookup
int bucket_list_index_new = ( bucket_list_index - 1 ) << ENTITYTAINER_BucketListOffset;
TheEntitytainerEntry lookup_new = (TheEntitytainerEntry)bucket_list_index_new;
lookup_new = lookup_new | (TheEntitytainerEntry)bucket_index_new;
entitytainer->entry_lookup[parent] = lookup_new;
#if ENTITYTAINER_DEFENSIVE_ASSERTS
ENTITYTAINER_assert( !entitytainer__child_in_bucket( bucket, bucket_list, child ) );
#endif
#if ENTITYTAINER_DEFENSIVE_CHECKS
if ( entitytainer__child_in_bucket( bucket, bucket_list, child ) ) {
entitytainer_remove_child_no_holes( entitytainer, parent, child );
}
#endif
}
}
ENTITYTAINER_API void
entitytainer_remove_child_with_holes( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity child ) {
ENTITYTAINER_assert( entitytainer->remove_with_holes );
TheEntitytainerEntry lookup = entitytainer->entry_lookup[parent];
ENTITYTAINER_assert( lookup != 0 );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = (TheEntitytainerEntity*)( bucket_list->bucket_data + bucket_offset );
// Remove child from bucket, move children after forward one step.
int capacity = bucket_list->bucket_size;
int last_child_index = 0;
int child_to_move_index = 0;
for ( int i = 1; i < capacity; i++ ) {
if ( bucket[i] == child ) {
child_to_move_index = i;
}
else if ( bucket[i] != ENTITYTAINER_InvalidEntity ) {
last_child_index = i;
}
}
ENTITYTAINER_assert( child_to_move_index != 0 );
bucket[child_to_move_index] = ENTITYTAINER_InvalidEntity;
// Lower child count, clear entry
bucket[0]--;
entitytainer->entry_parent_lookup[child] = 0;
#if ENTITYTAINER_DEFENSIVE_ASSERTS
ENTITYTAINER_assert( !entitytainer__child_in_bucket( bucket, bucket_list, child ),
"Entitytainer[%s] Removed child " ENTITYTAINER_EntityFormat
" from parent " ENTITYTAINER_EntityFormat ", but it was still its child.",
"",
child,
parent );
#endif
#if ENTITYTAINER_DEFENSIVE_CHECKS
if ( entitytainer__child_in_bucket( bucket, bucket_list, child ) ) {
entitytainer_remove_child_with_holes( entitytainer, parent, child );
}
#endif
if ( entitytainer->keep_capacity_on_remove ) {
return;
}
TheEntitytainerBucketList* bucket_list_prev =
bucket_list_index > 0 ? ( entitytainer->bucket_lists + bucket_list_index - 1 ) : NULL;
if ( bucket_list_prev != NULL && last_child_index + ENTITYTAINER_ShrinkMargin < bucket_list_prev->bucket_size ) {
// We've shrunk enough to fit in the previous bucket, move.
TheEntitytainerBucketList* bucket_list_new = bucket_list_prev;
int bucket_index_new = bucket_list_new->used_buckets;
int bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
if ( bucket_list_new->first_free_bucket != ENTITYTAINER_NoFreeBucket ) {
// There's a freed bucket available
bucket_index_new = bucket_list_new->first_free_bucket;
bucket_offset_new = bucket_index_new * bucket_list_new->bucket_size;
bucket_list_new->first_free_bucket = bucket_list_new->bucket_data[bucket_offset_new];
}
TheEntitytainerEntity* bucket_new = bucket_list_new->bucket_data + bucket_offset_new;
ENTITYTAINER_memcpy( bucket_new, bucket, bucket_list_new->bucket_size * sizeof( TheEntitytainerEntity ) );
bucket_list_new->used_buckets++;
bucket_list->used_buckets--;
// Update lookup
int bucket_list_index_new = ( bucket_list_index - 1 ) << ENTITYTAINER_BucketListOffset;
TheEntitytainerEntry lookup_new = (TheEntitytainerEntry)bucket_list_index_new;
lookup_new = lookup_new | (TheEntitytainerEntry)bucket_index_new;
entitytainer->entry_lookup[parent] = lookup_new;
#if ENTITYTAINER_DEFENSIVE_ASSERTS
ENTITYTAINER_assert( !entitytainer__child_in_bucket( bucket, bucket_list, child ) );
#endif
#if ENTITYTAINER_DEFENSIVE_CHECKS
if ( entitytainer__child_in_bucket( bucket, bucket_list, child ) ) {
entitytainer_remove_child_with_holes( entitytainer, parent, child );
}
#endif
}
}
ENTITYTAINER_API void
entitytainer_get_children( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity** children,
int* num_children,
int* capacity ) {
TheEntitytainerEntry lookup = entitytainer->entry_lookup[parent];
ENTITYTAINER_assert( lookup != 0 );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = (TheEntitytainerEntity*)( bucket_list->bucket_data + bucket_offset );
*num_children = (int)bucket[0];
*children = bucket + 1;
*capacity = bucket_list->bucket_size - 1;
}
ENTITYTAINER_API int
entitytainer_num_children( TheEntitytainer* entitytainer, TheEntitytainerEntity parent ) {
TheEntitytainerEntry lookup = entitytainer->entry_lookup[parent];
ENTITYTAINER_assert( lookup != 0 );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = (TheEntitytainerEntity*)( bucket_list->bucket_data + bucket_offset );
return (int)bucket[0];
}
ENTITYTAINER_API int
entitytainer_get_child_index( TheEntitytainer* entitytainer,
TheEntitytainerEntity parent,
TheEntitytainerEntity child ) {
TheEntitytainerEntry lookup = entitytainer->entry_lookup[parent];
ENTITYTAINER_assert( lookup != 0 );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = (TheEntitytainerEntity*)( bucket_list->bucket_data + bucket_offset );
int num_children = (int)bucket[0];
for ( int i = 0; i < num_children; ++i ) {
if ( bucket[1 + i] == child ) {
return i;
}
}
return -1;
}
ENTITYTAINER_API TheEntitytainerEntity
entitytainer_get_parent( TheEntitytainer* entitytainer, TheEntitytainerEntity child ) {
TheEntitytainerEntity parent = entitytainer->entry_parent_lookup[child];
return parent;
}
ENTITYTAINER_API bool
entitytainer_is_added( TheEntitytainer* entitytainer, TheEntitytainerEntity entity ) {
TheEntitytainerEntry lookup = entitytainer->entry_lookup[entity];
return lookup != 0;
}
ENTITYTAINER_API void
entitytainer_remove_holes( TheEntitytainer* entitytainer, TheEntitytainerEntity entity ) {
// TODO
ENTITYTAINER_assert( false );
TheEntitytainerEntry lookup = entitytainer->entry_lookup[entity];
ENTITYTAINER_assert( lookup != 0 );
int bucket_list_index = lookup >> ENTITYTAINER_BucketListOffset;
TheEntitytainerBucketList* bucket_list = entitytainer->bucket_lists + bucket_list_index;
int bucket_index = lookup & ENTITYTAINER_BucketMask;
int bucket_offset = bucket_index * bucket_list->bucket_size;
TheEntitytainerEntity* bucket = (TheEntitytainerEntity*)( bucket_list->bucket_data + bucket_offset );
int first_free_index = 1;
for ( int i = 1; i < bucket_list->bucket_size; ++i ) {
TheEntitytainerEntity child = bucket[i];
if ( child != ENTITYTAINER_InvalidEntity ) {
for ( int i_free = first_free_index; i_free < i; ++i_free ) {
if ( bucket[i_free] == ENTITYTAINER_InvalidEntity ) {
first_free_index = i_free + 1;
bucket[i_free] = child;
bucket[i] = ENTITYTAINER_InvalidEntity;
break;
}
}
}
}
}
ENTITYTAINER_API int
entitytainer_save( TheEntitytainer* entitytainer, unsigned char* buffer, int buffer_size ) {
TheEntitytainerBucketList* last = &entitytainer->bucket_lists[entitytainer->num_bucket_lists - 1];
TheEntitytainerEntity* entity_end = last->bucket_data + last->bucket_size * last->total_buckets;
unsigned char* begin = (unsigned char*)entitytainer;
unsigned char* end = (unsigned char*)entity_end;
int size = (int)( end - begin );
if ( size > buffer_size ) {
return size;
}
ENTITYTAINER_memcpy( buffer, entitytainer, size );
return size;
}
ENTITYTAINER_API TheEntitytainer*
entitytainer_load( unsigned char* buffer, int buffer_size ) {
ENTITYTAINER_assert( entitytainer__ptr_to_aligned_ptr( buffer, (int)ENTITYTAINER_alignof( TheEntitytainer ) ) ==
buffer );
// Fix pointers
TheEntitytainer* entitytainer = (TheEntitytainer*)buffer;
buffer += sizeof( TheEntitytainer );
entitytainer->entry_lookup = (TheEntitytainerEntry*)buffer;
buffer += sizeof( TheEntitytainerEntry ) * entitytainer->entry_lookup_size;
entitytainer->entry_parent_lookup = (TheEntitytainerEntity*)buffer;
buffer += sizeof( TheEntitytainerEntity ) * entitytainer->entry_lookup_size;
buffer = (unsigned char*)entitytainer__ptr_to_aligned_ptr( buffer,
(int)ENTITYTAINER_alignof( TheEntitytainerBucketList ) );
entitytainer->bucket_lists = (TheEntitytainerBucketList*)buffer;
unsigned char* bucket_list_end = buffer + sizeof( TheEntitytainerBucketList ) * entitytainer->num_bucket_lists;
TheEntitytainerEntity* bucket_data_start = (TheEntitytainerEntity*)bucket_list_end;
TheEntitytainerEntity* bucket_data = bucket_data_start;
for ( int i = 0; i < entitytainer->num_bucket_lists; ++i ) {
TheEntitytainerBucketList* list = (TheEntitytainerBucketList*)buffer;
list->bucket_data = bucket_data;
buffer += sizeof( TheEntitytainerBucketList );
bucket_data += list->bucket_size * list->total_buckets;
}
(void)buffer_size;
ENTITYTAINER_assert( (unsigned char*)bucket_data <= buffer + buffer_size );
return entitytainer;
}
ENTITYTAINER_API void