TWI894007B - Storage management method and storage management device - Google Patents

Abstract

A storage management method accesses a storage device via a file system. The storage device includes a plurality of blocks, and the file system includes a plurality of logical blocks mapped to the plurality of blocks. Each of the plurality of logical blocks has a logical block number. The storage management method includes: receiving a first storage request to store a first data of a first type; in response to the first storage request, dividing a first logical block of the plurality of logical blocks into a plurality of sub-logical blocks; assigning a first sub-logical block of the plurality of sub-logical blocks to the first data; generating a first logical identification code mapped to the first sub-logical block, to record in the first logical identification code a status flag of the first type corresponding to a first value, a sub-logical block number of the first sub-logical block, and a logical block number of the first logical block.

Description

Storage management method and storage management device

This case relates to a storage management method and a storage management device, and more particularly to a storage management method and a storage management device that divide a logical block into sub-logical blocks for efficient storage.

Embedded electronic products use SPI NAND flash memory as external mass storage. This memory consists of multiple erasable blocks to store system images and file system data. File systems store data in blocks. Under the aforementioned allocation method, even small files will occupy the entire block, resulting in low space utilization.

In view of the shortcomings of the prior art, one of the purposes of this case is to provide a storage management method and a storage management device to improve the shortcomings of the prior art.

In some embodiments, a storage management method accesses a storage device through a file system, the storage device including a plurality of blocks, the file system including a plurality of logical blocks mapped to the plurality of blocks, each of the plurality of logical blocks having a logical block number; the storage management method includes: receiving a first storage request to store a first data of a first type; in response to the first storage request, dividing a first logical block of the plurality of logical blocks into a plurality of sub-logical blocks; allocating a first sub-logical block of the plurality of sub-logical blocks to the first data; generating a first logical block mapped to the first sub-logical block; The logic identification code records a state flag of a first value corresponding to the first type, a sub-logic block number of the first sub-logic block, and a logic block number of the first logic block in the first logic identification code; receives a second storage request to store a second data of a second type; responds to the second storage request A second logic block among the plurality of logic blocks is allocated to the second data; and a second logic identification code mapped to the second logic block is generated to record a status flag with a second value corresponding to the second type, a default sub-logic block number, and the logic block number of the second logic block in the second logic identification code.

In some embodiments, a storage management device accesses a storage device through a file system, the storage device includes a plurality of blocks, the file system includes a plurality of logical blocks mapped to the plurality of blocks, each of the plurality of logical blocks has a logical block number; the storage management device includes a processor, the processor according to At least one instruction in the memory is configured to execute the following steps: receiving a first storage request to store a first data of a first type; dividing a first logic block of the plurality of logic blocks into a plurality of sub-logic blocks in response to the first storage request; allocating a first sub-logic block of the plurality of sub-logic blocks to the first data; generating a mapping In a first logic identification code of the first sub-logic block, a state flag of a first value corresponding to the first type, a sub-logic block number of the first sub-logic block, and a logic block number of the first logic block are recorded in the first logic identification code; a second storage request is received to store a second data of a second type; and a second storage request is received in response to the second storage request. The storage request allocates a second logic block among the plurality of logic blocks to the second data; and generates a second logic identification code mapped to the second logic block to record a state flag with a second value corresponding to the second type, a default sub-logic block number, and the logic block number of the second logic block in the second logic identification code.

The storage management method and storage management device of this case further divide a logical block into multiple sub-logical blocks. Multiple sub-logical blocks within a logical block are then used to store smaller data sets. Therefore, if there are free sub-logical blocks within the same logical block, the free sub-logical blocks will be allocated to the remaining data for use. Therefore, the storage management method and storage management device of this case can efficiently allocate storage space, thereby avoiding storage space waste.

The features, implementation, and effects of this invention are described in detail below with reference to the drawings and preferred embodiments.

FIG1 is a schematic diagram illustrating a storage management device 100, a storage device 400, and a memory 500 according to some embodiments of the present invention. The storage management device 100 is connected to the storage device 400 and the memory 500 and includes a processor 115. The storage device 400 may be a NAND flash memory, and the memory 500 may be a dynamic random access memory (DRAM). The memory 500 stores a plurality of program instructions and/or program codes, and the storage management device 100 implements its functions by executing these program instructions and/or program codes. In some embodiments, the storage management device 100 may be a control chip.

