ubi.h 41.1 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0-or-later */
A
Artem B. Bityutskiy 已提交
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
/*
 * Copyright (c) International Business Machines Corp., 2006
 * Copyright (c) Nokia Corporation, 2006, 2007
 *
 * Author: Artem Bityutskiy (Битюцкий Артём)
 */

#ifndef __UBI_UBI_H__
#define __UBI_UBI_H__

#include <linux/types.h>
#include <linux/list.h>
#include <linux/rbtree.h>
#include <linux/sched.h>
#include <linux/wait.h>
#include <linux/mutex.h>
#include <linux/rwsem.h>
#include <linux/spinlock.h>
#include <linux/fs.h>
#include <linux/cdev.h>
#include <linux/device.h>
23
#include <linux/slab.h>
A
Artem B. Bityutskiy 已提交
24
#include <linux/string.h>
25
#include <linux/vmalloc.h>
K
Kevin Cernekee 已提交
26
#include <linux/notifier.h>
A
Artem B. Bityutskiy 已提交
27 28
#include <linux/mtd/mtd.h>
#include <linux/mtd/ubi.h>
29
#include <asm/pgtable.h>
A
Artem B. Bityutskiy 已提交
30

A
Artem Bityutskiy 已提交
31
#include "ubi-media.h"
A
Artem B. Bityutskiy 已提交
32 33 34 35 36 37 38

/* Maximum number of supported UBI devices */
#define UBI_MAX_DEVICES 32

/* UBI name used for character devices, sysfs, etc */
#define UBI_NAME_STR "ubi"

39 40
struct ubi_device;

A
Artem B. Bityutskiy 已提交
41
/* Normal UBI messages */
42 43 44
__printf(2, 3)
void ubi_msg(const struct ubi_device *ubi, const char *fmt, ...);

A
Artem B. Bityutskiy 已提交
45
/* UBI warning messages */
46 47 48
__printf(2, 3)
void ubi_warn(const struct ubi_device *ubi, const char *fmt, ...);

A
Artem B. Bityutskiy 已提交
49
/* UBI error messages */
50 51
__printf(2, 3)
void ubi_err(const struct ubi_device *ubi, const char *fmt, ...);
A
Artem B. Bityutskiy 已提交
52 53 54 55

/* Background thread name pattern */
#define UBI_BGT_NAME_PATTERN "ubi_bgt%dd"

56 57 58 59
/*
 * This marker in the EBA table means that the LEB is um-mapped.
 * NOTE! It has to have the same value as %UBI_ALL.
 */
A
Artem B. Bityutskiy 已提交
60 61 62 63 64 65 66 67
#define UBI_LEB_UNMAPPED -1

/*
 * In case of errors, UBI tries to repeat the operation several times before
 * returning error. The below constant defines how many times UBI re-tries.
 */
#define UBI_IO_RETRIES 3

X
Xiaochuan-Xu 已提交
68 69 70 71 72 73 74
/*
 * Length of the protection queue. The length is effectively equivalent to the
 * number of (global) erase cycles PEBs are protected from the wear-leveling
 * worker.
 */
#define UBI_PROT_QUEUE_LEN 10

75
/* The volume ID/LEB number/erase counter is unknown */
A
Artem Bityutskiy 已提交
76 77
#define UBI_UNKNOWN -1

78 79 80 81 82 83 84
/*
 * The UBI debugfs directory name pattern and maximum name length (3 for "ubi"
 * + 2 for the number plus 1 for the trailing zero byte.
 */
#define UBI_DFS_DIR_NAME "ubi%d"
#define UBI_DFS_DIR_LEN  (3 + 2 + 1)

A
Artem B. Bityutskiy 已提交
85
/*
A
Artem Bityutskiy 已提交
86
 * Error codes returned by the I/O sub-system.
A
Artem B. Bityutskiy 已提交
87
 *
88
 * UBI_IO_FF: the read region of flash contains only 0xFFs
89 90 91
 * UBI_IO_FF_BITFLIPS: the same as %UBI_IO_FF, but also also there was a data
 *                     integrity error reported by the MTD driver
 *                     (uncorrectable ECC error in case of NAND)
A
Artem Bityutskiy 已提交
92
 * UBI_IO_BAD_HDR: the EC or VID header is corrupted (bad magic or CRC)
A
Artem Bityutskiy 已提交
93 94 95
 * UBI_IO_BAD_HDR_EBADMSG: the same as %UBI_IO_BAD_HDR, but also there was a
 *                         data integrity error reported by the MTD driver
 *                         (uncorrectable ECC error in case of NAND)
A
Artem B. Bityutskiy 已提交
96
 * UBI_IO_BITFLIPS: bit-flips were detected and corrected
97 98 99 100
 *
 * Note, it is probably better to have bit-flip and ebadmsg as flags which can
 * be or'ed with other error code. But this is a big change because there are
 * may callers, so it does not worth the risk of introducing a bug
A
Artem B. Bityutskiy 已提交
101 102
 */
enum {
103
	UBI_IO_FF = 1,
104
	UBI_IO_FF_BITFLIPS,
A
Artem Bityutskiy 已提交
105
	UBI_IO_BAD_HDR,
A
Artem Bityutskiy 已提交
106
	UBI_IO_BAD_HDR_EBADMSG,
107
	UBI_IO_BITFLIPS,
A
Artem B. Bityutskiy 已提交
108 109
};

A
Artem Bityutskiy 已提交
110 111 112 113 114
/*
 * Return codes of the 'ubi_eba_copy_leb()' function.
 *
 * MOVE_CANCEL_RACE: canceled because the volume is being deleted, the source
 *                   PEB was put meanwhile, or there is I/O on the source PEB
115 116 117 118
 * MOVE_SOURCE_RD_ERR: canceled because there was a read error from the source
 *                     PEB
 * MOVE_TARGET_RD_ERR: canceled because there was a read error from the target
 *                     PEB
A
Artem Bityutskiy 已提交
119 120
 * MOVE_TARGET_WR_ERR: canceled because there was a write error to the target
 *                     PEB
121
 * MOVE_TARGET_BITFLIPS: canceled because a bit-flip was detected in the
A
Artem Bityutskiy 已提交
122
 *                       target PEB
123
 * MOVE_RETRY: retry scrubbing the PEB
A
Artem Bityutskiy 已提交
124 125 126
 */
enum {
	MOVE_CANCEL_RACE = 1,
127 128
	MOVE_SOURCE_RD_ERR,
	MOVE_TARGET_RD_ERR,
A
Artem Bityutskiy 已提交
129
	MOVE_TARGET_WR_ERR,
130
	MOVE_TARGET_BITFLIPS,
131
	MOVE_RETRY,
A
Artem Bityutskiy 已提交
132 133
};

134 135 136 137 138 139 140 141 142 143 144
/*
 * Return codes of the fastmap sub-system
 *
 * UBI_NO_FASTMAP: No fastmap super block was found
 * UBI_BAD_FASTMAP: A fastmap was found but it's unusable
 */
enum {
	UBI_NO_FASTMAP = 1,
	UBI_BAD_FASTMAP,
};

145 146 147 148 149 150 151 152 153 154 155
/*
 * Flags for emulate_power_cut in ubi_debug_info
 *
 * POWER_CUT_EC_WRITE: Emulate a power cut when writing an EC header
 * POWER_CUT_VID_WRITE: Emulate a power cut when writing a VID header
 */
enum {
	POWER_CUT_EC_WRITE = 0x01,
	POWER_CUT_VID_WRITE = 0x02,
};

156 157 158 159 160 161 162 163 164 165 166
/**
 * struct ubi_vid_io_buf - VID buffer used to read/write VID info to/from the
 *			   flash.
 * @hdr: a pointer to the VID header stored in buffer
 * @buffer: underlying buffer
 */
