exactSIVtest - When we have a pair of subscripts of the form [c1 + a1*i] and [c2 + a2*i], where i is an induction variable, c1 and c2 are loop invariant, and a1 and a2 are constant, we can solve it exactly using an algorithm developed by Banerjee and Wolfe. See Section 2.5.3 in Optimizing Supercompilers for Supercomputers Michael Wolfe MIT Press, 1989 It's slower than the specialized tests (stro
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected