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