struct ubi_vid_io_buf {
	struct ubi_vid_hdr *hdr;
	void *buffer;
};

167 168
/**
 * struct ubi_wl_entry - wear-leveling entry.
169
 * @u.rb: link in the corresponding (free/used) RB-tree
X
Xiaochuan-Xu 已提交
170
 * @u.list: link in the protection queue
171 172 173
 * @ec: erase counter
 * @pnum: physical eraseblock number
 *
A
Artem Bityutskiy 已提交
174 175 176
 * This data structure is used in the WL sub-system. Each physical eraseblock
 * has a corresponding &struct wl_entry object which may be kept in different
 * RB-trees. See WL sub-system for details.
177 178
 */
struct ubi_wl_entry {
179 180
	union {
		struct rb_node rb;
X
Xiaochuan-Xu 已提交
181
		struct list_head list;
182
	} u;
183 184 185 186
	int ec;
	int pnum;
};

187 188 189 190 191 192 193 194 195
/**
 * struct ubi_ltree_entry - an entry in the lock tree.
 * @rb: links RB-tree nodes
 * @vol_id: volume ID of the locked logical eraseblock
 * @lnum: locked logical eraseblock number
 * @users: how many tasks are using this logical eraseblock or wait for it
 * @mutex: read/write mutex to implement read/write access serialization to
 *         the (@vol_id, @lnum) logical eraseblock
 *
A
Artem Bityutskiy 已提交
196 197
 * This data structure is used in the EBA sub-system to implement per-LEB
 * locking. When a logical eraseblock is being locked - corresponding
198
 * &struct ubi_ltree_entry object is inserted to the lock tree (@ubi->ltree).
A
Artem Bityutskiy 已提交
199
 * See EBA sub-system for details.
200 201 202 203 204 205 206 207 208
 */
struct ubi_ltree_entry {
	struct rb_node rb;
	int vol_id;
	int lnum;
	int users;
	struct rw_semaphore mutex;
};

209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229
/**
 * struct ubi_rename_entry - volume re-name description data structure.
 * @new_name_len: new volume name length
 * @new_name: new volume name
 * @remove: if not zero, this volume should be removed, not re-named
 * @desc: descriptor of the volume
 * @list: links re-name entries into a list
 *
 * This data structure is utilized in the multiple volume re-name code. Namely,
 * UBI first creates a list of &struct ubi_rename_entry objects from the
 * &struct ubi_rnvol_req request object, and then utilizes this list to do all
 * the job.
 */
struct ubi_rename_entry {
	int new_name_len;
	char new_name[UBI_VOL_NAME_MAX + 1];
	int remove;
	struct ubi_volume_desc *desc;
	struct list_head list;
};

A
Artem B. Bityutskiy 已提交
230 231
struct ubi_volume_desc;

232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
/**
 * struct ubi_fastmap_layout - in-memory fastmap data structure.
 * @e: PEBs used by the current fastmap
 * @to_be_tortured: if non-zero tortured this PEB
 * @used_blocks: number of used PEBs
 * @max_pool_size: maximal size of the user pool
 * @max_wl_pool_size: maximal size of the pool used by the WL sub-system
 */
struct ubi_fastmap_layout {
	struct ubi_wl_entry *e[UBI_FM_MAX_BLOCKS];
	int to_be_tortured[UBI_FM_MAX_BLOCKS];
	int used_blocks;
	int max_pool_size;
	int max_wl_pool_size;
};

/**
 * struct ubi_fm_pool - in-memory fastmap pool
 * @pebs: PEBs in this pool
 * @used: number of used PEBs
 * @size: total number of PEBs in this pool
 * @max_size: maximal size of the pool
 *
 * A pool gets filled with up to max_size.
 * If all PEBs within the pool are used a new fastmap will be written
 * to the flash and the pool gets refilled with empty PEBs.
 *
 */
struct ubi_fm_pool {
	int pebs[UBI_FM_MAX_POOL_SIZE];
	int used;
	int size;
	int max_size;
};

267 268 269 270 271 272 273 274 275 276 277 278 279 280 281
/**
 * struct ubi_eba_leb_desc - EBA logical eraseblock descriptor
 * @lnum: the logical eraseblock number
 * @pnum: the physical eraseblock where the LEB can be found
 *
 * This structure is here to hide EBA's internal from other part of the
 * UBI implementation.
 *
 * One can query the position of a LEB by calling ubi_eba_get_ldesc().
 */
struct ubi_eba_leb_desc {
	int lnum;
	int pnum;
};

A
Artem B. Bityutskiy 已提交
282 283 284 285 286 287
/**
 * struct ubi_volume - UBI volume description data structure.
 * @dev: device object to make use of the the Linux device model
 * @cdev: character device object to create character device
 * @ubi: reference to the UBI device description object
 * @vol_id: volume ID
288
 * @ref_count: volume reference count
A
Artem B. Bityutskiy 已提交
289 290 291
 * @readers: number of users holding this volume in read-only mode
 * @writers: number of users holding this volume in read-write mode
 * @exclusive: whether somebody holds this volume in exclusive mode
R
Richard Weinberger 已提交
292
 * @metaonly: whether somebody is altering only meta data of this volume
A
Artem B. Bityutskiy 已提交
293 294 295 296 297 298 299 300 301
 *
 * @reserved_pebs: how many physical eraseblocks are reserved for this volume
 * @vol_type: volume type (%UBI_DYNAMIC_VOLUME or %UBI_STATIC_VOLUME)
 * @usable_leb_size: logical eraseblock size without padding
 * @used_ebs: how many logical eraseblocks in this volume contain data
 * @last_eb_bytes: how many bytes are stored in the last logical eraseblock
 * @used_bytes: how many bytes of data this volume contains
 * @alignment: volume alignment
 * @data_pad: how many bytes are not used at the end of physical eraseblocks to
302
 *            satisfy the requested alignment
A
Artem B. Bityutskiy 已提交
303 304 305 306
 * @name_len: volume name length
 * @name: volume name
 *
 * @upd_ebs: how many eraseblocks are expected to be updated
307 308 309 310 311 312 313 314
 * @ch_lnum: LEB number which is being changing by the atomic LEB change
 *           operation
 * @upd_bytes: how many bytes are expected to be received for volume update or
 *             atomic LEB change
 * @upd_received: how many bytes were already received for volume update or
 *                atomic LEB change
 * @upd_buf: update buffer which is used to collect update data or data for
 *           atomic LEB change
A
Artem B. Bityutskiy 已提交
315 316
 *
 * @eba_tbl: EBA table of this volume (LEB->PEB mapping)
317 318 319
 * @skip_check: %1 if CRC check of this static volume should be skipped.
 *		Directly reflects the presence of the
 *		%UBI_VTBL_SKIP_CRC_CHECK_FLG flag in the vtbl entry
A
Artem Bityutskiy 已提交
320 321 322 323
 * @checked: %1 if this static volume was checked
 * @corrupted: %1 if the volume is corrupted (static volumes only)
 * @upd_marker: %1 if the update marker is set for this volume
 * @updating: %1 if the volume is being updated
324
 * @changing_leb: %1 if the atomic LEB change ioctl command is in progress
S
Sidney Amani 已提交
325
 * @direct_writes: %1 if direct writes are enabled for this volume
A
Artem B. Bityutskiy 已提交
326
 *
327 328 329
 * @checkmap: bitmap to remember which PEB->LEB mappings got checked,
 *            protected by UBI LEB lock tree.
 *
A
Artem B. Bityutskiy 已提交
330 331 332 333 334 335 336 337 338 339 340 341 342
 * The @corrupted field indicates that the volume's contents is corrupted.
 * Since UBI protects only static volumes, this field is not relevant to
 * dynamic volumes - it is user's responsibility to assure their data
 * integrity.
 *
 * The @upd_marker flag indicates that this volume is either being updated at
 * the moment or is damaged because of an unclean reboot.
 */
