HomeSort by: relevance | last modified time | path
    Searched refs:cgetnext (Results 1 - 10 of 10) sorted by relevancy

  /src/usr.sbin/lpr/lpc/
cmds.c 102 while (cgetnext(&bp, printcapdb) > 0) {
225 while (cgetnext(&bp, printcapdb) > 0) {
362 while (cgetnext(&bp, printcapdb) > 0) {
433 while (cgetnext(&bp, printcapdb) > 0) {
498 while (cgetnext(&bp, printcapdb) > 0) {
612 while (cgetnext(&bp, printcapdb) > 0) {
649 while (cgetnext(&bp, printcapdb) > 0) {
705 while (cgetnext(&bp, printcapdb) > 0) {
801 while (cgetnext(&bp, printcapdb) > 0) {
1024 while (cgetnext(&bp, printcapdb) > 0)
    [all...]
  /src/usr.sbin/lpr/lpq/
lpq.c 132 while (cgetnext(&buf, printcapdb) > 0) {
  /src/lib/libc/gen/
getcap.c 74 __weak_alias(cgetnext,_cgetnext)
751 return cgetnext(buf, db_array);
772 * Cgetnext() gets either the first or next entry in the logical database
778 cgetnext(char **bp, const char * const *db_array) function in typeref:typename:int
Makefile.inc 128 cgetcap.3 cgetfirst.3 cgetcap.3 cgetmatch.3 cgetcap.3 cgetnext.3 \
  /src/usr.bin/cap_mkdb/
cap_mkdb.c 185 for (reccnt = 0, bplen = 0; (st = cgetnext(&bp, ifiles)) > 0; free(bp)){
291 * It seems to match number of records should a cgetnext() be used, though.
  /src/include/
stdlib.h 286 int cgetnext(char **, const char * const *);
  /src/tools/compat/
compat_defs.h 1094 #define cgetnext __nbcompat_cgetnext macro
1105 int cgetnext(char **, const char * const *);
  /src/usr.sbin/lpr/lpd/
lpd.c 560 while (cgetnext(&buf, printcapdb) > 0) {
  /src/usr.bin/getent/
getent.c 502 switch (error = (first ? cgetfirst : cgetnext)(&buf, db_array)) {
  /src/lib/libc/include/
namespace.h 254 #define cgetnext _cgetnext macro

Completed in 20 milliseconds