WO2021248406A1

WO2021248406A1 - Method and apparatus for repairing file system

Info

Publication number: WO2021248406A1
Application number: PCT/CN2020/095581
Authority: WO
Inventors: 郭建
Original assignee: 华为技术有限公司
Priority date: 2020-06-11
Filing date: 2020-06-11
Publication date: 2021-12-16
Also published as: CN115698934A

Abstract

A method for repairing a file system, the method comprising: acquiring a FAT (S210); segmenting the FAT into N sub-FATs, wherein N is a positive integer greater than 1 (S220); generating N cluster chain tables according to the N sub-FATs (S230); merging the N cluster chain tables to generate a target cluster chain table (S240); and repairing a FAT file system according to the target cluster chain table (S250). After a FAT is segmented into N sub-FATs, the number of clusters included in each sub-FAT is less than the number of clusters included in the FAT, and therefore, the amount of memory required for generating a cluster chain table on the basis of each sub-FAT is small. Compared with a method whereby a complete cluster chain table is directly generated according to a FAT and a file system is repaired, the method does not require a large memory during the process of repairing a file system, thereby reducing the cost of an electronic device with a FAT file system.

Description

Method and device for repairing file system

Technical field

This application relates to the field of computers, and in particular to a method and device for repairing a file system.

Background technique

The file allocation table (FAT) file system is a widely used storage system. For example, consumer-grade video products such as driving recorders, digital video cameras (digital video, DV), smart home cameras, etc. all use the FAT file system To store data.

Such consumer-grade camera products usually use external storage devices, which are prone to abnormal power failure, hot swapping, etc., which can cause damage to the FAT file system. For example, if a car crashes during driving, the secure digital memory (SD) card of the driving recorder is ejected, causing the FAT file system of the SD card to be damaged, and the FAT file system of the SD card needs to be repaired. .

One method to repair the FAT file system is to build a cluster chain based on FAT, and repair the FAT file system based on the cluster chain. In the process of constructing the cluster chain, it is necessary to use the same memory as the FAT size. This memory requirement is a larger burden for consumer products. How to reduce the memory required to repair the FAT file system is Current issues that need to be resolved.

Summary of the invention

This application provides a method for repairing a file system, which can reduce the memory required for repairing a FAT file system.

In a first aspect, a method for repairing a file system is provided, including: obtaining a FAT; dividing the FAT into N sub-FATs, where N is a positive integer greater than 1, and generating N cluster linked lists based on the N sub-FATs; The N cluster linked lists are merged to generate a target cluster linked list; the FAT file system is repaired according to the target cluster linked list.

After the FAT is divided into N sub-FATs, the number of clusters contained in each sub-FAT is less than the number of clusters contained in the FAT. Therefore, the memory required to generate the cluster linked list based on each sub-FAT is small; N cluster linked lists are generated one by one Then, the N cluster linked lists are merged to generate a target cluster linked list. The target cluster linked list is a complete cluster linked list corresponding to the FAT and can be used to repair the FAT file system. Compared with the method of directly generating a complete cluster linked list based on FAT and repairing the file system, the method provided in this application does not need to use large memory in the process of repairing the file system, thereby reducing the cost of electronic equipment using the FAT file system.

Optionally, the number of clusters included in the N sub-FATs is the same.

When the number of sub-FATs is determined, the sub-FATs generated by dividing the FAT equally contain fewer clusters. For example, FAT contains 10 clusters, and N is equal to 2. The FAT can be divided into two sub-FATs containing 5 clusters based on the equal division scheme, or the FAT can be divided into one sub-FAT containing 4 clusters based on the non-equal division scheme. Sub-FAT and a sub-FAT containing 6 clusters. The sub-FAT containing 5 clusters requires less memory than the sub-FAT containing 6 clusters. Therefore, dividing the FAT according to the equal partitioning scheme can reduce the number of sub-FATs. Memory required for FAT.

Optionally, clusters included in at least one sub-FAT in the N sub-FATs are clusters with consecutive numbers.

For example, the FAT contains 6 clusters, numbered 2, 3, 4, 5, 6, and 7. The clusters numbered 2, 3, and 4 can be divided into one sub-FAT based on the continuous division scheme, and the numbers are 5, The clusters 6 and 7 are divided into another sub-FAT; the clusters numbered 2, 4, and 6 can be divided into one sub-FAT based on the non-contiguous division scheme, and the clusters numbered 3, 5, and 6 can be divided into another sub-FAT Sub FAT. In the continuous division scheme, the clusters contained in a sub-FAT have a greater probability of belonging to a cluster chain, which can reduce the number of merging cluster chains, thereby reducing the consumption of computing resources.

