Commit | Line | Data |
---|---|---|
2e635a27 | 1 | #include <linux/module.h> |
62e2749e CM |
2 | #include "ctree.h" |
3 | #include "disk-io.h" | |
4 | #include "hash.h" | |
e089f05c | 5 | #include "transaction.h" |
62e2749e | 6 | |
7fcde0e3 CM |
7 | int insert_with_overflow(struct btrfs_trans_handle *trans, struct btrfs_root |
8 | *root, struct btrfs_path *path, struct btrfs_key | |
9 | *cpu_key, u32 data_size) | |
10 | { | |
11 | int overflow; | |
12 | int ret; | |
13 | ||
14 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); | |
15 | overflow = btrfs_key_overflow(cpu_key); | |
16 | ||
17 | while(ret == -EEXIST && overflow < BTRFS_KEY_OVERFLOW_MAX) { | |
18 | overflow++; | |
19 | btrfs_set_key_overflow(cpu_key, overflow); | |
20 | btrfs_release_path(root, path); | |
21 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, | |
22 | data_size); | |
23 | } | |
24 | return ret; | |
25 | } | |
26 | ||
e089f05c | 27 | int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root |
d6e4a428 CM |
28 | *root, const char *name, int name_len, u64 dir, |
29 | struct btrfs_key *location, u8 type) | |
62e2749e CM |
30 | { |
31 | int ret = 0; | |
5caf2a00 | 32 | struct btrfs_path *path; |
62e2749e CM |
33 | struct btrfs_dir_item *dir_item; |
34 | char *name_ptr; | |
35 | struct btrfs_key key; | |
36 | u32 data_size; | |
37 | ||
38 | key.objectid = dir; | |
39 | key.flags = 0; | |
1d4f6404 | 40 | btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY); |
e20d96d6 | 41 | ret = btrfs_name_hash(name, name_len, &key.offset); |
62e2749e | 42 | BUG_ON(ret); |
5caf2a00 CM |
43 | path = btrfs_alloc_path(); |
44 | btrfs_init_path(path); | |
62e2749e | 45 | data_size = sizeof(*dir_item) + name_len; |
7fcde0e3 | 46 | ret = insert_with_overflow(trans, root, path, &key, data_size); |
62e2749e CM |
47 | if (ret) |
48 | goto out; | |
49 | ||
5caf2a00 CM |
50 | dir_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), |
51 | path->slots[0], | |
62e2749e | 52 | struct btrfs_dir_item); |
d6e4a428 | 53 | btrfs_cpu_key_to_disk(&dir_item->location, location); |
62e2749e CM |
54 | btrfs_set_dir_type(dir_item, type); |
55 | btrfs_set_dir_flags(dir_item, 0); | |
a8a2ee0c | 56 | btrfs_set_dir_name_len(dir_item, name_len); |
62e2749e | 57 | name_ptr = (char *)(dir_item + 1); |
c5739bba CM |
58 | |
59 | btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len); | |
60 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
62e2749e | 61 | out: |
5caf2a00 CM |
62 | btrfs_release_path(root, path); |
63 | btrfs_free_path(path); | |
62e2749e CM |
64 | return ret; |
65 | } | |
66 | ||
e089f05c | 67 | int btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root |
e20d96d6 CM |
68 | *root, struct btrfs_path *path, u64 dir, |
69 | const char *name, int name_len, int mod) | |
62e2749e | 70 | { |
1d4f6404 | 71 | int ret; |
62e2749e | 72 | struct btrfs_key key; |
1d4f6404 CM |
73 | int ins_len = mod < 0 ? -1 : 0; |
74 | int cow = mod != 0; | |
7fcde0e3 CM |
75 | struct btrfs_disk_key *found_key; |
76 | struct btrfs_leaf *leaf; | |
5be6f7f1 | 77 | u32 overflow; |
62e2749e CM |
78 | |
79 | key.objectid = dir; | |
80 | key.flags = 0; | |
1d4f6404 | 81 | btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY); |
70b2befd | 82 | // btrfs_set_key_overflow(&key, BTRFS_KEY_OVERFLOW_MAX - 1); |
62e2749e CM |
83 | ret = btrfs_name_hash(name, name_len, &key.offset); |
84 | BUG_ON(ret); | |
7fcde0e3 CM |
85 | while(1) { |
86 | ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); | |
87 | if (ret < 0) | |
88 | return ret; | |
89 | if (ret > 0) { | |
90 | if (path->slots[0] == 0) | |
91 | return 1; | |
92 | path->slots[0]--; | |
93 | } | |
94 | leaf = btrfs_buffer_leaf(path->nodes[0]); | |
95 | found_key = &leaf->items[path->slots[0]].key; | |
96 | ||
97 | if (btrfs_disk_key_objectid(found_key) != dir || | |
98 | btrfs_disk_key_type(found_key) != BTRFS_DIR_ITEM_KEY || | |
99 | btrfs_disk_key_offset(found_key) != key.offset) | |
100 | return 1; | |
101 | ||
102 | if (btrfs_match_dir_item_name(root, path, name, name_len)) | |
103 | return 0; | |
104 | ||
5be6f7f1 CM |
105 | overflow = btrfs_disk_key_overflow(found_key); |
106 | if (overflow == 0) | |
7fcde0e3 | 107 | return 1; |
5be6f7f1 | 108 | btrfs_set_key_overflow(&key, overflow - 1); |
7fcde0e3 CM |
109 | btrfs_release_path(root, path); |
110 | } | |
111 | return 1; | |
62e2749e CM |
112 | } |
113 | ||
e089f05c | 114 | int btrfs_match_dir_item_name(struct btrfs_root *root, |
7f5c1516 CM |
115 | struct btrfs_path *path, |
116 | const char *name, int name_len) | |
62e2749e | 117 | { |
62e2749e CM |
118 | struct btrfs_dir_item *dir_item; |
119 | char *name_ptr; | |
a8a2ee0c | 120 | |
e20d96d6 CM |
121 | dir_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), |
122 | path->slots[0], | |
1d4f6404 | 123 | struct btrfs_dir_item); |
a8a2ee0c CM |
124 | if (btrfs_dir_name_len(dir_item) != name_len) |
125 | return 0; | |
62e2749e | 126 | name_ptr = (char *)(dir_item + 1); |
a8a2ee0c | 127 | if (memcmp(name_ptr, name, name_len)) |
1d4f6404 | 128 | return 0; |
1d4f6404 | 129 | return 1; |
62e2749e | 130 | } |