list_base.h

/*
 * This file is part of the openHiTLS project.
 *
 * openHiTLS is licensed under the Mulan PSL v2.
 * You can use this software according to the terms and conditions of the Mulan PSL v2.
 * You may obtain a copy of Mulan PSL v2 at:
 *
 *     http://license.coscl.org.cn/MulanPSL2
 *
 * THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
 * EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
 * MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
 * See the Mulan PSL v2 for more details.
 */

 
#ifndef LIST_BASE_H
#define LIST_BASE_H
 
#include "hitls_build.h"
#ifdef HITLS_BSL_HASH
 
#include <stdint.h>
#include <stddef.h>
#include <stdbool.h>
#include "bsl_hash_list.h"
 
#ifdef __cplusplus
extern "C" {
#endif

struct ListTagRawListNode {
    struct ListTagRawListNode *next;     /* points to the next node */
    struct ListTagRawListNode *prev;     /* points to the previous node */
};

typedef struct ListTagRawListNode ListRawNode;

typedef struct {
    ListRawNode  head;       /* list node */
    /* Node memory release function, which needs to release nodes and other private resources on node */
    ListFreeFunc freeFunc;
} RawList;

struct BslListSt {
    RawList rawList; /* Linked list header */
    ListDupFreeFuncPair dataFunc; /* used to store data */
};

struct BslListNodeSt {
    ListRawNode rawNode;
    uintptr_t userdata;
};

int32_t ListRawInit(RawList *list, ListFreeFunc freeFunc);

int32_t ListRawClear(RawList *list);

int32_t ListRawDeinit(RawList *list);

bool ListRawEmpty(const RawList *list);

size_t ListRawSize(const RawList *list);

int32_t ListRawPushFront(RawList *list, ListRawNode *node);

int32_t ListRawPushBack(RawList *list, ListRawNode *node);

int32_t ListRawInsert(const ListRawNode *curNode, ListRawNode *newNode);

int32_t ListRawPopFront(RawList *list);

int32_t ListRawPopBack(RawList *list);

int32_t ListRawRemove(RawList *list, ListRawNode *node);

ListRawNode *ListRawFront(const RawList *list);

ListRawNode *ListRawBack(const RawList *list);

ListRawNode *ListRawGetPrev(const RawList *list, const ListRawNode *node);

ListRawNode *ListRawGetNext(const RawList *list, const ListRawNode *node);

ListRawNode *ListRawFindNode(const RawList *list, ListMatchFunc nodeMatchFunc, uintptr_t data);

#define BSL_CONTAINER_OF(ptr, type, member) \
    ((type *)((uintptr_t)(ptr) - (uintptr_t)(&(((type *)0)->member))))
 
#ifdef __cplusplus
}
#endif
 
#endif /* HITLS_BSL_HASH */
 
#endif // LIST_BASE_H