glsl2: Use new foreach_list_safe abstraction.

diff --git a/src/glsl/ir_hv_accept.cpp b/src/glsl/ir_hv_accept.cpp
index 1a88c5943945a7e68990279e49bcd1d9307c5a40..46bc5b17fe3f25f6145fb999f25eb2c1f8d58947 100644 (file)
--- a/src/glsl/ir_hv_accept.cpp
+++ b/src/glsl/ir_hv_accept.cpp
@@ -32,20 +32,16 @@
 /**
  * Process a list of nodes using a hierarchical vistor
  *
- * \warning
  * This function will operate correctly if a node being processed is removed
- * from list.  However, if nodes are added to the list after the node being
- * processed, some of the added noded may not be processed.
+ * from the list.  If nodes are inserted before the current node, they will be
+ * processed next.
  */
 ir_visitor_status
 visit_list_elements(ir_hierarchical_visitor *v, exec_list *l)
 {
-   exec_node *next;
    ir_instruction *prev_base_ir = v->base_ir;
 
-   for (exec_node *n = l->head; n->next != NULL; n = next) {
-      next = n->next;
-
+   foreach_list_safe(n, l) {
       ir_instruction *const ir = (ir_instruction *) n;
       v->base_ir = ir;
       ir_visitor_status s = ir->accept(v);