Home
last modified time | relevance | path

Searched refs:preceding_key_p (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dbset.h439 * Pointer '*preceding_key_p' points to a memory object to store preceding
440 * key of k. If the preceding key does not exist, set '*preceding_key_p' to
442 * which '*preceding_key_p' pointed to before calling preceding_key().
447 static inline void preceding_key(struct bkey *k, struct bkey **preceding_key_p) in preceding_key() argument
450 (**preceding_key_p) = KEY(KEY_INODE(k), KEY_OFFSET(k), 0); in preceding_key()
451 if (!(*preceding_key_p)->low) in preceding_key()
452 (*preceding_key_p)->high--; in preceding_key()
453 (*preceding_key_p)->low--; in preceding_key()
455 (*preceding_key_p) = NULL; in preceding_key()
H A Dbset.c882 struct bkey *preceding_key_p = &preceding_key_on_stack; in bch_btree_insert_key() local
887 * If k has preceding key, preceding_key_p will be set to address in bch_btree_insert_key()
888 * of k's preceding key; otherwise preceding_key_p will be set in bch_btree_insert_key()
892 preceding_key(&START_KEY(k), &preceding_key_p); in bch_btree_insert_key() local
894 preceding_key(k, &preceding_key_p); in bch_btree_insert_key()
896 m = bch_btree_iter_init(b, &iter, preceding_key_p); in bch_btree_insert_key()
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dbset.h439 * Pointer '*preceding_key_p' points to a memory object to store preceding
440 * key of k. If the preceding key does not exist, set '*preceding_key_p' to
442 * which '*preceding_key_p' pointed to before calling preceding_key().
447 static inline void preceding_key(struct bkey *k, struct bkey **preceding_key_p) in preceding_key() argument
450 (**preceding_key_p) = KEY(KEY_INODE(k), KEY_OFFSET(k), 0); in preceding_key()
451 if (!(*preceding_key_p)->low) in preceding_key()
452 (*preceding_key_p)->high--; in preceding_key()
453 (*preceding_key_p)->low--; in preceding_key()
455 (*preceding_key_p) = NULL; in preceding_key()
H A Dbset.c884 struct bkey *preceding_key_p = &preceding_key_on_stack; in bch_btree_insert_key() local
889 * If k has preceding key, preceding_key_p will be set to address in bch_btree_insert_key()
890 * of k's preceding key; otherwise preceding_key_p will be set in bch_btree_insert_key()
894 preceding_key(&START_KEY(k), &preceding_key_p); in bch_btree_insert_key() local
896 preceding_key(k, &preceding_key_p); in bch_btree_insert_key()
898 m = bch_btree_iter_init(b, &iter, preceding_key_p); in bch_btree_insert_key()

Completed in 6 milliseconds