HomeSort by: relevance | last modified time | path
    Searched refs:R_NEXT (Results 1 - 25 of 28) sorted by relevancy

1 2

  /src/lib/libc/db/recno/
rec_close.c 158 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
171 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
rec_seq.c 58 * flags: R_CURSOR, R_FIRST, R_LAST, R_NEXT, R_PREV.
84 case R_NEXT:
  /src/usr.bin/finger/
finger.c 206 for (seqflag = R_FIRST;; seqflag = R_NEXT) {
288 for (seqflag = R_FIRST;; seqflag = R_NEXT) {
sprint.c 99 for (sflag = R_FIRST;; sflag = R_NEXT) {
lprint.c 93 for (sflag = R_FIRST;; sflag = R_NEXT) {
  /src/usr.sbin/sa/
pdb.c 108 serr = DB_SEQ(saved_pacct_db, &key, &data, R_NEXT);
205 serr = DB_SEQ(pacct_db, &key, &data, R_NEXT);
279 next: rv = DB_SEQ(pacct_db, &key, &data, R_NEXT);
313 rflag ? R_NEXT : R_PREV);
usrdb.c 111 serr = DB_SEQ(saved_usracct_db, &key, &data, R_NEXT);
222 serr = DB_SEQ(usracct_db, &key, &data, R_NEXT);
286 rv = DB_SEQ(usracct_db, &key, &data, R_NEXT);
  /src/usr.sbin/netgroup_mkdb/
netgroup_mkdb.c 437 for (pos = R_FIRST;; pos = R_NEXT)
501 for (pos = R_FIRST;; pos = R_NEXT)
528 for (pos = R_FIRST;; pos = R_NEXT)
561 for (pos = R_FIRST;; pos = R_NEXT)
593 for (pos = R_FIRST;; pos = R_NEXT)
644 for (pos = R_FIRST;; pos = R_NEXT)
  /src/lib/libc/db/hash/
ndbmdatum.c 116 status = (db->seq)(db, &dbtretkey, &dbtretdata, R_NEXT);
hash.c 731 if (flag && flag != R_FIRST && flag != R_NEXT) {
774 if (flag == R_NEXT || flag == 0) {
  /src/external/bsd/pkg_install/dist/lib/
pkgdb.c 204 for (type = R_FIRST ; (*pkgdbp->seq)(pkgdbp, &key, &val, type) == 0 ; type = R_NEXT) {
259 for (ret = 1, type = R_FIRST; (*pkgdbp->seq)(pkgdbp, &key, &data, type) == 0 ; type = R_NEXT) {
  /src/lib/libc/db/btree/
bt_seq.c 76 * flags: R_CURSOR, R_FIRST, R_LAST, R_NEXT, R_PREV, R_RNEXT, R_RPREV.
102 case R_NEXT:
147 * flags: R_CURSOR, R_FIRST, R_LAST, R_NEXT, R_PREV, R_RNEXT, R_RPREV.
179 case R_NEXT:
237 * flags: R_NEXT, R_PREV, R_RNEXT, R_RPREV
267 * doing seq(..., R_NEXT)/put(..., 0) pairs, i.e. the put deletes
278 * that seq(..., R_NEXT)/put(..., R_CURSOR) pairs are going to exhibit
310 case R_NEXT: /* Next record. */
  /src/include/
db.h 66 #define R_NEXT 7 /* seq */
83 * non-recursive traversal by using R_NEXT or R_PREV can also make the
  /src/share/examples/refuse/dbfs/
dbfs.c 106 for ( ; (ret = (*db->seq)(db, &k, &v, flag)) == 0 ; flag = R_NEXT) {
  /src/share/examples/refuse/id3fs/
id3fs.c 172 for (flag = R_FIRST ; (*db->seq)(db, &k, &v, flag) == 0 ; flag = R_NEXT) {
  /src/external/bsd/blocklist/bin/
state.c 210 first = first ? R_FIRST : R_NEXT;
  /src/tests/lib/libc/db/
h_db.c 505 nflags = recurse ? R_RNEXT : R_NEXT;
572 if (!strcmp(s, "R_NEXT")) return R_NEXT;
590 case R_NEXT: return "R_NEXT";
t_db_hash_seq.c 219 first = first ? R_FIRST : R_NEXT;
  /src/crypto/external/bsd/heimdal/dist/lib/hdb/
db.c 143 return DB_seq(context, db, flags, entry, R_NEXT);
173 return DB_seq(context, db, flags, entry, R_NEXT);
  /src/usr.sbin/ypserv/common/
ypdb.c 243 status = (db->seq)(db, &nk, &nd, R_NEXT);
  /src/crypto/external/bsd/heimdal/dist/lib/roken/
ndbm_wrap.c 136 #define DB_NEXT R_NEXT
  /src/usr.bin/db/
db.c 419 while ((rv = db->seq(db, &key, &val, R_NEXT)) == 0)
529 seqflags = R_NEXT;
  /src/usr.sbin/rpc.statd/
statd.c 354 switch ((*db->seq)(db, &key, &data, R_NEXT)) {
  /src/usr.sbin/lastlogin/
lastlogin.c 379 } while ((i = (*db->seq)(db, &key, &data, R_NEXT)) == 0);
  /src/external/bsd/libbind/dist/irs/
lcl_sv.c 305 pvt->dbf = R_NEXT;

Completed in 46 milliseconds

1 2