Optionally, the merging process of the N cluster chain sets to generate a target cluster chain set includes: traversing all cluster chain heads and cluster chain tails in the N cluster linked lists; and merging the N cluster linked lists The cluster chain having an association relationship between the middle cluster chain head and the cluster chain tail generates the target cluster linked list.

Traverse all cluster chain heads and cluster chain tails, and then merge cluster chains with associated relationships, which can prevent multiple sub-cluster chains belonging to a cluster chain from being missed, and improve the success rate of FAT file system repair.

In a second aspect, the present application provides an apparatus for repairing a file system, including a unit for executing the method described in the first aspect. The device can be a terminal device or a server, or a chip in the terminal device or the server. The device may include an input unit and a processing unit.

When the device is a terminal device or a server, the processing unit may be a processor, and the input unit may be a transceiver; the terminal device may also include a storage unit, and the storage unit may be a memory; the storage unit is used to store instructions, The processing unit executes the instructions stored in the storage unit, so that the terminal device or the server executes the method described in the first aspect.

When the device is a chip in a terminal device or a server, the processing unit can be a processing unit inside the chip, and the input unit can be an input/output interface, a pin or a circuit, etc.; the processing unit executes instructions stored in the storage unit , So that the chip executes the method described in the first aspect, the storage unit can be a storage unit (for example, a register, a cache, etc.) in the chip, or a storage unit (for example, a read-only memory) located outside the chip. , Random Access Memory, etc.).

In a third aspect, the present application provides a computer-readable storage medium in which a computer program is stored. When the computer program is executed by a processor, the processor executes the method described in the first aspect.

In a fourth aspect, the present application provides a computer program product, the computer program product comprising: computer program code, when the computer program code is executed by a processor, the processor executes the method described in the first aspect.

Description of the drawings

Figure 1 is a schematic diagram of a FAT file system suitable for this application;

FIG. 2 is a schematic diagram of a method for repairing a file system provided by the present application;

FIG. 3 is a schematic diagram of a method for dividing sub-FAT provided by this application;

Fig. 4 is a schematic diagram of a method for merging linked lists of sub-clusters provided by the present application;

Figure 5 is a schematic diagram of a complete cluster linked list provided by this application;

Fig. 6 is a schematic diagram of another method for merging linked lists of sub-clusters provided by the present application;

FIG. 7 is a schematic diagram of another method for repairing a file system provided by this application;

FIG. 8 is a schematic diagram of a device for repairing a file system provided by the present application;

Fig. 9 is a schematic diagram of a device for repairing a file system provided by the present application.

detailed description

The technical solution in this application will be described below in conjunction with the accompanying drawings.

Figure 1 shows a schematic diagram of a FAT file system suitable for this application.

The FAT file system 100 includes a disk operating system boot record (DBR) 110, a FAT 120, and a data area (DATA) 130.

DBR110 is mainly used to record basic information such as the capacity of a single sector, the total number of sectors, the size of a single FAT, the number of FATs, and the cluster capacity. DRB110 also stores file system information (FSInfo). FSInfo includes available Information such as the number of clusters and the last allocated cluster number.

The FAT file system 100 may be a FAT32 file system, a FAT16 file system or other types of FAT file systems. For the FAT32 file system, a cluster corresponds to 4 bytes of storage space. Even if a file has only one byte, the operating system will allocate a cluster for the file (that is, allocate storage space corresponding to a cluster) Therefore, the cluster is the basic storage unit of the FAT file system.

FAT120 records the cluster chain of all directories and files in the partition.

Large files need to be allocated to multiple clusters. However, a file is not necessarily stored in a continuous area on the disk. It may be divided into several segments and stored like a chain. This storage method is called chain storage, recording One or more clusters of the storage address of a file are cluster chains. In order to achieve chain storage, FAT120 needs to record which clusters are occupied by the file, and the cluster number of the next cluster associated with each occupied cluster; for the last cluster occupied by the file, FAT120 needs to record that the cluster is the last cluster. FAT120 can also record free clusters and bad clusters.

The data area 130 records directory entries and user data.

The FAT file system 100 is an example of a FAT file system applicable to the present application. The FAT file system applicable to the present application may also have other structures, such as a FAT file system including two FATs.

