Lines Matching refs:cnt
16 ALLOC_GROW(cmds->names, cmds->cnt + 1, cmds->alloc);
17 cmds->names[cmds->cnt++] = ent;
24 for (i = 0; i < cmds->cnt; ++i)
27 cmds->cnt = 0;
42 if (!cmds->cnt)
45 for (i = j = 1; i < cmds->cnt; i++)
49 cmds->cnt = j;
58 while (ci < cmds->cnt && ei < excludes->cnt) {
68 while (ci < cmds->cnt)
71 cmds->cnt = cj;
87 rows = (cmds->cnt + cols - 1) / cols;
96 if (n >= cmds->cnt)
98 if (j == cols-1 || n + rows >= cmds->cnt)
166 qsort(main_cmds->names, main_cmds->cnt,
186 qsort(other_cmds->names, other_cmds->cnt,
198 for (i = 0; i < main_cmds->cnt; i++)
201 for (i = 0; i < other_cmds->cnt; i++)
205 if (main_cmds->cnt) {
215 if (other_cmds->cnt) {
229 for (i = 0; i < c->cnt; i++)
262 ALLOC_GROW(cmds->names, cmds->cnt + old->cnt, cmds->alloc);
264 for (i = 0; i < old->cnt; i++)
265 cmds->names[cmds->cnt++] = old->names[i];
267 old->cnt = 0;
286 qsort(main_cmds.names, main_cmds.cnt,
290 if (main_cmds.cnt) {
292 for (i = 0; i < main_cmds.cnt; ++i)
296 qsort(main_cmds.names, main_cmds.cnt,
301 while (n < main_cmds.cnt && best_similarity == main_cmds.names[n]->len)
324 if (main_cmds.cnt && best_similarity < 6) {