File: block_allocator.c

package info (click to toggle)
pike8.0 8.0.702-1
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 79,608 kB
  • sloc: ansic: 266,508; xml: 186,324; makefile: 3,537; sh: 1,731; cpp: 1,328; lisp: 655; awk: 441; asm: 242; objc: 240; pascal: 157; perl: 34; sed: 34
file content (658 lines) | stat: -rw-r--r-- 17,933 bytes parent folder | download | duplicates (3)
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
#include "global.h"
#include "pike_error.h"
#include "pike_memory.h"

#include "block_allocator.h"
#include "bitvector.h"

#include <stdlib.h>

#define BA_BLOCKN(l, p, n) ((struct ba_block_header *)((char*)(p) + (l).doffset + (n)*((l).block_size)))
#define BA_LASTBLOCK(l, p) ((struct ba_block_header*)((char*)(p) + (l).doffset + (l).offset))
#define BA_CHECK_PTR(l, p, ptr)	((size_t)((char*)(ptr) - (char*)(p)) <= (l).offset + (l).doffset)

#define BA_ONE	((struct ba_block_header *)1)
#define BA_FLAG_SORTED 1u

#ifdef PIKE_DEBUG
static void print_allocator(const struct block_allocator * a);
#endif

#ifdef PIKE_DEBUG
static void ba_check_ptr(struct block_allocator * a, int page, void * ptr, struct ba_block_header *loc,
                         int ln);
#endif

static INLINE unsigned INT32 ba_block_number(const struct ba_layout * l, const struct ba_page * p,
                                             const void * ptr) {
    return ((char*)ptr - (char*)BA_BLOCKN(*l, p, 0)) / l->block_size;
}

static INLINE void ba_dec_layout(struct ba_layout * l, int i) {
    l->blocks >>= i;
    l->offset += l->block_size;
    l->offset >>= i;
    l->offset -= l->block_size;
}

static INLINE void ba_inc_layout(struct ba_layout * l, int i) {
    l->blocks <<= i;
    l->offset += l->block_size;
    l->offset <<= i;
    l->offset -= l->block_size;
}

static INLINE void ba_double_layout(struct ba_layout * l) {
    ba_inc_layout(l, 1);
}

static INLINE void ba_half_layout(struct ba_layout * l) {
    ba_dec_layout(l, 1);
}

static INLINE struct ba_layout ba_get_layout(const struct block_allocator * a, int i) {
    struct ba_layout l = a->l;
    ba_inc_layout(&l, i);
    return l;
}

struct ba_block_header {
    struct ba_block_header * next;
};

static INLINE void ba_clear_page(struct block_allocator * VALGRINDUSED(a), struct ba_page * p, struct ba_layout * l) {
    p->h.used = 0;
    p->h.flags = BA_FLAG_SORTED;
    p->h.first = BA_BLOCKN(*l, p, 0);
    PIKE_MEMPOOL_ALLOC(a, p->h.first, l->block_size);
    p->h.first->next = BA_ONE;
    PIKE_MEMPOOL_FREE(a, p->h.first, l->block_size);
}

static struct ba_page * ba_alloc_page(struct block_allocator * a, int i) {
    struct ba_layout l = ba_get_layout(a, i);
    size_t n = l.offset + l.block_size + l.doffset;
    struct ba_page * p;

    /*
     * note that i is always positive, so this only
     * happens if ba_get_layout overflows
     */
    if (a->l.offset > l.offset || n < l.offset) {
        Pike_error("Overflow.\n");
    }

    if (l.alignment) {
	p = xalloc_aligned(n, l.alignment);
    } else {
#ifdef DEBUG_MALLOC
	/* In debug malloc mode, calling xalloc from the block alloc may result
	 * in a deadlock, since xalloc will call ba_alloc, which in turn may call xalloc.
	 */
	p = system_malloc(n);
	if (!p) {
	    fprintf(stderr, "Fatal: Out of memory.\n");
	    exit(17);
	}
#else
	p = xalloc(n);
#endif
    }
    ba_clear_page(a, p, &a->l);
    PIKE_MEM_NA_RANGE((char*)p + l.doffset, n - l.doffset);
    return p;
}

static void ba_free_empty_pages(struct block_allocator * a) {
    int i;

    for (i = a->size - 1; i >= 0; i--) {
        struct ba_page * p = a->pages[i];
        if (p->h.used) break;
#ifdef DEBUG_MALLOC
        system_free(p);
#else
        free(p);
#endif
        a->pages[i] = NULL;
    }

    if (a->size != i+1) {
        a->size = i+1;
        a->alloc = a->last_free = MAXIMUM(0, i);
    }
}

