@based/db 0.0.64 → 0.0.66

package/dist/lib/linux_x86_64/include/selva/find.h

@@ -1,47 +0,0 @@
-/*
- * Copyright (c) 2024 SAULX
- * SPDX-License-Identifier: MIT
- */
-#pragma once
-
-#include "selva/_export.h"
-#include "selva/types.h"
-#include "selva/traverse.h"
-
-struct SelvaFindParam {
-    SelvaTraversalNodeCallback node_cb;
-    void *node_arg;
-
-    /**
-     * Traverse field selector.
-     */
-    const struct FindFields {
-        uint8_t len;
-        struct {
-            node_type_t type;
-            field_t field;
-        } __packed data[];
-    } __packed *fields;
-
-    /**
-     * Skip the first n nodes in the traversal.
-     * This happens before filtering.
-     */
-    ssize_t skip;
-
-    /**
-     * Skip the first n - 1 results.
-     * This skipping is executed on the final result set.
-     * 0 for no offset.
-     */
-    ssize_t offset;
-
-    /**
-     * Limit the number of results.
-     * -1 for no limit (inf).
-     */
-    ssize_t limit;
-};
-
-SELVA_EXPORT
-int selva_find(struct SelvaDb *db, struct SelvaNode *node, const struct SelvaFindParam *param);

package/dist/lib/linux_x86_64/include/selva/queue_r.h

@@ -1,190 +0,0 @@
-/**
- *******************************************************************************
- * @file    queue_r.h
- * @author  Olli Vanhoja
- * @brief   Thread-safe queue
- * @section LICENSE
- * Copyright (c) 2020-2021, 2023, 2025 SAULX
- * Copyright (c) 2013, 2015, 2016 Olli Vanhoja <olli.vanhoja@cs.helsinki.fi>
- * Copyright (c) 2012, 2013 Ninjaware Oy,
- *                          Olli Vanhoja <olli.vanhoja@ninjaware.fi>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- * 1. Redistributions of source code must retain the above copyright notice,
- *    this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright notice,
- *    this list of conditions and the following disclaimer in the documentation
- *    and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- *
- * SPDX-License-Identifier: BSD-2-Clause
- *******************************************************************************
- */
-
-/**
- * @addtogroup queue_r
- * @{
- */
-
-#pragma once
-
-#include <stddef.h>
-#include "selva/_export.h"
-
-/**
- * Queue control block.
- */
-typedef struct queue_cb {
-    void * data;    /*!< Pointer to the data array used for queue. */
-    size_t b_size;  /*!< Block size in bytes. */
-    size_t a_len;   /*!< Array length. */
-    size_t m_write; /*!< Write index. */
-    size_t m_read;  /*!< Read index. */
-} queue_cb_t;
-
-#define QUEUE_INITIALIZER(data_array, block_size, array_size)   \
-    (struct queue_cb){                                          \
-        .data = (data_array),                                   \
-        .b_size = (block_size),                                 \
-        .a_len = (array_size / block_size),                     \
-        .m_write = 0,                                           \
-        .m_read = 0,                                            \
-    }
-
-/**
- * Create a new queue control block.
- * Initializes a new queue control block and returns it as a value.
- * @param data_array an array where the actual queue data is stored.
- * @param block_size the size of single data block/struct/data type in
- *                   data_array in bytes.
- * @param array_size the size of the data_array in bytes.
- * @return a new queue_cb_t queue control block structure.
- */
-SELVA_EXPORT
-queue_cb_t queue_create(void * data_array, size_t block_size,
-                        size_t array_size)
-    __attribute__((pure, access(read_only, 1, 3)));
-
-/**
- * Push an element to the queue.
- * @param cb is a pointer to the queue control block.
- * @param element the new element to be copied.
- * @return 0 if queue is already full; otherwise operation was succeed.
- * @note element is always copied to the queue, so it is safe to remove the
- * original data after a push.
- */
-SELVA_EXPORT
-int queue_push(queue_cb_t * cb, const void * element)
-    __attribute__((access(read_write, 1)));
-
-/**
- * Allocate an element from the queue.
- * @param cb is a pointer to the queue control block.
- * @return A pointer to the element in the queue.
- */
-SELVA_EXPORT
-void * queue_alloc_get(queue_cb_t * cb)
-    __attribute__((access(read_write, 1)));
-
-/**
- * Commit previous allocation from the queue.
- * @note queue_push() should not be called between calls to queue_alloc_get()
- *       and queue_alloc_commit().
- */
-SELVA_EXPORT
-void queue_alloc_commit(queue_cb_t * cb)
-    __attribute__((access(read_write, 1)));
-
-/**
- * Pop an element from the queue.
- * @param cb is a pointer to the queue control block.
- * @param element is the location where element is copied to from the queue.
- * @return 0 if queue is empty; otherwise operation was succeed.
- */
-SELVA_EXPORT
-int queue_pop(queue_cb_t * cb, void * element)
-    __attribute__((access(read_write, 1)));
-
-/**
- * Peek an element from the queue.
- * @param cb is a pointer to the queue control block.
- * @param element is the location where element is copied to from the queue.
- * @return 0 if queue is empty; otherwise operation was succeed.
- */
-SELVA_EXPORT
-int queue_peek(queue_cb_t * cb, void ** element)
-    __attribute__((access(read_only, 1), access(write_only, 2)));
-
-/**
- * Skip n number of elements in the queue.
- * @param cb is a pointer to the queue control block.
- * @return Returns the number of elements skipped.
- */
-SELVA_EXPORT
-int queue_skip(queue_cb_t * cb, size_t n)
-    __attribute__((access(read_write, 1)));
-
-/**
- * Clear the queue.
- * This operation is considered safe when committed from the push end thread.
- * @param cb is a pointer to the queue control block.
- */
-SELVA_EXPORT
-void queue_clear_from_push_end(queue_cb_t * cb)
-    __attribute__((access(read_write, 1)));
-
-/**
- * Clear the queue.
- * This operation is considered safe when committed from the pop end thread.
- * @param cb is a pointer to the queue control block.
- */
-SELVA_EXPORT
-void queue_clear_from_pop_end(queue_cb_t * cb)
-    __attribute__((access(read_write, 1)));
-
-/**
- * Check if the queue is empty.
- * @param cb is a pointer to the queue control block.
- * @return 0 if the queue is not empty.
- */
-SELVA_EXPORT
-int queue_isempty(const queue_cb_t * cb)
-    __attribute__((access(read_only, 1)));
-
-/**
- * Check if the queue is full.
- * @param cb is a pointer to the queue control block.
- * @return 0 if the queue is not full.
- */
-SELVA_EXPORT
-int queue_isfull(const queue_cb_t * cb)
-    __attribute__((access(read_only, 1)));
-
-/**
- * Seek queue.
- * @param cb is a pointer to the queue control block.
- * @param i index.
- * @param[in] element returned element.
- * @return 0 if failed; otherwise succeed.
- */
-SELVA_EXPORT
-int seek(const queue_cb_t * cb, size_t i, void * element)
-    __attribute__((access(read_only, 1), access(write_only, 3)));
-
-/**
- * @}
- */