struct ubi_volume {
	struct device dev;
	struct cdev cdev;
	struct ubi_device *ubi;
	int vol_id;
343
	int ref_count;
A
Artem B. Bityutskiy 已提交
344 345 346
	int readers;
	int writers;
	int exclusive;
R
Richard Weinberger 已提交
347
	int metaonly;
A
Artem B. Bityutskiy 已提交
348 349 350 351 352 353 354 355 356 357

	int reserved_pebs;
	int vol_type;
	int usable_leb_size;
	int used_ebs;
	int last_eb_bytes;
	long long used_bytes;
	int alignment;
	int data_pad;
	int name_len;
358
	char name[UBI_VOL_NAME_MAX + 1];
A
Artem B. Bityutskiy 已提交
359 360

	int upd_ebs;
361
	int ch_lnum;
A
Artem B. Bityutskiy 已提交
362 363 364 365
	long long upd_bytes;
	long long upd_received;
	void *upd_buf;

B
Boris Brezillon 已提交
366
	struct ubi_eba_table *eba_tbl;
367
	unsigned int skip_check:1;
368 369 370 371 372
	unsigned int checked:1;
	unsigned int corrupted:1;
	unsigned int upd_marker:1;
	unsigned int updating:1;
	unsigned int changing_leb:1;
S
Sidney Amani 已提交
373
	unsigned int direct_writes:1;
374 375 376 377

#ifdef CONFIG_MTD_UBI_FASTMAP
	unsigned long *checkmap;
#endif
A
Artem B. Bityutskiy 已提交
378 379 380
};

/**
A
Artem Bityutskiy 已提交
381
 * struct ubi_volume_desc - UBI volume descriptor returned when it is opened.
A
Artem B. Bityutskiy 已提交
382
 * @vol: reference to the corresponding volume description object
R
Richard Weinberger 已提交
383 384
 * @mode: open mode (%UBI_READONLY, %UBI_READWRITE, %UBI_EXCLUSIVE
 * or %UBI_METAONLY)
A
Artem B. Bityutskiy 已提交
385 386 387 388 389 390 391 392
 */
struct ubi_volume_desc {
	struct ubi_volume *vol;
	int mode;
};

struct ubi_wl_entry;

393 394 395 396 397
/**
 * struct ubi_debug_info - debugging information for an UBI device.
 *
 * @chk_gen: if UBI general extra checks are enabled
 * @chk_io: if UBI I/O extra checks are enabled
398
 * @chk_fastmap: if UBI fastmap extra checks are enabled
399 400 401
 * @disable_bgt: disable the background task for testing purposes
 * @emulate_bitflips: emulate bit-flips for testing purposes
 * @emulate_io_failures: emulate write/erase failures for testing purposes
402 403 404 405
 * @emulate_power_cut: emulate power cut for testing purposes
 * @power_cut_counter: count down for writes left until emulated power cut
 * @power_cut_min: minimum number of writes before emulating a power cut
 * @power_cut_max: maximum number of writes until emulating a power cut
406 407 408 409
 * @dfs_dir_name: name of debugfs directory containing files of this UBI device
 * @dfs_dir: direntry object of the UBI device debugfs directory
 * @dfs_chk_gen: debugfs knob to enable UBI general extra checks
 * @dfs_chk_io: debugfs knob to enable UBI I/O extra checks
410
 * @dfs_chk_fastmap: debugfs knob to enable UBI fastmap extra checks
411 412 413
 * @dfs_disable_bgt: debugfs knob to disable the background task
 * @dfs_emulate_bitflips: debugfs knob to emulate bit-flips
 * @dfs_emulate_io_failures: debugfs knob to emulate write/erase failures
414 415 416
 * @dfs_emulate_power_cut: debugfs knob to emulate power cuts
 * @dfs_power_cut_min: debugfs knob for minimum writes before power cut
 * @dfs_power_cut_max: debugfs knob for maximum writes until power cut
417 418 419 420
 */
struct ubi_debug_info {
	unsigned int chk_gen:1;
	unsigned int chk_io:1;
421
	unsigned int chk_fastmap:1;
422 423 424
	unsigned int disable_bgt:1;
	unsigned int emulate_bitflips:1;
	unsigned int emulate_io_failures:1;
425 426 427 428
	unsigned int emulate_power_cut:2;
	unsigned int power_cut_counter;
	unsigned int power_cut_min;
	unsigned int power_cut_max;
429 430 431 432
	char dfs_dir_name[UBI_DFS_DIR_LEN + 1];
	struct dentry *dfs_dir;
	struct dentry *dfs_chk_gen;
	struct dentry *dfs_chk_io;
433
	struct dentry *dfs_chk_fastmap;
434 435 436
	struct dentry *dfs_disable_bgt;
	struct dentry *dfs_emulate_bitflips;
	struct dentry *dfs_emulate_io_failures;
437 438 439
	struct dentry *dfs_emulate_power_cut;
	struct dentry *dfs_power_cut_min;
	struct dentry *dfs_power_cut_max;
440 441
};

