/usr/include/libkres/cdb_api.h is in libkres-dev 2.1.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 | /* Copyright (C) 2016-2017 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#pragma once
#include <libknot/db/db.h>
/* Cache options. */
struct kr_cdb_opts {
const char *path; /*!< Cache URI path. */
size_t maxsize; /*!< Suggested cache size in bytes. */
};
/*! Cache database API.
* This is a simplified version of generic DB API from libknot,
* that is tailored to caching purposes.
*/
struct kr_cdb_api {
const char *name;
/* Context operations */
int (*open)(knot_db_t **db, struct kr_cdb_opts *opts, knot_mm_t *mm);
void (*close)(knot_db_t *db);
int (*count)(knot_db_t *db);
int (*clear)(knot_db_t *db);
/** Run after a row of operations to release transaction/lock if needed. */
int (*sync)(knot_db_t *db);
/* Data access */
int (*read)(knot_db_t *db, const knot_db_val_t *key, knot_db_val_t *val,
int maxcount);
int (*write)(knot_db_t *db, const knot_db_val_t *key, knot_db_val_t *val,
int maxcount);
int (*remove)(knot_db_t *db, knot_db_val_t *key, int maxcount);
/* Specialised operations */
int (*match)(knot_db_t *db, knot_db_val_t *key, knot_db_val_t *val, int maxcount);
int (*prune)(knot_db_t *db, int maxcount);
/** Less-or-equal search (lexicographic ordering).
* On successful return, key->data and val->data point to DB-owned data.
* return: 0 for equality, > 0 for less, < 0 kr_error */
int (*read_leq)(knot_db_t *db, knot_db_val_t *key, knot_db_val_t *val);
};
|