If the data in the DBR110, FAT120, and data area 130 is wrong, the FAT file system 100 may be unreadable and writable, and the FAT file system 100 needs to be repaired.

The following uses the FAT32 file system as an example to introduce the method for repairing the file system provided by this application, and the method can be executed by a processor.

The DBR can be verified first. When verifying the DBR, the processor can read the DBR from the partition into the memory, verify the DBR according to the FAT32 protocol and the hardware characteristics of the partition device, and repair it in the memory if there is an error in the DBR.

After the DBR check is completed, the cluster linked list can be constructed. The method for constructing the cluster linked list is shown in FIG. 2. The method 200 includes the following steps.

S210: Obtain FAT.

S220: Divide the FAT into N sub-FATs, where N is a positive integer greater than 1.

When dividing the FAT, the FAT can be divided equally or unequal. Among them, the divided FAT refers to the way that the number of clusters contained in each sub-FAT is equal. When the number of sub-FATs is determined, the sub-FATs generated by dividing the FAT equally contain fewer clusters.

For example, FAT contains 10 clusters, and N is equal to 2. The FAT can be divided into two sub-FATs containing 5 clusters based on the equal division scheme, or the FAT can be divided into one sub-FAT containing 4 clusters based on the non-equal division scheme. Sub-FAT and a sub-FAT containing 6 clusters. The sub-FAT containing 5 clusters requires less memory than the sub-FAT containing 6 clusters. Therefore, dividing the FAT according to the equal partitioning scheme can reduce the number of sub-FATs. Memory required for FAT.

Figure 3 shows a method of dividing sub-FATs.

In FAT120, each cluster corresponds to 4 bytes of disk space. Starting from the upper left corner of FAT120, F8FFFF0F is cluster 0, FFFFFF0F is cluster 1, and so on, the first row is cluster 0 to cluster 3, the second row is cluster 4 to cluster 7, and the third row is cluster 8. From clusters to cluster 11, the fourth row is from cluster 12 to cluster 15, and the fifth row is cluster 16 and cluster 17. FAT120 records 18 clusters. Among them, cluster 0 and cluster 1 are reserved items, which are fixed starting identifiers of FAT120, and are not referenced by any file. FAT120 can be divided from cluster 2 on.

For example, the remaining clusters can be divided into 2 sub-FATs, and each sub-FAT includes 8 clusters. Among them, clusters with consecutive numbers can be divided into one sub-FAT, as shown by the dotted line in FIG. 3. The two sub-FATs obtained by dividing according to the above method are respectively FAT_0 and FAT_1. FAT_0 includes clusters 2 to 9 and FAT_1 includes clusters 10 to 17. In Figure 3, the numbers in FAT_0 and FAT_1 indicate the cluster number of the next cluster associated with the cluster.

Next, the data corresponding to FAT_0 and FAT_1 are respectively read into the memory, and the memory data is traversed according to the FAT32 protocol to obtain cluster linked list 0 corresponding to FAT_0 and cluster linked list 1 corresponding to FAT_1, that is, execute S230.

S230: Generate N cluster linked lists according to the N sub-FATs.

The following describes how to obtain cluster linked list 0 and cluster linked list 1.

The method of obtaining cluster linked list 0 based on FAT_0 is as follows.

The 2nd cluster FFFFFF0F is the root directory cluster, and the 2nd cluster contains the end of file (EOF) identifier. Therefore, the 2nd cluster alone forms a cluster chain.

No. 3 cluster records the cluster number 0A000000 of the next associated cluster, that is, the next cluster associated with the No. 3 cluster is the No. 10 cluster; However, the No. 10 cluster is not in FAT_0, and the No. 3 cluster is temporarily added to the cluster as a cluster chain Linked list 0.

The next cluster associated with No. 4 cluster 05000000 is cluster No. 5, the next cluster associated with No. 5 cluster 06000000 is cluster No. 6, and the information FFFFFF0F recorded in cluster No. 6 indicates that cluster No. 6 is the tail cluster. 4→5→6 is added to the cluster list 0 as a cluster chain.

The number 7 cluster 00000000 indicates that the cluster is free, and the number 7 cluster is not added to the cluster linked list 0.

The next cluster associated with the 8th cluster 09000000 is the 9th cluster, and the information FFFFFF0F recorded in the 9th cluster indicates that the 9th cluster is the tail cluster. 8→9 is added to the cluster list 0 as a cluster chain.