The following describes the operation of the storage management device 100 in detail with reference to FIG2 . FIG2 is a flowchart illustrating a storage management method 200 according to some embodiments of the present invention. The storage management method 200 accesses a storage device 400 via a file system. The storage device 400 includes a plurality of blocks, each of which includes a plurality of pages. A page is the basic unit of operation for reading from or writing to the storage device 400, while a block is the basic unit of operation for erasing the storage device 400. Referring to Figure 3, the file system includes a plurality of logical blocks i and i+1 mapped to a plurality of blocks. Each of the plurality of logical blocks i and i+1 has a logical block number (BN).

In step 210, a storage request is received to store first data of a first type, a first logic block among a plurality of logic blocks is divided into a plurality of sub-logic blocks, and a plurality of sub-logic block numbers (SN) are recorded to identify the sub-logic blocks. 3 , the processor 115 may divide an idle logic block i among a plurality of logic blocks i, i+1 into a plurality of sub-logic blocks 0 to N-1 according to a preset sub-block size, where each sub-logic block corresponds to a preset number of storage units (e.g., one). When a logic block is divided into multiple sub-logic blocks, the processor 115 also records multiple usage flags to indicate the usage status of each sub-logic block. For example, a first usage flag may indicate that the sub-logic block is currently idle, while a second usage flag may indicate that the sub-logic block is currently occupied. It is understood that each logic block also records a corresponding usage flag. In this way, the usage flag of the logic block or sub-logic block is updated according to the current usage of the logic block or sub-logic block; the current usage of the logic block or sub-logic block can be obtained by querying the usage flag.

In step 220, a first sub-logical block among the plurality of sub-logical blocks is allocated to the first data. Referring to FIG. 4 , processor 115 allocates sub-logical block 0 and sub-logical block 1 of logical block i to the first data A based on the size of the data A (described in detail later in conjunction with FIG. 6 ). In this manner, the first data A is stored in the storage units corresponding to sub-logical block 0 and sub-logical block 1. In some embodiments, the first data A may be a file, such as a file in the littlefs file system. Furthermore, when the first sub-logic block is allocated to the first data, the processor 115 updates the usage flag of the first sub-logic block according to the allocation, for example, updating the first usage flag to the second usage flag.

In step 230, a first logic identification code is generated, mapped to the first sub-logic block, to record a status flag of the first type corresponding to the first value, a sub-logic block number of the first sub-logic block, and the logic block number of the first logic block in the first logic identification code. In this embodiment, the logic identification code occupies a preset number of bits, wherein the first bit is used to record the status flag corresponding to the logic block or sub-logic block, the second bit is used to record the sub-logic block number, and the third bit is used to record the logic block number. The sum of the first bit, the second bit, and the third bit is equal to the preset number of bits. Referring to FIG. 5 , in one embodiment, as shown in the upper left corner of the figure, the default bit count is 32 bits, meaning a logic identification code is recorded using 32 bits. The Rx segment of the logic identification code is used to record the status flag of the logic block/sub-logic block, the Ry segment of the logic identification code is used to record the sub-logic block number, and the Rz segment of the logic identification code is used to record the logic block number. This solution uses the aforementioned logical identification code to record in detail the status of logical blocks/sub-logical blocks, as well as the relationship between sub-logical blocks and logical blocks, thereby efficiently allocating storage space and performing subsequent write, read, and erase operations.

In one embodiment, for other sub-logical blocks in the logical block that do not store data, the processor 115 may also generate multiple logical identification codes corresponding thereto. The Rx segment record status flags of these logical identification codes are marked as a default flag, such as FREE. The processor 115 also records all logical identification codes of the file system in a table for management.

In step 240, the first data is stored in the sub-logical block corresponding to the first logical identification code. Furthermore, after the first data is stored in the sub-logical block, the usage flag of the sub-logical block is updated accordingly. It is understood that, in this case, storing the data in a logical block or sub-logical block means storing the data in the corresponding block of the logical block or in the corresponding storage unit of the sub-logical block.

This document system assigns a corresponding logical identifier to each logic block or sub-logic block, and uses the logical identifier to retrieve relevant information about the logic block or sub-logic block. Table 1 below shows an example of the correspondence between the status of a logic block or sub-logic block and the status flags in the logic identifier. Therefore, the status of a logic block or sub-logic block can be determined by the status flags in the logic identifier.

