Home
last modified time | relevance | path

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

/linux/lib/
H A 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()
388 XA_NODE_BUG_ON(node, parent->count > XA_CHUNK_SIZE); in xas_alloc()
437 return (XA_CHUNK_SIZE << xa_to_node(entry)->shift) - 1; in max_index()
453 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_shrink()
496 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_delete_node()
513 XA_NODE_BUG_ON(parent, parent->count > XA_CHUNK_SIZE); in xas_delete_node()
547 while (offset == XA_CHUNK_SIZE) { in xas_free_nodes()
577 while ((max >> shift) >= XA_CHUNK_SIZE) in xas_expand()
730 xas->xa_index -= XA_CHUNK_SIZE; in xas_create_range()
[all...]
H A Dradix-tree.c1600 BUILD_BUG_ON(XA_CHUNK_SIZE > 255); in radix_tree_init()
H A Dtest_xarray.c927 for (i = base + 1; i < 2 * XA_CHUNK_SIZE; i++) in check_xa_alloc_1()
929 for (i = base; i < 2 * XA_CHUNK_SIZE; i++) in check_xa_alloc_1()
/linux/include/linux/
H A Dxarray.h1156 #define XA_CHUNK_SIZE (1UL << XA_CHUNK_SHIFT) macro
1157 #define XA_CHUNK_MASK (XA_CHUNK_SIZE - 1)
1159 #define XA_MARK_LONGS BITS_TO_LONGS(XA_CHUNK_SIZE)
1179 void __rcu *slots[XA_CHUNK_SIZE];
1225 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry()
1234 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry_locked()
1294 (entry < xa_mk_sibling(XA_CHUNK_SIZE - 1)); in xa_is_sibling()
1750 if (XA_CHUNK_SIZE == BITS_PER_LONG) { in xas_find_chunk()
1751 if (offset < XA_CHUNK_SIZE) { in xas_find_chunk()
1756 return XA_CHUNK_SIZE; in xas_find_chunk()
[all …]