Lines Matching +defs:val +defs:first
213 * want fast insertion and pop-first, so a linked list will do fine).
214 * If we insert at the head, we get a depth-first search; insertion
215 * at the tail gives breadth-first (?), which seems preferable (?).
292 /* Insert in expansion list (insert at end for breadth-first search */
304 struct netgrnam *first;
306 if ((first = ngt->expand_first) == 0) {
309 if ((ngt->expand_first = first->expand_next) == 0) {
312 return (first->name);
365 char *val;
371 &val, &vallen, &yperr);
395 if ((p = strpbrk(val, "#\n")) != 0) {
398 p = val;
400 /* Parse val into triples and recursive netgroup references */
411 /* Finished processing this particular val */
485 /* End of inner loop over val[] */
486 free(val);
724 char *val;
778 &val, &vallen, &yperr);
780 if (inlist(ia->groups.argc, ia->groups.argv, val)) {
781 free(val);
786 free(val);