Explorar el Código

mesa: Add and use foreach_list_typed_safe.

Acked-by: Ian Romanick <ian.d.romanick@intel.com>
tags/10.3-branchpoint
Matt Turner hace 11 años
padre
commit
d6bb8bb7ce
Se han modificado 2 ficheros con 10 adiciones y 3 borrados
  1. 9
    0
      src/glsl/list.h
  2. 1
    3
      src/mesa/drivers/dri/i965/intel_mipmap_tree.c

+ 9
- 0
src/glsl/list.h Ver fichero

@@ -630,4 +630,13 @@ inline void exec_node::insert_before(exec_list *before)
(__node)->__field.next != NULL; \
(__node) = exec_node_data(__type, (__node)->__field.next, __field))

#define foreach_list_typed_safe(__type, __node, __field, __list) \
for (__type * __node = \
exec_node_data(__type, (__list)->head, __field), \
* __next = \
exec_node_data(__type, (__node)->__field.next, __field); \
__next != NULL; \
__node = __next, __next = \
exec_node_data(__type, (__next)->__field.next, __field))

#endif /* LIST_CONTAINER_H */

+ 1
- 3
src/mesa/drivers/dri/i965/intel_mipmap_tree.c Ver fichero

@@ -1506,9 +1506,7 @@ intel_miptree_all_slices_resolve(struct brw_context *brw,
{
bool did_resolve = false;

foreach_list_safe(node, &mt->hiz_map) {
struct intel_resolve_map *map = (struct intel_resolve_map *)node;

foreach_list_typed_safe(struct intel_resolve_map, map, link, &mt->hiz_map) {
if (map->need != need)
continue;


Cargando…
Cancelar
Guardar