Home
last modified time | relevance | path

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

/openbmc/linux/lib/
H A 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 …]
H A 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()
1966 b_node->b_end = ++j; in mas_mab_cp()
2094 unsigned char b_end; in mas_store_b_node() local
[all …]
/openbmc/u-boot/common/
H A Dflash.c29 ulong b_end; in flash_protect() local
39 b_end = info->start[0] + info->size - 1; /* bank end address */ in flash_protect()
50 to < info->start[0] || from > b_end) { in flash_protect()
57 end = (i == s_end) ? b_end : info->start[i + 1] - 1; in flash_protect()
142 ulong b_end = info->start[0] + info->size; /* bank end addr */ in flash_write() local
145 ulong e_addr = (i == s_end) ? b_end : info->start[i + 1]; in flash_write()
/openbmc/u-boot/cmd/
H A Dflash.c206 ulong b_end; in flash_fill_sect_ranges() local
214 b_end = info->start[0] + info->size - 1; /* bank end addr */ in flash_fill_sect_ranges()
221 end = (sect == s_end) ? b_end : info->start[sect + 1] - 1; in flash_fill_sect_ranges()
237 if (addr_last > b_end) { in flash_fill_sect_ranges()
253 addr_first = (sect == s_end) ? b_end + 1: info->start[sect + 1]; in flash_fill_sect_ranges()
255 } else if (addr_first >= info->start[0] && addr_first < b_end) { in flash_fill_sect_ranges()