Home
last modified time | relevance | path

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

/Linux-v5.4/include/linux/
Dxarray.h1075 #define XA_CHUNK_SIZE (1UL << XA_CHUNK_SHIFT) macro
1076 #define XA_CHUNK_MASK (XA_CHUNK_SIZE - 1)
1078 #define XA_MARK_LONGS DIV_ROUND_UP(XA_CHUNK_SIZE, BITS_PER_LONG)
1098 void __rcu *slots[XA_CHUNK_SIZE];
1144 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry()
1153 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry_locked()
1213 (entry < xa_mk_sibling(XA_CHUNK_SIZE - 1)); in xa_is_sibling()
1588 if (XA_CHUNK_SIZE == BITS_PER_LONG) { in xas_find_chunk()
1589 if (offset < XA_CHUNK_SIZE) { in xas_find_chunk()
1594 return XA_CHUNK_SIZE; in xas_find_chunk()
[all …]
/Linux-v5.4/lib/
Dxarray.c104 return !bitmap_empty(node_marks(node, mark), XA_CHUNK_SIZE); in node_any_mark()
109 bitmap_fill(node_marks(node, mark), XA_CHUNK_SIZE); in node_mark_all()
380 XA_NODE_BUG_ON(node, parent->count > XA_CHUNK_SIZE); in xas_alloc()
429 return (XA_CHUNK_SIZE << xa_to_node(entry)->shift) - 1; in max_index()
440 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_shrink()
483 XA_NODE_BUG_ON(node, node->count > XA_CHUNK_SIZE); in xas_delete_node()
500 XA_NODE_BUG_ON(parent, parent->count > XA_CHUNK_SIZE); in xas_delete_node()
534 while (offset == XA_CHUNK_SIZE) { in xas_free_nodes()
564 while ((max >> shift) >= XA_CHUNK_SIZE) in xas_expand()
717 xas->xa_index -= XA_CHUNK_SIZE; in xas_create_range()
[all …]
Didr.c570 for (i = 0; i < XA_CHUNK_SIZE; i++) in ida_dump_entry()
Dtest_xarray.c665 for (i = base + 1; i < 2 * XA_CHUNK_SIZE; i++) in check_xa_alloc_1()
667 for (i = base; i < 2 * XA_CHUNK_SIZE; i++) in check_xa_alloc_1()
Dradix-tree.c1609 BUILD_BUG_ON(XA_CHUNK_SIZE > 255); in radix_tree_init()