X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/blobdiff_plain/71b291d71b70cd09865882235fca3a8d35edc6b3..1c60d219472b3de0080cda807b014d011e3b5ccb:/lib/pool_alloc.c diff --git a/lib/pool_alloc.c b/lib/pool_alloc.c index ab4ff0af..b0164e78 100644 --- a/lib/pool_alloc.c +++ b/lib/pool_alloc.c @@ -17,10 +17,10 @@ struct alloc_pool /* statistical data */ unsigned long e_created; /* extents created */ unsigned long e_freed; /* extents detroyed */ - uint64 n_allocated; /* calls to alloc */ - uint64 n_freed; /* calls to free */ - uint64 b_allocated; /* cum. bytes allocated */ - uint64 b_freed; /* cum. bytes freed */ + int64 n_allocated; /* calls to alloc */ + int64 n_freed; /* calls to free */ + int64 b_allocated; /* cum. bytes allocated */ + int64 b_freed; /* cum. bytes freed */ }; struct pool_extent @@ -34,7 +34,7 @@ struct pool_extent struct align_test { void *foo; - uint64 bar; + int64 bar; }; #define MINALIGN offsetof(struct align_test, bar) @@ -44,8 +44,7 @@ struct align_test { #define PTR_ADD(b,o) ( (void*) ((char*)(b) + (o)) ) alloc_pool_t -pool_create(size_t size, size_t quantum, - void (*bomb)(char *), int flags) +pool_create(size_t size, size_t quantum, void (*bomb)(const char *), int flags) { struct alloc_pool *pool; @@ -56,8 +55,7 @@ pool_create(size_t size, size_t quantum, pool->size = size /* round extent size to min alignment reqs */ ? (size + MINALIGN - 1) & ~(MINALIGN - 1) : POOL_DEF_EXTENT; - if (pool->flags & POOL_INTERN) - { + if (pool->flags & POOL_INTERN) { pool->size -= sizeof (struct pool_extent); flags |= POOL_APPEND; } @@ -77,15 +75,13 @@ pool_destroy(alloc_pool_t p) if (!pool) return; - if (pool->live) - { + if (pool->live) { cur = pool->live; free(cur->start); if (!(pool->flags & POOL_APPEND)) free(cur); } - for (cur = pool->free; cur; cur = next) - { + for (cur = pool->free; cur; cur = next) { next = cur->next; free(cur->start); if (!(pool->flags & POOL_APPEND)) @@ -95,7 +91,7 @@ pool_destroy(alloc_pool_t p) } void * -pool_alloc(alloc_pool_t p, size_t len, char *bomb) +pool_alloc(alloc_pool_t p, size_t len, const char *bomb) { struct alloc_pool *pool = (struct alloc_pool *) p; if (!pool) @@ -109,16 +105,14 @@ pool_alloc(alloc_pool_t p, size_t len, char *bomb) if (len > pool->size) goto bomb; - if (!pool->live || len > pool->live->free) - { + if (!pool->live || len > pool->live->free) { void *start; size_t free; size_t bound; size_t sqew; size_t asize; - if (pool->live) - { + if (pool->live) { pool->live->next = pool->free; pool->free = pool->live; } @@ -137,16 +131,11 @@ pool_alloc(alloc_pool_t p, size_t len, char *bomb) memset(start, 0, pool->size); if (pool->flags & POOL_APPEND) - { pool->live = PTR_ADD(start, free); - } else if (!(pool->live = (struct pool_extent *) malloc(sizeof (struct pool_extent)))) - { goto bomb; - } if (pool->flags & POOL_QALIGN && pool->quantum > 1 - && (sqew = (size_t)PTR_ADD(start, free) % pool->quantum)) - { + && (sqew = (size_t)PTR_ADD(start, free) % pool->quantum)) { bound += sqew; free -= sqew; } @@ -186,8 +175,7 @@ pool_free(alloc_pool_t p, size_t len, void *addr) else if (pool->quantum > 1 && len % pool->quantum) len += pool->quantum - len % pool->quantum; - if (!addr && pool->live) - { + if (!addr && pool->live) { pool->live->next = pool->free; pool->free = pool->live; pool->live = NULL; @@ -197,52 +185,43 @@ pool_free(alloc_pool_t p, size_t len, void *addr) pool->b_freed += len; cur = pool->live; - if (cur - && addr >= cur->start - && addr < PTR_ADD(cur->start, pool->size)) - { - if (addr == PTR_ADD(cur->start, cur->free)) - { + if (cur && addr >= cur->start + && addr < PTR_ADD(cur->start, pool->size)) { + if (addr == PTR_ADD(cur->start, cur->free)) { if (pool->flags & POOL_CLEAR) memset(addr, 0, len); pool->b_freed += len; - } else { + } else cur->bound += len; - } - if (cur->free + cur->bound >= pool->size) - { + if (cur->free + cur->bound >= pool->size) { size_t sqew; cur->free = pool->size; cur->bound = 0; if (pool->flags & POOL_QALIGN && pool->quantum > 1 - && (sqew = (size_t)PTR_ADD(cur->start, cur->free) % pool->quantum)) - { + && (sqew = (size_t)PTR_ADD(cur->start, cur->free) % pool->quantum)) { cur->bound += sqew; cur->free -= sqew; } } return; } - for (prev = NULL, cur = pool->free; cur; prev = cur, cur = cur->next) - { + for (prev = NULL, cur = pool->free; cur; prev = cur, cur = cur->next) { if (addr >= cur->start - && addr < cur->start + pool->size) + && addr < PTR_ADD(cur->start, pool->size)) break; } if (!cur) return; - if (prev) - { + if (prev) { prev->next = cur->next; cur->next = pool->free; pool->free = cur; } cur->bound += len; - if (cur->free + cur->bound >= pool->size) - { + if (cur->free + cur->bound >= pool->size) { pool->free = cur->next; free(cur->start); @@ -254,11 +233,11 @@ pool_free(alloc_pool_t p, size_t len, void *addr) } #define FDPRINT(label, value) \ - snprintf(buf, BUFSIZ, label, value), \ - write(fd, buf, strlen(buf)); + snprintf(buf, sizeof buf, label, value), \ + write(fd, buf, strlen(buf)) #define FDEXTSTAT(ext) \ - snprintf(buf, BUFSIZ, " %12ld %5ld\n", \ + snprintf(buf, sizeof buf, " %12ld %5ld\n", \ (long) ext->free, \ (long) ext->bound), \ write(fd, buf, strlen(buf)) @@ -291,14 +270,10 @@ pool_stats(alloc_pool_t p, int fd, int summarize) write(fd, "\n", 1); if (pool->live) - { FDEXTSTAT(pool->live); - } - strcpy(buf, " FREE BOUND\n"); + strlcpy(buf, " FREE BOUND\n", sizeof buf); write(fd, buf, strlen(buf)); for (cur = pool->free; cur; cur = cur->next) - { FDEXTSTAT(cur); - } }