Table 1 shows the data type symbols and their meanings in the logical identifier. Logical identification code Rx segment mark Corresponding data type/status Meaning 0xA FREE There is no data stored in the logical block or sub-logical block 0xB CTZ Sub-logic blocks can store document data 0xC METADATA Directory data can be stored in logical blocks 0xD ABANDAN The directory data stored in the logical block is in an invalid and unerased state. 0xE GC The file data stored in the sub-logical block is in an invalid and unerased state.

In some embodiments, in order to make the file system of this case have a certain degree of inheritance with the littlefs file system so as to directly use certain functions provided by littlefs, this case can set the default bit number to 32 bits. In this way, this case can apply the storage structure of the littlefs file system, and only needs to adjust the meaning of the uint32_t type field used to record the logical identification code used by the littlefs storage structure. Taking the content shown in Figure 5 as an example, the number of bits occupied by the Rx segment, Ry segment, and Rz segment are Bx, By, and Bz respectively. Bx, By, and Bz only need to meet the following conditions to achieve the above adjustment:

...Condition 1

...Condition 2

...Condition 3

...Condition 4

Assuming Bx is 0, By is 0 and Bz is 32, the storage structure of this case is equivalent to the storage structure of littlefs. In other words, all 32 bits of the littlefs storage structure are used to represent the value of the logical identification code (block id), and its address space is .

Please refer to condition 4. Once the number of bits occupied by the Rx and Ry segments is determined, the number of bits occupied by the Rz segment is also determined accordingly. This invention is not limited to the above embodiment; it is merely an example of one implementation method of this invention. In other embodiments, this invention may also use other appropriate logical identification code bit configurations, depending on actual needs.

Please refer to the logical identification code 1 in Figure 5. Assuming that the data type in the sub-logical block N-2 of the logical block i is a file (because the file system in this case uses the CTZ skip-list data structure to record the information of the file, it is simply referred to as CTZ type file data), the processor 115 can generate a logical identification code 1 based on the logical block i, the sub-logical block N-2 and the data type in the sub-logical block N-2 and record the status flag 0xB (indicating CTZ type file data), the sub-logical block number N-2 of the sub-logical block N-2 and the logical block number i of the logical block i in the logical identification code 1.

A sub-logical block number represents the relative position of a sub-logical block within its corresponding logical block, and corresponds to one or more storage units in the block to which the logical block is mapped. In other words, the storage unit corresponding to the sub-logical block number can be addressed based on the address mapping relationship between the sub-logical block, its corresponding logical block, and the block.

Refer to Figure 4. If sub-logic blocks 0 and 1 of logic block i are assigned to data A (CTZ type file), the processor 115 may accordingly generate a first logic identification code corresponding to sub-logic block 0 and a second logic identification code corresponding to sub-logic block 1, thereby recording the status mark 0xB, the sub-logic block number 0 of sub-logic block 0, and the logic block number i of logic block i in the first logic identification code, and recording the status mark 0xB, the sub-logic block number 1 of sub-logic block 1, and the logic block number i of logic block i in the second logic identification code. If sub-logical block 2 of logic block i is assigned to data B (a CTZ type file), processor 115 generates a third logic identifier corresponding to sub-logical block 2. This identifier records the status flag 0xB, sub-logical block number 2 of sub-logical block 2, and logic block number i of logic block i. After data A and data B are stored in sub-logical blocks 0, 1, and 2, processor 115 updates the usage flags of sub-logical blocks 0, 1, and 2.

See logical identifier 2 in Figure 5. Assuming the data to be stored is a directory, this scenario allocates logical block i+2 from multiple logical blocks i to i+2 to the data based on the directory type. Based on this, a logical identifier (e.g., logical identifier 2) is generated to record the status flag 0xC (corresponding to metadata, since this file system uses metadata to record directory data), the sub-logical block number with the default value, and the logical block number i+2 of logical block i+2 in logical identifier 2. It should be noted that for directory data, this file system uses one or more metadata to record directory-related information (such as information about the documents and subdirectories within the directory). In this case, an entire logical block is assigned to a metadata to store the directory data in the block corresponding to the logical block. Therefore, the sub-logical block number in logical identifier 2 only needs to record the default value (such as FULL).

