Searched refs:b_end (Results 1 – 2 of 2) sorted by relevance
90 const uint8_t *b_end = p + len; in xxh32() local94 const uint8_t *const limit = b_end - 16; in xxh32()119 while (p + 4 <= b_end) { in xxh32()125 while (p < b_end) { in xxh32()160 const uint8_t *const b_end = p + len; in xxh64() local164 const uint8_t *const limit = b_end - 32; in xxh64()194 while (p + 8 <= b_end) { in xxh64()202 if (p + 4 <= b_end) { in xxh64()208 while (p < b_end) { in xxh64()244 const uint8_t *const b_end = p + len; in xxh64_update() local[all …]
144 unsigned char b_end; member1628 unsigned long size = b_node->b_end * sizeof(unsigned long); in mab_shift_right()1647 unsigned char size = b_node->b_end; in mab_middle_node()1675 (b_node->b_end - split) > (mt_min_slots[b_node->type])) in mab_no_null_split()1695 unsigned char b_end = bn->b_end; in mab_calc_split() local1696 int split = b_end / 2; /* Assume equal split. */ in mab_calc_split()1713 split = b_end / 3; in mab_calc_split()1771 b_node->b_end = ++j; in mas_mab_cp()1864 unsigned char b_end; in mas_store_b_node() local1870 b_end = 0; in mas_store_b_node()[all …]