A
Artem B. Bityutskiy 已提交
442 443
/**
 * struct ubi_device - UBI device description structure
A
Artem Bityutskiy 已提交
444
 * @dev: UBI device object to use the the Linux device model
A
Artem B. Bityutskiy 已提交
445 446 447 448 449 450
 * @cdev: character device object to create character device
 * @ubi_num: UBI device number
 * @ubi_name: UBI device name
 * @vol_count: number of volumes in this UBI device
 * @volumes: volumes of this UBI device
 * @volumes_lock: protects @volumes, @rsvd_pebs, @avail_pebs, beb_rsvd_pebs,
451 452
 *                @beb_rsvd_level, @bad_peb_count, @good_peb_count, @vol_count,
 *                @vol->readers, @vol->writers, @vol->exclusive,
R
Richard Weinberger 已提交
453 454
 *                @vol->metaonly, @vol->ref_count, @vol->mapping and
 *                @vol->eba_tbl.
455
 * @ref_count: count of references on the UBI device
456
 * @image_seq: image sequence number recorded on EC headers
A
Artem B. Bityutskiy 已提交
457 458 459 460
 *
 * @rsvd_pebs: count of reserved physical eraseblocks
 * @avail_pebs: count of available physical eraseblocks
 * @beb_rsvd_pebs: how many physical eraseblocks are reserved for bad PEB
A
Artem Bityutskiy 已提交
461
 *                 handling
A
Artem B. Bityutskiy 已提交
462 463
 * @beb_rsvd_level: normal level of PEBs reserved for bad PEB handling
 *
A
Artem Bityutskiy 已提交
464
 * @autoresize_vol_id: ID of the volume which has to be auto-resized at the end
X
Xiaochuan-Xu 已提交
465
 *                     of UBI initialization
A
Artem B. Bityutskiy 已提交
466 467 468
 * @vtbl_slots: how many slots are available in the volume table
 * @vtbl_size: size of the volume table in bytes
 * @vtbl: in-RAM volume table copy
469 470 471
 * @device_mutex: protects on-flash volume table and serializes volume
 *                creation, deletion, update, re-size, re-name and set
 *                property
A
Artem B. Bityutskiy 已提交
472 473 474 475
 *
 * @max_ec: current highest erase counter value
 * @mean_ec: current mean erase counter value
 *
476
 * @global_sqnum: global sequence number
A
Artem B. Bityutskiy 已提交
477 478
 * @ltree_lock: protects the lock tree and @global_sqnum
 * @ltree: the lock tree
479
 * @alc_mutex: serializes "atomic LEB change" operations
A
Artem B. Bityutskiy 已提交
480
 *
481 482 483 484 485
 * @fm_disabled: non-zero if fastmap is disabled (default)
 * @fm: in-memory data structure of the currently used fastmap
 * @fm_pool: in-memory data structure of the fastmap pool
 * @fm_wl_pool: in-memory data structure of the fastmap pool used by the WL
 *		sub-system
486 487
 * @fm_protect: serializes ubi_update_fastmap(), protects @fm_buf and makes sure
 * that critical sections cannot be interrupted by ubi_update_fastmap()
488 489
 * @fm_buf: vmalloc()'d buffer which holds the raw fastmap
 * @fm_size: fastmap size in bytes
490
 * @fm_eba_sem: allows ubi_update_fastmap() to block EBA table changes
491
 * @fm_work: fastmap work queue
492
 * @fm_work_scheduled: non-zero if fastmap work was scheduled
493
 * @fast_attach: non-zero if UBI was attached by fastmap
S
Sascha Hauer 已提交
494 495
 * @fm_anchor: The next anchor PEB to use for fastmap
 * @fm_do_produce_anchor: If true produce an anchor PEB in wl
496
 *
A
Artem B. Bityutskiy 已提交
497
 * @used: RB-tree of used physical eraseblocks
498
 * @erroneous: RB-tree of erroneous used physical eraseblocks
A
Artem B. Bityutskiy 已提交
499
 * @free: RB-tree of free physical eraseblocks
500
 * @free_count: Contains the number of elements in @free
A
Artem B. Bityutskiy 已提交
501
 * @scrub: RB-tree of physical eraseblocks which need scrubbing
X
Xiaochuan-Xu 已提交
502 503 504 505
 * @pq: protection queue (contain physical eraseblocks which are temporarily
 *      protected from the wear-leveling worker)
 * @pq_head: protection queue head
 * @wl_lock: protects the @used, @free, @pq, @pq_head, @lookuptbl, @move_from,
506
 *	     @move_to, @move_to_put @erase_pending, @wl_scheduled, @works,
507 508
 *	     @erroneous, @erroneous_peb_count, @fm_work_scheduled, @fm_pool,
 *	     and @fm_wl_pool fields
509
 * @move_mutex: serializes eraseblock moves
510 511
 * @work_sem: used to wait for all the scheduled works to finish and prevent
 * new works from being submitted
A
Artem B. Bityutskiy 已提交
512 513
 * @wl_scheduled: non-zero if the wear-leveling was scheduled
 * @lookuptbl: a table to quickly find a &struct ubi_wl_entry object for any
514
 *             physical eraseblock
A
Artem B. Bityutskiy 已提交
515 516 517 518 519 520 521 522 523 524 525 526
 * @move_from: physical eraseblock from where the data is being moved
 * @move_to: physical eraseblock where the data is being moved to
 * @move_to_put: if the "to" PEB was put
 * @works: list of pending works
 * @works_count: count of pending works
 * @bgt_thread: background thread description object
 * @thread_enabled: if the background thread is enabled
 * @bgt_name: background thread name
 *
 * @flash_size: underlying MTD device size (in bytes)
 * @peb_count: count of physical eraseblocks on the MTD device
 * @peb_size: physical eraseblock size
527
 * @bad_peb_limit: top limit of expected bad physical eraseblocks
A
Artem B. Bityutskiy 已提交
528 529
 * @bad_peb_count: count of bad physical eraseblocks
 * @good_peb_count: count of good physical eraseblocks
A
Artem Bityutskiy 已提交
530 531
 * @corr_peb_count: count of corrupted physical eraseblocks (preserved and not
 *                  used by UBI)
532 533
 * @erroneous_peb_count: count of erroneous physical eraseblocks in @erroneous
 * @max_erroneous: maximum allowed amount of erroneous physical eraseblocks
A
Artem B. Bityutskiy 已提交
534 535 536 537 538
 * @min_io_size: minimal input/output unit size of the underlying MTD device
 * @hdrs_min_io_size: minimal I/O unit size used for VID and EC headers
 * @ro_mode: if the UBI device is in read-only mode
 * @leb_size: logical eraseblock size
 * @leb_start: starting offset of logical eraseblocks within physical
A
Artem Bityutskiy 已提交
539
 *             eraseblocks
A
Artem B. Bityutskiy 已提交
540 541 542
 * @ec_hdr_alsize: size of the EC header aligned to @hdrs_min_io_size
 * @vid_hdr_alsize: size of the VID header aligned to @hdrs_min_io_size
 * @vid_hdr_offset: starting offset of the volume identifier header (might be
A
Artem Bityutskiy 已提交
543
 *                  unaligned)
A
Artem B. Bityutskiy 已提交
544
 * @vid_hdr_aloffset: starting offset of the VID header aligned to
545
 *                    @hdrs_min_io_size
A
Artem B. Bityutskiy 已提交
546
 * @vid_hdr_shift: contains @vid_hdr_offset - @vid_hdr_aloffset
A
Andrew F. Davis 已提交
547
 * @bad_allowed: whether the MTD device admits bad physical eraseblocks or not
A
Artem Bityutskiy 已提交
548
 * @nor_flash: non-zero if working on top of NOR flash
549 550
 * @max_write_size: maximum amount of bytes the underlying flash can write at a
 *                  time (MTD write buffer size)
A
Artem B. Bityutskiy 已提交
551
 * @mtd: MTD device descriptor
552
 *
553 554
 * @peb_buf: a buffer of PEB size used for different purposes
 * @buf_mutex: protects @peb_buf
555
 * @ckvol_mutex: serializes static volume checking when opening
556 557
 *
 * @dbg: debugging information for this UBI device
A
Artem B. Bityutskiy 已提交
558 559 560 561 562 563 564 565 566
 */
struct ubi_device {
	struct cdev cdev;
	struct device dev;
	int ubi_num;
	char ubi_name[sizeof(UBI_NAME_STR)+5];
	int vol_count;
	struct ubi_volume *volumes[UBI_MAX_VOLUMES+UBI_INT_VOL_COUNT];
	spinlock_t volumes_lock;
567
	int ref_count;
568
	int image_seq;
A
Artem B. Bityutskiy 已提交
569 570 571 572 573

	int rsvd_pebs;
	int avail_pebs;
	int beb_rsvd_pebs;
	int beb_rsvd_level;
574
	int bad_peb_limit;
A
Artem B. Bityutskiy 已提交
575

A
Artem Bityutskiy 已提交
576
	int autoresize_vol_id;
A
Artem B. Bityutskiy 已提交
577 578 579
	int vtbl_slots;
	int vtbl_size;
	struct ubi_vtbl_record *vtbl;
580
	struct mutex device_mutex;
A
Artem B. Bityutskiy 已提交
581 582