In some embodiments, when data fails, such as data within a sub-logical block, the processor 115 updates the logical identifier corresponding to the logical block or sub-logical block storing the data, recording the data failure in the updated logical identifier. For example, the processor 115 may update the status flag of the Rx segment of the logical identifier to a preset status flag, such as 0xD or 0xE (corresponding to ABANDAN or GC). Thus, when the Rx segment in the logic identification code recognizes the preset status flag, if the logic identification code corresponds to a sub-logic block, then the sub-logic block cannot be read or written; if the logic identification code corresponds to a logic block, then only the erase operation can be performed on the logic block.

As mentioned above, this solution uses a logical identifier to record in detail the data storage status and the relationship between sub-logical blocks and logical blocks. This new logical identifier is very convenient for data reading, writing, and erasing operations.

Figure 6 is a schematic diagram illustrating a logical block and sub-logical block allocation process 600 according to some embodiments of the present invention. It should be noted that Figure 6 is a detailed flowchart of step 220 in one embodiment. Specifically, step 610 includes: upon receiving a storage request to write data to a storage device, generating an allocation command based on the storage request to allocate a logical block or a sub-logical block to the data. The storage request is generated in response to a user operation, and the allocation command is generated based on the storage request. Furthermore, the number of allocation commands generated based on a storage request depends on the size of the data to be written to the storage device. Continuing with Figure 4, data A requires two sub-logical blocks, 0 and 1. A storage request to store data A generates two allocation commands, with one sub-logical block allocated to data A in response to each allocation command. In other words, each allocation command allocates only one sub-logical block or one logical block (depending on the data type) to the data.

Step 611, identify the type of data. Specifically, the storage request includes information about the data to be stored, such as type, size, etc., and the type of the data can be identified based on the information of the data. If the type of the data is a directory, proceed to step 612; if the type of the data is a file, proceed to step 620. Step 612, search for available free logical blocks, such as erased logical blocks. Specifically, the processor 115 can search for free logical blocks based on the status mark of the logical identification code being a preset status mark (e.g., 0xA) or the usage mark of the logical block being the first usage mark. If the search is successful, proceed to step 613; if not, proceed to step 615. In step 613, obtain the logic identification code of the free logic block, such as BLOCK_ID (0xA, 0, X). In step 614, the logical identifier is updated based on the data type to generate an updated logical identifier, such as BLOCK_ID(0xC, Full, X). This updated logical identifier allocates the entire free logical block X to the data. The updated logical identifier includes a status flag (0xC) corresponding to the data type (metadata), a sub-logical block number with a default value, such as Full, and a logical block number, such as X. In step 615, a default signal, such as the no-response error signal ERR_NOSPC, is returned, indicating that the logical block could not be allocated to the data.

In step 620, a free sub-logic block is searched. See step 612 for details of step 620. If found, the process proceeds to step 621; if not, the process proceeds to step 630. In step 621, a logic identifier corresponding to the sub-logic block is generated and returned. In one embodiment, the status flag in the existing logic identifier of the sub-logic block is updated based on the data type to generate a new logic identifier, which is then returned. For example, the logical identification code of the sub-logical block is BLOCK_ID(FREE, Y2, Y1). Based on the data type, the logical identification code is updated to BLOCK_ID(CTZ, Y2, Y1) for the file and returned, thereby assigning the sub-logical block Y2 of logical block Y1 to the data. In another embodiment, the logical identification code BLOCK_ID(CTZ, Y2, Y1) of the sub-logical block can be newly generated based on the data type, the block number Y2 of the sub-logical block, and the block number Y1 of the corresponding logical block. Then, replace the original logic code BLOCK_ID(FREE, Y2, Y1) of the sub-logic block with the logic code BLOCK_ID(CTZ, Y2, Y1).

In step 630, a free available logical block is searched, such as an erased free logical block. For details on step 630, see step 612. If a free logical block is found, the process proceeds to step 631; if not, the process proceeds to step 633. In step 631, the logical block number Z1 of the free logical block is obtained, the logical block is divided into a plurality of sub-logical blocks, one of the plurality of sub-logical blocks is allocated to the data, and the sub-logical block number Z2 of the sub-logical block is obtained. In step 632, a logical identification code (e.g., BLOCK_ID(CTZ, Z2, Z1)) is generated based on the data type, logical block number Z1, and sub-logical block number Z2. This logical identification code is then returned to allocate sub-logical block Z2 of logical block Z1 to the data. In step 633, a default signal (e.g., ERR_NOSPC) is returned to indicate that a logical block could not be allocated to the data.

