109     const int chunk_block_id = bs->rows[r].cells.front().block_id;  in Init()
125       if (row.cells.front().block_id != chunk_block_id) {  in Init()
131       for (int c = 1; c < row.cells.size(); ++c) {  in Init()
132         const Cell& cell = row.cells[c];  in Init()
228     const int e_block_id = bs->rows[chunk.start].cells.front().block_id;  in Eliminate()
310     const int e_block_id = bs->rows[chunk.start].cells.front().block_id;  in BackSubstitute()
329       const Cell& e_cell = row.cells.front();  in BackSubstitute()
338       for (int c = 1; c < row.cells.size(); ++c) {  in BackSubstitute()
339         const int f_block_id = row.cells[c].block_id;  in BackSubstitute()
344             values + row.cells[c].position, row.block.size, f_block_size,  in BackSubstitute()
378   const int e_block_id = bs->rows[chunk.start].cells.front().block_id;  in UpdateRhs()
385     const Cell& e_cell = row.cells.front();  in UpdateRhs()
395     for (int c = 1; c < row.cells.size(); ++c) {  in UpdateRhs()
396       const int block_id = row.cells[c].block_id;  in UpdateRhs()
401           values + row.cells[c].position,  in UpdateRhs()
453     if (row.cells.size() > 1) {  in ChunkDiagonalBlockAndGradient()
458     const Cell& e_cell = row.cells.front();  in ChunkDiagonalBlockAndGradient()
474     for (int c = 1; c < row.cells.size(); ++c) {  in ChunkDiagonalBlockAndGradient()
475       const int f_block_id = row.cells[c].block_id;  in ChunkDiagonalBlockAndGradient()
482           values + row.cells[c].position, row.block.size, f_block_size,  in ChunkDiagonalBlockAndGradient()
562     for (int c = 0; c < row.cells.size(); ++c) {  in NoEBlockRowsUpdate()
563       const int block_id = row.cells[c].block_id;  in NoEBlockRowsUpdate()
567           values + row.cells[c].position, row.block.size, block_size,  in NoEBlockRowsUpdate()
599   for (int i = 0; i < row.cells.size(); ++i) {  in NoEBlockRowOuterProduct()
600     const int block1 = row.cells[i].block_id - num_eliminate_blocks_;  in NoEBlockRowOuterProduct()
603     const int block1_size = bs->cols[row.cells[i].block_id].size;  in NoEBlockRowOuterProduct()
614               values + row.cells[i].position, row.block.size, block1_size,  in NoEBlockRowOuterProduct()
615               values + row.cells[i].position, row.block.size, block1_size,  in NoEBlockRowOuterProduct()
619     for (int j = i + 1; j < row.cells.size(); ++j) {  in NoEBlockRowOuterProduct()
620       const int block2 = row.cells[j].block_id - num_eliminate_blocks_;  in NoEBlockRowOuterProduct()
628         const int block2_size = bs->cols[row.cells[j].block_id].size;  in NoEBlockRowOuterProduct()
632                 values + row.cells[i].position, row.block.size, block1_size,  in NoEBlockRowOuterProduct()
633                 values + row.cells[j].position, row.block.size, block2_size,  in NoEBlockRowOuterProduct()
652   for (int i = 1; i < row.cells.size(); ++i) {  in EBlockRowOuterProduct()
653     const int block1 = row.cells[i].block_id - num_eliminate_blocks_;  in EBlockRowOuterProduct()
656     const int block1_size = bs->cols[row.cells[i].block_id].size;  in EBlockRowOuterProduct()
666           values + row.cells[i].position, row.block.size, block1_size,  in EBlockRowOuterProduct()
667           values + row.cells[i].position, row.block.size, block1_size,  in EBlockRowOuterProduct()
671     for (int j = i + 1; j < row.cells.size(); ++j) {  in EBlockRowOuterProduct()
672       const int block2 = row.cells[j].block_id - num_eliminate_blocks_;  in EBlockRowOuterProduct()
675       const int block2_size = bs->cols[row.cells[j].block_id].size;  in EBlockRowOuterProduct()
685                 values + row.cells[i].position, row.block.size, block1_size,  in EBlockRowOuterProduct()
686                 values + row.cells[j].position, row.block.size, block2_size,  in EBlockRowOuterProduct()