TWI240862B - File system managing-method of flash memory and its logic framework - Google Patents

Abstract

The present invention is related to a file system managing method of flash memory and its logic framework. Each section logic in the flash memory is divided into plural blocks; and each block contains a block head, a data division and a block end for checking. When writing the file data into the flash memory, the file data is written into the data division of different blocks in a dispersive manner. In the managing method of the invention, the block head of each block is first read to obtain each item property of the block; and the files stored in a dispersive manner are then reassembled according to one file number and one sequence number of the block head. After that, the reassembled files are checked to see if they are complete or not; if they are damaged, the users are notified. Finally, according to the block property inside the block head, the block is checked to see if it belongs to a transaction file. Thus, based on the recorded trading status of the transaction file head inside the block, file recovery process or continuously completing the trade correcting action is conducted. In addition, by using the block end, it is capable of checking if the data of block head and the data stored in the data division are damaged or lost.

Description

1240862 V. Description of the invention (1) [Technical field to which the invention belongs] The present invention relates to a file system management method of flash memory and its logical structure, especially a method for logically cutting each section of flash memory. Plural blocks to write file data in different blocks. [Previous technology] Press' In today's daily life, portable devices such as mobile phones and personal digital assistants PDA have become one of the necessary daily necessities, and these embedded system devices have flash memory for use in Access to file data such as phone book, notepad, pictures or text messages, and embedded system devices with flash memory need a file system management method and structure for effective management and protection to avoid important files The data is damaged or lost. However, due to the nature of the file, when the structure is changed and rewritten, it must be repaired. As a result, the memory of the file is damaged. It is judged, and when the time is spent, generally the internal and file data are not provided. When the electrical modification is written, the files stored in the case will be used to manage the useless files. The memory length may be flashed. When the files entered in the fast case are damaged, the file back to the source is interrupted, but the custom data is ignored. This causes other files to be flashed. In the memory, when the memory is lost or lost, the complex function cannot be continued and cannot be provided with integrity. If a file is damaged, it ca n’t be notified that there is a very strong phase on the need to write or access the project in the memory space, which may damage the entire file. In addition, the general flash detection function is a waste of file deletion as a file user. When erasing a segment, its response is too slow to reach

1240862 V. Description of the invention (2) f real-time operation 'and because the flash memory is here to erase a section, and the action in the section * cannot be erased, a certain clean memory space must be maintained in order to: = Bytes, the user's useful data is copied to a clean memory space, and-= sector erasure B system management is passively made useless data-^ flash memory bone ..., the memory will be wiped. However, w has a slower response to user file access. In this way, the present invention is directed at the shortcomings of the memory management system and its logical structure, and the shortcomings of the invention, and the addition of flash memory to solve the above problems. «Can be easily and reasonably managed [Content of the invention] The main purpose of the present invention is to say" system management method and its logic 芊 flash memory file A m ^ ^ ^ /, 冓 eight series are compiled according to the file of the block header And m sequence numbers to reorganize the files to achieve the purpose of file loss. Nibao Tea has a robust structure and is not related ": The secondary purpose is to provide a kind of flash memory: the former:" The logical structure of it "can be restored based on transaction files and transaction repairs. Two: The case before the revival of the transaction was modified so that the slot system was established i :: t Another purpose is to provide a flash memory file holding the corpse & / and its logical structure, which is based on the block design There is a ghost tail for inspection, so that the block has the purpose of detecting file damage. Another purpose of this month is to provide a flash memory slot that only saves the file into the flash case number for easy modification. Case

