Searched refs:top (Results 1 – 5 of 5) sorted by relevance
44 static void plist_check_list(struct list_head *top) in plist_check_list() argument46 struct list_head *prev = top, *next = top->next; in plist_check_list()48 plist_check_prev_next(top, prev, next); in plist_check_list()49 while (next != top) { in plist_check_list()52 plist_check_prev_next(top, prev, next); in plist_check_list()
74 casting and comparison, as it embeds tags into the top byte of each
519 static void xas_free_nodes(struct xa_state *xas, struct xa_node *top) in xas_free_nodes() argument522 struct xa_node *node = top; in xas_free_nodes()544 if (node == top) in xas_free_nodes()
77 vv = (vv << 1) - (vv >> 7); /* Overflow on the top bit is OK */
350 #define pqremove(s, tree, top) \ argument352 top = s->heap[SMALLEST]; \