WO2014082583A1 - Method and device for generating dynamic partition information in nand flash memory - Google Patents

Abstract

Embodiments of the present invention provide a method and a device for generating dynamic partition information in a Nand flash memory. The method comprises: analyzing original partition information which comprises n partitions and the number of original blocks of each partition, n being a positive integer; according to the number of the original blocks of the n partitions and the original start address of the first partition of the n partitions, detecting the state of each block of each partition in sequence, and generating the dynamic partition information of the n partitions, the dynamic partition information comprising the dynamic start addresses and the number of the dynamic blocks of the n partitions; and storing the dynamic partition information in a specified area. The device corresponding to the method is further provided. The above technical solutions solve the problem of resource waste caused by more blocks which are reserved for the partitions to avoid the problem of random distribution of broken blocks in a storage medium, and the problem of low reliability caused by partitioning without considering the random distribution of the broken blocks in the storage medium, so that block resources are saved, and the utilization rate of the storage medium is improved.

Description

 Method and apparatus for generating dynamic partition information in Nand flash memory This application claims to be filed on November 28, 2012 with the Chinese Patent Office, application number 201210495157.7, and the invention titled "Method and apparatus for generating dynamic partition information in Nand flash memory" Priority of Chinese Patent Application, the entire contents of which is incorporated herein by reference.

Technical field

 Embodiments of the present invention relate to the field of computers, and more particularly, to a method and apparatus for generating dynamic partition information in a Nand flash memory. Background technique

 Nand flash memory is a storage medium capable of reading, writing and erasing. It has the advantages of large capacity, fast erasing speed and low price. It is widely used in set-top boxes, digital cameras, mobile phones, tablet computers and other electronic products. , used to store programs, parameters, media data, etc. In most operating systems, the abstract device access layer provides a system such as MTD (Memory Technology Device), which provides unified, abstract access to flash memory for the operating system. interface.

 Partitioning is an important step in the use of MTD equipment. The so-called partitioning is to divide multiple areas on the flash memory. The divided areas are simply referred to as partitions. Each partition has a fixed physical starting address and partition size, where the partition size is usually composed of blocks included in each partition (block). The number of ) determines the size of each block as the default. The starting address and number of blocks of a partition are also referred to herein as partition information. These partition information are important parameters for the system to start and run, to read data on the flash and mount the file system.

Despite the large capacity and low price of Nand flash memory, there is an inherent defect in Nand flash memory itself: there are bad blocks at the factory, and these bad blocks are randomly distributed. Nand flash is managed in blocks. According to the experience in the art, the ratio of bad blocks to the number of blocks of the entire Nand flash memory is less than a certain value, and the fixed value is, for example, 2%. Therefore, it is likely that multiple bad blocks will appear consecutively in the same partition. It is because of this defect that it brings certain reliability problems to the use, especially for the smaller partitions that may appear in the system. For example, a partition used to store some parameter data may occupy a total of 2 to 4 blocks. When there are multiple consecutive bad blocks, The partition will not be able to write parameters properly, nor will it be able to read the parameters when the system starts up.

 For this reason, in the prior art, a number of blocks are reserved for each partition of the Nand flash memory to solve the problem caused when a bad block is encountered. The number of blocks of partition information includes the number of reserved blocks. When the number of bad blocks in the Nand flash is small, more of the reserved blocks are not used, and the partition information cannot be changed in the prior art, resulting in waste of resources. Summary of the invention

 In view of the above, the embodiments of the present invention provide a method and an apparatus for generating dynamic partition information in a Nand flash memory, so as to solve the problem that a large number of blocks are reserved for a partition in order to avoid the random distribution of bad blocks in the storage medium. The problem of wasting resources.

 The first aspect provides a method for generating dynamic partition information in a Nand flash memory, including: parsing original partition information, where the original partition information includes a named n partitions and a number of original blocks of each partition, where n is a positive integer; According to the original block number of n partitions and the original start address of the first partition of n partitions, dynamic partition information is generated for n partitions by sequentially detecting the states of the blocks of each partition, and the dynamic partition information includes n partitions. Dynamic start address and number of dynamic blocks; store dynamic partition information to a specified area.

 In the first possible implementation, the original start address of the first partition of the n partitions is used as the dynamic start address of the first partition, and is detected from the first partition to the nth partition. The state of each block in the i-th partition, where n}; when the state of the current block is detected to be good, the number of good blocks is increased by 1; and when the state of the current block is detected to be bad, the number of bad blocks is added 1 ; and when the number of good blocks > the number of original blocks of the i-th partition, the sum of the number of good blocks and the number of bad blocks is taken as the number of dynamic blocks of the i-th partition, and the dynamic start address of the i-th partition is The number of dynamic blocks of the i-th partition determines the dynamic start address of the i+1th partition.

 In conjunction with the first possible implementation of the first aspect, in a second possible implementation, the dynamic start address of the i+1th partition = the dynamic start address of the i th partition + the i th partition The number of dynamic blocks is X block size.

 With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in a third possible implementation manner, when detecting that the current block state is good, erasing the current block and writing data; or when detecting When the current block status is bad, the current block is skipped and no data is written.

