Lines Matching defs:count
166 int count = 0; /* # of slots we will need in prom_list */
197 count++;
199 if ((list = (char **)calloc(count + 1, sizeof (char *))) == NULL) {
205 for (i = 0; i < count; i++) {
235 int count = 0; /* # of slots we will need in prom_list */
274 while (alias_list[count] != NULL) {
275 count++;
279 count++; /* # of slots we will need in prom_list */
281 count++; /* for the null terminator */
284 if ((list = (char **)calloc(count, sizeof (char *))) == NULL) {
285 count = 0;
286 while ((alias_list) && (alias_list[count] != NULL)) {
287 free(alias_list[count]);
288 count++;
295 count = 0;
296 while ((alias_list) && (alias_list[count] != NULL)) {
297 list[count] = alias_list[count];
298 count++;
301 list[count] = prom_path;
320 int ret, len, i, count = 0;
337 count++;
341 for (i = 0; i < count; i++) {
373 return (count);
894 /* count the number of entries */
1063 int count, i;
1144 * list in dev_list, count the number of entries in the list,
1151 count = 0;
1153 /* count the number of entries in the list */
1155 count++;
1159 (char **)malloc((count + 1) * sizeof (char *)))
1164 count = 0;
1168 dev_name_array[count] = list->name;
1169 count++;
1176 dev_name_array[count] = NULL;
1634 int count;
1680 count = 0;
1684 count++;
1689 count++;
1692 if ((*ret_buf = (char **)malloc((count + 1) * sizeof (char *)))
1700 count = 0;
1703 array[count] = list->name;
1705 count++;
1709 array[count] = list->name;
1711 count++;
1713 array[count] = NULL;