PMOD_EXPORT void ba_low_init_aligned(struct block_allocator * a) {
    unsigned INT32 block_size = MAXIMUM(a->l.block_size, sizeof(struct ba_block_header));

    PIKE_MEMPOOL_CREATE(a);

    if (a->l.alignment) {
	if (a->l.alignment & (a->l.alignment - 1))
	    Pike_fatal("Block allocator a->l.alignment is not a power of 2.\n");
	if (block_size & (a->l.alignment-1))
	    Pike_fatal("Block allocator block size is not aligned.\n");
	a->l.doffset = PIKE_ALIGNTO(sizeof(struct ba_page), a->l.alignment);
    } else {
	a->l.doffset = sizeof(struct ba_page);
    }

    if (a->l.blocks & (a->l.blocks - 1)) {
        unsigned INT32 tmp = round_up32(a->l.blocks);
        if (tmp) a->l.blocks = tmp;
    } else if (!a->l.blocks) a->l.blocks = 1;
    a->l.block_size = block_size;
    a->l.offset = block_size * (a->l.blocks-1);
}

PMOD_EXPORT void ba_init_aligned(struct block_allocator * a, unsigned INT32 block_size,
				 unsigned INT32 blocks, unsigned INT32 alignment) {
    a->l.blocks = blocks;
    a->l.block_size = block_size;
    a->l.alignment = alignment;
    ba_low_init_aligned(a);
    a->alloc = a->last_free = a->size = 0;
    memset(a->pages, 0, sizeof(a->pages));
}

PMOD_EXPORT void ba_destroy(struct block_allocator * a) {
    int i;

    if (!a->l.offset) return;

    for (i = 0; i < a->size; i++) {
	if (a->pages[i]) {
#ifdef DEBUG_MALLOC
	    system_free(a->pages[i]);
#else
	    free(a->pages[i]);
#endif
	    a->pages[i] = NULL;
	}
    }
    a->alloc = a->last_free = a->size = 0;
    PIKE_MEMPOOL_DESTROY(a);
}

PMOD_EXPORT void ba_free_all(struct block_allocator * a) {
    int i;

    if (!a->l.offset) return;
    if (!a->size) return;

    for (i = 0; i < a->size; i++) {
        free(a->pages[i]);
        a->pages[i] = NULL;
    }
    a->size = 0;
    a->alloc = 0;
    a->last_free = 0;
}

PMOD_EXPORT size_t ba_count(const struct block_allocator * a) {
    size_t c = 0;
    unsigned int i;
    for (i = 0; i < a->size; i++) {
	c += a->pages[i]->h.used;
    }

    return c;
}

PMOD_EXPORT void ba_count_all(const struct block_allocator * a, size_t * num, size_t * size) {
    size_t n = 0, b = sizeof( struct block_allocator );
    unsigned int i;
    for( i=0; i<a->size; i++ )
    {
        struct ba_layout l = ba_get_layout( a, i );
        b += l.offset + l.block_size + l.doffset;
        n += a->pages[i]->h.used;
    }
    *num = n;
    *size = b;
}

static void ba_low_alloc(struct block_allocator * a) {
    int i;

    if (!a->l.offset) {
        ba_low_init_aligned(a);
    }

    /*
     * The biggest page is full, lets try to find some space in the previous ones
     */
    for (i = a->size - 1; i >= 0; i--) {
        struct ba_page * p = a->pages[i];

        if (p->h.first) {
            a->alloc = i;
            return;
        }
    }

    if (a->size == (sizeof(a->pages)/sizeof(a->pages[0]))) {
        Pike_error("Out of memory.\n");
    }
    a->pages[a->size] = ba_alloc_page(a, a->size);
    a->alloc = a->size;
    a->size++;
}

