Home
last modified time | relevance | path

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

/linux/lib/
H A Dxxhash.c90 const uint8_t *b_end = p + len; in xxh32() local
94 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() local
164 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 …]
/linux/tools/sched_ext/include/scx/
H A Dcid.bpf.h472 u32 b_end = b->base + b->nr_cids; in cmask_subset() local
476 u32 hi = a_end < b_end ? a_end : b_end; in cmask_subset()
483 if (a_end > b_end && in cmask_subset()
484 cmask_next_set(a, a->base > b_end ? a->base : b_end) < a_end) in cmask_subset()
539 u32 b_end = b->base + b->nr_cids; in cmask_intersects() local
541 u32 hi = a_end < b_end ? a_end : b_end; in cmask_intersects()
588 u32 b_end = b->base + b->nr_cids; in cmask_next_and_set() local
592 u32 hi = a_end < b_end ? a_end : b_end; in cmask_next_and_set()
681 u32 b_end = b->base + b->nr_cids; in cmask_next_and2_set() local
687 u32 hi = a_end < b_end ? a_end : b_end; in cmask_next_and2_set()