Searched refs:top (Results 1 – 7 of 7) sorted by relevance
| /lib/ |
| A D | plist.c | 44 static void plist_check_list(struct list_head *top) in plist_check_list() argument
46 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()
|
| A D | Kconfig.kasan | 109 comparison, as it embeds a tag into the top byte of each pointer.
125 comparison, as it embeds a tag into the top byte of each pointer.
|
| A D | xarray.c | 531 static void xas_free_nodes(struct xa_state *xas, struct xa_node *top) in xas_free_nodes() argument
534 struct xa_node *node = top; in xas_free_nodes()
556 if (node == top) in xas_free_nodes()
|
| A D | test_maple_tree.c | 392 unsigned long top; in check_find() local
402 top = 4398046511104UL; in check_find()
404 top = ULONG_MAX; in check_find()
491 if (val == top) in check_find()
533 else if (val == top) in check_find()
|
| /lib/zstd/compress/ |
| A D | zstd_cwksp.h | 416 void* top; in ZSTD_cwksp_reserve_table() local
427 top = ws->allocStart; in ZSTD_cwksp_reserve_table()
433 assert(end <= top); in ZSTD_cwksp_reserve_table()
434 if (end > top) { in ZSTD_cwksp_reserve_table()
|
| /lib/raid6/ |
| A D | int.uc | 70 vv = (vv << 1) - (vv >> 7); /* Overflow on the top bit is OK */
|
| /lib/zlib_deflate/ |
| A D | deftree.c | 296 #define pqremove(s, tree, top) \ argument
298 top = s->heap[SMALLEST]; \
|
Completed in 730 milliseconds