16cbd5570SChris Mason /* 26cbd5570SChris Mason * Copyright (C) 2007 Oracle. All rights reserved. 36cbd5570SChris Mason * 46cbd5570SChris Mason * This program is free software; you can redistribute it and/or 56cbd5570SChris Mason * modify it under the terms of the GNU General Public 66cbd5570SChris Mason * License v2 as published by the Free Software Foundation. 76cbd5570SChris Mason * 86cbd5570SChris Mason * This program is distributed in the hope that it will be useful, 96cbd5570SChris Mason * but WITHOUT ANY WARRANTY; without even the implied warranty of 106cbd5570SChris Mason * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 116cbd5570SChris Mason * General Public License for more details. 126cbd5570SChris Mason * 136cbd5570SChris Mason * You should have received a copy of the GNU General Public 146cbd5570SChris Mason * License along with this program; if not, write to the 156cbd5570SChris Mason * Free Software Foundation, Inc., 59 Temple Place - Suite 330, 166cbd5570SChris Mason * Boston, MA 021110-1307, USA. 176cbd5570SChris Mason */ 186cbd5570SChris Mason 1962e2749eSChris Mason #include "ctree.h" 2062e2749eSChris Mason #include "disk-io.h" 2162e2749eSChris Mason #include "hash.h" 22e089f05cSChris Mason #include "transaction.h" 2362e2749eSChris Mason 24d352ac68SChris Mason /* 25d352ac68SChris Mason * insert a name into a directory, doing overflow properly if there is a hash 26d352ac68SChris Mason * collision. data_size indicates how big the item inserted should be. On 27d352ac68SChris Mason * success a struct btrfs_dir_item pointer is returned, otherwise it is 28d352ac68SChris Mason * an ERR_PTR. 29d352ac68SChris Mason * 30d352ac68SChris Mason * The name is not copied into the dir item, you have to do that yourself. 31d352ac68SChris Mason */ 3235b7e476SChris Mason static struct btrfs_dir_item *insert_with_overflow(struct btrfs_trans_handle 3335b7e476SChris Mason *trans, 347e38180eSChris Mason struct btrfs_root *root, 357e38180eSChris Mason struct btrfs_path *path, 367e38180eSChris Mason struct btrfs_key *cpu_key, 37e06afa83SChris Mason u32 data_size, 38e06afa83SChris Mason const char *name, 39e06afa83SChris Mason int name_len) 407fcde0e3SChris Mason { 417fcde0e3SChris Mason int ret; 427e38180eSChris Mason char *ptr; 437e38180eSChris Mason struct btrfs_item *item; 445f39d397SChris Mason struct extent_buffer *leaf; 457fcde0e3SChris Mason 467fcde0e3SChris Mason ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); 477e38180eSChris Mason if (ret == -EEXIST) { 48e06afa83SChris Mason struct btrfs_dir_item *di; 49e06afa83SChris Mason di = btrfs_match_dir_item_name(root, path, name, name_len); 50e06afa83SChris Mason if (di) 51e06afa83SChris Mason return ERR_PTR(-EEXIST); 527e38180eSChris Mason ret = btrfs_extend_item(trans, root, path, data_size); 537e38180eSChris Mason WARN_ON(ret > 0); 547fcde0e3SChris Mason } 5554aa1f4dSChris Mason if (ret < 0) 5654aa1f4dSChris Mason return ERR_PTR(ret); 577e38180eSChris Mason WARN_ON(ret > 0); 585f39d397SChris Mason leaf = path->nodes[0]; 595f39d397SChris Mason item = btrfs_item_nr(leaf, path->slots[0]); 607e38180eSChris Mason ptr = btrfs_item_ptr(leaf, path->slots[0], char); 615f39d397SChris Mason BUG_ON(data_size > btrfs_item_size(leaf, item)); 625f39d397SChris Mason ptr += btrfs_item_size(leaf, item) - data_size; 637e38180eSChris Mason return (struct btrfs_dir_item *)ptr; 647fcde0e3SChris Mason } 657fcde0e3SChris Mason 66d352ac68SChris Mason /* 67d352ac68SChris Mason * xattrs work a lot like directories, this inserts an xattr item 68d352ac68SChris Mason * into the tree 69d352ac68SChris Mason */ 705103e947SJosef Bacik int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans, 71f34f57a3SYan, Zheng struct btrfs_root *root, 72f34f57a3SYan, Zheng struct btrfs_path *path, u64 objectid, 73f34f57a3SYan, Zheng const char *name, u16 name_len, 74f34f57a3SYan, Zheng const void *data, u16 data_len) 755103e947SJosef Bacik { 765103e947SJosef Bacik int ret = 0; 775103e947SJosef Bacik struct btrfs_dir_item *dir_item; 785103e947SJosef Bacik unsigned long name_ptr, data_ptr; 795103e947SJosef Bacik struct btrfs_key key, location; 805103e947SJosef Bacik struct btrfs_disk_key disk_key; 815103e947SJosef Bacik struct extent_buffer *leaf; 825103e947SJosef Bacik u32 data_size; 835103e947SJosef Bacik 84f34f57a3SYan, Zheng BUG_ON(name_len + data_len > BTRFS_MAX_XATTR_SIZE(root)); 85f34f57a3SYan, Zheng 86f34f57a3SYan, Zheng key.objectid = objectid; 875103e947SJosef Bacik btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY); 88df68b8a7SDavid Miller key.offset = btrfs_name_hash(name, name_len); 895103e947SJosef Bacik 905103e947SJosef Bacik data_size = sizeof(*dir_item) + name_len + data_len; 915103e947SJosef Bacik dir_item = insert_with_overflow(trans, root, path, &key, data_size, 925103e947SJosef Bacik name, name_len); 935103e947SJosef Bacik /* 945103e947SJosef Bacik * FIXME: at some point we should handle xattr's that are larger than 955103e947SJosef Bacik * what we can fit in our leaf. We set location to NULL b/c we arent 965103e947SJosef Bacik * pointing at anything else, that will change if we store the xattr 975103e947SJosef Bacik * data in a separate inode. 985103e947SJosef Bacik */ 995103e947SJosef Bacik BUG_ON(IS_ERR(dir_item)); 1005103e947SJosef Bacik memset(&location, 0, sizeof(location)); 1015103e947SJosef Bacik 1025103e947SJosef Bacik leaf = path->nodes[0]; 1035103e947SJosef Bacik btrfs_cpu_key_to_disk(&disk_key, &location); 1045103e947SJosef Bacik btrfs_set_dir_item_key(leaf, dir_item, &disk_key); 1055103e947SJosef Bacik btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR); 1065103e947SJosef Bacik btrfs_set_dir_name_len(leaf, dir_item, name_len); 107e02119d5SChris Mason btrfs_set_dir_transid(leaf, dir_item, trans->transid); 1085103e947SJosef Bacik btrfs_set_dir_data_len(leaf, dir_item, data_len); 1095103e947SJosef Bacik name_ptr = (unsigned long)(dir_item + 1); 1105103e947SJosef Bacik data_ptr = (unsigned long)((char *)name_ptr + name_len); 1115103e947SJosef Bacik 1125103e947SJosef Bacik write_extent_buffer(leaf, name, name_ptr, name_len); 1135103e947SJosef Bacik write_extent_buffer(leaf, data, data_ptr, data_len); 1145103e947SJosef Bacik btrfs_mark_buffer_dirty(path->nodes[0]); 1155103e947SJosef Bacik 1165103e947SJosef Bacik return ret; 1175103e947SJosef Bacik } 1185103e947SJosef Bacik 119d352ac68SChris Mason /* 120d352ac68SChris Mason * insert a directory item in the tree, doing all the magic for 121d352ac68SChris Mason * both indexes. 'dir' indicates which objectid to insert it into, 122d352ac68SChris Mason * 'location' is the key to stuff into the directory item, 'type' is the 123d352ac68SChris Mason * type of the inode we're pointing to, and 'index' is the sequence number 124d352ac68SChris Mason * to use for the second index (if one is created). 125d352ac68SChris Mason */ 126e089f05cSChris Mason int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root 127d6e4a428SChris Mason *root, const char *name, int name_len, u64 dir, 128aec7477bSJosef Bacik struct btrfs_key *location, u8 type, u64 index) 12962e2749eSChris Mason { 13062e2749eSChris Mason int ret = 0; 131e06afa83SChris Mason int ret2 = 0; 1325caf2a00SChris Mason struct btrfs_path *path; 13362e2749eSChris Mason struct btrfs_dir_item *dir_item; 1345f39d397SChris Mason struct extent_buffer *leaf; 1355f39d397SChris Mason unsigned long name_ptr; 13662e2749eSChris Mason struct btrfs_key key; 1375f39d397SChris Mason struct btrfs_disk_key disk_key; 13862e2749eSChris Mason u32 data_size; 13962e2749eSChris Mason 14062e2749eSChris Mason key.objectid = dir; 1411d4f6404SChris Mason btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY); 142df68b8a7SDavid Miller key.offset = btrfs_name_hash(name, name_len); 143b9473439SChris Mason 1445caf2a00SChris Mason path = btrfs_alloc_path(); 145b9473439SChris Mason path->leave_spinning = 1; 146b9473439SChris Mason 14762e2749eSChris Mason data_size = sizeof(*dir_item) + name_len; 148e06afa83SChris Mason dir_item = insert_with_overflow(trans, root, path, &key, data_size, 149e06afa83SChris Mason name, name_len); 1507e38180eSChris Mason if (IS_ERR(dir_item)) { 1517e38180eSChris Mason ret = PTR_ERR(dir_item); 152e06afa83SChris Mason if (ret == -EEXIST) 153e06afa83SChris Mason goto second_insert; 15462e2749eSChris Mason goto out; 1557e38180eSChris Mason } 15662e2749eSChris Mason 1575f39d397SChris Mason leaf = path->nodes[0]; 1585f39d397SChris Mason btrfs_cpu_key_to_disk(&disk_key, location); 1595f39d397SChris Mason btrfs_set_dir_item_key(leaf, dir_item, &disk_key); 1605f39d397SChris Mason btrfs_set_dir_type(leaf, dir_item, type); 1615103e947SJosef Bacik btrfs_set_dir_data_len(leaf, dir_item, 0); 1625f39d397SChris Mason btrfs_set_dir_name_len(leaf, dir_item, name_len); 163e02119d5SChris Mason btrfs_set_dir_transid(leaf, dir_item, trans->transid); 1645f39d397SChris Mason name_ptr = (unsigned long)(dir_item + 1); 165c5739bbaSChris Mason 1665f39d397SChris Mason write_extent_buffer(leaf, name, name_ptr, name_len); 1675f39d397SChris Mason btrfs_mark_buffer_dirty(leaf); 1687e38180eSChris Mason 169e06afa83SChris Mason second_insert: 1707e38180eSChris Mason /* FIXME, use some real flag for selecting the extra index */ 1717e38180eSChris Mason if (root == root->fs_info->tree_root) { 1727e38180eSChris Mason ret = 0; 1737e38180eSChris Mason goto out; 1747e38180eSChris Mason } 1755caf2a00SChris Mason btrfs_release_path(root, path); 1767e38180eSChris Mason 1777e38180eSChris Mason btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY); 178aec7477bSJosef Bacik key.offset = index; 179e06afa83SChris Mason dir_item = insert_with_overflow(trans, root, path, &key, data_size, 180e06afa83SChris Mason name, name_len); 1817e38180eSChris Mason if (IS_ERR(dir_item)) { 182e06afa83SChris Mason ret2 = PTR_ERR(dir_item); 1837e38180eSChris Mason goto out; 1847e38180eSChris Mason } 1855f39d397SChris Mason leaf = path->nodes[0]; 1865f39d397SChris Mason btrfs_cpu_key_to_disk(&disk_key, location); 1875f39d397SChris Mason btrfs_set_dir_item_key(leaf, dir_item, &disk_key); 1885f39d397SChris Mason btrfs_set_dir_type(leaf, dir_item, type); 1895103e947SJosef Bacik btrfs_set_dir_data_len(leaf, dir_item, 0); 1905f39d397SChris Mason btrfs_set_dir_name_len(leaf, dir_item, name_len); 191e02119d5SChris Mason btrfs_set_dir_transid(leaf, dir_item, trans->transid); 1925f39d397SChris Mason name_ptr = (unsigned long)(dir_item + 1); 1935f39d397SChris Mason write_extent_buffer(leaf, name, name_ptr, name_len); 1945f39d397SChris Mason btrfs_mark_buffer_dirty(leaf); 1957e38180eSChris Mason out: 1965caf2a00SChris Mason btrfs_free_path(path); 197e06afa83SChris Mason if (ret) 19862e2749eSChris Mason return ret; 199e06afa83SChris Mason if (ret2) 200e06afa83SChris Mason return ret2; 201e06afa83SChris Mason return 0; 20262e2749eSChris Mason } 20362e2749eSChris Mason 204d352ac68SChris Mason /* 205d352ac68SChris Mason * lookup a directory item based on name. 'dir' is the objectid 206d352ac68SChris Mason * we're searching in, and 'mod' tells us if you plan on deleting the 207d352ac68SChris Mason * item (use mod < 0) or changing the options (use mod > 0) 208d352ac68SChris Mason */ 2097e38180eSChris Mason struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, 2107e38180eSChris Mason struct btrfs_root *root, 2117e38180eSChris Mason struct btrfs_path *path, u64 dir, 2127e38180eSChris Mason const char *name, int name_len, 2137e38180eSChris Mason int mod) 21462e2749eSChris Mason { 2151d4f6404SChris Mason int ret; 21662e2749eSChris Mason struct btrfs_key key; 2171d4f6404SChris Mason int ins_len = mod < 0 ? -1 : 0; 2181d4f6404SChris Mason int cow = mod != 0; 2195f39d397SChris Mason struct btrfs_key found_key; 2205f39d397SChris Mason struct extent_buffer *leaf; 22162e2749eSChris Mason 22262e2749eSChris Mason key.objectid = dir; 2231d4f6404SChris Mason btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY); 2245f39d397SChris Mason 225df68b8a7SDavid Miller key.offset = btrfs_name_hash(name, name_len); 2265f39d397SChris Mason 227e089f05cSChris Mason ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); 2287fcde0e3SChris Mason if (ret < 0) 2297e38180eSChris Mason return ERR_PTR(ret); 2307fcde0e3SChris Mason if (ret > 0) { 2317fcde0e3SChris Mason if (path->slots[0] == 0) 2327e38180eSChris Mason return NULL; 2337fcde0e3SChris Mason path->slots[0]--; 2347fcde0e3SChris Mason } 2357fcde0e3SChris Mason 2365f39d397SChris Mason leaf = path->nodes[0]; 2375f39d397SChris Mason btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); 2385f39d397SChris Mason 2395f39d397SChris Mason if (found_key.objectid != dir || 2405f39d397SChris Mason btrfs_key_type(&found_key) != BTRFS_DIR_ITEM_KEY || 2415f39d397SChris Mason found_key.offset != key.offset) 2427e38180eSChris Mason return NULL; 2437fcde0e3SChris Mason 2447e38180eSChris Mason return btrfs_match_dir_item_name(root, path, name, name_len); 24562e2749eSChris Mason } 24662e2749eSChris Mason 247d352ac68SChris Mason /* 248d352ac68SChris Mason * lookup a directory item based on index. 'dir' is the objectid 249d352ac68SChris Mason * we're searching in, and 'mod' tells us if you plan on deleting the 250d352ac68SChris Mason * item (use mod < 0) or changing the options (use mod > 0) 251d352ac68SChris Mason * 252d352ac68SChris Mason * The name is used to make sure the index really points to the name you were 253d352ac68SChris Mason * looking for. 254d352ac68SChris Mason */ 2557e38180eSChris Mason struct btrfs_dir_item * 2567e38180eSChris Mason btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans, 2577e38180eSChris Mason struct btrfs_root *root, 2587e38180eSChris Mason struct btrfs_path *path, u64 dir, 2597e38180eSChris Mason u64 objectid, const char *name, int name_len, 2607e38180eSChris Mason int mod) 2617e38180eSChris Mason { 2627e38180eSChris Mason int ret; 2637e38180eSChris Mason struct btrfs_key key; 2647e38180eSChris Mason int ins_len = mod < 0 ? -1 : 0; 2657e38180eSChris Mason int cow = mod != 0; 2667e38180eSChris Mason 2677e38180eSChris Mason key.objectid = dir; 2687e38180eSChris Mason btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY); 2697e38180eSChris Mason key.offset = objectid; 2707e38180eSChris Mason 2717e38180eSChris Mason ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); 2727e38180eSChris Mason if (ret < 0) 2737e38180eSChris Mason return ERR_PTR(ret); 2747e38180eSChris Mason if (ret > 0) 2757e38180eSChris Mason return ERR_PTR(-ENOENT); 2767e38180eSChris Mason return btrfs_match_dir_item_name(root, path, name, name_len); 2777e38180eSChris Mason } 2787e38180eSChris Mason 2794df27c4dSYan, Zheng struct btrfs_dir_item * 2804df27c4dSYan, Zheng btrfs_search_dir_index_item(struct btrfs_root *root, 2814df27c4dSYan, Zheng struct btrfs_path *path, u64 dirid, 2824df27c4dSYan, Zheng const char *name, int name_len) 2834df27c4dSYan, Zheng { 2844df27c4dSYan, Zheng struct extent_buffer *leaf; 2854df27c4dSYan, Zheng struct btrfs_dir_item *di; 2864df27c4dSYan, Zheng struct btrfs_key key; 2874df27c4dSYan, Zheng u32 nritems; 2884df27c4dSYan, Zheng int ret; 2894df27c4dSYan, Zheng 2904df27c4dSYan, Zheng key.objectid = dirid; 2914df27c4dSYan, Zheng key.type = BTRFS_DIR_INDEX_KEY; 2924df27c4dSYan, Zheng key.offset = 0; 2934df27c4dSYan, Zheng 2944df27c4dSYan, Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 2954df27c4dSYan, Zheng if (ret < 0) 2964df27c4dSYan, Zheng return ERR_PTR(ret); 2974df27c4dSYan, Zheng 2984df27c4dSYan, Zheng leaf = path->nodes[0]; 2994df27c4dSYan, Zheng nritems = btrfs_header_nritems(leaf); 3004df27c4dSYan, Zheng 3014df27c4dSYan, Zheng while (1) { 3024df27c4dSYan, Zheng if (path->slots[0] >= nritems) { 3034df27c4dSYan, Zheng ret = btrfs_next_leaf(root, path); 3044df27c4dSYan, Zheng if (ret < 0) 3054df27c4dSYan, Zheng return ERR_PTR(ret); 3064df27c4dSYan, Zheng if (ret > 0) 3074df27c4dSYan, Zheng break; 3084df27c4dSYan, Zheng leaf = path->nodes[0]; 3094df27c4dSYan, Zheng nritems = btrfs_header_nritems(leaf); 3104df27c4dSYan, Zheng continue; 3114df27c4dSYan, Zheng } 3124df27c4dSYan, Zheng 3134df27c4dSYan, Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3144df27c4dSYan, Zheng if (key.objectid != dirid || key.type != BTRFS_DIR_INDEX_KEY) 3154df27c4dSYan, Zheng break; 3164df27c4dSYan, Zheng 3174df27c4dSYan, Zheng di = btrfs_match_dir_item_name(root, path, name, name_len); 3184df27c4dSYan, Zheng if (di) 3194df27c4dSYan, Zheng return di; 3204df27c4dSYan, Zheng 3214df27c4dSYan, Zheng path->slots[0]++; 3224df27c4dSYan, Zheng } 3234df27c4dSYan, Zheng return NULL; 3244df27c4dSYan, Zheng } 3254df27c4dSYan, Zheng 3265103e947SJosef Bacik struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans, 3275103e947SJosef Bacik struct btrfs_root *root, 3285103e947SJosef Bacik struct btrfs_path *path, u64 dir, 3295103e947SJosef Bacik const char *name, u16 name_len, 3305103e947SJosef Bacik int mod) 3315103e947SJosef Bacik { 3325103e947SJosef Bacik int ret; 3335103e947SJosef Bacik struct btrfs_key key; 3345103e947SJosef Bacik int ins_len = mod < 0 ? -1 : 0; 3355103e947SJosef Bacik int cow = mod != 0; 3365103e947SJosef Bacik struct btrfs_key found_key; 3375103e947SJosef Bacik struct extent_buffer *leaf; 3385103e947SJosef Bacik 3395103e947SJosef Bacik key.objectid = dir; 3405103e947SJosef Bacik btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY); 341df68b8a7SDavid Miller key.offset = btrfs_name_hash(name, name_len); 3425103e947SJosef Bacik ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); 3435103e947SJosef Bacik if (ret < 0) 3445103e947SJosef Bacik return ERR_PTR(ret); 3455103e947SJosef Bacik if (ret > 0) { 3465103e947SJosef Bacik if (path->slots[0] == 0) 3475103e947SJosef Bacik return NULL; 3485103e947SJosef Bacik path->slots[0]--; 3495103e947SJosef Bacik } 3505103e947SJosef Bacik 3515103e947SJosef Bacik leaf = path->nodes[0]; 3525103e947SJosef Bacik btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); 3535103e947SJosef Bacik 3545103e947SJosef Bacik if (found_key.objectid != dir || 3555103e947SJosef Bacik btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY || 3565103e947SJosef Bacik found_key.offset != key.offset) 3575103e947SJosef Bacik return NULL; 3585103e947SJosef Bacik 3595103e947SJosef Bacik return btrfs_match_dir_item_name(root, path, name, name_len); 3605103e947SJosef Bacik } 3615103e947SJosef Bacik 362d352ac68SChris Mason /* 363d352ac68SChris Mason * helper function to look at the directory item pointed to by 'path' 364d352ac68SChris Mason * this walks through all the entries in a dir item and finds one 365d352ac68SChris Mason * for a specific name. 366d352ac68SChris Mason */ 3677e38180eSChris Mason struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root, 3687f5c1516SChris Mason struct btrfs_path *path, 3697f5c1516SChris Mason const char *name, int name_len) 37062e2749eSChris Mason { 37162e2749eSChris Mason struct btrfs_dir_item *dir_item; 3725f39d397SChris Mason unsigned long name_ptr; 3737e38180eSChris Mason u32 total_len; 3747e38180eSChris Mason u32 cur = 0; 3757e38180eSChris Mason u32 this_len; 3765f39d397SChris Mason struct extent_buffer *leaf; 377a8a2ee0cSChris Mason 3785f39d397SChris Mason leaf = path->nodes[0]; 3797e38180eSChris Mason dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item); 38022a94d44SJosef Bacik if (verify_dir_item(root, leaf, dir_item)) 38122a94d44SJosef Bacik return NULL; 38222a94d44SJosef Bacik 3835f39d397SChris Mason total_len = btrfs_item_size_nr(leaf, path->slots[0]); 3847e38180eSChris Mason while (cur < total_len) { 3855f39d397SChris Mason this_len = sizeof(*dir_item) + 3865103e947SJosef Bacik btrfs_dir_name_len(leaf, dir_item) + 3875103e947SJosef Bacik btrfs_dir_data_len(leaf, dir_item); 3885f39d397SChris Mason name_ptr = (unsigned long)(dir_item + 1); 3897e38180eSChris Mason 3905f39d397SChris Mason if (btrfs_dir_name_len(leaf, dir_item) == name_len && 3915f39d397SChris Mason memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) 3927e38180eSChris Mason return dir_item; 3937e38180eSChris Mason 3947e38180eSChris Mason cur += this_len; 3957e38180eSChris Mason dir_item = (struct btrfs_dir_item *)((char *)dir_item + 3967e38180eSChris Mason this_len); 39762e2749eSChris Mason } 3987e38180eSChris Mason return NULL; 3997e38180eSChris Mason } 4007e38180eSChris Mason 401d352ac68SChris Mason /* 402d352ac68SChris Mason * given a pointer into a directory item, delete it. This 403d352ac68SChris Mason * handles items that have more than one entry in them. 404d352ac68SChris Mason */ 4057e38180eSChris Mason int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans, 4067e38180eSChris Mason struct btrfs_root *root, 4077e38180eSChris Mason struct btrfs_path *path, 4087e38180eSChris Mason struct btrfs_dir_item *di) 4097e38180eSChris Mason { 4107e38180eSChris Mason 4115f39d397SChris Mason struct extent_buffer *leaf; 4127e38180eSChris Mason u32 sub_item_len; 4137e38180eSChris Mason u32 item_len; 41454aa1f4dSChris Mason int ret = 0; 4157e38180eSChris Mason 4165f39d397SChris Mason leaf = path->nodes[0]; 4175103e947SJosef Bacik sub_item_len = sizeof(*di) + btrfs_dir_name_len(leaf, di) + 4185103e947SJosef Bacik btrfs_dir_data_len(leaf, di); 4195f39d397SChris Mason item_len = btrfs_item_size_nr(leaf, path->slots[0]); 4205f39d397SChris Mason if (sub_item_len == item_len) { 4217e38180eSChris Mason ret = btrfs_del_item(trans, root, path); 4227e38180eSChris Mason } else { 4235f39d397SChris Mason /* MARKER */ 4245f39d397SChris Mason unsigned long ptr = (unsigned long)di; 4255f39d397SChris Mason unsigned long start; 4265f39d397SChris Mason 4275f39d397SChris Mason start = btrfs_item_ptr_offset(leaf, path->slots[0]); 4285f39d397SChris Mason memmove_extent_buffer(leaf, ptr, ptr + sub_item_len, 4297e38180eSChris Mason item_len - (ptr + sub_item_len - start)); 4307e38180eSChris Mason ret = btrfs_truncate_item(trans, root, path, 431179e29e4SChris Mason item_len - sub_item_len, 1); 4327e38180eSChris Mason } 433411fc6bcSAndi Kleen return ret; 4347e38180eSChris Mason } 43522a94d44SJosef Bacik 43622a94d44SJosef Bacik int verify_dir_item(struct btrfs_root *root, 43722a94d44SJosef Bacik struct extent_buffer *leaf, 43822a94d44SJosef Bacik struct btrfs_dir_item *dir_item) 43922a94d44SJosef Bacik { 44022a94d44SJosef Bacik u16 namelen = BTRFS_NAME_LEN; 44122a94d44SJosef Bacik u8 type = btrfs_dir_type(leaf, dir_item); 44222a94d44SJosef Bacik 44322a94d44SJosef Bacik if (type >= BTRFS_FT_MAX) { 44422a94d44SJosef Bacik printk(KERN_CRIT "btrfs: invalid dir item type: %d\n", 44522a94d44SJosef Bacik (int)type); 44622a94d44SJosef Bacik return 1; 44722a94d44SJosef Bacik } 44822a94d44SJosef Bacik 44922a94d44SJosef Bacik if (type == BTRFS_FT_XATTR) 45022a94d44SJosef Bacik namelen = XATTR_NAME_MAX; 45122a94d44SJosef Bacik 45222a94d44SJosef Bacik if (btrfs_dir_name_len(leaf, dir_item) > namelen) { 45322a94d44SJosef Bacik printk(KERN_CRIT "btrfS: invalid dir item name len: %u\n", 45422a94d44SJosef Bacik (unsigned)btrfs_dir_data_len(leaf, dir_item)); 45522a94d44SJosef Bacik return 1; 45622a94d44SJosef Bacik } 45722a94d44SJosef Bacik 45822a94d44SJosef Bacik /* BTRFS_MAX_XATTR_SIZE is the same for all dir items */ 45922a94d44SJosef Bacik if (btrfs_dir_data_len(leaf, dir_item) > BTRFS_MAX_XATTR_SIZE(root)) { 46022a94d44SJosef Bacik printk(KERN_CRIT "btrfs: invalid dir item data len: %u\n", 46122a94d44SJosef Bacik (unsigned)btrfs_dir_data_len(leaf, dir_item)); 46222a94d44SJosef Bacik return 1; 46322a94d44SJosef Bacik } 46422a94d44SJosef Bacik 46522a94d44SJosef Bacik return 0; 46622a94d44SJosef Bacik } 467