Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/lib/
Dxarray.c105 return !bitmap_empty(node_marks(node, mark), XA_CHUNK_SIZE); in node_any_mark()
110 bitmap_fill(node_marks(node, mark), XA_CHUNK_SIZE); in node_mark_all()
384 XA_NODE_BUG_ON(node, parent->count > XA_CHUNK_SIZE); in xas_alloc()
433 return (XA_CHUNK_SIZE << xa_to_node(entry)->shift) - 1; in max_index()
444 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_shrink()
487 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_delete_node()
504 XA_NODE_BUG_ON(parent, parent->count > XA_CHUNK_SIZE); in xas_delete_node()
538 while (offset == XA_CHUNK_SIZE) { in xas_free_nodes()
568 while ((max >> shift) >= XA_CHUNK_SIZE) in xas_expand()
721 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.c1597 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()
/kernel/linux/linux-5.10/include/linux/
Dxarray.h1110 #define XA_CHUNK_SIZE (1UL << XA_CHUNK_SHIFT) macro
1111 #define XA_CHUNK_MASK (XA_CHUNK_SIZE - 1)
1113 #define XA_MARK_LONGS DIV_ROUND_UP(XA_CHUNK_SIZE, BITS_PER_LONG)
1133 void __rcu *slots[XA_CHUNK_SIZE];
1179 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry()
1188 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry_locked()
1248 (entry < xa_mk_sibling(XA_CHUNK_SIZE - 1)); in xa_is_sibling()
1658 if (XA_CHUNK_SIZE == BITS_PER_LONG) { in xas_find_chunk()
1659 if (offset < XA_CHUNK_SIZE) { in xas_find_chunk()
1664 return XA_CHUNK_SIZE; in xas_find_chunk()
[all …]