	int max_ec;
A
Artem Bityutskiy 已提交
583
	/* Note, mean_ec is not updated run-time - should be fixed */
A
Artem B. Bityutskiy 已提交
584 585
	int mean_ec;

A
Artem Bityutskiy 已提交
586
	/* EBA sub-system's stuff */
A
Artem B. Bityutskiy 已提交
587 588 589
	unsigned long long global_sqnum;
	spinlock_t ltree_lock;
	struct rb_root ltree;
590
	struct mutex alc_mutex;
A
Artem B. Bityutskiy 已提交
591

592 593 594 595 596
	/* Fastmap stuff */
	int fm_disabled;
	struct ubi_fastmap_layout *fm;
	struct ubi_fm_pool fm_pool;
	struct ubi_fm_pool fm_wl_pool;
597 598
	struct rw_semaphore fm_eba_sem;
	struct rw_semaphore fm_protect;
599 600 601
	void *fm_buf;
	size_t fm_size;
	struct work_struct fm_work;
602
	int fm_work_scheduled;
603
	int fast_attach;
S
Sascha Hauer 已提交
604 605
	struct ubi_wl_entry *fm_anchor;
	int fm_do_produce_anchor;
606

A
Artem Bityutskiy 已提交
607
	/* Wear-leveling sub-system's stuff */
A
Artem B. Bityutskiy 已提交
608
	struct rb_root used;
609
	struct rb_root erroneous;
A
Artem B. Bityutskiy 已提交
610
	struct rb_root free;
611
	int free_count;
A
Artem B. Bityutskiy 已提交
612
	struct rb_root scrub;
X
Xiaochuan-Xu 已提交
613 614
	struct list_head pq[UBI_PROT_QUEUE_LEN];
	int pq_head;
A
Artem B. Bityutskiy 已提交
615
	spinlock_t wl_lock;
616
	struct mutex move_mutex;
A
Artem Bityutskiy 已提交
617
	struct rw_semaphore work_sem;
A
Artem B. Bityutskiy 已提交
618 619 620 621 622 623 624 625 626 627 628
	int wl_scheduled;
	struct ubi_wl_entry **lookuptbl;
	struct ubi_wl_entry *move_from;
	struct ubi_wl_entry *move_to;
	int move_to_put;
	struct list_head works;
	int works_count;
	struct task_struct *bgt_thread;
	int thread_enabled;
	char bgt_name[sizeof(UBI_BGT_NAME_PATTERN)+2];

A
Artem Bityutskiy 已提交
629
	/* I/O sub-system's stuff */
A
Artem B. Bityutskiy 已提交
630 631 632 633 634
	long long flash_size;
	int peb_count;
	int peb_size;
	int bad_peb_count;
	int good_peb_count;
A
Artem Bityutskiy 已提交
635
	int corr_peb_count;
636 637
	int erroneous_peb_count;
	int max_erroneous;
A
Artem B. Bityutskiy 已提交
638 639 640 641 642 643 644 645 646 647
	int min_io_size;
	int hdrs_min_io_size;
	int ro_mode;
	int leb_size;
	int leb_start;
	int ec_hdr_alsize;
	int vid_hdr_alsize;
	int vid_hdr_offset;
	int vid_hdr_aloffset;
	int vid_hdr_shift;
A
Artem Bityutskiy 已提交
648 649
	unsigned int bad_allowed:1;
	unsigned int nor_flash:1;
650
	int max_write_size;
A
Artem B. Bityutskiy 已提交
651
	struct mtd_info *mtd;
652

653
	void *peb_buf;
654
	struct mutex buf_mutex;
655
	struct mutex ckvol_mutex;
656

657
	struct ubi_debug_info dbg;
A
Artem B. Bityutskiy 已提交
658 659
};

A
Artem Bityutskiy 已提交
660 661 662 663
/**
 * struct ubi_ainf_peb - attach information about a physical eraseblock.
 * @ec: erase counter (%UBI_UNKNOWN if it is unknown)
 * @pnum: physical eraseblock number
664
 * @vol_id: ID of the volume this LEB belongs to
A
Artem Bityutskiy 已提交
665 666 667 668 669 670 671 672 673
 * @lnum: logical eraseblock number
 * @scrub: if this physical eraseblock needs scrubbing
 * @copy_flag: this LEB is a copy (@copy_flag is set in VID header of this LEB)
 * @sqnum: sequence number
 * @u: unions RB-tree or @list links
 * @u.rb: link in the per-volume RB-tree of &struct ubi_ainf_peb objects
 * @u.list: link in one of the eraseblock lists
 *
 * One object of this type is allocated for each physical eraseblock when
674 675
 * attaching an MTD device. Note, if this PEB does not belong to any LEB /
 * volume, the @vol_id and @lnum fields are initialized to %UBI_UNKNOWN.
A
Artem Bityutskiy 已提交
676 677 678 679
 */
struct ubi_ainf_peb {
	int ec;
	int pnum;
680
	int vol_id;
A
Artem Bityutskiy 已提交
681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732
	int lnum;
	unsigned int scrub:1;
	unsigned int copy_flag:1;
	unsigned long long sqnum;
	union {
		struct rb_node rb;
		struct list_head list;
	} u;
};

/**
 * struct ubi_ainf_volume - attaching information about a volume.
 * @vol_id: volume ID
 * @highest_lnum: highest logical eraseblock number in this volume
 * @leb_count: number of logical eraseblocks in this volume
 * @vol_type: volume type
 * @used_ebs: number of used logical eraseblocks in this volume (only for
 *            static volumes)
 * @last_data_size: amount of data in the last logical eraseblock of this
 *                  volume (always equivalent to the usable logical eraseblock
 *                  size in case of dynamic volumes)
 * @data_pad: how many bytes at the end of logical eraseblocks of this volume
 *            are not used (due to volume alignment)
 * @compat: compatibility flags of this volume
 * @rb: link in the volume RB-tree
 * @root: root of the RB-tree containing all the eraseblock belonging to this
 *        volume (&struct ubi_ainf_peb objects)
 *
 * One object of this type is allocated for each volume when attaching an MTD
 * device.
 */
struct ubi_ainf_volume {
	int vol_id;
	int highest_lnum;
	int leb_count;
	int vol_type;
	int used_ebs;
	int last_data_size;
	int data_pad;
	int compat;
	struct rb_node rb;
	struct rb_root root;
};

/**
 * struct ubi_attach_info - MTD device attaching information.
 * @volumes: root of the volume RB-tree
 * @corr: list of corrupted physical eraseblocks
 * @free: list of free physical eraseblocks
 * @erase: list of physical eraseblocks which have to be erased
 * @alien: list of physical eraseblocks which should not be used by UBI (e.g.,
 *         those belonging to "preserve"-compatible internal volumes)
733 734
 * @fastmap: list of physical eraseblocks which relate to fastmap (e.g.,
 *           eraseblocks of the current and not yet erased old fastmap blocks)
A
Artem Bityutskiy 已提交
735 736 737 738 739 740 741 742 743 744
 * @corr_peb_count: count of PEBs in the @corr list
 * @empty_peb_count: count of PEBs which are presumably empty (contain only
 *                   0xFF bytes)
 * @alien_peb_count: count of PEBs in the @alien list
 * @bad_peb_count: count of bad physical eraseblocks
 * @maybe_bad_peb_count: count of bad physical eraseblocks which are not marked
 *                       as bad yet, but which look like bad
 * @vols_found: number of volumes found
 * @highest_vol_id: highest volume ID
 * @is_empty: flag indicating whether the MTD device is empty or not
745 746
 * @force_full_scan: flag indicating whether we need to do a full scan and drop
		     all existing Fastmap data structures
A
Artem Bityutskiy 已提交
747 748 749 750 751 752 753
 * @min_ec: lowest erase counter value
 * @max_ec: highest erase counter value
 * @max_sqnum: highest sequence number value
 * @mean_ec: mean erase counter value
 * @ec_sum: a temporary variable used when calculating @mean_ec
 * @ec_count: a temporary variable used when calculating @mean_ec
 * @aeb_slab_cache: slab cache for &struct ubi_ainf_peb objects
754
 * @ech: temporary EC header. Only available during scan
755
 * @vidh: temporary VID buffer. Only available during scan
A
Artem Bityutskiy 已提交
756 757 758 759 760 761 762 763 764 765 766
 *
 * This data structure contains the result of attaching an MTD device and may
 * be used by other UBI sub-systems to build final UBI data structures, further
 * error-recovery and so on.
 */
