40     if (i > 0) schedule->AddSuccessor(loop->nodes[i - 1], loop->nodes[i]);  in CreateLoop()
42   schedule->AddSuccessor(loop->nodes[count - 1], loop->nodes[0]);  in CreateLoop()
158   schedule.AddSuccessor(schedule.start(), schedule.start());  in TEST()
169   schedule.AddSuccessor(schedule.start(), schedule.end());  in TEST()
170   schedule.AddSuccessor(schedule.end(), schedule.start());  in TEST()
182   schedule.AddSuccessor(schedule.start(), loop1->header());  in TEST()
193   schedule.AddSuccessor(schedule.start(), loop1->header());  in TEST()
194   schedule.AddSuccessor(loop1->last(), schedule.start());  in TEST()
210   schedule.AddSuccessor(A, B);  in TEST()
211   schedule.AddSuccessor(A, C);  in TEST()
212   schedule.AddSuccessor(B, D);  in TEST()
213   schedule.AddSuccessor(C, D);  in TEST()
234   schedule.AddSuccessor(A, B);  in TEST()
235   schedule.AddSuccessor(B, C);  in TEST()
236   schedule.AddSuccessor(C, B);  in TEST()
237   schedule.AddSuccessor(C, D);  in TEST()
255   schedule.AddSuccessor(A, B);  in TEST()
256   schedule.AddSuccessor(B, C);  in TEST()
257   schedule.AddSuccessor(C, B);  in TEST()
258   schedule.AddSuccessor(B, D);  in TEST()
280     schedule.AddSuccessor(A, B);  in TEST()
281     schedule.AddSuccessor(B, C);  in TEST()
282     schedule.AddSuccessor(C, D);  in TEST()
283     schedule.AddSuccessor(D, E);  in TEST()
284     schedule.AddSuccessor(E, F);  in TEST()
285     schedule.AddSuccessor(F, B);  in TEST()
286     schedule.AddSuccessor(B, G);  in TEST()
289     if (i == 1) schedule.AddSuccessor(B, B);  in TEST()
290     if (i == 2) schedule.AddSuccessor(C, B);  in TEST()
291     if (i == 3) schedule.AddSuccessor(D, B);  in TEST()
292     if (i == 4) schedule.AddSuccessor(E, B);  in TEST()
293     if (i == 5) schedule.AddSuccessor(F, B);  in TEST()
296     if (i == 6) schedule.AddSuccessor(B, G);  in TEST()
297     if (i == 7) schedule.AddSuccessor(C, G);  in TEST()
298     if (i == 8) schedule.AddSuccessor(D, G);  in TEST()
299     if (i == 9) schedule.AddSuccessor(E, G);  in TEST()
300     if (i == 10) schedule.AddSuccessor(F, G);  in TEST()
321   schedule.AddSuccessor(A, B);  in TEST()
322   schedule.AddSuccessor(B, C);  in TEST()
323   schedule.AddSuccessor(C, D);  in TEST()
324   schedule.AddSuccessor(D, C);  in TEST()
325   schedule.AddSuccessor(D, E);  in TEST()
326   schedule.AddSuccessor(E, B);  in TEST()
327   schedule.AddSuccessor(E, F);  in TEST()
352   schedule.AddSuccessor(A, B);  in TEST()
353   schedule.AddSuccessor(B, C);  in TEST()
354   schedule.AddSuccessor(C, D);  in TEST()
355   schedule.AddSuccessor(D, E);  in TEST()
356   schedule.AddSuccessor(E, F);  in TEST()
357   schedule.AddSuccessor(F, G);  in TEST()
358   schedule.AddSuccessor(G, H);  in TEST()
360   schedule.AddSuccessor(E, D);  in TEST()
361   schedule.AddSuccessor(F, C);  in TEST()
362   schedule.AddSuccessor(G, B);  in TEST()
387   schedule.AddSuccessor(A, loop1->header());  in TEST()
388   schedule.AddSuccessor(loop1->header(), loop2->header());  in TEST()
389   schedule.AddSuccessor(loop2->last(), E);  in TEST()
412   schedule.AddSuccessor(A, loop1->header());  in TEST()
413   schedule.AddSuccessor(loop1->header(), S);  in TEST()
414   schedule.AddSuccessor(S, loop2->header());  in TEST()
415   schedule.AddSuccessor(loop2->last(), E);  in TEST()
438       schedule.AddSuccessor(A, loop1->header());  in TEST()
439       schedule.AddSuccessor(loop1->nodes[exit], loop2->header());  in TEST()
440       schedule.AddSuccessor(loop2->nodes[exit], E);  in TEST()
464   schedule.AddSuccessor(A, B);  in TEST()
465   schedule.AddSuccessor(B, loop1->header());  in TEST()
466   schedule.AddSuccessor(loop1->header(), loop2->header());  in TEST()
467   schedule.AddSuccessor(loop2->last(), C);  in TEST()
468   schedule.AddSuccessor(C, E);  in TEST()
469   schedule.AddSuccessor(C, B);  in TEST()
495       schedule.AddSuccessor(A, loop1->header());  in TEST()
496       schedule.AddSuccessor(loop1->last(), E);  in TEST()
498       schedule.AddSuccessor(loop1->nodes[i], loop1->header());  in TEST()
499       schedule.AddSuccessor(loop1->nodes[j], E);  in TEST()
521       schedule.AddSuccessor(A, loop1->header());  in TEST()
522       schedule.AddSuccessor(loop1->last(), E);  in TEST()
524       schedule.AddSuccessor(loop1->nodes[i], loop1->header());  in TEST()
525       schedule.AddSuccessor(loop1->nodes[j], D);  in TEST()
526       schedule.AddSuccessor(D, E);  in TEST()
546     schedule.AddSuccessor(A, loop1->header());  in TEST()
547     schedule.AddSuccessor(loop1->last(), E);  in TEST()
551       schedule.AddSuccessor(loop1->nodes[j], O);  in TEST()
552       schedule.AddSuccessor(O, E);  in TEST()
571     schedule.AddSuccessor(A, loop1->header());  in TEST()
572     schedule.AddSuccessor(loop1->last(), E);  in TEST()
577       schedule.AddSuccessor(loop1->nodes[j], loopN[j]->header());  in TEST()
578       schedule.AddSuccessor(loopN[j]->last(), E);  in TEST()
604   schedule.AddSuccessor(A, B);  in TEST()
605   schedule.AddSuccessor(B, C);  in TEST()
606   schedule.AddSuccessor(B, D);  in TEST()
607   schedule.AddSuccessor(B, E);  in TEST()
608   schedule.AddSuccessor(C, B);  in TEST()
609   schedule.AddSuccessor(D, B);  in TEST()
610   schedule.AddSuccessor(E, B);  in TEST()