With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in a fourth possible implementation, the original partition information is generated before the original partition information is parsed. With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in the fifth possible implementation, before the original partition information is parsed, the boot is also written in the first block of the first partition of the Nand flash memory. program.

 A second aspect provides an apparatus for generating partition information in a Nand flash memory, including a parsing unit, a first generating unit, and a storage unit: a parsing unit, configured to parse the original partition information and send the information to the first generating unit, the original partition information The number of original blocks including the named n partitions and each partition, where n is a positive integer; the first generating unit, the number of original blocks of n partitions parsed according to the parsing unit and the first partition of n partitions The original starting address, by sequentially detecting the state of the blocks of each partition, generating dynamic partition information for the n partitions and transmitting to the storage unit, the dynamic partition information includes the dynamic start address and the number of dynamic blocks of the n partitions; The dynamic partition information generated by the first generation unit is stored in the designated area.

 In a first possible implementation, the first generating unit includes a detecting module, a counting module, and a determining module: a detecting module, configured to use the original starting address of the first partition of the n partitions as the dynamic of the first partition The starting address, starting from the first partition until the nth partition, sequentially detecting the state of each block in the i-th partition, where n}; when the detecting module detects that the current block state is good, the counting module will The number of good blocks is increased by 1; and when the detection module detects that the current block status is bad, the counting module adds 1 to the number of bad blocks; and when the number of good blocks > the number of original blocks of the i-th partition, the module is determined to be a good block. The sum of the number and the number of bad blocks is the number of dynamic blocks of the i-th partition, and the dynamic start address of the i+1th partition is determined by the dynamic start address of the i-th partition and the number of dynamic blocks of the i-th partition.

 In conjunction with the first possible implementation of the second aspect, in a second possible implementation, the determining module is specifically configured to determine a dynamic starting address: a dynamic starting address of the i+1th partition= Dynamic start address of the i-th partition + number of dynamic blocks of the i-th partition X block size.

 With reference to the second aspect or the foregoing possible implementation manner of the second aspect, in a third possible implementation, the device further includes: an erasing unit and a programming unit: when the detecting module detects that the current block state is good, The erasing unit is for erasing the current block and the programming unit writes data in the current block; or when the detecting module detects that the state of the current block is bad, the erasing unit is used to skip the current block and the programming unit is The current block does not write data.

With reference to the second aspect or the foregoing possible implementation manner of the second aspect, in a fourth possible implementation, the apparatus further includes: a second generating unit, configured to generate the original partition before parsing the original partition information information. With reference to the second aspect or the foregoing possible implementation manner of the second aspect, in a fifth possible implementation, the device further includes: a programming unit, configured to: before parsing the original partition information,

The boot program is written in the first block of the first partition of the Nand flash.

 The original partition information is parsed by the foregoing technical solution, and each block in each partition is tested for good or bad, the number of blocks in each partition and the starting address are re-stated, and dynamic partition information is generated, so that the partition information can be dynamically changed, thereby saving The block resource of the storage medium improves the utilization rate of the storage medium. DRAWINGS

 In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings to be used in the embodiments of the present invention will be briefly described below. It is obvious that the drawings described below are only some embodiments of the present invention, Those skilled in the art can also obtain other drawings based on these drawings without paying any creative work.

 FIG. 1 is a schematic diagram of a method for generating partition information in a Nand flash memory in the prior art. 2 is a schematic diagram of another method for generating partition information in a Nand flash memory in the prior art. FIG. 3 is a schematic diagram of another method of generating partition information in a Nand flash memory in the prior art. 4 is a schematic flow chart of a method for generating dynamic partition information in a Nand flash memory according to an embodiment of the present invention.

 FIG. 5 is a schematic flow chart of a method for generating dynamic partition information in a Nand flash memory according to an embodiment of the present invention.

 FIG. 6 is a schematic schematic diagram of a method for generating partition information according to an embodiment of the present invention.

 Figure 7 is a schematic block diagram of an apparatus for generating dynamic partition information in a Nand flash memory in accordance with an embodiment of the present invention.

 Figure 8 is a schematic block diagram of another apparatus for generating dynamic partition information in a Nand flash memory in accordance with an embodiment of the present invention.

 Figure 9 is a schematic block diagram of another apparatus for generating dynamic partition information in a Nand flash memory in accordance with an embodiment of the present invention. detailed description

