/* We lock twice, not very efficient. We could keep last key & tinfo cached. */ enum TDB_ERROR tdb_nextkey(struct tdb_context *tdb, struct tdb_data *key) { struct traverse_info tinfo; struct hash_info h; struct tdb_used_record rec; if (tdb->flags & TDB_VERSION1) { struct tdb_data last_key = *key; tdb->last_error = TDB_SUCCESS; *key = tdb1_nextkey(tdb, last_key); free(last_key.dptr); /* TDB1 didn't set error for last key. */ if (!key->dptr && tdb->last_error == TDB_SUCCESS) { tdb->last_error = TDB_ERR_NOEXIST; } return tdb->last_error; } tinfo.prev = find_and_lock(tdb, *key, F_RDLCK, &h, &rec, &tinfo); free(key->dptr); if (TDB_OFF_IS_ERR(tinfo.prev)) { return tdb->last_error = TDB_OFF_TO_ERR(tinfo.prev); } tdb_unlock_hashes(tdb, h.hlock_start, h.hlock_range, F_RDLCK); return tdb->last_error = next_in_hash(tdb, &tinfo, key, NULL); }
/* We lock twice, not very efficient. We could keep last key & tinfo cached. */ TDB_DATA tdb_nextkey(struct tdb_context *tdb, TDB_DATA key) { struct traverse_info tinfo; struct hash_info h; struct tdb_used_record rec; tinfo.prev = find_and_lock(tdb, key, F_RDLCK, &h, &rec, &tinfo); if (unlikely(tinfo.prev == TDB_OFF_ERR)) return tdb_null; tdb_unlock_hashes(tdb, h.hlock_start, h.hlock_range, F_RDLCK); switch (next_in_hash(tdb, F_RDLCK, &tinfo, &key, NULL)) { case 1: return key; case 0: tdb->ecode = TDB_SUCCESS; /* Fall thru... */ default: return tdb_null; } }
static int64_t traverse(struct tdb_context *tdb, int ltype, tdb_traverse_func fn, void *p) { int ret; struct traverse_info tinfo; struct tdb_data k, d; int64_t count = 0; for (ret = first_in_hash(tdb, ltype, &tinfo, &k, &d.dsize); ret == 1; ret = next_in_hash(tdb, ltype, &tinfo, &k, &d.dsize)) { d.dptr = k.dptr + k.dsize; count++; if (fn && fn(tdb, k, d, p)) break; } if (ret < 0) return -1; return count; }
int64_t tdb_traverse_(struct tdb_context *tdb, int (*fn)(struct tdb_context *, TDB_DATA, TDB_DATA, void *), void *p) { enum TDB_ERROR ecode; struct traverse_info tinfo; struct tdb_data k, d; int64_t count = 0; if (tdb->flags & TDB_VERSION1) { count = tdb1_traverse(tdb, fn, p); if (count == -1) return TDB_ERR_TO_OFF(tdb->last_error); return count; } k.dptr = NULL; for (ecode = first_in_hash(tdb, &tinfo, &k, &d.dsize); ecode == TDB_SUCCESS; ecode = next_in_hash(tdb, &tinfo, &k, &d.dsize)) { d.dptr = k.dptr + k.dsize; count++; if (fn && fn(tdb, k, d, p)) { free(k.dptr); tdb->last_error = TDB_SUCCESS; return count; } free(k.dptr); } if (ecode != TDB_ERR_NOEXIST) { return TDB_ERR_TO_OFF(tdb->last_error = ecode); } tdb->last_error = TDB_SUCCESS; return count; }