ATTRIBUTE((malloc))
PMOD_EXPORT void * ba_alloc(struct block_allocator * a) {
    struct ba_page * p = a->pages[a->alloc];
    struct ba_block_header * ptr;

    if (!p || !p->h.first) {
	ba_low_alloc(a);
	p = a->pages[a->alloc];
    }

    ptr = p->h.first;
    PIKE_MEMPOOL_ALLOC(a, ptr, a->l.block_size);
    PIKE_MEM_RW_RANGE(ptr, sizeof(struct ba_block_header));

    p->h.used++;

#ifdef PIKE_DEBUG
    ba_check_ptr(a, a->alloc, ptr, NULL, __LINE__);
#endif

    if (ptr->next == BA_ONE) {
	struct ba_layout l = ba_get_layout(a, a->alloc);
	p->h.first = (struct ba_block_header*)((char*)ptr + a->l.block_size);
	PIKE_MEMPOOL_ALLOC(a, p->h.first, a->l.block_size);
	p->h.first->next = (struct ba_block_header*)(ptrdiff_t)!(p->h.first == BA_LASTBLOCK(l, p));
	PIKE_MEMPOOL_FREE(a, p->h.first, a->l.block_size);
    } else {
#ifdef PIKE_DEBUG
        if (ptr->next)
            ba_check_ptr(a, a->alloc, ptr->next, ptr, __LINE__);
#endif
	p->h.first = ptr->next;
    }
    PIKE_MEM_WO_RANGE(ptr, sizeof(struct ba_block_header));

#if PIKE_DEBUG
    if (a->l.alignment && (size_t)ptr & (a->l.alignment - 1)) {
	print_allocator(a);
	Pike_fatal("Returning unaligned pointer.\n");
    }
#endif

    return ptr;
}

PMOD_EXPORT void ba_free(struct block_allocator * a, void * ptr) {
    int i = a->last_free;
    struct ba_page * p = a->pages[i];
    struct ba_layout l = ba_get_layout(a, i);

#if PIKE_DEBUG
    if (a->l.alignment && (size_t)ptr & (a->l.alignment - 1)) {
	print_allocator(a);
	Pike_fatal("Returning unaligned pointer.\n");
    }
#endif

    if (BA_CHECK_PTR(l, p, ptr)) goto found;

#ifdef PIKE_DEBUG
    p = NULL;
#endif

    for (i = a->size-1, l = ba_get_layout(a, i); i >= 0; i--, ba_half_layout(&l)) {
	if (BA_CHECK_PTR(l, a->pages[i], ptr)) {
	    a->last_free = i;
	    p = a->pages[i];
	    break;
	}
    }
found:

    if (p) {
	struct ba_block_header * b = (struct ba_block_header*)ptr;
#ifdef PIKE_DEBUG
	if (!p->h.used) {
	    print_allocator(a);
	    Pike_fatal("freeing from empty page %p\n", p);
	}
        ba_check_ptr(a, a->last_free, ptr, NULL, __LINE__);
#endif
        b->next = p->h.first;
        p->h.first = b;
        p->h.flags = 0;
	if (!(--p->h.used)) {
            if (i+1 == a->size) {
                ba_free_empty_pages(a);
            } else {
                ba_clear_page(a, p, &l);
            }
	}
    } else {
#ifdef PIKE_DEBUG
	print_allocator(a);
#endif
	Pike_fatal("ptr %p not in any page.\n", ptr);
    }
    PIKE_MEMPOOL_FREE(a, ptr, a->l.block_size);
}

#ifdef PIKE_DEBUG
static void print_allocator(const struct block_allocator * a) {
    int i;
    struct ba_layout l;

    for (i = a->size-1, l = ba_get_layout(a, i); i >= 0; ba_half_layout(&l), i--) {
	struct ba_page * p = a->pages[i];
	fprintf(stderr, "page: %p used: %u/%u last: %p p+offset: %p\n", a->pages[i],
		p->h.used, l.blocks,
		BA_BLOCKN(l, p, l.blocks-1), BA_LASTBLOCK(l, p));
    }
}

#define Pike_nfatal(n) \
    (fprintf(stderr,msg_fatal_error,__FILE__,(long)(n)),debug_fatal)

static void ba_check_ptr(struct block_allocator * a, int page, void * ptr, struct ba_block_header * loc,
                         int ln) {
    struct ba_layout l = ba_get_layout(a, page);
    struct ba_page * p = a->pages[page];

    if (BA_BLOCKN(l, p, ba_block_number(&l, p, ptr)) != ptr) {
        char * block = (char*)BA_BLOCKN(l, p, ba_block_number(&l, p, ptr));
        print_allocator(a);
        if (loc) fprintf(stderr, "In block %p:\n", loc);
        Pike_nfatal(ln)("Free-List corruption. List pointer %p is inside block [%p , %p)\n",
                        ptr, block, block + l.block_size);
    }

    if (!BA_CHECK_PTR(l, p, ptr)) {
        print_allocator(a);
        if (loc) fprintf(stderr, "In block %p:\n", loc);
        Pike_nfatal(ln)("Free-List corruption. Block %p does not belong to page %p\n", ptr, p);
    }
}
#endif