package/dist/lib/linux_x86_64/include/selva/traverse.h

@@ -1,65 +0,0 @@
-/*
- * Copyright (c) 2024 SAULX
- * SPDX-License-Identifier: MIT
- */
-#pragma once
-
-#include "selva/_export.h"
-
-struct SelvaNode;
-struct SelvaDb;
-
-/**
- * Traversal metadata for child/adjacent nodes.
- * Note that SelvaTraversalOrder expects this to be copyable.
- */
-struct SelvaTraversalMetadata {
-    const struct SelvaFields *edge_data; /*!< Edge metadata. */
-    long long depth;
-};
-
-#define SELVA_TRAVERSAL_ABORT (-2)
-#define SELVA_TRAVERSAL_STOP (-1)
-
-/**
- * Called for each node found during a traversal.
- * @param node a pointer to the node.
- * @param arg a pointer to node_arg give in SelvaTraversalCallback structure.
- */
-typedef int (*SelvaTraversalNodeCallback)(
-        struct SelvaDb *db,
-        const struct SelvaTraversalMetadata *metadata,
-        struct SelvaNode *node,
-        void *arg);
-
-/**
- * Callback descriptor used for traversals.
- */
-struct SelvaTraversalParam {
-    /**
-     * Called for each orphan head in the hierarchy.
-     */
-    SelvaTraversalNodeCallback head_cb;
-    void *head_arg;
-
-    /**
-     * Called for each node in the hierarchy.
-     */
-    SelvaTraversalNodeCallback node_cb;
-    void *node_arg;
-
-    /**
-     * Called for each child of current node.
-     */
-    SelvaTraversalNodeCallback child_cb;
-    void *child_arg;
-};
-
-SELVA_EXPORT
-int selva_traverse_field_bfs(
-        struct SelvaDb *db,
-        struct SelvaNode *head,
-        const struct SelvaTraversalParam *cb);
-
-SELVA_EXPORT
-int selva_traverse_type(struct SelvaDb *db, struct SelvaTypeEntry *te, SelvaTraversalNodeCallback node_cb, void *node_arg);