Lines Matching refs:l
38 static bool bch_key_sort_cmp(struct btree_iter_set l, in bch_key_sort_cmp() argument
41 int64_t c = bkey_cmp(l.k, r.k); in bch_key_sort_cmp()
43 return c ? c > 0 : l.k < r.k; in bch_key_sort_cmp()
256 static bool bch_extent_sort_cmp(struct btree_iter_set l, in bch_extent_sort_cmp() argument
259 int64_t c = bkey_cmp(&START_KEY(l.k), &START_KEY(r.k)); in bch_extent_sort_cmp()
261 return c ? c > 0 : l.k < r.k; in bch_extent_sort_cmp()
572 static uint64_t merge_chksums(struct bkey *l, struct bkey *r) in merge_chksums() argument
574 return (l->ptr[KEY_PTRS(l)] + r->ptr[KEY_PTRS(r)]) & in merge_chksums()
578 static bool bch_extent_merge(struct btree_keys *bk, struct bkey *l, struct bkey *r) in bch_extent_merge() argument
586 for (i = 0; i < KEY_PTRS(l); i++) in bch_extent_merge()
587 if (l->ptr[i] + PTR(0, KEY_SIZE(l), 0) != r->ptr[i] || in bch_extent_merge()
588 PTR_BUCKET_NR(b->c, l, i) != PTR_BUCKET_NR(b->c, r, i)) in bch_extent_merge()
594 if (KEY_SIZE(l) + KEY_SIZE(r) > USHRT_MAX) { in bch_extent_merge()
595 SET_KEY_OFFSET(l, KEY_OFFSET(l) + USHRT_MAX - KEY_SIZE(l)); in bch_extent_merge()
596 SET_KEY_SIZE(l, USHRT_MAX); in bch_extent_merge()
598 bch_cut_front(l, r); in bch_extent_merge()
602 if (KEY_CSUM(l)) { in bch_extent_merge()
604 l->ptr[KEY_PTRS(l)] = merge_chksums(l, r); in bch_extent_merge()
606 SET_KEY_CSUM(l, 0); in bch_extent_merge()
609 SET_KEY_OFFSET(l, KEY_OFFSET(l) + KEY_SIZE(r)); in bch_extent_merge()
610 SET_KEY_SIZE(l, KEY_SIZE(l) + KEY_SIZE(r)); in bch_extent_merge()