Function stack_grow

lib_acl/src/stdlib/common/acl_stack.c:110–148

/* grows internal buffer to satisfy required minimal capacity */

static void stack_grow(ACL_STACK *s, int min_capacity)
{
	const char *myname = "stack_grow";
	const char *ptr;
	int min_delta = 16;
	int delta;

	/* don't need to grow the capacity of the array */
	if (s->capacity >= min_capacity)
		return;
	delta = min_capacity;
	/* make delta a multiple of min_delta */
	delta += min_delta - 1;
	delta /= min_delta;
	delta *= min_delta;
	/* actual grow */
	if (delta <= 0)
		return;
	s->capacity += delta;
	if (s->items) {
		s->items = (void **) acl_default_realloc(__FILE__, __LINE__,
				s->items, s->capacity * sizeof(void *));
		ptr = "realloc";
	} else {
		s->items = (void **) acl_default_malloc(__FILE__, __LINE__,
				s->capacity * sizeof(void *));
		ptr = "malloc";
	}

	if (s->items == NULL) {
		char ebuf[256];
		acl_msg_fatal("%s(%d): %s error(%s)",
			myname, __LINE__, ptr,
			acl_last_strerror(ebuf, sizeof(ebuf)));
	}

	/* reset, just in case */
	memset(s->items + s->count, 0, (s->capacity - s->count) * sizeof(void *));
}

/* if you are going to append a known and large number of items, call this first */