blob: 796d2683fcb722a271d1272e455008e604326985 (
plain)
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
|
/*
* Copyright (c) 2006-2025 RT-Thread Development Team
*
* SPDX-License-Identifier: Apache-2.0
*
* Change Logs:
* Date Author Notes
* 2019-10-12 Jesven first version
*/
#ifndef LWP_AVL_H__
#define LWP_AVL_H__
#include <rtthread.h>
#include <string.h>
#include <stdint.h>
#ifdef __cplusplus
extern "C" {
#endif
#define avl_key_t size_t
#define AVL_EMPTY (struct lwp_avl_struct *)0
#define avl_maxheight 32
#define heightof(tree) ((tree) == AVL_EMPTY ? 0 : (tree)->avl_height)
/**
* @brief AVL tree node structure for thread ID (tid) or Process ID (pid) management
*/
struct lwp_avl_struct
{
struct lwp_avl_struct *avl_left; /**< Pointer to left child node */
struct lwp_avl_struct *avl_right; /**< Pointer to right child node */
int avl_height; /**< Height of the node in the AVL tree */
avl_key_t avl_key; /**< Key value used for AVL tree node comparison */
void *data; /**< Pointer to associated data */
};
void lwp_avl_remove(struct lwp_avl_struct * node_to_delete, struct lwp_avl_struct ** ptree);
void lwp_avl_insert (struct lwp_avl_struct * new_node, struct lwp_avl_struct ** ptree);
struct lwp_avl_struct* lwp_avl_find(avl_key_t key, struct lwp_avl_struct* ptree);
int lwp_avl_traversal(struct lwp_avl_struct* ptree, int (*fun)(struct lwp_avl_struct*, void *), void *arg);
struct lwp_avl_struct* lwp_map_find_first(struct lwp_avl_struct* ptree);
#ifdef __cplusplus
}
#endif
#endif /* LWP_AVL_H__ */
|
