Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux

UBI: fix s/then/than/ typos

Signed-off-by: Shinya Kuribayashi <shinya.kuribayashi.px@renesas.com>
Signed-off-by: Artem Bityutskiy <Artem.Bityutskiy@nokia.com>

authored by

Shinya Kuribayashi and committed by
Artem Bityutskiy
3f502622 af7ad7a0

+8 -8
+1 -1
drivers/mtd/ubi/Kconfig
··· 27 27 The default value should be OK for SLC NAND flashes, NOR flashes and 28 28 other flashes which have eraseblock life-cycle 100000 or more. 29 29 However, in case of MLC NAND flashes which typically have eraseblock 30 - life-cycle less then 10000, the threshold should be lessened (e.g., 30 + life-cycle less than 10000, the threshold should be lessened (e.g., 31 31 to 128 or 256, although it does not have to be power of 2). 32 32 33 33 config MTD_UBI_BEB_RESERVE
+1 -1
drivers/mtd/ubi/io.c
··· 65 65 * 66 66 * A: because when writing a sub-page, MTD still writes a full 2K page but the 67 67 * bytes which are no relevant to the sub-page are 0xFF. So, basically, writing 68 - * 4x512 sub-pages is 4 times slower then writing one 2KiB NAND page. Thus, we 68 + * 4x512 sub-pages is 4 times slower than writing one 2KiB NAND page. Thus, we 69 69 * prefer to use sub-pages only for EV and VID headers. 70 70 * 71 71 * As it was noted above, the VID header may start at a non-aligned offset.
+3 -3
drivers/mtd/ubi/kapi.c
··· 488 488 * 489 489 * This function changes the contents of a logical eraseblock atomically. @buf 490 490 * has to contain new logical eraseblock data, and @len - the length of the 491 - * data, which has to be aligned. The length may be shorter then the logical 491 + * data, which has to be aligned. The length may be shorter than the logical 492 492 * eraseblock size, ant the logical eraseblock may be appended to more times 493 493 * later on. This function guarantees that in case of an unclean reboot the old 494 494 * contents is preserved. Returns zero in case of success and a negative error ··· 571 571 * 572 572 * This function un-maps logical eraseblock @lnum and schedules the 573 573 * corresponding physical eraseblock for erasure, so that it will eventually be 574 - * physically erased in background. This operation is much faster then the 574 + * physically erased in background. This operation is much faster than the 575 575 * erase operation. 576 576 * 577 577 * Unlike erase, the un-map operation does not guarantee that the logical ··· 590 590 * 591 591 * The main and obvious use-case of this function is when the contents of a 592 592 * logical eraseblock has to be re-written. Then it is much more efficient to 593 - * first un-map it, then write new data, rather then first erase it, then write 593 + * first un-map it, then write new data, rather than first erase it, then write 594 594 * new data. Note, once new data has been written to the logical eraseblock, 595 595 * UBI guarantees that the old contents has gone forever. In other words, if an 596 596 * unclean reboot happens after the logical eraseblock has been un-mapped and
+2 -2
drivers/mtd/ubi/scan.c
··· 231 231 * case of success this function returns a positive value, in case of failure, a 232 232 * negative error code is returned. The success return codes use the following 233 233 * bits: 234 - * o bit 0 is cleared: the first PEB (described by @seb) is newer then the 234 + * o bit 0 is cleared: the first PEB (described by @seb) is newer than the 235 235 * second PEB (described by @pnum and @vid_hdr); 236 236 * o bit 0 is set: the second PEB is newer; 237 237 * o bit 1 is cleared: no bit-flips were detected in the newer LEB; ··· 452 452 453 453 if (cmp_res & 1) { 454 454 /* 455 - * This logical eraseblock is newer then the one 455 + * This logical eraseblock is newer than the one 456 456 * found earlier. 457 457 */ 458 458 err = validate_vid_hdr(vid_hdr, sv, pnum);
+1 -1
drivers/mtd/ubi/wl.c
··· 350 350 * @max: highest possible erase counter 351 351 * 352 352 * This function looks for a wear leveling entry with erase counter closest to 353 - * @max and less then @max. 353 + * @max and less than @max. 354 354 */ 355 355 static struct ubi_wl_entry *find_wl_entry(struct rb_root *root, int max) 356 356 {