The technical solutions in the embodiments of the present invention will be clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are a part of the embodiments of the present invention, and It is all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts shall fall within the scope of the present invention.

 FIG. 1 is a schematic diagram of a method for generating partition information in a Nand flash memory in the prior art. FIG. 1 illustrates four partitions, a first partition 11, a second partition 12, a third partition 13, and a fourth partition 14, respectively, for storing a boot program, a system kernel (Linux Kernel) program, and a root file system. ( Root file System ) and parameter data ( Parameters Data ). For convenience of explanation, each partition is named by a serial number, but the partition can be named by other methods. For example, the first partition 11 can also be named as a boot partition, and the fourth partition 14 can also be named as a parameter partition. A piece of Nand flash memory consists of several blocks. The block size is the factory default. The number of blocks included in one partition is simply referred to as the number of blocks. Here, assume that one block size is 128K bytes. The starting address and size of each partition are as shown in FIG. 1, which are: the starting address of the first partition 11 is 0x0, the size is 512K bytes, the number of blocks is 2; the starting address of the second partition 121 is 0x80000, The size is 4M bytes, the number of blocks is 31250; the starting address of the third partition 13 is 0x480000, the size is 40M bytes, the number of blocks is 312500; the starting address of the fourth partition 14 is 0x2C80000, and the size is 512K bytes. The number of blocks is 2. The starting address of the first partition is known, optionally starting from 0x0; of course, it is also possible to start from the specified address. Thus, the number of blocks in a partition X block size plus the starting address The number of bytes is the starting address of the next partition. The partition information in this article includes at least the name of the partition and the number of blocks.

 Normally, after the system power-on reset, the boot program of the first partition 11 is started, and then the boot program reads the system core program from the second partition 12 and runs, and then the system core program will calculate the partition information. The third partition 13 mounts the boot file system, starts the related application, and finally mounts the fourth partition 14 to read the relevant parameter data. Thus, partition information is critical to the startup and operation of the system.

 A prior art, referring to FIG. 2, does not consider the characteristics of the random distribution of bad blocks of the Nand flash memory, only according to the number of blocks actually used by the partition, and considering that the partition may be reserved to prevent bad blocks from being used during use. The number of blocks, while partitioning.

2 is a schematic diagram of another method for generating partition information in a Nand flash memory in the prior art. The first partition 21, the second partition 22, and the third partition 23 are shown in FIG. 2, and the second partition 22 is taken as an example for description. The second partition 22, also called parameter partition, is used to store parameter data (Parameter Data) „ Normally, the data volume of the parameter partition is relatively small, assuming only 2 blocks (2 χ 128Κ bytes = 256K words) Section). Considering the use process, it may be due to long time rubbing Write generates bad blocks. Therefore, when planning parameter partitioning, reserve two more, so the parameter partition is a total of 4 blocks.

 Since the method of the partition does not take into account the random distribution characteristics of the bad blocks of the Nand flash memory, the defects are very obvious. Taking the second partition 22 as an example, if the 4 blocks of the partition are just bad blocks, it means that the partition cannot write data, and when the system starts, the data cannot be read and written correctly, resulting in a system exception. In the prior art, the partition information cannot be changed, which means that the Nand flash memory will be unusable and can only be used as a defective product. But in fact, this Nand flash memory is in compliance with the requirements, except that the bad blocks at the factory are just concentrated in the partition. Therefore, according to the prior art partition of Fig. 2, material waste is actually caused.

 Another prior art, referring to Figure 3, takes full account of the random distribution of bad blocks of Nand flash memory during partitioning. That is, when planning the partition, in addition to considering the normal data storage area, it is also necessary to reserve a certain number of blocks for each partition because of the random distribution characteristics of the bad blocks; according to the general practice in the art, the most reliable is Each partition reserves 2% of the total number of Nand flash memory. For Nand flash memory with a capacity of 512 Mbytes, at least 80 blocks need to be reserved for each partition.

 FIG. 3 is a schematic diagram of another method of generating partition information in a Nand flash memory in the prior art. The three partitions, the first partition 31 to the sixth partition 36, are schematically illustrated in Fig. 3, wherein the reserved areas included in each partition are 31A to 36A, respectively.

 If there are more partitions, for example, there are more partitions for storing parameter data, according to the technical scheme of FIG. 3, at least 80 blocks must be reserved for each partition, each block size is 128 Kbytes, assuming 3 The example has 6 partitions, then the reserved area in the system has 6 X 80 X 128K = 60M bytes. This means that in order to avoid the risk of the random distribution of bad blocks of Nand flash memory, more blocks will be used as reserved areas in the system. However, in practical applications, in most cases, there are not many bad blocks, and they are not all distributed in the parameter partition. From a practical point of view, the parameter partition itself is small, and only a small number of blocks need to be reserved. The partitioning method shown in Figure 3 causes a larger number of blocks to be wasted.

 In order to avoid the waste of various resources in the foregoing prior art, embodiments of the present invention provide a method and apparatus for generating dynamic partition information in a Nand flash memory, which can dynamically adjust partitions and generate new partition information.

 4 is a schematic flow diagram of a method 40 of generating dynamic partition information in a Nand flash memory according to an embodiment of the present invention, including the following.

