-
Notifications
You must be signed in to change notification settings - Fork 46
Expand file tree
/
Copy pathpalloc.c
More file actions
2582 lines (2141 loc) · 63.1 KB
/
palloc.c
File metadata and controls
2582 lines (2141 loc) · 63.1 KB
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
#include "c3/c3.h"
#include "allocate.h"
#include "options.h"
#include "vortex.h"
#undef SANITY
#undef PACK_CHECK
#ifdef ASAN_ENABLED
// XX build problems importing <sanitizers/asan_interface.h>
//
void __asan_poison_memory_region(void const volatile *addr, size_t size);
void __asan_unpoison_memory_region(void const volatile *addr, size_t size);
# define ASAN_POISON_MEMORY_REGION(addr, size) \
__asan_poison_memory_region((addr), (size))
# define ASAN_UNPOISON_MEMORY_REGION(addr, size) \
__asan_unpoison_memory_region((addr), (size))
#else
# define ASAN_POISON_MEMORY_REGION(addr, size) ((void) (addr), (void) (size))
# define ASAN_UNPOISON_MEMORY_REGION(addr, size) ((void) (addr), (void) (size))
#endif
#ifndef BASE
#define BASE u3R->rut_p
#endif
#define page_to_post(pag_w) (BASE + (HEAP.dir_ws * (c3_ws)((c3_w)(pag_w - HEAP.off_ws) << u3a_page)))
#define post_to_page(som_p) (_abs_dif(som_p, (c3_ws)BASE + HEAP.off_ws) >> u3a_page)
#ifndef HEAP
#define HEAP u3R->hep
#endif
static u3_post _imalloc(c3_w);
static void _ifree(u3_post);
static __inline__ c3_w
_abs_dif(c3_w a_w, c3_w b_w)
{
// c3_ds dif_ds = a_w - b_w;
// c3_d mas_d = dif_ds >> 63;
// return (dif_ds + mas_d) ^ mas_d;
return (a_w > b_w ) ? a_w - b_w : b_w - a_w;
}
static void
_init_once(void)
{
u3a_hunk_dose *hun_u;
c3_s mun_w = 0;
for (c3_g bit_g = 0; bit_g < u3a_crag_no; bit_g++ ) {
hun_u = &(u3a_Hunk[bit_g]);
hun_u->log_s = bit_g + u3a_min_log;
hun_u->len_s = 1U << hun_u->log_s;
hun_u->tot_s = 1U << (u3a_page - hun_u->log_s);
hun_u->map_s = (hun_u->tot_s + 31) >> 5;
hun_u->siz_s = c3_wiseof(u3a_crag) + hun_u->map_s - 1;
// metacircular base case
//
// trivially deducible from exhaustive enumeration
//
if ( hun_u->len_s <= (hun_u->siz_s << 1) ) {
hun_u->hun_s = 1U + ((hun_u->siz_s - 1) >> hun_u->log_s);
}
else {
hun_u->hun_s = 0;
}
hun_u->ful_s = hun_u->tot_s - hun_u->hun_s;
mun_w = c3_max(mun_w, hun_u->hun_s);
}
u3_assert( 32 > mun_w );
}
static void
_drop(u3_post som_p, c3_w len_w)
{
ASAN_UNPOISON_MEMORY_REGION(u3a_into(som_p), (c3_z)len_w << 2);
}
static void
_init_heap(void)
{
u3p(u3a_crag) *dir_u;
if ( c3y == u3a_is_north(u3R) ) {
HEAP.dir_ws = 1;
HEAP.off_ws = 0;
}
else {
HEAP.dir_ws = -1;
HEAP.off_ws = -1;
}
assert( !(u3R->hat_p & ((1U << u3a_page) - 1)) );
assert( u3R->hat_p > u3a_rest_pg );
assert( u3R->hat_p == u3R->rut_p );
// XX check for overflow
HEAP.pag_p = u3R->hat_p;
HEAP.pag_p += HEAP.off_ws * (c3_ws)(1U << u3a_page);
HEAP.siz_w = 1U << u3a_page;
HEAP.len_w = 1;
u3R->hat_p += HEAP.dir_ws * (c3_ws)(1U << u3a_page);
dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
memset(dir_u, 0, 1U << (u3a_page + 2));
dir_u[0] = u3a_head_pg;
#ifdef SANITY
assert( 0 == post_to_page(HEAP.pag_p) );
assert( HEAP.pag_p == page_to_post(0) );
assert( HEAP.len_w == post_to_page(u3R->hat_p + HEAP.off_ws) );
#endif
HEAP.cac_p = _imalloc(c3_wiseof(u3a_dell));
}
static void
_extend_directory(c3_w siz_w) // num pages
{
u3p(u3a_crag) *dir_u, *old_u;
u3_post old_p = HEAP.pag_p;
old_u = u3to(u3p(u3a_crag), HEAP.pag_p);
c3_w nex_w, pif_w, dif_w = 0, pag_w;
do {
pif_w = dif_w;
nex_w = HEAP.len_w + siz_w + dif_w; // num words
nex_w += (1U << u3a_page) - 1;
nex_w &= ~((1U << u3a_page) - 1);
dif_w = nex_w >> u3a_page; // new pages
} while ( dif_w != pif_w );
HEAP.pag_p = u3R->hat_p;
HEAP.pag_p += HEAP.off_ws * (c3_ws)nex_w;
u3R->hat_p += HEAP.dir_ws * (c3_ws)nex_w; // XX overflow
// XX depend on the guard page for these?
//
if ( 1 == HEAP.dir_ws ) {
if ( u3R->hat_p >= u3R->cap_p ) {
u3m_bail(c3__meme); return;
}
}
else {
if ( u3R->hat_p <= u3R->cap_p ) {
u3m_bail(c3__meme); return;
}
}
dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
pag_w = post_to_page(HEAP.pag_p);
#ifdef SANITY
assert( pag_w == (HEAP.len_w - (HEAP.off_ws * (dif_w - 1))) );
#endif
{
c3_z len_z = (c3_z)HEAP.len_w << 2;
c3_z dif_z = (c3_z)dif_w << 2;
ASAN_UNPOISON_MEMORY_REGION(dir_u, (c3_z)nex_w << 2);
memcpy(dir_u, old_u, len_z);
dir_u[pag_w] = u3a_head_pg;
for ( c3_w i_w = 1; i_w < dif_w; i_w++ ) {
dir_u[pag_w + (HEAP.dir_ws * (c3_ws)i_w)] = u3a_rest_pg;
}
memset((c3_y*)dir_u + len_z + dif_z, 0, ((c3_z)nex_w << 2) - len_z - dif_z);
}
HEAP.len_w += dif_w;
HEAP.siz_w = nex_w;
_ifree(old_p);
#ifdef SANITY
assert( HEAP.len_w == post_to_page(u3R->hat_p + HEAP.off_ws) );
assert( dir_u[HEAP.len_w - 1] );
#endif
}
static u3_post
_extend_heap(c3_w siz_w) // num pages
{
u3_post pag_p;
#ifdef SANITY
assert( HEAP.siz_w >= HEAP.len_w );
#endif
if ( (HEAP.siz_w - HEAP.len_w) < siz_w ) {
_extend_directory(siz_w);
}
pag_p = u3R->hat_p;
pag_p += HEAP.off_ws * (c3_ws)(siz_w << u3a_page);
u3R->hat_p += HEAP.dir_ws * (c3_ws)(siz_w << u3a_page);
// XX depend on the guard page for these?
//
if ( 1 == HEAP.dir_ws ) {
if ( u3R->hat_p >= u3R->cap_p ) {
return u3m_bail(c3__meme);
}
}
else {
if ( u3R->hat_p <= u3R->cap_p ) {
return u3m_bail(c3__meme);
}
}
HEAP.len_w += siz_w;
ASAN_POISON_MEMORY_REGION(u3a_into(pag_p), siz_w << (u3a_page + 2));
#ifdef SANITY
assert( HEAP.len_w == post_to_page(u3R->hat_p + HEAP.off_ws) );
#endif
return pag_p;
}
static u3_post
_alloc_pages(c3_w siz_w) // num pages
{
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
u3a_dell* fre_u = u3tn(u3a_dell, HEAP.fre_p);
u3a_dell* del_u = NULL;
c3_w pag_w = 0;
while ( fre_u ) {
// XX sanity
if ( fre_u->siz_w < siz_w ) {
fre_u = u3tn(u3a_dell, fre_u->nex_p);
continue;
}
else if ( fre_u->siz_w == siz_w ) {
pag_w = fre_u->pag_w;
if ( fre_u->nex_p ) {
u3to(u3a_dell, fre_u->nex_p)->pre_p = fre_u->pre_p;
}
else {
HEAP.erf_p = fre_u->pre_p;
}
if ( fre_u->pre_p ) {
u3to(u3a_dell, fre_u->pre_p)->nex_p = fre_u->nex_p;
}
else {
HEAP.fre_p = fre_u->nex_p;
}
del_u = fre_u;
}
else {
pag_w = fre_u->pag_w;
fre_u->pag_w += siz_w;
fre_u->siz_w -= siz_w;
}
break;
}
u3_post pag_p;
if ( pag_w ) {
// XX groace
//
pag_w -= HEAP.off_ws * (siz_w - 1);
pag_p = page_to_post(pag_w);
#ifdef SANITY
assert( pag_w < HEAP.len_w );
// XX sanity
assert( u3a_free_pg == dir_u[pag_w] );
for ( c3_w i_w = 1; i_w < siz_w; i_w++ ) {
assert( u3a_free_pg == dir_u[pag_w + (HEAP.dir_ws * (c3_ws)i_w)] );
}
#endif
}
else {
pag_p = _extend_heap(siz_w);
pag_w = post_to_page(pag_p);
dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
#ifdef SANITY
assert( pag_w < HEAP.len_w );
assert( (pag_w + ((HEAP.off_ws + 1) * siz_w) - HEAP.off_ws) == HEAP.len_w );
#endif
}
dir_u[pag_w] = u3a_head_pg;
for ( c3_w i_w = 1; i_w < siz_w; i_w++ ) {
dir_u[pag_w + (HEAP.dir_ws * (c3_ws)i_w)] = u3a_rest_pg;
}
// XX junk
ASAN_UNPOISON_MEMORY_REGION(u3a_into(pag_p), siz_w << (u3a_page + 2));
if ( del_u ) {
if ( !HEAP.cac_p ) {
HEAP.cac_p = u3of(u3a_dell, del_u);
}
else {
_ifree(u3of(u3a_dell, del_u));
}
}
#ifdef SANITY
assert( HEAP.len_w == post_to_page(u3R->hat_p + HEAP.off_ws) );
assert( dir_u[HEAP.len_w - 1] );
#endif
return pag_p;
}
static void
_rake_chunks(c3_w len_w, c3_w max_w, c3_t rak_t, c3_w* out_w, u3_post* out_p)
{
c3_g bit_g = (c3_g)c3_bits_word(len_w - 1) - u3a_min_log; // 0-9, inclusive
const u3a_hunk_dose *hun_u = &(u3a_Hunk[bit_g]);
u3_post pag_p = HEAP.wee_p[bit_g];
u3a_crag *pag_u;
c3_w hav_w = *out_w;
if ( rak_t ) {
c3_w *map_w;
c3_g pos_g;
u3_post bas_p;
c3_w off_w;
while ( pag_p ) {
pag_u = u3to(u3a_crag, pag_p);
bas_p = page_to_post(pag_u->pag_w);
map_w = pag_u->map_w;
while ( !*map_w ) { map_w++; }
off_w = (map_w - pag_u->map_w) << 5;
if ( (max_w - hav_w) < pag_u->fre_s ) {
while ( hav_w < max_w ) {
pos_g = c3_tz_w(*map_w);
*map_w &= ~(1U << pos_g);
out_p[hav_w++] = bas_p + ((off_w + pos_g) << pag_u->log_s);
pag_u->fre_s--;
ASAN_UNPOISON_MEMORY_REGION(u3a_into(out_p[hav_w - 1]), (c3_z)hun_u->len_s << 2);
if ( !*map_w ) {
do { map_w++; } while ( !*map_w );
off_w = (map_w - pag_u->map_w) << 5;
}
}
HEAP.wee_p[bit_g] = pag_p;
*out_w = hav_w;
return;
}
ASAN_UNPOISON_MEMORY_REGION(u3a_into(bas_p), 1U << (u3a_page + 2));
while ( 1 ) {
pos_g = c3_tz_w(*map_w);
*map_w &= ~(1U << pos_g);
out_p[hav_w++] = bas_p + ((off_w + pos_g) << pag_u->log_s);
if ( !--pag_u->fre_s ) {
break;
}
if ( !*map_w ) {
do { map_w++; } while ( !*map_w );
off_w = (map_w - pag_u->map_w) << 5;
}
}
pag_p = pag_u->nex_p;
pag_u->nex_p = 0;
if ( hav_w == max_w ) {
HEAP.wee_p[bit_g] = pag_p;
*out_w = hav_w;
return;
}
}
HEAP.wee_p[bit_g] = 0;
}
// XX s/b ful_s
if ( hun_u->tot_s > (max_w - hav_w) ) {
*out_w = hav_w;
return;
}
// manually inlined _make_chunks(), storing each chunk-post to [*out_p]
//
{
u3_post hun_p;
c3_w pag_w;
pag_p = _alloc_pages(1);
pag_w = post_to_page(pag_p);
hun_p = ( hun_u->hun_s ) ? pag_p : _imalloc(hun_u->siz_s);
pag_u = u3to(u3a_crag, hun_p);
pag_u->pag_w = pag_w;
pag_u->log_s = hun_u->log_s;
pag_u->fre_s = 0;
pag_u->nex_p = 0;
// initialize bitmap (zeros, none free)
//
memset(pag_u->map_w, 0, (c3_z)hun_u->map_s << 2);
{
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
dir_u[pag_w] = hun_p;
}
for ( c3_s i_s = hun_u->hun_s; i_s < hun_u->tot_s; i_s++ ) {
out_p[hav_w++] = pag_p + (i_s << pag_u->log_s);
}
*out_w = hav_w;
}
}
static u3_post
_make_chunks(c3_g bit_g) // 0-9, inclusive
{
const u3a_hunk_dose *hun_u = &(u3a_Hunk[bit_g]);
u3a_crag *pag_u;
u3_post hun_p, pag_p = _alloc_pages(1);
c3_w pag_w = post_to_page(pag_p);
ASAN_POISON_MEMORY_REGION(u3a_into(pag_p), 1U << (u3a_page + 2));
if ( hun_u->hun_s ) {
hun_p = pag_p;
ASAN_UNPOISON_MEMORY_REGION(u3a_into(pag_p), (c3_z)hun_u->hun_s << (hun_u->log_s + 2));
}
else {
hun_p = _imalloc(hun_u->siz_s);
}
pag_u = u3to(u3a_crag, hun_p);
pag_u->pag_w = pag_w;
pag_u->log_s = hun_u->log_s;
pag_u->fre_s = hun_u->ful_s;
// initialize bitmap (ones, all free)
//
if ( hun_u->tot_s < 32 ) {
pag_u->map_w[0] = (1U << hun_u->tot_s) - 1;
}
else {
memset(pag_u->map_w, 0xff, (c3_z)hun_u->map_s << 2);
}
// reserve chunks stolen for pginfo
// NB: max [hun_s] guarded by assertion in _init_once()
//
pag_u->map_w[0] &= ~0U << hun_u->hun_s;
{
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
dir_u[pag_w] = hun_p;
}
pag_u->nex_p = HEAP.wee_p[bit_g];
HEAP.wee_p[bit_g] = hun_p;
return hun_p;
}
static u3_post
_alloc_words(c3_w len_w) // 4-2.048, inclusive
{
c3_g bit_g = (c3_g)c3_bits_word(len_w - 1) - u3a_min_log; // 0-9, inclusive
const u3a_hunk_dose *hun_u = &(u3a_Hunk[bit_g]);
u3a_crag *pag_u;
c3_w *map_w;
c3_g pos_g;
if ( !HEAP.wee_p[bit_g] ) {
pag_u = u3to(u3a_crag, _make_chunks(bit_g));
}
else {
pag_u = u3to(u3a_crag, HEAP.wee_p[bit_g]);
// XX sanity
if ( 1 == pag_u->fre_s ) {
HEAP.wee_p[bit_g] = pag_u->nex_p;
pag_u->nex_p = 0;
}
}
pag_u->fre_s--;
map_w = pag_u->map_w;
while ( !*map_w ) { map_w++; }
pos_g = c3_tz_w(*map_w);
*map_w &= ~(1U << pos_g);
{
u3_post out_p, bas_p = page_to_post(pag_u->pag_w);
c3_w off_w = (map_w - pag_u->map_w) << 5;
out_p = bas_p + ((off_w + pos_g) << pag_u->log_s);
ASAN_UNPOISON_MEMORY_REGION(u3a_into(out_p), hun_u->len_s << 2);
// XX poison suffix
return out_p;
}
}
static u3_post
_imalloc(c3_w len_w)
{
if ( len_w > (1U << (u3a_page - 1)) ) {
len_w += (1U << u3a_page) - 1;
len_w >>= u3a_page;
// XX poison suffix
return _alloc_pages(len_w);
}
return _alloc_words(c3_max(len_w, u3a_minimum));
}
static inline c3_w
_pages_size(c3_w pag_w)
{
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
c3_w siz_w = 1;
// head-page 0 in a south road can only have a size of 1
//
if ( pag_w || !HEAP.off_ws ) {
while( dir_u[pag_w + (HEAP.dir_ws * (c3_ws)siz_w)] == u3a_rest_pg ) {
siz_w++;
}
}
return siz_w;
}
static c3_w
_free_pages(u3_post som_p, c3_w pag_w, u3_post dir_p)
{
u3a_dell *cac_u, *fre_u, *del_u = NULL;
c3_w nex_w, siz_w = 1;
u3_post fre_p;
if ( u3a_free_pg == dir_p ) {
fprintf(stderr, "\033[31m"
"palloc: double free page som_p=0x%x pag_w=%u\r\n"
"\033[0m",
som_p, pag_w);
u3_assert(!"loom: corrupt"); return 0;
}
if ( u3a_head_pg != dir_p ) {
fprintf(stderr, "\033[31m"
"palloc: wrong page som_p=0x%x dir_p=0x%x\r\n"
"\033[0m",
som_p, dir_p);
u3_assert(!"loom: corrupt"); return 0;
}
if ( som_p & ((1U << u3a_page) - 1) ) {
fprintf(stderr, "\033[31m"
"palloc: bad page alignment som_p=0x%x\r\n"
"\033[0m",
som_p);
u3_assert(!"loom: corrupt"); return 0;
}
{
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
dir_u[pag_w] = u3a_free_pg;
// head-page 0 in a south road can only have a size of 1
//
if ( pag_w || !HEAP.off_ws ) {
while( dir_u[pag_w + (HEAP.dir_ws * (c3_ws)siz_w)] == u3a_rest_pg ) {
dir_u[pag_w + (HEAP.dir_ws * (c3_ws)siz_w)] = u3a_free_pg;
siz_w++;
}
}
}
// XX groace
//
if ( HEAP.off_ws ) {
nex_w = pag_w + 1;
pag_w = nex_w - siz_w;
}
else {
nex_w = pag_w + siz_w;
}
#ifdef SANITY
assert( pag_w < HEAP.len_w );
assert( HEAP.len_w == post_to_page(u3R->hat_p + HEAP.off_ws) );
#endif
if ( nex_w == HEAP.len_w ) {
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
c3_w wiz_w = siz_w;
// check if prior pages are already free
//
if ( !dir_u[HEAP.len_w - (siz_w + 1)] ) {
assert( HEAP.erf_p );
fre_u = u3to(u3a_dell, HEAP.erf_p);
assert( (fre_u->pag_w + fre_u->siz_w) == pag_w );
if ( fre_u->pre_p ) {
HEAP.erf_p = fre_u->pre_p;
u3to(u3a_dell, fre_u->pre_p)->nex_p = 0;
}
else {
HEAP.fre_p = HEAP.erf_p = 0;
}
pag_w = fre_u->pag_w; // NB: clobbers
siz_w += fre_u->siz_w;
// XX groace
//
pag_w -= HEAP.off_ws * (siz_w - 1);
som_p = page_to_post(pag_w);
}
else {
fre_u = NULL;
}
ASAN_UNPOISON_MEMORY_REGION(u3a_into(som_p), siz_w << (u3a_page + 2));
u3R->hat_p -= HEAP.dir_ws * (c3_ws)(siz_w << u3a_page);
HEAP.len_w -= siz_w;
// fprintf(stderr, "shrink heap 0x%x 0x%x %u:%u (%u) 0x%x\r\n",
// som_p, som_p + (siz_w << u3a_page), pag_w, wiz_w, siz_w, u3R->hat_p);
#ifdef SANITY
assert( HEAP.len_w == post_to_page(u3R->hat_p + HEAP.off_ws) );
assert( dir_u[HEAP.len_w - 1] );
#endif
if ( fre_u ) {
_ifree(u3of(u3a_dell, fre_u));
}
return wiz_w;
}
// XX madv_free
ASAN_POISON_MEMORY_REGION(u3a_into(som_p), siz_w << (u3a_page + 2));
// XX add temporary freelist entry?
// if ( !HEAP.cac_p && !HEAP.fre_p
// && !HEAP.wee_p[(c3_bits_word(c3_wiseof(*cac_u) - 1) - u3a_min_log)] )
// {
// fprintf(stderr, "palloc: growing heap to free pages\r\n");
// }
if ( !HEAP.cac_p ) {
fre_p = _imalloc(c3_wiseof(*cac_u));
}
else {
fre_p = HEAP.cac_p;
HEAP.cac_p = 0;
}
cac_u = u3to(u3a_dell, fre_p);
cac_u->pag_w = pag_w;
cac_u->siz_w = siz_w;
if ( !(fre_u = u3tn(u3a_dell, HEAP.fre_p)) ) {
// fprintf(stderr, "free pages 0x%x (%u) via 0x%x\r\n", som_p, siz_w, HEAP.cac_p);
cac_u->nex_p = 0;
cac_u->pre_p = 0;
HEAP.fre_p = HEAP.erf_p = fre_p;
fre_p = 0;
}
else {
c3_w fex_w;
while ( ((fex_w = fre_u->pag_w + fre_u->siz_w) < pag_w)
&& fre_u->nex_p )
{
fre_u = u3to(u3a_dell, fre_u->nex_p);
}
if ( fre_u->pag_w > nex_w ) { // insert before
cac_u->nex_p = u3of(u3a_dell, fre_u);
cac_u->pre_p = fre_u->pre_p;
fre_u->pre_p = fre_p;
// XX sanity
if ( cac_u->pre_p ) {
u3to(u3a_dell, cac_u->pre_p)->nex_p = fre_p;
}
else {
HEAP.fre_p = fre_p;
}
fre_p = 0;
}
else if ( fex_w == pag_w ) { // append to entry
fre_u->siz_w += siz_w;
// coalesce with next entry
//
if ( fre_u->nex_p
&& ((fex_w + siz_w) == u3to(u3a_dell, fre_u->nex_p)->pag_w) )
{
del_u = u3to(u3a_dell, fre_u->nex_p);
fre_u->siz_w += del_u->siz_w;
fre_u->nex_p = del_u->nex_p;
// XX sanity
if ( del_u->nex_p ) {
u3to(u3a_dell, del_u->nex_p)->pre_p = u3of(u3a_dell, fre_u);
}
else {
HEAP.erf_p = u3of(u3a_dell, fre_u);
}
}
}
else if ( fre_u->pag_w == nex_w ) { // prepend to entry
fre_u->siz_w += siz_w;
fre_u->pag_w = pag_w;
}
else if ( !fre_u->nex_p ) { // insert after
cac_u->nex_p = 0;
cac_u->pre_p = u3of(u3a_dell, fre_u);
HEAP.erf_p = fre_u->nex_p = fre_p;
fre_p = 0;
}
else {
fprintf(stderr, "\033[31m"
"palloc: free list hosed at som_p=0x%x pag=%u len=%u\r\n"
"\033[0m",
(u3_post)u3of(u3a_dell, fre_u), fre_u->pag_w, fre_u->siz_w);
u3_assert(!"loom: corrupt"); return 0;
}
}
if ( fre_p ) {
if ( !HEAP.cac_p ) {
HEAP.cac_p = fre_p;
}
else {
_ifree(fre_p);
}
if ( del_u ) {
_ifree(u3of(u3a_dell, del_u));
}
}
return siz_w;
}
static void
_free_words(u3_post som_p, c3_w pag_w, u3_post dir_p)
{
u3a_crag *pag_u = u3to(u3a_crag, dir_p);
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
#ifdef SANITY
assert( page_to_post(pag_u->pag_w) == (som_p & ~((1U << u3a_page) - 1)) );
assert( pag_u->log_s < u3a_page );
#endif
c3_g bit_g = pag_u->log_s - u3a_min_log;
c3_w pos_w = (som_p & ((1U << u3a_page) - 1)) >> pag_u->log_s;
const u3a_hunk_dose *hun_u = &(u3a_Hunk[bit_g]);
if ( som_p & (hun_u->len_s - 1) ) {
fprintf(stderr, "\033[31m"
"palloc: bad alignment som_p=0x%x pag=%u cag=0x%x len_s=%u\r\n"
"\033[0m",
som_p, post_to_page(som_p), dir_p, hun_u->len_s);
u3_assert(!"loom: corrupt"); return;
}
if ( pag_u->map_w[pos_w >> 5] & (1U << (pos_w & 31)) ) {
fprintf(stderr, "\033[31m"
"palloc: double free som_p=0x%x pag=0x%x\r\n"
"\033[0m",
som_p, dir_p);
u3_assert(!"loom: corrupt"); return;
}
pag_u->map_w[pos_w >> 5] |= (1U << (pos_w & 31));
pag_u->fre_s++;
ASAN_POISON_MEMORY_REGION(u3a_into(som_p), hun_u->len_s << 2);
{
u3_post *bit_p = &(HEAP.wee_p[bit_g]);
u3a_crag *bit_u, *nex_u;
if ( 1 == pag_u->fre_s ) {
// page newly non-full, link
//
if ( &(u3H->rod_u) == u3R ) {
while ( *bit_p ) {
bit_u = u3to(u3a_crag, *bit_p);
nex_u = u3tn(u3a_crag, bit_u->nex_p);
if ( nex_u && (nex_u->pag_w < pag_u->pag_w) ) {
bit_p = &(bit_u->nex_p);
continue;
}
break;
}
}
pag_u->nex_p = *bit_p;
*bit_p = dir_p;
}
else if ( pag_u->fre_s == hun_u->ful_s ) {
// page now free
//
while ( *bit_p != dir_p ) {
bit_u = u3to(u3a_crag, *bit_p);
bit_p = &(bit_u->nex_p);
// XX sanity: must be in list
}
*bit_p = pag_u->nex_p;
dir_u[pag_u->pag_w] = u3a_head_pg;
som_p = page_to_post(pag_u->pag_w); // NB: clobbers
if ( som_p != dir_p ) {
_ifree(dir_p);
}
_ifree(som_p);
}
}
}
static void
_ifree(u3_post som_p)
{
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
c3_w pag_w = post_to_page(som_p);
if ( pag_w >= HEAP.len_w ) {
fprintf(stderr, "\033[31m"
"palloc: page out of heap som_p=0x%x pag_w=%u len_w=%u\r\n"
"\033[0m",
som_p, pag_w, HEAP.len_w);
u3_assert(!"loom: corrupt"); return;
}
u3_post dir_p = dir_u[pag_w];
if ( dir_p <= u3a_rest_pg ) {
(void)_free_pages(som_p, pag_w, dir_p);
}
else {
_free_words(som_p, pag_w, dir_p);
}
}
static u3_post
_irealloc(u3_post som_p, c3_w len_w)
{
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
c3_w pag_w = post_to_page(som_p);
c3_w old_w;
if ( pag_w >= HEAP.len_w ) {
fprintf(stderr, "\033[31m"
"palloc: realloc page out of heap som_p=0x%x pag_w=%u\r\n"
"\033[0m",
som_p, pag_w);
u3_assert(!"loom: corrupt"); return 0;
}
u3_post dir_p = dir_u[pag_w];
if ( u3a_head_pg == dir_p ) {
if ( som_p & ((1U << u3a_page) - 1) ) {
fprintf(stderr, "\033[31m"
"palloc: realloc bad page alignment som_p=0x%x\r\n"
"\033[0m",
som_p);
u3_assert(!"loom: corrupt"); return 0;
}
{
c3_w dif_w, siz_w = _pages_size(pag_w);
old_w = siz_w << u3a_page;
if ( (len_w < old_w)
&& (dif_w = (old_w - len_w) >> u3a_page) )
{
pag_w += HEAP.dir_ws * (siz_w - dif_w);
(void)_free_pages(page_to_post(pag_w), pag_w, u3a_head_pg);
// XX junk
// XX unpoison prefix, poison suffix
return som_p;
}
// XX also grow in place if sufficient adjacent pages are free?
}
}
else if ( u3a_rest_pg >= dir_p ) {
fprintf(stderr, "\033[31m"
"palloc: realloc wrong page som_p=0x%x\r\n"
"\033[0m",
som_p);
u3_assert(!"loom: corrupt"); return 0;
}
else {
u3a_crag *pag_u = u3to(u3a_crag, dir_p);
c3_w pos_w = (som_p & ((1U << u3a_page) - 1)) >> pag_u->log_s;
const u3a_hunk_dose *hun_u = &(u3a_Hunk[pag_u->log_s - u3a_min_log]);
if ( som_p & (hun_u->len_s - 1) ) {
fprintf(stderr, "\033[31m"
"palloc: realloc bad alignment som_p=0x%x pag=0x%x len_s=%u\r\n"
"\033[0m",
som_p, dir_p, hun_u->len_s);
u3_assert(!"loom: corrupt"); return 0;
}
if ( pag_u->map_w[pos_w >> 5] & (1U << (pos_w & 31)) ) {
fprintf(stderr, "\033[31m"
"palloc: realloc free som_p=0x%x pag=0x%x\r\n"
"\033[0m",
som_p, dir_p);
u3_assert(!"loom: corrupt"); return 0;
}
old_w = hun_u->len_s;
if ( (len_w <= old_w)
&& ((len_w > (old_w >> 1)) || (u3a_minimum == old_w)) )
{
// XX junk
// XX unpoison prefix, poison suffix
return som_p;
}
}
{
u3_post new_p = _imalloc(len_w);
memcpy(u3a_into(new_p), u3a_into(som_p), (c3_z)c3_min(len_w, old_w) << 2);
_ifree(som_p);
return new_p;
}
}
static void
_post_status(u3_post som_p)
{
u3p(u3a_crag) *dir_u = u3to(u3p(u3a_crag), HEAP.pag_p);
c3_w pag_w = post_to_page(som_p);
if ( pag_w >= HEAP.len_w ) {
fprintf(stderr, "palloc: out of heap: post som_p=0x%x pag_w=%u len_w=%u\r\n",
som_p, pag_w, HEAP.len_w);
return;
}
u3_post dir_p = dir_u[pag_w];