On Sat, May 7, 2016 at 3:05 PM, Nicolai Hähnle <nhaeh...@gmail.com> wrote:
> From: Nicolai Hähnle <nicolai.haeh...@amd.com>
>
> The old iteration casts sentinel nodes (which are mere exec_nodes) into
> whatever type we're looping over, which leads to badness (in fact, gcc's
> undefined behaviour sanitizer crashes while trying to verify that we have
> the correct type at hand).
>
> These modified looping constructs postpone the cast until its correctness
> has been established. The odd two-level loop construct is used to be able
> to define variables of different types, and the __sentinel variable
> ensures that the outer loop is only run once. gcc is able to optimize the
> outer loop away in the cases I have examined.
Thanks for doing this.
If I understand the issue with the current macros correctly, the
"step" expression "(__inst) = (__type *)(__inst)->next" casts a
sentinel node to another type, and (if that's not enough) the
condition "!(__inst)->is_tail_sentinel()" dereferences the pointer
through the other type, which is undefined behavior.
Couldn't we avoid the double loop by changing the condition and step
expressions like this?
#define foreach_in_list(__type, __inst, __list) \
for (__type *(__inst) = (__type *)(__list)->head; \
(__inst) != NULL; \
(__inst) = (__type *)(((__inst)->next)->is_tail_sentinel() ?
NULL : (__inst)->next))
That's perhaps simpler. What do you think?
(At first I thought your implementation suffered from a problem I
noticed with a trick like this -- "break" would only break from the
inner loop -- but I don't think this implementation does since the
outer loop only executes once)
_______________________________________________
mesa-dev mailing list
mesa-dev@lists.freedesktop.org
https://lists.freedesktop.org/mailman/listinfo/mesa-dev