S41, parsing the original partition information, the original partition information includes the named n partitions and each of the The number of original blocks of the partition, where n is a positive integer.

 When programming data in the Nand flash memory, it will refer to a raw partition information. The raw partition information may be obtained from other devices or may be generated by the device performing the method 40. From the original partition information, it can be known that the Nand flash is divided into n partitions, the names of n partitions, and the number of original blocks included in each partition. The original starting address of the first of the n partitions is known, so the original size and original starting address of each partition can be determined by the number of original blocks included in each partition. It is necessary to extract information in the original partition information, such as the order of the partitions, the number of original blocks included in each partition, and the like.

 542. Generate dynamic partition information for n partitions by sequentially detecting the status of the blocks of each partition according to the original block number of the n partitions and the original start address of the first partition of the n partitions, where the dynamic partition information includes n The dynamic start address and dynamic block number of the partition.

 In the embodiment of the present invention, the bad block of the Nand flash memory is considered to be detectable. By constructing a partition, it is possible to check the blocks in each partition according to the original size of each partition at the time of partitioning, and actively skip the bad blocks, so that the number of good blocks in the partition can satisfy the original size of each partition. Thereby dynamically adjusting the partition and generating new partition information, that is, dynamic partition information.

 543. Store the dynamic partition information in a specified area.

 After the dynamic partition information is generated, the dynamic partition information needs to be stored and can be stored in the specified area. After the system is started, the dynamic partition information will be read and data operations will be performed, including reading or running the core program, mounting the file system, and reading parameters. After the system core program is started, the file system is mounted according to the partition. Therefore, the preservation of the partition information is crucial.

 Optionally, if it can be determined that no changes are made to the above dynamic partition information, an OTP (once time program) protection may be performed.

 The embodiment of the invention solves the problem of resource waste caused by the random distribution of bad blocks in the storage medium, and reserves more blocks for the partition to avoid the problem, and also includes the reliability caused by partitioning without considering the feature. The problem is that by parsing the original partition information, performing good and bad detection for each block in each partition, re-counting the number of blocks in each partition and the starting address, and generating dynamic partition information, thereby dynamically changing the partition information, thereby saving The block resource of the storage medium improves the utilization of the storage medium.

Optionally, the method of the embodiment of the present invention may be applied in the process of producing a Nand flash memory. When manufacturing and processing at the factory, it is usually necessary to burn the Nand flash memory. In an embodiment, by using the method of the embodiment of the present invention, the original partition information is first planned, and then the original partition information is transmitted to the burning machine. After the burning machine analyzes the original partition information, the blocks of each partition are dynamically calculated. Quantity, create new partitions in turn and erase and burn data, and store the generated new partition information as dynamic partition information in a pre-planned place, for example, can be stored in the first block of Nand flash memory In the specified area, or in the attribute area of the Nand flash memory. The attribute area of the Nand flash memory is a special storage area independent of the main storage area, and is used for storing the configuration information of the Nand flash memory. The user's use of the Nand flash memory for data erasing does not affect the content in the attribute area. Optionally, as an implementation manner, the dynamic partition information may also be stored in a Nor flash memory used in combination with the Nand flash memory. Nor flash can also be read, write, and erase. It is characterized by a read speed block and good reliability, but its capacity is small, the erasing speed is slow, and it is expensive. Nor flash does not have the inherently bad distribution of bad blocks in Nand flash, so the two flashes can be combined to provide users with more reliable storage. In this implementation method, the Nor flash memory can be used to store the boot program or dynamic partition information of the Nand flash memory, thereby avoiding ensuring that the first block of the Nand flash memory is a good block at the time of shipment in the art. Therefore, the bootstrap is usually also stored in the specified area of the first block.

 Optionally, in another embodiment of the present invention, if the data of the Nand flash memory is used, the following method is used: first, the boot program is programmed, and then the boot program uniformly writes the data to the Nand flash memory. Then, the application process in the boot program can also use the method of the embodiment of the present invention. First, the boot program obtains the original partition information, including but not limited to: implementing the original partition information into the boot program, or reading the original partition information through the serial port or the network, the boot program parsing the original partition information, and then reading the burned data, Dynamically calculate the number of blocks in each partition, erase and burn data to the Nand flash memory, and finally store the newly generated partition information as dynamic partition information in a pre-planned place, for example, the first to be stored in the Nand flash memory. In the specified area of the block, it can also be stored in the attribute area of the Nand flash memory, or it can also be stored in the Nor flash memory used in conjunction with the Nand flash memory.

 FIG. 5 is a schematic flow diagram of a method 50 of generating dynamic partition information in a Nand flash memory according to an embodiment of the present invention, including the following.

 S51, generating raw partition information.

The original partition information defines the n partitions that need to be generated sequentially in the Nand flash, the name of each partition, and the number of blocks included in each partition. Where the i-th partition is one of n partitions , n is a positive integer, i G {1 , n}.

 The size of each partition can be determined by the number of blocks included in each partition and the default value of the block size.

 Optionally, as an implementation manner, the original partition information may be generated by a device that implements the method of the embodiment of the present invention.

 The raw partition information includes multiple partitions, which can be presented in the form of a partition table. The information in the partition table includes: The name of each partition, which can be arbitrarily named, and the number of original blocks included in each partition. As an implementation method, the table item information of the original partition table can be abstracted as follows: typedef struct {

 Char PartName[50]; /*Name of the partition */

 Unsigned int ulLogBlockNum; / * The number of blocks in the partition, including the number of blocks actually used, and the number of blocks reserved for preventing bad blocks during the erasure process */

 }LogPartInfor„

