1 /* 2 * This file is part of UBIFS. 3 * 4 * Copyright (C) 2006-2008 Nokia Corporation 5 * 6 * This program is free software; you can redistribute it and/or modify it 7 * under the terms of the GNU General Public License version 2 as published by 8 * the Free Software Foundation. 9 * 10 * This program is distributed in the hope that it will be useful, but WITHOUT 11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for 13 * more details. 14 * 15 * You should have received a copy of the GNU General Public License along with 16 * this program; if not, write to the Free Software Foundation, Inc., 51 17 * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 18 * 19 * Authors: Artem Bityutskiy (Битюцкий Артём) 20 * Adrian Hunter 21 */ 22 23 #ifndef __UBIFS_H__ 24 #define __UBIFS_H__ 25 26 #include <asm/div64.h> 27 #include <linux/statfs.h> 28 #include <linux/fs.h> 29 #include <linux/err.h> 30 #include <linux/sched.h> 31 #include <linux/vmalloc.h> 32 #include <linux/spinlock.h> 33 #include <linux/mutex.h> 34 #include <linux/rwsem.h> 35 #include <linux/mtd/ubi.h> 36 #include <linux/pagemap.h> 37 #include <linux/backing-dev.h> 38 #include "ubifs-media.h" 39 40 /* Version of this UBIFS implementation */ 41 #define UBIFS_VERSION 1 42 43 /* Normal UBIFS messages */ 44 #define ubifs_msg(fmt, ...) \ 45 printk(KERN_NOTICE "UBIFS: " fmt "\n", ##__VA_ARGS__) 46 /* UBIFS error messages */ 47 #define ubifs_err(fmt, ...) \ 48 printk(KERN_ERR "UBIFS error (pid %d): %s: " fmt "\n", current->pid, \ 49 __func__, ##__VA_ARGS__) 50 /* UBIFS warning messages */ 51 #define ubifs_warn(fmt, ...) \ 52 printk(KERN_WARNING "UBIFS warning (pid %d): %s: " fmt "\n", \ 53 current->pid, __func__, ##__VA_ARGS__) 54 55 /* UBIFS file system VFS magic number */ 56 #define UBIFS_SUPER_MAGIC 0x24051905 57 58 /* Number of UBIFS blocks per VFS page */ 59 #define UBIFS_BLOCKS_PER_PAGE (PAGE_CACHE_SIZE / UBIFS_BLOCK_SIZE) 60 #define UBIFS_BLOCKS_PER_PAGE_SHIFT (PAGE_CACHE_SHIFT - UBIFS_BLOCK_SHIFT) 61 62 /* "File system end of life" sequence number watermark */ 63 #define SQNUM_WARN_WATERMARK 0xFFFFFFFF00000000ULL 64 #define SQNUM_WATERMARK 0xFFFFFFFFFF000000ULL 65 66 /* Minimum amount of data UBIFS writes to the flash */ 67 #define MIN_WRITE_SZ (UBIFS_DATA_NODE_SZ + 8) 68 69 /* 70 * Currently we do not support inode number overlapping and re-using, so this 71 * watermark defines dangerous inode number level. This should be fixed later, 72 * although it is difficult to exceed current limit. Another option is to use 73 * 64-bit inode numbers, but this means more overhead. 74 */ 75 #define INUM_WARN_WATERMARK 0xFFF00000 76 #define INUM_WATERMARK 0xFFFFFF00 77 78 /* Largest key size supported in this implementation */ 79 #define CUR_MAX_KEY_LEN UBIFS_SK_LEN 80 81 /* Maximum number of entries in each LPT (LEB category) heap */ 82 #define LPT_HEAP_SZ 256 83 84 /* 85 * Background thread name pattern. The numbers are UBI device and volume 86 * numbers. 87 */ 88 #define BGT_NAME_PATTERN "ubifs_bgt%d_%d" 89 90 /* Default write-buffer synchronization timeout (5 secs) */ 91 #define DEFAULT_WBUF_TIMEOUT (5 * HZ) 92 93 /* Maximum possible inode number (only 32-bit inodes are supported now) */ 94 #define MAX_INUM 0xFFFFFFFF 95 96 /* Number of non-data journal heads */ 97 #define NONDATA_JHEADS_CNT 2 98 99 /* Garbage collector head */ 100 #define GCHD 0 101 /* Base journal head number */ 102 #define BASEHD 1 103 /* First "general purpose" journal head */ 104 #define DATAHD 2 105 106 /* 'No change' value for 'ubifs_change_lp()' */ 107 #define LPROPS_NC 0x80000001 108 109 /* 110 * There is no notion of truncation key because truncation nodes do not exist 111 * in TNC. However, when replaying, it is handy to introduce fake "truncation" 112 * keys for truncation nodes because the code becomes simpler. So we define 113 * %UBIFS_TRUN_KEY type. 114 */ 115 #define UBIFS_TRUN_KEY UBIFS_KEY_TYPES_CNT 116 117 /* 118 * How much a directory entry/extended attribute entry adds to the parent/host 119 * inode. 120 */ 121 #define CALC_DENT_SIZE(name_len) ALIGN(UBIFS_DENT_NODE_SZ + (name_len) + 1, 8) 122 123 /* How much an extended attribute adds to the host inode */ 124 #define CALC_XATTR_BYTES(data_len) ALIGN(UBIFS_INO_NODE_SZ + (data_len) + 1, 8) 125 126 /* 127 * Znodes which were not touched for 'OLD_ZNODE_AGE' seconds are considered 128 * "old", and znode which were touched last 'YOUNG_ZNODE_AGE' seconds ago are 129 * considered "young". This is used by shrinker when selecting znode to trim 130 * off. 131 */ 132 #define OLD_ZNODE_AGE 20 133 #define YOUNG_ZNODE_AGE 5 134 135 /* 136 * Some compressors, like LZO, may end up with more data then the input buffer. 137 * So UBIFS always allocates larger output buffer, to be sure the compressor 138 * will not corrupt memory in case of worst case compression. 139 */ 140 #define WORST_COMPR_FACTOR 2 141 142 /* Maximum expected tree height for use by bottom_up_buf */ 143 #define BOTTOM_UP_HEIGHT 64 144 145 /* Maximum number of data nodes to bulk-read */ 146 #define UBIFS_MAX_BULK_READ 32 147 148 /* 149 * Lockdep classes for UBIFS inode @ui_mutex. 150 */ 151 enum { 152 WB_MUTEX_1 = 0, 153 WB_MUTEX_2 = 1, 154 WB_MUTEX_3 = 2, 155 }; 156 157 /* 158 * Znode flags (actually, bit numbers which store the flags). 159 * 160 * DIRTY_ZNODE: znode is dirty 161 * COW_ZNODE: znode is being committed and a new instance of this znode has to 162 * be created before changing this znode 163 * OBSOLETE_ZNODE: znode is obsolete, which means it was deleted, but it is 164 * still in the commit list and the ongoing commit operation 165 * will commit it, and delete this znode after it is done 166 */ 167 enum { 168 DIRTY_ZNODE = 0, 169 COW_ZNODE = 1, 170 OBSOLETE_ZNODE = 2, 171 }; 172 173 /* 174 * Commit states. 175 * 176 * COMMIT_RESTING: commit is not wanted 177 * COMMIT_BACKGROUND: background commit has been requested 178 * COMMIT_REQUIRED: commit is required 179 * COMMIT_RUNNING_BACKGROUND: background commit is running 180 * COMMIT_RUNNING_REQUIRED: commit is running and it is required 181 * COMMIT_BROKEN: commit failed 182 */ 183 enum { 184 COMMIT_RESTING = 0, 185 COMMIT_BACKGROUND, 186 COMMIT_REQUIRED, 187 COMMIT_RUNNING_BACKGROUND, 188 COMMIT_RUNNING_REQUIRED, 189 COMMIT_BROKEN, 190 }; 191 192 /* 193 * 'ubifs_scan_a_node()' return values. 194 * 195 * SCANNED_GARBAGE: scanned garbage 196 * SCANNED_EMPTY_SPACE: scanned empty space 197 * SCANNED_A_NODE: scanned a valid node 198 * SCANNED_A_CORRUPT_NODE: scanned a corrupted node 199 * SCANNED_A_BAD_PAD_NODE: scanned a padding node with invalid pad length 200 * 201 * Greater than zero means: 'scanned that number of padding bytes' 202 */ 203 enum { 204 SCANNED_GARBAGE = 0, 205 SCANNED_EMPTY_SPACE = -1, 206 SCANNED_A_NODE = -2, 207 SCANNED_A_CORRUPT_NODE = -3, 208 SCANNED_A_BAD_PAD_NODE = -4, 209 }; 210 211 /* 212 * LPT cnode flag bits. 213 * 214 * DIRTY_CNODE: cnode is dirty 215 * COW_CNODE: cnode is being committed and must be copied before writing 216 * OBSOLETE_CNODE: cnode is being committed and has been copied (or deleted), 217 * so it can (and must) be freed when the commit is finished 218 */ 219 enum { 220 DIRTY_CNODE = 0, 221 COW_CNODE = 1, 222 OBSOLETE_CNODE = 2, 223 }; 224 225 /* 226 * Dirty flag bits (lpt_drty_flgs) for LPT special nodes. 227 * 228 * LTAB_DIRTY: ltab node is dirty 229 * LSAVE_DIRTY: lsave node is dirty 230 */ 231 enum { 232 LTAB_DIRTY = 1, 233 LSAVE_DIRTY = 2, 234 }; 235 236 /* 237 * Return codes used by the garbage collector. 238 * @LEB_FREED: the logical eraseblock was freed and is ready to use 239 * @LEB_FREED_IDX: indexing LEB was freed and can be used only after the commit 240 * @LEB_RETAINED: the logical eraseblock was freed and retained for GC purposes 241 */ 242 enum { 243 LEB_FREED, 244 LEB_FREED_IDX, 245 LEB_RETAINED, 246 }; 247 248 /** 249 * struct ubifs_old_idx - index node obsoleted since last commit start. 250 * @rb: rb-tree node 251 * @lnum: LEB number of obsoleted index node 252 * @offs: offset of obsoleted index node 253 */ 254 struct ubifs_old_idx { 255 struct rb_node rb; 256 int lnum; 257 int offs; 258 }; 259 260 /* The below union makes it easier to deal with keys */ 261 union ubifs_key { 262 uint8_t u8[CUR_MAX_KEY_LEN]; 263 uint32_t u32[CUR_MAX_KEY_LEN/4]; 264 uint64_t u64[CUR_MAX_KEY_LEN/8]; 265 __le32 j32[CUR_MAX_KEY_LEN/4]; 266 }; 267 268 /** 269 * struct ubifs_scan_node - UBIFS scanned node information. 270 * @list: list of scanned nodes 271 * @key: key of node scanned (if it has one) 272 * @sqnum: sequence number 273 * @type: type of node scanned 274 * @offs: offset with LEB of node scanned 275 * @len: length of node scanned 276 * @node: raw node 277 */ 278 struct ubifs_scan_node { 279 struct list_head list; 280 union ubifs_key key; 281 unsigned long long sqnum; 282 int type; 283 int offs; 284 int len; 285 void *node; 286 }; 287 288 /** 289 * struct ubifs_scan_leb - UBIFS scanned LEB information. 290 * @lnum: logical eraseblock number 291 * @nodes_cnt: number of nodes scanned 292 * @nodes: list of struct ubifs_scan_node 293 * @endpt: end point (and therefore the start of empty space) 294 * @ecc: read returned -EBADMSG 295 * @buf: buffer containing entire LEB scanned 296 */ 297 struct ubifs_scan_leb { 298 int lnum; 299 int nodes_cnt; 300 struct list_head nodes; 301 int endpt; 302 int ecc; 303 void *buf; 304 }; 305 306 /** 307 * struct ubifs_gced_idx_leb - garbage-collected indexing LEB. 308 * @list: list 309 * @lnum: LEB number 310 * @unmap: OK to unmap this LEB 311 * 312 * This data structure is used to temporary store garbage-collected indexing 313 * LEBs - they are not released immediately, but only after the next commit. 314 * This is needed to guarantee recoverability. 315 */ 316 struct ubifs_gced_idx_leb { 317 struct list_head list; 318 int lnum; 319 int unmap; 320 }; 321 322 /** 323 * struct ubifs_inode - UBIFS in-memory inode description. 324 * @vfs_inode: VFS inode description object 325 * @creat_sqnum: sequence number at time of creation 326 * @del_cmtno: commit number corresponding to the time the inode was deleted, 327 * protected by @c->commit_sem; 328 * @xattr_size: summarized size of all extended attributes in bytes 329 * @xattr_cnt: count of extended attributes this inode has 330 * @xattr_names: sum of lengths of all extended attribute names belonging to 331 * this inode 332 * @dirty: non-zero if the inode is dirty 333 * @xattr: non-zero if this is an extended attribute inode 334 * @bulk_read: non-zero if bulk-read should be used 335 * @ui_mutex: serializes inode write-back with the rest of VFS operations, 336 * serializes "clean <-> dirty" state changes, serializes bulk-read, 337 * protects @dirty, @bulk_read, @ui_size, and @xattr_size 338 * @ui_lock: protects @synced_i_size 339 * @synced_i_size: synchronized size of inode, i.e. the value of inode size 340 * currently stored on the flash; used only for regular file 341 * inodes 342 * @ui_size: inode size used by UBIFS when writing to flash 343 * @flags: inode flags (@UBIFS_COMPR_FL, etc) 344 * @compr_type: default compression type used for this inode 345 * @last_page_read: page number of last page read (for bulk read) 346 * @read_in_a_row: number of consecutive pages read in a row (for bulk read) 347 * @data_len: length of the data attached to the inode 348 * @data: inode's data 349 * 350 * @ui_mutex exists for two main reasons. At first it prevents inodes from 351 * being written back while UBIFS changing them, being in the middle of an VFS 352 * operation. This way UBIFS makes sure the inode fields are consistent. For 353 * example, in 'ubifs_rename()' we change 3 inodes simultaneously, and 354 * write-back must not write any of them before we have finished. 355 * 356 * The second reason is budgeting - UBIFS has to budget all operations. If an 357 * operation is going to mark an inode dirty, it has to allocate budget for 358 * this. It cannot just mark it dirty because there is no guarantee there will 359 * be enough flash space to write the inode back later. This means UBIFS has 360 * to have full control over inode "clean <-> dirty" transitions (and pages 361 * actually). But unfortunately, VFS marks inodes dirty in many places, and it 362 * does not ask the file-system if it is allowed to do so (there is a notifier, 363 * but it is not enough), i.e., there is no mechanism to synchronize with this. 364 * So UBIFS has its own inode dirty flag and its own mutex to serialize 365 * "clean <-> dirty" transitions. 366 * 367 * The @synced_i_size field is used to make sure we never write pages which are 368 * beyond last synchronized inode size. See 'ubifs_writepage()' for more 369 * information. 370 * 371 * The @ui_size is a "shadow" variable for @inode->i_size and UBIFS uses 372 * @ui_size instead of @inode->i_size. The reason for this is that UBIFS cannot 373 * make sure @inode->i_size is always changed under @ui_mutex, because it 374 * cannot call 'vmtruncate()' with @ui_mutex locked, because it would deadlock 375 * with 'ubifs_writepage()' (see file.c). All the other inode fields are 376 * changed under @ui_mutex, so they do not need "shadow" fields. Note, one 377 * could consider to rework locking and base it on "shadow" fields. 378 */ 379 struct ubifs_inode { 380 struct inode vfs_inode; 381 unsigned long long creat_sqnum; 382 unsigned long long del_cmtno; 383 unsigned int xattr_size; 384 unsigned int xattr_cnt; 385 unsigned int xattr_names; 386 unsigned int dirty:1; 387 unsigned int xattr:1; 388 unsigned int bulk_read:1; 389 unsigned int compr_type:2; 390 struct mutex ui_mutex; 391 spinlock_t ui_lock; 392 loff_t synced_i_size; 393 loff_t ui_size; 394 int flags; 395 pgoff_t last_page_read; 396 pgoff_t read_in_a_row; 397 int data_len; 398 void *data; 399 }; 400 401 /** 402 * struct ubifs_unclean_leb - records a LEB recovered under read-only mode. 403 * @list: list 404 * @lnum: LEB number of recovered LEB 405 * @endpt: offset where recovery ended 406 * 407 * This structure records a LEB identified during recovery that needs to be 408 * cleaned but was not because UBIFS was mounted read-only. The information 409 * is used to clean the LEB when remounting to read-write mode. 410 */ 411 struct ubifs_unclean_leb { 412 struct list_head list; 413 int lnum; 414 int endpt; 415 }; 416 417 /* 418 * LEB properties flags. 419 * 420 * LPROPS_UNCAT: not categorized 421 * LPROPS_DIRTY: dirty > 0, not index 422 * LPROPS_DIRTY_IDX: dirty + free > UBIFS_CH_SZ and index 423 * LPROPS_FREE: free > 0, not empty, not index 424 * LPROPS_HEAP_CNT: number of heaps used for storing categorized LEBs 425 * LPROPS_EMPTY: LEB is empty, not taken 426 * LPROPS_FREEABLE: free + dirty == leb_size, not index, not taken 427 * LPROPS_FRDI_IDX: free + dirty == leb_size and index, may be taken 428 * LPROPS_CAT_MASK: mask for the LEB categories above 429 * LPROPS_TAKEN: LEB was taken (this flag is not saved on the media) 430 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash) 431 */ 432 enum { 433 LPROPS_UNCAT = 0, 434 LPROPS_DIRTY = 1, 435 LPROPS_DIRTY_IDX = 2, 436 LPROPS_FREE = 3, 437 LPROPS_HEAP_CNT = 3, 438 LPROPS_EMPTY = 4, 439 LPROPS_FREEABLE = 5, 440 LPROPS_FRDI_IDX = 6, 441 LPROPS_CAT_MASK = 15, 442 LPROPS_TAKEN = 16, 443 LPROPS_INDEX = 32, 444 }; 445 446 /** 447 * struct ubifs_lprops - logical eraseblock properties. 448 * @free: amount of free space in bytes 449 * @dirty: amount of dirty space in bytes 450 * @flags: LEB properties flags (see above) 451 * @lnum: LEB number 452 * @list: list of same-category lprops (for LPROPS_EMPTY and LPROPS_FREEABLE) 453 * @hpos: heap position in heap of same-category lprops (other categories) 454 */ 455 struct ubifs_lprops { 456 int free; 457 int dirty; 458 int flags; 459 int lnum; 460 union { 461 struct list_head list; 462 int hpos; 463 }; 464 }; 465 466 /** 467 * struct ubifs_lpt_lprops - LPT logical eraseblock properties. 468 * @free: amount of free space in bytes 469 * @dirty: amount of dirty space in bytes 470 * @tgc: trivial GC flag (1 => unmap after commit end) 471 * @cmt: commit flag (1 => reserved for commit) 472 */ 473 struct ubifs_lpt_lprops { 474 int free; 475 int dirty; 476 unsigned tgc : 1; 477 unsigned cmt : 1; 478 }; 479 480 /** 481 * struct ubifs_lp_stats - statistics of eraseblocks in the main area. 482 * @empty_lebs: number of empty LEBs 483 * @taken_empty_lebs: number of taken LEBs 484 * @idx_lebs: number of indexing LEBs 485 * @total_free: total free space in bytes 486 * @total_dirty: total dirty space in bytes 487 * @total_used: total used space in bytes (includes only data LEBs) 488 * @total_dead: total dead space in bytes (includes only data LEBs) 489 * @total_dark: total dark space in bytes (includes only data LEBs) 490 * 491 * N.B. total_dirty and total_used are different to other total_* fields, 492 * because they account _all_ LEBs, not just data LEBs. 493 * 494 * 'taken_empty_lebs' counts the LEBs that are in the transient state of having 495 * been 'taken' for use but not yet written to. 'taken_empty_lebs' is needed 496 * to account correctly for gc_lnum, otherwise 'empty_lebs' could be used 497 * by itself (in which case 'unused_lebs' would be a better name). In the case 498 * of gc_lnum, it is 'taken' at mount time or whenever a LEB is retained by GC, 499 * but unlike other empty LEBs that are 'taken', it may not be written straight 500 * away (i.e. before the next commit start or unmount), so either gc_lnum must 501 * be specially accounted for, or the current approach followed i.e. count it 502 * under 'taken_empty_lebs'. 503 */ 504 struct ubifs_lp_stats { 505 int empty_lebs; 506 int taken_empty_lebs; 507 int idx_lebs; 508 long long total_free; 509 long long total_dirty; 510 long long total_used; 511 long long total_dead; 512 long long total_dark; 513 }; 514 515 struct ubifs_nnode; 516 517 /** 518 * struct ubifs_cnode - LEB Properties Tree common node. 519 * @parent: parent nnode 520 * @cnext: next cnode to commit 521 * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 522 * @iip: index in parent 523 * @level: level in the tree (zero for pnodes, greater than zero for nnodes) 524 * @num: node number 525 */ 526 struct ubifs_cnode { 527 struct ubifs_nnode *parent; 528 struct ubifs_cnode *cnext; 529 unsigned long flags; 530 int iip; 531 int level; 532 int num; 533 }; 534 535 /** 536 * struct ubifs_pnode - LEB Properties Tree leaf node. 537 * @parent: parent nnode 538 * @cnext: next cnode to commit 539 * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 540 * @iip: index in parent 541 * @level: level in the tree (always zero for pnodes) 542 * @num: node number 543 * @lprops: LEB properties array 544 */ 545 struct ubifs_pnode { 546 struct ubifs_nnode *parent; 547 struct ubifs_cnode *cnext; 548 unsigned long flags; 549 int iip; 550 int level; 551 int num; 552 struct ubifs_lprops lprops[UBIFS_LPT_FANOUT]; 553 }; 554 555 /** 556 * struct ubifs_nbranch - LEB Properties Tree internal node branch. 557 * @lnum: LEB number of child 558 * @offs: offset of child 559 * @nnode: nnode child 560 * @pnode: pnode child 561 * @cnode: cnode child 562 */ 563 struct ubifs_nbranch { 564 int lnum; 565 int offs; 566 union { 567 struct ubifs_nnode *nnode; 568 struct ubifs_pnode *pnode; 569 struct ubifs_cnode *cnode; 570 }; 571 }; 572 573 /** 574 * struct ubifs_nnode - LEB Properties Tree internal node. 575 * @parent: parent nnode 576 * @cnext: next cnode to commit 577 * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 578 * @iip: index in parent 579 * @level: level in the tree (always greater than zero for nnodes) 580 * @num: node number 581 * @nbranch: branches to child nodes 582 */ 583 struct ubifs_nnode { 584 struct ubifs_nnode *parent; 585 struct ubifs_cnode *cnext; 586 unsigned long flags; 587 int iip; 588 int level; 589 int num; 590 struct ubifs_nbranch nbranch[UBIFS_LPT_FANOUT]; 591 }; 592 593 /** 594 * struct ubifs_lpt_heap - heap of categorized lprops. 595 * @arr: heap array 596 * @cnt: number in heap 597 * @max_cnt: maximum number allowed in heap 598 * 599 * There are %LPROPS_HEAP_CNT heaps. 600 */ 601 struct ubifs_lpt_heap { 602 struct ubifs_lprops **arr; 603 int cnt; 604 int max_cnt; 605 }; 606 607 /* 608 * Return codes for LPT scan callback function. 609 * 610 * LPT_SCAN_CONTINUE: continue scanning 611 * LPT_SCAN_ADD: add the LEB properties scanned to the tree in memory 612 * LPT_SCAN_STOP: stop scanning 613 */ 614 enum { 615 LPT_SCAN_CONTINUE = 0, 616 LPT_SCAN_ADD = 1, 617 LPT_SCAN_STOP = 2, 618 }; 619 620 struct ubifs_info; 621 622 /* Callback used by the 'ubifs_lpt_scan_nolock()' function */ 623 typedef int (*ubifs_lpt_scan_callback)(struct ubifs_info *c, 624 const struct ubifs_lprops *lprops, 625 int in_tree, void *data); 626 627 /** 628 * struct ubifs_wbuf - UBIFS write-buffer. 629 * @c: UBIFS file-system description object 630 * @buf: write-buffer (of min. flash I/O unit size) 631 * @lnum: logical eraseblock number the write-buffer points to 632 * @offs: write-buffer offset in this logical eraseblock 633 * @avail: number of bytes available in the write-buffer 634 * @used: number of used bytes in the write-buffer 635 * @dtype: type of data stored in this LEB (%UBI_LONGTERM, %UBI_SHORTTERM, 636 * %UBI_UNKNOWN) 637 * @jhead: journal head the mutex belongs to (note, needed only to shut lockdep 638 * up by 'mutex_lock_nested()). 639 * @sync_callback: write-buffer synchronization callback 640 * @io_mutex: serializes write-buffer I/O 641 * @lock: serializes @buf, @lnum, @offs, @avail, @used, @next_ino and @inodes 642 * fields 643 * @timer: write-buffer timer 644 * @timeout: timer expire interval in jiffies 645 * @need_sync: it is set if its timer expired and needs sync 646 * @next_ino: points to the next position of the following inode number 647 * @inodes: stores the inode numbers of the nodes which are in wbuf 648 * 649 * The write-buffer synchronization callback is called when the write-buffer is 650 * synchronized in order to notify how much space was wasted due to 651 * write-buffer padding and how much free space is left in the LEB. 652 * 653 * Note: the fields @buf, @lnum, @offs, @avail and @used can be read under 654 * spin-lock or mutex because they are written under both mutex and spin-lock. 655 * @buf is appended to under mutex but overwritten under both mutex and 656 * spin-lock. Thus the data between @buf and @buf + @used can be read under 657 * spinlock. 658 */ 659 struct ubifs_wbuf { 660 struct ubifs_info *c; 661 void *buf; 662 int lnum; 663 int offs; 664 int avail; 665 int used; 666 int dtype; 667 int jhead; 668 int (*sync_callback)(struct ubifs_info *c, int lnum, int free, int pad); 669 struct mutex io_mutex; 670 spinlock_t lock; 671 struct timer_list timer; 672 int timeout; 673 int need_sync; 674 int next_ino; 675 ino_t *inodes; 676 }; 677 678 /** 679 * struct ubifs_bud - bud logical eraseblock. 680 * @lnum: logical eraseblock number 681 * @start: where the (uncommitted) bud data starts 682 * @jhead: journal head number this bud belongs to 683 * @list: link in the list buds belonging to the same journal head 684 * @rb: link in the tree of all buds 685 */ 686 struct ubifs_bud { 687 int lnum; 688 int start; 689 int jhead; 690 struct list_head list; 691 struct rb_node rb; 692 }; 693 694 /** 695 * struct ubifs_jhead - journal head. 696 * @wbuf: head's write-buffer 697 * @buds_list: list of bud LEBs belonging to this journal head 698 * 699 * Note, the @buds list is protected by the @c->buds_lock. 700 */ 701 struct ubifs_jhead { 702 struct ubifs_wbuf wbuf; 703 struct list_head buds_list; 704 }; 705 706 /** 707 * struct ubifs_zbranch - key/coordinate/length branch stored in znodes. 708 * @key: key 709 * @znode: znode address in memory 710 * @lnum: LEB number of the target node (indexing node or data node) 711 * @offs: target node offset within @lnum 712 * @len: target node length 713 */ 714 struct ubifs_zbranch { 715 union ubifs_key key; 716 union { 717 struct ubifs_znode *znode; 718 void *leaf; 719 }; 720 int lnum; 721 int offs; 722 int len; 723 }; 724 725 /** 726 * struct ubifs_znode - in-memory representation of an indexing node. 727 * @parent: parent znode or NULL if it is the root 728 * @cnext: next znode to commit 729 * @flags: znode flags (%DIRTY_ZNODE, %COW_ZNODE or %OBSOLETE_ZNODE) 730 * @time: last access time (seconds) 731 * @level: level of the entry in the TNC tree 732 * @child_cnt: count of child znodes 733 * @iip: index in parent's zbranch array 734 * @alt: lower bound of key range has altered i.e. child inserted at slot 0 735 * @lnum: LEB number of the corresponding indexing node 736 * @offs: offset of the corresponding indexing node 737 * @len: length of the corresponding indexing node 738 * @zbranch: array of znode branches (@c->fanout elements) 739 */ 740 struct ubifs_znode { 741 struct ubifs_znode *parent; 742 struct ubifs_znode *cnext; 743 unsigned long flags; 744 unsigned long time; 745 int level; 746 int child_cnt; 747 int iip; 748 int alt; 749 #ifdef CONFIG_UBIFS_FS_DEBUG 750 int lnum, offs, len; 751 #endif 752 struct ubifs_zbranch zbranch[]; 753 }; 754 755 /** 756 * struct bu_info - bulk-read information. 757 * @key: first data node key 758 * @zbranch: zbranches of data nodes to bulk read 759 * @buf: buffer to read into 760 * @buf_len: buffer length 761 * @gc_seq: GC sequence number to detect races with GC 762 * @cnt: number of data nodes for bulk read 763 * @blk_cnt: number of data blocks including holes 764 * @oef: end of file reached 765 */ 766 struct bu_info { 767 union ubifs_key key; 768 struct ubifs_zbranch zbranch[UBIFS_MAX_BULK_READ]; 769 void *buf; 770 int buf_len; 771 int gc_seq; 772 int cnt; 773 int blk_cnt; 774 int eof; 775 }; 776 777 /** 778 * struct ubifs_node_range - node length range description data structure. 779 * @len: fixed node length 780 * @min_len: minimum possible node length 781 * @max_len: maximum possible node length 782 * 783 * If @max_len is %0, the node has fixed length @len. 784 */ 785 struct ubifs_node_range { 786 union { 787 int len; 788 int min_len; 789 }; 790 int max_len; 791 }; 792 793 /** 794 * struct ubifs_compressor - UBIFS compressor description structure. 795 * @compr_type: compressor type (%UBIFS_COMPR_LZO, etc) 796 * @cc: cryptoapi compressor handle 797 * @comp_mutex: mutex used during compression 798 * @decomp_mutex: mutex used during decompression 799 * @name: compressor name 800 * @capi_name: cryptoapi compressor name 801 */ 802 struct ubifs_compressor { 803 int compr_type; 804 struct crypto_comp *cc; 805 struct mutex *comp_mutex; 806 struct mutex *decomp_mutex; 807 const char *name; 808 const char *capi_name; 809 }; 810 811 /** 812 * struct ubifs_budget_req - budget requirements of an operation. 813 * 814 * @fast: non-zero if the budgeting should try to acquire budget quickly and 815 * should not try to call write-back 816 * @recalculate: non-zero if @idx_growth, @data_growth, and @dd_growth fields 817 * have to be re-calculated 818 * @new_page: non-zero if the operation adds a new page 819 * @dirtied_page: non-zero if the operation makes a page dirty 820 * @new_dent: non-zero if the operation adds a new directory entry 821 * @mod_dent: non-zero if the operation removes or modifies an existing 822 * directory entry 823 * @new_ino: non-zero if the operation adds a new inode 824 * @new_ino_d: now much data newly created inode contains 825 * @dirtied_ino: how many inodes the operation makes dirty 826 * @dirtied_ino_d: now much data dirtied inode contains 827 * @idx_growth: how much the index will supposedly grow 828 * @data_growth: how much new data the operation will supposedly add 829 * @dd_growth: how much data that makes other data dirty the operation will 830 * supposedly add 831 * 832 * @idx_growth, @data_growth and @dd_growth are not used in budget request. The 833 * budgeting subsystem caches index and data growth values there to avoid 834 * re-calculating them when the budget is released. However, if @idx_growth is 835 * %-1, it is calculated by the release function using other fields. 836 * 837 * An inode may contain 4KiB of data at max., thus the widths of @new_ino_d 838 * is 13 bits, and @dirtied_ino_d - 15, because up to 4 inodes may be made 839 * dirty by the re-name operation. 840 * 841 * Note, UBIFS aligns node lengths to 8-bytes boundary, so the requester has to 842 * make sure the amount of inode data which contribute to @new_ino_d and 843 * @dirtied_ino_d fields are aligned. 844 */ 845 struct ubifs_budget_req { 846 unsigned int fast:1; 847 unsigned int recalculate:1; 848 #ifndef UBIFS_DEBUG 849 unsigned int new_page:1; 850 unsigned int dirtied_page:1; 851 unsigned int new_dent:1; 852 unsigned int mod_dent:1; 853 unsigned int new_ino:1; 854 unsigned int new_ino_d:13; 855 unsigned int dirtied_ino:4; 856 unsigned int dirtied_ino_d:15; 857 #else 858 /* Not bit-fields to check for overflows */ 859 unsigned int new_page; 860 unsigned int dirtied_page; 861 unsigned int new_dent; 862 unsigned int mod_dent; 863 unsigned int new_ino; 864 unsigned int new_ino_d; 865 unsigned int dirtied_ino; 866 unsigned int dirtied_ino_d; 867 #endif 868 int idx_growth; 869 int data_growth; 870 int dd_growth; 871 }; 872 873 /** 874 * struct ubifs_orphan - stores the inode number of an orphan. 875 * @rb: rb-tree node of rb-tree of orphans sorted by inode number 876 * @list: list head of list of orphans in order added 877 * @new_list: list head of list of orphans added since the last commit 878 * @cnext: next orphan to commit 879 * @dnext: next orphan to delete 880 * @inum: inode number 881 * @new: %1 => added since the last commit, otherwise %0 882 */ 883 struct ubifs_orphan { 884 struct rb_node rb; 885 struct list_head list; 886 struct list_head new_list; 887 struct ubifs_orphan *cnext; 888 struct ubifs_orphan *dnext; 889 ino_t inum; 890 int new; 891 }; 892 893 /** 894 * struct ubifs_mount_opts - UBIFS-specific mount options information. 895 * @unmount_mode: selected unmount mode (%0 default, %1 normal, %2 fast) 896 * @bulk_read: enable/disable bulk-reads (%0 default, %1 disabe, %2 enable) 897 * @chk_data_crc: enable/disable CRC data checking when reading data nodes 898 * (%0 default, %1 disabe, %2 enable) 899 * @override_compr: override default compressor (%0 - do not override and use 900 * superblock compressor, %1 - override and use compressor 901 * specified in @compr_type) 902 * @compr_type: compressor type to override the superblock compressor with 903 * (%UBIFS_COMPR_NONE, etc) 904 */ 905 struct ubifs_mount_opts { 906 unsigned int unmount_mode:2; 907 unsigned int bulk_read:2; 908 unsigned int chk_data_crc:2; 909 unsigned int override_compr:1; 910 unsigned int compr_type:2; 911 }; 912 913 struct ubifs_debug_info; 914 915 /** 916 * struct ubifs_info - UBIFS file-system description data structure 917 * (per-superblock). 918 * @vfs_sb: VFS @struct super_block object 919 * @bdi: backing device info object to make VFS happy and disable read-ahead 920 * 921 * @highest_inum: highest used inode number 922 * @max_sqnum: current global sequence number 923 * @cmt_no: commit number of the last successfully completed commit, protected 924 * by @commit_sem 925 * @cnt_lock: protects @highest_inum and @max_sqnum counters 926 * @fmt_version: UBIFS on-flash format version 927 * @uuid: UUID from super block 928 * 929 * @lhead_lnum: log head logical eraseblock number 930 * @lhead_offs: log head offset 931 * @ltail_lnum: log tail logical eraseblock number (offset is always 0) 932 * @log_mutex: protects the log, @lhead_lnum, @lhead_offs, @ltail_lnum, and 933 * @bud_bytes 934 * @min_log_bytes: minimum required number of bytes in the log 935 * @cmt_bud_bytes: used during commit to temporarily amount of bytes in 936 * committed buds 937 * 938 * @buds: tree of all buds indexed by bud LEB number 939 * @bud_bytes: how many bytes of flash is used by buds 940 * @buds_lock: protects the @buds tree, @bud_bytes, and per-journal head bud 941 * lists 942 * @jhead_cnt: count of journal heads 943 * @jheads: journal heads (head zero is base head) 944 * @max_bud_bytes: maximum number of bytes allowed in buds 945 * @bg_bud_bytes: number of bud bytes when background commit is initiated 946 * @old_buds: buds to be released after commit ends 947 * @max_bud_cnt: maximum number of buds 948 * 949 * @commit_sem: synchronizes committer with other processes 950 * @cmt_state: commit state 951 * @cs_lock: commit state lock 952 * @cmt_wq: wait queue to sleep on if the log is full and a commit is running 953 * 954 * @fast_unmount: do not run journal commit before un-mounting 955 * @big_lpt: flag that LPT is too big to write whole during commit 956 * @no_chk_data_crc: do not check CRCs when reading data nodes (except during 957 * recovery) 958 * @bulk_read: enable bulk-reads 959 * @default_compr: default compression algorithm (%UBIFS_COMPR_LZO, etc) 960 * 961 * @tnc_mutex: protects the Tree Node Cache (TNC), @zroot, @cnext, @enext, and 962 * @calc_idx_sz 963 * @zroot: zbranch which points to the root index node and znode 964 * @cnext: next znode to commit 965 * @enext: next znode to commit to empty space 966 * @gap_lebs: array of LEBs used by the in-gaps commit method 967 * @cbuf: commit buffer 968 * @ileb_buf: buffer for commit in-the-gaps method 969 * @ileb_len: length of data in ileb_buf 970 * @ihead_lnum: LEB number of index head 971 * @ihead_offs: offset of index head 972 * @ilebs: pre-allocated index LEBs 973 * @ileb_cnt: number of pre-allocated index LEBs 974 * @ileb_nxt: next pre-allocated index LEBs 975 * @old_idx: tree of index nodes obsoleted since the last commit start 976 * @bottom_up_buf: a buffer which is used by 'dirty_cow_bottom_up()' in tnc.c 977 * 978 * @mst_node: master node 979 * @mst_offs: offset of valid master node 980 * @mst_mutex: protects the master node area, @mst_node, and @mst_offs 981 * 982 * @max_bu_buf_len: maximum bulk-read buffer length 983 * @bu_mutex: protects the pre-allocated bulk-read buffer and @c->bu 984 * @bu: pre-allocated bulk-read information 985 * 986 * @log_lebs: number of logical eraseblocks in the log 987 * @log_bytes: log size in bytes 988 * @log_last: last LEB of the log 989 * @lpt_lebs: number of LEBs used for lprops table 990 * @lpt_first: first LEB of the lprops table area 991 * @lpt_last: last LEB of the lprops table area 992 * @orph_lebs: number of LEBs used for the orphan area 993 * @orph_first: first LEB of the orphan area 994 * @orph_last: last LEB of the orphan area 995 * @main_lebs: count of LEBs in the main area 996 * @main_first: first LEB of the main area 997 * @main_bytes: main area size in bytes 998 * 999 * @key_hash_type: type of the key hash 1000 * @key_hash: direntry key hash function 1001 * @key_fmt: key format 1002 * @key_len: key length 1003 * @fanout: fanout of the index tree (number of links per indexing node) 1004 * 1005 * @min_io_size: minimal input/output unit size 1006 * @min_io_shift: number of bits in @min_io_size minus one 1007 * @leb_size: logical eraseblock size in bytes 1008 * @half_leb_size: half LEB size 1009 * @leb_cnt: count of logical eraseblocks 1010 * @max_leb_cnt: maximum count of logical eraseblocks 1011 * @old_leb_cnt: count of logical eraseblocks before re-size 1012 * @ro_media: the underlying UBI volume is read-only 1013 * 1014 * @dirty_pg_cnt: number of dirty pages (not used) 1015 * @dirty_zn_cnt: number of dirty znodes 1016 * @clean_zn_cnt: number of clean znodes 1017 * 1018 * @budg_idx_growth: amount of bytes budgeted for index growth 1019 * @budg_data_growth: amount of bytes budgeted for cached data 1020 * @budg_dd_growth: amount of bytes budgeted for cached data that will make 1021 * other data dirty 1022 * @budg_uncommitted_idx: amount of bytes were budgeted for growth of the index, 1023 * but which still have to be taken into account because 1024 * the index has not been committed so far 1025 * @space_lock: protects @budg_idx_growth, @budg_data_growth, @budg_dd_growth, 1026 * @budg_uncommited_idx, @min_idx_lebs, @old_idx_sz, @lst, 1027 * @nospace, and @nospace_rp; 1028 * @min_idx_lebs: minimum number of LEBs required for the index 1029 * @old_idx_sz: size of index on flash 1030 * @calc_idx_sz: temporary variable which is used to calculate new index size 1031 * (contains accurate new index size at end of TNC commit start) 1032 * @lst: lprops statistics 1033 * @nospace: non-zero if the file-system does not have flash space (used as 1034 * optimization) 1035 * @nospace_rp: the same as @nospace, but additionally means that even reserved 1036 * pool is full 1037 * 1038 * @page_budget: budget for a page 1039 * @inode_budget: budget for an inode 1040 * @dent_budget: budget for a directory entry 1041 * 1042 * @ref_node_alsz: size of the LEB reference node aligned to the min. flash 1043 * I/O unit 1044 * @mst_node_alsz: master node aligned size 1045 * @min_idx_node_sz: minimum indexing node aligned on 8-bytes boundary 1046 * @max_idx_node_sz: maximum indexing node aligned on 8-bytes boundary 1047 * @max_inode_sz: maximum possible inode size in bytes 1048 * @max_znode_sz: size of znode in bytes 1049 * 1050 * @leb_overhead: how many bytes are wasted in an LEB when it is filled with 1051 * data nodes of maximum size - used in free space reporting 1052 * @dead_wm: LEB dead space watermark 1053 * @dark_wm: LEB dark space watermark 1054 * @block_cnt: count of 4KiB blocks on the FS 1055 * 1056 * @ranges: UBIFS node length ranges 1057 * @ubi: UBI volume descriptor 1058 * @di: UBI device information 1059 * @vi: UBI volume information 1060 * 1061 * @orph_tree: rb-tree of orphan inode numbers 1062 * @orph_list: list of orphan inode numbers in order added 1063 * @orph_new: list of orphan inode numbers added since last commit 1064 * @orph_cnext: next orphan to commit 1065 * @orph_dnext: next orphan to delete 1066 * @orphan_lock: lock for orph_tree and orph_new 1067 * @orph_buf: buffer for orphan nodes 1068 * @new_orphans: number of orphans since last commit 1069 * @cmt_orphans: number of orphans being committed 1070 * @tot_orphans: number of orphans in the rb_tree 1071 * @max_orphans: maximum number of orphans allowed 1072 * @ohead_lnum: orphan head LEB number 1073 * @ohead_offs: orphan head offset 1074 * @no_orphs: non-zero if there are no orphans 1075 * 1076 * @bgt: UBIFS background thread 1077 * @bgt_name: background thread name 1078 * @need_bgt: if background thread should run 1079 * @need_wbuf_sync: if write-buffers have to be synchronized 1080 * 1081 * @gc_lnum: LEB number used for garbage collection 1082 * @sbuf: a buffer of LEB size used by GC and replay for scanning 1083 * @idx_gc: list of index LEBs that have been garbage collected 1084 * @idx_gc_cnt: number of elements on the idx_gc list 1085 * @gc_seq: incremented for every non-index LEB garbage collected 1086 * @gced_lnum: last non-index LEB that was garbage collected 1087 * 1088 * @infos_list: links all 'ubifs_info' objects 1089 * @umount_mutex: serializes shrinker and un-mount 1090 * @shrinker_run_no: shrinker run number 1091 * 1092 * @space_bits: number of bits needed to record free or dirty space 1093 * @lpt_lnum_bits: number of bits needed to record a LEB number in the LPT 1094 * @lpt_offs_bits: number of bits needed to record an offset in the LPT 1095 * @lpt_spc_bits: number of bits needed to space in the LPT 1096 * @pcnt_bits: number of bits needed to record pnode or nnode number 1097 * @lnum_bits: number of bits needed to record LEB number 1098 * @nnode_sz: size of on-flash nnode 1099 * @pnode_sz: size of on-flash pnode 1100 * @ltab_sz: size of on-flash LPT lprops table 1101 * @lsave_sz: size of on-flash LPT save table 1102 * @pnode_cnt: number of pnodes 1103 * @nnode_cnt: number of nnodes 1104 * @lpt_hght: height of the LPT 1105 * @pnodes_have: number of pnodes in memory 1106 * 1107 * @lp_mutex: protects lprops table and all the other lprops-related fields 1108 * @lpt_lnum: LEB number of the root nnode of the LPT 1109 * @lpt_offs: offset of the root nnode of the LPT 1110 * @nhead_lnum: LEB number of LPT head 1111 * @nhead_offs: offset of LPT head 1112 * @lpt_drty_flgs: dirty flags for LPT special nodes e.g. ltab 1113 * @dirty_nn_cnt: number of dirty nnodes 1114 * @dirty_pn_cnt: number of dirty pnodes 1115 * @check_lpt_free: flag that indicates LPT GC may be needed 1116 * @lpt_sz: LPT size 1117 * @lpt_nod_buf: buffer for an on-flash nnode or pnode 1118 * @lpt_buf: buffer of LEB size used by LPT 1119 * @nroot: address in memory of the root nnode of the LPT 1120 * @lpt_cnext: next LPT node to commit 1121 * @lpt_heap: array of heaps of categorized lprops 1122 * @dirty_idx: a (reverse sorted) copy of the LPROPS_DIRTY_IDX heap as at 1123 * previous commit start 1124 * @uncat_list: list of un-categorized LEBs 1125 * @empty_list: list of empty LEBs 1126 * @freeable_list: list of freeable non-index LEBs (free + dirty == leb_size) 1127 * @frdi_idx_list: list of freeable index LEBs (free + dirty == leb_size) 1128 * @freeable_cnt: number of freeable LEBs in @freeable_list 1129 * 1130 * @ltab_lnum: LEB number of LPT's own lprops table 1131 * @ltab_offs: offset of LPT's own lprops table 1132 * @ltab: LPT's own lprops table 1133 * @ltab_cmt: LPT's own lprops table (commit copy) 1134 * @lsave_cnt: number of LEB numbers in LPT's save table 1135 * @lsave_lnum: LEB number of LPT's save table 1136 * @lsave_offs: offset of LPT's save table 1137 * @lsave: LPT's save table 1138 * @lscan_lnum: LEB number of last LPT scan 1139 * 1140 * @rp_size: size of the reserved pool in bytes 1141 * @report_rp_size: size of the reserved pool reported to user-space 1142 * @rp_uid: reserved pool user ID 1143 * @rp_gid: reserved pool group ID 1144 * 1145 * @empty: if the UBI device is empty 1146 * @replay_tree: temporary tree used during journal replay 1147 * @replay_list: temporary list used during journal replay 1148 * @replay_buds: list of buds to replay 1149 * @cs_sqnum: sequence number of first node in the log (commit start node) 1150 * @replay_sqnum: sequence number of node currently being replayed 1151 * @need_recovery: file-system needs recovery 1152 * @replaying: set to %1 during journal replay 1153 * @unclean_leb_list: LEBs to recover when mounting ro to rw 1154 * @rcvrd_mst_node: recovered master node to write when mounting ro to rw 1155 * @size_tree: inode size information for recovery 1156 * @remounting_rw: set while remounting from ro to rw (sb flags have MS_RDONLY) 1157 * @always_chk_crc: always check CRCs (while mounting and remounting rw) 1158 * @mount_opts: UBIFS-specific mount options 1159 * 1160 * @dbg: debugging-related information 1161 * @dfs: debugfs support-related information 1162 */ 1163 struct ubifs_info { 1164 struct super_block *vfs_sb; 1165 struct backing_dev_info bdi; 1166 1167 ino_t highest_inum; 1168 unsigned long long max_sqnum; 1169 unsigned long long cmt_no; 1170 spinlock_t cnt_lock; 1171 int fmt_version; 1172 unsigned char uuid[16]; 1173 1174 int lhead_lnum; 1175 int lhead_offs; 1176 int ltail_lnum; 1177 struct mutex log_mutex; 1178 int min_log_bytes; 1179 long long cmt_bud_bytes; 1180 1181 struct rb_root buds; 1182 long long bud_bytes; 1183 spinlock_t buds_lock; 1184 int jhead_cnt; 1185 struct ubifs_jhead *jheads; 1186 long long max_bud_bytes; 1187 long long bg_bud_bytes; 1188 struct list_head old_buds; 1189 int max_bud_cnt; 1190 1191 struct rw_semaphore commit_sem; 1192 int cmt_state; 1193 spinlock_t cs_lock; 1194 wait_queue_head_t cmt_wq; 1195 1196 unsigned int fast_unmount:1; 1197 unsigned int big_lpt:1; 1198 unsigned int no_chk_data_crc:1; 1199 unsigned int bulk_read:1; 1200 unsigned int default_compr:2; 1201 1202 struct mutex tnc_mutex; 1203 struct ubifs_zbranch zroot; 1204 struct ubifs_znode *cnext; 1205 struct ubifs_znode *enext; 1206 int *gap_lebs; 1207 void *cbuf; 1208 void *ileb_buf; 1209 int ileb_len; 1210 int ihead_lnum; 1211 int ihead_offs; 1212 int *ilebs; 1213 int ileb_cnt; 1214 int ileb_nxt; 1215 struct rb_root old_idx; 1216 int *bottom_up_buf; 1217 1218 struct ubifs_mst_node *mst_node; 1219 int mst_offs; 1220 struct mutex mst_mutex; 1221 1222 int max_bu_buf_len; 1223 struct mutex bu_mutex; 1224 struct bu_info bu; 1225 1226 int log_lebs; 1227 long long log_bytes; 1228 int log_last; 1229 int lpt_lebs; 1230 int lpt_first; 1231 int lpt_last; 1232 int orph_lebs; 1233 int orph_first; 1234 int orph_last; 1235 int main_lebs; 1236 int main_first; 1237 long long main_bytes; 1238 1239 uint8_t key_hash_type; 1240 uint32_t (*key_hash)(const char *str, int len); 1241 int key_fmt; 1242 int key_len; 1243 int fanout; 1244 1245 int min_io_size; 1246 int min_io_shift; 1247 int leb_size; 1248 int half_leb_size; 1249 int leb_cnt; 1250 int max_leb_cnt; 1251 int old_leb_cnt; 1252 int ro_media; 1253 1254 atomic_long_t dirty_pg_cnt; 1255 atomic_long_t dirty_zn_cnt; 1256 atomic_long_t clean_zn_cnt; 1257 1258 long long budg_idx_growth; 1259 long long budg_data_growth; 1260 long long budg_dd_growth; 1261 long long budg_uncommitted_idx; 1262 spinlock_t space_lock; 1263 int min_idx_lebs; 1264 unsigned long long old_idx_sz; 1265 unsigned long long calc_idx_sz; 1266 struct ubifs_lp_stats lst; 1267 unsigned int nospace:1; 1268 unsigned int nospace_rp:1; 1269 1270 int page_budget; 1271 int inode_budget; 1272 int dent_budget; 1273 1274 int ref_node_alsz; 1275 int mst_node_alsz; 1276 int min_idx_node_sz; 1277 int max_idx_node_sz; 1278 long long max_inode_sz; 1279 int max_znode_sz; 1280 1281 int leb_overhead; 1282 int dead_wm; 1283 int dark_wm; 1284 int block_cnt; 1285 1286 struct ubifs_node_range ranges[UBIFS_NODE_TYPES_CNT]; 1287 struct ubi_volume_desc *ubi; 1288 struct ubi_device_info di; 1289 struct ubi_volume_info vi; 1290 1291 struct rb_root orph_tree; 1292 struct list_head orph_list; 1293 struct list_head orph_new; 1294 struct ubifs_orphan *orph_cnext; 1295 struct ubifs_orphan *orph_dnext; 1296 spinlock_t orphan_lock; 1297 void *orph_buf; 1298 int new_orphans; 1299 int cmt_orphans; 1300 int tot_orphans; 1301 int max_orphans; 1302 int ohead_lnum; 1303 int ohead_offs; 1304 int no_orphs; 1305 1306 struct task_struct *bgt; 1307 char bgt_name[sizeof(BGT_NAME_PATTERN) + 9]; 1308 int need_bgt; 1309 int need_wbuf_sync; 1310 1311 int gc_lnum; 1312 void *sbuf; 1313 struct list_head idx_gc; 1314 int idx_gc_cnt; 1315 volatile int gc_seq; 1316 volatile int gced_lnum; 1317 1318 struct list_head infos_list; 1319 struct mutex umount_mutex; 1320 unsigned int shrinker_run_no; 1321 1322 int space_bits; 1323 int lpt_lnum_bits; 1324 int lpt_offs_bits; 1325 int lpt_spc_bits; 1326 int pcnt_bits; 1327 int lnum_bits; 1328 int nnode_sz; 1329 int pnode_sz; 1330 int ltab_sz; 1331 int lsave_sz; 1332 int pnode_cnt; 1333 int nnode_cnt; 1334 int lpt_hght; 1335 int pnodes_have; 1336 1337 struct mutex lp_mutex; 1338 int lpt_lnum; 1339 int lpt_offs; 1340 int nhead_lnum; 1341 int nhead_offs; 1342 int lpt_drty_flgs; 1343 int dirty_nn_cnt; 1344 int dirty_pn_cnt; 1345 int check_lpt_free; 1346 long long lpt_sz; 1347 void *lpt_nod_buf; 1348 void *lpt_buf; 1349 struct ubifs_nnode *nroot; 1350 struct ubifs_cnode *lpt_cnext; 1351 struct ubifs_lpt_heap lpt_heap[LPROPS_HEAP_CNT]; 1352 struct ubifs_lpt_heap dirty_idx; 1353 struct list_head uncat_list; 1354 struct list_head empty_list; 1355 struct list_head freeable_list; 1356 struct list_head frdi_idx_list; 1357 int freeable_cnt; 1358 1359 int ltab_lnum; 1360 int ltab_offs; 1361 struct ubifs_lpt_lprops *ltab; 1362 struct ubifs_lpt_lprops *ltab_cmt; 1363 int lsave_cnt; 1364 int lsave_lnum; 1365 int lsave_offs; 1366 int *lsave; 1367 int lscan_lnum; 1368 1369 long long rp_size; 1370 long long report_rp_size; 1371 uid_t rp_uid; 1372 gid_t rp_gid; 1373 1374 /* The below fields are used only during mounting and re-mounting */ 1375 int empty; 1376 struct rb_root replay_tree; 1377 struct list_head replay_list; 1378 struct list_head replay_buds; 1379 unsigned long long cs_sqnum; 1380 unsigned long long replay_sqnum; 1381 int need_recovery; 1382 int replaying; 1383 struct list_head unclean_leb_list; 1384 struct ubifs_mst_node *rcvrd_mst_node; 1385 struct rb_root size_tree; 1386 int remounting_rw; 1387 int always_chk_crc; 1388 struct ubifs_mount_opts mount_opts; 1389 1390 #ifdef CONFIG_UBIFS_FS_DEBUG 1391 struct ubifs_debug_info *dbg; 1392 #endif 1393 }; 1394 1395 extern struct list_head ubifs_infos; 1396 extern spinlock_t ubifs_infos_lock; 1397 extern atomic_long_t ubifs_clean_zn_cnt; 1398 extern struct kmem_cache *ubifs_inode_slab; 1399 extern struct super_operations ubifs_super_operations; 1400 extern struct address_space_operations ubifs_file_address_operations; 1401 extern struct file_operations ubifs_file_operations; 1402 extern struct inode_operations ubifs_file_inode_operations; 1403 extern struct file_operations ubifs_dir_operations; 1404 extern struct inode_operations ubifs_dir_inode_operations; 1405 extern struct inode_operations ubifs_symlink_inode_operations; 1406 extern struct backing_dev_info ubifs_backing_dev_info; 1407 extern struct ubifs_compressor *ubifs_compressors[UBIFS_COMPR_TYPES_CNT]; 1408 1409 /* io.c */ 1410 void ubifs_ro_mode(struct ubifs_info *c, int err); 1411 int ubifs_wbuf_write_nolock(struct ubifs_wbuf *wbuf, void *buf, int len); 1412 int ubifs_wbuf_seek_nolock(struct ubifs_wbuf *wbuf, int lnum, int offs, 1413 int dtype); 1414 int ubifs_wbuf_init(struct ubifs_info *c, struct ubifs_wbuf *wbuf); 1415 int ubifs_read_node(const struct ubifs_info *c, void *buf, int type, int len, 1416 int lnum, int offs); 1417 int ubifs_read_node_wbuf(struct ubifs_wbuf *wbuf, void *buf, int type, int len, 1418 int lnum, int offs); 1419 int ubifs_write_node(struct ubifs_info *c, void *node, int len, int lnum, 1420 int offs, int dtype); 1421 int ubifs_check_node(const struct ubifs_info *c, const void *buf, int lnum, 1422 int offs, int quiet, int chk_crc); 1423 void ubifs_prepare_node(struct ubifs_info *c, void *buf, int len, int pad); 1424 void ubifs_prep_grp_node(struct ubifs_info *c, void *node, int len, int last); 1425 int ubifs_io_init(struct ubifs_info *c); 1426 void ubifs_pad(const struct ubifs_info *c, void *buf, int pad); 1427 int ubifs_wbuf_sync_nolock(struct ubifs_wbuf *wbuf); 1428 int ubifs_bg_wbufs_sync(struct ubifs_info *c); 1429 void ubifs_wbuf_add_ino_nolock(struct ubifs_wbuf *wbuf, ino_t inum); 1430 int ubifs_sync_wbufs_by_inode(struct ubifs_info *c, struct inode *inode); 1431 1432 /* scan.c */ 1433 struct ubifs_scan_leb *ubifs_scan(const struct ubifs_info *c, int lnum, 1434 int offs, void *sbuf); 1435 void ubifs_scan_destroy(struct ubifs_scan_leb *sleb); 1436 int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, 1437 int offs, int quiet); 1438 struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, 1439 int offs, void *sbuf); 1440 void ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, 1441 int lnum, int offs); 1442 int ubifs_add_snod(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, 1443 void *buf, int offs); 1444 void ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs, 1445 void *buf); 1446 1447 /* log.c */ 1448 void ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud); 1449 void ubifs_create_buds_lists(struct ubifs_info *c); 1450 int ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs); 1451 struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum); 1452 struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum); 1453 int ubifs_log_start_commit(struct ubifs_info *c, int *ltail_lnum); 1454 int ubifs_log_end_commit(struct ubifs_info *c, int new_ltail_lnum); 1455 int ubifs_log_post_commit(struct ubifs_info *c, int old_ltail_lnum); 1456 int ubifs_consolidate_log(struct ubifs_info *c); 1457 1458 /* journal.c */ 1459 int ubifs_jnl_update(struct ubifs_info *c, const struct inode *dir, 1460 const struct qstr *nm, const struct inode *inode, 1461 int deletion, int xent); 1462 int ubifs_jnl_write_data(struct ubifs_info *c, const struct inode *inode, 1463 const union ubifs_key *key, const void *buf, int len); 1464 int ubifs_jnl_write_inode(struct ubifs_info *c, const struct inode *inode); 1465 int ubifs_jnl_delete_inode(struct ubifs_info *c, const struct inode *inode); 1466 int ubifs_jnl_rename(struct ubifs_info *c, const struct inode *old_dir, 1467 const struct dentry *old_dentry, 1468 const struct inode *new_dir, 1469 const struct dentry *new_dentry, int sync); 1470 int ubifs_jnl_truncate(struct ubifs_info *c, const struct inode *inode, 1471 loff_t old_size, loff_t new_size); 1472 int ubifs_jnl_delete_xattr(struct ubifs_info *c, const struct inode *host, 1473 const struct inode *inode, const struct qstr *nm); 1474 int ubifs_jnl_change_xattr(struct ubifs_info *c, const struct inode *inode1, 1475 const struct inode *inode2); 1476 1477 /* budget.c */ 1478 int ubifs_budget_space(struct ubifs_info *c, struct ubifs_budget_req *req); 1479 void ubifs_release_budget(struct ubifs_info *c, struct ubifs_budget_req *req); 1480 void ubifs_release_dirty_inode_budget(struct ubifs_info *c, 1481 struct ubifs_inode *ui); 1482 int ubifs_budget_inode_op(struct ubifs_info *c, struct inode *inode, 1483 struct ubifs_budget_req *req); 1484 void ubifs_release_ino_dirty(struct ubifs_info *c, struct inode *inode, 1485 struct ubifs_budget_req *req); 1486 void ubifs_cancel_ino_op(struct ubifs_info *c, struct inode *inode, 1487 struct ubifs_budget_req *req); 1488 long long ubifs_get_free_space(struct ubifs_info *c); 1489 int ubifs_calc_min_idx_lebs(struct ubifs_info *c); 1490 void ubifs_convert_page_budget(struct ubifs_info *c); 1491 long long ubifs_reported_space(const struct ubifs_info *c, uint64_t free); 1492 long long ubifs_calc_available(const struct ubifs_info *c, int min_idx_lebs); 1493 1494 /* find.c */ 1495 int ubifs_find_free_space(struct ubifs_info *c, int min_space, int *free, 1496 int squeeze); 1497 int ubifs_find_free_leb_for_idx(struct ubifs_info *c); 1498 int ubifs_find_dirty_leb(struct ubifs_info *c, struct ubifs_lprops *ret_lp, 1499 int min_space, int pick_free); 1500 int ubifs_find_dirty_idx_leb(struct ubifs_info *c); 1501 int ubifs_save_dirty_idx_lnums(struct ubifs_info *c); 1502 1503 /* tnc.c */ 1504 int ubifs_lookup_level0(struct ubifs_info *c, const union ubifs_key *key, 1505 struct ubifs_znode **zn, int *n); 1506 int ubifs_tnc_lookup_nm(struct ubifs_info *c, const union ubifs_key *key, 1507 void *node, const struct qstr *nm); 1508 int ubifs_tnc_locate(struct ubifs_info *c, const union ubifs_key *key, 1509 void *node, int *lnum, int *offs); 1510 int ubifs_tnc_add(struct ubifs_info *c, const union ubifs_key *key, int lnum, 1511 int offs, int len); 1512 int ubifs_tnc_replace(struct ubifs_info *c, const union ubifs_key *key, 1513 int old_lnum, int old_offs, int lnum, int offs, int len); 1514 int ubifs_tnc_add_nm(struct ubifs_info *c, const union ubifs_key *key, 1515 int lnum, int offs, int len, const struct qstr *nm); 1516 int ubifs_tnc_remove(struct ubifs_info *c, const union ubifs_key *key); 1517 int ubifs_tnc_remove_nm(struct ubifs_info *c, const union ubifs_key *key, 1518 const struct qstr *nm); 1519 int ubifs_tnc_remove_range(struct ubifs_info *c, union ubifs_key *from_key, 1520 union ubifs_key *to_key); 1521 int ubifs_tnc_remove_ino(struct ubifs_info *c, ino_t inum); 1522 struct ubifs_dent_node *ubifs_tnc_next_ent(struct ubifs_info *c, 1523 union ubifs_key *key, 1524 const struct qstr *nm); 1525 void ubifs_tnc_close(struct ubifs_info *c); 1526 int ubifs_tnc_has_node(struct ubifs_info *c, union ubifs_key *key, int level, 1527 int lnum, int offs, int is_idx); 1528 int ubifs_dirty_idx_node(struct ubifs_info *c, union ubifs_key *key, int level, 1529 int lnum, int offs); 1530 /* Shared by tnc.c for tnc_commit.c */ 1531 void destroy_old_idx(struct ubifs_info *c); 1532 int is_idx_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int level, 1533 int lnum, int offs); 1534 int insert_old_idx_znode(struct ubifs_info *c, struct ubifs_znode *znode); 1535 int ubifs_tnc_get_bu_keys(struct ubifs_info *c, struct bu_info *bu); 1536 int ubifs_tnc_bulk_read(struct ubifs_info *c, struct bu_info *bu); 1537 1538 /* tnc_misc.c */ 1539 struct ubifs_znode *ubifs_tnc_levelorder_next(struct ubifs_znode *zr, 1540 struct ubifs_znode *znode); 1541 int ubifs_search_zbranch(const struct ubifs_info *c, 1542 const struct ubifs_znode *znode, 1543 const union ubifs_key *key, int *n); 1544 struct ubifs_znode *ubifs_tnc_postorder_first(struct ubifs_znode *znode); 1545 struct ubifs_znode *ubifs_tnc_postorder_next(struct ubifs_znode *znode); 1546 long ubifs_destroy_tnc_subtree(struct ubifs_znode *zr); 1547 struct ubifs_znode *ubifs_load_znode(struct ubifs_info *c, 1548 struct ubifs_zbranch *zbr, 1549 struct ubifs_znode *parent, int iip); 1550 int ubifs_tnc_read_node(struct ubifs_info *c, struct ubifs_zbranch *zbr, 1551 void *node); 1552 1553 /* tnc_commit.c */ 1554 int ubifs_tnc_start_commit(struct ubifs_info *c, struct ubifs_zbranch *zroot); 1555 int ubifs_tnc_end_commit(struct ubifs_info *c); 1556 1557 /* shrinker.c */ 1558 int ubifs_shrinker(int nr_to_scan, gfp_t gfp_mask); 1559 1560 /* commit.c */ 1561 int ubifs_bg_thread(void *info); 1562 void ubifs_commit_required(struct ubifs_info *c); 1563 void ubifs_request_bg_commit(struct ubifs_info *c); 1564 int ubifs_run_commit(struct ubifs_info *c); 1565 void ubifs_recovery_commit(struct ubifs_info *c); 1566 int ubifs_gc_should_commit(struct ubifs_info *c); 1567 void ubifs_wait_for_commit(struct ubifs_info *c); 1568 1569 /* master.c */ 1570 int ubifs_read_master(struct ubifs_info *c); 1571 int ubifs_write_master(struct ubifs_info *c); 1572 1573 /* sb.c */ 1574 int ubifs_read_superblock(struct ubifs_info *c); 1575 struct ubifs_sb_node *ubifs_read_sb_node(struct ubifs_info *c); 1576 int ubifs_write_sb_node(struct ubifs_info *c, struct ubifs_sb_node *sup); 1577 1578 /* replay.c */ 1579 int ubifs_validate_entry(struct ubifs_info *c, 1580 const struct ubifs_dent_node *dent); 1581 int ubifs_replay_journal(struct ubifs_info *c); 1582 1583 /* gc.c */ 1584 int ubifs_garbage_collect(struct ubifs_info *c, int anyway); 1585 int ubifs_gc_start_commit(struct ubifs_info *c); 1586 int ubifs_gc_end_commit(struct ubifs_info *c); 1587 void ubifs_destroy_idx_gc(struct ubifs_info *c); 1588 int ubifs_get_idx_gc_leb(struct ubifs_info *c); 1589 int ubifs_garbage_collect_leb(struct ubifs_info *c, struct ubifs_lprops *lp); 1590 1591 /* orphan.c */ 1592 int ubifs_add_orphan(struct ubifs_info *c, ino_t inum); 1593 void ubifs_delete_orphan(struct ubifs_info *c, ino_t inum); 1594 int ubifs_orphan_start_commit(struct ubifs_info *c); 1595 int ubifs_orphan_end_commit(struct ubifs_info *c); 1596 int ubifs_mount_orphans(struct ubifs_info *c, int unclean, int read_only); 1597 1598 /* lpt.c */ 1599 int ubifs_calc_lpt_geom(struct ubifs_info *c); 1600 int ubifs_create_dflt_lpt(struct ubifs_info *c, int *main_lebs, int lpt_first, 1601 int *lpt_lebs, int *big_lpt); 1602 int ubifs_lpt_init(struct ubifs_info *c, int rd, int wr); 1603 struct ubifs_lprops *ubifs_lpt_lookup(struct ubifs_info *c, int lnum); 1604 struct ubifs_lprops *ubifs_lpt_lookup_dirty(struct ubifs_info *c, int lnum); 1605 int ubifs_lpt_scan_nolock(struct ubifs_info *c, int start_lnum, int end_lnum, 1606 ubifs_lpt_scan_callback scan_cb, void *data); 1607 1608 /* Shared by lpt.c for lpt_commit.c */ 1609 void ubifs_pack_lsave(struct ubifs_info *c, void *buf, int *lsave); 1610 void ubifs_pack_ltab(struct ubifs_info *c, void *buf, 1611 struct ubifs_lpt_lprops *ltab); 1612 void ubifs_pack_pnode(struct ubifs_info *c, void *buf, 1613 struct ubifs_pnode *pnode); 1614 void ubifs_pack_nnode(struct ubifs_info *c, void *buf, 1615 struct ubifs_nnode *nnode); 1616 struct ubifs_pnode *ubifs_get_pnode(struct ubifs_info *c, 1617 struct ubifs_nnode *parent, int iip); 1618 struct ubifs_nnode *ubifs_get_nnode(struct ubifs_info *c, 1619 struct ubifs_nnode *parent, int iip); 1620 int ubifs_read_nnode(struct ubifs_info *c, struct ubifs_nnode *parent, int iip); 1621 void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty); 1622 void ubifs_add_nnode_dirt(struct ubifs_info *c, struct ubifs_nnode *nnode); 1623 uint32_t ubifs_unpack_bits(uint8_t **addr, int *pos, int nrbits); 1624 struct ubifs_nnode *ubifs_first_nnode(struct ubifs_info *c, int *hght); 1625 /* Needed only in debugging code in lpt_commit.c */ 1626 int ubifs_unpack_nnode(const struct ubifs_info *c, void *buf, 1627 struct ubifs_nnode *nnode); 1628 1629 /* lpt_commit.c */ 1630 int ubifs_lpt_start_commit(struct ubifs_info *c); 1631 int ubifs_lpt_end_commit(struct ubifs_info *c); 1632 int ubifs_lpt_post_commit(struct ubifs_info *c); 1633 void ubifs_lpt_free(struct ubifs_info *c, int wr_only); 1634 1635 /* lprops.c */ 1636 const struct ubifs_lprops *ubifs_change_lp(struct ubifs_info *c, 1637 const struct ubifs_lprops *lp, 1638 int free, int dirty, int flags, 1639 int idx_gc_cnt); 1640 void ubifs_get_lp_stats(struct ubifs_info *c, struct ubifs_lp_stats *stats); 1641 void ubifs_add_to_cat(struct ubifs_info *c, struct ubifs_lprops *lprops, 1642 int cat); 1643 void ubifs_replace_cat(struct ubifs_info *c, struct ubifs_lprops *old_lprops, 1644 struct ubifs_lprops *new_lprops); 1645 void ubifs_ensure_cat(struct ubifs_info *c, struct ubifs_lprops *lprops); 1646 int ubifs_categorize_lprops(const struct ubifs_info *c, 1647 const struct ubifs_lprops *lprops); 1648 int ubifs_change_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, 1649 int flags_set, int flags_clean, int idx_gc_cnt); 1650 int ubifs_update_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, 1651 int flags_set, int flags_clean); 1652 int ubifs_read_one_lp(struct ubifs_info *c, int lnum, struct ubifs_lprops *lp); 1653 const struct ubifs_lprops *ubifs_fast_find_free(struct ubifs_info *c); 1654 const struct ubifs_lprops *ubifs_fast_find_empty(struct ubifs_info *c); 1655 const struct ubifs_lprops *ubifs_fast_find_freeable(struct ubifs_info *c); 1656 const struct ubifs_lprops *ubifs_fast_find_frdi_idx(struct ubifs_info *c); 1657 1658 /* file.c */ 1659 int ubifs_fsync(struct file *file, struct dentry *dentry, int datasync); 1660 int ubifs_setattr(struct dentry *dentry, struct iattr *attr); 1661 1662 /* dir.c */ 1663 struct inode *ubifs_new_inode(struct ubifs_info *c, const struct inode *dir, 1664 int mode); 1665 int ubifs_getattr(struct vfsmount *mnt, struct dentry *dentry, 1666 struct kstat *stat); 1667 1668 /* xattr.c */ 1669 int ubifs_setxattr(struct dentry *dentry, const char *name, 1670 const void *value, size_t size, int flags); 1671 ssize_t ubifs_getxattr(struct dentry *dentry, const char *name, void *buf, 1672 size_t size); 1673 ssize_t ubifs_listxattr(struct dentry *dentry, char *buffer, size_t size); 1674 int ubifs_removexattr(struct dentry *dentry, const char *name); 1675 1676 /* super.c */ 1677 struct inode *ubifs_iget(struct super_block *sb, unsigned long inum); 1678 1679 /* recovery.c */ 1680 int ubifs_recover_master_node(struct ubifs_info *c); 1681 int ubifs_write_rcvrd_mst_node(struct ubifs_info *c); 1682 struct ubifs_scan_leb *ubifs_recover_leb(struct ubifs_info *c, int lnum, 1683 int offs, void *sbuf, int grouped); 1684 struct ubifs_scan_leb *ubifs_recover_log_leb(struct ubifs_info *c, int lnum, 1685 int offs, void *sbuf); 1686 int ubifs_recover_inl_heads(const struct ubifs_info *c, void *sbuf); 1687 int ubifs_clean_lebs(const struct ubifs_info *c, void *sbuf); 1688 int ubifs_rcvry_gc_commit(struct ubifs_info *c); 1689 int ubifs_recover_size_accum(struct ubifs_info *c, union ubifs_key *key, 1690 int deletion, loff_t new_size); 1691 int ubifs_recover_size(struct ubifs_info *c); 1692 void ubifs_destroy_size_tree(struct ubifs_info *c); 1693 1694 /* ioctl.c */ 1695 long ubifs_ioctl(struct file *file, unsigned int cmd, unsigned long arg); 1696 void ubifs_set_inode_flags(struct inode *inode); 1697 #ifdef CONFIG_COMPAT 1698 long ubifs_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg); 1699 #endif 1700 1701 /* compressor.c */ 1702 int __init ubifs_compressors_init(void); 1703 void __exit ubifs_compressors_exit(void); 1704 void ubifs_compress(const void *in_buf, int in_len, void *out_buf, int *out_len, 1705 int *compr_type); 1706 int ubifs_decompress(const void *buf, int len, void *out, int *out_len, 1707 int compr_type); 1708 1709 #include "debug.h" 1710 #include "misc.h" 1711 #include "key.h" 1712 1713 #endif /* !__UBIFS_H__ */ 1714