Eric Lee / smarc-fsl-linux-kernel

09 May, 2007

2 commits

08 May, 2007

1 commit

28 Apr, 2007

1 commit

27 Apr, 2007

1 commit

  • 801c135ce   UBI: Unsorted Block Images ... Browse Code »

    UBI (Latin: "where?") manages multiple logical volumes on a single
    flash device, specifically supporting NAND flash devices. UBI provides
    a flexible partitioning concept which still allows for wear-levelling
    across the whole flash device.

    In a sense, UBI may be compared to the Logical Volume Manager
    (LVM). Whereas LVM maps logical sector numbers to physical HDD sector
    numbers, UBI maps logical eraseblocks to physical eraseblocks.

    More information may be found at
    http://www.linux-mtd.infradead.org/doc/ubi.html

    Partitioning/Re-partitioning

    An UBI volume occupies a certain number of erase blocks. This is
    limited by a configured maximum volume size, which could also be
    viewed as the partition size. Each individual UBI volume's size can
    be changed independently of the other UBI volumes, provided that the
    sum of all volume sizes doesn't exceed a certain limit.

    UBI supports dynamic volumes and static volumes. Static volumes are
    read-only and their contents are protected by CRC check sums.

    Bad eraseblocks handling

    UBI transparently handles bad eraseblocks. When a physical
    eraseblock becomes bad, it is substituted by a good physical
    eraseblock, and the user does not even notice this.

    Scrubbing

    On a NAND flash bit flips can occur on any write operation,
    sometimes also on read. If bit flips persist on the device, at first
    they can still be corrected by ECC, but once they accumulate,
    correction will become impossible. Thus it is best to actively scrub
    the affected eraseblock, by first copying it to a free eraseblock
    and then erasing the original. The UBI layer performs this type of
    scrubbing under the covers, transparently to the UBI volume users.

    Erase Counts

    UBI maintains an erase count header per eraseblock. This frees
    higher-level layers (like file systems) from doing this and allows
    for centralized erase count management instead. The erase counts are
    used by the wear-levelling algorithm in the UBI layer. The algorithm
    itself is exchangeable.

    Booting from NAND

    For booting directly from NAND flash the hardware must at least be
    capable of fetching and executing a small portion of the NAND
    flash. Some NAND flash controllers have this kind of support. They
    usually limit the window to a few kilobytes in erase block 0. This
    "initial program loader" (IPL) must then contain sufficient logic to
    load and execute the next boot phase.

    Due to bad eraseblocks, which may be randomly scattered over the
    flash device, it is problematic to store the "secondary program
    loader" (SPL) statically. Also, due to bit-flips it may become
    corrupted over time. UBI allows to solve this problem gracefully by
    storing the SPL in a small static UBI volume.

    UBI volumes vs. static partitions

    UBI volumes are still very similar to static MTD partitions:

    * both consist of eraseblocks (logical eraseblocks in case of UBI
    volumes, and physical eraseblocks in case of static partitions;
    * both support three basic operations - read, write, erase.

    But UBI volumes have the following advantages over traditional
    static MTD partitions:

    * there are no eraseblock wear-leveling constraints in case of UBI
    volumes, so the user should not care about this;
    * there are no bit-flips and bad eraseblocks in case of UBI volumes.

    So, UBI volumes may be considered as flash devices with relaxed
    restrictions.

    Where can it be found?

    Documentation, kernel code and applications can be found in the MTD
    gits.

    What are the applications for?

    The applications help to create binary flash images for two purposes: pfi
    files (partial flash images) for in-system update of UBI volumes, and plain
    binary images, with or without OOB data in case of NAND, for a manufacturing
    step. Furthermore some tools are/and will be created that allow flash content
    analysis after a system has crashed..

    Who did UBI?

    The original ideas, where UBI is based on, were developed by Andreas
    Arnez, Frank Haverkamp and Thomas Gleixner. Josh W. Boyer and some others
    were involved too. The implementation of the kernel layer was done by Artem
    B. Bityutskiy. The user-space applications and tools were written by Oliver
    Lohmann with contributions from Frank Haverkamp, Andreas Arnez, and Artem.
    Joern Engel contributed a patch which modifies JFFS2 so that it can be run on
    a UBI volume. Thomas Gleixner did modifications to the NAND layer. Alexander
    Schmidt made some testing work as well as core functionality improvements.

    Signed-off-by: Artem B. Bityutskiy
    Signed-off-by: Frank Haverkamp

    Artem B. Bityutskiy
     

18 Apr, 2007

1 commit

03 Apr, 2007

1 commit

23 Mar, 2007

1 commit

09 Mar, 2007

1 commit

08 Mar, 2007

1 commit

  • 1f92267c5   [MTD] [NAND] make oobavail public ... Browse Code »

    During the MTD rework the oobavail parameter of mtd_info structure has become
    private. This is not quite correct in terms of integrity and logic. If we have
    means to write to OOB area, then we'd like to know upfront how many bytes out
    of OOB are spare per page to be able to adapt to specific cases.
    The patch inlined adds the public oobavail parameter.

    Signed-off-by: Vitaly Wool
    Signed-off-by: David Woodhouse

    Vitaly Wool
     

09 Feb, 2007

7 commits

07 Feb, 2007

1 commit

02 Feb, 2007

1 commit

  • abf3c0f23   [MTD] OneNAND: Reduce internal BufferRAM operations ... Browse Code »

    It use blockpage instead of a pair (block, page). It can also cover a small chunk access. 0x00, 0x20, 0x40 and so on.

    And in JFFS2 behavior, sometimes it reads two pages alternatively.
    e.g., It first reads A page, B page and A page.
    So we check another bufferram to find requested page.

    Signed-off-by: Kyungmin Park

    Kyungmin Park
     

31 Jan, 2007

1 commit

18 Jan, 2007

2 commits

10 Jan, 2007

2 commits

01 Dec, 2006

1 commit

29 Nov, 2006

7 commits

16 Nov, 2006

3 commits

31 Oct, 2006

1 commit

  • 351edd240   [PATCH] MTD: fix last kernel-doc warning ... Browse Code »

    Fix the last current kernel-doc warning:
    Warning(/var/linsrc/linux-2619-rc3g5//include/linux/mtd/nand.h:416): No description found for parameter 'write_page'

    Signed-off-by: Randy Dunlap
    Cc: David Woodhouse
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Randy Dunlap
     

22 Oct, 2006

1 commit

  • 7dcdcbef5   [MTD] NAND: Combined oob buffer so it's contiguous with data ... Browse Code »

    Ditch the separate oobrbuf and oobwbuf fields from the chip buffers,
    and use only a single buffer immediately after the data. This accommodates
    NAND controllers such as the OLPC CAFÉ chip, which can't do scatter/gather
    DMA so needs the OOB buffer to be contiguous with the data, for both read
    and write.

    Signed-off-by: David Woodhouse

    David Woodhouse
     

04 Oct, 2006

1 commit

26 Sep, 2006

2 commits