Home
last modified time | relevance | path

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

/linux/lib/
A Dxarray.c538 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()
1021 for (i = 0; i < XA_CHUNK_SIZE; i++) { in xas_split_alloc()
1073 child->count = XA_CHUNK_SIZE; in xas_split()
1075 XA_CHUNK_SIZE : 0; in xas_split()
1125 while (++offset < XA_CHUNK_SIZE) { in xas_pause()
1198 while (xas->xa_offset == XA_CHUNK_SIZE) { in __xas_next()
1357 if (offset == XA_CHUNK_SIZE) in xas_find_marked()
1772 if (slot >= XA_CHUNK_SIZE) in xa_get_order()
[all …]
A Didr.c574 for (i = 0; i < XA_CHUNK_SIZE; i++) in ida_dump_entry()
A Dradix-tree.c1599 BUILD_BUG_ON(XA_CHUNK_SIZE > 255); in radix_tree_init()
A 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/include/linux/
A Dxarray.h1112 #define XA_CHUNK_SIZE (1UL << XA_CHUNK_SHIFT) macro
1113 #define XA_CHUNK_MASK (XA_CHUNK_SIZE - 1)
1135 void __rcu *slots[XA_CHUNK_SIZE];
1181 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry()
1190 XA_NODE_BUG_ON(node, offset >= XA_CHUNK_SIZE); in xa_entry_locked()
1250 (entry < xa_mk_sibling(XA_CHUNK_SIZE - 1)); in xa_is_sibling()
1660 if (XA_CHUNK_SIZE == BITS_PER_LONG) { in xas_find_chunk()
1661 if (offset < XA_CHUNK_SIZE) { in xas_find_chunk()
1666 return XA_CHUNK_SIZE; in xas_find_chunk()
1669 return find_next_bit(addr, XA_CHUNK_SIZE, offset); in xas_find_chunk()
[all …]

Completed in 17 milliseconds