Lines Matching defs:reorder
243 * serialization, if present in one of the percpu reorder queues.
246 * the cpu's reorder queue.
252 struct padata_list *reorder;
255 reorder = per_cpu_ptr(pd->reorder_list, cpu);
257 spin_lock(&reorder->lock);
258 if (list_empty(&reorder->list)) {
259 spin_unlock(&reorder->lock);
263 padata = list_entry(reorder->list.next, struct padata_priv, list);
270 spin_unlock(&reorder->lock);
280 spin_unlock(&reorder->lock);
290 struct padata_list *reorder;
294 * the reorder queue the time. Calculating in which percpu reorder
297 * the objects arrive to the reorder queues. So a cpu could wait to
311 * cpu's reorder queue, nothing to do for now.
330 * the reorder queues in the meantime.
332 * Ensure reorder queue is read after pd->lock is dropped so we see
338 reorder = per_cpu_ptr(pd->reorder_list, pd->cpu);
339 if (!list_empty(&reorder->list) && padata_find_next(pd, false))
399 struct padata_list *reorder = per_cpu_ptr(pd->reorder_list, hashed_cpu);
403 spin_lock(&reorder->lock);
405 list_for_each_prev(pos, &reorder->list) {
411 spin_unlock(&reorder->lock);
414 * Ensure the addition to the reorder list is ordered correctly
563 /* Initialize per-CPU reorder lists */