Home
last modified time | relevance | path

Searched refs:XA_CHUNK_SIZE (Results 1 – 5 of 5) sorted by relevance

/Linux-v6.6/lib/
Dxarray.c107 return !bitmap_empty(node_marks(node, mark), XA_CHUNK_SIZE); in node_any_mark()
112 bitmap_fill(node_marks(node, mark), XA_CHUNK_SIZE); in node_mark_all()
385 XA_NODE_BUG_ON(node, parent->count > XA_CHUNK_SIZE); in xas_alloc()
434 return (XA_CHUNK_SIZE << xa_to_node(entry)->shift) - 1; in max_index()
445 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_shrink()
488 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_delete_node()
505 XA_NODE_BUG_ON(parent, parent->count > XA_CHUNK_SIZE); in xas_delete_node()
539 while (offset == XA_CHUNK_SIZE) { in xas_free_nodes()
569 while ((max >> shift) >= XA_CHUNK_SIZE) in xas_expand()
722 xas->xa_index -= XA_CHUNK_SIZE; in xas_create_range()
[all …]
Didr.c575 for (i = 0; i < XA_CHUNK_SIZE; i++) in ida_dump_entry()
Dradix-tree.c1600 BUILD_BUG_ON(XA_CHUNK_SIZE > 255); in radix_tree_init()
Dtest_xarray.c694 for (i = base + 1; i < 2 * XA_CHUNK_SIZE; i++) in check_xa_alloc_1()
696 for (i = base; i < 2 * XA_CHUNK_SIZE; i++) in check_xa_alloc_1()
/Linux-v6.6/include/linux/
Dxarray.h1146 #define XA_CHUNK_SIZE (1UL << XA_CHUNK_SHIFT) macro
1147 #define XA_CHUNK_MASK (XA_CHUNK_SIZE - 1)
1149 #define XA_MARK_LONGS DIV_ROUND_UP(XA_CHUNK_SIZE, BITS_PER_LONG)
1169 void __rcu *slots[XA_CHUNK_SIZE];
1215 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry()
1224 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry_locked()
1284 (entry < xa_mk_sibling(XA_CHUNK_SIZE - 1)); in xa_is_sibling()
1721 if (XA_CHUNK_SIZE == BITS_PER_LONG) { in xas_find_chunk()
1722 if (offset < XA_CHUNK_SIZE) { in xas_find_chunk()
1727 return XA_CHUNK_SIZE; in xas_find_chunk()
[all …]