Lines Matching defs:cnt
459 static void decode_vec(size_t *v, size_t *a, size_t cnt)
462 for (i=0; i<cnt; i++) a[i] = 0;
463 for (; v[0]; v+=2) if (v[0]-1<cnt-1) {
1002 for (size_t cnt = 0; cnt < verneed->vn_cnt; cnt++) {
2376 size_t i, cnt=0;
2382 cnt++;
2384 if (p->dynv[i] == DT_NEEDED) cnt++;
2387 p->deps = (p==head && cnt<2) ? builtin_deps :
2388 calloc(cnt+1, sizeof *p->deps);
2393 cnt=0;
2395 p->deps[cnt++] = q;
2406 p->deps[cnt++] = dep;
2408 p->deps[cnt] = 0;
2409 p->ndeps_direct = cnt;
2425 size_t i, j, cnt, ndeps_all;
2460 for (j=cnt=0; j<dep->ndeps_direct; j++)
2461 if (!dep->deps[j]->mark) cnt++;
2463 malloc(sizeof(*tmp) * (ndeps_all+cnt+1)) :
2464 realloc(p->deps_all, sizeof(*tmp) * (ndeps_all+cnt+1));
2486 for (j=cnt=0; j<dep->ndeps_direct; j++)
2487 if (!dep->deps[j]->mark) cnt++;
2489 malloc(sizeof(*tmp) * (ndeps_all+cnt+1)) :
2490 realloc(p->deps, sizeof(*tmp) * (ndeps_all+cnt+1));
2741 size_t min_addr = -1, max_addr = 0, cnt;
2743 for (cnt = p->phnum; cnt--; ph = (void *)((char *)ph + p->phentsize)) {
2812 size_t cnt, qpos, spos, i;
2822 for (cnt=0; dso->deps[cnt]; cnt++)
2823 dso->deps[cnt]->mark = 0;
2824 cnt++; /* self, not included in deps */
2826 for (cnt=0, p=head; p; cnt++, p=p->next)
2829 cnt++; /* termination slot */
2830 if (dso==head && cnt <= countof(builtin_ctor_queue))
2833 queue = calloc(cnt, sizeof *queue);
2846 spos = cnt;
2852 while (spos<cnt) {
5833 size_t i, cnt = 0;
5841 cnt++;
5846 cnt++;
5851 p->deps = (p == head && cnt < MIN_DEPS_COUNT) ? builtin_deps :
5852 calloc(cnt + 1, sizeof *p->deps);
5860 cnt = 0;
5863 p->deps[cnt++] = q;
5895 p->deps[cnt++] = task->p;
5903 p->deps[cnt] = 0;
5904 p->ndeps_direct = cnt;
6157 size_t cnt;
6159 for (cnt = p->phnum; cnt--; ph = (void *)((char *)ph + p->phentsize)) {