The method of obtaining cluster linked list 1 based on FAT_1 is as follows.

The next cluster related to cluster 10 0B000000 is cluster 11, the next cluster related to cluster 11 0C000000 is cluster 12, the next cluster related to cluster 12 0D000000 is cluster 13, and the next cluster related to cluster 13 0E000000 The cluster is the 14th cluster, and the FFFFFF0F recorded in the 14th cluster indicates that the 14th cluster is the last cluster of the file. 10→11→12→13→14 is added to the cluster list 1 as a cluster chain.

The next cluster associated with cluster 15 10000000 is cluster 16, and the next cluster associated with cluster 08000000 is cluster 8. However, cluster 8 is not in FAT_1, temporarily add 15→16 as a cluster chain to the cluster list 1 .

The number 17 cluster 00000000 indicates that the cluster is free, and the number 17 cluster is not added to the cluster linked list 1.

After the cluster linked list 0 and the cluster linked list 1 are obtained, the cluster linked list is merged, that is, S240 is executed.

S240, merging the N cluster linked lists to generate a target cluster linked list.

The principle of merging is: traverse all cluster chain heads and cluster chain tails in all cluster linked lists; merge cluster chains with associated cluster chain heads and cluster chain tails in all cluster linked lists to generate a complete cluster linked list.

Figure 4 shows a method of merging cluster linked list 0 and cluster linked list 1.

In cluster linked list 0, cluster 2 no longer has subsequent associated clusters, and cluster 2 is skipped; the next cluster associated with cluster 3 is cluster 10, and cluster linked list 1 contains cluster 10, so cluster 3 is connected to the cluster chain 10→11→12→13→14 to merge, get cluster chain 3→10→11→12→13→14; in cluster chain 4→5→6, cluster 6 is the tail cluster, skip this cluster chain; In the chain 8→9, cluster 9 is the tail cluster, and the cluster chain is skipped.

In the cluster chain table 1, the last cluster of the cluster chain 10→11→12→13→14 is the 14th cluster, and the 14th cluster is the tail cluster, skip this cluster; the last cluster of the cluster chain 15→16 is the 16th cluster , The next cluster associated with the 16th cluster is the 8th cluster, and the cluster linked list 0 contains the 8th cluster, then the cluster chain 15→16 can be merged with the cluster chain 8→9 to obtain the cluster chain 15→16→8→9.

At this point, cluster chain 2, cluster chain 3→10→11→12→13→14, cluster chain 4→5→6, cluster chain 15→16→8→9 constitute a complete cluster linked list (ie, target cluster linked list), As shown in Figure 5.

Taking the storage space of the electronic device as an example, the cluster size of the FAT32 file system is 64KB. If the FAT is not split, the memory size required to generate the cluster linked list can be calculated to be about 8MB according to (128GB/64KB)*4. After the FAT is divided into two, the storage space corresponding to each sub-FAT is 64GB. According to (64GB/64KB)*4, it can be calculated that the memory size required to generate the cluster linked list is about 4MB. Therefore, the method 200 uses a small amount of memory in the process of generating the complete cluster linked list, thereby reducing the cost of the electronic device using the FAT file system.

Optionally, the FAT can also be divided into four equal parts to obtain four sub-FATs, and the cluster linked lists corresponding to the four sub-FATs are merged to generate a complete cluster linked list. As shown in Figure 6, cluster linked list 0 is generated based on FAT_0, cluster linked list 1 is generated based on FAT_1, cluster linked list 2 is generated based on FAT_2, and cluster linked list 3 is generated based on FAT_3; then, cluster linked list 0, cluster linked list 1, cluster linked list 2 and clusters are traversed All cluster chain heads and cluster chain tails in linked list 3 are combined with cluster chains that have an association relationship.

Taking the storage space of the electronic device as an example, the cluster size of the FAT32 file system is 64KB. After the FAT is divided into two, the storage space corresponding to each sub-FAT is 32GB. According to (32GB/64KB)*4, the cluster linked list can be calculated and generated. The required memory size is approximately 2MB.

After generating the target cluster linked list, the processor can perform the following steps.

S250: Repair the FAT file system according to the target cluster linked list.

The directory entry tree can be constructed, the directory entry tree is corrected according to the target cluster linked list, the target cluster linked list is corrected according to the directory entry tree, the DBR, the target cluster linked list and the directory entry tree are written back to complete the repair of the FAT file system. The process is shown in Figure 7. The method of repairing the FAT file system based on the target cluster linked list is described in detail below.

