Searched refs:cur_list (Results 1 – 3 of 3) sorted by relevance
275 if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes) in ulist_next()277 if (uiter->cur_list) { in ulist_next()278 uiter->cur_list = uiter->cur_list->next; in ulist_next()280 uiter->cur_list = ulist->nodes.next; in ulist_next()282 node = list_entry(uiter->cur_list, struct ulist_node, list); in ulist_next()
21 struct list_head *cur_list; /* hint to start search */ member72 #define ULIST_ITER_INIT(uiter) ((uiter)->cur_list = NULL)
191 if (cur_list->endpoint == ENDPOINT_0) in ath6kl_credit_update()194 if (cur_list->cred_to_dist > 0) { in ath6kl_credit_update()195 cur_list->credits += cur_list->cred_to_dist; in ath6kl_credit_update()196 cur_list->cred_to_dist = 0; in ath6kl_credit_update()198 if (cur_list->credits > cur_list->cred_assngd) in ath6kl_credit_update()200 cur_list, in ath6kl_credit_update()201 cur_list->cred_assngd); in ath6kl_credit_update()203 if (cur_list->credits > cur_list->cred_norm) in ath6kl_credit_update()205 cur_list->cred_norm); in ath6kl_credit_update()208 if (cur_list->txq_depth == 0) in ath6kl_credit_update()[all …]
Completed in 9 milliseconds