552. Obtain original partition information.

 S52 is an alternative to S51. Optionally, the original partition information may be generated by other devices, and the original partition information is implemented in the boot program by using the device in the embodiment of the present invention, or the original partition information is read from other devices through a serial port or a network.

 553, parsing the original partition information of each partition.

 The original starting address and the number of original blocks for each partition are first determined in order from the first partition.

 For example, first specify the original starting address of the first partition as 0x0, assuming that 1 block size is 128K bytes and the number of original blocks is 2. Starting from the first partition, block-by-block detection, according to the state of the block, the new one is the number of dynamic blocks, and the new dynamic start address. The original starting address of the first partition is the same as the dynamic starting address. Next, the block status in each partition is detected in turn until the last partition is detected.

 554, detecting the status of the block, whether it is a good block.

 If it is a good block, that is, "Yes" of S54, execute S55.

 555, erase and burn data, add 1 to the number of good blocks.

 If it is a bad block, that is, "No" of S54, execute S56.

S56, skip the bad block and increase the number of bad blocks by one. The bad block is skipped and no processing such as erasing or programming is performed.

 557, determine whether the number of blocks is greater than or equal to the number of original blocks.

 In this partition, if the number of good blocks > the number of original blocks, that is, "Yes" of S57, S58 is executed.

558, storing the generated dynamic partition information.

 The sum of the number of good blocks and the number of bad blocks is taken as the number of dynamic blocks of the partition, and the dynamic start address and the number of dynamic blocks of the partition are used as dynamic partition information of the partition. The dynamic start address of the next partition is determined by the dynamic start address of the partition and the number of dynamic blocks of the partition.

 The dynamic partition information of all partitions is uniformly stored in a planned place, for example, may be stored in a specified area of the first block of the Nand flash memory, or may be stored in the attribute area of the Nand flash memory, or may be stored in Nand flash memory combined with Nor flash.

 The original starting address of the first partition is the same as the dynamic starting address. According to the detection of the block status, the original block number and the dynamic block number of each partition may be the same or different; the original start address and the dynamic start address of the partition after the first partition may be the same or may be different. The dynamic start address of the i+1th partition=the dynamic start address of the i th partition + the dynamic block number of the i th partition X block size.

 The entry information of the dynamic partition information can be abstracted as follows:

 Typedef struct {

 Char PartName [50]; /* The name of the partition */

 Unsigned int ulPhyPartAddr; /* starting address of the physical partition */

 Unsigned int ulPhyBlockNum; / * The number of blocks in the physical partition, including the number of good and bad blocks * /

 } PhyPartInfor „ Figure 6 is a schematic schematic diagram of a method of generating partition information according to an embodiment of the present invention.

 For example, referring to FIG. 6, the number of original blocks of the second partition 61 in the original partition information is 4, that is, 4 good blocks are required. If, by block state detection, it is determined that 3 bad blocks are detected before ensuring that at least 4 good blocks are included in the second partition 61, the number of dynamic blocks of the re-determined second partition is the sum of the number of good blocks and the number of bad blocks. , equal to 7. After the number of dynamic blocks of the second partition is re-determined, the dynamic start address of the third partition starts from the end of the second partition, that is, the dynamic start address of the third partition = the dynamic start address of the second partition + the second The number of dynamic blocks of the partition X block size.

In the partition, if the number of good blocks < the number of original blocks, that is, "NO" of S57, S59 is executed. S59, detecting the state of the next block.

 In the embodiment of the present invention, by acquiring and parsing the original partition information, performing good and bad detection for each block in each partition, re-counting the number of blocks in each partition and the starting address, and generating dynamic partition information, so that the partition can be dynamically changed. The information saves the block resources of the storage medium and improves the utilization rate of the storage medium.

 Since the embodiment of the present invention dynamically generates partition information, the system reads the partition information, performs data reading, partition mounting, and the like. Therefore, this method can be used whenever there is a need to regenerate the partition, so it is also applicable to the following cases.

 In an embodiment of the present invention, if the block of the Nand flash memory becomes a bad block after being erased multiple times and exceeds the lifetime in the subsequent use process, the number of good blocks on the partition may not be sufficient. Use this partition, making the entire system unusable. However, based on the large capacity of Nand flash memory, there is still enough space to use, so it only needs to be re-adjusted to work properly. Therefore, the traditional static partition can be changed by using the embodiment of the present invention, which avoids the problem that the partition cannot be used when the number of bad blocks of the partition is large, or the number of reserved blocks is too large, resulting in waste of the partition.

 In another embodiment of the present invention, if the generated partition information is unfortunately damaged and needs to be upgraded by the boot program, repartitioning is required. Therefore, the traditional static partition can be changed by using the embodiment of the present invention, which avoids the problem that the Nand flash memory cannot be used normally when the partition information is lost, or the number of reserved blocks is too large, resulting in waste of the partition.

 In both cases, the method of the embodiment of the present invention, such as method 40 or 50, can be used to generate dynamic partition information.

 Figure 7 is a schematic block diagram of an apparatus 70 for generating dynamic partition information in a Nand flash memory in accordance with an embodiment of the present invention. The apparatus 70 includes: a parsing unit 71, a first generating unit 72, and a storage unit 73.

 The parsing unit 71 parses the original partition information and sends it to the first generating unit, the original partition information including the named n partitions and the number of original blocks of each of the partitions, where n is a positive integer.

 The first generation unit 72 sequentially detects the state of the block of each partition according to the original block number of the n partitions parsed by the parsing unit and the original start address of the first partition of the n partitions. The n partitions generate dynamic partition information and send to the storage unit, where the dynamic partition information includes a dynamic start address and a dynamic block number of the n partitions.

