Lines Matching refs:Chunk
32 // Chunk::start ?
109 // the way also compute the amount of space each chunk will need
117 chunks_.push_back(Chunk());
118 Chunk& chunk = chunks_.back();
119 chunk.size = 0;
120 chunk.start = r;
124 // Add to the chunk until the first block in the row is
125 // different than the one in the first row for the chunk.
126 while (r + chunk.size < num_row_blocks) {
127 const CompressedRow& row = bs->rows[r + chunk.size];
137 &(chunk.buffer_layout), cell.block_id, buffer_size)) {
143 ++chunk.size;
146 CHECK_GT(chunk.size, 0);
147 r += chunk.size;
149 const Chunk& chunk = chunks_.back();
151 uneliminated_row_begins_ = chunk.start + chunk.size;
208 // Eliminate y blocks one chunk at a time. For each chunk,x3
230 const Chunk& chunk = chunks_[i];
231 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
255 // for each Chunk. The computation is broken down into a number of
261 // in this chunk (g) and add the outer product of the f_blocks to
264 chunk, A, b, chunk.start, &ete, g.get(), buffer, lhs);
277 // For the current chunk compute and update the rhs of the reduced
290 UpdateRhs(chunk, A, b, chunk.start, inverse_ete_g.get(), rhs);
293 ChunkOuterProduct(bs, inverse_ete, buffer, chunk.buffer_layout, lhs);
312 const Chunk& chunk = chunks_[i];
313 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
330 for (int j = 0; j < chunk.size; ++j) {
331 const CompressedRow& row = bs->rows[chunk.start + j];
339 (b + bs->rows[chunk.start + j].block.position, row.block.size);
374 UpdateRhs(const Chunk& chunk,
381 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
386 for (int j = 0; j < chunk.size; ++j) {
412 // Given a Chunk - set of rows with the same e_block, e.g. in the
413 // following Chunk with two rows.
435 const Chunk& chunk,
448 // Iterate over the rows in this chunk, for each row, compute the
453 for (int j = 0; j < chunk.size; ++j) {
476 // f_blocks for each row in the chunk.
481 buffer + FindOrDie(chunk.buffer_layout, f_block_id);
