]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Copyright (C) 2007 Oracle. All rights reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
18 | ||
19 | #ifndef __BTRFS_CTREE__ | |
20 | #define __BTRFS_CTREE__ | |
21 | ||
22 | #include <linux/mm.h> | |
23 | #include <linux/highmem.h> | |
24 | #include <linux/fs.h> | |
25 | #include <linux/rwsem.h> | |
26 | #include <linux/completion.h> | |
27 | #include <linux/backing-dev.h> | |
28 | #include <linux/wait.h> | |
29 | #include <linux/slab.h> | |
30 | #include <linux/kobject.h> | |
31 | #include <trace/events/btrfs.h> | |
32 | #include <asm/kmap_types.h> | |
33 | #include <linux/pagemap.h> | |
34 | #include "extent_io.h" | |
35 | #include "extent_map.h" | |
36 | #include "async-thread.h" | |
37 | #include "ioctl.h" | |
38 | ||
39 | struct btrfs_trans_handle; | |
40 | struct btrfs_transaction; | |
41 | struct btrfs_pending_snapshot; | |
42 | extern struct kmem_cache *btrfs_trans_handle_cachep; | |
43 | extern struct kmem_cache *btrfs_transaction_cachep; | |
44 | extern struct kmem_cache *btrfs_bit_radix_cachep; | |
45 | extern struct kmem_cache *btrfs_path_cachep; | |
46 | extern struct kmem_cache *btrfs_free_space_cachep; | |
47 | struct btrfs_ordered_sum; | |
48 | ||
49 | #define BTRFS_MAGIC "_BHRfS_M" | |
50 | ||
51 | #define BTRFS_MAX_MIRRORS 2 | |
52 | ||
53 | #define BTRFS_MAX_LEVEL 8 | |
54 | ||
55 | #define BTRFS_COMPAT_EXTENT_TREE_V0 | |
56 | ||
57 | /* | |
58 | * files bigger than this get some pre-flushing when they are added | |
59 | * to the ordered operations list. That way we limit the total | |
60 | * work done by the commit | |
61 | */ | |
62 | #define BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT (8 * 1024 * 1024) | |
63 | ||
64 | /* holds pointers to all of the tree roots */ | |
65 | #define BTRFS_ROOT_TREE_OBJECTID 1ULL | |
66 | ||
67 | /* stores information about which extents are in use, and reference counts */ | |
68 | #define BTRFS_EXTENT_TREE_OBJECTID 2ULL | |
69 | ||
70 | /* | |
71 | * chunk tree stores translations from logical -> physical block numbering | |
72 | * the super block points to the chunk tree | |
73 | */ | |
74 | #define BTRFS_CHUNK_TREE_OBJECTID 3ULL | |
75 | ||
76 | /* | |
77 | * stores information about which areas of a given device are in use. | |
78 | * one per device. The tree of tree roots points to the device tree | |
79 | */ | |
80 | #define BTRFS_DEV_TREE_OBJECTID 4ULL | |
81 | ||
82 | /* one per subvolume, storing files and directories */ | |
83 | #define BTRFS_FS_TREE_OBJECTID 5ULL | |
84 | ||
85 | /* directory objectid inside the root tree */ | |
86 | #define BTRFS_ROOT_TREE_DIR_OBJECTID 6ULL | |
87 | ||
88 | /* holds checksums of all the data extents */ | |
89 | #define BTRFS_CSUM_TREE_OBJECTID 7ULL | |
90 | ||
91 | /* for storing balance parameters in the root tree */ | |
92 | #define BTRFS_BALANCE_OBJECTID -4ULL | |
93 | ||
94 | /* orhpan objectid for tracking unlinked/truncated files */ | |
95 | #define BTRFS_ORPHAN_OBJECTID -5ULL | |
96 | ||
97 | /* does write ahead logging to speed up fsyncs */ | |
98 | #define BTRFS_TREE_LOG_OBJECTID -6ULL | |
99 | #define BTRFS_TREE_LOG_FIXUP_OBJECTID -7ULL | |
100 | ||
101 | /* for space balancing */ | |
102 | #define BTRFS_TREE_RELOC_OBJECTID -8ULL | |
103 | #define BTRFS_DATA_RELOC_TREE_OBJECTID -9ULL | |
104 | ||
105 | /* | |
106 | * extent checksums all have this objectid | |
107 | * this allows them to share the logging tree | |
108 | * for fsyncs | |
109 | */ | |
110 | #define BTRFS_EXTENT_CSUM_OBJECTID -10ULL | |
111 | ||
112 | /* For storing free space cache */ | |
113 | #define BTRFS_FREE_SPACE_OBJECTID -11ULL | |
114 | ||
115 | /* | |
116 | * The inode number assigned to the special inode for sotring | |
117 | * free ino cache | |
118 | */ | |
119 | #define BTRFS_FREE_INO_OBJECTID -12ULL | |
120 | ||
121 | /* dummy objectid represents multiple objectids */ | |
122 | #define BTRFS_MULTIPLE_OBJECTIDS -255ULL | |
123 | ||
124 | /* | |
125 | * All files have objectids in this range. | |
126 | */ | |
127 | #define BTRFS_FIRST_FREE_OBJECTID 256ULL | |
128 | #define BTRFS_LAST_FREE_OBJECTID -256ULL | |
129 | #define BTRFS_FIRST_CHUNK_TREE_OBJECTID 256ULL | |
130 | ||
131 | ||
132 | /* | |
133 | * the device items go into the chunk tree. The key is in the form | |
134 | * [ 1 BTRFS_DEV_ITEM_KEY device_id ] | |
135 | */ | |
136 | #define BTRFS_DEV_ITEMS_OBJECTID 1ULL | |
137 | ||
138 | #define BTRFS_BTREE_INODE_OBJECTID 1 | |
139 | ||
140 | #define BTRFS_EMPTY_SUBVOL_DIR_OBJECTID 2 | |
141 | ||
142 | /* | |
143 | * the max metadata block size. This limit is somewhat artificial, | |
144 | * but the memmove costs go through the roof for larger blocks. | |
145 | */ | |
146 | #define BTRFS_MAX_METADATA_BLOCKSIZE 65536 | |
147 | ||
148 | /* | |
149 | * we can actually store much bigger names, but lets not confuse the rest | |
150 | * of linux | |
151 | */ | |
152 | #define BTRFS_NAME_LEN 255 | |
153 | ||
154 | /* 32 bytes in various csum fields */ | |
155 | #define BTRFS_CSUM_SIZE 32 | |
156 | ||
157 | /* csum types */ | |
158 | #define BTRFS_CSUM_TYPE_CRC32 0 | |
159 | ||
160 | static int btrfs_csum_sizes[] = { 4, 0 }; | |
161 | ||
162 | /* four bytes for CRC32 */ | |
163 | #define BTRFS_EMPTY_DIR_SIZE 0 | |
164 | ||
165 | #define BTRFS_FT_UNKNOWN 0 | |
166 | #define BTRFS_FT_REG_FILE 1 | |
167 | #define BTRFS_FT_DIR 2 | |
168 | #define BTRFS_FT_CHRDEV 3 | |
169 | #define BTRFS_FT_BLKDEV 4 | |
170 | #define BTRFS_FT_FIFO 5 | |
171 | #define BTRFS_FT_SOCK 6 | |
172 | #define BTRFS_FT_SYMLINK 7 | |
173 | #define BTRFS_FT_XATTR 8 | |
174 | #define BTRFS_FT_MAX 9 | |
175 | ||
176 | /* | |
177 | * The key defines the order in the tree, and so it also defines (optimal) | |
178 | * block layout. | |
179 | * | |
180 | * objectid corresponds to the inode number. | |
181 | * | |
182 | * type tells us things about the object, and is a kind of stream selector. | |
183 | * so for a given inode, keys with type of 1 might refer to the inode data, | |
184 | * type of 2 may point to file data in the btree and type == 3 may point to | |
185 | * extents. | |
186 | * | |
187 | * offset is the starting byte offset for this key in the stream. | |
188 | * | |
189 | * btrfs_disk_key is in disk byte order. struct btrfs_key is always | |
190 | * in cpu native order. Otherwise they are identical and their sizes | |
191 | * should be the same (ie both packed) | |
192 | */ | |
193 | struct btrfs_disk_key { | |
194 | __le64 objectid; | |
195 | u8 type; | |
196 | __le64 offset; | |
197 | } __attribute__ ((__packed__)); | |
198 | ||
199 | struct btrfs_key { | |
200 | u64 objectid; | |
201 | u8 type; | |
202 | u64 offset; | |
203 | } __attribute__ ((__packed__)); | |
204 | ||
205 | struct btrfs_mapping_tree { | |
206 | struct extent_map_tree map_tree; | |
207 | }; | |
208 | ||
209 | struct btrfs_dev_item { | |
210 | /* the internal btrfs device id */ | |
211 | __le64 devid; | |
212 | ||
213 | /* size of the device */ | |
214 | __le64 total_bytes; | |
215 | ||
216 | /* bytes used */ | |
217 | __le64 bytes_used; | |
218 | ||
219 | /* optimal io alignment for this device */ | |
220 | __le32 io_align; | |
221 | ||
222 | /* optimal io width for this device */ | |
223 | __le32 io_width; | |
224 | ||
225 | /* minimal io size for this device */ | |
226 | __le32 sector_size; | |
227 | ||
228 | /* type and info about this device */ | |
229 | __le64 type; | |
230 | ||
231 | /* expected generation for this device */ | |
232 | __le64 generation; | |
233 | ||
234 | /* | |
235 | * starting byte of this partition on the device, | |
236 | * to allow for stripe alignment in the future | |
237 | */ | |
238 | __le64 start_offset; | |
239 | ||
240 | /* grouping information for allocation decisions */ | |
241 | __le32 dev_group; | |
242 | ||
243 | /* seek speed 0-100 where 100 is fastest */ | |
244 | u8 seek_speed; | |
245 | ||
246 | /* bandwidth 0-100 where 100 is fastest */ | |
247 | u8 bandwidth; | |
248 | ||
249 | /* btrfs generated uuid for this device */ | |
250 | u8 uuid[BTRFS_UUID_SIZE]; | |
251 | ||
252 | /* uuid of FS who owns this device */ | |
253 | u8 fsid[BTRFS_UUID_SIZE]; | |
254 | } __attribute__ ((__packed__)); | |
255 | ||
256 | struct btrfs_stripe { | |
257 | __le64 devid; | |
258 | __le64 offset; | |
259 | u8 dev_uuid[BTRFS_UUID_SIZE]; | |
260 | } __attribute__ ((__packed__)); | |
261 | ||
262 | struct btrfs_chunk { | |
263 | /* size of this chunk in bytes */ | |
264 | __le64 length; | |
265 | ||
266 | /* objectid of the root referencing this chunk */ | |
267 | __le64 owner; | |
268 | ||
269 | __le64 stripe_len; | |
270 | __le64 type; | |
271 | ||
272 | /* optimal io alignment for this chunk */ | |
273 | __le32 io_align; | |
274 | ||
275 | /* optimal io width for this chunk */ | |
276 | __le32 io_width; | |
277 | ||
278 | /* minimal io size for this chunk */ | |
279 | __le32 sector_size; | |
280 | ||
281 | /* 2^16 stripes is quite a lot, a second limit is the size of a single | |
282 | * item in the btree | |
283 | */ | |
284 | __le16 num_stripes; | |
285 | ||
286 | /* sub stripes only matter for raid10 */ | |
287 | __le16 sub_stripes; | |
288 | struct btrfs_stripe stripe; | |
289 | /* additional stripes go here */ | |
290 | } __attribute__ ((__packed__)); | |
291 | ||
292 | #define BTRFS_FREE_SPACE_EXTENT 1 | |
293 | #define BTRFS_FREE_SPACE_BITMAP 2 | |
294 | ||
295 | struct btrfs_free_space_entry { | |
296 | __le64 offset; | |
297 | __le64 bytes; | |
298 | u8 type; | |
299 | } __attribute__ ((__packed__)); | |
300 | ||
301 | struct btrfs_free_space_header { | |
302 | struct btrfs_disk_key location; | |
303 | __le64 generation; | |
304 | __le64 num_entries; | |
305 | __le64 num_bitmaps; | |
306 | } __attribute__ ((__packed__)); | |
307 | ||
308 | static inline unsigned long btrfs_chunk_item_size(int num_stripes) | |
309 | { | |
310 | BUG_ON(num_stripes == 0); | |
311 | return sizeof(struct btrfs_chunk) + | |
312 | sizeof(struct btrfs_stripe) * (num_stripes - 1); | |
313 | } | |
314 | ||
315 | #define BTRFS_HEADER_FLAG_WRITTEN (1ULL << 0) | |
316 | #define BTRFS_HEADER_FLAG_RELOC (1ULL << 1) | |
317 | ||
318 | /* | |
319 | * File system states | |
320 | */ | |
321 | ||
322 | /* Errors detected */ | |
323 | #define BTRFS_SUPER_FLAG_ERROR (1ULL << 2) | |
324 | ||
325 | #define BTRFS_SUPER_FLAG_SEEDING (1ULL << 32) | |
326 | #define BTRFS_SUPER_FLAG_METADUMP (1ULL << 33) | |
327 | ||
328 | #define BTRFS_BACKREF_REV_MAX 256 | |
329 | #define BTRFS_BACKREF_REV_SHIFT 56 | |
330 | #define BTRFS_BACKREF_REV_MASK (((u64)BTRFS_BACKREF_REV_MAX - 1) << \ | |
331 | BTRFS_BACKREF_REV_SHIFT) | |
332 | ||
333 | #define BTRFS_OLD_BACKREF_REV 0 | |
334 | #define BTRFS_MIXED_BACKREF_REV 1 | |
335 | ||
336 | /* | |
337 | * every tree block (leaf or node) starts with this header. | |
338 | */ | |
339 | struct btrfs_header { | |
340 | /* these first four must match the super block */ | |
341 | u8 csum[BTRFS_CSUM_SIZE]; | |
342 | u8 fsid[BTRFS_FSID_SIZE]; /* FS specific uuid */ | |
343 | __le64 bytenr; /* which block this node is supposed to live in */ | |
344 | __le64 flags; | |
345 | ||
346 | /* allowed to be different from the super from here on down */ | |
347 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; | |
348 | __le64 generation; | |
349 | __le64 owner; | |
350 | __le32 nritems; | |
351 | u8 level; | |
352 | } __attribute__ ((__packed__)); | |
353 | ||
354 | #define BTRFS_NODEPTRS_PER_BLOCK(r) (((r)->nodesize - \ | |
355 | sizeof(struct btrfs_header)) / \ | |
356 | sizeof(struct btrfs_key_ptr)) | |
357 | #define __BTRFS_LEAF_DATA_SIZE(bs) ((bs) - sizeof(struct btrfs_header)) | |
358 | #define BTRFS_LEAF_DATA_SIZE(r) (__BTRFS_LEAF_DATA_SIZE(r->leafsize)) | |
359 | #define BTRFS_MAX_INLINE_DATA_SIZE(r) (BTRFS_LEAF_DATA_SIZE(r) - \ | |
360 | sizeof(struct btrfs_item) - \ | |
361 | sizeof(struct btrfs_file_extent_item)) | |
362 | #define BTRFS_MAX_XATTR_SIZE(r) (BTRFS_LEAF_DATA_SIZE(r) - \ | |
363 | sizeof(struct btrfs_item) -\ | |
364 | sizeof(struct btrfs_dir_item)) | |
365 | ||
366 | ||
367 | /* | |
368 | * this is a very generous portion of the super block, giving us | |
369 | * room to translate 14 chunks with 3 stripes each. | |
370 | */ | |
371 | #define BTRFS_SYSTEM_CHUNK_ARRAY_SIZE 2048 | |
372 | #define BTRFS_LABEL_SIZE 256 | |
373 | ||
374 | /* | |
375 | * just in case we somehow lose the roots and are not able to mount, | |
376 | * we store an array of the roots from previous transactions | |
377 | * in the super. | |
378 | */ | |
379 | #define BTRFS_NUM_BACKUP_ROOTS 4 | |
380 | struct btrfs_root_backup { | |
381 | __le64 tree_root; | |
382 | __le64 tree_root_gen; | |
383 | ||
384 | __le64 chunk_root; | |
385 | __le64 chunk_root_gen; | |
386 | ||
387 | __le64 extent_root; | |
388 | __le64 extent_root_gen; | |
389 | ||
390 | __le64 fs_root; | |
391 | __le64 fs_root_gen; | |
392 | ||
393 | __le64 dev_root; | |
394 | __le64 dev_root_gen; | |
395 | ||
396 | __le64 csum_root; | |
397 | __le64 csum_root_gen; | |
398 | ||
399 | __le64 total_bytes; | |
400 | __le64 bytes_used; | |
401 | __le64 num_devices; | |
402 | /* future */ | |
403 | __le64 unsed_64[4]; | |
404 | ||
405 | u8 tree_root_level; | |
406 | u8 chunk_root_level; | |
407 | u8 extent_root_level; | |
408 | u8 fs_root_level; | |
409 | u8 dev_root_level; | |
410 | u8 csum_root_level; | |
411 | /* future and to align */ | |
412 | u8 unused_8[10]; | |
413 | } __attribute__ ((__packed__)); | |
414 | ||
415 | /* | |
416 | * the super block basically lists the main trees of the FS | |
417 | * it currently lacks any block count etc etc | |
418 | */ | |
419 | struct btrfs_super_block { | |
420 | u8 csum[BTRFS_CSUM_SIZE]; | |
421 | /* the first 4 fields must match struct btrfs_header */ | |
422 | u8 fsid[BTRFS_FSID_SIZE]; /* FS specific uuid */ | |
423 | __le64 bytenr; /* this block number */ | |
424 | __le64 flags; | |
425 | ||
426 | /* allowed to be different from the btrfs_header from here own down */ | |
427 | __le64 magic; | |
428 | __le64 generation; | |
429 | __le64 root; | |
430 | __le64 chunk_root; | |
431 | __le64 log_root; | |
432 | ||
433 | /* this will help find the new super based on the log root */ | |
434 | __le64 log_root_transid; | |
435 | __le64 total_bytes; | |
436 | __le64 bytes_used; | |
437 | __le64 root_dir_objectid; | |
438 | __le64 num_devices; | |
439 | __le32 sectorsize; | |
440 | __le32 nodesize; | |
441 | __le32 leafsize; | |
442 | __le32 stripesize; | |
443 | __le32 sys_chunk_array_size; | |
444 | __le64 chunk_root_generation; | |
445 | __le64 compat_flags; | |
446 | __le64 compat_ro_flags; | |
447 | __le64 incompat_flags; | |
448 | __le16 csum_type; | |
449 | u8 root_level; | |
450 | u8 chunk_root_level; | |
451 | u8 log_root_level; | |
452 | struct btrfs_dev_item dev_item; | |
453 | ||
454 | char label[BTRFS_LABEL_SIZE]; | |
455 | ||
456 | __le64 cache_generation; | |
457 | ||
458 | /* future expansion */ | |
459 | __le64 reserved[31]; | |
460 | u8 sys_chunk_array[BTRFS_SYSTEM_CHUNK_ARRAY_SIZE]; | |
461 | struct btrfs_root_backup super_roots[BTRFS_NUM_BACKUP_ROOTS]; | |
462 | } __attribute__ ((__packed__)); | |
463 | ||
464 | /* | |
465 | * Compat flags that we support. If any incompat flags are set other than the | |
466 | * ones specified below then we will fail to mount | |
467 | */ | |
468 | #define BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF (1ULL << 0) | |
469 | #define BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL (1ULL << 1) | |
470 | #define BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS (1ULL << 2) | |
471 | #define BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO (1ULL << 3) | |
472 | /* | |
473 | * some patches floated around with a second compression method | |
474 | * lets save that incompat here for when they do get in | |
475 | * Note we don't actually support it, we're just reserving the | |
476 | * number | |
477 | */ | |
478 | #define BTRFS_FEATURE_INCOMPAT_COMPRESS_LZOv2 (1ULL << 4) | |
479 | ||
480 | /* | |
481 | * older kernels tried to do bigger metadata blocks, but the | |
482 | * code was pretty buggy. Lets not let them try anymore. | |
483 | */ | |
484 | #define BTRFS_FEATURE_INCOMPAT_BIG_METADATA (1ULL << 5) | |
485 | ||
486 | #define BTRFS_FEATURE_COMPAT_SUPP 0ULL | |
487 | #define BTRFS_FEATURE_COMPAT_RO_SUPP 0ULL | |
488 | #define BTRFS_FEATURE_INCOMPAT_SUPP \ | |
489 | (BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF | \ | |
490 | BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL | \ | |
491 | BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS | \ | |
492 | BTRFS_FEATURE_INCOMPAT_BIG_METADATA | \ | |
493 | BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO) | |
494 | ||
495 | /* | |
496 | * A leaf is full of items. offset and size tell us where to find | |
497 | * the item in the leaf (relative to the start of the data area) | |
498 | */ | |
499 | struct btrfs_item { | |
500 | struct btrfs_disk_key key; | |
501 | __le32 offset; | |
502 | __le32 size; | |
503 | } __attribute__ ((__packed__)); | |
504 | ||
505 | /* | |
506 | * leaves have an item area and a data area: | |
507 | * [item0, item1....itemN] [free space] [dataN...data1, data0] | |
508 | * | |
509 | * The data is separate from the items to get the keys closer together | |
510 | * during searches. | |
511 | */ | |
512 | struct btrfs_leaf { | |
513 | struct btrfs_header header; | |
514 | struct btrfs_item items[]; | |
515 | } __attribute__ ((__packed__)); | |
516 | ||
517 | /* | |
518 | * all non-leaf blocks are nodes, they hold only keys and pointers to | |
519 | * other blocks | |
520 | */ | |
521 | struct btrfs_key_ptr { | |
522 | struct btrfs_disk_key key; | |
523 | __le64 blockptr; | |
524 | __le64 generation; | |
525 | } __attribute__ ((__packed__)); | |
526 | ||
527 | struct btrfs_node { | |
528 | struct btrfs_header header; | |
529 | struct btrfs_key_ptr ptrs[]; | |
530 | } __attribute__ ((__packed__)); | |
531 | ||
532 | /* | |
533 | * btrfs_paths remember the path taken from the root down to the leaf. | |
534 | * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point | |
535 | * to any other levels that are present. | |
536 | * | |
537 | * The slots array records the index of the item or block pointer | |
538 | * used while walking the tree. | |
539 | */ | |
540 | struct btrfs_path { | |
541 | struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; | |
542 | int slots[BTRFS_MAX_LEVEL]; | |
543 | /* if there is real range locking, this locks field will change */ | |
544 | int locks[BTRFS_MAX_LEVEL]; | |
545 | int reada; | |
546 | /* keep some upper locks as we walk down */ | |
547 | int lowest_level; | |
548 | ||
549 | /* | |
550 | * set by btrfs_split_item, tells search_slot to keep all locks | |
551 | * and to force calls to keep space in the nodes | |
552 | */ | |
553 | unsigned int search_for_split:1; | |
554 | unsigned int keep_locks:1; | |
555 | unsigned int skip_locking:1; | |
556 | unsigned int leave_spinning:1; | |
557 | unsigned int search_commit_root:1; | |
558 | }; | |
559 | ||
560 | /* | |
561 | * items in the extent btree are used to record the objectid of the | |
562 | * owner of the block and the number of references | |
563 | */ | |
564 | ||
565 | struct btrfs_extent_item { | |
566 | __le64 refs; | |
567 | __le64 generation; | |
568 | __le64 flags; | |
569 | } __attribute__ ((__packed__)); | |
570 | ||
571 | struct btrfs_extent_item_v0 { | |
572 | __le32 refs; | |
573 | } __attribute__ ((__packed__)); | |
574 | ||
575 | #define BTRFS_MAX_EXTENT_ITEM_SIZE(r) ((BTRFS_LEAF_DATA_SIZE(r) >> 4) - \ | |
576 | sizeof(struct btrfs_item)) | |
577 | ||
578 | #define BTRFS_EXTENT_FLAG_DATA (1ULL << 0) | |
579 | #define BTRFS_EXTENT_FLAG_TREE_BLOCK (1ULL << 1) | |
580 | ||
581 | /* following flags only apply to tree blocks */ | |
582 | ||
583 | /* use full backrefs for extent pointers in the block */ | |
584 | #define BTRFS_BLOCK_FLAG_FULL_BACKREF (1ULL << 8) | |
585 | ||
586 | /* | |
587 | * this flag is only used internally by scrub and may be changed at any time | |
588 | * it is only declared here to avoid collisions | |
589 | */ | |
590 | #define BTRFS_EXTENT_FLAG_SUPER (1ULL << 48) | |
591 | ||
592 | struct btrfs_tree_block_info { | |
593 | struct btrfs_disk_key key; | |
594 | u8 level; | |
595 | } __attribute__ ((__packed__)); | |
596 | ||
597 | struct btrfs_extent_data_ref { | |
598 | __le64 root; | |
599 | __le64 objectid; | |
600 | __le64 offset; | |
601 | __le32 count; | |
602 | } __attribute__ ((__packed__)); | |
603 | ||
604 | struct btrfs_shared_data_ref { | |
605 | __le32 count; | |
606 | } __attribute__ ((__packed__)); | |
607 | ||
608 | struct btrfs_extent_inline_ref { | |
609 | u8 type; | |
610 | __le64 offset; | |
611 | } __attribute__ ((__packed__)); | |
612 | ||
613 | /* old style backrefs item */ | |
614 | struct btrfs_extent_ref_v0 { | |
615 | __le64 root; | |
616 | __le64 generation; | |
617 | __le64 objectid; | |
618 | __le32 count; | |
619 | } __attribute__ ((__packed__)); | |
620 | ||
621 | ||
622 | /* dev extents record free space on individual devices. The owner | |
623 | * field points back to the chunk allocation mapping tree that allocated | |
624 | * the extent. The chunk tree uuid field is a way to double check the owner | |
625 | */ | |
626 | struct btrfs_dev_extent { | |
627 | __le64 chunk_tree; | |
628 | __le64 chunk_objectid; | |
629 | __le64 chunk_offset; | |
630 | __le64 length; | |
631 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; | |
632 | } __attribute__ ((__packed__)); | |
633 | ||
634 | struct btrfs_inode_ref { | |
635 | __le64 index; | |
636 | __le16 name_len; | |
637 | /* name goes here */ | |
638 | } __attribute__ ((__packed__)); | |
639 | ||
640 | struct btrfs_timespec { | |
641 | __le64 sec; | |
642 | __le32 nsec; | |
643 | } __attribute__ ((__packed__)); | |
644 | ||
645 | enum btrfs_compression_type { | |
646 | BTRFS_COMPRESS_NONE = 0, | |
647 | BTRFS_COMPRESS_ZLIB = 1, | |
648 | BTRFS_COMPRESS_LZO = 2, | |
649 | BTRFS_COMPRESS_TYPES = 2, | |
650 | BTRFS_COMPRESS_LAST = 3, | |
651 | }; | |
652 | ||
653 | struct btrfs_inode_item { | |
654 | /* nfs style generation number */ | |
655 | __le64 generation; | |
656 | /* transid that last touched this inode */ | |
657 | __le64 transid; | |
658 | __le64 size; | |
659 | __le64 nbytes; | |
660 | __le64 block_group; | |
661 | __le32 nlink; | |
662 | __le32 uid; | |
663 | __le32 gid; | |
664 | __le32 mode; | |
665 | __le64 rdev; | |
666 | __le64 flags; | |
667 | ||
668 | /* modification sequence number for NFS */ | |
669 | __le64 sequence; | |
670 | ||
671 | /* | |
672 | * a little future expansion, for more than this we can | |
673 | * just grow the inode item and version it | |
674 | */ | |
675 | __le64 reserved[4]; | |
676 | struct btrfs_timespec atime; | |
677 | struct btrfs_timespec ctime; | |
678 | struct btrfs_timespec mtime; | |
679 | struct btrfs_timespec otime; | |
680 | } __attribute__ ((__packed__)); | |
681 | ||
682 | struct btrfs_dir_log_item { | |
683 | __le64 end; | |
684 | } __attribute__ ((__packed__)); | |
685 | ||
686 | struct btrfs_dir_item { | |
687 | struct btrfs_disk_key location; | |
688 | __le64 transid; | |
689 | __le16 data_len; | |
690 | __le16 name_len; | |
691 | u8 type; | |
692 | } __attribute__ ((__packed__)); | |
693 | ||
694 | #define BTRFS_ROOT_SUBVOL_RDONLY (1ULL << 0) | |
695 | ||
696 | struct btrfs_root_item { | |
697 | struct btrfs_inode_item inode; | |
698 | __le64 generation; | |
699 | __le64 root_dirid; | |
700 | __le64 bytenr; | |
701 | __le64 byte_limit; | |
702 | __le64 bytes_used; | |
703 | __le64 last_snapshot; | |
704 | __le64 flags; | |
705 | __le32 refs; | |
706 | struct btrfs_disk_key drop_progress; | |
707 | u8 drop_level; | |
708 | u8 level; | |
709 | } __attribute__ ((__packed__)); | |
710 | ||
711 | /* | |
712 | * this is used for both forward and backward root refs | |
713 | */ | |
714 | struct btrfs_root_ref { | |
715 | __le64 dirid; | |
716 | __le64 sequence; | |
717 | __le16 name_len; | |
718 | } __attribute__ ((__packed__)); | |
719 | ||
720 | struct btrfs_disk_balance_args { | |
721 | /* | |
722 | * profiles to operate on, single is denoted by | |
723 | * BTRFS_AVAIL_ALLOC_BIT_SINGLE | |
724 | */ | |
725 | __le64 profiles; | |
726 | ||
727 | /* usage filter */ | |
728 | __le64 usage; | |
729 | ||
730 | /* devid filter */ | |
731 | __le64 devid; | |
732 | ||
733 | /* devid subset filter [pstart..pend) */ | |
734 | __le64 pstart; | |
735 | __le64 pend; | |
736 | ||
737 | /* btrfs virtual address space subset filter [vstart..vend) */ | |
738 | __le64 vstart; | |
739 | __le64 vend; | |
740 | ||
741 | /* | |
742 | * profile to convert to, single is denoted by | |
743 | * BTRFS_AVAIL_ALLOC_BIT_SINGLE | |
744 | */ | |
745 | __le64 target; | |
746 | ||
747 | /* BTRFS_BALANCE_ARGS_* */ | |
748 | __le64 flags; | |
749 | ||
750 | __le64 unused[8]; | |
751 | } __attribute__ ((__packed__)); | |
752 | ||
753 | /* | |
754 | * store balance parameters to disk so that balance can be properly | |
755 | * resumed after crash or unmount | |
756 | */ | |
757 | struct btrfs_balance_item { | |
758 | /* BTRFS_BALANCE_* */ | |
759 | __le64 flags; | |
760 | ||
761 | struct btrfs_disk_balance_args data; | |
762 | struct btrfs_disk_balance_args meta; | |
763 | struct btrfs_disk_balance_args sys; | |
764 | ||
765 | __le64 unused[4]; | |
766 | } __attribute__ ((__packed__)); | |
767 | ||
768 | #define BTRFS_FILE_EXTENT_INLINE 0 | |
769 | #define BTRFS_FILE_EXTENT_REG 1 | |
770 | #define BTRFS_FILE_EXTENT_PREALLOC 2 | |
771 | ||
772 | struct btrfs_file_extent_item { | |
773 | /* | |
774 | * transaction id that created this extent | |
775 | */ | |
776 | __le64 generation; | |
777 | /* | |
778 | * max number of bytes to hold this extent in ram | |
779 | * when we split a compressed extent we can't know how big | |
780 | * each of the resulting pieces will be. So, this is | |
781 | * an upper limit on the size of the extent in ram instead of | |
782 | * an exact limit. | |
783 | */ | |
784 | __le64 ram_bytes; | |
785 | ||
786 | /* | |
787 | * 32 bits for the various ways we might encode the data, | |
788 | * including compression and encryption. If any of these | |
789 | * are set to something a given disk format doesn't understand | |
790 | * it is treated like an incompat flag for reading and writing, | |
791 | * but not for stat. | |
792 | */ | |
793 | u8 compression; | |
794 | u8 encryption; | |
795 | __le16 other_encoding; /* spare for later use */ | |
796 | ||
797 | /* are we inline data or a real extent? */ | |
798 | u8 type; | |
799 | ||
800 | /* | |
801 | * disk space consumed by the extent, checksum blocks are included | |
802 | * in these numbers | |
803 | */ | |
804 | __le64 disk_bytenr; | |
805 | __le64 disk_num_bytes; | |
806 | /* | |
807 | * the logical offset in file blocks (no csums) | |
808 | * this extent record is for. This allows a file extent to point | |
809 | * into the middle of an existing extent on disk, sharing it | |
810 | * between two snapshots (useful if some bytes in the middle of the | |
811 | * extent have changed | |
812 | */ | |
813 | __le64 offset; | |
814 | /* | |
815 | * the logical number of file blocks (no csums included). This | |
816 | * always reflects the size uncompressed and without encoding. | |
817 | */ | |
818 | __le64 num_bytes; | |
819 | ||
820 | } __attribute__ ((__packed__)); | |
821 | ||
822 | struct btrfs_csum_item { | |
823 | u8 csum; | |
824 | } __attribute__ ((__packed__)); | |
825 | ||
826 | /* different types of block groups (and chunks) */ | |
827 | #define BTRFS_BLOCK_GROUP_DATA (1ULL << 0) | |
828 | #define BTRFS_BLOCK_GROUP_SYSTEM (1ULL << 1) | |
829 | #define BTRFS_BLOCK_GROUP_METADATA (1ULL << 2) | |
830 | #define BTRFS_BLOCK_GROUP_RAID0 (1ULL << 3) | |
831 | #define BTRFS_BLOCK_GROUP_RAID1 (1ULL << 4) | |
832 | #define BTRFS_BLOCK_GROUP_DUP (1ULL << 5) | |
833 | #define BTRFS_BLOCK_GROUP_RAID10 (1ULL << 6) | |
834 | #define BTRFS_BLOCK_GROUP_RESERVED BTRFS_AVAIL_ALLOC_BIT_SINGLE | |
835 | #define BTRFS_NR_RAID_TYPES 5 | |
836 | ||
837 | #define BTRFS_BLOCK_GROUP_TYPE_MASK (BTRFS_BLOCK_GROUP_DATA | \ | |
838 | BTRFS_BLOCK_GROUP_SYSTEM | \ | |
839 | BTRFS_BLOCK_GROUP_METADATA) | |
840 | ||
841 | #define BTRFS_BLOCK_GROUP_PROFILE_MASK (BTRFS_BLOCK_GROUP_RAID0 | \ | |
842 | BTRFS_BLOCK_GROUP_RAID1 | \ | |
843 | BTRFS_BLOCK_GROUP_DUP | \ | |
844 | BTRFS_BLOCK_GROUP_RAID10) | |
845 | /* | |
846 | * We need a bit for restriper to be able to tell when chunks of type | |
847 | * SINGLE are available. This "extended" profile format is used in | |
848 | * fs_info->avail_*_alloc_bits (in-memory) and balance item fields | |
849 | * (on-disk). The corresponding on-disk bit in chunk.type is reserved | |
850 | * to avoid remappings between two formats in future. | |
851 | */ | |
852 | #define BTRFS_AVAIL_ALLOC_BIT_SINGLE (1ULL << 48) | |
853 | ||
854 | #define BTRFS_EXTENDED_PROFILE_MASK (BTRFS_BLOCK_GROUP_PROFILE_MASK | \ | |
855 | BTRFS_AVAIL_ALLOC_BIT_SINGLE) | |
856 | ||
857 | static inline u64 chunk_to_extended(u64 flags) | |
858 | { | |
859 | if ((flags & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0) | |
860 | flags |= BTRFS_AVAIL_ALLOC_BIT_SINGLE; | |
861 | ||
862 | return flags; | |
863 | } | |
864 | static inline u64 extended_to_chunk(u64 flags) | |
865 | { | |
866 | return flags & ~BTRFS_AVAIL_ALLOC_BIT_SINGLE; | |
867 | } | |
868 | ||
869 | struct btrfs_block_group_item { | |
870 | __le64 used; | |
871 | __le64 chunk_objectid; | |
872 | __le64 flags; | |
873 | } __attribute__ ((__packed__)); | |
874 | ||
875 | struct btrfs_space_info { | |
876 | u64 flags; | |
877 | ||
878 | u64 total_bytes; /* total bytes in the space, | |
879 | this doesn't take mirrors into account */ | |
880 | u64 bytes_used; /* total bytes used, | |
881 | this doesn't take mirrors into account */ | |
882 | u64 bytes_pinned; /* total bytes pinned, will be freed when the | |
883 | transaction finishes */ | |
884 | u64 bytes_reserved; /* total bytes the allocator has reserved for | |
885 | current allocations */ | |
886 | u64 bytes_readonly; /* total bytes that are read only */ | |
887 | ||
888 | u64 bytes_may_use; /* number of bytes that may be used for | |
889 | delalloc/allocations */ | |
890 | u64 disk_used; /* total bytes used on disk */ | |
891 | u64 disk_total; /* total bytes on disk, takes mirrors into | |
892 | account */ | |
893 | ||
894 | /* | |
895 | * we bump reservation progress every time we decrement | |
896 | * bytes_reserved. This way people waiting for reservations | |
897 | * know something good has happened and they can check | |
898 | * for progress. The number here isn't to be trusted, it | |
899 | * just shows reclaim activity | |
900 | */ | |
901 | unsigned long reservation_progress; | |
902 | ||
903 | unsigned int full:1; /* indicates that we cannot allocate any more | |
904 | chunks for this space */ | |
905 | unsigned int chunk_alloc:1; /* set if we are allocating a chunk */ | |
906 | ||
907 | unsigned int flush:1; /* set if we are trying to make space */ | |
908 | ||
909 | unsigned int force_alloc; /* set if we need to force a chunk | |
910 | alloc for this space */ | |
911 | ||
912 | struct list_head list; | |
913 | ||
914 | /* for block groups in our same type */ | |
915 | struct list_head block_groups[BTRFS_NR_RAID_TYPES]; | |
916 | spinlock_t lock; | |
917 | struct rw_semaphore groups_sem; | |
918 | wait_queue_head_t wait; | |
919 | }; | |
920 | ||
921 | struct btrfs_block_rsv { | |
922 | u64 size; | |
923 | u64 reserved; | |
924 | struct btrfs_space_info *space_info; | |
925 | spinlock_t lock; | |
926 | unsigned int full; | |
927 | }; | |
928 | ||
929 | /* | |
930 | * free clusters are used to claim free space in relatively large chunks, | |
931 | * allowing us to do less seeky writes. They are used for all metadata | |
932 | * allocations and data allocations in ssd mode. | |
933 | */ | |
934 | struct btrfs_free_cluster { | |
935 | spinlock_t lock; | |
936 | spinlock_t refill_lock; | |
937 | struct rb_root root; | |
938 | ||
939 | /* largest extent in this cluster */ | |
940 | u64 max_size; | |
941 | ||
942 | /* first extent starting offset */ | |
943 | u64 window_start; | |
944 | ||
945 | struct btrfs_block_group_cache *block_group; | |
946 | /* | |
947 | * when a cluster is allocated from a block group, we put the | |
948 | * cluster onto a list in the block group so that it can | |
949 | * be freed before the block group is freed. | |
950 | */ | |
951 | struct list_head block_group_list; | |
952 | }; | |
953 | ||
954 | enum btrfs_caching_type { | |
955 | BTRFS_CACHE_NO = 0, | |
956 | BTRFS_CACHE_STARTED = 1, | |
957 | BTRFS_CACHE_FAST = 2, | |
958 | BTRFS_CACHE_FINISHED = 3, | |
959 | }; | |
960 | ||
961 | enum btrfs_disk_cache_state { | |
962 | BTRFS_DC_WRITTEN = 0, | |
963 | BTRFS_DC_ERROR = 1, | |
964 | BTRFS_DC_CLEAR = 2, | |
965 | BTRFS_DC_SETUP = 3, | |
966 | BTRFS_DC_NEED_WRITE = 4, | |
967 | }; | |
968 | ||
969 | struct btrfs_caching_control { | |
970 | struct list_head list; | |
971 | struct mutex mutex; | |
972 | wait_queue_head_t wait; | |
973 | struct btrfs_work work; | |
974 | struct btrfs_block_group_cache *block_group; | |
975 | u64 progress; | |
976 | atomic_t count; | |
977 | }; | |
978 | ||
979 | struct btrfs_block_group_cache { | |
980 | struct btrfs_key key; | |
981 | struct btrfs_block_group_item item; | |
982 | struct btrfs_fs_info *fs_info; | |
983 | struct inode *inode; | |
984 | spinlock_t lock; | |
985 | u64 pinned; | |
986 | u64 reserved; | |
987 | u64 bytes_super; | |
988 | u64 flags; | |
989 | u64 sectorsize; | |
990 | u64 cache_generation; | |
991 | unsigned int ro:1; | |
992 | unsigned int dirty:1; | |
993 | unsigned int iref:1; | |
994 | ||
995 | int disk_cache_state; | |
996 | ||
997 | /* cache tracking stuff */ | |
998 | int cached; | |
999 | struct btrfs_caching_control *caching_ctl; | |
1000 | u64 last_byte_to_unpin; | |
1001 | ||
1002 | struct btrfs_space_info *space_info; | |
1003 | ||
1004 | /* free space cache stuff */ | |
1005 | struct btrfs_free_space_ctl *free_space_ctl; | |
1006 | ||
1007 | /* block group cache stuff */ | |
1008 | struct rb_node cache_node; | |
1009 | ||
1010 | /* for block groups in the same raid type */ | |
1011 | struct list_head list; | |
1012 | ||
1013 | /* usage count */ | |
1014 | atomic_t count; | |
1015 | ||
1016 | /* List of struct btrfs_free_clusters for this block group. | |
1017 | * Today it will only have one thing on it, but that may change | |
1018 | */ | |
1019 | struct list_head cluster_list; | |
1020 | }; | |
1021 | ||
1022 | struct reloc_control; | |
1023 | struct btrfs_device; | |
1024 | struct btrfs_fs_devices; | |
1025 | struct btrfs_balance_control; | |
1026 | struct btrfs_delayed_root; | |
1027 | struct btrfs_fs_info { | |
1028 | u8 fsid[BTRFS_FSID_SIZE]; | |
1029 | u8 chunk_tree_uuid[BTRFS_UUID_SIZE]; | |
1030 | struct btrfs_root *extent_root; | |
1031 | struct btrfs_root *tree_root; | |
1032 | struct btrfs_root *chunk_root; | |
1033 | struct btrfs_root *dev_root; | |
1034 | struct btrfs_root *fs_root; | |
1035 | struct btrfs_root *csum_root; | |
1036 | ||
1037 | /* the log root tree is a directory of all the other log roots */ | |
1038 | struct btrfs_root *log_root_tree; | |
1039 | ||
1040 | spinlock_t fs_roots_radix_lock; | |
1041 | struct radix_tree_root fs_roots_radix; | |
1042 | ||
1043 | /* block group cache stuff */ | |
1044 | spinlock_t block_group_cache_lock; | |
1045 | struct rb_root block_group_cache_tree; | |
1046 | ||
1047 | /* keep track of unallocated space */ | |
1048 | spinlock_t free_chunk_lock; | |
1049 | u64 free_chunk_space; | |
1050 | ||
1051 | struct extent_io_tree freed_extents[2]; | |
1052 | struct extent_io_tree *pinned_extents; | |
1053 | ||
1054 | /* logical->physical extent mapping */ | |
1055 | struct btrfs_mapping_tree mapping_tree; | |
1056 | ||
1057 | /* | |
1058 | * block reservation for extent, checksum, root tree and | |
1059 | * delayed dir index item | |
1060 | */ | |
1061 | struct btrfs_block_rsv global_block_rsv; | |
1062 | /* block reservation for delay allocation */ | |
1063 | struct btrfs_block_rsv delalloc_block_rsv; | |
1064 | /* block reservation for metadata operations */ | |
1065 | struct btrfs_block_rsv trans_block_rsv; | |
1066 | /* block reservation for chunk tree */ | |
1067 | struct btrfs_block_rsv chunk_block_rsv; | |
1068 | /* block reservation for delayed operations */ | |
1069 | struct btrfs_block_rsv delayed_block_rsv; | |
1070 | ||
1071 | struct btrfs_block_rsv empty_block_rsv; | |
1072 | ||
1073 | u64 generation; | |
1074 | u64 last_trans_committed; | |
1075 | ||
1076 | /* | |
1077 | * this is updated to the current trans every time a full commit | |
1078 | * is required instead of the faster short fsync log commits | |
1079 | */ | |
1080 | u64 last_trans_log_full_commit; | |
1081 | unsigned long mount_opt; | |
1082 | unsigned long compress_type:4; | |
1083 | u64 max_inline; | |
1084 | u64 alloc_start; | |
1085 | struct btrfs_transaction *running_transaction; | |
1086 | wait_queue_head_t transaction_throttle; | |
1087 | wait_queue_head_t transaction_wait; | |
1088 | wait_queue_head_t transaction_blocked_wait; | |
1089 | wait_queue_head_t async_submit_wait; | |
1090 | ||
1091 | struct btrfs_super_block *super_copy; | |
1092 | struct btrfs_super_block *super_for_commit; | |
1093 | struct block_device *__bdev; | |
1094 | struct super_block *sb; | |
1095 | struct inode *btree_inode; | |
1096 | struct backing_dev_info bdi; | |
1097 | struct mutex tree_log_mutex; | |
1098 | struct mutex transaction_kthread_mutex; | |
1099 | struct mutex cleaner_mutex; | |
1100 | struct mutex chunk_mutex; | |
1101 | struct mutex volume_mutex; | |
1102 | /* | |
1103 | * this protects the ordered operations list only while we are | |
1104 | * processing all of the entries on it. This way we make | |
1105 | * sure the commit code doesn't find the list temporarily empty | |
1106 | * because another function happens to be doing non-waiting preflush | |
1107 | * before jumping into the main commit. | |
1108 | */ | |
1109 | struct mutex ordered_operations_mutex; | |
1110 | struct rw_semaphore extent_commit_sem; | |
1111 | ||
1112 | struct rw_semaphore cleanup_work_sem; | |
1113 | ||
1114 | struct rw_semaphore subvol_sem; | |
1115 | struct srcu_struct subvol_srcu; | |
1116 | ||
1117 | spinlock_t trans_lock; | |
1118 | /* | |
1119 | * the reloc mutex goes with the trans lock, it is taken | |
1120 | * during commit to protect us from the relocation code | |
1121 | */ | |
1122 | struct mutex reloc_mutex; | |
1123 | ||
1124 | struct list_head trans_list; | |
1125 | struct list_head hashers; | |
1126 | struct list_head dead_roots; | |
1127 | struct list_head caching_block_groups; | |
1128 | ||
1129 | spinlock_t delayed_iput_lock; | |
1130 | struct list_head delayed_iputs; | |
1131 | ||
1132 | /* this protects tree_mod_seq_list */ | |
1133 | spinlock_t tree_mod_seq_lock; | |
1134 | atomic_t tree_mod_seq; | |
1135 | struct list_head tree_mod_seq_list; | |
1136 | ||
1137 | /* this protects tree_mod_log */ | |
1138 | rwlock_t tree_mod_log_lock; | |
1139 | struct rb_root tree_mod_log; | |
1140 | ||
1141 | atomic_t nr_async_submits; | |
1142 | atomic_t async_submit_draining; | |
1143 | atomic_t nr_async_bios; | |
1144 | atomic_t async_delalloc_pages; | |
1145 | atomic_t open_ioctl_trans; | |
1146 | ||
1147 | /* | |
1148 | * this is used by the balancing code to wait for all the pending | |
1149 | * ordered extents | |
1150 | */ | |
1151 | spinlock_t ordered_extent_lock; | |
1152 | ||
1153 | /* | |
1154 | * all of the data=ordered extents pending writeback | |
1155 | * these can span multiple transactions and basically include | |
1156 | * every dirty data page that isn't from nodatacow | |
1157 | */ | |
1158 | struct list_head ordered_extents; | |
1159 | ||
1160 | /* | |
1161 | * all of the inodes that have delalloc bytes. It is possible for | |
1162 | * this list to be empty even when there is still dirty data=ordered | |
1163 | * extents waiting to finish IO. | |
1164 | */ | |
1165 | struct list_head delalloc_inodes; | |
1166 | ||
1167 | /* | |
1168 | * special rename and truncate targets that must be on disk before | |
1169 | * we're allowed to commit. This is basically the ext3 style | |
1170 | * data=ordered list. | |
1171 | */ | |
1172 | struct list_head ordered_operations; | |
1173 | ||
1174 | /* | |
1175 | * there is a pool of worker threads for checksumming during writes | |
1176 | * and a pool for checksumming after reads. This is because readers | |
1177 | * can run with FS locks held, and the writers may be waiting for | |
1178 | * those locks. We don't want ordering in the pending list to cause | |
1179 | * deadlocks, and so the two are serviced separately. | |
1180 | * | |
1181 | * A third pool does submit_bio to avoid deadlocking with the other | |
1182 | * two | |
1183 | */ | |
1184 | struct btrfs_workers generic_worker; | |
1185 | struct btrfs_workers workers; | |
1186 | struct btrfs_workers delalloc_workers; | |
1187 | struct btrfs_workers endio_workers; | |
1188 | struct btrfs_workers endio_meta_workers; | |
1189 | struct btrfs_workers endio_meta_write_workers; | |
1190 | struct btrfs_workers endio_write_workers; | |
1191 | struct btrfs_workers endio_freespace_worker; | |
1192 | struct btrfs_workers submit_workers; | |
1193 | struct btrfs_workers caching_workers; | |
1194 | struct btrfs_workers readahead_workers; | |
1195 | ||
1196 | /* | |
1197 | * fixup workers take dirty pages that didn't properly go through | |
1198 | * the cow mechanism and make them safe to write. It happens | |
1199 | * for the sys_munmap function call path | |
1200 | */ | |
1201 | struct btrfs_workers fixup_workers; | |
1202 | struct btrfs_workers delayed_workers; | |
1203 | struct task_struct *transaction_kthread; | |
1204 | struct task_struct *cleaner_kthread; | |
1205 | int thread_pool_size; | |
1206 | ||
1207 | struct kobject super_kobj; | |
1208 | struct completion kobj_unregister; | |
1209 | int do_barriers; | |
1210 | int closing; | |
1211 | int log_root_recovering; | |
1212 | int enospc_unlink; | |
1213 | int trans_no_join; | |
1214 | ||
1215 | u64 total_pinned; | |
1216 | ||
1217 | /* protected by the delalloc lock, used to keep from writing | |
1218 | * metadata until there is a nice batch | |
1219 | */ | |
1220 | u64 dirty_metadata_bytes; | |
1221 | struct list_head dirty_cowonly_roots; | |
1222 | ||
1223 | struct btrfs_fs_devices *fs_devices; | |
1224 | ||
1225 | /* | |
1226 | * the space_info list is almost entirely read only. It only changes | |
1227 | * when we add a new raid type to the FS, and that happens | |
1228 | * very rarely. RCU is used to protect it. | |
1229 | */ | |
1230 | struct list_head space_info; | |
1231 | ||
1232 | struct reloc_control *reloc_ctl; | |
1233 | ||
1234 | spinlock_t delalloc_lock; | |
1235 | u64 delalloc_bytes; | |
1236 | ||
1237 | /* data_alloc_cluster is only used in ssd mode */ | |
1238 | struct btrfs_free_cluster data_alloc_cluster; | |
1239 | ||
1240 | /* all metadata allocations go through this cluster */ | |
1241 | struct btrfs_free_cluster meta_alloc_cluster; | |
1242 | ||
1243 | /* auto defrag inodes go here */ | |
1244 | spinlock_t defrag_inodes_lock; | |
1245 | struct rb_root defrag_inodes; | |
1246 | atomic_t defrag_running; | |
1247 | ||
1248 | spinlock_t ref_cache_lock; | |
1249 | u64 total_ref_cache_size; | |
1250 | ||
1251 | /* | |
1252 | * these three are in extended format (availability of single | |
1253 | * chunks is denoted by BTRFS_AVAIL_ALLOC_BIT_SINGLE bit, other | |
1254 | * types are denoted by corresponding BTRFS_BLOCK_GROUP_* bits) | |
1255 | */ | |
1256 | u64 avail_data_alloc_bits; | |
1257 | u64 avail_metadata_alloc_bits; | |
1258 | u64 avail_system_alloc_bits; | |
1259 | ||
1260 | /* restriper state */ | |
1261 | spinlock_t balance_lock; | |
1262 | struct mutex balance_mutex; | |
1263 | atomic_t balance_running; | |
1264 | atomic_t balance_pause_req; | |
1265 | atomic_t balance_cancel_req; | |
1266 | struct btrfs_balance_control *balance_ctl; | |
1267 | wait_queue_head_t balance_wait_q; | |
1268 | ||
1269 | unsigned data_chunk_allocations; | |
1270 | unsigned metadata_ratio; | |
1271 | ||
1272 | void *bdev_holder; | |
1273 | ||
1274 | /* private scrub information */ | |
1275 | struct mutex scrub_lock; | |
1276 | atomic_t scrubs_running; | |
1277 | atomic_t scrub_pause_req; | |
1278 | atomic_t scrubs_paused; | |
1279 | atomic_t scrub_cancel_req; | |
1280 | wait_queue_head_t scrub_pause_wait; | |
1281 | struct rw_semaphore scrub_super_lock; | |
1282 | int scrub_workers_refcnt; | |
1283 | struct btrfs_workers scrub_workers; | |
1284 | ||
1285 | #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY | |
1286 | u32 check_integrity_print_mask; | |
1287 | #endif | |
1288 | ||
1289 | /* filesystem state */ | |
1290 | u64 fs_state; | |
1291 | ||
1292 | struct btrfs_delayed_root *delayed_root; | |
1293 | ||
1294 | /* readahead tree */ | |
1295 | spinlock_t reada_lock; | |
1296 | struct radix_tree_root reada_tree; | |
1297 | ||
1298 | /* next backup root to be overwritten */ | |
1299 | int backup_root_index; | |
1300 | }; | |
1301 | ||
1302 | /* | |
1303 | * in ram representation of the tree. extent_root is used for all allocations | |
1304 | * and for the extent tree extent_root root. | |
1305 | */ | |
1306 | struct btrfs_root { | |
1307 | struct extent_buffer *node; | |
1308 | ||
1309 | struct extent_buffer *commit_root; | |
1310 | struct btrfs_root *log_root; | |
1311 | struct btrfs_root *reloc_root; | |
1312 | ||
1313 | struct btrfs_root_item root_item; | |
1314 | struct btrfs_key root_key; | |
1315 | struct btrfs_fs_info *fs_info; | |
1316 | struct extent_io_tree dirty_log_pages; | |
1317 | ||
1318 | struct kobject root_kobj; | |
1319 | struct completion kobj_unregister; | |
1320 | struct mutex objectid_mutex; | |
1321 | ||
1322 | spinlock_t accounting_lock; | |
1323 | struct btrfs_block_rsv *block_rsv; | |
1324 | ||
1325 | /* free ino cache stuff */ | |
1326 | struct mutex fs_commit_mutex; | |
1327 | struct btrfs_free_space_ctl *free_ino_ctl; | |
1328 | enum btrfs_caching_type cached; | |
1329 | spinlock_t cache_lock; | |
1330 | wait_queue_head_t cache_wait; | |
1331 | struct btrfs_free_space_ctl *free_ino_pinned; | |
1332 | u64 cache_progress; | |
1333 | struct inode *cache_inode; | |
1334 | ||
1335 | struct mutex log_mutex; | |
1336 | wait_queue_head_t log_writer_wait; | |
1337 | wait_queue_head_t log_commit_wait[2]; | |
1338 | atomic_t log_writers; | |
1339 | atomic_t log_commit[2]; | |
1340 | unsigned long log_transid; | |
1341 | unsigned long last_log_commit; | |
1342 | unsigned long log_batch; | |
1343 | pid_t log_start_pid; | |
1344 | bool log_multiple_pids; | |
1345 | ||
1346 | u64 objectid; | |
1347 | u64 last_trans; | |
1348 | ||
1349 | /* data allocations are done in sectorsize units */ | |
1350 | u32 sectorsize; | |
1351 | ||
1352 | /* node allocations are done in nodesize units */ | |
1353 | u32 nodesize; | |
1354 | ||
1355 | /* leaf allocations are done in leafsize units */ | |
1356 | u32 leafsize; | |
1357 | ||
1358 | u32 stripesize; | |
1359 | ||
1360 | u32 type; | |
1361 | ||
1362 | u64 highest_objectid; | |
1363 | ||
1364 | /* btrfs_record_root_in_trans is a multi-step process, | |
1365 | * and it can race with the balancing code. But the | |
1366 | * race is very small, and only the first time the root | |
1367 | * is added to each transaction. So in_trans_setup | |
1368 | * is used to tell us when more checks are required | |
1369 | */ | |
1370 | unsigned long in_trans_setup; | |
1371 | int ref_cows; | |
1372 | int track_dirty; | |
1373 | int in_radix; | |
1374 | ||
1375 | u64 defrag_trans_start; | |
1376 | struct btrfs_key defrag_progress; | |
1377 | struct btrfs_key defrag_max; | |
1378 | int defrag_running; | |
1379 | char *name; | |
1380 | ||
1381 | /* the dirty list is only used by non-reference counted roots */ | |
1382 | struct list_head dirty_list; | |
1383 | ||
1384 | struct list_head root_list; | |
1385 | ||
1386 | spinlock_t orphan_lock; | |
1387 | struct list_head orphan_list; | |
1388 | struct btrfs_block_rsv *orphan_block_rsv; | |
1389 | int orphan_item_inserted; | |
1390 | int orphan_cleanup_state; | |
1391 | ||
1392 | spinlock_t inode_lock; | |
1393 | /* red-black tree that keeps track of in-memory inodes */ | |
1394 | struct rb_root inode_tree; | |
1395 | ||
1396 | /* | |
1397 | * radix tree that keeps track of delayed nodes of every inode, | |
1398 | * protected by inode_lock | |
1399 | */ | |
1400 | struct radix_tree_root delayed_nodes_tree; | |
1401 | /* | |
1402 | * right now this just gets used so that a root has its own devid | |
1403 | * for stat. It may be used for more later | |
1404 | */ | |
1405 | dev_t anon_dev; | |
1406 | ||
1407 | int force_cow; | |
1408 | }; | |
1409 | ||
1410 | struct btrfs_ioctl_defrag_range_args { | |
1411 | /* start of the defrag operation */ | |
1412 | __u64 start; | |
1413 | ||
1414 | /* number of bytes to defrag, use (u64)-1 to say all */ | |
1415 | __u64 len; | |
1416 | ||
1417 | /* | |
1418 | * flags for the operation, which can include turning | |
1419 | * on compression for this one defrag | |
1420 | */ | |
1421 | __u64 flags; | |
1422 | ||
1423 | /* | |
1424 | * any extent bigger than this will be considered | |
1425 | * already defragged. Use 0 to take the kernel default | |
1426 | * Use 1 to say every single extent must be rewritten | |
1427 | */ | |
1428 | __u32 extent_thresh; | |
1429 | ||
1430 | /* | |
1431 | * which compression method to use if turning on compression | |
1432 | * for this defrag operation. If unspecified, zlib will | |
1433 | * be used | |
1434 | */ | |
1435 | __u32 compress_type; | |
1436 | ||
1437 | /* spare for later */ | |
1438 | __u32 unused[4]; | |
1439 | }; | |
1440 | ||
1441 | ||
1442 | /* | |
1443 | * inode items have the data typically returned from stat and store other | |
1444 | * info about object characteristics. There is one for every file and dir in | |
1445 | * the FS | |
1446 | */ | |
1447 | #define BTRFS_INODE_ITEM_KEY 1 | |
1448 | #define BTRFS_INODE_REF_KEY 12 | |
1449 | #define BTRFS_XATTR_ITEM_KEY 24 | |
1450 | #define BTRFS_ORPHAN_ITEM_KEY 48 | |
1451 | /* reserve 2-15 close to the inode for later flexibility */ | |
1452 | ||
1453 | /* | |
1454 | * dir items are the name -> inode pointers in a directory. There is one | |
1455 | * for every name in a directory. | |
1456 | */ | |
1457 | #define BTRFS_DIR_LOG_ITEM_KEY 60 | |
1458 | #define BTRFS_DIR_LOG_INDEX_KEY 72 | |
1459 | #define BTRFS_DIR_ITEM_KEY 84 | |
1460 | #define BTRFS_DIR_INDEX_KEY 96 | |
1461 | /* | |
1462 | * extent data is for file data | |
1463 | */ | |
1464 | #define BTRFS_EXTENT_DATA_KEY 108 | |
1465 | ||
1466 | /* | |
1467 | * extent csums are stored in a separate tree and hold csums for | |
1468 | * an entire extent on disk. | |
1469 | */ | |
1470 | #define BTRFS_EXTENT_CSUM_KEY 128 | |
1471 | ||
1472 | /* | |
1473 | * root items point to tree roots. They are typically in the root | |
1474 | * tree used by the super block to find all the other trees | |
1475 | */ | |
1476 | #define BTRFS_ROOT_ITEM_KEY 132 | |
1477 | ||
1478 | /* | |
1479 | * root backrefs tie subvols and snapshots to the directory entries that | |
1480 | * reference them | |
1481 | */ | |
1482 | #define BTRFS_ROOT_BACKREF_KEY 144 | |
1483 | ||
1484 | /* | |
1485 | * root refs make a fast index for listing all of the snapshots and | |
1486 | * subvolumes referenced by a given root. They point directly to the | |
1487 | * directory item in the root that references the subvol | |
1488 | */ | |
1489 | #define BTRFS_ROOT_REF_KEY 156 | |
1490 | ||
1491 | /* | |
1492 | * extent items are in the extent map tree. These record which blocks | |
1493 | * are used, and how many references there are to each block | |
1494 | */ | |
1495 | #define BTRFS_EXTENT_ITEM_KEY 168 | |
1496 | ||
1497 | #define BTRFS_TREE_BLOCK_REF_KEY 176 | |
1498 | ||
1499 | #define BTRFS_EXTENT_DATA_REF_KEY 178 | |
1500 | ||
1501 | #define BTRFS_EXTENT_REF_V0_KEY 180 | |
1502 | ||
1503 | #define BTRFS_SHARED_BLOCK_REF_KEY 182 | |
1504 | ||
1505 | #define BTRFS_SHARED_DATA_REF_KEY 184 | |
1506 | ||
1507 | /* | |
1508 | * block groups give us hints into the extent allocation trees. Which | |
1509 | * blocks are free etc etc | |
1510 | */ | |
1511 | #define BTRFS_BLOCK_GROUP_ITEM_KEY 192 | |
1512 | ||
1513 | #define BTRFS_DEV_EXTENT_KEY 204 | |
1514 | #define BTRFS_DEV_ITEM_KEY 216 | |
1515 | #define BTRFS_CHUNK_ITEM_KEY 228 | |
1516 | ||
1517 | #define BTRFS_BALANCE_ITEM_KEY 248 | |
1518 | ||
1519 | /* | |
1520 | * string items are for debugging. They just store a short string of | |
1521 | * data in the FS | |
1522 | */ | |
1523 | #define BTRFS_STRING_ITEM_KEY 253 | |
1524 | ||
1525 | /* | |
1526 | * Flags for mount options. | |
1527 | * | |
1528 | * Note: don't forget to add new options to btrfs_show_options() | |
1529 | */ | |
1530 | #define BTRFS_MOUNT_NODATASUM (1 << 0) | |
1531 | #define BTRFS_MOUNT_NODATACOW (1 << 1) | |
1532 | #define BTRFS_MOUNT_NOBARRIER (1 << 2) | |
1533 | #define BTRFS_MOUNT_SSD (1 << 3) | |
1534 | #define BTRFS_MOUNT_DEGRADED (1 << 4) | |
1535 | #define BTRFS_MOUNT_COMPRESS (1 << 5) | |
1536 | #define BTRFS_MOUNT_NOTREELOG (1 << 6) | |
1537 | #define BTRFS_MOUNT_FLUSHONCOMMIT (1 << 7) | |
1538 | #define BTRFS_MOUNT_SSD_SPREAD (1 << 8) | |
1539 | #define BTRFS_MOUNT_NOSSD (1 << 9) | |
1540 | #define BTRFS_MOUNT_DISCARD (1 << 10) | |
1541 | #define BTRFS_MOUNT_FORCE_COMPRESS (1 << 11) | |
1542 | #define BTRFS_MOUNT_SPACE_CACHE (1 << 12) | |
1543 | #define BTRFS_MOUNT_CLEAR_CACHE (1 << 13) | |
1544 | #define BTRFS_MOUNT_USER_SUBVOL_RM_ALLOWED (1 << 14) | |
1545 | #define BTRFS_MOUNT_ENOSPC_DEBUG (1 << 15) | |
1546 | #define BTRFS_MOUNT_AUTO_DEFRAG (1 << 16) | |
1547 | #define BTRFS_MOUNT_INODE_MAP_CACHE (1 << 17) | |
1548 | #define BTRFS_MOUNT_RECOVERY (1 << 18) | |
1549 | #define BTRFS_MOUNT_SKIP_BALANCE (1 << 19) | |
1550 | #define BTRFS_MOUNT_CHECK_INTEGRITY (1 << 20) | |
1551 | #define BTRFS_MOUNT_CHECK_INTEGRITY_INCLUDING_EXTENT_DATA (1 << 21) | |
1552 | #define BTRFS_MOUNT_PANIC_ON_FATAL_ERROR (1 << 22) | |
1553 | ||
1554 | #define btrfs_clear_opt(o, opt) ((o) &= ~BTRFS_MOUNT_##opt) | |
1555 | #define btrfs_set_opt(o, opt) ((o) |= BTRFS_MOUNT_##opt) | |
1556 | #define btrfs_test_opt(root, opt) ((root)->fs_info->mount_opt & \ | |
1557 | BTRFS_MOUNT_##opt) | |
1558 | /* | |
1559 | * Inode flags | |
1560 | */ | |
1561 | #define BTRFS_INODE_NODATASUM (1 << 0) | |
1562 | #define BTRFS_INODE_NODATACOW (1 << 1) | |
1563 | #define BTRFS_INODE_READONLY (1 << 2) | |
1564 | #define BTRFS_INODE_NOCOMPRESS (1 << 3) | |
1565 | #define BTRFS_INODE_PREALLOC (1 << 4) | |
1566 | #define BTRFS_INODE_SYNC (1 << 5) | |
1567 | #define BTRFS_INODE_IMMUTABLE (1 << 6) | |
1568 | #define BTRFS_INODE_APPEND (1 << 7) | |
1569 | #define BTRFS_INODE_NODUMP (1 << 8) | |
1570 | #define BTRFS_INODE_NOATIME (1 << 9) | |
1571 | #define BTRFS_INODE_DIRSYNC (1 << 10) | |
1572 | #define BTRFS_INODE_COMPRESS (1 << 11) | |
1573 | ||
1574 | #define BTRFS_INODE_ROOT_ITEM_INIT (1 << 31) | |
1575 | ||
1576 | struct btrfs_map_token { | |
1577 | struct extent_buffer *eb; | |
1578 | char *kaddr; | |
1579 | unsigned long offset; | |
1580 | }; | |
1581 | ||
1582 | static inline void btrfs_init_map_token (struct btrfs_map_token *token) | |
1583 | { | |
1584 | memset(token, 0, sizeof(*token)); | |
1585 | } | |
1586 | ||
1587 | /* some macros to generate set/get funcs for the struct fields. This | |
1588 | * assumes there is a lefoo_to_cpu for every type, so lets make a simple | |
1589 | * one for u8: | |
1590 | */ | |
1591 | #define le8_to_cpu(v) (v) | |
1592 | #define cpu_to_le8(v) (v) | |
1593 | #define __le8 u8 | |
1594 | ||
1595 | #define read_eb_member(eb, ptr, type, member, result) ( \ | |
1596 | read_extent_buffer(eb, (char *)(result), \ | |
1597 | ((unsigned long)(ptr)) + \ | |
1598 | offsetof(type, member), \ | |
1599 | sizeof(((type *)0)->member))) | |
1600 | ||
1601 | #define write_eb_member(eb, ptr, type, member, result) ( \ | |
1602 | write_extent_buffer(eb, (char *)(result), \ | |
1603 | ((unsigned long)(ptr)) + \ | |
1604 | offsetof(type, member), \ | |
1605 | sizeof(((type *)0)->member))) | |
1606 | ||
1607 | #ifndef BTRFS_SETGET_FUNCS | |
1608 | #define BTRFS_SETGET_FUNCS(name, type, member, bits) \ | |
1609 | u##bits btrfs_##name(struct extent_buffer *eb, type *s); \ | |
1610 | u##bits btrfs_token_##name(struct extent_buffer *eb, type *s, struct btrfs_map_token *token); \ | |
1611 | void btrfs_set_token_##name(struct extent_buffer *eb, type *s, u##bits val, struct btrfs_map_token *token);\ | |
1612 | void btrfs_set_##name(struct extent_buffer *eb, type *s, u##bits val); | |
1613 | #endif | |
1614 | ||
1615 | #define BTRFS_SETGET_HEADER_FUNCS(name, type, member, bits) \ | |
1616 | static inline u##bits btrfs_##name(struct extent_buffer *eb) \ | |
1617 | { \ | |
1618 | type *p = page_address(eb->pages[0]); \ | |
1619 | u##bits res = le##bits##_to_cpu(p->member); \ | |
1620 | return res; \ | |
1621 | } \ | |
1622 | static inline void btrfs_set_##name(struct extent_buffer *eb, \ | |
1623 | u##bits val) \ | |
1624 | { \ | |
1625 | type *p = page_address(eb->pages[0]); \ | |
1626 | p->member = cpu_to_le##bits(val); \ | |
1627 | } | |
1628 | ||
1629 | #define BTRFS_SETGET_STACK_FUNCS(name, type, member, bits) \ | |
1630 | static inline u##bits btrfs_##name(type *s) \ | |
1631 | { \ | |
1632 | return le##bits##_to_cpu(s->member); \ | |
1633 | } \ | |
1634 | static inline void btrfs_set_##name(type *s, u##bits val) \ | |
1635 | { \ | |
1636 | s->member = cpu_to_le##bits(val); \ | |
1637 | } | |
1638 | ||
1639 | BTRFS_SETGET_FUNCS(device_type, struct btrfs_dev_item, type, 64); | |
1640 | BTRFS_SETGET_FUNCS(device_total_bytes, struct btrfs_dev_item, total_bytes, 64); | |
1641 | BTRFS_SETGET_FUNCS(device_bytes_used, struct btrfs_dev_item, bytes_used, 64); | |
1642 | BTRFS_SETGET_FUNCS(device_io_align, struct btrfs_dev_item, io_align, 32); | |
1643 | BTRFS_SETGET_FUNCS(device_io_width, struct btrfs_dev_item, io_width, 32); | |
1644 | BTRFS_SETGET_FUNCS(device_start_offset, struct btrfs_dev_item, | |
1645 | start_offset, 64); | |
1646 | BTRFS_SETGET_FUNCS(device_sector_size, struct btrfs_dev_item, sector_size, 32); | |
1647 | BTRFS_SETGET_FUNCS(device_id, struct btrfs_dev_item, devid, 64); | |
1648 | BTRFS_SETGET_FUNCS(device_group, struct btrfs_dev_item, dev_group, 32); | |
1649 | BTRFS_SETGET_FUNCS(device_seek_speed, struct btrfs_dev_item, seek_speed, 8); | |
1650 | BTRFS_SETGET_FUNCS(device_bandwidth, struct btrfs_dev_item, bandwidth, 8); | |
1651 | BTRFS_SETGET_FUNCS(device_generation, struct btrfs_dev_item, generation, 64); | |
1652 | ||
1653 | BTRFS_SETGET_STACK_FUNCS(stack_device_type, struct btrfs_dev_item, type, 64); | |
1654 | BTRFS_SETGET_STACK_FUNCS(stack_device_total_bytes, struct btrfs_dev_item, | |
1655 | total_bytes, 64); | |
1656 | BTRFS_SETGET_STACK_FUNCS(stack_device_bytes_used, struct btrfs_dev_item, | |
1657 | bytes_used, 64); | |
1658 | BTRFS_SETGET_STACK_FUNCS(stack_device_io_align, struct btrfs_dev_item, | |
1659 | io_align, 32); | |
1660 | BTRFS_SETGET_STACK_FUNCS(stack_device_io_width, struct btrfs_dev_item, | |
1661 | io_width, 32); | |
1662 | BTRFS_SETGET_STACK_FUNCS(stack_device_sector_size, struct btrfs_dev_item, | |
1663 | sector_size, 32); | |
1664 | BTRFS_SETGET_STACK_FUNCS(stack_device_id, struct btrfs_dev_item, devid, 64); | |
1665 | BTRFS_SETGET_STACK_FUNCS(stack_device_group, struct btrfs_dev_item, | |
1666 | dev_group, 32); | |
1667 | BTRFS_SETGET_STACK_FUNCS(stack_device_seek_speed, struct btrfs_dev_item, | |
1668 | seek_speed, 8); | |
1669 | BTRFS_SETGET_STACK_FUNCS(stack_device_bandwidth, struct btrfs_dev_item, | |
1670 | bandwidth, 8); | |
1671 | BTRFS_SETGET_STACK_FUNCS(stack_device_generation, struct btrfs_dev_item, | |
1672 | generation, 64); | |
1673 | ||
1674 | static inline char *btrfs_device_uuid(struct btrfs_dev_item *d) | |
1675 | { | |
1676 | return (char *)d + offsetof(struct btrfs_dev_item, uuid); | |
1677 | } | |
1678 | ||
1679 | static inline char *btrfs_device_fsid(struct btrfs_dev_item *d) | |
1680 | { | |
1681 | return (char *)d + offsetof(struct btrfs_dev_item, fsid); | |
1682 | } | |
1683 | ||
1684 | BTRFS_SETGET_FUNCS(chunk_length, struct btrfs_chunk, length, 64); | |
1685 | BTRFS_SETGET_FUNCS(chunk_owner, struct btrfs_chunk, owner, 64); | |
1686 | BTRFS_SETGET_FUNCS(chunk_stripe_len, struct btrfs_chunk, stripe_len, 64); | |
1687 | BTRFS_SETGET_FUNCS(chunk_io_align, struct btrfs_chunk, io_align, 32); | |
1688 | BTRFS_SETGET_FUNCS(chunk_io_width, struct btrfs_chunk, io_width, 32); | |
1689 | BTRFS_SETGET_FUNCS(chunk_sector_size, struct btrfs_chunk, sector_size, 32); | |
1690 | BTRFS_SETGET_FUNCS(chunk_type, struct btrfs_chunk, type, 64); | |
1691 | BTRFS_SETGET_FUNCS(chunk_num_stripes, struct btrfs_chunk, num_stripes, 16); | |
1692 | BTRFS_SETGET_FUNCS(chunk_sub_stripes, struct btrfs_chunk, sub_stripes, 16); | |
1693 | BTRFS_SETGET_FUNCS(stripe_devid, struct btrfs_stripe, devid, 64); | |
1694 | BTRFS_SETGET_FUNCS(stripe_offset, struct btrfs_stripe, offset, 64); | |
1695 | ||
1696 | static inline char *btrfs_stripe_dev_uuid(struct btrfs_stripe *s) | |
1697 | { | |
1698 | return (char *)s + offsetof(struct btrfs_stripe, dev_uuid); | |
1699 | } | |
1700 | ||
1701 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_length, struct btrfs_chunk, length, 64); | |
1702 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_owner, struct btrfs_chunk, owner, 64); | |
1703 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_stripe_len, struct btrfs_chunk, | |
1704 | stripe_len, 64); | |
1705 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_io_align, struct btrfs_chunk, | |
1706 | io_align, 32); | |
1707 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_io_width, struct btrfs_chunk, | |
1708 | io_width, 32); | |
1709 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_sector_size, struct btrfs_chunk, | |
1710 | sector_size, 32); | |
1711 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_type, struct btrfs_chunk, type, 64); | |
1712 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_num_stripes, struct btrfs_chunk, | |
1713 | num_stripes, 16); | |
1714 | BTRFS_SETGET_STACK_FUNCS(stack_chunk_sub_stripes, struct btrfs_chunk, | |
1715 | sub_stripes, 16); | |
1716 | BTRFS_SETGET_STACK_FUNCS(stack_stripe_devid, struct btrfs_stripe, devid, 64); | |
1717 | BTRFS_SETGET_STACK_FUNCS(stack_stripe_offset, struct btrfs_stripe, offset, 64); | |
1718 | ||
1719 | static inline struct btrfs_stripe *btrfs_stripe_nr(struct btrfs_chunk *c, | |
1720 | int nr) | |
1721 | { | |
1722 | unsigned long offset = (unsigned long)c; | |
1723 | offset += offsetof(struct btrfs_chunk, stripe); | |
1724 | offset += nr * sizeof(struct btrfs_stripe); | |
1725 | return (struct btrfs_stripe *)offset; | |
1726 | } | |
1727 | ||
1728 | static inline char *btrfs_stripe_dev_uuid_nr(struct btrfs_chunk *c, int nr) | |
1729 | { | |
1730 | return btrfs_stripe_dev_uuid(btrfs_stripe_nr(c, nr)); | |
1731 | } | |
1732 | ||
1733 | static inline u64 btrfs_stripe_offset_nr(struct extent_buffer *eb, | |
1734 | struct btrfs_chunk *c, int nr) | |
1735 | { | |
1736 | return btrfs_stripe_offset(eb, btrfs_stripe_nr(c, nr)); | |
1737 | } | |
1738 | ||
1739 | static inline u64 btrfs_stripe_devid_nr(struct extent_buffer *eb, | |
1740 | struct btrfs_chunk *c, int nr) | |
1741 | { | |
1742 | return btrfs_stripe_devid(eb, btrfs_stripe_nr(c, nr)); | |
1743 | } | |
1744 | ||
1745 | /* struct btrfs_block_group_item */ | |
1746 | BTRFS_SETGET_STACK_FUNCS(block_group_used, struct btrfs_block_group_item, | |
1747 | used, 64); | |
1748 | BTRFS_SETGET_FUNCS(disk_block_group_used, struct btrfs_block_group_item, | |
1749 | used, 64); | |
1750 | BTRFS_SETGET_STACK_FUNCS(block_group_chunk_objectid, | |
1751 | struct btrfs_block_group_item, chunk_objectid, 64); | |
1752 | ||
1753 | BTRFS_SETGET_FUNCS(disk_block_group_chunk_objectid, | |
1754 | struct btrfs_block_group_item, chunk_objectid, 64); | |
1755 | BTRFS_SETGET_FUNCS(disk_block_group_flags, | |
1756 | struct btrfs_block_group_item, flags, 64); | |
1757 | BTRFS_SETGET_STACK_FUNCS(block_group_flags, | |
1758 | struct btrfs_block_group_item, flags, 64); | |
1759 | ||
1760 | /* struct btrfs_inode_ref */ | |
1761 | BTRFS_SETGET_FUNCS(inode_ref_name_len, struct btrfs_inode_ref, name_len, 16); | |
1762 | BTRFS_SETGET_FUNCS(inode_ref_index, struct btrfs_inode_ref, index, 64); | |
1763 | ||
1764 | /* struct btrfs_inode_item */ | |
1765 | BTRFS_SETGET_FUNCS(inode_generation, struct btrfs_inode_item, generation, 64); | |
1766 | BTRFS_SETGET_FUNCS(inode_sequence, struct btrfs_inode_item, sequence, 64); | |
1767 | BTRFS_SETGET_FUNCS(inode_transid, struct btrfs_inode_item, transid, 64); | |
1768 | BTRFS_SETGET_FUNCS(inode_size, struct btrfs_inode_item, size, 64); | |
1769 | BTRFS_SETGET_FUNCS(inode_nbytes, struct btrfs_inode_item, nbytes, 64); | |
1770 | BTRFS_SETGET_FUNCS(inode_block_group, struct btrfs_inode_item, block_group, 64); | |
1771 | BTRFS_SETGET_FUNCS(inode_nlink, struct btrfs_inode_item, nlink, 32); | |
1772 | BTRFS_SETGET_FUNCS(inode_uid, struct btrfs_inode_item, uid, 32); | |
1773 | BTRFS_SETGET_FUNCS(inode_gid, struct btrfs_inode_item, gid, 32); | |
1774 | BTRFS_SETGET_FUNCS(inode_mode, struct btrfs_inode_item, mode, 32); | |
1775 | BTRFS_SETGET_FUNCS(inode_rdev, struct btrfs_inode_item, rdev, 64); | |
1776 | BTRFS_SETGET_FUNCS(inode_flags, struct btrfs_inode_item, flags, 64); | |
1777 | ||
1778 | static inline struct btrfs_timespec * | |
1779 | btrfs_inode_atime(struct btrfs_inode_item *inode_item) | |
1780 | { | |
1781 | unsigned long ptr = (unsigned long)inode_item; | |
1782 | ptr += offsetof(struct btrfs_inode_item, atime); | |
1783 | return (struct btrfs_timespec *)ptr; | |
1784 | } | |
1785 | ||
1786 | static inline struct btrfs_timespec * | |
1787 | btrfs_inode_mtime(struct btrfs_inode_item *inode_item) | |
1788 | { | |
1789 | unsigned long ptr = (unsigned long)inode_item; | |
1790 | ptr += offsetof(struct btrfs_inode_item, mtime); | |
1791 | return (struct btrfs_timespec *)ptr; | |
1792 | } | |
1793 | ||
1794 | static inline struct btrfs_timespec * | |
1795 | btrfs_inode_ctime(struct btrfs_inode_item *inode_item) | |
1796 | { | |
1797 | unsigned long ptr = (unsigned long)inode_item; | |
1798 | ptr += offsetof(struct btrfs_inode_item, ctime); | |
1799 | return (struct btrfs_timespec *)ptr; | |
1800 | } | |
1801 | ||
1802 | BTRFS_SETGET_FUNCS(timespec_sec, struct btrfs_timespec, sec, 64); | |
1803 | BTRFS_SETGET_FUNCS(timespec_nsec, struct btrfs_timespec, nsec, 32); | |
1804 | ||
1805 | /* struct btrfs_dev_extent */ | |
1806 | BTRFS_SETGET_FUNCS(dev_extent_chunk_tree, struct btrfs_dev_extent, | |
1807 | chunk_tree, 64); | |
1808 | BTRFS_SETGET_FUNCS(dev_extent_chunk_objectid, struct btrfs_dev_extent, | |
1809 | chunk_objectid, 64); | |
1810 | BTRFS_SETGET_FUNCS(dev_extent_chunk_offset, struct btrfs_dev_extent, | |
1811 | chunk_offset, 64); | |
1812 | BTRFS_SETGET_FUNCS(dev_extent_length, struct btrfs_dev_extent, length, 64); | |
1813 | ||
1814 | static inline u8 *btrfs_dev_extent_chunk_tree_uuid(struct btrfs_dev_extent *dev) | |
1815 | { | |
1816 | unsigned long ptr = offsetof(struct btrfs_dev_extent, chunk_tree_uuid); | |
1817 | return (u8 *)((unsigned long)dev + ptr); | |
1818 | } | |
1819 | ||
1820 | BTRFS_SETGET_FUNCS(extent_refs, struct btrfs_extent_item, refs, 64); | |
1821 | BTRFS_SETGET_FUNCS(extent_generation, struct btrfs_extent_item, | |
1822 | generation, 64); | |
1823 | BTRFS_SETGET_FUNCS(extent_flags, struct btrfs_extent_item, flags, 64); | |
1824 | ||
1825 | BTRFS_SETGET_FUNCS(extent_refs_v0, struct btrfs_extent_item_v0, refs, 32); | |
1826 | ||
1827 | ||
1828 | BTRFS_SETGET_FUNCS(tree_block_level, struct btrfs_tree_block_info, level, 8); | |
1829 | ||
1830 | static inline void btrfs_tree_block_key(struct extent_buffer *eb, | |
1831 | struct btrfs_tree_block_info *item, | |
1832 | struct btrfs_disk_key *key) | |
1833 | { | |
1834 | read_eb_member(eb, item, struct btrfs_tree_block_info, key, key); | |
1835 | } | |
1836 | ||
1837 | static inline void btrfs_set_tree_block_key(struct extent_buffer *eb, | |
1838 | struct btrfs_tree_block_info *item, | |
1839 | struct btrfs_disk_key *key) | |
1840 | { | |
1841 | write_eb_member(eb, item, struct btrfs_tree_block_info, key, key); | |
1842 | } | |
1843 | ||
1844 | BTRFS_SETGET_FUNCS(extent_data_ref_root, struct btrfs_extent_data_ref, | |
1845 | root, 64); | |
1846 | BTRFS_SETGET_FUNCS(extent_data_ref_objectid, struct btrfs_extent_data_ref, | |
1847 | objectid, 64); | |
1848 | BTRFS_SETGET_FUNCS(extent_data_ref_offset, struct btrfs_extent_data_ref, | |
1849 | offset, 64); | |
1850 | BTRFS_SETGET_FUNCS(extent_data_ref_count, struct btrfs_extent_data_ref, | |
1851 | count, 32); | |
1852 | ||
1853 | BTRFS_SETGET_FUNCS(shared_data_ref_count, struct btrfs_shared_data_ref, | |
1854 | count, 32); | |
1855 | ||
1856 | BTRFS_SETGET_FUNCS(extent_inline_ref_type, struct btrfs_extent_inline_ref, | |
1857 | type, 8); | |
1858 | BTRFS_SETGET_FUNCS(extent_inline_ref_offset, struct btrfs_extent_inline_ref, | |
1859 | offset, 64); | |
1860 | ||
1861 | static inline u32 btrfs_extent_inline_ref_size(int type) | |
1862 | { | |
1863 | if (type == BTRFS_TREE_BLOCK_REF_KEY || | |
1864 | type == BTRFS_SHARED_BLOCK_REF_KEY) | |
1865 | return sizeof(struct btrfs_extent_inline_ref); | |
1866 | if (type == BTRFS_SHARED_DATA_REF_KEY) | |
1867 | return sizeof(struct btrfs_shared_data_ref) + | |
1868 | sizeof(struct btrfs_extent_inline_ref); | |
1869 | if (type == BTRFS_EXTENT_DATA_REF_KEY) | |
1870 | return sizeof(struct btrfs_extent_data_ref) + | |
1871 | offsetof(struct btrfs_extent_inline_ref, offset); | |
1872 | BUG(); | |
1873 | return 0; | |
1874 | } | |
1875 | ||
1876 | BTRFS_SETGET_FUNCS(ref_root_v0, struct btrfs_extent_ref_v0, root, 64); | |
1877 | BTRFS_SETGET_FUNCS(ref_generation_v0, struct btrfs_extent_ref_v0, | |
1878 | generation, 64); | |
1879 | BTRFS_SETGET_FUNCS(ref_objectid_v0, struct btrfs_extent_ref_v0, objectid, 64); | |
1880 | BTRFS_SETGET_FUNCS(ref_count_v0, struct btrfs_extent_ref_v0, count, 32); | |
1881 | ||
1882 | /* struct btrfs_node */ | |
1883 | BTRFS_SETGET_FUNCS(key_blockptr, struct btrfs_key_ptr, blockptr, 64); | |
1884 | BTRFS_SETGET_FUNCS(key_generation, struct btrfs_key_ptr, generation, 64); | |
1885 | ||
1886 | static inline u64 btrfs_node_blockptr(struct extent_buffer *eb, int nr) | |
1887 | { | |
1888 | unsigned long ptr; | |
1889 | ptr = offsetof(struct btrfs_node, ptrs) + | |
1890 | sizeof(struct btrfs_key_ptr) * nr; | |
1891 | return btrfs_key_blockptr(eb, (struct btrfs_key_ptr *)ptr); | |
1892 | } | |
1893 | ||
1894 | static inline void btrfs_set_node_blockptr(struct extent_buffer *eb, | |
1895 | int nr, u64 val) | |
1896 | { | |
1897 | unsigned long ptr; | |
1898 | ptr = offsetof(struct btrfs_node, ptrs) + | |
1899 | sizeof(struct btrfs_key_ptr) * nr; | |
1900 | btrfs_set_key_blockptr(eb, (struct btrfs_key_ptr *)ptr, val); | |
1901 | } | |
1902 | ||
1903 | static inline u64 btrfs_node_ptr_generation(struct extent_buffer *eb, int nr) | |
1904 | { | |
1905 | unsigned long ptr; | |
1906 | ptr = offsetof(struct btrfs_node, ptrs) + | |
1907 | sizeof(struct btrfs_key_ptr) * nr; | |
1908 | return btrfs_key_generation(eb, (struct btrfs_key_ptr *)ptr); | |
1909 | } | |
1910 | ||
1911 | static inline void btrfs_set_node_ptr_generation(struct extent_buffer *eb, | |
1912 | int nr, u64 val) | |
1913 | { | |
1914 | unsigned long ptr; | |
1915 | ptr = offsetof(struct btrfs_node, ptrs) + | |
1916 | sizeof(struct btrfs_key_ptr) * nr; | |
1917 | btrfs_set_key_generation(eb, (struct btrfs_key_ptr *)ptr, val); | |
1918 | } | |
1919 | ||
1920 | static inline unsigned long btrfs_node_key_ptr_offset(int nr) | |
1921 | { | |
1922 | return offsetof(struct btrfs_node, ptrs) + | |
1923 | sizeof(struct btrfs_key_ptr) * nr; | |
1924 | } | |
1925 | ||
1926 | void btrfs_node_key(struct extent_buffer *eb, | |
1927 | struct btrfs_disk_key *disk_key, int nr); | |
1928 | ||
1929 | static inline void btrfs_set_node_key(struct extent_buffer *eb, | |
1930 | struct btrfs_disk_key *disk_key, int nr) | |
1931 | { | |
1932 | unsigned long ptr; | |
1933 | ptr = btrfs_node_key_ptr_offset(nr); | |
1934 | write_eb_member(eb, (struct btrfs_key_ptr *)ptr, | |
1935 | struct btrfs_key_ptr, key, disk_key); | |
1936 | } | |
1937 | ||
1938 | /* struct btrfs_item */ | |
1939 | BTRFS_SETGET_FUNCS(item_offset, struct btrfs_item, offset, 32); | |
1940 | BTRFS_SETGET_FUNCS(item_size, struct btrfs_item, size, 32); | |
1941 | ||
1942 | static inline unsigned long btrfs_item_nr_offset(int nr) | |
1943 | { | |
1944 | return offsetof(struct btrfs_leaf, items) + | |
1945 | sizeof(struct btrfs_item) * nr; | |
1946 | } | |
1947 | ||
1948 | static inline struct btrfs_item *btrfs_item_nr(struct extent_buffer *eb, | |
1949 | int nr) | |
1950 | { | |
1951 | return (struct btrfs_item *)btrfs_item_nr_offset(nr); | |
1952 | } | |
1953 | ||
1954 | static inline u32 btrfs_item_end(struct extent_buffer *eb, | |
1955 | struct btrfs_item *item) | |
1956 | { | |
1957 | return btrfs_item_offset(eb, item) + btrfs_item_size(eb, item); | |
1958 | } | |
1959 | ||
1960 | static inline u32 btrfs_item_end_nr(struct extent_buffer *eb, int nr) | |
1961 | { | |
1962 | return btrfs_item_end(eb, btrfs_item_nr(eb, nr)); | |
1963 | } | |
1964 | ||
1965 | static inline u32 btrfs_item_offset_nr(struct extent_buffer *eb, int nr) | |
1966 | { | |
1967 | return btrfs_item_offset(eb, btrfs_item_nr(eb, nr)); | |
1968 | } | |
1969 | ||
1970 | static inline u32 btrfs_item_size_nr(struct extent_buffer *eb, int nr) | |
1971 | { | |
1972 | return btrfs_item_size(eb, btrfs_item_nr(eb, nr)); | |
1973 | } | |
1974 | ||
1975 | static inline void btrfs_item_key(struct extent_buffer *eb, | |
1976 | struct btrfs_disk_key *disk_key, int nr) | |
1977 | { | |
1978 | struct btrfs_item *item = btrfs_item_nr(eb, nr); | |
1979 | read_eb_member(eb, item, struct btrfs_item, key, disk_key); | |
1980 | } | |
1981 | ||
1982 | static inline void btrfs_set_item_key(struct extent_buffer *eb, | |
1983 | struct btrfs_disk_key *disk_key, int nr) | |
1984 | { | |
1985 | struct btrfs_item *item = btrfs_item_nr(eb, nr); | |
1986 | write_eb_member(eb, item, struct btrfs_item, key, disk_key); | |
1987 | } | |
1988 | ||
1989 | BTRFS_SETGET_FUNCS(dir_log_end, struct btrfs_dir_log_item, end, 64); | |
1990 | ||
1991 | /* | |
1992 | * struct btrfs_root_ref | |
1993 | */ | |
1994 | BTRFS_SETGET_FUNCS(root_ref_dirid, struct btrfs_root_ref, dirid, 64); | |
1995 | BTRFS_SETGET_FUNCS(root_ref_sequence, struct btrfs_root_ref, sequence, 64); | |
1996 | BTRFS_SETGET_FUNCS(root_ref_name_len, struct btrfs_root_ref, name_len, 16); | |
1997 | ||
1998 | /* struct btrfs_dir_item */ | |
1999 | BTRFS_SETGET_FUNCS(dir_data_len, struct btrfs_dir_item, data_len, 16); | |
2000 | BTRFS_SETGET_FUNCS(dir_type, struct btrfs_dir_item, type, 8); | |
2001 | BTRFS_SETGET_FUNCS(dir_name_len, struct btrfs_dir_item, name_len, 16); | |
2002 | BTRFS_SETGET_FUNCS(dir_transid, struct btrfs_dir_item, transid, 64); | |
2003 | ||
2004 | static inline void btrfs_dir_item_key(struct extent_buffer *eb, | |
2005 | struct btrfs_dir_item *item, | |
2006 | struct btrfs_disk_key *key) | |
2007 | { | |
2008 | read_eb_member(eb, item, struct btrfs_dir_item, location, key); | |
2009 | } | |
2010 | ||
2011 | static inline void btrfs_set_dir_item_key(struct extent_buffer *eb, | |
2012 | struct btrfs_dir_item *item, | |
2013 | struct btrfs_disk_key *key) | |
2014 | { | |
2015 | write_eb_member(eb, item, struct btrfs_dir_item, location, key); | |
2016 | } | |
2017 | ||
2018 | BTRFS_SETGET_FUNCS(free_space_entries, struct btrfs_free_space_header, | |
2019 | num_entries, 64); | |
2020 | BTRFS_SETGET_FUNCS(free_space_bitmaps, struct btrfs_free_space_header, | |
2021 | num_bitmaps, 64); | |
2022 | BTRFS_SETGET_FUNCS(free_space_generation, struct btrfs_free_space_header, | |
2023 | generation, 64); | |
2024 | ||
2025 | static inline void btrfs_free_space_key(struct extent_buffer *eb, | |
2026 | struct btrfs_free_space_header *h, | |
2027 | struct btrfs_disk_key *key) | |
2028 | { | |
2029 | read_eb_member(eb, h, struct btrfs_free_space_header, location, key); | |
2030 | } | |
2031 | ||
2032 | static inline void btrfs_set_free_space_key(struct extent_buffer *eb, | |
2033 | struct btrfs_free_space_header *h, | |
2034 | struct btrfs_disk_key *key) | |
2035 | { | |
2036 | write_eb_member(eb, h, struct btrfs_free_space_header, location, key); | |
2037 | } | |
2038 | ||
2039 | /* struct btrfs_disk_key */ | |
2040 | BTRFS_SETGET_STACK_FUNCS(disk_key_objectid, struct btrfs_disk_key, | |
2041 | objectid, 64); | |
2042 | BTRFS_SETGET_STACK_FUNCS(disk_key_offset, struct btrfs_disk_key, offset, 64); | |
2043 | BTRFS_SETGET_STACK_FUNCS(disk_key_type, struct btrfs_disk_key, type, 8); | |
2044 | ||
2045 | static inline void btrfs_disk_key_to_cpu(struct btrfs_key *cpu, | |
2046 | struct btrfs_disk_key *disk) | |
2047 | { | |
2048 | cpu->offset = le64_to_cpu(disk->offset); | |
2049 | cpu->type = disk->type; | |
2050 | cpu->objectid = le64_to_cpu(disk->objectid); | |
2051 | } | |
2052 | ||
2053 | static inline void btrfs_cpu_key_to_disk(struct btrfs_disk_key *disk, | |
2054 | struct btrfs_key *cpu) | |
2055 | { | |
2056 | disk->offset = cpu_to_le64(cpu->offset); | |
2057 | disk->type = cpu->type; | |
2058 | disk->objectid = cpu_to_le64(cpu->objectid); | |
2059 | } | |
2060 | ||
2061 | static inline void btrfs_node_key_to_cpu(struct extent_buffer *eb, | |
2062 | struct btrfs_key *key, int nr) | |
2063 | { | |
2064 | struct btrfs_disk_key disk_key; | |
2065 | btrfs_node_key(eb, &disk_key, nr); | |
2066 | btrfs_disk_key_to_cpu(key, &disk_key); | |
2067 | } | |
2068 | ||
2069 | static inline void btrfs_item_key_to_cpu(struct extent_buffer *eb, | |
2070 | struct btrfs_key *key, int nr) | |
2071 | { | |
2072 | struct btrfs_disk_key disk_key; | |
2073 | btrfs_item_key(eb, &disk_key, nr); | |
2074 | btrfs_disk_key_to_cpu(key, &disk_key); | |
2075 | } | |
2076 | ||
2077 | static inline void btrfs_dir_item_key_to_cpu(struct extent_buffer *eb, | |
2078 | struct btrfs_dir_item *item, | |
2079 | struct btrfs_key *key) | |
2080 | { | |
2081 | struct btrfs_disk_key disk_key; | |
2082 | btrfs_dir_item_key(eb, item, &disk_key); | |
2083 | btrfs_disk_key_to_cpu(key, &disk_key); | |
2084 | } | |
2085 | ||
2086 | ||
2087 | static inline u8 btrfs_key_type(struct btrfs_key *key) | |
2088 | { | |
2089 | return key->type; | |
2090 | } | |
2091 | ||
2092 | static inline void btrfs_set_key_type(struct btrfs_key *key, u8 val) | |
2093 | { | |
2094 | key->type = val; | |
2095 | } | |
2096 | ||
2097 | /* struct btrfs_header */ | |
2098 | BTRFS_SETGET_HEADER_FUNCS(header_bytenr, struct btrfs_header, bytenr, 64); | |
2099 | BTRFS_SETGET_HEADER_FUNCS(header_generation, struct btrfs_header, | |
2100 | generation, 64); | |
2101 | BTRFS_SETGET_HEADER_FUNCS(header_owner, struct btrfs_header, owner, 64); | |
2102 | BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32); | |
2103 | BTRFS_SETGET_HEADER_FUNCS(header_flags, struct btrfs_header, flags, 64); | |
2104 | BTRFS_SETGET_HEADER_FUNCS(header_level, struct btrfs_header, level, 8); | |
2105 | ||
2106 | static inline int btrfs_header_flag(struct extent_buffer *eb, u64 flag) | |
2107 | { | |
2108 | return (btrfs_header_flags(eb) & flag) == flag; | |
2109 | } | |
2110 | ||
2111 | static inline int btrfs_set_header_flag(struct extent_buffer *eb, u64 flag) | |
2112 | { | |
2113 | u64 flags = btrfs_header_flags(eb); | |
2114 | btrfs_set_header_flags(eb, flags | flag); | |
2115 | return (flags & flag) == flag; | |
2116 | } | |
2117 | ||
2118 | static inline int btrfs_clear_header_flag(struct extent_buffer *eb, u64 flag) | |
2119 | { | |
2120 | u64 flags = btrfs_header_flags(eb); | |
2121 | btrfs_set_header_flags(eb, flags & ~flag); | |
2122 | return (flags & flag) == flag; | |
2123 | } | |
2124 | ||
2125 | static inline int btrfs_header_backref_rev(struct extent_buffer *eb) | |
2126 | { | |
2127 | u64 flags = btrfs_header_flags(eb); | |
2128 | return flags >> BTRFS_BACKREF_REV_SHIFT; | |
2129 | } | |
2130 | ||
2131 | static inline void btrfs_set_header_backref_rev(struct extent_buffer *eb, | |
2132 | int rev) | |
2133 | { | |
2134 | u64 flags = btrfs_header_flags(eb); | |
2135 | flags &= ~BTRFS_BACKREF_REV_MASK; | |
2136 | flags |= (u64)rev << BTRFS_BACKREF_REV_SHIFT; | |
2137 | btrfs_set_header_flags(eb, flags); | |
2138 | } | |
2139 | ||
2140 | static inline u8 *btrfs_header_fsid(struct extent_buffer *eb) | |
2141 | { | |
2142 | unsigned long ptr = offsetof(struct btrfs_header, fsid); | |
2143 | return (u8 *)ptr; | |
2144 | } | |
2145 | ||
2146 | static inline u8 *btrfs_header_chunk_tree_uuid(struct extent_buffer *eb) | |
2147 | { | |
2148 | unsigned long ptr = offsetof(struct btrfs_header, chunk_tree_uuid); | |
2149 | return (u8 *)ptr; | |
2150 | } | |
2151 | ||
2152 | static inline int btrfs_is_leaf(struct extent_buffer *eb) | |
2153 | { | |
2154 | return btrfs_header_level(eb) == 0; | |
2155 | } | |
2156 | ||
2157 | /* struct btrfs_root_item */ | |
2158 | BTRFS_SETGET_FUNCS(disk_root_generation, struct btrfs_root_item, | |
2159 | generation, 64); | |
2160 | BTRFS_SETGET_FUNCS(disk_root_refs, struct btrfs_root_item, refs, 32); | |
2161 | BTRFS_SETGET_FUNCS(disk_root_bytenr, struct btrfs_root_item, bytenr, 64); | |
2162 | BTRFS_SETGET_FUNCS(disk_root_level, struct btrfs_root_item, level, 8); | |
2163 | ||
2164 | BTRFS_SETGET_STACK_FUNCS(root_generation, struct btrfs_root_item, | |
2165 | generation, 64); | |
2166 | BTRFS_SETGET_STACK_FUNCS(root_bytenr, struct btrfs_root_item, bytenr, 64); | |
2167 | BTRFS_SETGET_STACK_FUNCS(root_level, struct btrfs_root_item, level, 8); | |
2168 | BTRFS_SETGET_STACK_FUNCS(root_dirid, struct btrfs_root_item, root_dirid, 64); | |
2169 | BTRFS_SETGET_STACK_FUNCS(root_refs, struct btrfs_root_item, refs, 32); | |
2170 | BTRFS_SETGET_STACK_FUNCS(root_flags, struct btrfs_root_item, flags, 64); | |
2171 | BTRFS_SETGET_STACK_FUNCS(root_used, struct btrfs_root_item, bytes_used, 64); | |
2172 | BTRFS_SETGET_STACK_FUNCS(root_limit, struct btrfs_root_item, byte_limit, 64); | |
2173 | BTRFS_SETGET_STACK_FUNCS(root_last_snapshot, struct btrfs_root_item, | |
2174 | last_snapshot, 64); | |
2175 | ||
2176 | static inline bool btrfs_root_readonly(struct btrfs_root *root) | |
2177 | { | |
2178 | return root->root_item.flags & BTRFS_ROOT_SUBVOL_RDONLY; | |
2179 | } | |
2180 | ||
2181 | /* struct btrfs_root_backup */ | |
2182 | BTRFS_SETGET_STACK_FUNCS(backup_tree_root, struct btrfs_root_backup, | |
2183 | tree_root, 64); | |
2184 | BTRFS_SETGET_STACK_FUNCS(backup_tree_root_gen, struct btrfs_root_backup, | |
2185 | tree_root_gen, 64); | |
2186 | BTRFS_SETGET_STACK_FUNCS(backup_tree_root_level, struct btrfs_root_backup, | |
2187 | tree_root_level, 8); | |
2188 | ||
2189 | BTRFS_SETGET_STACK_FUNCS(backup_chunk_root, struct btrfs_root_backup, | |
2190 | chunk_root, 64); | |
2191 | BTRFS_SETGET_STACK_FUNCS(backup_chunk_root_gen, struct btrfs_root_backup, | |
2192 | chunk_root_gen, 64); | |
2193 | BTRFS_SETGET_STACK_FUNCS(backup_chunk_root_level, struct btrfs_root_backup, | |
2194 | chunk_root_level, 8); | |
2195 | ||
2196 | BTRFS_SETGET_STACK_FUNCS(backup_extent_root, struct btrfs_root_backup, | |
2197 | extent_root, 64); | |
2198 | BTRFS_SETGET_STACK_FUNCS(backup_extent_root_gen, struct btrfs_root_backup, | |
2199 | extent_root_gen, 64); | |
2200 | BTRFS_SETGET_STACK_FUNCS(backup_extent_root_level, struct btrfs_root_backup, | |
2201 | extent_root_level, 8); | |
2202 | ||
2203 | BTRFS_SETGET_STACK_FUNCS(backup_fs_root, struct btrfs_root_backup, | |
2204 | fs_root, 64); | |
2205 | BTRFS_SETGET_STACK_FUNCS(backup_fs_root_gen, struct btrfs_root_backup, | |
2206 | fs_root_gen, 64); | |
2207 | BTRFS_SETGET_STACK_FUNCS(backup_fs_root_level, struct btrfs_root_backup, | |
2208 | fs_root_level, 8); | |
2209 | ||
2210 | BTRFS_SETGET_STACK_FUNCS(backup_dev_root, struct btrfs_root_backup, | |
2211 | dev_root, 64); | |
2212 | BTRFS_SETGET_STACK_FUNCS(backup_dev_root_gen, struct btrfs_root_backup, | |
2213 | dev_root_gen, 64); | |
2214 | BTRFS_SETGET_STACK_FUNCS(backup_dev_root_level, struct btrfs_root_backup, | |
2215 | dev_root_level, 8); | |
2216 | ||
2217 | BTRFS_SETGET_STACK_FUNCS(backup_csum_root, struct btrfs_root_backup, | |
2218 | csum_root, 64); | |
2219 | BTRFS_SETGET_STACK_FUNCS(backup_csum_root_gen, struct btrfs_root_backup, | |
2220 | csum_root_gen, 64); | |
2221 | BTRFS_SETGET_STACK_FUNCS(backup_csum_root_level, struct btrfs_root_backup, | |
2222 | csum_root_level, 8); | |
2223 | BTRFS_SETGET_STACK_FUNCS(backup_total_bytes, struct btrfs_root_backup, | |
2224 | total_bytes, 64); | |
2225 | BTRFS_SETGET_STACK_FUNCS(backup_bytes_used, struct btrfs_root_backup, | |
2226 | bytes_used, 64); | |
2227 | BTRFS_SETGET_STACK_FUNCS(backup_num_devices, struct btrfs_root_backup, | |
2228 | num_devices, 64); | |
2229 | ||
2230 | /* struct btrfs_balance_item */ | |
2231 | BTRFS_SETGET_FUNCS(balance_flags, struct btrfs_balance_item, flags, 64); | |
2232 | ||
2233 | static inline void btrfs_balance_data(struct extent_buffer *eb, | |
2234 | struct btrfs_balance_item *bi, | |
2235 | struct btrfs_disk_balance_args *ba) | |
2236 | { | |
2237 | read_eb_member(eb, bi, struct btrfs_balance_item, data, ba); | |
2238 | } | |
2239 | ||
2240 | static inline void btrfs_set_balance_data(struct extent_buffer *eb, | |
2241 | struct btrfs_balance_item *bi, | |
2242 | struct btrfs_disk_balance_args *ba) | |
2243 | { | |
2244 | write_eb_member(eb, bi, struct btrfs_balance_item, data, ba); | |
2245 | } | |
2246 | ||
2247 | static inline void btrfs_balance_meta(struct extent_buffer *eb, | |
2248 | struct btrfs_balance_item *bi, | |
2249 | struct btrfs_disk_balance_args *ba) | |
2250 | { | |
2251 | read_eb_member(eb, bi, struct btrfs_balance_item, meta, ba); | |
2252 | } | |
2253 | ||
2254 | static inline void btrfs_set_balance_meta(struct extent_buffer *eb, | |
2255 | struct btrfs_balance_item *bi, | |
2256 | struct btrfs_disk_balance_args *ba) | |
2257 | { | |
2258 | write_eb_member(eb, bi, struct btrfs_balance_item, meta, ba); | |
2259 | } | |
2260 | ||
2261 | static inline void btrfs_balance_sys(struct extent_buffer *eb, | |
2262 | struct btrfs_balance_item *bi, | |
2263 | struct btrfs_disk_balance_args *ba) | |
2264 | { | |
2265 | read_eb_member(eb, bi, struct btrfs_balance_item, sys, ba); | |
2266 | } | |
2267 | ||
2268 | static inline void btrfs_set_balance_sys(struct extent_buffer *eb, | |
2269 | struct btrfs_balance_item *bi, | |
2270 | struct btrfs_disk_balance_args *ba) | |
2271 | { | |
2272 | write_eb_member(eb, bi, struct btrfs_balance_item, sys, ba); | |
2273 | } | |
2274 | ||
2275 | static inline void | |
2276 | btrfs_disk_balance_args_to_cpu(struct btrfs_balance_args *cpu, | |
2277 | struct btrfs_disk_balance_args *disk) | |
2278 | { | |
2279 | memset(cpu, 0, sizeof(*cpu)); | |
2280 | ||
2281 | cpu->profiles = le64_to_cpu(disk->profiles); | |
2282 | cpu->usage = le64_to_cpu(disk->usage); | |
2283 | cpu->devid = le64_to_cpu(disk->devid); | |
2284 | cpu->pstart = le64_to_cpu(disk->pstart); | |
2285 | cpu->pend = le64_to_cpu(disk->pend); | |
2286 | cpu->vstart = le64_to_cpu(disk->vstart); | |
2287 | cpu->vend = le64_to_cpu(disk->vend); | |
2288 | cpu->target = le64_to_cpu(disk->target); | |
2289 | cpu->flags = le64_to_cpu(disk->flags); | |
2290 | } | |
2291 | ||
2292 | static inline void | |
2293 | btrfs_cpu_balance_args_to_disk(struct btrfs_disk_balance_args *disk, | |
2294 | struct btrfs_balance_args *cpu) | |
2295 | { | |
2296 | memset(disk, 0, sizeof(*disk)); | |
2297 | ||
2298 | disk->profiles = cpu_to_le64(cpu->profiles); | |
2299 | disk->usage = cpu_to_le64(cpu->usage); | |
2300 | disk->devid = cpu_to_le64(cpu->devid); | |
2301 | disk->pstart = cpu_to_le64(cpu->pstart); | |
2302 | disk->pend = cpu_to_le64(cpu->pend); | |
2303 | disk->vstart = cpu_to_le64(cpu->vstart); | |
2304 | disk->vend = cpu_to_le64(cpu->vend); | |
2305 | disk->target = cpu_to_le64(cpu->target); | |
2306 | disk->flags = cpu_to_le64(cpu->flags); | |
2307 | } | |
2308 | ||
2309 | /* struct btrfs_super_block */ | |
2310 | BTRFS_SETGET_STACK_FUNCS(super_bytenr, struct btrfs_super_block, bytenr, 64); | |
2311 | BTRFS_SETGET_STACK_FUNCS(super_flags, struct btrfs_super_block, flags, 64); | |
2312 | BTRFS_SETGET_STACK_FUNCS(super_generation, struct btrfs_super_block, | |
2313 | generation, 64); | |
2314 | BTRFS_SETGET_STACK_FUNCS(super_root, struct btrfs_super_block, root, 64); | |
2315 | BTRFS_SETGET_STACK_FUNCS(super_sys_array_size, | |
2316 | struct btrfs_super_block, sys_chunk_array_size, 32); | |
2317 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root_generation, | |
2318 | struct btrfs_super_block, chunk_root_generation, 64); | |
2319 | BTRFS_SETGET_STACK_FUNCS(super_root_level, struct btrfs_super_block, | |
2320 | root_level, 8); | |
2321 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root, struct btrfs_super_block, | |
2322 | chunk_root, 64); | |
2323 | BTRFS_SETGET_STACK_FUNCS(super_chunk_root_level, struct btrfs_super_block, | |
2324 | chunk_root_level, 8); | |
2325 | BTRFS_SETGET_STACK_FUNCS(super_log_root, struct btrfs_super_block, | |
2326 | log_root, 64); | |
2327 | BTRFS_SETGET_STACK_FUNCS(super_log_root_transid, struct btrfs_super_block, | |
2328 | log_root_transid, 64); | |
2329 | BTRFS_SETGET_STACK_FUNCS(super_log_root_level, struct btrfs_super_block, | |
2330 | log_root_level, 8); | |
2331 | BTRFS_SETGET_STACK_FUNCS(super_total_bytes, struct btrfs_super_block, | |
2332 | total_bytes, 64); | |
2333 | BTRFS_SETGET_STACK_FUNCS(super_bytes_used, struct btrfs_super_block, | |
2334 | bytes_used, 64); | |
2335 | BTRFS_SETGET_STACK_FUNCS(super_sectorsize, struct btrfs_super_block, | |
2336 | sectorsize, 32); | |
2337 | BTRFS_SETGET_STACK_FUNCS(super_nodesize, struct btrfs_super_block, | |
2338 | nodesize, 32); | |
2339 | BTRFS_SETGET_STACK_FUNCS(super_leafsize, struct btrfs_super_block, | |
2340 | leafsize, 32); | |
2341 | BTRFS_SETGET_STACK_FUNCS(super_stripesize, struct btrfs_super_block, | |
2342 | stripesize, 32); | |
2343 | BTRFS_SETGET_STACK_FUNCS(super_root_dir, struct btrfs_super_block, | |
2344 | root_dir_objectid, 64); | |
2345 | BTRFS_SETGET_STACK_FUNCS(super_num_devices, struct btrfs_super_block, | |
2346 | num_devices, 64); | |
2347 | BTRFS_SETGET_STACK_FUNCS(super_compat_flags, struct btrfs_super_block, | |
2348 | compat_flags, 64); | |
2349 | BTRFS_SETGET_STACK_FUNCS(super_compat_ro_flags, struct btrfs_super_block, | |
2350 | compat_ro_flags, 64); | |
2351 | BTRFS_SETGET_STACK_FUNCS(super_incompat_flags, struct btrfs_super_block, | |
2352 | incompat_flags, 64); | |
2353 | BTRFS_SETGET_STACK_FUNCS(super_csum_type, struct btrfs_super_block, | |
2354 | csum_type, 16); | |
2355 | BTRFS_SETGET_STACK_FUNCS(super_cache_generation, struct btrfs_super_block, | |
2356 | cache_generation, 64); | |
2357 | ||
2358 | static inline int btrfs_super_csum_size(struct btrfs_super_block *s) | |
2359 | { | |
2360 | int t = btrfs_super_csum_type(s); | |
2361 | BUG_ON(t >= ARRAY_SIZE(btrfs_csum_sizes)); | |
2362 | return btrfs_csum_sizes[t]; | |
2363 | } | |
2364 | ||
2365 | static inline unsigned long btrfs_leaf_data(struct extent_buffer *l) | |
2366 | { | |
2367 | return offsetof(struct btrfs_leaf, items); | |
2368 | } | |
2369 | ||
2370 | /* struct btrfs_file_extent_item */ | |
2371 | BTRFS_SETGET_FUNCS(file_extent_type, struct btrfs_file_extent_item, type, 8); | |
2372 | ||
2373 | static inline unsigned long | |
2374 | btrfs_file_extent_inline_start(struct btrfs_file_extent_item *e) | |
2375 | { | |
2376 | unsigned long offset = (unsigned long)e; | |
2377 | offset += offsetof(struct btrfs_file_extent_item, disk_bytenr); | |
2378 | return offset; | |
2379 | } | |
2380 | ||
2381 | static inline u32 btrfs_file_extent_calc_inline_size(u32 datasize) | |
2382 | { | |
2383 | return offsetof(struct btrfs_file_extent_item, disk_bytenr) + datasize; | |
2384 | } | |
2385 | ||
2386 | BTRFS_SETGET_FUNCS(file_extent_disk_bytenr, struct btrfs_file_extent_item, | |
2387 | disk_bytenr, 64); | |
2388 | BTRFS_SETGET_FUNCS(file_extent_generation, struct btrfs_file_extent_item, | |
2389 | generation, 64); | |
2390 | BTRFS_SETGET_FUNCS(file_extent_disk_num_bytes, struct btrfs_file_extent_item, | |
2391 | disk_num_bytes, 64); | |
2392 | BTRFS_SETGET_FUNCS(file_extent_offset, struct btrfs_file_extent_item, | |
2393 | offset, 64); | |
2394 | BTRFS_SETGET_FUNCS(file_extent_num_bytes, struct btrfs_file_extent_item, | |
2395 | num_bytes, 64); | |
2396 | BTRFS_SETGET_FUNCS(file_extent_ram_bytes, struct btrfs_file_extent_item, | |
2397 | ram_bytes, 64); | |
2398 | BTRFS_SETGET_FUNCS(file_extent_compression, struct btrfs_file_extent_item, | |
2399 | compression, 8); | |
2400 | BTRFS_SETGET_FUNCS(file_extent_encryption, struct btrfs_file_extent_item, | |
2401 | encryption, 8); | |
2402 | BTRFS_SETGET_FUNCS(file_extent_other_encoding, struct btrfs_file_extent_item, | |
2403 | other_encoding, 16); | |
2404 | ||
2405 | /* this returns the number of file bytes represented by the inline item. | |
2406 | * If an item is compressed, this is the uncompressed size | |
2407 | */ | |
2408 | static inline u32 btrfs_file_extent_inline_len(struct extent_buffer *eb, | |
2409 | struct btrfs_file_extent_item *e) | |
2410 | { | |
2411 | return btrfs_file_extent_ram_bytes(eb, e); | |
2412 | } | |
2413 | ||
2414 | /* | |
2415 | * this returns the number of bytes used by the item on disk, minus the | |
2416 | * size of any extent headers. If a file is compressed on disk, this is | |
2417 | * the compressed size | |
2418 | */ | |
2419 | static inline u32 btrfs_file_extent_inline_item_len(struct extent_buffer *eb, | |
2420 | struct btrfs_item *e) | |
2421 | { | |
2422 | unsigned long offset; | |
2423 | offset = offsetof(struct btrfs_file_extent_item, disk_bytenr); | |
2424 | return btrfs_item_size(eb, e) - offset; | |
2425 | } | |
2426 | ||
2427 | static inline struct btrfs_fs_info *btrfs_sb(struct super_block *sb) | |
2428 | { | |
2429 | return sb->s_fs_info; | |
2430 | } | |
2431 | ||
2432 | static inline u32 btrfs_level_size(struct btrfs_root *root, int level) | |
2433 | { | |
2434 | if (level == 0) | |
2435 | return root->leafsize; | |
2436 | return root->nodesize; | |
2437 | } | |
2438 | ||
2439 | /* helper function to cast into the data area of the leaf. */ | |
2440 | #define btrfs_item_ptr(leaf, slot, type) \ | |
2441 | ((type *)(btrfs_leaf_data(leaf) + \ | |
2442 | btrfs_item_offset_nr(leaf, slot))) | |
2443 | ||
2444 | #define btrfs_item_ptr_offset(leaf, slot) \ | |
2445 | ((unsigned long)(btrfs_leaf_data(leaf) + \ | |
2446 | btrfs_item_offset_nr(leaf, slot))) | |
2447 | ||
2448 | static inline struct dentry *fdentry(struct file *file) | |
2449 | { | |
2450 | return file->f_path.dentry; | |
2451 | } | |
2452 | ||
2453 | static inline bool btrfs_mixed_space_info(struct btrfs_space_info *space_info) | |
2454 | { | |
2455 | return ((space_info->flags & BTRFS_BLOCK_GROUP_METADATA) && | |
2456 | (space_info->flags & BTRFS_BLOCK_GROUP_DATA)); | |
2457 | } | |
2458 | ||
2459 | static inline gfp_t btrfs_alloc_write_mask(struct address_space *mapping) | |
2460 | { | |
2461 | return mapping_gfp_mask(mapping) & ~__GFP_FS; | |
2462 | } | |
2463 | ||
2464 | /* extent-tree.c */ | |
2465 | static inline u64 btrfs_calc_trans_metadata_size(struct btrfs_root *root, | |
2466 | unsigned num_items) | |
2467 | { | |
2468 | return (root->leafsize + root->nodesize * (BTRFS_MAX_LEVEL - 1)) * | |
2469 | 3 * num_items; | |
2470 | } | |
2471 | ||
2472 | /* | |
2473 | * Doing a truncate won't result in new nodes or leaves, just what we need for | |
2474 | * COW. | |
2475 | */ | |
2476 | static inline u64 btrfs_calc_trunc_metadata_size(struct btrfs_root *root, | |
2477 | unsigned num_items) | |
2478 | { | |
2479 | return (root->leafsize + root->nodesize * (BTRFS_MAX_LEVEL - 1)) * | |
2480 | num_items; | |
2481 | } | |
2482 | ||
2483 | void btrfs_put_block_group(struct btrfs_block_group_cache *cache); | |
2484 | int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans, | |
2485 | struct btrfs_root *root, unsigned long count); | |
2486 | int btrfs_lookup_extent(struct btrfs_root *root, u64 start, u64 len); | |
2487 | int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans, | |
2488 | struct btrfs_root *root, u64 bytenr, | |
2489 | u64 num_bytes, u64 *refs, u64 *flags); | |
2490 | int btrfs_pin_extent(struct btrfs_root *root, | |
2491 | u64 bytenr, u64 num, int reserved); | |
2492 | int btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle *trans, | |
2493 | struct btrfs_root *root, | |
2494 | u64 bytenr, u64 num_bytes); | |
2495 | int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans, | |
2496 | struct btrfs_root *root, | |
2497 | u64 objectid, u64 offset, u64 bytenr); | |
2498 | struct btrfs_block_group_cache *btrfs_lookup_block_group( | |
2499 | struct btrfs_fs_info *info, | |
2500 | u64 bytenr); | |
2501 | void btrfs_put_block_group(struct btrfs_block_group_cache *cache); | |
2502 | u64 btrfs_find_block_group(struct btrfs_root *root, | |
2503 | u64 search_start, u64 search_hint, int owner); | |
2504 | struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans, | |
2505 | struct btrfs_root *root, u32 blocksize, | |
2506 | u64 parent, u64 root_objectid, | |
2507 | struct btrfs_disk_key *key, int level, | |
2508 | u64 hint, u64 empty_size); | |
2509 | void btrfs_free_tree_block(struct btrfs_trans_handle *trans, | |
2510 | struct btrfs_root *root, | |
2511 | struct extent_buffer *buf, | |
2512 | u64 parent, int last_ref); | |
2513 | struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans, | |
2514 | struct btrfs_root *root, | |
2515 | u64 bytenr, u32 blocksize, | |
2516 | int level); | |
2517 | int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans, | |
2518 | struct btrfs_root *root, | |
2519 | u64 root_objectid, u64 owner, | |
2520 | u64 offset, struct btrfs_key *ins); | |
2521 | int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans, | |
2522 | struct btrfs_root *root, | |
2523 | u64 root_objectid, u64 owner, u64 offset, | |
2524 | struct btrfs_key *ins); | |
2525 | int btrfs_reserve_extent(struct btrfs_trans_handle *trans, | |
2526 | struct btrfs_root *root, | |
2527 | u64 num_bytes, u64 min_alloc_size, | |
2528 | u64 empty_size, u64 hint_byte, | |
2529 | struct btrfs_key *ins, u64 data); | |
2530 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
2531 | struct extent_buffer *buf, int full_backref, int for_cow); | |
2532 | int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
2533 | struct extent_buffer *buf, int full_backref, int for_cow); | |
2534 | int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans, | |
2535 | struct btrfs_root *root, | |
2536 | u64 bytenr, u64 num_bytes, u64 flags, | |
2537 | int is_data); | |
2538 | int btrfs_free_extent(struct btrfs_trans_handle *trans, | |
2539 | struct btrfs_root *root, | |
2540 | u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, | |
2541 | u64 owner, u64 offset, int for_cow); | |
2542 | ||
2543 | int btrfs_free_reserved_extent(struct btrfs_root *root, u64 start, u64 len); | |
2544 | int btrfs_free_and_pin_reserved_extent(struct btrfs_root *root, | |
2545 | u64 start, u64 len); | |
2546 | void btrfs_prepare_extent_commit(struct btrfs_trans_handle *trans, | |
2547 | struct btrfs_root *root); | |
2548 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, | |
2549 | struct btrfs_root *root); | |
2550 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, | |
2551 | struct btrfs_root *root, | |
2552 | u64 bytenr, u64 num_bytes, u64 parent, | |
2553 | u64 root_objectid, u64 owner, u64 offset, int for_cow); | |
2554 | ||
2555 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, | |
2556 | struct btrfs_root *root); | |
2557 | int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr); | |
2558 | int btrfs_free_block_groups(struct btrfs_fs_info *info); | |
2559 | int btrfs_read_block_groups(struct btrfs_root *root); | |
2560 | int btrfs_can_relocate(struct btrfs_root *root, u64 bytenr); | |
2561 | int btrfs_make_block_group(struct btrfs_trans_handle *trans, | |
2562 | struct btrfs_root *root, u64 bytes_used, | |
2563 | u64 type, u64 chunk_objectid, u64 chunk_offset, | |
2564 | u64 size); | |
2565 | int btrfs_remove_block_group(struct btrfs_trans_handle *trans, | |
2566 | struct btrfs_root *root, u64 group_start); | |
2567 | u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags); | |
2568 | u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data); | |
2569 | void btrfs_set_inode_space_info(struct btrfs_root *root, struct inode *ionde); | |
2570 | void btrfs_clear_space_info_full(struct btrfs_fs_info *info); | |
2571 | int btrfs_check_data_free_space(struct inode *inode, u64 bytes); | |
2572 | void btrfs_free_reserved_data_space(struct inode *inode, u64 bytes); | |
2573 | void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans, | |
2574 | struct btrfs_root *root); | |
2575 | int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans, | |
2576 | struct inode *inode); | |
2577 | void btrfs_orphan_release_metadata(struct inode *inode); | |
2578 | int btrfs_snap_reserve_metadata(struct btrfs_trans_handle *trans, | |
2579 | struct btrfs_pending_snapshot *pending); | |
2580 | int btrfs_delalloc_reserve_metadata(struct inode *inode, u64 num_bytes); | |
2581 | void btrfs_delalloc_release_metadata(struct inode *inode, u64 num_bytes); | |
2582 | int btrfs_delalloc_reserve_space(struct inode *inode, u64 num_bytes); | |
2583 | void btrfs_delalloc_release_space(struct inode *inode, u64 num_bytes); | |
2584 | void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv); | |
2585 | struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_root *root); | |
2586 | void btrfs_free_block_rsv(struct btrfs_root *root, | |
2587 | struct btrfs_block_rsv *rsv); | |
2588 | int btrfs_block_rsv_add(struct btrfs_root *root, | |
2589 | struct btrfs_block_rsv *block_rsv, | |
2590 | u64 num_bytes); | |
2591 | int btrfs_block_rsv_add_noflush(struct btrfs_root *root, | |
2592 | struct btrfs_block_rsv *block_rsv, | |
2593 | u64 num_bytes); | |
2594 | int btrfs_block_rsv_check(struct btrfs_root *root, | |
2595 | struct btrfs_block_rsv *block_rsv, int min_factor); | |
2596 | int btrfs_block_rsv_refill(struct btrfs_root *root, | |
2597 | struct btrfs_block_rsv *block_rsv, | |
2598 | u64 min_reserved); | |
2599 | int btrfs_block_rsv_refill_noflush(struct btrfs_root *root, | |
2600 | struct btrfs_block_rsv *block_rsv, | |
2601 | u64 min_reserved); | |
2602 | int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src_rsv, | |
2603 | struct btrfs_block_rsv *dst_rsv, | |
2604 | u64 num_bytes); | |
2605 | void btrfs_block_rsv_release(struct btrfs_root *root, | |
2606 | struct btrfs_block_rsv *block_rsv, | |
2607 | u64 num_bytes); | |
2608 | int btrfs_set_block_group_ro(struct btrfs_root *root, | |
2609 | struct btrfs_block_group_cache *cache); | |
2610 | void btrfs_set_block_group_rw(struct btrfs_root *root, | |
2611 | struct btrfs_block_group_cache *cache); | |
2612 | void btrfs_put_block_group_cache(struct btrfs_fs_info *info); | |
2613 | u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo); | |
2614 | int btrfs_error_unpin_extent_range(struct btrfs_root *root, | |
2615 | u64 start, u64 end); | |
2616 | int btrfs_error_discard_extent(struct btrfs_root *root, u64 bytenr, | |
2617 | u64 num_bytes, u64 *actual_bytes); | |
2618 | int btrfs_force_chunk_alloc(struct btrfs_trans_handle *trans, | |
2619 | struct btrfs_root *root, u64 type); | |
2620 | int btrfs_trim_fs(struct btrfs_root *root, struct fstrim_range *range); | |
2621 | ||
2622 | int btrfs_init_space_info(struct btrfs_fs_info *fs_info); | |
2623 | /* ctree.c */ | |
2624 | int btrfs_bin_search(struct extent_buffer *eb, struct btrfs_key *key, | |
2625 | int level, int *slot); | |
2626 | int btrfs_comp_cpu_keys(struct btrfs_key *k1, struct btrfs_key *k2); | |
2627 | int btrfs_previous_item(struct btrfs_root *root, | |
2628 | struct btrfs_path *path, u64 min_objectid, | |
2629 | int type); | |
2630 | void btrfs_set_item_key_safe(struct btrfs_trans_handle *trans, | |
2631 | struct btrfs_root *root, struct btrfs_path *path, | |
2632 | struct btrfs_key *new_key); | |
2633 | struct extent_buffer *btrfs_root_node(struct btrfs_root *root); | |
2634 | struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root); | |
2635 | int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, | |
2636 | struct btrfs_key *key, int lowest_level, | |
2637 | int cache_only, u64 min_trans); | |
2638 | int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, | |
2639 | struct btrfs_key *max_key, | |
2640 | struct btrfs_path *path, int cache_only, | |
2641 | u64 min_trans); | |
2642 | int btrfs_cow_block(struct btrfs_trans_handle *trans, | |
2643 | struct btrfs_root *root, struct extent_buffer *buf, | |
2644 | struct extent_buffer *parent, int parent_slot, | |
2645 | struct extent_buffer **cow_ret); | |
2646 | int btrfs_copy_root(struct btrfs_trans_handle *trans, | |
2647 | struct btrfs_root *root, | |
2648 | struct extent_buffer *buf, | |
2649 | struct extent_buffer **cow_ret, u64 new_root_objectid); | |
2650 | int btrfs_block_can_be_shared(struct btrfs_root *root, | |
2651 | struct extent_buffer *buf); | |
2652 | void btrfs_extend_item(struct btrfs_trans_handle *trans, | |
2653 | struct btrfs_root *root, struct btrfs_path *path, | |
2654 | u32 data_size); | |
2655 | void btrfs_truncate_item(struct btrfs_trans_handle *trans, | |
2656 | struct btrfs_root *root, | |
2657 | struct btrfs_path *path, | |
2658 | u32 new_size, int from_end); | |
2659 | int btrfs_split_item(struct btrfs_trans_handle *trans, | |
2660 | struct btrfs_root *root, | |
2661 | struct btrfs_path *path, | |
2662 | struct btrfs_key *new_key, | |
2663 | unsigned long split_offset); | |
2664 | int btrfs_duplicate_item(struct btrfs_trans_handle *trans, | |
2665 | struct btrfs_root *root, | |
2666 | struct btrfs_path *path, | |
2667 | struct btrfs_key *new_key); | |
2668 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root | |
2669 | *root, struct btrfs_key *key, struct btrfs_path *p, int | |
2670 | ins_len, int cow); | |
2671 | int btrfs_search_old_slot(struct btrfs_root *root, struct btrfs_key *key, | |
2672 | struct btrfs_path *p, u64 time_seq); | |
2673 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, | |
2674 | struct btrfs_root *root, struct extent_buffer *parent, | |
2675 | int start_slot, int cache_only, u64 *last_ret, | |
2676 | struct btrfs_key *progress); | |
2677 | void btrfs_release_path(struct btrfs_path *p); | |
2678 | struct btrfs_path *btrfs_alloc_path(void); | |
2679 | void btrfs_free_path(struct btrfs_path *p); | |
2680 | void btrfs_set_path_blocking(struct btrfs_path *p); | |
2681 | void btrfs_clear_path_blocking(struct btrfs_path *p, | |
2682 | struct extent_buffer *held, int held_rw); | |
2683 | void btrfs_unlock_up_safe(struct btrfs_path *p, int level); | |
2684 | ||
2685 | int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
2686 | struct btrfs_path *path, int slot, int nr); | |
2687 | static inline int btrfs_del_item(struct btrfs_trans_handle *trans, | |
2688 | struct btrfs_root *root, | |
2689 | struct btrfs_path *path) | |
2690 | { | |
2691 | return btrfs_del_items(trans, root, path, path->slots[0], 1); | |
2692 | } | |
2693 | ||
2694 | void setup_items_for_insert(struct btrfs_trans_handle *trans, | |
2695 | struct btrfs_root *root, struct btrfs_path *path, | |
2696 | struct btrfs_key *cpu_key, u32 *data_size, | |
2697 | u32 total_data, u32 total_size, int nr); | |
2698 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root | |
2699 | *root, struct btrfs_key *key, void *data, u32 data_size); | |
2700 | int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, | |
2701 | struct btrfs_root *root, | |
2702 | struct btrfs_path *path, | |
2703 | struct btrfs_key *cpu_key, u32 *data_size, int nr); | |
2704 | ||
2705 | static inline int btrfs_insert_empty_item(struct btrfs_trans_handle *trans, | |
2706 | struct btrfs_root *root, | |
2707 | struct btrfs_path *path, | |
2708 | struct btrfs_key *key, | |
2709 | u32 data_size) | |
2710 | { | |
2711 | return btrfs_insert_empty_items(trans, root, path, key, &data_size, 1); | |
2712 | } | |
2713 | ||
2714 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path); | |
2715 | static inline int btrfs_next_item(struct btrfs_root *root, struct btrfs_path *p) | |
2716 | { | |
2717 | ++p->slots[0]; | |
2718 | if (p->slots[0] >= btrfs_header_nritems(p->nodes[0])) | |
2719 | return btrfs_next_leaf(root, p); | |
2720 | return 0; | |
2721 | } | |
2722 | int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path); | |
2723 | int btrfs_leaf_free_space(struct btrfs_root *root, struct extent_buffer *leaf); | |
2724 | int __must_check btrfs_drop_snapshot(struct btrfs_root *root, | |
2725 | struct btrfs_block_rsv *block_rsv, | |
2726 | int update_ref, int for_reloc); | |
2727 | int btrfs_drop_subtree(struct btrfs_trans_handle *trans, | |
2728 | struct btrfs_root *root, | |
2729 | struct extent_buffer *node, | |
2730 | struct extent_buffer *parent); | |
2731 | static inline int btrfs_fs_closing(struct btrfs_fs_info *fs_info) | |
2732 | { | |
2733 | /* | |
2734 | * Get synced with close_ctree() | |
2735 | */ | |
2736 | smp_mb(); | |
2737 | return fs_info->closing; | |
2738 | } | |
2739 | static inline void free_fs_info(struct btrfs_fs_info *fs_info) | |
2740 | { | |
2741 | kfree(fs_info->balance_ctl); | |
2742 | kfree(fs_info->delayed_root); | |
2743 | kfree(fs_info->extent_root); | |
2744 | kfree(fs_info->tree_root); | |
2745 | kfree(fs_info->chunk_root); | |
2746 | kfree(fs_info->dev_root); | |
2747 | kfree(fs_info->csum_root); | |
2748 | kfree(fs_info->super_copy); | |
2749 | kfree(fs_info->super_for_commit); | |
2750 | kfree(fs_info); | |
2751 | } | |
2752 | ||
2753 | /* root-item.c */ | |
2754 | int btrfs_find_root_ref(struct btrfs_root *tree_root, | |
2755 | struct btrfs_path *path, | |
2756 | u64 root_id, u64 ref_id); | |
2757 | int btrfs_add_root_ref(struct btrfs_trans_handle *trans, | |
2758 | struct btrfs_root *tree_root, | |
2759 | u64 root_id, u64 ref_id, u64 dirid, u64 sequence, | |
2760 | const char *name, int name_len); | |
2761 | int btrfs_del_root_ref(struct btrfs_trans_handle *trans, | |
2762 | struct btrfs_root *tree_root, | |
2763 | u64 root_id, u64 ref_id, u64 dirid, u64 *sequence, | |
2764 | const char *name, int name_len); | |
2765 | int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, | |
2766 | struct btrfs_key *key); | |
2767 | int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root | |
2768 | *root, struct btrfs_key *key, struct btrfs_root_item | |
2769 | *item); | |
2770 | int __must_check btrfs_update_root(struct btrfs_trans_handle *trans, | |
2771 | struct btrfs_root *root, | |
2772 | struct btrfs_key *key, | |
2773 | struct btrfs_root_item *item); | |
2774 | int btrfs_find_last_root(struct btrfs_root *root, u64 objectid, struct | |
2775 | btrfs_root_item *item, struct btrfs_key *key); | |
2776 | int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid); | |
2777 | int btrfs_find_orphan_roots(struct btrfs_root *tree_root); | |
2778 | void btrfs_set_root_node(struct btrfs_root_item *item, | |
2779 | struct extent_buffer *node); | |
2780 | void btrfs_check_and_init_root_item(struct btrfs_root_item *item); | |
2781 | ||
2782 | /* dir-item.c */ | |
2783 | int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, | |
2784 | struct btrfs_root *root, const char *name, | |
2785 | int name_len, struct inode *dir, | |
2786 | struct btrfs_key *location, u8 type, u64 index); | |
2787 | struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, | |
2788 | struct btrfs_root *root, | |
2789 | struct btrfs_path *path, u64 dir, | |
2790 | const char *name, int name_len, | |
2791 | int mod); | |
2792 | struct btrfs_dir_item * | |
2793 | btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans, | |
2794 | struct btrfs_root *root, | |
2795 | struct btrfs_path *path, u64 dir, | |
2796 | u64 objectid, const char *name, int name_len, | |
2797 | int mod); | |
2798 | struct btrfs_dir_item * | |
2799 | btrfs_search_dir_index_item(struct btrfs_root *root, | |
2800 | struct btrfs_path *path, u64 dirid, | |
2801 | const char *name, int name_len); | |
2802 | struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root, | |
2803 | struct btrfs_path *path, | |
2804 | const char *name, int name_len); | |
2805 | int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans, | |
2806 | struct btrfs_root *root, | |
2807 | struct btrfs_path *path, | |
2808 | struct btrfs_dir_item *di); | |
2809 | int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans, | |
2810 | struct btrfs_root *root, | |
2811 | struct btrfs_path *path, u64 objectid, | |
2812 | const char *name, u16 name_len, | |
2813 | const void *data, u16 data_len); | |
2814 | struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans, | |
2815 | struct btrfs_root *root, | |
2816 | struct btrfs_path *path, u64 dir, | |
2817 | const char *name, u16 name_len, | |
2818 | int mod); | |
2819 | int verify_dir_item(struct btrfs_root *root, | |
2820 | struct extent_buffer *leaf, | |
2821 | struct btrfs_dir_item *dir_item); | |
2822 | ||
2823 | /* orphan.c */ | |
2824 | int btrfs_insert_orphan_item(struct btrfs_trans_handle *trans, | |
2825 | struct btrfs_root *root, u64 offset); | |
2826 | int btrfs_del_orphan_item(struct btrfs_trans_handle *trans, | |
2827 | struct btrfs_root *root, u64 offset); | |
2828 | int btrfs_find_orphan_item(struct btrfs_root *root, u64 offset); | |
2829 | ||
2830 | /* inode-item.c */ | |
2831 | int btrfs_insert_inode_ref(struct btrfs_trans_handle *trans, | |
2832 | struct btrfs_root *root, | |
2833 | const char *name, int name_len, | |
2834 | u64 inode_objectid, u64 ref_objectid, u64 index); | |
2835 | int btrfs_del_inode_ref(struct btrfs_trans_handle *trans, | |
2836 | struct btrfs_root *root, | |
2837 | const char *name, int name_len, | |
2838 | u64 inode_objectid, u64 ref_objectid, u64 *index); | |
2839 | struct btrfs_inode_ref * | |
2840 | btrfs_lookup_inode_ref(struct btrfs_trans_handle *trans, | |
2841 | struct btrfs_root *root, | |
2842 | struct btrfs_path *path, | |
2843 | const char *name, int name_len, | |
2844 | u64 inode_objectid, u64 ref_objectid, int mod); | |
2845 | int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans, | |
2846 | struct btrfs_root *root, | |
2847 | struct btrfs_path *path, u64 objectid); | |
2848 | int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root | |
2849 | *root, struct btrfs_path *path, | |
2850 | struct btrfs_key *location, int mod); | |
2851 | ||
2852 | /* file-item.c */ | |
2853 | int btrfs_del_csums(struct btrfs_trans_handle *trans, | |
2854 | struct btrfs_root *root, u64 bytenr, u64 len); | |
2855 | int btrfs_lookup_bio_sums(struct btrfs_root *root, struct inode *inode, | |
2856 | struct bio *bio, u32 *dst); | |
2857 | int btrfs_lookup_bio_sums_dio(struct btrfs_root *root, struct inode *inode, | |
2858 | struct bio *bio, u64 logical_offset, u32 *dst); | |
2859 | int btrfs_insert_file_extent(struct btrfs_trans_handle *trans, | |
2860 | struct btrfs_root *root, | |
2861 | u64 objectid, u64 pos, | |
2862 | u64 disk_offset, u64 disk_num_bytes, | |
2863 | u64 num_bytes, u64 offset, u64 ram_bytes, | |
2864 | u8 compression, u8 encryption, u16 other_encoding); | |
2865 | int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans, | |
2866 | struct btrfs_root *root, | |
2867 | struct btrfs_path *path, u64 objectid, | |
2868 | u64 bytenr, int mod); | |
2869 | int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, | |
2870 | struct btrfs_root *root, | |
2871 | struct btrfs_ordered_sum *sums); | |
2872 | int btrfs_csum_one_bio(struct btrfs_root *root, struct inode *inode, | |
2873 | struct bio *bio, u64 file_start, int contig); | |
2874 | struct btrfs_csum_item *btrfs_lookup_csum(struct btrfs_trans_handle *trans, | |
2875 | struct btrfs_root *root, | |
2876 | struct btrfs_path *path, | |
2877 | u64 bytenr, int cow); | |
2878 | int btrfs_csum_truncate(struct btrfs_trans_handle *trans, | |
2879 | struct btrfs_root *root, struct btrfs_path *path, | |
2880 | u64 isize); | |
2881 | int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end, | |
2882 | struct list_head *list, int search_commit); | |
2883 | /* inode.c */ | |
2884 | struct extent_map *btrfs_get_extent_fiemap(struct inode *inode, struct page *page, | |
2885 | size_t pg_offset, u64 start, u64 len, | |
2886 | int create); | |
2887 | ||
2888 | /* RHEL and EL kernels have a patch that renames PG_checked to FsMisc */ | |
2889 | #if defined(ClearPageFsMisc) && !defined(ClearPageChecked) | |
2890 | #define ClearPageChecked ClearPageFsMisc | |
2891 | #define SetPageChecked SetPageFsMisc | |
2892 | #define PageChecked PageFsMisc | |
2893 | #endif | |
2894 | ||
2895 | /* This forces readahead on a given range of bytes in an inode */ | |
2896 | static inline void btrfs_force_ra(struct address_space *mapping, | |
2897 | struct file_ra_state *ra, struct file *file, | |
2898 | pgoff_t offset, unsigned long req_size) | |
2899 | { | |
2900 | page_cache_sync_readahead(mapping, ra, file, offset, req_size); | |
2901 | } | |
2902 | ||
2903 | struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry); | |
2904 | int btrfs_set_inode_index(struct inode *dir, u64 *index); | |
2905 | int btrfs_unlink_inode(struct btrfs_trans_handle *trans, | |
2906 | struct btrfs_root *root, | |
2907 | struct inode *dir, struct inode *inode, | |
2908 | const char *name, int name_len); | |
2909 | int btrfs_add_link(struct btrfs_trans_handle *trans, | |
2910 | struct inode *parent_inode, struct inode *inode, | |
2911 | const char *name, int name_len, int add_backref, u64 index); | |
2912 | int btrfs_unlink_subvol(struct btrfs_trans_handle *trans, | |
2913 | struct btrfs_root *root, | |
2914 | struct inode *dir, u64 objectid, | |
2915 | const char *name, int name_len); | |
2916 | int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans, | |
2917 | struct btrfs_root *root, | |
2918 | struct inode *inode, u64 new_size, | |
2919 | u32 min_type); | |
2920 | ||
2921 | int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput); | |
2922 | int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end, | |
2923 | struct extent_state **cached_state); | |
2924 | int btrfs_writepages(struct address_space *mapping, | |
2925 | struct writeback_control *wbc); | |
2926 | int btrfs_create_subvol_root(struct btrfs_trans_handle *trans, | |
2927 | struct btrfs_root *new_root, u64 new_dirid); | |
2928 | int btrfs_merge_bio_hook(struct page *page, unsigned long offset, | |
2929 | size_t size, struct bio *bio, unsigned long bio_flags); | |
2930 | ||
2931 | int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf); | |
2932 | int btrfs_readpage(struct file *file, struct page *page); | |
2933 | void btrfs_evict_inode(struct inode *inode); | |
2934 | int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc); | |
2935 | int btrfs_dirty_inode(struct inode *inode); | |
2936 | int btrfs_update_time(struct file *file); | |
2937 | struct inode *btrfs_alloc_inode(struct super_block *sb); | |
2938 | void btrfs_destroy_inode(struct inode *inode); | |
2939 | int btrfs_drop_inode(struct inode *inode); | |
2940 | int btrfs_init_cachep(void); | |
2941 | void btrfs_destroy_cachep(void); | |
2942 | long btrfs_ioctl_trans_end(struct file *file); | |
2943 | struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location, | |
2944 | struct btrfs_root *root, int *was_new); | |
2945 | struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page, | |
2946 | size_t pg_offset, u64 start, u64 end, | |
2947 | int create); | |
2948 | int btrfs_update_inode(struct btrfs_trans_handle *trans, | |
2949 | struct btrfs_root *root, | |
2950 | struct inode *inode); | |
2951 | int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode); | |
2952 | int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode); | |
2953 | int btrfs_orphan_cleanup(struct btrfs_root *root); | |
2954 | void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans, | |
2955 | struct btrfs_root *root); | |
2956 | int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size); | |
2957 | void btrfs_invalidate_inodes(struct btrfs_root *root); | |
2958 | void btrfs_add_delayed_iput(struct inode *inode); | |
2959 | void btrfs_run_delayed_iputs(struct btrfs_root *root); | |
2960 | int btrfs_prealloc_file_range(struct inode *inode, int mode, | |
2961 | u64 start, u64 num_bytes, u64 min_size, | |
2962 | loff_t actual_len, u64 *alloc_hint); | |
2963 | int btrfs_prealloc_file_range_trans(struct inode *inode, | |
2964 | struct btrfs_trans_handle *trans, int mode, | |
2965 | u64 start, u64 num_bytes, u64 min_size, | |
2966 | loff_t actual_len, u64 *alloc_hint); | |
2967 | extern const struct dentry_operations btrfs_dentry_operations; | |
2968 | ||
2969 | /* ioctl.c */ | |
2970 | long btrfs_ioctl(struct file *file, unsigned int cmd, unsigned long arg); | |
2971 | void btrfs_update_iflags(struct inode *inode); | |
2972 | void btrfs_inherit_iflags(struct inode *inode, struct inode *dir); | |
2973 | int btrfs_defrag_file(struct inode *inode, struct file *file, | |
2974 | struct btrfs_ioctl_defrag_range_args *range, | |
2975 | u64 newer_than, unsigned long max_pages); | |
2976 | /* file.c */ | |
2977 | int btrfs_add_inode_defrag(struct btrfs_trans_handle *trans, | |
2978 | struct inode *inode); | |
2979 | int btrfs_run_defrag_inodes(struct btrfs_fs_info *fs_info); | |
2980 | int btrfs_sync_file(struct file *file, loff_t start, loff_t end, int datasync); | |
2981 | int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end, | |
2982 | int skip_pinned); | |
2983 | extern const struct file_operations btrfs_file_operations; | |
2984 | int btrfs_drop_extents(struct btrfs_trans_handle *trans, struct inode *inode, | |
2985 | u64 start, u64 end, u64 *hint_byte, int drop_cache); | |
2986 | int btrfs_mark_extent_written(struct btrfs_trans_handle *trans, | |
2987 | struct inode *inode, u64 start, u64 end); | |
2988 | int btrfs_release_file(struct inode *inode, struct file *file); | |
2989 | void btrfs_drop_pages(struct page **pages, size_t num_pages); | |
2990 | int btrfs_dirty_pages(struct btrfs_root *root, struct inode *inode, | |
2991 | struct page **pages, size_t num_pages, | |
2992 | loff_t pos, size_t write_bytes, | |
2993 | struct extent_state **cached); | |
2994 | ||
2995 | /* tree-defrag.c */ | |
2996 | int btrfs_defrag_leaves(struct btrfs_trans_handle *trans, | |
2997 | struct btrfs_root *root, int cache_only); | |
2998 | ||
2999 | /* sysfs.c */ | |
3000 | int btrfs_init_sysfs(void); | |
3001 | void btrfs_exit_sysfs(void); | |
3002 | ||
3003 | /* xattr.c */ | |
3004 | ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size); | |
3005 | ||
3006 | /* super.c */ | |
3007 | int btrfs_parse_options(struct btrfs_root *root, char *options); | |
3008 | int btrfs_sync_fs(struct super_block *sb, int wait); | |
3009 | void btrfs_printk(struct btrfs_fs_info *fs_info, const char *fmt, ...); | |
3010 | void __btrfs_std_error(struct btrfs_fs_info *fs_info, const char *function, | |
3011 | unsigned int line, int errno, const char *fmt, ...); | |
3012 | ||
3013 | void __btrfs_abort_transaction(struct btrfs_trans_handle *trans, | |
3014 | struct btrfs_root *root, const char *function, | |
3015 | unsigned int line, int errno); | |
3016 | ||
3017 | #define btrfs_abort_transaction(trans, root, errno) \ | |
3018 | do { \ | |
3019 | __btrfs_abort_transaction(trans, root, __func__, \ | |
3020 | __LINE__, errno); \ | |
3021 | } while (0) | |
3022 | ||
3023 | #define btrfs_std_error(fs_info, errno) \ | |
3024 | do { \ | |
3025 | if ((errno)) \ | |
3026 | __btrfs_std_error((fs_info), __func__, \ | |
3027 | __LINE__, (errno), NULL); \ | |
3028 | } while (0) | |
3029 | ||
3030 | #define btrfs_error(fs_info, errno, fmt, args...) \ | |
3031 | do { \ | |
3032 | __btrfs_std_error((fs_info), __func__, __LINE__, \ | |
3033 | (errno), fmt, ##args); \ | |
3034 | } while (0) | |
3035 | ||
3036 | void __btrfs_panic(struct btrfs_fs_info *fs_info, const char *function, | |
3037 | unsigned int line, int errno, const char *fmt, ...); | |
3038 | ||
3039 | #define btrfs_panic(fs_info, errno, fmt, args...) \ | |
3040 | do { \ | |
3041 | struct btrfs_fs_info *_i = (fs_info); \ | |
3042 | __btrfs_panic(_i, __func__, __LINE__, errno, fmt, ##args); \ | |
3043 | BUG_ON(!(_i->mount_opt & BTRFS_MOUNT_PANIC_ON_FATAL_ERROR)); \ | |
3044 | } while (0) | |
3045 | ||
3046 | /* acl.c */ | |
3047 | #ifdef CONFIG_BTRFS_FS_POSIX_ACL | |
3048 | struct posix_acl *btrfs_get_acl(struct inode *inode, int type); | |
3049 | int btrfs_init_acl(struct btrfs_trans_handle *trans, | |
3050 | struct inode *inode, struct inode *dir); | |
3051 | int btrfs_acl_chmod(struct inode *inode); | |
3052 | #else | |
3053 | #define btrfs_get_acl NULL | |
3054 | static inline int btrfs_init_acl(struct btrfs_trans_handle *trans, | |
3055 | struct inode *inode, struct inode *dir) | |
3056 | { | |
3057 | return 0; | |
3058 | } | |
3059 | static inline int btrfs_acl_chmod(struct inode *inode) | |
3060 | { | |
3061 | return 0; | |
3062 | } | |
3063 | #endif | |
3064 | ||
3065 | /* relocation.c */ | |
3066 | int btrfs_relocate_block_group(struct btrfs_root *root, u64 group_start); | |
3067 | int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, | |
3068 | struct btrfs_root *root); | |
3069 | int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, | |
3070 | struct btrfs_root *root); | |
3071 | int btrfs_recover_relocation(struct btrfs_root *root); | |
3072 | int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len); | |
3073 | void btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, | |
3074 | struct btrfs_root *root, struct extent_buffer *buf, | |
3075 | struct extent_buffer *cow); | |
3076 | void btrfs_reloc_pre_snapshot(struct btrfs_trans_handle *trans, | |
3077 | struct btrfs_pending_snapshot *pending, | |
3078 | u64 *bytes_to_reserve); | |
3079 | int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, | |
3080 | struct btrfs_pending_snapshot *pending); | |
3081 | ||
3082 | /* scrub.c */ | |
3083 | int btrfs_scrub_dev(struct btrfs_root *root, u64 devid, u64 start, u64 end, | |
3084 | struct btrfs_scrub_progress *progress, int readonly); | |
3085 | void btrfs_scrub_pause(struct btrfs_root *root); | |
3086 | void btrfs_scrub_pause_super(struct btrfs_root *root); | |
3087 | void btrfs_scrub_continue(struct btrfs_root *root); | |
3088 | void btrfs_scrub_continue_super(struct btrfs_root *root); | |
3089 | int __btrfs_scrub_cancel(struct btrfs_fs_info *info); | |
3090 | int btrfs_scrub_cancel(struct btrfs_root *root); | |
3091 | int btrfs_scrub_cancel_dev(struct btrfs_root *root, struct btrfs_device *dev); | |
3092 | int btrfs_scrub_cancel_devid(struct btrfs_root *root, u64 devid); | |
3093 | int btrfs_scrub_progress(struct btrfs_root *root, u64 devid, | |
3094 | struct btrfs_scrub_progress *progress); | |
3095 | ||
3096 | /* reada.c */ | |
3097 | struct reada_control { | |
3098 | struct btrfs_root *root; /* tree to prefetch */ | |
3099 | struct btrfs_key key_start; | |
3100 | struct btrfs_key key_end; /* exclusive */ | |
3101 | atomic_t elems; | |
3102 | struct kref refcnt; | |
3103 | wait_queue_head_t wait; | |
3104 | }; | |
3105 | struct reada_control *btrfs_reada_add(struct btrfs_root *root, | |
3106 | struct btrfs_key *start, struct btrfs_key *end); | |
3107 | int btrfs_reada_wait(void *handle); | |
3108 | void btrfs_reada_detach(void *handle); | |
3109 | int btree_readahead_hook(struct btrfs_root *root, struct extent_buffer *eb, | |
3110 | u64 start, int err); | |
3111 | ||
3112 | /* delayed seq elem */ | |
3113 | struct seq_list { | |
3114 | struct list_head list; | |
3115 | u64 seq; | |
3116 | u32 flags; | |
3117 | }; | |
3118 | ||
3119 | void btrfs_get_tree_mod_seq(struct btrfs_fs_info *fs_info, | |
3120 | struct seq_list *elem); | |
3121 | void btrfs_put_tree_mod_seq(struct btrfs_fs_info *fs_info, | |
3122 | struct seq_list *elem); | |
3123 | ||
3124 | #endif |