struct ubi_attach_info {
	struct rb_root volumes;
	struct list_head corr;
	struct list_head free;
	struct list_head erase;
	struct list_head alien;
767
	struct list_head fastmap;
A
Artem Bityutskiy 已提交
768 769 770 771 772 773 774 775
	int corr_peb_count;
	int empty_peb_count;
	int alien_peb_count;
	int bad_peb_count;
	int maybe_bad_peb_count;
	int vols_found;
	int highest_vol_id;
	int is_empty;
776
	int force_full_scan;
A
Artem Bityutskiy 已提交
777 778 779 780 781 782 783
	int min_ec;
	int max_ec;
	unsigned long long max_sqnum;
	int mean_ec;
	uint64_t ec_sum;
	int ec_count;
	struct kmem_cache *aeb_slab_cache;
784
	struct ubi_ec_hdr *ech;
785
	struct ubi_vid_io_buf *vidb;
A
Artem Bityutskiy 已提交
786 787
};

788 789 790 791 792 793 794 795 796
/**
 * struct ubi_work - UBI work description data structure.
 * @list: a link in the list of pending works
 * @func: worker function
 * @e: physical eraseblock to erase
 * @vol_id: the volume ID on which this erasure is being performed
 * @lnum: the logical eraseblock number
 * @torture: if the physical eraseblock has to be tortured
 *
797 798 799 800
 * The @func pointer points to the worker function. If the @shutdown argument is
 * not zero, the worker has to free the resources and exit immediately as the
 * WL sub-system is shutting down.
 * The worker has to return zero in case of success and a negative error code in
801 802 803 804
 * case of failure.
 */
struct ubi_work {
	struct list_head list;
805
	int (*func)(struct ubi_device *ubi, struct ubi_work *wrk, int shutdown);
806 807 808 809 810 811 812
	/* The below fields are only relevant to erasure works */
	struct ubi_wl_entry *e;
	int vol_id;
	int lnum;
	int torture;
};

813 814
#include "debug.h"

815
extern struct kmem_cache *ubi_wl_entry_slab;
J
Jan Engelhardt 已提交
816 817 818
extern const struct file_operations ubi_ctrl_cdev_operations;
extern const struct file_operations ubi_cdev_operations;
extern const struct file_operations ubi_vol_cdev_operations;
819
extern struct class ubi_class;
820
extern struct mutex ubi_devices_mutex;
D
Dmitry Pervushin 已提交
821
extern struct blocking_notifier_head ubi_notifiers;
A
Artem B. Bityutskiy 已提交
822

823
/* attach.c */
824 825 826
struct ubi_ainf_peb *ubi_alloc_aeb(struct ubi_attach_info *ai, int pnum,
				   int ec);
void ubi_free_aeb(struct ubi_attach_info *ai, struct ubi_ainf_peb *aeb);
A
Artem Bityutskiy 已提交
827 828
int ubi_add_to_av(struct ubi_device *ubi, struct ubi_attach_info *ai, int pnum,
		  int ec, const struct ubi_vid_hdr *vid_hdr, int bitflips);
829
struct ubi_ainf_volume *ubi_add_av(struct ubi_attach_info *ai, int vol_id);
A
Artem Bityutskiy 已提交
830 831 832 833 834
struct ubi_ainf_volume *ubi_find_av(const struct ubi_attach_info *ai,
				    int vol_id);
void ubi_remove_av(struct ubi_attach_info *ai, struct ubi_ainf_volume *av);
struct ubi_ainf_peb *ubi_early_get_peb(struct ubi_device *ubi,
				       struct ubi_attach_info *ai);
835
int ubi_attach(struct ubi_device *ubi, int force_scan);
A
Artem Bityutskiy 已提交
836 837
void ubi_destroy_ai(struct ubi_attach_info *ai);

A
Artem B. Bityutskiy 已提交
838 839 840
/* vtbl.c */
int ubi_change_vtbl_record(struct ubi_device *ubi, int idx,
			   struct ubi_vtbl_record *vtbl_rec);
841 842
int ubi_vtbl_rename_volumes(struct ubi_device *ubi,
			    struct list_head *rename_list);
A
Artem Bityutskiy 已提交
843
int ubi_read_volume_table(struct ubi_device *ubi, struct ubi_attach_info *ai);
A
Artem B. Bityutskiy 已提交
844 845 846

/* vmt.c */
int ubi_create_volume(struct ubi_device *ubi, struct ubi_mkvol_req *req);
847
int ubi_remove_volume(struct ubi_volume_desc *desc, int no_vtbl);
A
Artem B. Bityutskiy 已提交
848
int ubi_resize_volume(struct ubi_volume_desc *desc, int reserved_pebs);
849
int ubi_rename_volumes(struct ubi_device *ubi, struct list_head *rename_list);
850 851
int ubi_add_volume(struct ubi_device *ubi, struct ubi_volume *vol);
void ubi_free_volume(struct ubi_device *ubi, struct ubi_volume *vol);
A
Artem B. Bityutskiy 已提交
852 853

/* upd.c */
854 855 856
int ubi_start_update(struct ubi_device *ubi, struct ubi_volume *vol,
		     long long bytes);
int ubi_more_update_data(struct ubi_device *ubi, struct ubi_volume *vol,
A
Artem B. Bityutskiy 已提交
857
			 const void __user *buf, int count);
858 859 860 861
int ubi_start_leb_change(struct ubi_device *ubi, struct ubi_volume *vol,
			 const struct ubi_leb_change_req *req);
int ubi_more_leb_change_data(struct ubi_device *ubi, struct ubi_volume *vol,
			     const void __user *buf, int count);
A
Artem B. Bityutskiy 已提交
862 863

/* misc.c */
864 865
int ubi_calc_data_len(const struct ubi_device *ubi, const void *buf,
		      int length);
A
Artem B. Bityutskiy 已提交
866
int ubi_check_volume(struct ubi_device *ubi, int vol_id);
867
void ubi_update_reserved(struct ubi_device *ubi);
A
Artem B. Bityutskiy 已提交
868
void ubi_calculate_reserved(struct ubi_device *ubi);
869
int ubi_check_pattern(const void *buf, uint8_t patt, int size);
A
Artem B. Bityutskiy 已提交
870

871 872 873 874 875
static inline bool ubi_leb_valid(struct ubi_volume *vol, int lnum)
{
	return lnum >= 0 && lnum < vol->reserved_pebs;
}

A
Artem B. Bityutskiy 已提交
876
/* eba.c */
B
Boris Brezillon 已提交
877 878 879 880 881 882
struct ubi_eba_table *ubi_eba_create_table(struct ubi_volume *vol,
					   int nentries);
void ubi_eba_destroy_table(struct ubi_eba_table *tbl);
void ubi_eba_copy_table(struct ubi_volume *vol, struct ubi_eba_table *dst,
			int nentries);
void ubi_eba_replace_table(struct ubi_volume *vol, struct ubi_eba_table *tbl);
883 884
void ubi_eba_get_ldesc(struct ubi_volume *vol, int lnum,
		       struct ubi_eba_leb_desc *ldesc);
885
bool ubi_eba_is_mapped(struct ubi_volume *vol, int lnum);
886 887 888 889
int ubi_eba_unmap_leb(struct ubi_device *ubi, struct ubi_volume *vol,
		      int lnum);
int ubi_eba_read_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum,
		     void *buf, int offset, int len, int check);
890 891 892
int ubi_eba_read_leb_sg(struct ubi_device *ubi, struct ubi_volume *vol,
			struct ubi_sgl *sgl, int lnum, int offset, int len,
			int check);
893
int ubi_eba_write_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum,
R
Richard Weinberger 已提交
894
		      const void *buf, int offset, int len);
895
int ubi_eba_write_leb_st(struct ubi_device *ubi, struct ubi_volume *vol,
R
Richard Weinberger 已提交
896
			 int lnum, const void *buf, int len, int used_ebs);