The directory entry is the description information of the file, and the name, creation time, file type (file or directory), starting cluster number, size and other information of the file are recorded in the directory entry. Starting from the root directory, all directory items are traversed to obtain a tree structure, that is, a directory item tree, where each node in the directory item tree is a directory item.

Then the directory entry tree is traversed, and if the directory entry does not match the corresponding cluster chain, the directory entry is repaired according to the cluster chain. For example: the cluster size is 64KB, the starting cluster number is 5, and the size of the directory entry with the size of 183KB matches the cluster chain head is 5, and the length is 2 cluster chains; the cluster chain shows that the file size is 128K (64*2), and the directory entry records The file size of 183KB indicates that the file system is damaged. You can modify the file size information of the directory entry to 128KB.

After the previous check, if the cluster chain in the target cluster linked list does not have a matching directory entry, the cluster chain is deleted from the target cluster linked list to complete the repair of the cluster chain.

Finally, according to the agreement, the repaired DBR, cluster chain and directory entries are written back to the partition.

The example of the method for repairing the file system provided by this application is described in detail above. It can be understood that, in order to realize the above-mentioned functions, the corresponding device includes a hardware structure and/or software module corresponding to each function. Those skilled in the art should easily realize that in combination with the units and algorithm steps of the examples described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or computer software-driven hardware depends on the specific application and design constraint conditions of the technical solution. Professional technicians can use different methods for each specific application to realize the described functions, but such realization should not be considered as going beyond the scope of this application.

The present application may divide the device for repairing the file system into functional units according to the foregoing method examples. For example, each function may be divided into each functional unit, or two or more functions may be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or software functional unit. It should be noted that the division of units in this application is illustrative, and is only a logical function division, and there may be other division methods in actual implementation.

Fig. 8 shows a schematic structural diagram of an apparatus for repairing a file system provided by the present application. The device 700 includes a processing unit 810.

The processing unit 810 is configured to: obtain the FAT; divide the FAT into N sub-FATs, where N is a positive integer greater than 1; generate N cluster linked lists according to the N sub-FATs; merge the N cluster linked lists Generate a target cluster linked list; repair the FAT file system according to the target cluster linked list.

Optionally, the number of clusters included in the N sub-FATs is the same.

Optionally, the processing unit 810 is specifically configured to: traverse all cluster chain heads and cluster chain tails in the N cluster linked lists; merge cluster chain heads and cluster chain tails in the N cluster linked lists that have an associated relationship Cluster chain, generating the target cluster linked list.

For the specific manner of the method for repairing the file system performed by the apparatus 800 and the beneficial effects produced, refer to the related description in the method embodiment.

Fig. 9 shows a schematic structural diagram of a device for predicting the state of a node provided by the present application. The dotted line in Figure 9 indicates that the unit or the module is optional. The device 900 may be used to implement the methods described in the foregoing method embodiments. The device 900 may be a terminal device or a server or a chip.

The device 900 includes one or more processors 901, and the one or more processors 901 can support the device 900 to implement the method in the method embodiment. The processor 901 may be a general-purpose processor or a special-purpose processor. For example, the processor 901 may be a central processing unit (CPU). The CPU can be used to control the device 900, execute a software program, and process data of the software program. The device 900 may also include a communication unit 905 to implement input (reception) and/or output (transmission) of signals (such as FAT).

For example, the device 900 may be a chip, and the communication unit 905 may be an input and/or output circuit of the chip, or the communication unit 905 may be a communication interface of the chip, and the chip may be used as a terminal device or a network device or other electronic device. component.

For another example, the device 900 may be a terminal device or a server, and the communication unit 905 may be a transceiver of the terminal device or the server, or the communication unit 905 may be a transceiver circuit of the terminal device or the server.

The device 900 may include one or more memories 902, on which a program 904 is stored. The program 904 can be run by the processor 901 to generate an instruction 903, so that the processor 901 executes the method described in the foregoing method embodiment according to the instruction 903. Optionally, the memory 902 may also store data (such as a file corresponding to FAT). Optionally, the processor 901 may also read data stored in the memory 902. The data may be stored at the same storage address as the program 904, and the data may also be stored at a different storage address from the program 904.

The processor 901 and the memory 902 may be provided separately or integrated together, for example, integrated on a system-on-chip (SOC) of the terminal device.

For the specific manner in which the processor 901 executes the method embodiment, reference may be made to the related description in the method embodiment.

