Blender  V3.3
BLI_linklist_stack.h
Go to the documentation of this file.
1 /* SPDX-License-Identifier: GPL-2.0-or-later
2  * Copyright 2001-2002 NaN Holding BV. All rights reserved. */
3 
4 #pragma once
5 
18 /* -------------------------------------------------------------------- */
24 #define BLI_LINKSTACK_DECLARE(var, type) \
25  LinkNode *var; \
26  BLI_mempool *var##_pool_; \
27  type var##_type_
28 
29 #define BLI_LINKSTACK_INIT(var) \
30  { \
31  var = NULL; \
32  var##_pool_ = BLI_mempool_create(sizeof(LinkNode), 0, 64, BLI_MEMPOOL_NOP); \
33  } \
34  (void)0
35 
36 #define BLI_LINKSTACK_SIZE(var) BLI_mempool_len(var##_pool_)
37 
38 /* check for typeof() */
39 #ifdef __GNUC__
40 # define BLI_LINKSTACK_PUSH(var, ptr) \
41  (CHECK_TYPE_INLINE(ptr, typeof(var##_type_)), \
42  BLI_linklist_prepend_pool(&(var), ptr, var##_pool_))
43 # define BLI_LINKSTACK_POP(var) \
44  (var ? (typeof(var##_type_))BLI_linklist_pop_pool(&(var), var##_pool_) : NULL)
45 # define BLI_LINKSTACK_POP_DEFAULT(var, r) \
46  (var ? (typeof(var##_type_))BLI_linklist_pop_pool(&(var), var##_pool_) : r)
47 #else /* non gcc */
48 # define BLI_LINKSTACK_PUSH(var, ptr) (BLI_linklist_prepend_pool(&(var), ptr, var##_pool_))
49 # define BLI_LINKSTACK_POP(var) (var ? BLI_linklist_pop_pool(&(var), var##_pool_) : NULL)
50 # define BLI_LINKSTACK_POP_DEFAULT(var, r) (var ? BLI_linklist_pop_pool(&(var), var##_pool_) : r)
51 #endif /* gcc check */
52 
53 #define BLI_LINKSTACK_SWAP(var_a, var_b) \
54  { \
55  CHECK_TYPE_PAIR(var_a##_type_, var_b##_type_); \
56  SWAP(LinkNode *, var_a, var_b); \
57  SWAP(BLI_mempool *, var_a##_pool_, var_b##_pool_); \
58  } \
59  (void)0
60 
61 #define BLI_LINKSTACK_FREE(var) \
62  { \
63  BLI_mempool_destroy(var##_pool_); \
64  var##_pool_ = NULL; \
65  (void)var##_pool_; \
66  var = NULL; \
67  (void)var; \
68  (void)&(var##_type_); \
69  } \
70  (void)0
71 
72 #include "BLI_linklist.h"
73 #include "BLI_mempool.h"
74 
77 /* -------------------------------------------------------------------- */
86 #ifdef __GNUC__
87 # define _BLI_SMALLSTACK_CAST(var) (typeof(_##var##_type))
88 #else
89 # define _BLI_SMALLSTACK_CAST(var)
90 #endif
91 
92 #define _BLI_SMALLSTACK_FAKEUSER(var) (void)(&(_##var##_type))
93 
94 #define BLI_SMALLSTACK_DECLARE(var, type) \
95  LinkNode *_##var##_stack = NULL, *_##var##_free = NULL, *_##var##_temp = NULL; \
96  type _##var##_type
97 
98 #define BLI_SMALLSTACK_PUSH(var, data) \
99  { \
100  CHECK_TYPE_PAIR(data, _##var##_type); \
101  if (_##var##_free) { \
102  _##var##_temp = _##var##_free; \
103  _##var##_free = _##var##_free->next; \
104  } \
105  else { \
106  _##var##_temp = (LinkNode *)alloca(sizeof(LinkNode)); \
107  } \
108  _##var##_temp->next = _##var##_stack; \
109  _##var##_temp->link = data; \
110  _##var##_stack = _##var##_temp; \
111  _BLI_SMALLSTACK_FAKEUSER(var); \
112  } \
113  (void)0
114 
115 /* internal use, no null check */
116 #define _BLI_SMALLSTACK_DEL_EX(var_src, var_dst) \
117  (void)(_BLI_SMALLSTACK_FAKEUSER(var_src), \
118  _BLI_SMALLSTACK_FAKEUSER(var_dst), \
119  (_##var_src##_temp = _##var_src##_stack->next), \
120  (_##var_src##_stack->next = _##var_dst##_free), \
121  (_##var_dst##_free = _##var_src##_stack), \
122  (_##var_src##_stack = _##var_src##_temp))
123 
124 #define _BLI_SMALLSTACK_DEL(var) _BLI_SMALLSTACK_DEL_EX(var, var)
125 
126 /* check for typeof() */
127 #define BLI_SMALLSTACK_POP(var) \
128  (_BLI_SMALLSTACK_CAST(var)( \
129  (_##var##_stack) ? (_BLI_SMALLSTACK_DEL(var), (_##var##_free->link)) : NULL))
130 
131 /* support to put the free-node into another stack */
132 #define BLI_SMALLSTACK_POP_EX(var_src, var_dst) \
133  (_BLI_SMALLSTACK_CAST(var_src)( \
134  (_##var_src##_stack) ? \
135  (_BLI_SMALLSTACK_DEL_EX(var_src, var_dst), (_##var_dst##_free->link)) : \
136  NULL))
137 
138 #define BLI_SMALLSTACK_PEEK(var) \
139  (_BLI_SMALLSTACK_CAST(var)((_##var##_stack) ? _##var##_stack->link : NULL))
140 
141 #define BLI_SMALLSTACK_IS_EMPTY(var) ((_BLI_SMALLSTACK_CAST(var) _##var##_stack) == NULL)
142 
143 /* fill in a lookup table */
144 #define BLI_SMALLSTACK_AS_TABLE(var, data) \
145  { \
146  LinkNode *_##var##_iter; \
147  unsigned int i; \
148  for (_##var##_iter = _##var##_stack, i = 0; _##var##_iter; \
149  _##var##_iter = _##var##_iter->next, i++) { \
150  (data)[i] = _BLI_SMALLSTACK_CAST(var)(_##var##_iter->link); \
151  } \
152  } \
153  ((void)0)
154 
155 /* loop over stack members last-added-first */
156 #define BLI_SMALLSTACK_ITER_BEGIN(var, item) \
157  { \
158  LinkNode *_##var##_iter; \
159  for (_##var##_iter = _##var##_stack; _##var##_iter; _##var##_iter = _##var##_iter->next) { \
160  item = _BLI_SMALLSTACK_CAST(var)(_##var##_iter->link);
161 
162 #define BLI_SMALLSTACK_ITER_END \
163  } \
164  } \
165  (void)0
166 
167 #define BLI_SMALLSTACK_SWAP(var_a, var_b) \
168  { \
169  CHECK_TYPE_PAIR(_##var_a##_type, _##var_b##_type); \
170  SWAP(LinkNode *, _##var_a##_stack, _##var_b##_stack); \
171  SWAP(LinkNode *, _##var_a##_free, _##var_b##_free); \
172  } \
173  (void)0
174