AlexIndustrial/mesa
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

glsl/list: remove underscores in foreach_list_typed macros

Browse Source 
I'm not sure why they're here, but I find them to be annoying to read.

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:08:40 +00:00
committed by Marge Bot
parent 66df291513
commit 6c07c0b862
1 changed files with 26 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/compiler/glsl/list.h
+26 -26
View File
@@ -753,47 +753,47 @@ inline void exec_node::insert_before(exec_list *before)
* 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_head(__type, __list, __field); \
__node != NULL; \
__node = exec_node_data_next(__type, __node, __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_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_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_tail(__type, __list, __field); \
__node != NULL; \
__node = exec_node_data_prev(__type, __node, __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_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)
#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_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)
#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 */