Lines Matching refs:count
186 int count = 0; /* # of slots we will need in prom_list */
217 count++;
219 if ((list = (char **)calloc(count + 1, sizeof (char *))) == NULL) {
225 for (i = 0; i < count; i++) {
255 int count = 0; /* # of slots we will need in prom_list */
294 while (alias_list[count] != NULL) {
295 count++;
299 count++; /* # of slots we will need in prom_list */
301 count++; /* for the null terminator */
304 if ((list = (char **)calloc(count, sizeof (char *))) == NULL) {
305 count = 0;
306 while ((alias_list) && (alias_list[count] != NULL)) {
307 free(alias_list[count]);
308 count++;
315 count = 0;
316 while ((alias_list) && (alias_list[count] != NULL)) {
317 list[count] = alias_list[count];
318 count++;
321 list[count] = prom_path;
340 int ret, len, i, count = 0;
357 count++;
361 for (i = 0; i < count; i++) {
393 return (count);
1322 /* count the number of entries */
1492 int count, i;
1573 * list in dev_list, count the number of entries in the list,
1580 count = 0;
1582 /* count the number of entries in the list */
1584 count++;
1588 (char **)malloc((count + 1) * sizeof (char *)))
1593 count = 0;
1597 dev_name_array[count] = list->name;
1598 count++;
1605 dev_name_array[count] = NULL;
2063 int count;
2109 count = 0;
2113 count++;
2118 count++;
2121 if ((*ret_buf = (char **)malloc((count + 1) * sizeof (char *)))
2129 count = 0;
2132 array[count] = list->name;
2134 count++;
2138 array[count] = list->name;
2140 count++;
2142 array[count] = NULL;