Home
last modified time | relevance | path

Searched refs:b_end (Results 1 – 2 of 2) sorted by relevance

/linux-6.6.21/lib/
Dxxhash.c105 const uint8_t *b_end = p + len; in xxh32() local
109 const uint8_t *const limit = b_end - 16; in xxh32()
134 while (p + 4 <= b_end) { in xxh32()
140 while (p < b_end) { in xxh32()
175 const uint8_t *const b_end = p + len; in xxh64() local
179 const uint8_t *const limit = b_end - 32; in xxh64()
209 while (p + 8 <= b_end) { in xxh64()
217 if (p + 4 <= b_end) { in xxh64()
223 while (p < b_end) { in xxh64()
273 const uint8_t *const b_end = p + len; in xxh32_update() local
[all …]
Dmaple_tree.c130 unsigned char b_end; member
1808 unsigned long size = b_node->b_end * sizeof(unsigned long); in mab_shift_right()
1828 unsigned char size = b_node->b_end; in mab_middle_node()
1856 (b_node->b_end - split) > (mt_min_slots[b_node->type])) in mab_no_null_split()
1875 unsigned char b_end = bn->b_end; in mab_calc_split() local
1876 int split = b_end / 2; /* Assume equal split. */ in mab_calc_split()
1887 split = b_end - mt_min_slots[bn->type]; in mab_calc_split()
1907 split = b_end / 3; in mab_calc_split()
1920 (b_end - split > slot_min)) in mab_calc_split()
1977 b_node->b_end = ++j; in mas_mab_cp()
[all …]