Lines Matching full:cells
112 const int chunk_block_id = bs->rows[r].cells.front().block_id;
128 if (row.cells.front().block_id != chunk_block_id) {
134 for (int c = 1; c < row.cells.size(); ++c) {
135 const Cell& cell = row.cells[c];
231 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
313 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
332 const Cell& e_cell = row.cells.front();
341 for (int c = 1; c < row.cells.size(); ++c) {
342 const int f_block_id = row.cells[c].block_id;
347 values + row.cells[c].position, row.block.size, f_block_size,
381 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
388 const Cell& e_cell = row.cells.front();
398 for (int c = 1; c < row.cells.size(); ++c) {
399 const int block_id = row.cells[c].block_id;
404 values + row.cells[c].position,
456 if (row.cells.size() > 1) {
461 const Cell& e_cell = row.cells.front();
477 for (int c = 1; c < row.cells.size(); ++c) {
478 const int f_block_id = row.cells[c].block_id;
485 values + row.cells[c].position, row.block.size, f_block_size,
565 for (int c = 0; c < row.cells.size(); ++c) {
566 const int block_id = row.cells[c].block_id;
570 values + row.cells[c].position, row.block.size, block_size,
602 for (int i = 0; i < row.cells.size(); ++i) {
603 const int block1 = row.cells[i].block_id - num_eliminate_blocks_;
606 const int block1_size = bs->cols[row.cells[i].block_id].size;
617 values + row.cells[i].position, row.block.size, block1_size,
618 values + row.cells[i].position, row.block.size, block1_size,
622 for (int j = i + 1; j < row.cells.size(); ++j) {
623 const int block2 = row.cells[j].block_id - num_eliminate_blocks_;
631 const int block2_size = bs->cols[row.cells[j].block_id].size;
635 values + row.cells[i].position, row.block.size, block1_size,
636 values + row.cells[j].position, row.block.size, block2_size,
655 for (int i = 1; i < row.cells.size(); ++i) {
656 const int block1 = row.cells[i].block_id - num_eliminate_blocks_;
659 const int block1_size = bs->cols[row.cells[i].block_id].size;
669 values + row.cells[i].position, row.block.size, block1_size,
670 values + row.cells[i].position, row.block.size, block1_size,
674 for (int j = i + 1; j < row.cells.size(); ++j) {
675 const int block2 = row.cells[j].block_id - num_eliminate_blocks_;
678 const int block2_size = bs->cols[row.cells[j].block_id].size;
688 values + row.cells[i].position, row.block.size, block1_size,
689 values + row.cells[j].position, row.block.size, block2_size,
