525   unsigned level = 1;  in computeSymbolicIntegerLexMin()  local
534   while (level > 0) {  in computeSymbolicIntegerLexMin()
535     assert(level >= stack.size());  in computeSymbolicIntegerLexMin()
536     if (level > stack.size()) {  in computeSymbolicIntegerLexMin()
539         --level;  in computeSymbolicIntegerLexMin()
545         --level;  in computeSymbolicIntegerLexMin()
596         ++level;  in computeSymbolicIntegerLexMin()
605           --level;  in computeSymbolicIntegerLexMin()
615       --level;  in computeSymbolicIntegerLexMin()
619     if (level == stack.size()) {  in computeSymbolicIntegerLexMin()
639         --level;  in computeSymbolicIntegerLexMin()
1790 void Simplex::reduceBasis(Matrix &basis, unsigned level) {  in reduceBasis()  argument
1793   if (level == basis.getNumRows() - 1)  in reduceBasis()
1820     assert(i < level + dual.size() && "dual_i is not known!");  in reduceBasis()
1822     int64_t u = floorDiv(dual[i - level], dualDenom);  in reduceBasis()
1824     if (dual[i - level] % dualDenom != 0) {  in reduceBasis()
1865     assert(i + 1 - level < width.size() && "width_{i+1} wasn't saved");  in reduceBasis()
1870            width[i + 1 - level]);  in reduceBasis()
1871     return width[i + 1 - level];  in reduceBasis()
1876   unsigned i = level;  in reduceBasis()
1878     if (i >= level + width.size()) {  in reduceBasis()
1883       assert((i == 0 || i - 1 < level + width.size()) &&  in reduceBasis()
1889       assert(i == level && "This case should only occur when i == level");  in reduceBasis()
1894     if (i >= level + dual.size()) {  in reduceBasis()
1895       assert(i + 1 >= level + width.size() &&  in reduceBasis()
1906     if (widthICandidate < epsilon * width[i - level]) {  in reduceBasis()
1908       width[i - level] = widthICandidate;  in reduceBasis()
1911       width.resize(i - level + 1);  in reduceBasis()
1912       if (i == level) {  in reduceBasis()
1964   unsigned level = 0;  in findIntegerSample()  local
1975   while (level != -1u) {  in findIntegerSample()
1976     if (level == basis.getNumRows()) {  in findIntegerSample()
1981       level--;  in findIntegerSample()
1985     if (level >= upperBoundStack.size()) {  in findIntegerSample()
1991           llvm::to_vector<8>(basis.getRow(level));  in findIntegerSample()
2006         level--;  in findIntegerSample()
2020         reduceBasis(basis, level);  in findIntegerSample()
2021         basisCoeffs = llvm::to_vector<8>(basis.getRow(level));  in findIntegerSample()
2035     assert((snapshotStack.size() - 1 == level &&  in findIntegerSample()
2036             nextValueStack.size() - 1 == level &&  in findIntegerSample()
2037             upperBoundStack.size() - 1 == level) &&  in findIntegerSample()
2052       level--;  in findIntegerSample()
2057     SmallVector<int64_t, 8> basisCoeffs(basis.getRow(level).begin(),  in findIntegerSample()
2058                                         basis.getRow(level).end());  in findIntegerSample()
2061     level++;  in findIntegerSample()