Searched refs:max_slot (Results 1 - 7 of 7) sorted by relevance
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | tree-mod-log.c | 803 * max_slot tracks the maximum valid slot of the rewind eb at every in tree_mod_log_rewind()
810 * Since a rewind eb can start empty, max_slot is a signed integer with in tree_mod_log_rewind()
814 int max_slot; in tree_mod_log_rewind() local
819 max_slot = n - 1; in tree_mod_log_rewind()
822 ASSERT(max_slot >= -1); in tree_mod_log_rewind()
839 if (tm->slot > max_slot) in tree_mod_log_rewind()
840 max_slot = tm->slot; in tree_mod_log_rewind()
859 if (tm->slot == max_slot) in tree_mod_log_rewind()
860 max_slot--; in tree_mod_log_rewind()
870 if (WARN_ON(move_src_end_slot > max_slot || in tree_mod_log_rewind()
[all...] |
| H A D | ctree.c | 3445 * max_slot can put a limit on how far into the leaf we'll push items. The
3446 * item at 'max_slot' won't be touched. Use (u32)-1 to make us do all the
3453 u32 max_slot) in __push_leaf_left()
3469 nr = min(right_nritems, max_slot); in __push_leaf_left()
3471 nr = min(right_nritems - 1, max_slot); in __push_leaf_left()
3583 * max_slot can put a limit on how far into the leaf we'll push items. The
3584 * item at 'max_slot' won't be touched. Use (u32)-1 to make us push all the
3589 int data_size, int empty, u32 max_slot) in push_leaf_left()
3638 free_space, right_nritems, max_slot); in push_leaf_left()
3449 __push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_path *path, int data_size, int empty, struct extent_buffer *left, int free_space, u32 right_nritems, u32 max_slot) __push_leaf_left() argument
3587 push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int min_data_size, int data_size, int empty, u32 max_slot) push_leaf_left() argument
|
| /kernel/linux/linux-5.10/drivers/infiniband/hw/bnxt_re/ |
| H A D | qplib_res.h | 176 u32 max_slot; member
421 key |= ((info->hwq->prod / info->max_slot)) & DBC_DBC_INDEX_MASK; in bnxt_qplib_ring_prod_db()
|
| H A D | qplib_fp.c | 674 srq->dbinfo.max_slot = 1; in bnxt_qplib_create_srq()
916 sq->dbinfo.max_slot = bnxt_qplib_set_sq_max_slot(qp->wqe_mode); in bnxt_qplib_create_qp1()
921 rq->dbinfo.max_slot = bnxt_qplib_set_rq_max_slot(rq->wqe_size); in bnxt_qplib_create_qp1()
1122 sq->dbinfo.max_slot = bnxt_qplib_set_sq_max_slot(qp->wqe_mode); in bnxt_qplib_create_qp()
1127 rq->dbinfo.max_slot = bnxt_qplib_set_rq_max_slot(rq->wqe_size); in bnxt_qplib_create_qp()
1694 tail = swq->slot_idx / sq->dbinfo.max_slot; in bnxt_qplib_pull_psn_buff()
1984 if (bnxt_qplib_queue_full(rq, rq->dbinfo.max_slot)) { in bnxt_qplib_post_recv()
1993 swq->slots = rq->dbinfo.max_slot; in bnxt_qplib_post_recv()
|
| /kernel/linux/linux-6.6/drivers/infiniband/hw/bnxt_re/ |
| H A D | qplib_res.h | 188 u32 max_slot; member
442 key |= ((info->hwq->prod / info->max_slot)) & DBC_DBC_INDEX_MASK; in bnxt_qplib_ring_prod_db()
|
| H A D | qplib_fp.c | 688 srq->dbinfo.max_slot = 1; in bnxt_qplib_create_srq()
934 sq->dbinfo.max_slot = bnxt_qplib_set_sq_max_slot(qp->wqe_mode); in bnxt_qplib_create_qp1()
939 rq->dbinfo.max_slot = bnxt_qplib_set_rq_max_slot(rq->wqe_size); in bnxt_qplib_create_qp1()
1145 sq->dbinfo.max_slot = bnxt_qplib_set_sq_max_slot(qp->wqe_mode); in bnxt_qplib_create_qp()
1150 rq->dbinfo.max_slot = bnxt_qplib_set_rq_max_slot(rq->wqe_size); in bnxt_qplib_create_qp()
1724 tail = swq->slot_idx / sq->dbinfo.max_slot; in bnxt_qplib_pull_psn_buff()
2014 if (bnxt_qplib_queue_full(rq, rq->dbinfo.max_slot)) { in bnxt_qplib_post_recv()
2023 swq->slots = rq->dbinfo.max_slot; in bnxt_qplib_post_recv()
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | ctree.c | 3907 * max_slot can put a limit on how far into the leaf we'll push items. The
3908 * item at 'max_slot' won't be touched. Use (u32)-1 to make us do all the
3914 u32 max_slot) in __push_leaf_left()
3931 nr = min(right_nritems, max_slot); in __push_leaf_left()
3933 nr = min(right_nritems - 1, max_slot); in __push_leaf_left()
4059 * max_slot can put a limit on how far into the leaf we'll push items. The
4060 * item at 'max_slot' won't be touched. Use (u32)-1 to make us push all the
4065 int data_size, int empty, u32 max_slot) in push_leaf_left()
4127 max_slot); in push_leaf_left()
3911 __push_leaf_left(struct btrfs_path *path, int data_size, int empty, struct extent_buffer *left, int free_space, u32 right_nritems, u32 max_slot) __push_leaf_left() argument
4063 push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int min_data_size, int data_size, int empty, u32 max_slot) push_leaf_left() argument
|
Completed in 27 milliseconds