1240862 V. Description of the invention The system management method and its logical structure are designed to respond to other file access requirements in a timely manner when files are written, copied, or sector erased. ^ Another object of the invention is to provide a flash memory file system management method and its logical structure, which can automatically check the total number of clean blocks and proactively erase sections of unnecessary file data. For the purpose of maintaining cleanliness. U 3 is another object of the present invention. In the system management method and its logical architecture, the flash memory can be fully utilized. The logical architecture of the present invention will be divided into a plurality of blocks in order to divide the file information into each block. It includes a data area that contains record area storage rights data; a block end and a block header include a state; a file number used to indicate what type of block is in which file; a block number; a sequence number; and It is easy to modify the management information of the file system of the present invention in the same sequence of blocks. Based on the file number of the block header and check for the discontinuity in the same file number, the file has been damaged, and the file is removed. A flash memory project, which provides a memory space with a mini case. 'Each sector in a flash memory is divided into different blocks and written in different blocks. A block header; used to check the block header and the data area to indicate the current status of the block; a block attribute; a block attribute; to identify the block belongs to the block in the same file Yu said that when the file is submitted to the block, the information is transferred. The first method is to read the header and sequence number of each block to perform the file re-leveling, and check whether the sequence number of the block is continuous. Perform block attributes in #J to determine whether a block is

Page 7 1240862