It should be understood that each step of the foregoing method embodiment may be completed by a logic circuit in the form of hardware or instructions in the form of software in the processor 901. The processor 901 may be a CPU, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable logic devices , For example, discrete gates, transistor logic devices, or discrete hardware components.

This application also provides a computer program product, which, when executed by the processor 901, implements the method described in any method embodiment in this application.

The computer program product may be stored in the memory 902, for example, a program 904. The program 904 is finally converted into an executable object file that can be executed by the processor 901 through processing processes such as preprocessing, compilation, assembly, and linking.

The present application also provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a computer, the method described in any method embodiment in the present application is implemented. The computer program can be a high-level language program or an executable target program.

The computer-readable storage medium is, for example, the memory 902. The memory 902 may be a volatile memory or a non-volatile memory, or the memory 902 may include both a volatile memory and a non-volatile memory. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (programmable ROM, PROM), an erasable programmable read-only memory (erasable PROM, EPROM), a Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory. The volatile memory may be random access memory (RAM), which is used as an external cache. By way of exemplary but not restrictive description, many forms of RAM are available, such as static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), and synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (synchlink DRAM, SLDRAM) ) And direct memory bus random access memory (direct rambus RAM, DR RAM).

Those skilled in the art can clearly understand that, for the convenience and conciseness of description, the specific working process and technical effects of the devices and equipment described above can refer to the corresponding processes and technical effects in the foregoing method embodiments. Here, No longer.

In the several embodiments provided in this application, the disclosed system, device, and method may be implemented in other ways. For example, some features of the method embodiments described above may be ignored or not implemented. The device embodiments described above are merely illustrative. The division of units is only a logical function division. In actual implementation, there may be other division methods, and multiple units or components may be combined or integrated into another system. In addition, the coupling between the various units or the coupling between the various components may be direct coupling or indirect coupling, and the foregoing coupling includes electrical, mechanical, or other forms of connection.

In the various embodiments of the present application, the size of the sequence number does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present application. .

In addition, the term "and/or" in this article is only an association relationship describing associated objects, which means that there can be three types of relationships, for example, A and/or B, which can mean that A alone exists, and both A and B exist. , There are three cases of B alone. In addition, the character "/" in this text generally indicates that the associated objects before and after are in an "or" relationship.

In short, the above descriptions are only preferred embodiments of the technical solutions of the present application, and are not used to limit the protection scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the principles of this application shall be included in the protection scope of this application.

Claims

A method for repairing a file system, which is characterized in that it comprises:

Obtain the file allocation table FAT;

Divide the FAT into N sub-FATs, where N is a positive integer greater than 1;

Generating N cluster linked lists according to the N sub-FATs;

Merging the N cluster linked lists to generate a target cluster linked list;

Repair the FAT file system according to the target cluster linked list.
The method according to claim 1, wherein the number of clusters included in the N sub-FATs is the same.
The method according to claim 1 or 2, wherein the clusters contained in at least one sub-FAT in the N sub-FATs are clusters with consecutive numbers.
The method according to any one of claims 1 to 3, wherein the merging of the N cluster chain sets to generate a target cluster chain set comprises:

Traverse all cluster chain heads and cluster chain tails in the N cluster linked lists;

Combining cluster chains in the N cluster linked lists with cluster chain heads and cluster chain tails in an associated relationship to generate the target cluster linked list.
A device for repairing a file system is characterized by comprising a processing unit for:

Obtain the file allocation table FAT;

Divide the FAT into N sub-FATs, where N is a positive integer greater than 1;

Generating N cluster linked lists according to the N sub-FATs;

Merging the N cluster linked lists to generate a target cluster linked list;

Repair the FAT file system according to the target cluster linked list.
The device according to claim 5, wherein the number of clusters included in the N sub-FATs is the same.
The device according to claim 5 or 6, wherein the clusters contained in at least one sub-FAT in the N sub-FATs are clusters with consecutive numbers.
The device according to any one of claims 5 to 7, wherein the processing unit is specifically configured to:

Traverse all cluster chain heads and cluster chain tails in the N cluster linked lists;

Combining cluster chains in the N cluster linked lists with cluster chain heads and cluster chain tails in an associated relationship to generate the target cluster linked list.
A device for repairing a file system, characterized in that the device includes a processor and a memory, the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory so that all The device executes the method of any one of claims 1 to 4.
A computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the processor executes any one of claims 1 to 4 Methods.