#if SIZEOF_LONG == 8 || SIZEOF_LONG_LONG == 8
#define BV_LENGTH   64
#define BV_ONE	    ((unsigned INT64)1)
#define BV_NIL	    ((unsigned INT64)0)
#define BV_CLZ	    clz64
#define BV_CTZ	    ctz64
typedef unsigned INT64 bv_int_t;
#else
#define BV_LENGTH   32
#define BV_ONE	    ((unsigned INT32)1)
#define BV_NIL	    ((unsigned INT32)0)
#define BV_CLZ	    clz32
#define BV_CTZ	    ctz32
typedef unsigned INT32 bv_int_t;
#endif

#define BV_WIDTH    (BV_LENGTH/8)

struct bitvector {
    size_t length;
    bv_int_t * v;
};

static INLINE void bv_set_vector(struct bitvector * bv, void * p) {
    bv->v = (bv_int_t*)p;
}

static INLINE size_t bv_byte_length(struct bitvector * bv) {
    size_t bytes = ((bv->length + 7) / 8);

    return PIKE_ALIGNTO(bytes, BV_WIDTH);
}

static INLINE void bv_set(struct bitvector * bv, size_t n, int value) {
    size_t bit = n % BV_LENGTH;
    size_t c = n / BV_LENGTH;
    bv_int_t * _v = bv->v + c;
    if (value) *_v |= BV_ONE << bit;
    else *_v &= ~(BV_ONE << bit);
}

static INLINE int bv_get(struct bitvector * bv, size_t n) {
    size_t bit = n % BV_LENGTH;
    size_t c = n / BV_LENGTH;
    return !!(bv->v[c] & (BV_ONE << bit));
}

static size_t bv_ctz(struct bitvector * bv, size_t n) {
    size_t bit;
    size_t c;
    bv_int_t * _v;
    bv_int_t V;

    if (n < bv->length) {
        bit = n % BV_LENGTH;
        c = n / BV_LENGTH;
        _v = bv->v + c;
        V = *_v & (~BV_NIL << bit);

        bit = c * BV_LENGTH;

        while (1) {
            if (V) {
                bit += BV_CTZ(V);
                if (bit >= bv->length) break;
                return bit;
            }

            bit += BV_LENGTH;

            if (bit >= bv->length) break;

            V = *(++_v);
        }
    }

    return (size_t)-1;
}

#ifdef PIKE_DEBUG
static void ATTRIBUTE((unused)) bv_print(struct bitvector * bv) {
    size_t i;
    for (i = 0; i < bv->length; i++) {
	fprintf(stderr, "%d", bv_get(bv, i));
    }
    fprintf(stderr, "\n");
}
#endif

static void ba_sort_free_list(const struct block_allocator *VALGRINDUSED(a),
			      struct ba_page *p,
                              const struct ba_layout *l) {
    struct bitvector v;
    size_t i, j;
    struct ba_block_header * b = p->h.first;
    struct ba_block_header ** t = &p->h.first;

    if (!b) return;

    j = 0;

    v.length = l->blocks;
    i = bv_byte_length(&v);
    /* we should probably reuse an area for this.
     */
    bv_set_vector(&v, alloca(i));
    memset(v.v, 0, i);

    /*
     * store the position of all blocks in a bitmask
     */
    while (b) {
	unsigned INT32 n = ba_block_number(l, p, b);
#ifdef PIKE_DEBUG
        if (bv_get(&v, n)) {
            fprintf(stderr, "Double free detected.");
            /* Printing an error to stderr here and continuing makes probably more sense
             * than throwing an error. This sort algorithm will "correct" the corrupted free
             * list.
             */
        }
#endif
	bv_set(&v, n, 1);
        j++;
        PIKE_MEMPOOL_ALLOC(a, b, l->block_size);
        PIKE_MEM_RW_RANGE(b, sizeof(struct ba_block_header));
	if (b->next == BA_ONE) {
	    v.length = n+1;
            PIKE_MEMPOOL_FREE(a, b, l->block_size);
	    break;
	} else {
            struct ba_block_header * tmp = b->next;
            PIKE_MEMPOOL_FREE(a, b, l->block_size);
            b = tmp;
        }
    }

    b = NULL;

    /*
     * Handle consecutive free blocks in the end, those
     * we dont need anyway.
     */
    if (v.length) {
	i = v.length-1;
	while (i && bv_get(&v, i)) { i--; j--; }
	v.length = i+1;
    }

    if (!j) goto last;

    j = 0;

    /*
     * We now rechain all blocks.
     */
    while ((i = bv_ctz(&v, j)) != (size_t)-1) {
        struct ba_block_header * tmp = b;
	*t = b = BA_BLOCKN(*l, p, i);
        if (tmp) PIKE_MEMPOOL_FREE(a, tmp, l->block_size);
        PIKE_MEMPOOL_ALLOC(a, b, l->block_size);
	t = &(b->next);
	j = i+1;
    }

last:
    /*
     * The last one
     */

    if (v.length < l->blocks) {
        struct ba_block_header * tmp = b;
        *t = b = BA_BLOCKN(*l, p, v.length);
        if (tmp) PIKE_MEMPOOL_FREE(a, tmp, l->block_size);
        PIKE_MEMPOOL_ALLOC(a, b, l->block_size);
	b->next = BA_ONE;
        PIKE_MEMPOOL_FREE(a, b, l->block_size);
    } else {
        if (b) PIKE_MEMPOOL_FREE(a, b, l->block_size);
        PIKE_MEMPOOL_ALLOC(a, t, l->block_size);
        *t = NULL;
        PIKE_MEMPOOL_FREE(a, t, l->block_size);
    }

}