In addition, when a logic block or a sub-logic block is allocated to data in steps 614, 621, and 632, the processor 115 will correspondingly record or update the usage flag of the logic block or sub-logic block.

FIG7 is a schematic diagram illustrating a logical block and sub-logical block read process 700 according to some embodiments of the present invention, including: Step 710: Receiving a read request to read data, the read request including a logical identifier. In another embodiment, the read request also includes parameters such as an address offset and the size of the data to be read. Step 711: Identifying a status flag in the logical identifier and, based on the status flag, determining whether the data to be read is a directory or a file, performing a corresponding read operation. Specifically, if the data to be read is a file (e.g., a status flag corresponding to CTZ is identified in the logical identifier), then step 720 is executed; if the data to be read is a directory (e.g., a status flag corresponding to metadata is identified in the logical identifier), then step 721 is executed; otherwise (i.e., the data type to be read is neither a file nor a directory, e.g., a status flag corresponding to GC is identified in the logical identifier), then step 722 is executed. In step 720, the address of the data to be read is determined based on the logical block number and sub-logical block number in the logical identification code to read the data. Specifically, the processor 115 determines a starting address based on the logical block number, sub-logical block number, and the address offset in the read request. Furthermore, the processor 115 determines an ending address based on the amount of data in the read request. During implementation, the processor 115 reads data by calling the read function: read(block number, subblock number*subblock size + offset, size) based on the identified logical block number (block number), subblock number (subblock number), size of each subblock (subblock siz), address offset (offset), and data size (size).

In step 721, the address of the data to be read is determined based on the logical block number in the logical identification code to read the data. If the read request includes an address offset and data size, the starting address of the data to be read can also be determined based on the address offset, and the ending address can be determined based on the data size. In a specific implementation, the data is read by calling the read function: read(block number, offset, size) based on the identified logical block number (block number), the address offset (offset), and the data size (size). In step 722, a preset read error signal, such as the no valid data signal ERR_INVAL, is returned, indicating that the data could not be read according to the read request.

FIG8 is a schematic diagram illustrating a write process 800 for logic blocks and sub-logic blocks according to some embodiments of the present invention. It should be noted that FIG8 is a detailed flow chart of step 240 in one embodiment.

In step 810, a write command is obtained to write data. The write command includes a logical identifier. Specifically, upon receiving the logical identifier returned by one of steps 614, 621, and 631, the processor 115 generates a corresponding write command. It is understandable that the write command can be obtained once it is generated. Optionally, the write command further includes parameters such as an address offset and the amount of data to be written. In step 811, a status flag in the logical identifier in the write command is identified, and accordingly, the status flag is determined to determine whether the written data is a directory or a file, and the corresponding write operation is performed. Specifically, if the data being written is a file, step 820 is executed; if the data being written is a directory, step 821 is executed; otherwise, if the data being written is neither a directory nor a subdirectory, step 822 is executed. In step 820, the write address is determined based on the logical block number and sub-logical block number identified in the logical identification code. Optionally, the write start address is determined based on the address offset in the write command, and the write end address is determined based on the data size in the write command. During implementation, data can be written to the corresponding sub-logical block by calling the write function: prog(block number, subblock number *subblock size + offset, size) based on the identified logical block number (block number), sub-logical block number (subblock number), size of each sub-logical block (subblock siz), address offset (offset), and data size (size).

In step 821, a write address is determined based on the logical block number in the logical identification code to write the data. If the write command includes an address offset, the write start address can also be determined based on the address offset, and the write end address can be determined based on the data size in the write command. In implementation, the data can be written to the corresponding logical block by calling the write function: prog(block number, offset, size) based on the identified logical block number (block number), address offset (offset), and data size (size). In step 822, a preset write error signal is returned, indicating that the data could not be written to the corresponding logical block or its sub-logical blocks according to the write command.

After completing the data writing, the processor 115 updates the corresponding logic identification code, for example, updates the status flag in the logic identification code and updates the usage flag of the corresponding logic block or sub-logic block.

