Lines Matching defs:cnt
425 static void decode_vec(size_t *v, size_t *a, size_t cnt)
428 for (i=0; i<cnt; i++) a[i] = 0;
429 for (; v[0]; v+=2) if (v[0]-1<cnt-1) {
967 for (size_t cnt = 0; cnt < verneed->vn_cnt; cnt++) {
2188 size_t i, cnt=0;
2194 cnt++;
2196 if (p->dynv[i] == DT_NEEDED) cnt++;
2199 p->deps = (p==head && cnt<2) ? builtin_deps :
2200 calloc(cnt+1, sizeof *p->deps);
2205 cnt=0;
2207 p->deps[cnt++] = q;
2218 p->deps[cnt++] = dep;
2220 p->deps[cnt] = 0;
2221 p->ndeps_direct = cnt;
2237 size_t i, j, cnt, ndeps_all;
2259 for (j=cnt=0; j<dep->ndeps_direct; j++)
2260 if (!dep->deps[j]->mark) cnt++;
2262 malloc(sizeof(*tmp) * (ndeps_all+cnt+1)) :
2263 realloc(p->deps, sizeof(*tmp) * (ndeps_all+cnt+1));
2512 size_t min_addr = -1, max_addr = 0, cnt;
2514 for (cnt = p->phnum; cnt--; ph = (void *)((char *)ph + p->phentsize)) {
2583 size_t cnt, qpos, spos, i;
2593 for (cnt=0; dso->deps[cnt]; cnt++)
2594 dso->deps[cnt]->mark = 0;
2595 cnt++; /* self, not included in deps */
2597 for (cnt=0, p=head; p; cnt++, p=p->next)
2600 cnt++; /* termination slot */
2601 if (dso==head && cnt <= countof(builtin_ctor_queue))
2604 queue = calloc(cnt, sizeof *queue);
2617 spos = cnt;
2623 while (spos<cnt) {
5442 size_t i, cnt = 0;
5450 cnt++;
5455 cnt++;
5460 p->deps = (p == head && cnt < MIN_DEPS_COUNT) ? builtin_deps :
5461 calloc(cnt + 1, sizeof *p->deps);
5469 cnt = 0;
5472 p->deps[cnt++] = q;
5504 p->deps[cnt++] = task->p;
5512 p->deps[cnt] = 0;
5513 p->ndeps_direct = cnt;
5766 size_t cnt;
5768 for (cnt = p->phnum; cnt--; ph = (void *)((char *)ph + p->phentsize)) {