Lines Matching defs:batch_size
157 const int batch_size = Static::sizemap()->num_objects_to_move(cl);
159 const int num_to_move = min<int>(list->max_length(), batch_size);
170 // Increase max length slowly up to batch_size. After that,
171 // increase by batch_size in one shot so that the length is a
172 // multiple of batch_size.
173 if (list->max_length() < batch_size) {
179 int new_length = min<int>(list->max_length() + batch_size,
181 // The list's max_length must always be a multiple of batch_size,
183 // of batch_size.
184 new_length -= new_length % batch_size;
185 ASSERT(new_length % batch_size == 0);
192 const int batch_size = Static::sizemap()->num_objects_to_move(cl);
193 ReleaseToCentralCache(list, cl, batch_size);
200 if (list->max_length() < batch_size) {
203 } else if (list->max_length() > batch_size) {
208 ASSERT(list->max_length() > batch_size);
209 list->set_max_length(list->max_length() - batch_size);
223 int batch_size = Static::sizemap()->num_objects_to_move(cl);
224 while (N > batch_size) {
226 src->PopRange(batch_size, &head, &tail);
227 Static::central_cache()[cl].InsertRange(head, tail, batch_size);
228 N -= batch_size;
253 // batch_size -- if the thread was active enough to get the max_length
254 // above batch_size, it will likely be that active again. If
255 // max_length shinks below batch_size, the thread will have to
259 const int batch_size = Static::sizemap()->num_objects_to_move(cl);
260 if (list->max_length() > batch_size) {
262 max<int>(list->max_length() - batch_size, batch_size));
