| /kernel/linux/linux-5.10/fs/reiserfs/ |
| H A D | ibalance.c | 809 struct buffer_head **insert_ptr) in balance_internal()
879 insert_ptr); in balance_internal()
899 insert_key, insert_ptr); in balance_internal()
905 * node-ptr to insert_ptr[k] in balance_internal()
909 MAX_CHILD_SIZE(insert_ptr[k]) - in balance_internal()
910 B_FREE_SPACE(insert_ptr[k])); in balance_internal()
911 put_dc_block_number(dc, insert_ptr[k]->b_blocknr); in balance_internal()
917 insert_ptr += k; in balance_internal()
949 insert_ptr); in balance_internal()
965 insert_ptr in balance_internal()
803 balance_internal(struct tree_balance *tb, int h, int child_pos, struct item_head *insert_key, struct buffer_head **insert_ptr) balance_internal() argument
[all...] |
| H A D | do_balan.c | 923 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_insert()
1013 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_paste_dirent()
1068 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_paste_shift()
1082 insert_ptr, i); in balance_leaf_new_nodes_paste_shift()
1141 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_paste_whole()
1194 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_paste()
1212 insert_ptr, i); in balance_leaf_new_nodes_paste()
1216 insert_ptr, i); in balance_leaf_new_nodes_paste()
1224 struct buffer_head **insert_ptr, in balance_leaf_new_nodes()
1244 insert_ptr, in balance_leaf_new_nodes()
919 balance_leaf_new_nodes_insert(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_insert() argument
1009 balance_leaf_new_nodes_paste_dirent(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_paste_dirent() argument
1064 balance_leaf_new_nodes_paste_shift(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_paste_shift() argument
1137 balance_leaf_new_nodes_paste_whole(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_paste_whole() argument
1190 balance_leaf_new_nodes_paste(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_paste() argument
1220 balance_leaf_new_nodes(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int flag) balance_leaf_new_nodes() argument
1382 balance_leaf(struct tree_balance *tb, struct item_head *ih, const char *body, int flag, struct item_head *insert_key, struct buffer_head **insert_ptr) balance_leaf() argument
1862 struct buffer_head *insert_ptr[2]; do_balance() local
[all...] |
| /kernel/linux/linux-6.6/fs/reiserfs/ |
| H A D | ibalance.c | 809 struct buffer_head **insert_ptr) in balance_internal()
879 insert_ptr); in balance_internal()
899 insert_key, insert_ptr); in balance_internal()
905 * node-ptr to insert_ptr[k] in balance_internal()
909 MAX_CHILD_SIZE(insert_ptr[k]) - in balance_internal()
910 B_FREE_SPACE(insert_ptr[k])); in balance_internal()
911 put_dc_block_number(dc, insert_ptr[k]->b_blocknr); in balance_internal()
917 insert_ptr += k; in balance_internal()
949 insert_ptr); in balance_internal()
965 insert_ptr in balance_internal()
803 balance_internal(struct tree_balance *tb, int h, int child_pos, struct item_head *insert_key, struct buffer_head **insert_ptr) balance_internal() argument
[all...] |
| H A D | do_balan.c | 923 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_insert()
1013 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_paste_dirent()
1068 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_paste_shift()
1082 insert_ptr, i); in balance_leaf_new_nodes_paste_shift()
1141 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_paste_whole()
1194 struct buffer_head **insert_ptr, in balance_leaf_new_nodes_paste()
1212 insert_ptr, i); in balance_leaf_new_nodes_paste()
1216 insert_ptr, i); in balance_leaf_new_nodes_paste()
1224 struct buffer_head **insert_ptr, in balance_leaf_new_nodes()
1244 insert_ptr, in balance_leaf_new_nodes()
919 balance_leaf_new_nodes_insert(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_insert() argument
1009 balance_leaf_new_nodes_paste_dirent(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_paste_dirent() argument
1064 balance_leaf_new_nodes_paste_shift(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_paste_shift() argument
1137 balance_leaf_new_nodes_paste_whole(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_paste_whole() argument
1190 balance_leaf_new_nodes_paste(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int i) balance_leaf_new_nodes_paste() argument
1220 balance_leaf_new_nodes(struct tree_balance *tb, struct item_head * const ih, const char * const body, struct item_head *insert_key, struct buffer_head **insert_ptr, int flag) balance_leaf_new_nodes() argument
1382 balance_leaf(struct tree_balance *tb, struct item_head *ih, const char *body, int flag, struct item_head *insert_key, struct buffer_head **insert_ptr) balance_leaf() argument
1862 struct buffer_head *insert_ptr[2]; do_balance() local
[all...] |
| /kernel/linux/linux-5.10/drivers/net/ethernet/sfc/ |
| H A D | tx_tso.c | 81 unsigned int insert_ptr = efx_tx_queue_get_insert_index(tx_queue); in prefetch_ptr() local
84 ptr = (char *) (tx_queue->buffer + insert_ptr); in prefetch_ptr()
88 ptr = (char *) (((efx_qword_t *)tx_queue->txd.buf.addr) + insert_ptr); in prefetch_ptr()
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/sfc/ |
| H A D | tx_tso.c | 81 unsigned int insert_ptr = efx_tx_queue_get_insert_index(tx_queue); in prefetch_ptr() local
84 ptr = (char *) (tx_queue->buffer + insert_ptr); in prefetch_ptr()
88 ptr = (char *)(((efx_qword_t *)tx_queue->txd.addr) + insert_ptr); in prefetch_ptr()
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | ctree.c | 3492 static void insert_ptr(struct btrfs_trans_handle *trans, in insert_ptr() function
3608 insert_ptr(trans, path, &disk_key, split->start, in split_node()
4177 insert_ptr(trans, path, &disk_key, right->start, path->slots[1] + 1, 1); in copy_for_split()
4393 insert_ptr(trans, path, &disk_key, in split_leaf()
4402 insert_ptr(trans, path, &disk_key, in split_leaf()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | ctree.c | 3042 static int insert_ptr(struct btrfs_trans_handle *trans, in insert_ptr() function
3166 ret = insert_ptr(trans, path, &disk_key, split->start, in split_node()
3684 ret = insert_ptr(trans, path, &disk_key, right->start, path->slots[1] + 1, 1); in copy_for_split()
3904 ret = insert_ptr(trans, path, &disk_key, in split_leaf()
3918 ret = insert_ptr(trans, path, &disk_key, in split_leaf()
|