Lines Matching defs:num
25 int num;
52 ret->num = 0;
60 if (sk == NULL || sk->num == 0) {
71 memcpy(ret->data, sk->data, sizeof(void *) * sk->num);
91 ret->num = 0;
99 if (sk == NULL || sk->num == 0) {
106 ret->num_alloc = sk->num > min_nodes ? sk->num : min_nodes;
111 for (i = 0; i < ret->num; ++i) {
179 if (n > max_nodes - st->num) {
185 num_alloc = st->num + n;
192 * At this point, |st->num_alloc| and |st->num| are 0;
266 if (st->num == max_nodes) {
274 if ((loc >= st->num) || (loc < 0)) {
275 st->data[st->num] = data;
278 sizeof(st->data[0]) * (st->num - loc));
281 st->num++;
283 return st->num;
290 if (loc != st->num - 1)
292 sizeof(st->data[0]) * (st->num - loc - 1));
293 st->num--;
305 for (i = 0; i < st->num; i++)
313 if (st == NULL || loc < 0 || loc >= st->num)
325 if (st == NULL || st->num == 0)
329 for (i = 0; i < st->num; i++)
341 if (st->num > 1)
342 qsort(st->data, st->num, sizeof(void *), st->comp);
349 r = ossl_bsearch(&data, st->data, st->num, sizeof(void *), st->comp,
357 while (p < st->data + st->num) {
388 return OPENSSL_sk_insert(st, data, st->num);
398 if (st == NULL || st->num == 0)
405 if (st == NULL || st->num == 0)
407 return internal_delete(st, st->num - 1);
412 if (st == NULL || st->num == 0)
414 memset(st->data, 0, sizeof(*st->data) * st->num);
415 st->num = 0;
424 for (i = 0; i < st->num; i++)
440 return st == NULL ? -1 : st->num;
445 if (st == NULL || i < 0 || i >= st->num)
456 if (i < 0 || i >= st->num) {
469 if (st->num > 1)
470 qsort(st->data, st->num, sizeof(void *), st->comp);