Lines Matching defs:cnt
218 static void decode_vec(size_t *v, size_t *a, size_t cnt)
221 for (i=0; i<cnt; i++) a[i] = 0;
222 for (; v[0]; v+=2) if (v[0]-1<cnt-1) {
1305 size_t i, cnt=0;
1311 cnt++;
1313 if (p->dynv[i] == DT_NEEDED) cnt++;
1316 p->deps = (p==head && cnt<2) ? builtin_deps :
1317 calloc(cnt+1, sizeof *p->deps);
1322 cnt=0;
1324 p->deps[cnt++] = q;
1334 p->deps[cnt++] = dep;
1336 p->deps[cnt] = 0;
1337 p->ndeps_direct = cnt;
1349 size_t i, j, cnt, ndeps_all;
1371 for (j=cnt=0; j<dep->ndeps_direct; j++)
1372 if (!dep->deps[j]->mark) cnt++;
1374 malloc(sizeof(*tmp) * (ndeps_all+cnt+1)) :
1375 realloc(p->deps, sizeof(*tmp) * (ndeps_all+cnt+1));
1483 size_t min_addr = -1, max_addr = 0, cnt;
1485 for (cnt = p->phnum; cnt--; ph = (void *)((char *)ph + p->phentsize)) {
1554 size_t cnt, qpos, spos, i;
1564 for (cnt=0; dso->deps[cnt]; cnt++)
1565 dso->deps[cnt]->mark = 0;
1566 cnt++; /* self, not included in deps */
1568 for (cnt=0, p=head; p; cnt++, p=p->next)
1571 cnt++; /* termination slot */
1572 if (dso==head && cnt <= countof(builtin_ctor_queue))
1575 queue = calloc(cnt, sizeof *queue);
1588 spos = cnt;
1594 while (spos<cnt) {