FIG9 is a schematic diagram of an erasure process 900 of a logical block according to some embodiments of the present invention. As shown in the figure, in step 910, an erase request is received to erase a data. The erase request includes a logical identification code. In step 911, a status mark in the logical identification code is identified, and accordingly, it is determined whether the data requested to be erased is a directory or a file and a corresponding erase operation is performed. Specifically, if the data is a file, step 912 is executed; if the data is a directory, step 920 is executed; otherwise, that is, the data is neither a file nor a directory (such as a status mark corresponding to FREE is identified in the logical identification code), step 930 is executed. In step 912, it is determined whether the logical block corresponding to the logical identification code contains valid data. Specifically, the logical block number in the logical identification code is determined, all logical identification codes containing the logical block number are found, and the corresponding status flags of all logical identification codes are used to determine whether the logical block contains valid data. If the status flag of one of the logical identification codes is a default value, such as CTZ, then the logical block is determined to contain valid data. If so, the process proceeds to step 913, where an erase error signal is returned to indicate that the erase operation will not be performed. That is, if the logic block where the logic identification code is located has other sub-logic blocks storing valid data, this logic block cannot be erased.

In step 920, an erase operation is performed on the logical block corresponding to the logical identification code. Specifically, the logical block number can be obtained from the logical identification code included in the erase request and the erase interface: erase(block number) is called to erase the entire logical block, that is, to erase the blocks corresponding to the logical block. In step 930, an erase error signal is returned to indicate that the erase operation could not be performed. It is understood that the erase error signals returned in steps 913 and 930 can be the same or different.

Figure 10 is a schematic diagram illustrating a logical block and sub-logical block according to some embodiments of the present invention. As shown, the present invention allows for configuring the size (i.e., subblock size) of a sub-logical block (e.g., a virtual block). The subblock size can be an integer multiple of the program page size and the read page size, and can be an integer multiple of the logical block size (e.g., the erase block size). The subblock size is recorded in the configuration file of the present invention's file system.

It should be noted that this application is not limited to the embodiments shown in Figures 1 through 10 . These are merely illustrative examples of one embodiment of this application to facilitate understanding of the technology. The scope of this application's patents shall be based on the scope of the invention application. Modifications and enhancements to the embodiments of this application made by skilled artisans without departing from the spirit of this application shall still fall within the scope of this invention application.

In summary, the storage management method and storage management device of this case further divide the logical block into multiple sub-logical blocks, and then use multiple sub-logical blocks within the logical block to store multiple smaller data items. Therefore, if the same logical block still has free sub-logical blocks, the free sub-logical blocks will be allocated to the remaining data for use. Therefore, the storage management method and storage management device of this case can efficiently allocate storage space, thereby avoiding wasted storage space.

In addition, the storage management method and storage management device of this case are further configured with a logical identification code. This case can use the above logical identification code to record the status of the logical block or sub-logical block, the relationship between the sub-logical block and the logical block in detail, and then efficiently allocate storage space and perform subsequent write, read, erase and other operations. Logical identification code

Although the embodiments of this case are described above, these embodiments are not intended to limit this case. Those skilled in the art may modify the technical features of this case based on the explicit or implicit content of this case. All such modifications may fall within the scope of patent protection sought in this case. In other words, the scope of patent protection for this case shall be determined by the scope of the patent application in this specification.

100: Storage management device 115: Processor 200: Method 210-240: Steps 400: Storage device 500: Memory 600: Method 610-633: Steps 700: Method 710-722: Steps 800: Method 810-822: Steps 900: Method 910-930: Steps Rx: Logical identification code segment Ry: Logical identification code segment Rz: Logical identification code segment

Figure 1 is a schematic diagram of a storage management device and memory according to some embodiments of the present invention; Figure 2 is a schematic diagram of a storage management method according to some embodiments of the present invention; Figure 3 is a schematic diagram of the relationship between a logic block and a sub-logic block according to some embodiments of the present invention; Figure 4 is a schematic diagram of the relationship between a sub-logic block and data allocation according to some embodiments of the present invention; Figure 5 is a schematic diagram of a logic block, a sub-logic block, and a logic identification code according to some embodiments of the present invention; Figure 6 is a schematic diagram of the allocation process of a logic block and a sub-logic block according to some embodiments of the present invention; Figure 7 is a schematic diagram illustrating a read process for a logic block and a sub-logic block according to some embodiments of the present invention; Figure 8 is a schematic diagram illustrating a write process for a logic block and a sub-logic block according to some embodiments of the present invention; Figure 9 is a schematic diagram illustrating an erase process for a logic block and a sub-logic block according to some embodiments of the present invention; and Figure 10 is a schematic diagram illustrating a logic block and a sub-logic block according to some embodiments of the present invention.

