line |
true |
false |
branch |
8
|
0 |
40971 |
size_t growth_factor = grow_by > 0? grow_by: B_STACK_DEFAULT_GROWTH_FACTOR; |
10
|
0 |
40971 |
if ((stack = malloc(sizeof(*stack))) == NULL) { |
14
|
0 |
40971 |
if ((stack->items = calloc(growth_factor, sizeof(void *))) == NULL) { |
39
|
0 |
0 |
if (newsize == 0) { |
43
|
0 |
0 |
if ((newitems = realloc(stack->items, newsize * sizeof(void *))) == NULL) { |
59
|
0 |
45877 |
if (stack->count == stack->size) { |
60
|
0 |
0 |
if (b_stack_resize(stack, stack->size + stack->growth_factor) == NULL) { |
80
|
0 |
15141 |
if (stack == NULL) return NULL; |
81
|
7069 |
8072 |
if (stack->count == 0) return NULL; |
89
|
0 |
8072 |
if (index == stack->size - (stack->growth_factor * 2)) { |
90
|
0 |
0 |
if (b_stack_resize(stack, stack->size - stack->growth_factor) == NULL) { |
105
|
0 |
413 |
if (stack == NULL) return NULL; |
106
|
0 |
413 |
if (stack->count == 0) return NULL; |
111
|
1238 |
413 |
for (i=1; icount; i++) { |
118
|
0 |
413 |
if (last == stack->size - (stack->growth_factor * 2)) { |
119
|
0 |
0 |
if (b_stack_resize(stack, stack->size - stack->growth_factor) == NULL) { |
131
|
0 |
819 |
if (stack == NULL) return NULL; |
132
|
32 |
787 |
if (stack->count == 0) return NULL; |
138
|
0 |
81853 |
if (index >= stack->count) return NULL; |
151
|
496 |
14138 |
for (i=0; i
|
165
|
0 |
34423 |
if (stack == NULL) return; |
167
|
34423 |
0 |
if (stack->destructor) { |
168
|
37392 |
34423 |
for (i=0; icount; i++) { |