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