libEAVL/sTree.h at EAVL · rsbx/libEAVL · GitHub

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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/*\
***  EAVL_Tree: Embedded AVL Tree
\*/

/*\
*#*  Copyright (c) 2018, Raymond S Brand
*#*  All rights reserved.
*#*
*#*  Redistribution and use in source and binary forms, with or without
*#*  modification, are permitted provided that the following conditions
*#*  are met:
*#*
*#*   * Redistributions of source code must retain the above copyright
*#*     notice, this list of conditions and the following disclaimer.
*#*
*#*   * 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.
*#*
*#*   * Redistributions in source or binary form must carry prominent
*#*     notices of any modifications.
*#*
*#*   * Neither the name of the Raymond S Brand nor the names of its
*#*     contributors may be used to endorse or promote products derived
*#*     from this software without specific prior written permission.
*#*
*#*  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 HOLDER 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.
\*/


#ifndef _STREE_H
#define _STREE_H 1


#include "naming_internal.h"


int PRIVATE(Path_match)(
		EAVLs_context_t*	context
		);


#define NODE_INIT(NODE)							\
	do								\
		{							\
		(NODE)->EAVLnode.child[0] = 0;				\
		(NODE)->EAVLnode.child[1] = 0;				\
		} while (0)

#define NODE_CLEAR_ACTUAL(NODE)						\
	do								\
		{							\
		(NODE)->EAVLnode.child[0] = -1u;			\
		(NODE)->EAVLnode.child[1] = -1u;			\
		} while (0)

#define NODE_FIXUP(NODE, FORCE, FIXUP, CBDATA)				\
	do								\
		{							\
		CB_FIXUP(						\
				(NODE),					\
				GET_CHILD((NODE), 0),			\
				GET_CHILD((NODE), 1),			\
				(FORCE),				\
				(FIXUP),				\
				(CBDATA)				\
				);					\
		} while (0)


#define GET_CHILD(NODE, DIR)		EAVLs_GET_CHILD((NODE), (DIR))
#define GET_BAL(NODE)			EAVLs_GET_BAL((NODE))

#define SET_CHILD(NODE, CHILD, DIR)	EAVL_SET_CHILD(&(NODE)->EAVLnode, (CHILD), (DIR))
#define SET_BAL(NODE, BAL)		EAVL_SET_BAL(&(NODE)->EAVLnode, (BAL))

#define SID(PARENT, CHILD)		((CHILD) == GET_CHILD((PARENT), DIR_RIGHT))

#define INTREE(CONTEXT, RES)						\
	do								\
		{							\
		(RES) = (EAVL_OK == PRIVATE(Path_match)((CONTEXT)));	\
		} while (0)

#define RECENT_OK(CONTEXT)						\
		(							\
		(!(CONTEXT)->recent && !(CONTEXT)->pathlen)		\
		|| ((CONTEXT)->recent && (CONTEXT)->pathlen)		\
		)

#define RECENT_SET(CONTEXT, NODE, POS, NO_TRUNCATE)			\
	do								\
		{							\
		(CONTEXT)->recent = (NODE);				\
		(CONTEXT)->pathlen = (POS);				\
		if (!(NO_TRUNCATE))					\
			{						\
			PATHE_TRUNCATE(					\
					(POS),				\
					(CONTEXT)->cbpathe,		\
					(CONTEXT)->common.cbdata);	\
			}						\
		} while (0)


#endif	/* _STREE_H */