/*
 * This function allows iteration over all allocated blocks. Some things are not allowed:
 *  - throwing from within the callback
 *  - allocating blocks during iteration
 *  - nested iteration
 *
 *  - freeing is OK, however some nodes will _still_ beiterated over, when they are freed during the
 *    iteration.
 *
 *  TODO: if needed, allocation can be fixed. For that to work, the free list of the currently
 *  iterated page has to be removed and restored after iteration. that would guarantee allocation
 *  from a different page
 *
 *  NOTE
 *    the callback will be called multiple times. for a usage example, see las.c
 */
PMOD_EXPORT
void ba_walk(struct block_allocator * a, ba_walk_callback cb, void * data) {
    struct ba_iterator it;
    unsigned INT32 i;

    it.l = ba_get_layout(a, 0);

    if (!a->size) return;

    for (i = 0; i < a->size; i++) {
        struct ba_page * p = a->pages[i];
        if (p && p->h.used) {
            struct ba_block_header *free_block;

            if (!(p->h.flags & BA_FLAG_SORTED)) {
                ba_sort_free_list(a, p, &it.l);
                p->h.flags |= BA_FLAG_SORTED;
            }
            /* we fake an allocation to prevent the page from being freed during iteration */
            p->h.used ++;

            free_block = p->h.first;

            it.cur = BA_BLOCKN(it.l, p, 0);

            while(1) {
                if (free_block == NULL) {
                    it.end = ((char*)BA_LASTBLOCK(it.l, p) + it.l.block_size);
#ifdef PIKE_DEBUG
                    if ((char*)it.end < (char*)it.cur)
                        Pike_fatal("Free list not sorted in ba_walk.\n");
#endif
                    if ((char*)it.end != (char*)it.cur) {
                        cb(&it, data);
                    }
                    break;
                } else if (free_block == BA_ONE) {
                    /* all consecutive blocks are free, so we are dont */
                    break;
                }

                it.end = free_block;

                PIKE_MEMPOOL_ALLOC(a, free_block, it.l.block_size);
                PIKE_MEM_RW_RANGE(free_block, sizeof(struct ba_block_header));
                {
                    struct ba_block_header *tmp = free_block->next;
                    PIKE_MEMPOOL_FREE(a, free_block, it.l.block_size);
                    free_block = tmp;
                }

#ifdef PIKE_DEBUG
                if ((char*)it.end < (char*)it.cur)
                    Pike_fatal("Free list not sorted in ba_walk.\n");
#endif
                if ((char*)it.end != (char*)it.cur) {
#ifdef PIKE_DEBUG
                    ba_check_ptr(a, i, it.cur, NULL, __LINE__);
                    ba_check_ptr(a, i, (char*)it.end - it.l.block_size, NULL, __LINE__);
#endif
                    cb(&it, data);
                }

                it.cur = (char*)it.end + it.l.block_size;
            }

            /* if the callback throws, this will never happen */
            p->h.used--;
        }
        ba_double_layout(&it.l);
    }

    /* during the iteration blocks might have been freed. The pages will still be there, so we might have
     * to do some cleanup. */
    if (!a->pages[a->size-1]->h.used)
        ba_free_empty_pages(a);
}