btree-store 0.1.5

A persistent, embedded key-value storage engine in Rust featuring a Copy-On-Write (COW) B-Tree, ACID compliance, and crash safety with multi-bucket support
Documentation
// build library
// linux or macos: RUSTFLAGS="-C panic=abort" cargo build --features ffi --release
// windows powershell: $env:RUSTFLAGS="-C panic=abort"; cargo build --features ffi --release
//
// build example
// linux: cc -I./include examples/ffi.c -L./target/release -lbtree_store -o ffi
// macos: cc -I./include examples/ffi.c -L./target/release -lbtree_store -o ffi
// windows msvc: cl /I include examples\\ffi.c /Fe:ffi.exe /link /LIBPATH:target\\release btree_store.dll.lib
//
// run
// linux: LD_LIBRARY_PATH=./target/release ./ffi
// macos: DYLD_LIBRARY_PATH=./target/release ./ffi
// windows: .\\ffi.exe

#include "btree_store.h"
#include <stdio.h>
#include <string.h>

static void print_last_error(const char *label) {
    const char *msg = NULL;
    size_t len = 0;
    int code = btree_last_error(&msg, &len);
    if (code == 0) {
        return;
    }
    if (msg && len > 0) {
        fprintf(stderr, "%s: %.*s (%d)\n", label, (int)len, msg, code);
    } else {
        fprintf(stderr, "%s: error %d\n", label, code);
    }
}

static int exec_put(Txn *txn, void *ctx) {
    (void)ctx;
    const char *key = "hello";
    const char *val = "world";
    return txn_put(txn, (const uint8_t *)key, strlen(key), (const uint8_t *)val, strlen(val));
}

static int view_get(Txn *txn, void *ctx) {
    (void)ctx;
    uint8_t *out = NULL;
    size_t out_len = 0;
    int rc = txn_get(txn, (const uint8_t *)"hello", 5, &out, &out_len);
    if (rc != 0) {
        return rc;
    }
    if (out && out_len > 0) {
        printf("value: %.*s\n", (int)out_len, out);
        btree_free(out, out_len);
    }
    return 0;
}

static int exec_del(Txn *txn, void *ctx) {
    (void)ctx;
    return txn_del(txn, (const uint8_t *)"hello", 5);
}

static int view_missing(Txn *txn, void *ctx) {
    (void)ctx;
    uint8_t *out = NULL;
    size_t out_len = 0;
    int rc = txn_get(txn, (const uint8_t *)"hello", 5, &out, &out_len);
    if (rc == BTREE_ERR_NOT_FOUND) {
        print_last_error("expected not found");
        btree_last_error_clear();
        return 0;
    }
    if (rc != 0) {
        return rc;
    }
    if (out && out_len > 0) {
        printf("unexpected value: %.*s\n", (int)out_len, out);
        btree_free(out, out_len);
    }
    return 0;
}

static int multi_ops(MultiTxn *mtxn, void *ctx) {
    (void)ctx;
    Txn *t1 = NULL;
    Txn *t2 = NULL;
    int rc = mtxn_bucket(mtxn, "bucket1", &t1);
    if (rc != 0) {
        return rc;
    }
    rc = txn_put(t1, (const uint8_t *)"k1", 2, (const uint8_t *)"v1", 2);
    if (rc != 0) {
        return rc;
    }
    rc = mtxn_bucket(mtxn, "bucket2", &t2);
    if (rc != 0) {
        return rc;
    }
    return txn_put(t2, (const uint8_t *)"k2", 2, (const uint8_t *)"v2", 2);
}

int main(void) {
    BTree *db = NULL;
    int rc = btree_open("ffi_example.db", &db);
    if (rc != 0) {
        print_last_error("btree_open");
        return 1;
    }

    rc = btree_exec(db, "bucket1", exec_put, NULL);
    if (rc != 0) {
        print_last_error("btree_exec");
        btree_close(db);
        return 1;
    }

    rc = btree_view(db, "bucket1", view_get, NULL);
    if (rc != 0) {
        print_last_error("btree_view");
        btree_close(db);
        return 1;
    }

    rc = btree_exec_multi(db, multi_ops, NULL);
    if (rc != 0) {
        print_last_error("btree_exec_multi");
        btree_close(db);
        return 1;
    }

    rc = btree_exec(db, "bucket1", exec_del, NULL);
    if (rc != 0) {
        print_last_error("btree_exec delete");
        btree_close(db);
        return 1;
    }

    rc = btree_view(db, "bucket1", view_missing, NULL);
    if (rc != 0) {
        print_last_error("btree_view missing");
        btree_close(db);
        return 1;
    }

    btree_close(db);
    return 0;
}