Searched refs:top (Results 1 – 4 of 4) sorted by relevance
45 static void plist_check_list(struct list_head *top) in plist_check_list() argument47 struct list_head *prev = top, *next = top->next; in plist_check_list()49 plist_check_prev_next(top, prev, next); in plist_check_list()50 while (next != top) { in plist_check_list()53 plist_check_prev_next(top, prev, next); in plist_check_list()
229 p = idp->top; in sub_alloc()299 p = idp->top; in idr_get_empty_slot()328 for (new = p; p && p != idp->top; new = p) { in idr_get_empty_slot()346 rcu_assign_pointer(idp->top, p); in idr_get_empty_slot()510 struct idr_layer *p = idp->top; in sub_remove()517 *++paa = &idp->top; in sub_remove()564 if (idp->top && idp->top->count == 1 && (idp->layers > 1) && in idr_remove()565 idp->top->ary[0]) { in idr_remove()572 to_free = idp->top; in idr_remove()573 p = idp->top->ary[0]; in idr_remove()[all …]
77 vv = (vv << 1) - (vv >> 7); /* Overflow on the top bit is OK */
350 #define pqremove(s, tree, top) \ argument352 top = s->heap[SMALLEST]; \