The storage unit 73 stores the dynamic partition information generated by the first generation unit to a specified Area. The storage unit 73 uniformly stores the dynamic partition information of all the partitions in a planned place, for example, may be stored in a designated area of the first block of the Nand flash memory, or may be stored in the attribute area of the Nand flash memory, or may be Stored in Nor flash memory for use with Nand flash.

 The device of the embodiment of the present invention solves the problem of resource waste caused by the fact that the storage medium has a random distribution of bad blocks, and reserves more blocks for the partition to avoid the problem, and also includes the partitioning caused by not considering the feature. Reliability problem, by parsing the original partition information, performing good and bad detection for each block in each partition, re-counting the number of blocks in each partition and the starting address, and generating dynamic partition information, so that the partition information can be dynamically changed. The block resources of the storage medium are saved, and the utilization rate of the storage medium is improved.

 Figure 8 is a schematic block diagram of another apparatus 80 for generating dynamic partition information in a Nand flash memory in accordance with an embodiment of the present invention. The apparatus 80 includes: a parsing unit 81, a first generating unit 82, a storage unit 83, an erasing unit 84, a programming unit 85, and a second generating unit 86 or an obtaining unit 87. The parsing unit 81, the first generating unit 82, and the storage unit 83 of the device 80 are the same as or similar to the parsing unit 71 of the device 70, the first generating unit 72, and the storage unit 73. The difference is that the first generating unit 82 of the device 80 may include a detecting module 821, a counting module 822, and a determining module 823. The device 80 may further include an erasing unit 84 and a programming unit 85, and a second generating unit 86 or an obtaining unit 87. .

 The parsing unit 81 parses the original partition information and sends it to the first generating unit, the original partition information including the named n partitions and the number of original blocks of each of the partitions, where n is a positive integer.

 The first generation unit 82 sequentially detects the state of the block of each partition according to the number of original blocks of the n partitions parsed by the parsing unit and the original start address of the first partition of the n partitions. The n partitions generate dynamic partition information and send to the storage unit, where the dynamic partition information includes a dynamic start address and a dynamic block number of the n partitions.

 The storage unit 83 stores the dynamic partition information generated by the first generation unit to a designated area. The storage unit 83 uniformly stores the dynamic partition information of all the partitions in a planned place, for example, may be stored in a specified area of the first block of the Nand flash memory, or may be stored in the attribute area of the Nand flash memory, or may be Stored in Nor flash memory for use with Nand flash.

Optionally, as a different embodiment, the detecting module 821 divides the first part of the n partitions The original starting address of the area is used as the dynamic starting address of the first partition, and the state of each block in the i-th partition is detected in turn from the first partition until the nth partition, where n}; The detecting module 821 detects that the state of the current block is good, the counting module 822 adds 1 to the good block number; and when the detecting module 821 detects that the current block state is bad, the counting module 822 will block the bad block. The number is increased by 1; and when the number of good blocks > the number of original blocks of the i-th partition, the determining module 823 uses the sum of the number of good blocks and the number of bad blocks as the number of dynamic blocks of the i-th partition, and A dynamic start address of the i+1th partition is determined by a dynamic start address of the i th partition and a dynamic block number of the i th partition. The dynamic start address of the partition = the dynamic start address of the i-th partition + the number of dynamic blocks of the i-th partition X block size.

 Optionally, as a different embodiment, when the detecting module 821 detects that the state of the current block is good, the erasing unit 84 is configured to erase the current block and the programming unit 85 is in the Writing data in the current block; or when the detecting module 821 detects that the state of the current block is bad, the erasing unit 84 skips the current block and the programming unit 85 is in the current block Do not write data.

 Alternatively, as a different embodiment, the device 80 may further include a second generating unit 86. The second generation unit 86 generates raw partition information. Alternatively, the device 80 may further include an obtaining unit 87, and the obtaining unit 87 may acquire the generated original partition information from other devices.

 After the device 80 can generate or acquire the original partition information, the dynamic partition information and the burn data are generated by parsing the original partition information. Alternatively, as a different embodiment, the programming unit 85 may write a boot program in the first block of the first partition of the Nand flash memory before parsing the original partition information. Thus, the device 80 first programs the boot program, and then the boot program unifies the programming data into the Nand flash memory. The application process in the boot program can use the method 40 or 50 of the embodiment of the present invention.

