Searched refs:move (Results 1 - 7 of 7) sorted by relevance
/fs/nilfs2/ |
H A D | btree.c | 761 int nchildren, lnchildren, n, move, ncblk; local 768 move = 0; 772 /* move insert point */ 774 move = 1; 787 if (move) { 807 int nchildren, rnchildren, n, move, ncblk; local 814 move = 0; 818 /* move insert point */ 820 move = 1; 835 if (move) { 856 int nchildren, n, move, ncblk; local [all...] |
/fs/ubifs/ |
H A D | tnc.c | 1962 int i, keep, move, appending = 0; local 2024 move = c->fanout - keep; 2034 move = 0; 2037 move = c->fanout - keep; 2042 * if we can move some zbranches there. 2048 move += 1; 2064 zn->child_cnt = move; 2067 dbg_tnc("moving %d, keeping %d", move, keep); 2070 for (i = 0; i < move; i++) {
|
H A D | dir.c | 959 int err, release, sync = 0, move = (new_dir != old_dir); local 1015 if (move) { 1103 if (move) {
|
H A D | journal.c | 932 int move = (old_dir != new_dir); local 997 if (!move) 1072 if (move)
|
/fs/ext3/ |
H A D | namei.c | 1135 * Allocate a new block, and move entries so that they are approx. equally full. 1149 unsigned split, move, size; local 1180 move = 0; 1186 move++; 1189 split = count - move; 1359 /* The 0th block becomes the root, move the dirents out */
|
/fs/ext4/ |
H A D | namei.c | 1500 * Allocate a new block, and move entries so that they are approx. equally full. 1514 unsigned split, move, size; local 1550 move = 0; 1556 move++; 1559 split = count - move; 1767 /* The 0th block becomes the root, move the dirents out */
|
/fs/btrfs/ |
H A D | ctree.c | 321 struct tree_mod_move move; member in struct:tree_mod_elem 585 tm->move.dst_slot = dst_slot; 586 tm->move.nr_items = nr_items; 603 * When we override something during the move, we log these removals. 604 * This can only happen when we move towards the beginning of the 1305 /* if a move operation is needed it's in the log */ 1310 o_src = btrfs_node_key_ptr_offset(tm->move.dst_slot); 1312 tm->move.nr_items * p_size); 5239 /* move upnext */ 5253 * Returns 1 if it had to move u [all...] |
Completed in 83 milliseconds