Lines Matching defs:next
449 first = (conf->inactive_list + hash)->next;
1056 struct list_head *first, *next = NULL;
1064 first = conf->pending_list.next;
1075 first = data->sibling.next;
1076 next = data->sibling.next;
1087 if (next != &conf->pending_list)
1088 conf->next_pending_data = list_entry(next,
2587 nsh = list_entry(newstripes.next, struct stripe_head, lru);
2665 nsh = list_entry(newstripes.next, struct stripe_head, lru);
4928 struct stripe_head *sh, *next;
4932 list_for_each_entry_safe(sh, next, &head_sh->batch_list, batch_list) {
5172 * next operation.
5390 struct list_head *l = conf->delayed_list.next;
5411 struct stripe_head *sh = list_entry(head.next, struct stripe_head, lru);
5606 /* __get_priority_stripe - get the next stripe to process
5655 sh = list_entry(handle_list->next, typeof(*sh), lru);
5660 if (conf->hold_list.next == conf->last_hold)
5663 conf->last_hold = conf->hold_list.next;
5725 if (cb->list.next && !list_empty(&cb->list)) {
5769 if (cb->list.next == NULL) {
6120 * Bio crosses to the next data disk. Check whether it's in the same
6485 sh = list_entry(stripes.next, struct stripe_head, lru);
6789 * handler, so that they will not have to wait for our next wakeup.
7828 * next is at or after the stripe we would read from next.