Home
last modified time | relevance | path

Searched refs:RADIX_TREE_MAP_SIZE (Results 1 – 8 of 8) sorted by relevance

/openbmc/linux/ipc/
H A Dutil.h30 #define IPCMNI_EXTEND_MIN_CYCLE (RADIX_TREE_MAP_SIZE * RADIX_TREE_MAP_SIZE)
45 #define ipc_min_cycle ((int)RADIX_TREE_MAP_SIZE)
H A Dipc_sysctl.c74 int ipc_min_cycle = RADIX_TREE_MAP_SIZE;
/openbmc/linux/lib/
H A Dradix-tree.c165 bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE); in all_tag_set()
185 if (offset < RADIX_TREE_MAP_SIZE) { in radix_tree_find_next_bit()
193 while (offset < RADIX_TREE_MAP_SIZE) { in radix_tree_find_next_bit()
200 return RADIX_TREE_MAP_SIZE; in radix_tree_find_next_bit()
213 return (RADIX_TREE_MAP_SIZE << shift) - 1; in shift_maxindex()
669 while (offset == RADIX_TREE_MAP_SIZE) { in radix_tree_free_nodes()
1207 while (++offset < RADIX_TREE_MAP_SIZE) { in radix_tree_next_chunk()
1218 if (offset == RADIX_TREE_MAP_SIZE) in radix_tree_next_chunk()
1525 while (offset == RADIX_TREE_MAP_SIZE) { in idr_get_free()
/openbmc/linux/include/linux/
H A Dradix-tree.h64 #define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT) macro
65 #define RADIX_TREE_MAP_MASK (RADIX_TREE_MAP_SIZE-1)
/openbmc/linux/tools/testing/radix-tree/
H A Dregression2.c80 int max_slots = RADIX_TREE_MAP_SIZE; in regression2_test()
H A Dtest.c230 for (i = 0; i < RADIX_TREE_MAP_SIZE; i++) in verify_node()
H A Didr-test.c367 for (i = 1; i < RADIX_TREE_MAP_SIZE; i++) in idr_checks()
/openbmc/linux/scripts/gdb/linux/
H A Dconstants.py.in92 LX_GDBPARSED(RADIX_TREE_MAP_SIZE)