The device of the embodiment of the present invention solves the problem of resource waste caused by the fact that the storage medium has a random distribution of bad blocks, and reserves more blocks for the partition to avoid the problem, and also includes the partitioning caused by not considering the feature. Reliability problem, by obtaining and parsing the original partition information, performing good and bad detection for each block in each partition, re-counting the number of blocks in each partition and the starting address, generating dynamic partition information, so that the partition can be dynamically changed. The information saves the block resources of the storage medium and improves the utilization rate of the storage medium. In addition, the device in the embodiment of the present invention changes the traditional static partition, which avoids the partition being unusable when the partition has many bad blocks, and also prevents the Nand flash memory from being used normally when the partition information is lost.

 Figure 9 is a schematic block diagram of another apparatus 90 for generating dynamic partition information in a Nand flash memory in accordance with an embodiment of the present invention. The device 90 includes a processor 91 and a memory 92.

 The memory 92 may be a RAM and a ROM, or any fixed storage medium, or a removable storage medium for storing data that can be executed in the program of the embodiment of the present invention or in the embodiment of the present invention.

 The memory 92 can also be used to store raw partition information including the named n partitions and the original number of blocks for each of the partitions, where n is a positive integer and the generated dynamic partition information.

 The processor 91 is operative to execute the program of the embodiment of the present invention stored by the memory 92. The processor 91 can be a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic steps and logic block diagrams. The general purpose processor may be a microprocessor or the processor or any conventional processor or the like. The steps of the method disclosed in the embodiments of the present invention may be directly implemented by the hardware decoding processor, or may be performed by a combination of hardware and software modules in the decoding processor. The software modules can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like. The storage medium is located in the memory 92, and the processor 91 reads the information in the memory 92 and combines the hardware to perform the steps of the above method.

The processor 91 parses the original partition information, where the original partition information includes the named n partitions and the number of original blocks of each of the partitions, where n is a positive integer; according to the parsed number of original blocks of the n partitions And the original starting address of the first partition of the n partitions, by sequentially detecting the state of the blocks of each partition, generating dynamic partition information for the n partitions, where the dynamic partition information includes the n partitions Dynamic start address and dynamic block number; store the generated dynamic partition information to a specified area. The processor 91 uniformly stores the dynamic partition information of all the partitions in a planned place, for example, may be stored in a designated area of the first block of the Nand flash memory, or may be stored in the attribute area of the Nand flash memory, or It can also be stored to Nor flash in conjunction with Nand flash. Optionally, as a different embodiment, the processor 91 uses the original start address of the first partition of the n partitions as the dynamic start address of the first partition, starting from the first partition to the nth Up to the partition, the state of each block in the i-th partition is detected in turn, where n}; when the state of the current block is detected to be good, the number of good blocks is increased by 1; and when the state of the current block is detected as bad, Adding the number of bad blocks to 1; and when the number of good blocks > the number of original blocks of the i-th partition, the sum of the number of good blocks and the number of bad blocks is taken as the number of dynamic blocks of the i-th partition, and The dynamic start address of the i-th partition and the dynamic block number of the i-th partition determine a dynamic start address of the i+1th partition.

 Optionally, as a different embodiment, the processor 91 determines the dynamic start address according to the following formula: a dynamic start address of the i+1th partition=the dynamic start address of the i-th partition+the i-th partition The number of dynamic blocks is X block size.

 Optionally, as a different embodiment, the processor 91 erases the current block and writes data when detecting that the current block status is good; or jumps when detecting that the current block status is bad. The current block is passed and no data is written.

 Optionally, as a different embodiment, the processor 91 generates the original partition information.

 Optionally, as a different embodiment, the processor 91 writes a boot program in the first block of the first partition of the Nand flash memory before the parsing the original partition information.

 The embodiment of the invention solves the problem of resource waste caused by the random distribution of bad blocks in the storage medium, and reserves more blocks for the partition to avoid the problem, and also includes the reliability caused by partitioning without considering the feature. The problem is that by parsing the original partition information, performing good and bad detection for each block in each partition, re-counting the number of blocks in each partition and the starting address, and generating dynamic partition information, thereby dynamically changing the partition information, thereby saving The block resource of the storage medium improves the utilization of the storage medium.

 Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the various examples described in connection with the embodiments disclosed herein can be implemented in a combination of electronic hardware or computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods for implementing the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present invention.