200:Method

210~240: Steps

Claims (18)

A storage management method is provided for accessing a storage device through a file system. The storage device includes a plurality of blocks. The file system includes a plurality of logical blocks mapped to the plurality of blocks. Each of the plurality of logical blocks has a logical block number. The storage management method comprises: receiving a first A storage request is received to store a first data of a first type; in response to the first storage request, a first logic block among the plurality of logic blocks is divided into a plurality of sub-logic blocks; a first sub-logic block among the plurality of sub-logic blocks is allocated to the first data; and a first logic identity is generated that is mapped to the first sub-logic block. The first logic identification code records a state flag of a first value corresponding to the first type, a sub-logic block number of the first sub-logic block, and a logic block number of the first logic block in the first logic identification code; receives a second storage request to store a second data of a second type; responds to the second storage request to store the second data; A second logic block among the plurality of logic blocks is allocated to the second data; and a second logic identification code is generated and mapped to the second logic block to record a status flag with a second value corresponding to the second type, a default sub-logic block number, and the logic block number of the second logic block in the second logic identification code. The storage management method as described in claim 1, wherein dividing the first logic block in the plurality of logic blocks into the plurality of sub-logic blocks includes: generating and recording a plurality of sub-logic block numbers for marking the plurality of sub-logic blocks. The storage management method as described in claim 1, wherein dividing the first logic block in the plurality of logic blocks into the plurality of sub-logical blocks includes: setting a usage flag for each of the plurality of sub-logical blocks, and updating the usage flag of the first sub-logical block when the first sub-logical block is allocated to the first data. The storage management method as described in claim 3 further includes: in response to an allocation command generated based on the first storage request, searching for a free sub-logical block based on the usage flags of the plurality of sub-logical blocks; if the free sub-logical block is found, generating a logical identification code based on the first type, the sub-logical block number of the free sub-logical block, and the logical block number of the logical block corresponding to the free sub-logical block; and if no free sub-logical block is found, searching for a free third logical block from the plurality of logical blocks. The storage management method as described in claim 1, wherein the first logic block in the plurality of logic blocks is divided into the plurality of sub-logic blocks, comprising: generating a plurality of logic identification codes mapped to the plurality of sub-logic blocks, each of the plurality of logic identification codes having a state flag of an initial value; responding to an allocation command generated according to the first storage request, A state flag recorded in the logic identification codes of the plurality of sub-logic blocks is used to search for an idle sub-logic block in the plurality of sub-logic blocks; if the idle sub-logic block is found, the state flag of the idle sub-logic block, which is the initial value, is updated to the state flag of the first value; and if the idle sub-logic block is not found, a third idle logic block is searched from the plurality of logic blocks. A storage management method as described in claim 1, wherein the logical identification code occupies a preset number of bits, the first bit in the logical identification code is used to record the status flag, the second bit is used to record the sub-logical block number, and the third bit is used to record the logical block number, and the sum of the first bit, the second bit, and the third bit is equal to or less than the preset number of bits. The storage management method as described in claim 1 further includes: receiving a read request to read data, the read request including a logical identification code; identifying a status flag recorded by the logical identification code in the read request; if the status flag is the first value, determining a read address based on the logical block number and sub-logical block number of the logical identification code in the read request to read the data accordingly; and if the status flag is the second value, determining a read address based on the logical block number of the logical identification code in the read request to read the data accordingly. The storage management method as described in claim 1 further includes: obtaining a write command, the write command including a logical identification code; identifying a status flag recorded by the logical identification code in the write command; if the status flag is the first value, determining a write address based on the logical block number and sub-logical block number of the logical identification code in the write command; and if the status flag is the second value, determining the write address based on the logical block number of the logical identification code in the write command. The storage management method as described in claim 1 further includes: obtaining an erase request, the erase request including a logical identification code; identifying a status flag recorded by the logical identification code in the erase request; if the status flag is a third value, obtaining all status flags mapped to the logical block number in the erase request, and when all the obtained status flags are the third value, erasing the data in the logical block corresponding to the logical identification code in the erase request; or if the status flag is the second value, erasing the data in the logical block corresponding to the logical identification code in the erase request. A storage management device accesses a storage device through a file system, wherein the storage device includes a plurality of blocks, the file system includes a plurality of logical blocks mapped to the plurality of blocks, each of the plurality of logical blocks having a logical block number; the storage management device comprises: a processor, according to a memory At least one instruction in the memory is used to execute the following steps: receiving a first storage request to store a first data of a first type; dividing a first logic block in the plurality of logic blocks into a plurality of sub-logic blocks in response to the first storage request; allocating a first sub-logic block in the plurality of sub-logic blocks to the first data; generating a mapping on the a first logic identification code of the first sub-logic block to record a state flag of the first value corresponding to the first type, a sub-logic block number of the first sub-logic block, and a logic block number of the first logic block in the first logic identification code; receiving a second storage request to store a second data of the second type; responding to the second storage request; A storage request allocates a second logic block among the plurality of logic blocks to the second data; and generates a second logic identification code mapped to the second logic block to record a status flag with a second value corresponding to the second type, a default sub-logic block number, and the logic block number of the second logic block in the second logic identification code. The storage management device as described in claim 10, wherein the processor performs the step of dividing the first logic block in the plurality of logic blocks into the plurality of sub-logic blocks, including generating and recording a plurality of sub-logic block numbers for marking the plurality of sub-logic blocks. The storage management device as described in claim 10, wherein the processor performs the division of the first logic block in the plurality of logic blocks into the plurality of sub-logic blocks, including: setting a usage flag for each of the plurality of sub-logic blocks, and updating the usage flag of the first sub-logic block when the first sub-logic block is allocated to the first data. The storage management device as claimed in claim 12, wherein the processor further executes the following steps according to the at least one instruction in the memory: in response to an allocation command generated according to the first storage request, searching for an idle sub-logical block according to the usage flags of the plurality of sub-logical blocks; if the search The method further comprises: finding the idle sub-logic block, generating a logic identification code according to the first type, the sub-logic block number of the idle sub-logic block, and the logic block number of the logic block corresponding to the idle sub-logic block; and searching for an idle third logic block from the plurality of logic blocks if no idle sub-logic block is found. The storage management device as described in claim 10, wherein the processor executes the division of the first logic block in the plurality of logic blocks into the plurality of sub-logic blocks, comprising: generating a plurality of logic identification codes mapped to the plurality of sub-logic blocks, each of the plurality of logic identification codes having a state flag of an initial value; and in response to an allocation command generated according to the first storage request, Searching for an idle sub-logic block in the plurality of sub-logic blocks according to the status flags recorded in the logic identification codes of the plurality of sub-logic blocks; if the idle sub-logic block is found, updating the status flag of the idle sub-logic block, which is the initial value, to the status flag of the first value; and if no idle sub-logic block is found, searching for an idle third logic block from the plurality of logic blocks. A storage management device as described in claim 10, wherein the logical identification code occupies a preset number of bits, the first bit in the logical identification code is used to record the status flag, the second bit is used to record the sub-logical block number, and the third bit is used to record the logical block number, and the sum of the first bit, the second bit, and the third bit is equal to or less than the preset number of bits. The storage management device as described in claim 10, wherein the processor further executes the following steps according to the at least one instruction in the memory: receiving a read request to read a data, the read request including a logical identification code; identifying a status flag recorded by the logical identification code in the read request; if the If the status flag is the first value, a read address is determined according to the logical block number and the sub-logical block number of the logical identification code in the read request to read the data; and if the status flag is the second value, a read address is determined according to the logical block number of the logical identification code in the read request to read the data. The storage management device as described in claim 10, wherein the processor further executes the following steps based on the at least one instruction in the memory: obtaining a write command, the write command including a logical identification code; identifying a status flag recorded by the logical identification code in the write command; if the status flag is the first value, determining a write address based on the logical block number and sub-logical block number of the logical identification code in the write command; and if the status flag is the second value, determining the write address based on the logical block number of the logical identification code in the write command. The storage management device as described in claim 10, wherein the processor further executes the following steps according to the at least one instruction in the memory: obtaining an erase request, the erase request including a logical identification code; identifying a status flag recorded in the logical identification code in the erase request; if the status flag is a third value, obtaining a mapping emitting all status flags of the logical block number in the erase request, and when all the obtained status flags are the third value, erasing the data in the logical block corresponding to the logical identification code in the erase request; or if the status flag is the second value, erasing the data in the logical block corresponding to the logical identification code in the erase request.