Lines Matching full:eliminate
38 for (int i = 1; i < size; i++) flags[i] = true; // Can eliminate.40 if (flags[i]) { // Can eliminate.43 flags[k - 1] = false; // Can't eliminate yet due to (k+i) may overflow.92 // eliminate this bounds check.718 // Can't eliminate the bound check since not every i++ is