A person skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working process of the system, the device and the unit described above may refer to the corresponding processes in the foregoing method embodiments, and details are not described herein again. In the several embodiments provided herein, it should be understood that the disclosed systems, devices, and methods may be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the unit is only a logical function division. In actual implementation, there may be another division manner, for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form. The components displayed for the unit may or may not be physical units, ie may be located in one place, or may be distributed over multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.

 In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

 The functions, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention, which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including The instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and the like, which can store program codes. .

 The above is only the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope of the present invention. It should be covered by the scope of the present invention. Therefore, the scope of the invention should be determined by the scope of the claims.

Claims

Rights request A method for generating partition information in a Nand flash memory, comprising: parsing original partition information, wherein the original partition information includes n partitions and a number of original blocks of each of the partitions, wherein n is positive Integer  And generating dynamic partition information for the n partitions by sequentially detecting states of blocks of each partition according to the original block number of the n partitions and the original start address of the first partition of the n partitions, The dynamic partition information includes a dynamic start address and a dynamic block number of the n partitions; and the dynamic partition information is stored in the designated area.  2. The method according to claim 1, wherein the blocks of each partition are sequentially detected according to the original block number of the n partitions and the original start address of the first partition of the n partitions a state, the dynamic partition information is generated for the n partitions, where the dynamic partition information includes a dynamic start address and a dynamic block number of the n partitions, including:  The original start address of the first partition of the n partitions is used as the dynamic start address of the first partition, and the blocks in the i-th partition are sequentially detected from the first partition to the nth partition. State, where ie {1 , n} ;  When it is detected that the state of the current block is good, the number of good blocks is increased by 1; and when it is detected that the state of the current block is bad, the number of bad blocks is increased by 1;  When the number of good blocks > the number of original blocks of the i-th partition, the sum of the number of good blocks and the number of bad blocks is taken as the number of dynamic blocks of the i-th partition, and the dynamic of the i-th partition is The start address and the number of dynamic blocks of the i-th partition determine the dynamic start address of the i+1th partition.  The method according to claim 2, wherein the dynamic start address of the i-th partition and the dynamic block number of the i-th partition determine the dynamic of the i+1th partition Start address, including:  The dynamic start address of the i+1th partition = the dynamic start address of the i th partition + the number of dynamic blocks of the i th partition X block size.  The method according to any one of claims 1 to 3, wherein the method further comprises:  When it is detected that the state of the current block is good, the current block is erased and data is written; or when it is detected that the state of the current block is bad, the current block is skipped and data is not written. The method according to any one of claims 1 to 4, characterized in that in the parsing Before the original partition information, the method further includes:  The raw partition information is generated.  The method according to any one of claims 1 to 4, wherein before the parsing the original partition information, the method further comprises:  The boot program is written in the first block of the first partition of the Nand flash.  7. An apparatus for generating partition information in a Nand flash memory, comprising: a parsing unit, a first generating unit, and a storage unit:  The parsing unit is configured to parse the original partition information and send the information to the first generating unit, where the original partition information includes n partitions and the original block number of each of the partitions, where n is a positive integer;  The first generating unit is configured to sequentially detect blocks of each partition according to the original block number of the n partitions parsed by the parsing unit and the original start address of the first partition of the n partitions a state, generating dynamic partition information for the n partitions and sending the information to the storage unit, where the dynamic partition information includes a dynamic start address and a dynamic block number of the n partitions;  The storage unit is configured to store the dynamic partition information generated by the first generating unit to a designated area.  The device according to claim 7, wherein the first generating unit comprises a detecting module, a counting module and a determining module:  The detecting module is configured to use the original starting address of the first partition of the n partitions as the dynamic starting address of the first partition, starting from the first partition to the nth partition, and detecting the first The state of each block in i partitions, where n};  When the detecting module detects that the state of the current block is good, the counting module adds 1 to the number of good blocks; and when the detecting module detects that the state of the current block is bad, the counting module will count the number of bad blocks. Add 1; and  When the number of original blocks of the i-th partition is the number of blocks, the determining module uses the sum of the number of good blocks and the number of bad blocks as the number of dynamic blocks of the i-th partition, and passes the ith The dynamic start address of the partition and the number of dynamic blocks of the i-th partition determine the dynamic start address of the i+1th partition.  9. The apparatus according to claim 8, wherein the determining module is specifically configured to determine a dynamic starting address by: Dynamic start address of the i+1th partition = dynamic start address of the i th partition + ith The number of dynamic blocks of the partition X block size.  The device according to any one of claims 7 to 9, wherein the device further comprises an erasing unit and a programming unit:  When the detecting module detects that the state of the current block is good, the erasing unit is configured to erase the current block and the programming unit writes data in the current block; or  When the detecting module detects that the state of the current block is bad, the erasing unit is configured to skip the current block and the programming unit does not write data in the current block.  The device according to any one of claims 7 to 10, wherein the device further comprises a second generating unit:  The second generating unit is configured to generate the original partition information before the parsing the original partition information.  12. Apparatus according to any one of claims 7 to 9, wherein the apparatus further comprises a programming unit:  The programming unit is configured to write a boot program in a first block of the first partition of the Nand flash memory before parsing the original partition information.