Searched refs:top (Results 1 – 3 of 3) sorted by relevance
43 static void plist_check_list(struct list_head *top) in plist_check_list() argument45 struct list_head *prev = top, *next = top->next; in plist_check_list()47 plist_check_prev_next(top, prev, next); in plist_check_list()48 while (next != top) { in plist_check_list()51 plist_check_prev_next(top, prev, next); in plist_check_list()
142 p = idp->top; in sub_alloc()209 p = idp->top; in idr_get_empty_slot()237 for (new = p; p && p != idp->top; new = p) { in idr_get_empty_slot()253 rcu_assign_pointer(idp->top, p); in idr_get_empty_slot()353 struct idr_layer *p = idp->top; in sub_remove()360 *++paa = &idp->top; in sub_remove()402 if (idp->top && idp->top->count == 1 && (idp->layers > 1) && in idr_remove()403 idp->top->ary[0]) { in idr_remove()410 to_free = idp->top; in idr_remove()411 p = idp->top->ary[0]; in idr_remove()[all …]
350 #define pqremove(s, tree, top) \ argument352 top = s->heap[SMALLEST]; \