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

nir: remove unused stuff from list.h

Browse source 
Reviewed-by: Timothy Arceri <tarceri@itsqueeze.com>
Acked-by: Pierre-Eric Pelloux-Prayer <pierre-eric.pelloux-prayer@amd.com>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/36425>
This commit is contained in:
Marek Olšák 2025-07-27 20:10:34 -04:00 • committed by Marge Bot
parent 1e5e187191
commit c1779e8d1f
1 changed files with 0 additions and 110 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

110
src/compiler/list.h
View file

@ -119,16 +119,6 @@ exec_node_insert_node_before(struct exec_node *n, struct exec_node *before)
n->prev = before;
}
static inline void
exec_node_replace_with(struct exec_node *n, struct exec_node *replacement)
{
replacement->prev = n->prev;
replacement->next = n->next;
n->prev->next = replacement;
n->next->prev = replacement;
}
static inline bool
exec_node_is_tail_sentinel(const struct exec_node *n)
{
@ -211,42 +201,18 @@ exec_list_get_head(struct exec_list *list)
return !exec_list_is_empty(list) ? list->head_sentinel.next : NULL;
}
static inline const struct exec_node *
exec_list_get_head_raw_const(const struct exec_list *list)
{
return list->head_sentinel.next;
}
static inline struct exec_node *
exec_list_get_head_raw(struct exec_list *list)
{
return list->head_sentinel.next;
}
static inline const struct exec_node *
exec_list_get_tail_const(const struct exec_list *list)
{
return !exec_list_is_empty(list) ? list->tail_sentinel.prev : NULL;
}
static inline struct exec_node *
exec_list_get_tail(struct exec_list *list)
{
return !exec_list_is_empty(list) ? list->tail_sentinel.prev : NULL;
}
static inline const struct exec_node *
exec_list_get_tail_raw_const(const struct exec_list *list)
{
return list->tail_sentinel.prev;
}
static inline struct exec_node *
exec_list_get_tail_raw(struct exec_list *list)
{
return list->tail_sentinel.prev;
}
static inline unsigned
exec_list_length(const struct exec_list *list)
{
@ -280,17 +246,6 @@ exec_list_push_tail(struct exec_list *list, struct exec_node *n)
list->tail_sentinel.prev = n;
}
static inline void
exec_list_push_degenerate_list_at_head(struct exec_list *list, struct exec_node *n)
{
assert(n->prev->next == n);
n->prev->next = list->head_sentinel.next;
list->head_sentinel.next->prev = n->prev;
n->prev = &list->head_sentinel;
list->head_sentinel.next = n;
}
static inline struct exec_node *
exec_list_pop_head(struct exec_list *list)
{
@ -355,28 +310,6 @@ exec_node_insert_list_after(struct exec_node *n, struct exec_list *after)
exec_list_make_empty(after);
}
static inline void
exec_list_prepend(struct exec_list *list, struct exec_list *source)
{
exec_list_append(source, list);
exec_list_move_nodes_to(source, list);
}
static inline void
exec_node_insert_list_before(struct exec_node *n, struct exec_list *before)
{
if (exec_list_is_empty(before))
return;
before->tail_sentinel.prev->next = n;
before->head_sentinel.next->prev = n->prev;
n->prev->next = before->head_sentinel.next;
n->prev = before->tail_sentinel.prev;
exec_list_make_empty(before);
}
static inline void
exec_list_validate(const struct exec_list *list)
{
@ -397,44 +330,6 @@ exec_list_validate(const struct exec_list *list)
}
}
#define exec_node_typed_forward(__node, __type) \
(!exec_node_is_tail_sentinel(__node) ? (__type) (__node) : NULL)
#define exec_node_typed_backward(__node, __type) \
(!exec_node_is_head_sentinel(__node) ? (__type) (__node) : NULL)
#define foreach_in_list(__type, __inst, __list) \
for (__type *__inst = exec_node_typed_forward((__list)->head_sentinel.next, __type *); \
(__inst) != NULL; \
(__inst) = exec_node_typed_forward((__inst)->next, __type *))
#define foreach_in_list_reverse(__type, __inst, __list) \
for (__type *__inst = exec_node_typed_backward((__list)->tail_sentinel.prev, __type *); \
(__inst) != NULL; \
(__inst) = exec_node_typed_backward((__inst)->prev, __type *))
/**
* This version is safe even if the current node is removed.
*/
#define foreach_in_list_safe(__type, __node, __list) \
for (__type *__node = exec_node_typed_forward((__list)->head_sentinel.next, __type *), \
*__next = (__node) ? exec_node_typed_forward((__list)->head_sentinel.next->next, __type *) : NULL; \
(__node) != NULL; \
(__node) = __next, __next = __next ? exec_node_typed_forward(__next->next, __type *) : NULL)
#define foreach_in_list_reverse_safe(__type, __node, __list) \
for (__type *__node = exec_node_typed_backward((__list)->tail_sentinel.prev, __type *), \
*__prev = (__node) ? exec_node_typed_backward((__list)->tail_sentinel.prev->prev, __type *) : NULL; \
(__node) != NULL; \
(__node) = __prev, __prev = __prev ? exec_node_typed_backward(__prev->prev, __type *) : NULL)
#define foreach_in_list_use_after(__type, __inst, __list) \
__type *__inst; \
for ((__inst) = exec_node_typed_forward((__list)->head_sentinel.next, __type *); \
(__inst) != NULL; \
(__inst) = exec_node_typed_forward((__inst)->next, __type *))
/**
* Iterate through two lists at once. Stops at the end of the shorter list.
*
@ -492,11 +387,6 @@ exec_list_validate(const struct exec_list *list)
node != NULL; \
node = exec_node_data_prev(type, node, field))
#define foreach_list_typed_from_reverse(type, node, field, list, __start) \
for (type * node = exec_node_data_backward(type, (__start), 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.