src/libs/libsolv/solv/queue.c

168

q->alloc = solv_realloc2(q->alloc, off + q->count + n + EXTRA_SPACE, sizeof(Id));

src/libs/libsolv/solv/queue.c

170

q->left = n + EXTRA_SPACE;

src/libs/libsolv/solv/queue.c

205

q->alloc = solv_realloc2(q->alloc, off + q->count + n + EXTRA_SPACE, sizeof(Id));

src/libs/libsolv/solv/queue.c

207

q->left = n + EXTRA_SPACE;

src/libs/libsolv/solv/queue.c

38

t->alloc = t->elements = solv_malloc2(s->count + EXTRA_SPACE, sizeof(Id));

src/libs/libsolv/solv/queue.c

42

t->left = EXTRA_SPACE;

src/libs/libsolv/solv/queue.c

68

q->alloc = solv_malloc2(q->count + EXTRA_SPACE, sizeof(Id));

src/libs/libsolv/solv/queue.c

72

q->left = EXTRA_SPACE;

src/libs/libsolv/solv/queue.c

84

q->elements = q->alloc = solv_realloc2(q->alloc, q->count + EXTRA_SPACE, sizeof(Id));

src/libs/libsolv/solv/queue.c

85

q->left = EXTRA_SPACE;