Lines Matching defs:batch_size
160 const int batch_size = Static::sizemap()->num_objects_to_move(cl);
162 const int num_to_move = min<int>(list->max_length(), batch_size);
176 // Increase max length slowly up to batch_size. After that,
177 // increase by batch_size in one shot so that the length is a
178 // multiple of batch_size.
179 if (list->max_length() < batch_size) {
185 int new_length = min<int>(list->max_length() + batch_size,
187 // The list's max_length must always be a multiple of batch_size,
189 // of batch_size.
190 new_length -= new_length % batch_size;
191 ASSERT(new_length % batch_size == 0);
198 const int batch_size = Static::sizemap()->num_objects_to_move(cl);
199 ReleaseToCentralCache(list, cl, batch_size);
206 if (list->max_length() < batch_size) {
209 } else if (list->max_length() > batch_size) {
214 ASSERT(list->max_length() > batch_size);
215 list->set_max_length(list->max_length() - batch_size);
229 int batch_size = Static::sizemap()->num_objects_to_move(cl);
230 while (N > batch_size) {
232 src->PopRange(batch_size, &head, &tail);
233 Static::central_cache()[cl].InsertRange(head, tail, batch_size);
234 N -= batch_size;
259 // batch_size -- if the thread was active enough to get the max_length
260 // above batch_size, it will likely be that active again. If
261 // max_length shinks below batch_size, the thread will have to
265 const int batch_size = Static::sizemap()->num_objects_to_move(cl);
266 if (list->max_length() > batch_size) {
268 max<int>(list->max_length() - batch_size, batch_size));