897
int ubi_eba_atomic_leb_change(struct ubi_device *ubi, struct ubi_volume *vol,
R
Richard Weinberger 已提交
898
			      int lnum, const void *buf, int len);
A
Artem B. Bityutskiy 已提交
899
int ubi_eba_copy_leb(struct ubi_device *ubi, int from, int to,
900
		     struct ubi_vid_io_buf *vidb);
901
int ubi_eba_init(struct ubi_device *ubi, struct ubi_attach_info *ai);
902 903 904
unsigned long long ubi_next_sqnum(struct ubi_device *ubi);
int self_check_eba(struct ubi_device *ubi, struct ubi_attach_info *ai_fastmap,
		   struct ubi_attach_info *ai_scan);
A
Artem B. Bityutskiy 已提交
905 906

/* wl.c */
R
Richard Weinberger 已提交
907
int ubi_wl_get_peb(struct ubi_device *ubi);
908 909
int ubi_wl_put_peb(struct ubi_device *ubi, int vol_id, int lnum,
		   int pnum, int torture);
910
int ubi_wl_flush(struct ubi_device *ubi, int vol_id, int lnum);
A
Artem B. Bityutskiy 已提交
911
int ubi_wl_scrub_peb(struct ubi_device *ubi, int pnum);
912
int ubi_wl_init(struct ubi_device *ubi, struct ubi_attach_info *ai);
A
Artem B. Bityutskiy 已提交
913
void ubi_wl_close(struct ubi_device *ubi);
914
int ubi_thread(void *u);
915 916 917 918 919 920
struct ubi_wl_entry *ubi_wl_get_fm_peb(struct ubi_device *ubi, int anchor);
int ubi_wl_put_fm_peb(struct ubi_device *ubi, struct ubi_wl_entry *used_e,
		      int lnum, int torture);
int ubi_is_erase_work(struct ubi_work *wrk);
void ubi_refill_pools(struct ubi_device *ubi);
int ubi_ensure_anchor_pebs(struct ubi_device *ubi);
921
int ubi_bitflip_check(struct ubi_device *ubi, int pnum, int force_scrub);
A
Artem B. Bityutskiy 已提交
922 923 924 925

/* io.c */
int ubi_io_read(const struct ubi_device *ubi, void *buf, int pnum, int offset,
		int len);
926 927 928
int ubi_io_write(struct ubi_device *ubi, const void *buf, int pnum, int offset,
		 int len);
int ubi_io_sync_erase(struct ubi_device *ubi, int pnum, int torture);
A
Artem B. Bityutskiy 已提交
929 930
int ubi_io_is_bad(const struct ubi_device *ubi, int pnum);
int ubi_io_mark_bad(const struct ubi_device *ubi, int pnum);
931
int ubi_io_read_ec_hdr(struct ubi_device *ubi, int pnum,
A
Artem B. Bityutskiy 已提交
932
		       struct ubi_ec_hdr *ec_hdr, int verbose);
933
int ubi_io_write_ec_hdr(struct ubi_device *ubi, int pnum,
A
Artem B. Bityutskiy 已提交
934
			struct ubi_ec_hdr *ec_hdr);
935
int ubi_io_read_vid_hdr(struct ubi_device *ubi, int pnum,
936
			struct ubi_vid_io_buf *vidb, int verbose);
937
int ubi_io_write_vid_hdr(struct ubi_device *ubi, int pnum,
938
			 struct ubi_vid_io_buf *vidb);
A
Artem B. Bityutskiy 已提交
939

940
/* build.c */
941 942
int ubi_attach_mtd_dev(struct mtd_info *mtd, int ubi_num,
		       int vid_hdr_offset, int max_beb_per1024);
943
int ubi_detach_mtd_dev(int ubi_num, int anyway);
944 945 946 947
struct ubi_device *ubi_get_device(int ubi_num);
void ubi_put_device(struct ubi_device *ubi);
struct ubi_device *ubi_get_by_major(int major);
int ubi_major2num(int major);
D
Dmitry Pervushin 已提交
948 949 950 951 952
int ubi_volume_notify(struct ubi_device *ubi, struct ubi_volume *vol,
		      int ntype);
int ubi_notify_all(struct ubi_device *ubi, int ntype,
		   struct notifier_block *nb);
int ubi_enumerate_volumes(struct notifier_block *nb);
953
void ubi_free_internal_volumes(struct ubi_device *ubi);
D
Dmitry Pervushin 已提交
954 955 956 957 958

/* kapi.c */
void ubi_do_get_device_info(struct ubi_device *ubi, struct ubi_device_info *di);
void ubi_do_get_volume_info(struct ubi_device *ubi, struct ubi_volume *vol,
			    struct ubi_volume_info *vi);
959 960 961 962 963
/* scan.c */
int ubi_compare_lebs(struct ubi_device *ubi, const struct ubi_ainf_peb *aeb,
		      int pnum, const struct ubi_vid_hdr *vid_hdr);

/* fastmap.c */
964
#ifdef CONFIG_MTD_UBI_FASTMAP
965 966 967
size_t ubi_calc_fm_size(struct ubi_device *ubi);
int ubi_update_fastmap(struct ubi_device *ubi);
int ubi_scan_fastmap(struct ubi_device *ubi, struct ubi_attach_info *ai,
968
		     struct ubi_attach_info *scan_ai);
969 970
int ubi_fastmap_init_checkmap(struct ubi_volume *vol, int leb_count);
void ubi_fastmap_destroy_checkmap(struct ubi_volume *vol);
971 972
#else
static inline int ubi_update_fastmap(struct ubi_device *ubi) { return 0; }
973
static inline int ubi_fastmap_init_checkmap(struct ubi_volume *vol, int leb_count) { return 0; }
974
static inline void ubi_fastmap_destroy_checkmap(struct ubi_volume *vol) {}
975
#endif
976

977 978 979 980
/* block.c */
#ifdef CONFIG_MTD_UBI_BLOCK
int ubiblock_init(void);
void ubiblock_exit(void);
981 982
int ubiblock_create(struct ubi_volume_info *vi);
int ubiblock_remove(struct ubi_volume_info *vi);
983 984 985
#else
static inline int ubiblock_init(void) { return 0; }
static inline void ubiblock_exit(void) {}
986 987
static inline int ubiblock_create(struct ubi_volume_info *vi)
{
988
	return -ENOSYS;
989 990 991
}
static inline int ubiblock_remove(struct ubi_volume_info *vi)
{
992
	return -ENOSYS;
993
}
994 995
#endif

996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031
/*
 * ubi_for_each_free_peb - walk the UBI free RB tree.
 * @ubi: UBI device description object
 * @e: a pointer to a ubi_wl_entry to use as cursor
 * @pos: a pointer to RB-tree entry type to use as a loop counter
 */
#define ubi_for_each_free_peb(ubi, e, tmp_rb)	\
	ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->free, u.rb)

/*
 * ubi_for_each_used_peb - walk the UBI used RB tree.
 * @ubi: UBI device description object
 * @e: a pointer to a ubi_wl_entry to use as cursor
 * @pos: a pointer to RB-tree entry type to use as a loop counter
 */
#define ubi_for_each_used_peb(ubi, e, tmp_rb)	\
	ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->used, u.rb)

/*
 * ubi_for_each_scub_peb - walk the UBI scub RB tree.
 * @ubi: UBI device description object
 * @e: a pointer to a ubi_wl_entry to use as cursor
 * @pos: a pointer to RB-tree entry type to use as a loop counter
 */
#define ubi_for_each_scrub_peb(ubi, e, tmp_rb)	\
	ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->scrub, u.rb)

/*
 * ubi_for_each_protected_peb - walk the UBI protection queue.
 * @ubi: UBI device description object
 * @i: a integer used as counter
 * @e: a pointer to a ubi_wl_entry to use as cursor
 */
