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