···2727 The default value should be OK for SLC NAND flashes, NOR flashes and2828 other flashes which have eraseblock life-cycle 100000 or more.2929 However, in case of MLC NAND flashes which typically have eraseblock3030- life-cycle less then 10000, the threshold should be lessened (e.g.,3030+ life-cycle less than 10000, the threshold should be lessened (e.g.,3131 to 128 or 256, although it does not have to be power of 2).32323333config MTD_UBI_BEB_RESERVE
+1-1
drivers/mtd/ubi/io.c
···6565 *6666 * A: because when writing a sub-page, MTD still writes a full 2K page but the6767 * bytes which are no relevant to the sub-page are 0xFF. So, basically, writing6868- * 4x512 sub-pages is 4 times slower then writing one 2KiB NAND page. Thus, we6868+ * 4x512 sub-pages is 4 times slower than writing one 2KiB NAND page. Thus, we6969 * prefer to use sub-pages only for EV and VID headers.7070 *7171 * As it was noted above, the VID header may start at a non-aligned offset.
+3-3
drivers/mtd/ubi/kapi.c
···488488 *489489 * This function changes the contents of a logical eraseblock atomically. @buf490490 * has to contain new logical eraseblock data, and @len - the length of the491491- * data, which has to be aligned. The length may be shorter then the logical491491+ * data, which has to be aligned. The length may be shorter than the logical492492 * eraseblock size, ant the logical eraseblock may be appended to more times493493 * later on. This function guarantees that in case of an unclean reboot the old494494 * contents is preserved. Returns zero in case of success and a negative error···571571 *572572 * This function un-maps logical eraseblock @lnum and schedules the573573 * corresponding physical eraseblock for erasure, so that it will eventually be574574- * physically erased in background. This operation is much faster then the574574+ * physically erased in background. This operation is much faster than the575575 * erase operation.576576 *577577 * Unlike erase, the un-map operation does not guarantee that the logical···590590 *591591 * The main and obvious use-case of this function is when the contents of a592592 * logical eraseblock has to be re-written. Then it is much more efficient to593593- * first un-map it, then write new data, rather then first erase it, then write593593+ * first un-map it, then write new data, rather than first erase it, then write594594 * new data. Note, once new data has been written to the logical eraseblock,595595 * UBI guarantees that the old contents has gone forever. In other words, if an596596 * unclean reboot happens after the logical eraseblock has been un-mapped and
+2-2
drivers/mtd/ubi/scan.c
···231231 * case of success this function returns a positive value, in case of failure, a232232 * negative error code is returned. The success return codes use the following233233 * bits:234234- * o bit 0 is cleared: the first PEB (described by @seb) is newer then the234234+ * o bit 0 is cleared: the first PEB (described by @seb) is newer than the235235 * second PEB (described by @pnum and @vid_hdr);236236 * o bit 0 is set: the second PEB is newer;237237 * o bit 1 is cleared: no bit-flips were detected in the newer LEB;···452452453453 if (cmp_res & 1) {454454 /*455455- * This logical eraseblock is newer then the one455455+ * This logical eraseblock is newer than the one456456 * found earlier.457457 */458458 err = validate_vid_hdr(vid_hdr, sv, pnum);
+1-1
drivers/mtd/ubi/wl.c
···350350 * @max: highest possible erase counter351351 *352352 * This function looks for a wear leveling entry with erase counter closest to353353- * @max and less then @max.353353+ * @max and less than @max.354354 */355355static struct ubi_wl_entry *find_wl_entry(struct rb_root *root, int max)356356{