1 /* { dg-options "-O2 -floop-block" } */
8 static int sort_and_split (foo **Root, foo **Finite, long first)
12 for (i = 0; i < first; i++)
13 cd->Node[i] = Finite[first+i];
15 sort_and_split(Root, Finite, first);
20 void Build_foo(foo **Root, foo **Finite, foo **Infinite)
23 while (sort_and_split(Root, Finite, low) == 0);