#define ubi_for_each_protected_peb(ubi, i, e)	\
	for ((i) = 0; (i) < UBI_PROT_QUEUE_LEN; (i)++)	\
		list_for_each_entry((e), &(ubi->pq[(i)]), u.list)
1032

A
Artem B. Bityutskiy 已提交
1033 1034
/*
 * ubi_rb_for_each_entry - walk an RB-tree.
1035
 * @rb: a pointer to type 'struct rb_node' to use as a loop counter
A
Artem B. Bityutskiy 已提交
1036 1037 1038 1039 1040 1041 1042 1043
 * @pos: a pointer to RB-tree entry type to use as a loop counter
 * @root: RB-tree's root
 * @member: the name of the 'struct rb_node' within the RB-tree entry
 */
#define ubi_rb_for_each_entry(rb, pos, root, member)                         \
	for (rb = rb_first(root),                                            \
	     pos = (rb ? container_of(rb, typeof(*pos), member) : NULL);     \
	     rb;                                                             \
1044 1045
	     rb = rb_next(rb),                                               \
	     pos = (rb ? container_of(rb, typeof(*pos), member) : NULL))
A
Artem B. Bityutskiy 已提交
1046

A
Artem Bityutskiy 已提交
1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061
/*
 * ubi_move_aeb_to_list - move a PEB from the volume tree to a list.
 *
 * @av: volume attaching information
 * @aeb: attaching eraseblock information
 * @list: the list to move to
 */
static inline void ubi_move_aeb_to_list(struct ubi_ainf_volume *av,
					 struct ubi_ainf_peb *aeb,
					 struct list_head *list)
{
		rb_erase(&aeb->u.rb, &av->root);
		list_add_tail(&aeb->u.list, list);
}

A
Artem B. Bityutskiy 已提交
1062
/**
1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082
 * ubi_init_vid_buf - Initialize a VID buffer
 * @ubi: the UBI device
 * @vidb: the VID buffer to initialize
 * @buf: the underlying buffer
 */
static inline void ubi_init_vid_buf(const struct ubi_device *ubi,
				    struct ubi_vid_io_buf *vidb,
				    void *buf)
{
	if (buf)
		memset(buf, 0, ubi->vid_hdr_alsize);

	vidb->buffer = buf;
	vidb->hdr = buf + ubi->vid_hdr_shift;
}

/**
 * ubi_init_vid_buf - Allocate a VID buffer
 * @ubi: the UBI device
 * @gfp_flags: GFP flags to use for the allocation
A
Artem B. Bityutskiy 已提交
1083
 */
1084 1085
static inline struct ubi_vid_io_buf *
ubi_alloc_vid_buf(const struct ubi_device *ubi, gfp_t gfp_flags)
A
Artem B. Bityutskiy 已提交
1086
{
1087 1088 1089 1090 1091 1092
	struct ubi_vid_io_buf *vidb;
	void *buf;

	vidb = kzalloc(sizeof(*vidb), gfp_flags);
	if (!vidb)
		return NULL;
A
Artem B. Bityutskiy 已提交
1093

1094 1095 1096
	buf = kmalloc(ubi->vid_hdr_alsize, gfp_flags);
	if (!buf) {
		kfree(vidb);
A
Artem B. Bityutskiy 已提交
1097
		return NULL;
1098
	}
A
Artem B. Bityutskiy 已提交
1099

1100 1101 1102
	ubi_init_vid_buf(ubi, vidb, buf);

	return vidb;
A
Artem B. Bityutskiy 已提交
1103 1104 1105
}

/**
1106 1107
 * ubi_free_vid_buf - Free a VID buffer
 * @vidb: the VID buffer to free
A
Artem B. Bityutskiy 已提交
1108
 */
1109
static inline void ubi_free_vid_buf(struct ubi_vid_io_buf *vidb)
A
Artem B. Bityutskiy 已提交
1110
{
1111
	if (!vidb)
A
Artem B. Bityutskiy 已提交
1112 1113
		return;

1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124
	kfree(vidb->buffer);
	kfree(vidb);
}

/**
 * ubi_get_vid_hdr - Get the VID header attached to a VID buffer
 * @vidb: VID buffer
 */
static inline struct ubi_vid_hdr *ubi_get_vid_hdr(struct ubi_vid_io_buf *vidb)
{
	return vidb->hdr;
A
Artem B. Bityutskiy 已提交
1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143
}

/*
 * This function is equivalent to 'ubi_io_read()', but @offset is relative to
 * the beginning of the logical eraseblock, not to the beginning of the
 * physical eraseblock.
 */
static inline int ubi_io_read_data(const struct ubi_device *ubi, void *buf,
				   int pnum, int offset, int len)
{
	ubi_assert(offset >= 0);
	return ubi_io_read(ubi, buf, pnum, offset + ubi->leb_start, len);
}

/*
 * This function is equivalent to 'ubi_io_write()', but @offset is relative to
 * the beginning of the logical eraseblock, not to the beginning of the
 * physical eraseblock.
 */
1144
static inline int ubi_io_write_data(struct ubi_device *ubi, const void *buf,
A
Artem B. Bityutskiy 已提交
1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156
				    int pnum, int offset, int len)
{
	ubi_assert(offset >= 0);
	return ubi_io_write(ubi, buf, pnum, offset + ubi->leb_start, len);
}

/**
 * ubi_ro_mode - switch to read-only mode.
 * @ubi: UBI device description object
 */
static inline void ubi_ro_mode(struct ubi_device *ubi)
{
1157 1158
	if (!ubi->ro_mode) {
		ubi->ro_mode = 1;
1159
		ubi_warn(ubi, "switch to read-only mode");
1160
		dump_stack();
1161
	}
A
Artem B. Bityutskiy 已提交
1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189
}

/**
 * vol_id2idx - get table index by volume ID.
 * @ubi: UBI device description object
 * @vol_id: volume ID
 */
static inline int vol_id2idx(const struct ubi_device *ubi, int vol_id)
{
	if (vol_id >= UBI_INTERNAL_VOL_START)
		return vol_id - UBI_INTERNAL_VOL_START + ubi->vtbl_slots;
	else
		return vol_id;
}

/**
 * idx2vol_id - get volume ID by table index.
 * @ubi: UBI device description object
 * @idx: table index
 */
static inline int idx2vol_id(const struct ubi_device *ubi, int idx)
{
	if (idx >= ubi->vtbl_slots)
		return idx - ubi->vtbl_slots + UBI_INTERNAL_VOL_START;
	else
		return idx;
}

1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204
/**
 * ubi_is_fm_vol - check whether a volume ID is a Fastmap volume.
 * @vol_id: volume ID
 */
static inline bool ubi_is_fm_vol(int vol_id)
{
	switch (vol_id) {
		case UBI_FM_SB_VOLUME_ID:
		case UBI_FM_DATA_VOLUME_ID:
		return true;
	}

	return false;
}

1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227
/**
 * ubi_find_fm_block - check whether a PEB is part of the current Fastmap.
 * @ubi: UBI device description object
 * @pnum: physical eraseblock to look for
 *
 * This function returns a wear leveling object if @pnum relates to the current
 * fastmap, @NULL otherwise.
 */
static inline struct ubi_wl_entry *ubi_find_fm_block(const struct ubi_device *ubi,
						     int pnum)
{
	int i;

	if (ubi->fm) {
		for (i = 0; i < ubi->fm->used_blocks; i++) {
			if (ubi->fm->e[i]->pnum == pnum)
				return ubi->fm->e[i];
		}
	}

	return NULL;
}

A
Artem B. Bityutskiy 已提交
1228
#endif /* !__UBI_UBI_H__ */