fdo-mirrors/mesa
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/mesa/mesa.git synced 2026-05-05 09:38:07 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

glsl/list: add and use helpers in foreach_list_typed macros

Browse source 
This reduces noise when reading them.

Signed-off-by: Rhys Perry <pendingchaos02@gmail.com>
Reviewed-by: Ian Romanick <ian.d.romanick@intel.com>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/32225>
This commit is contained in:
Rhys Perry 2024-11-13 16:07:21 +00:00 • committed by Marge Bot
parent 17045b9465
commit 02e353a066
1 changed files with 38 additions and 30 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

68
src/compiler/glsl/list.h
View file

@ -737,55 +737,63 @@ inline void exec_node::insert_before(exec_list *before)
#define exec_node_data_backward(type, node, field) \
(!exec_node_is_head_sentinel(node) ? exec_node_data(type, node, field) : NULL)
#define exec_node_data_next(type, node, field) \
exec_node_data_forward(type, (node)->field.next, field)
#define exec_node_data_prev(type, node, field) \
exec_node_data_backward(type, (node)->field.prev, field)
#define exec_node_data_head(type, list, field) \
exec_node_data_forward(type, (list)->head_sentinel.next, field)
#define exec_node_data_tail(type, list, field) \
exec_node_data_backward(type, (list)->tail_sentinel.prev, field)
/**
* Iterate over the list from head to tail. Removal is safe for all nodes except the current
* iteration's.
*/
#define foreach_list_typed(__type, __node, __field, __list) \
for (__type * __node = \
exec_node_data_forward(__type, (__list)->head_sentinel.next, __field); \
(__node) != NULL; \
(__node) = exec_node_data_forward(__type, (__node)->__field.next, __field))
#define foreach_list_typed(__type, __node, __field, __list) \
for (__type * __node = exec_node_data_head(__type, __list, __field); \
(__node) != NULL; \
(__node) = exec_node_data_next(__type, __node, __field))
#define foreach_list_typed_from(__type, __node, __field, __list, __start) \
for (__type * __node = exec_node_data_forward(__type, (__start), __field); \
(__node) != NULL; \
(__node) = exec_node_data_forward(__type, (__node)->__field.next, __field))
#define foreach_list_typed_from(__type, __node, __field, __list, __start) \
for (__type * __node = exec_node_data_forward(__type, (__start), __field); \
(__node) != NULL; \
(__node) = exec_node_data_next(__type, __node, __field))
/**
* Iterate over the list from tail to head. Removal is safe for all nodes except the current
* iteration's.
*/
#define foreach_list_typed_reverse(__type, __node, __field, __list) \
for (__type * __node = \
exec_node_data_backward(__type, (__list)->tail_sentinel.prev, __field); \
(__node) != NULL; \
(__node) = exec_node_data_backward(__type, (__node)->__field.prev, __field))
#define foreach_list_typed_reverse(__type, __node, __field, __list) \
for (__type * __node = exec_node_data_tail(__type, __list, __field); \
(__node) != NULL; \
(__node) = exec_node_data_prev(__type, __node, __field))
/**
* Iterate over the list from head to tail. Removal is safe for all nodes except the next
* iteration's. If the next iteration's node is removed and not inserted again, this loop exits.
*/
#define foreach_list_typed_safe(__type, __node, __field, __list) \
for (__type * __node = \
exec_node_data_forward(__type, (__list)->head_sentinel.next, __field), \
* __next = (__node) ? \
exec_node_data_forward(__type, (__node)->__field.next, __field) : NULL; \
(__node) != NULL; \
(__node) = __next, __next = (__next && (__next)->__field.next) ? \
exec_node_data_forward(__type, (__next)->__field.next, __field) : NULL)
#define foreach_list_typed_safe(__type, __node, __field, __list) \
for (__type * __node = exec_node_data_head(__type, __list, __field), \
* __next = (__node) ? \
exec_node_data_next(__type, __node, __field) : NULL; \
(__node) != NULL; \
(__node) = __next, __next = (__next && (__next)->__field.next) ? \
exec_node_data_next(__type, __next, __field) : NULL)
/**
* Iterate over the list from tail to head. Removal is safe for all nodes except the next
* iteration's. If the next iteration's node is removed and not inserted again, this loop exits.
*/
#define foreach_list_typed_reverse_safe(__type, __node, __field, __list) \
for (__type * __node = \
exec_node_data_backward(__type, (__list)->tail_sentinel.prev, __field), \
* __prev = (__node) ? \
exec_node_data_backward(__type, (__node)->__field.prev, __field) : NULL; \
(__node) != NULL; \
(__node) = __prev, __prev = (__prev && (__prev)->__field.prev) ? \
exec_node_data_backward(__type, (__prev)->__field.prev, __field) : NULL)
#define foreach_list_typed_reverse_safe(__type, __node, __field, __list) \
for (__type * __node = exec_node_data_tail(__type, __list, __field), \
* __prev = (__node) ? \
exec_node_data_prev(__type, __node, __field) : NULL; \
(__node) != NULL; \
(__node) = __prev, __prev = (__prev && (__prev)->__field.prev) ? \
exec_node_data_prev(__type, __prev, __field) : NULL)
#endif /* LIST_CONTAINER_H */