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

glsl: remove unused stuff from ir_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-28 16:22:25 -04:00 • committed by Marge Bot
parent c1779e8d1f
commit feeb8acf5c
1 changed files with 0 additions and 37 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

37
src/compiler/glsl/ir_list.h
View file

@ -114,13 +114,6 @@ struct ir_exec_node {
#endif
};
static inline void
ir_exec_node_init(struct ir_exec_node *n)
{
n->next = NULL;
n->prev = NULL;
}
static inline const struct ir_exec_node *
ir_exec_node_get_next_const(const struct ir_exec_node *n)
{
@ -336,12 +329,6 @@ struct ir_exec_list {
* Append all nodes from the source list to the end of the target list
*/
void append_list(ir_exec_list *source);
/**
* Prepend all nodes from the source list to the beginning of the target
* list
*/
void prepend_list(ir_exec_list *source);
#endif
};
@ -370,13 +357,6 @@ ir_exec_list_is_empty(const struct ir_exec_list *list)
return list->head_sentinel.next == &list->tail_sentinel;
}
static inline bool
ir_exec_list_is_singular(const struct ir_exec_list *list)
{
return !ir_exec_list_is_empty(list) &&
list->head_sentinel.next->next == &list->tail_sentinel;
}
static inline const struct ir_exec_node *
ir_exec_list_get_head_const(const struct ir_exec_list *list)
{
@ -533,13 +513,6 @@ ir_exec_node_insert_list_after(struct ir_exec_node *n, struct ir_exec_list *afte
ir_exec_list_make_empty(after);
}
static inline void
ir_exec_list_prepend(struct ir_exec_list *list, struct ir_exec_list *source)
{
ir_exec_list_append(source, list);
ir_exec_list_move_nodes_to(source, list);
}
static inline void
ir_exec_node_insert_list_before(struct ir_exec_node *n, struct ir_exec_list *before)
{
@ -666,11 +639,6 @@ inline void ir_exec_node::insert_after(ir_exec_list *after)
ir_exec_node_insert_list_after(this, after);
}
inline void ir_exec_list::prepend_list(ir_exec_list *source)
{
ir_exec_list_prepend(this, source);
}
inline void ir_exec_node::insert_before(ir_exec_list *before)
{
ir_exec_node_insert_list_before(this, before);
@ -772,11 +740,6 @@ inline void ir_exec_node::insert_before(ir_exec_list *before)
node != NULL; \
node = ir_exec_node_data_prev(type, node, field))
#define ir_foreach_list_typed_from_reverse(type, node, field, list, __start) \
for (type * node = ir_exec_node_data_backward(type, (__start), field); \
node != NULL; \
node = ir_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.