156 #define label_for_each(I, L, P)						\  argument
157 	for ((I).i = 0; ((P) = (L)->vec[(I).i]); ++((I).i))
160 #define label_for_each_cont(I, L, P)					\  argument
161 	for (++((I).i); ((P) = (L)->vec[(I).i]); ++((I).i))
190 #define label_for_each_confined(I, L, P)				\  argument
192 	     ((P) = (L)->vec[(I).i]);					\
195 #define label_for_each_in_merge(I, A, B, P)				\  argument
197 	     ((P) = aa_label_next_in_merge(&(I), (A), (B)));		\
200 #define label_for_each_not_in_set(I, SET, SUB, P)			\  argument
202 	     ((P) = __aa_label_next_not_in_set(&(I), (SET), (SUB)));	\
213 #define label_for_each_in_ns(I, NS, L, P)				\  argument
215 	     ((P) = (L)->vec[(I).i]);					\
218 #define fn_for_each_in_ns(L, P, FN)					\  argument
223 	label_for_each_in_ns(__i, __ns, (L), (P)) {			\
230 #define fn_for_each_XXX(L, P, FN, ...)					\  argument
234 	label_for_each ## __VA_ARGS__(i, (L), (P)) {			\
240 #define fn_for_each(L, P, FN) fn_for_each_XXX(L, P, FN)  argument
241 #define fn_for_each_confined(L, P, FN) fn_for_each_XXX(L, P, FN, _confined)  argument
243 #define fn_for_each2_XXX(L1, L2, P, FN, ...)				\  argument
247 	label_for_each ## __VA_ARGS__(i, (L1), (L2), (P)) {		\
253 #define fn_for_each_in_merge(L1, L2, P, FN)				\  argument
254 	fn_for_each2_XXX((L1), (L2), P, FN, _in_merge)
255 #define fn_for_each_not_in_set(L1, L2, P, FN)				\  argument
256 	fn_for_each2_XXX((L1), (L2), P, FN, _not_in_set)