Page 8 One of the cases of transaction modification in the case of one less broadcast, is the transaction file easy? At the time of the case, according to the tragedy of the _ transaction slot header in this block, file recovery processing or continued easy repair processing can be performed to restore the transaction, retain the transaction, or delete it before resuming the transaction. ΠΪCommittee members on the structural features of the present invention and what they have achieved :: and understanding, I would like to accompany the diagram of the preferred embodiment and wish to explain as follows: To check the second picture and logically cut a block, the block header 20 includes one, clean or what kind of file, how much data is stored, and a flash block. If the file is a file, the lost file is three, and the size is 20, The department will record the block-shaped ones as a loss; a file space; 5. Description of the invention (4) The action from the record to the block belongs to one of the transactions. The easy-to-modify status is to make the function more advanced. In accordance with the detailed [implementation of the present invention, the segments are logically cut into the block headers of different regions. The case is recorded with a strong inclusion check. Please refer to the memory 1 〇 'and each block ends with 4 Q, each 2, before the item The status is an attribute. # 一 衣 不 区 14 The files belonging to zone 30 use a slot to form a record of one of the same blocks. The structure of the broadcast case does not use a block. The first picture and each zone Segment 12 1 4 is a block containing the attributes of block 14. Which file belongs to useless and useless block 14? The data used in the memory can be used to reorganize the file data according to the zone order, and there is no damage. . The present invention records the sadness of the same plural data area 30 in block 14 and 'represents the state of destruction of the area; the case number uses' to indicate that a sequential number is written in each area and one of the writing blocks is distributed so that the area Block 14 is a fast dispersal block 14 and each of the blocks in block 1 is a 14 mesh block.

V. Description of the invention (5) Block 14 is the first few blocks in the file; the reason is that the current version of S produced by Zuo Shou is not listed in the same sequence number block. Versions, such as the number # M t ^ Μ ^; the block 40 contains the right one F_ sub-bluff code is larger for the newer version of the block, for use; ^ Yu Manr & District Guishuo check the block and a data Area inspection and destruction, and the inspection side = and whether the data within 30 in Beibei District is damaged. The method is precisely checked by the conventional CRC-1 6 or CRC_32 method. However, in the section header of each section j 1 2, the first block B0 of the section is a field number for each section, A System package: ^ S = Records of the duplicate, copy, erase, or damage of each attribute of the recorded section 12, indicating that section 12 is currently the identification of the use case system. , — File system identification, as the number of erasures of the file; — section 'division:;: number records' (record every-section 12 records):: J — slot system version Ϊ version, indicating section erasure When the number of times is 14, the file's ^ :: ^ file data distribution writers are set up in different blocks—general gimmicks 52, i50 in the data area 30 under the block header 20, and these two The remaining space of the material area 30 is that the data area 30 is all 栌 ^ "The other areas after the two areas 50 and 丨 4 attributes of the recorded file: 祯 = two capacity, the general file 52 includes It is used to record to record the Λ position of each file chapter, which includes the space occupied by a file sequence number file header 52 = sequence; the size of a file header, and the general record; a file Names 1 and 1: Generation time, which indicates that when the file was generated, the file attribute contains the file attribute, which indicates the file usage method, file read, read, write, or additional fields. The file is set as The only way to restore the attributes of the case is that it is a set file of 1240862. V. Description of the invention (6) If a transaction occurs during the process of transaction modification, and you want to restore the file, the method is 2 = before the transaction is modified. 2. Maintain the status quo or delete, and a file integrity check position, which sets whether the file is checked for integrity. 〃 The crotch system management method of the present invention reads the segment header first to determine the status of the segment 12. When the segment 12 is in a user-controlled state, all the content in the segment 12 is read. The poor material in area 10 of block 14 will be distributed according to the file number and sequence number: * 1 2 1 Whether the file is reorganized. Is there any condition: When the block sequence number in the file is an entire file, the file is one. Breakage: The law forms a yuan division. The complete file tells the user to delete it. Please refer to Figure 5 and Figure A. 筮 2 ^ θ The system will read 4 "Brother, Figure, and Brother B, and then the file block" Whether The block belonging to the zone head 20 is & check each-area-transaction file header 62 and the ϋ! Block 60 in the transaction file f includes a number of fields and includes one or two ^ case records 64, The transaction file header contains the number of re-transaction files, ^ & number, indicating the number of this transaction file; a status, the number of files that record transactions and transaction modifications; and-transactions have-participation in transactions = transaction status' and file records It includes the bluffing field of the Putian case using the number of blocks, the block of the file office before a transaction is modified, and the transaction number of the block used by the file after the transaction is modified. At least one file in the flash memory 10 is used repeatedly to record the at least one file for transaction repair

Page 10 1240862 V. Description of the invention (7) In the case of modification, the file will be deleted immediately when the file modification operation is completed. Therefore, if a block belonging to the transaction file is found, it will be traded on behalf of the file. The modification action is not completed. At this time, the slot system will be processed according to the completed status. "Tianyi" When it is found that block 60 belongs to the transaction slot case, and the transaction status recorded in the transaction header 62 in block 60 is in the incomplete state, it means that when the transaction is modified for the bid, a power outage or a sudden power failure occurs. The user specifies that the cancellation of the modification process and other interruption factors are caused. At this time, the file system will view the general file header of the file that participates in the modification of the ^ easy modification according to the file number of the transaction modification in the ^ 俨 case record 64. File recovery attribute block, ^ setting = recovery method for file recovery 'when the building case is to be restored in the transaction repair $ ^', it first reads the podcast record 64 in block 60 and views the file that participated in the transaction modification, In order to know the number of blocks used in the transaction / transaction modification in the transaction / transaction modification ^ and the number of blocks currently used, and compare the number of blocks used before the transaction modification with the current number, it will exceed The current used block number of the used block number before the transaction modification is deleted. ^ False: The slot case involved in the transaction modification has a "solid block" before the transaction modification. However, the currently used blocks are-version 〇 Version 0 order 2 block 72, first version i order 3 area, order [shown in ghost 70 block 76 and first version 0 order 5 block 77 free 4 and first version 1 order 4], in the heart of the comparison area Blocks (such as the number of blocks used before easy modification in Figure 6A) are deleted / page order 5. Block 77 is the file that exceeds the transaction modification. After the transaction is completed, the second block is then viewed and restored. Two versions. Easy sequence == 亍 Modified transaction 8 and sequence 4 block 79 (such as

1240862 V. Description of the invention (8) (shown in Figure 6B), & 2 blocks 72 and-order △ replace the order and one order 4 blocks & block 74 of the two new version 1 of the current transaction modification, and The two new versions of the first 3 blocks 74 other files in the easy file are deleted, and finally the blocks are deleted. Ghost 'will then complete the restoration of the case completion area before the transaction modification = the transaction status recorded in Yiquantou 62 will be modified, except that ... Restoring as described above is different from the transaction repair 6 and its 4 'difference: ί In the file system, the reading area i 六-Liudangu, 彔 4, is used to know the files involved in the transaction modification; ί 于'Number of blocks used after the change' is then compared with the number of blocks used in the transaction modification after the change and the number of blocks currently used. Block 60 and other blocks belonging to the transaction file will be removed. This method is to avoid the user's modification of the file transaction. The operation is to delete the last block of the original file, that is, when the block has been modified, and the last block is to be modified. ; = 2nd day = other interruption factors such as power outages, although the transaction status record of Erbeitou 62 is completed, it is actually: At this time, because of the last- The version can be three old versions, so if the file system does not continue to complete the transaction modification, the file error will occur. move

Page 12 1240862 V. Description of the invention (9) In addition, the case of the present invention is to detect that the number of re-cleaned blocks in the flash memory 10 is less than a set, and a step of generating clean sections is provided. The total number of blocks 1 to 4. The latest version of block erasure times in each block 14 in each of the 12 blocks, less useful blocks, and sections will be selected for block erasure. Manipulate other sections, and finally the selected section will produce a clean section. This step can solve the practice of quickly detecting and erasing a certain number of clean blocks to facilitate the selection of the highest number of erasing times and the highest limit value in the erasing action. Then, it is preferable to select a sector in which the useless block is the same as one of the useful blocks for the sector erasing life. In addition, the steps required by the file system of the present invention, when the file system is erased or the user is performing memory, the above operations will be managed in a unified manner, and it further includes a step of automatically counting the total number of clean blocks. When the limit value is reached, the file system will perform a low limit equivalent to a section 12. The steps to generate a clean section are viewed first, and the section headers of all sections 12 are read to select more Useless erasure of a lower sector, and subsequent useful blocks in the sector are copied to the sector erase operation, so the flash memory file system cannot automatically 'make the flash memory 1 〇 Inside, there are sections 1 and 2 for erasing. In addition, in the step of the section, when all the sections 1 2 and the low section erasing frequency are different, the section with the lowest erasing section number is not counted. This design can avoid the repeated use of 'to increase the flash memory 10'. The management method further includes a quick response line sector erase operation, segment writing or copying file data to the flash memory. Segment or a complete block

1240862 V. When writing or copying the description of the invention (10), the file system will check the other files' requirements and give priority to it, so that the slot of the invention can respond quickly to the efficiency of real-time processing requirements. Please refer to the seventh figure together, which is a schematic diagram of the block structure for writing (storing your files) according to the present invention. As shown in the figure, a mini gear 82 is provided under the block head 20, which includes a seat. The plural field includes a file sequence number, and the order in which the slot cases are generated will be compared with the general slot sequence number in the record; a file attribute, which indicates the way of the fan, and the file attribute is the same as the above general File header 5 2; The size of a file header records the size of the mini file header 82; a file of the mini file data stored in block 80 in the field of the case generation in block 80 indicates that the mini file was generated. Time; one and one case name. With this structure, the user can write some important and smaller materials in block 80. The first mini is written according to the size of the mini-head in the mini-head 82. Position ', and follow the end of the mini file 8 2 to attract the first pen, but the data position of the mini file 82 will record the position of the first 84, so the second mini file 8 6 is written according to the mini The data position of the header 82 can be continued from the first mini beam position. According to the above-mentioned structure and use method ^ several mini slot cases until the space of block 80 is used up, and then other blocks, so it can be effective. The use of flash memory on page 14 whether there is a more important system to achieve quicker storage of smaller files. A block of 80 series records are used to record the files of each head. ; A file size block mini file asset file 8 4 hours, the end of the first 8 2 your file 8 4 write pen mini file to enter, only the case of the case file 8 4 can be continuously written and replaced in the memory space,

1240862 V. Description of the invention (11) __ And to increase the flash memory 10, you need to set up your file-the end of the block is two: 'Another Xi Bu' when writing each-pen fans as shown in the seventh picture As shown in the figure, each mini file is written in the block, and the mini file is 86. Each household needs to set up _: mini file 84 and the second one. It has been ensured that the mini-file 84 is set to: — = Duan 88 and the second area. Paragraph end 89 Furthermore, the present invention is related; the right W two mini files 86 are correct. A directory file ‘II: File is written in area 30. All the directory names are created; the title; the case will be flash memory 1. Internal knowing the current use of flash memory = in the case ’so when the user wants to obtain 2 files in the directory file =: what directories are there’ file system In summary, this issue; the user knows. — Its logical structure is effective and effective: the official method of the case system and the internal file structure are relatively fragile; the file system of the flash memory cannot be restored when the file system is interrupted, and the transaction is modified The operation has the disadvantages of erasing the main action section and the damage detection function of the helmet method to the ft slot, unable to real-time operation of the mini file, and the use efficiency of the flash memory 10 of the present invention :: file The design, when improving the fast business, is based on the area at the head of the sector; in addition, it is performed during the erasing of the section as a version record, which can be connected to the ancient and erasing records and the erasing record. It is the life span of "Qi Yi Yi 10". The user should meet the requirements of China's nose: t 颖 The quality and progress can be used for the industrial patent application for inventions. The essentials of the patent application method of Law A are undoubtedly the only ones mentioned above according to the law, only ::: quasi-patent 'Extremely pray. It is used to limit the present invention. # ≫ Two copies of the first preferred embodiment of this invention, is not a continuation of the monthly implementation, so to apply for a patent application in accordance with the present invention

Face II

Page 15 1240862 5. The equal changes and modifications of the shape, structure, features and spirit described in the description of the invention (12) shall all be included in the scope of patent application of the present invention. [Comparison of drawing number]

10 Flash memory 72 version 0 order 2 block 12 section 74 version 1 order 3 block 14 block 76 version 1 order 4 block 20 block header 77 version 0 order 5 block 30 data area 78 version 0 order 3 Block 40 Block End 79 Version 0 Sequence 4 Block 50 File First Block 80 Block 52 General Header 82 Mini Header 60 Block 84 First Mini File 62 Transaction Header 86 Second Mini File 64 slot case record 88 end of first segment 70 version 0 sequence 1 block 89 end of second segment

1240862 on page 16 Brief description of the diagram The first diagram is a schematic diagram of the architecture of the flash memory of the present invention; the second diagram is a schematic diagram of the architecture of each section of the flash memory of the present invention; the third diagram is each of the present invention. Schematic diagram of the structure of each block in a section; The fourth diagram is the structure of the first embodiment of the present invention, and the fifth diagram is the record file of the preferred embodiment of the present invention. Schematic diagram of the block structure for transaction modification; Figure 6A is a block diagram of the preferred embodiment of the present invention for transaction modification, and currently uses block diagrams;

The sixth diagram B is a block diagram of the original block reserved for the file modification of the present invention; the seventh diagram is a block structure for writing a smaller file for storing a smaller file according to a preferred embodiment of the present invention.

Page 17

Claims (1)

1240862 VI. Applying for patent patents 1. A flash memory file system management method. Each sector of a flash memory in a file system has a plurality of blocks, and each of the blocks has a block header. And a block end for inspection, the file data is written separately in different blocks, and the management method includes the following steps: a. Reading the data of each block header; b. According to the block header A file number and a sequence number to reorganize the file, c. Check whether the file is complete; and d. Determine whether the block belongs to a transaction file based on a block attribute in the block header, and the transaction file records at least one file In case of transaction modification. 2 · The flash memory file system management method according to item 1 of the scope of patent application, wherein after step a, it further includes reading a sector header in the first block of each sector first. , Check the status of the section as used, copied, erased or destroyed. 3. The flash memory file system management method as described in item 1 of the scope of the patent application, wherein in step c, it is to judge whether the sequential numbers of the plural blocks of the same file number are continuous. Delete the file for a damaged file. 4 · The flash memory file system management method as described in item 1 of the scope of patent application, wherein in step d, when the block belongs to the transaction file, the file recorded in a transaction file in the block When a transaction status is in the incomplete status, the general of the file for transaction modification is based on the 1240862 VI. Scope of patent application --------- The file restoration attribute is used for building restoration. The file restoration attribute is G I 1 ^ It is assumed that the state of the file is not changed, the state after the change is retained, or deleted. ^ The flash memory file system method described in item 4 of the Ming patent method, wherein the method of restoring the broadcast before the change includes the following steps: a · Jing = Area with a transaction file At least one file record in the block to know the number of blocks used in the slot before the transaction is modified; b. View the number of blocks currently used in the file; c. Compare the number of blocks used before the transaction with the modification Number of currently used blocks' will delete the currently used blocks that exceed the number of used blocks before the transaction is modified; d · View and reply to the original blocks reserved by the file before the transaction modification; e · Delete the new version of the file transaction modification Blocks; and f-delete blocks belonging to the transaction file. 6. The flash memory file system management method as described in item 1 of the scope of patent application, wherein in step d, when the block belongs to the transaction file, the file recorded in a transaction header in the block When a transaction status is completed, the file transaction is continued to be completed. The method of completion includes the following steps: a. Read at least one file record in the block with the transaction header to know the file The number of blocks used after the transaction modification; b. View the number of blocks currently used in the file; c. Compare the number of blocks used after the transaction modification with the number of blocks currently used, which will exceed the number of blocks used after the transaction modification Current use area 1240862 VI. Deletion of patent application scope blocks; and d. Deletion of the transaction file 7 · If the first patent application scope management method includes the following steps: a · Examine the first of each middle section Record of the number of divisions of the block, the selected block and the erasure time of the block b. The selected section and c. The selected section will be entered into 8. The 7th management method of the scope of patent application, among which Automatically detect the flash step. When the clean block is performed, the clean section 9 is generated. · As in the seventh management method of the scope of the patent application, the two sections with the highest steps differ by the number of sections with the lowest number of erasures. 1 0 · As the seventh management method in the scope of patent application, Case block. The flash memory broadcast system described in the above item—the step of generating a clean segment ', which is to package each / the block, and read each of the segment—the latest version of the segment erase in the segment header— One segment with more useless blocks and less useful numbers; the useful blocks are copied to other segments; the erase is performed. Before the file system of the flash memory described in the item performs the step of generating a clean section, set the number of steps in the memory to a plurality of clean blocks. The total number of steps is lower than a set low limit, and then the step is performed. In the file system of the mysterious flash memory, when the number of sector erasures is the lowest and a limited value is reached, priority is given to the segment without considering the useless blocks and useful blocks. In the case system, step c is included. T includes a quick response. 1240862 13 When the application scope of the patent application requires more work than the operation 11 · If the applicant has finished writing or has 12 · If the application management party includes There are the following a. According to the mini-b. According to your file, such as when the application manager writes a. According to your file, b. According to the requirements to the first stage, the requirements are required, and the first scope of the patent scope, It also contains the more important requirements of writing or copying a block to complete a block. The first method of patent scope includes the following steps: a small mini file header in the block header; and a mini file header in the mini header. End Write a mini file to write the patent scope of the 12th method, in which, in the step, it writes the mini file at the end of the case of the mini file; and writes the mini file to copy the operation to a stage and sector erase The file system checks whether other files are prioritized. The flash memory file system described in this item is a step of responding quickly to the demand. When using file data in the flash memory, the file system will review other files at that time and give priority. The step of writing a mini file in the flash memory file system described in the item is to include the block attributes, and to view a block used to write the stored data, the block has a The size of a file head to know the fan, and the end position of the mini file head will be the flash memory file system μ. At least one mini file will be followed by the following steps: : Φ is the package symbol / ^ material position 'to know that the first fan = write at least one at the end position, and set the phase at the end of the section. Number of cases