CN117271440A - File information storage method, reading method and related equipment based on freeRTOS - Google Patents

Abstract

The embodiments of this application disclose a file information storage method, reading method and related equipment based on freeRTOS, which relate to the field of file information storage. This application determines the size of the target file based on the size and number of the sub-file set; divides the target file into files Head storage area, file name index storage area, file information storage area and text storage area, determine the text offset and the offset of the sub-file information storage area based on the information of each sub-file, making the entire file structure compact and avoiding the use of LittleFS Wasted space in the file system. Furthermore, the storage order of each sub-file is determined by taking the remainder of the hash value of the sub-file name and the number of sub-files, and by storing the offset of the colliding sub-file information in the file information storage area, so that the file structure is Simple, through the linkage of the file name index area and the file information storage area, storage and reading are more convenient and the storage and reading efficiency is improved.

Description

A freeRTOS file information storage method, reading method and related equipment

Technical field

This application relates to the field of file information storage, and in particular to a file information storage method, reading method and related equipment based on freeRTOS.

Background technique

With the miniaturization of devices, people's requirements for operating systems are getting higher and higher. In the embedded field, embedded real-time operating systems are becoming more and more widely used. Using an embedded real-time operating system (RTOS) can make more reasonable and effective use of CPU resources, simplify the design of application software, shorten system development time, and better ensure the real-time and reliability of the system.

However, the freeRTOS operating system does not have a file system by default, and the data is stored directly in flash. In order to facilitate application development, a third-party file system can be transplanted. The more commonly used one is LittleFS. However, under littleFS, the block size is usually a fixed size, usually 4KB. Even if the file content is only 1KB, the file system will allocate 4KB of space, resulting in a waste of 3KB of space. If there are particularly many files to be stored, the waste of space will be even greater. . For example, when the files stored are all 1KB, it will cause a waste of space of 3KB × the number of files, which is fatal for devices with small storage space.

For non-embedded systems or servers, there is also a need to merge files. However, these systems pay more attention to the reading speed and do not need to consider the issue of storage space. Usually, a separate index is created. When it is necessary to read, the storage location of the target file is first searched through the index and returned to the system. The system fetches the corresponding data from the data pool based on the storage location.

Therefore, there is an urgent need for a method of merging file structures and corresponding file information storage to solve the existing problems of low space utilization and low reading and writing efficiency under littleFS.

Contents of the invention

The embodiments of this application provide a file information storage method, reading method and related equipment based on freeRTOS. Multiple files can be merged and stored in this merged file, and the file content can be quickly and accurately located through the file name and read out. .

On the one hand, embodiments of the present application provide a method for storing file information based on freeRTOS. The method includes:

Screen and determine multiple sub-files to obtain a set of sub-files to be processed;

Determine the size of the target file based on the size of the sub-file set and the number of sub-files;

Divide the storage space of the target file into a file header storage area, a file name index storage area, a file information storage area and a text storage area;

Determine the storage areas of the file header storage area and the file name index storage area;

Write the file header information in the file header storage area;

Initialize the file name index storage area and file information storage area;

Determine the file information storage offset of each sub-file of the sub-file set in turn, and update the file name index storage area information;

Write and update the file information storage area and write each sub-file into the text storage area.

Further, the file header information includes a target file identifier, the number of sub-files, a text offset, and a check digit. The file header information written into the file header storage area includes:

Write target file identifier information and sub-file number information;

The text offset is calculated based on the number of sub-files and the length of each sub-file name;

Write text offset information;

Write verification information to the target file.

Further, determining the file information storage offset of each sub-file of the sub-file set in turn, and updating the file name index storage area information includes:

Extract the file name of the current sub-file, and perform hash calculation on the file name of each sub-file to obtain the hash value of each sub-file name;

Find the remainder of the current subfile name hash value and the number of said subfiles;

Determine the location of the current sub-file name index area and the offset of the current sub-file information storage area based on the remainder result;

Write the offset of the current sub-file information storage area to update the corresponding file name index area information.

Further, writing and updating the file information storage area and writing each sub-file into the text storage area includes:

Determine and obtain the text offset of the current subfile based on the remainder result of the current subfile;

Determine the storage area of the current sub-file information according to the offset of the current sub-file information storage area;

Write the subfile name size, subfile size, subfile text offset, and subfile name to the current subfile information storage area;

Move the current subfile to the current subfile text offset area and write to the current subfile.

Further, the file information storage area also includes an offset of the next sub-file information in a hash collision, and the method further includes:

Determine whether there is a collision in the remainder result of the current sub-file;

If it exists, redetermine the text offset of the offset of the current subfile file information storage area;

Write the file information offset update of the current subfile to the offset of the next subfile information against the hash of the previous file.

Further, the method includes:

Extract the file name of each sub-file, and perform hash calculation on the file name of each sub-file to obtain the hash value of each sub-file name;

Calculate the remainder of the hash value of each sub-file name and the number of said sub-files;

Sort the remainder results corresponding to each of the sub-files;

Obtain the storage order of each sub-file according to the sorting result;

According to the storage order of each sub-file, the file name index storage area information is updated one by one, and the file information storage area and text storage area are written and updated one by one.

The second aspect of this application provides a method for reading file information based on freeRTOS. The method includes:

Get the subfile name to be read;

Calculate the hash value according to the sub-file name to obtain the position of the file in the file name index area;

Obtain the storage offset of the corresponding file information area according to the position of the file name index area;

Get the text offset and file size of the current subfile based on the offset of the file information area;

According to the text offset and file size of the current sub-file, locate the sub-file text position and read the sub-file text information according to the file size.

Further, obtaining the text offset and file size of the current subfile based on the storage offset of the file information area includes:

Positioning based on the storage offset of the file information area;

Determine whether the file names are the same. If they are the same, read the text offset information and file size information;

If they are not the same, obtain the current file information area to obtain the offset information of the next sub-file information of the hash collision, and loop to find the next file information area information until the current sub-file text offset and file size are found.

A third aspect of the present application provides a computer device, including a memory and a processor. The memory stores a computer program. The feature is that the processor implements the foregoing method steps when executing the computer program.

A fourth aspect of the present application provides a computer-readable storage medium that stores a computer program. When the computer program is executed by a processor, it causes the processor to execute to implement the foregoing method steps.

In each embodiment of the present application, multiple files are merged and stored in this merged file, and the file content is quickly and accurately located and read through the file name, which reduces the waste of storage space and improves the efficiency of reading and writing. efficiency. Specifically, by changing the file structure, changing the storage and reading method of file information, the size of the target file is determined according to the size and number of sub-file sets; and the target file is divided into a file header storage area, a file name index storage area, and a file name index storage area. The information storage area and the text storage area determine the text offset and the offset of the sub-file information storage area based on the information of each sub-file, making the entire file structure compact, and each file is arranged in order, avoiding the problem of using the LittleFS file system. More space wasted. Further, each embodiment of the present application determines the storage order of each sub-file by taking the remainder of the hash value of the sub-file name and the number of sub-files, and stores the offset of the colliding sub-file information in the file information storage area , the file structure is concise, and there is no need to separately save the index table of file name-related information and storage location. Through the linkage of the file name index area and the file information storage area, storage and reading are made more convenient. The target file uses the hash value of the file name to calculate the location, which can quickly locate the specific location of the sub-file, reduce the number of searches, and speed up access to the sub-file.

Description of the drawings

The drawings forming a part of this application are used to provide a further understanding of the present invention. The illustrative embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention.

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can also be obtained based on these drawings without exerting creative efforts.

Figure 1 is a flow chart of a freeRTOS file information storage method provided by an embodiment of the present application;

Figure 2 is a flow chart of a method for reading file information based on freeRTOS provided by an embodiment of the present application.

Detailed ways

The embodiment of this application proposes a method for storing file information based on freeRTOS. Multiple files are merged and stored in this merged file, and the file content is quickly and accurately located and read through the file name, that is, the storage space is reduced. Waste and improve the efficiency of reading and writing. Specifically, by changing the file structure, changing the storage and reading method of file information, the size of the target file is determined according to the size and number of sub-file sets; and the target file is divided into a file header storage area, a file name index storage area, and a file name index storage area. The information storage area and the text storage area determine the text offset and the offset of the sub-file information storage area based on the information of each sub-file, making the entire file structure compact, and each file is arranged in order, avoiding the problem of using the LittleFS file system. More space wasted.

Further, each embodiment of the present application determines the storage order of each sub-file by taking the remainder of the hash value of the sub-file name and the number of sub-files, and stores the offset of the colliding sub-file information in the file information storage area , the file structure is concise, and there is no need to separately save the index table of file name-related information and storage location. Through the linkage of the file name index area and the file information storage area, storage and reading are made more convenient.

The file information storage method provided by the embodiment of the present application will be introduced below with reference to the accompanying drawings.

Please refer to Figure 1. Figure 1 is a flow chart of a file information storage method provided by an embodiment of the present application. As shown in Figure 1, the data processing method includes the following steps S1-S8.

S1. Screen and determine multiple sub-files to obtain a set of sub-files to be processed;

FreeRTOS is a mini real-time operating system kernel. As a lightweight operating system, its functions include: task management, time management, semaphores, message queues, memory management, recording functions, software timers, coroutines, etc., which can basically meet the needs of smaller systems. In FreeRTOS, the commonly used file system is LittleFS. Although LittleFS has the advantages of power failure recovery, erase and write balancing, etc., it also has obvious shortcomings. The space utilization of LittleFS is subject to certain limitations. The block size of LittleFS determines the smallest unit of file storage; the larger the block, the more likely it is that space will be wasted. For example, if the block size is 32K, even if the file content is only 1KB, LittleFS will allocate 32K space for it, resulting in a waste of 31K space. Even now, the minimum block size of LittleFS is 4K. When the file content is only 1KB, there is still a lot of waste.

It is understandable that FreeRTOS usually stores a large number of sub-files. These sub-files can be system sub-files, sub-files stored by users, or application fragment files, etc. The file sizes of these sub-files are different. If the existing LittleFS file system is used, it will cause a large waste of space. Therefore, in this embodiment, by adopting the file storage method of the present application, the above defects can be overcome.

This application filters multiple sub-files to obtain a set of sub-files to be processed. It can be understood that this application does not use the file storage method of this application for all sub-files. Since the block size is specified in LittleFS, when the size of the data file is the same as the block size specified in LittleFS, the data file can make full use of storage resources and will not waste resources. Therefore, in this embodiment, a set of sub-files to be processed is obtained by analyzing and filtering multiple sub-files, and the set of sub-files to be processed adopts the file storage method of the present application.

In one embodiment, multiple sub-files can be filtered based on their data size. Specifically, the file sizes of multiple sub-files are extracted, and the remainder of the file size and the block size specified in LittleFS is calculated. If the remainder meets the preset conditions, the corresponding sub-files are filtered and used as sub-files to be processed. For example, the block size specified in LittleFS can be 4K, and the preset condition can be that the remainder is not equal to 0. Then during the filtering process, sub-files whose file size is not equal to an integer multiple of 4 will be filtered and form sub-files to be processed. File set. It can be understood that the preset condition is that the remainder is not equal to 0, which is just one of the implementation methods. The preset condition can also be that the remainder is less than the preset threshold. The threshold can be set according to the block size specified in LittleFS, such as the block size. half or three-quarters. This filtering condition is to filter out the sub-files that will cause serious waste of storage space to form a set of sub-files to be processed, and use the file information storage method of this application to avoid the set of sub-files to be processed, which will cause a waste of storage space.

S2. Determine the size of the target file according to the size of the sub-file set and the number of sub-files;

The target file is a merged file finally generated by using the file information storage method of this application. In this embodiment, the target file stores relevant data of the sub-file set. Therefore, the size of the target file is determined based on the size of the sub-file set and the number of sub-files.

S3. Divide the storage space of the target file into a file header storage area, a file name index storage area, a file information storage area and a text storage area.

Because the target file is a merged file finally generated by using the file information storage method of this application. It needs to store relevant data of the sub-file set, and the target file must also contain corresponding identification information and index information so that the system can find the required sub-files.

Therefore, in one embodiment of the present application, the storage space of the target file is divided into a file header storage area, a file name index storage area, a file information storage area, and a text storage area. The file header storage area is the file header of the target file, which stores relevant file header information. Specifically, the file header information includes: a 4-byte file identifier, a 2-byte sub-file number, a 4-byte text offset data, and a 1-byte check byte. The file identifier is used to identify the target file, allowing the system to quickly identify the target file; the number of sub-files is used to represent the number of sub-files stored in the target file; the text offset data is the text stored in the target file The offset value of the area; the check byte is used to verify the target file. It can be understood that each part of the file header information is only an example, and it can be modified according to needs and actual conditions.

In one embodiment of the present application, the file name index storage area and the file information storage area are used to jointly complete the file indexing function, realizing a coarse-fine file indexing function, which not only reduces the storage space occupied by the index area, but also ensures indexing efficiency. The file name index storage area is used to store the offset of the file information storage area. One or several specific sub-files can be quickly located through the offset of the file information storage area. The file information storage area stores detailed information of each sub-file, including: 1-byte sub-file name length, 4-byte sub-file text offset, 4-byte sub-file length and sub-file name. When a file needs to be read, one or several specific sub-files can be quickly located through the offset in the file information storage area, and the sub-file text offset can be obtained through the specific file information in the located file information storage area. You can accurately locate the required sub-file data from the file text storage area. It can be seen from the above that in this application, the file name of each sub-file is not simply extracted, and the file name is directly stored to record its storage location; although the required sub-file can be found in this way, the efficiency is low. In this application, a file name index storage area and a file information storage area are set up in the target file, and the information in the two areas is used to jointly complete the file index function, thereby realizing a coarse-fine file index function. Through the relevant information of the file name Accurately locate the file information and obtain accurate file information from the file information storage area. Based on the obtained file information, complete data of the sub-file is obtained from the file text storage area; this not only reduces the storage space occupied by the index area, but also ensures improve indexing efficiency.

For example, the file structure of the target file in this embodiment is as shown in the following table:

The file header storage area, file name index storage area, file information storage area and text storage area respectively reserve corresponding storage space according to the above table to facilitate subsequent information update and writing.

S4. Determine the storage areas of the file header storage area and the file name index storage area;

This embodiment is a file information storage method based on freeRTOS. After filtering out the sub-file set to be processed, and determining the size of the target file based on the size of the sub-file set and the number of sub-files, it is necessary to calculate the size of each area of the target file. And reserve the corresponding space for subsequent writing of files to the corresponding area.

In one embodiment of the present application, the file header storage area stores the file header of the target file. Specifically, the file header information includes: a 4-byte file identifier, a 2-byte sub-file number, a 4-byte text offset data, and a 1-byte check byte. The file name index storage area is used to store the offset of the file information storage area. The space occupied by it is the number of sub-files x 4 bytes. The space required by these two parts is fixed. When the sub-file set is determined, the storage areas of the file header storage area and the file name index storage area can be determined and reserved. As for the offset value within the two areas, it can be filled in after subsequent determination.

S5. Write the file header information in the file header storage area;

After determining the storage area of the file header storage area and the file name index storage area of the target file, the file header information can be written. The file header information includes the target file identifier, the number of sub-files, the text offset, and the check digit. The written target file header information includes: the written target file identifier information and the sub-file number information; according to the number of sub-files and each The length of the subfile name is calculated to obtain the text offset; the text offset information is written; and the target file verification information is written. The file identifier, number of sub-files and verification information in the file header information can be written after the sub-file set is determined. In this way, a part of the preset data can be pre-written before a large number of files are written, thereby reducing the pressure of subsequent data writing.

S6. Initialize the file name index storage area and file information storage area;

After filtering out the sub-file set to be processed, and determining the size of the target file based on the size of the sub-file set and the number of sub-files, it is necessary to calculate the size of each area of the target file and reserve the corresponding space for subsequent writing of the file. to the corresponding area. The space required by the file name index storage area and file information storage area is fixed. When the sub-file set is determined, the storage areas of the file header storage area and file name index storage area can be determined and reserved, and for To prevent other irrelevant data from being stored in the reserved space, the file name index storage area and file information storage area need to be initialized before writing data.

S7. Determine the file information storage offset of each sub-file of the sub-file set in sequence, and update the file name index storage area information;

Analyze each sub-file in the sub-file set, and determine the storage space required for the file information storage area, the storage location of each sub-file in the file name index storage area, and The offset of the file information storage area; update the offset of the file information storage area to the corresponding position of the sub-file name index storage area.

Specifically, extract the file name of the current sub-file, perform hash calculation on the file name of each sub-file to obtain the hash value of each sub-file name; calculate the remainder of the hash value of the current sub-file name and the number of the sub-files. ; Determine the location of the current sub-file name index area and the offset of the current sub-file information storage area based on the remainder result; write the offset of the current sub-file information storage area to update the corresponding file name index area information. In this embodiment, the storage space of the file name index storage area is reserved according to the number of sub-files. The reserved space is the number of sub-files × 4 bytes to ensure that all sub-file related information can be stored in the sub-file name. Index storage area and file information storage area. By hashing the file name of the sub-file and finding the remainder of the number of sub-files, the location where it is stored in the file name index storage area and the file information storage area is determined, so that the sub-file can be quickly found when the sub-file needs to be found later. location and locate its location in the file body storage area.

S8. Write and update the file information storage area and write each sub-file into the text storage area.

After determining the position of the current sub-file name index area and the offset of the current sub-file information storage area according to the remainder result, the relevant information of the sub-file, such as the length of the sub-file name, the offset of the sub-file body, the length of the sub-file, the Information such as the file name is written to the corresponding location in the file information storage area; and the sub-file data is stored in the file text storage area.

Specifically, the offset of the current sub-file text is determined based on the remainder of the current sub-file; the storage area of the current sub-file information is determined based on the offset of the current sub-file information storage area; the sub-file name size, sub-file size, sub-file information storage area are determined. The file text offset and sub-file name are written to the current sub-file information storage area; the current sub-file is moved to the current sub-file text offset area and written to the current sub-file. It can be understood that the remainder result of the sub-file directly determines its storage location. According to its storage location, the corresponding information is written into the file name index storage area, file information storage area and file text storage area; the storage space of each area Reservations have been made for sub-file sets, which ensures compact writing of each sub-file and avoids the waste of space caused by the fixed 4K block size in the existing technology.

Since the file names of sub-files are different, the hash values after hashing are also different. However, in the embodiment of this application, the hash value is modulated by the number of sub-files, then there will be two or The calculation result of multiple sub-files is the same. In response to the above situation, this application proposes further solutions.

In one embodiment of the present application, the file information storage area also includes an offset of the sub-file information next to the hash collision, and 4 bytes of space can be allocated for this offset. After obtaining the sub-file remainder result, the method of this application analyzes the result to determine whether there is a collision in the current sub-file remainder result. Collision can be understood as having two or more sub-files with the same calculation results. If there is a collision, re-determine the text offset of the offset of the current sub-file file information storage area; write the file information offset update of the current sub-file to the hash of the previous file to collide with the offset of the next sub-file information. . When writing data, by judging the collision, the sub-file information is written to the target file more reasonably, so that when the file is read, the required file can be found accurately and quickly through the rough-to-fine positioning method. data. It can be understood that in this embodiment, the colliding sub-files are stored in adjacent positions in the file information storage area and the file text storage area, and share the same storage area in the file name index storage area. Use The file information offset value of the first subfile that stores the collision subfile.

Furthermore, this application also includes another embodiment. During the file writing process, this application can analyze each sub-file of the filtered sub-file set to be processed, extract the file name of each sub-file, and perform hash calculation on the file name of each sub-file to obtain each sub-file. File name hash value; calculate the remainder of each sub-file name hash value and the number of the sub-files; sort the remainder results corresponding to each sub-file; obtain the storage order of each sub-file according to the sorting result ; According to the storage order of each sub-file, update the file name index storage area information one by one, and write and update the file information storage area and text storage area one by one. Further, when sorting the remainder results corresponding to each sub-file, if there are multiple files with the same remainder results, the file priority or access frequency of the sub-files with the same remainder results can be further obtained. information to further sort it. In this embodiment, by performing unified analysis on each sub-file in the sub-file set, extracting the file name of each sub-file, and calculating the remainder of the hash value of the sub-file name and the number of the sub-files, each sub-file can be analyzed The sub-files are sorted by their storage locations in the target file, and storage space in each area is reserved based on the sorting results, and corresponding data is written into the target file. Moreover, in this embodiment, since the target file includes a file name index storage area and a file information storage area, the remainder of the sub-file is used to read the offset value of the file information stored in the file name index storage area, and then through the file The information storage area further locates the sub-file essay offset; however, when there is a collision, there is more than one file information corresponding to the offset value of the file information. If the file information in the front does not match, it needs to be collided through a hash The offset of one sub-file information is positioned to the next file information. If there are many colliding files, reading will be slow. In this embodiment, information such as file priority or access frequency of sub-files with the same remainder result is obtained, and they are further sorted so that important or frequently accessed sub-files are arranged at a higher position. When the file is read, When fetching, it can be read first, which improves reading and writing efficiency.

Further, after calculating the remainder of each sub-file, it is determined whether a collision occurs. If the number of collisions meets the preset conditions, the structure of the file name index storage area is changed and the remainder-file information offset value mapping relationship is adopted. In this way, it is only necessary to reserve some storage space for the file name index storage area (not yet The number of collision sub-files + the number of different remainders of collision sub-files) × 6 bytes, of which 4 bytes are used to store the offset value of the file information, and 2 bytes are used to store the individual sub-files. number. The preset condition can be that the number of collisions reaches a certain proportion, such as 50%, etc. If the preset condition is met, it means that most of the sub-file information will collide. For example, when there are 100 sub-files in the set of sub-files that need to be stored, after hashing the file names and finding the remainder from the number of files, the possible results are 30 sub-files without collision, 70 sub-files with collision, and 70 Among them, 40 sub-files have a remainder of 2, and 30 sub-files have a remainder of 3. If the storage structure in the previous embodiment is adopted, (100) × 4 bytes of storage space need to be reserved for the file name index storage area. Using the method of this embodiment only requires (30+2) to be reserved for the file name index storage area. )×6 bytes of storage space. By analyzing the collision situation and combining the analysis results, the specific structure of the file name index storage area is determined to reserve corresponding storage space, so that the storage space occupied by the file name index storage area is minimized.

Furthermore, in this embodiment, each sub-file in the sub-file set is analyzed in advance. Therefore, the file structure of the target file can be further optimized based on the analysis results. For sub-files that have not collided, the offset information of the next sub-file information in the hash collision in the file information storage area can be deleted to save more resources.

In one embodiment, referring to Figure 2, this application also provides a method for reading file information based on freeRTOS. The method includes:

Get the subfile name to be read;

Calculate the hash value according to the sub-file name to obtain the position of the file in the file name index area;

Obtain the storage offset of the corresponding file information area according to the position of the file name index area;

Get the text offset and file size of the current subfile based on the offset of the file information area;

According to the text offset and file size of the current sub-file, locate the sub-file text position and read the sub-file text information according to the file size.

It can be seen that since the target file adopts the above structure, when reading the file, the sub-file can be roughly positioned by taking the remainder of the hash value of the sub-file name and the number of files in the target file. After obtaining After the subfile is located in the file name index area, the text offset and file size of the current subfile are obtained through the storage offset of the corresponding file information area, and then the text position of the subfile is located and the file size is determined. Read the sub-file text information. In this way, when a subfile needs to be read, the required subfile data can be found quickly and accurately.

Further, since there may be a collision, the method of obtaining the text offset and file size of the current subfile based on the storage offset of the file information area includes:

Positioning based on the storage offset of the file information area;

Determine whether the file names are the same. If they are the same, read the text offset information and file size information;

If they are not the same, obtain the current file information area to obtain the offset information of the next sub-file information of the hash collision, and loop to find the next file information area information until the current sub-file text offset and file size are found. The target file uses the hash value of the file name to calculate the location, which can quickly locate the specific location of the sub-file, reduce the number of searches, and speed up access to the sub-file.

Correspondingly, an exemplary embodiment of the present application also provides a computer device, including: a processor, a memory, a network interface, an input device, and an output device; the processor is connected to the memory and the network interface, where the network interface is used to provide Network communication function, the memory is used to store program code, the input device is used to receive input instructions to generate signal input related to the setting and function control of the computer device, the output device is used to output data information, and the processor is used to call the program Code to execute the data storage or reading methods in the embodiments of this application.

In addition, it should also be noted that an exemplary embodiment of the present application also provides a computer-readable storage medium, which stores a computer program. The computer program includes program instructions. When one or more processors load and execute The program instructions can realize the description of the foregoing data storage or reading method in the embodiment, which will not be described again here. The description of the beneficial effects of using the same method will not be described again here. It will be appreciated that the program instructions may be deployed and executed on one or multiple computer devices capable of communicating with each other.

The above-mentioned computer-readable storage medium may be an internal storage unit of the data storage or reading method provided in any of the foregoing embodiments, such as a hard disk or memory of a computer device. The computer-readable storage medium can also be an external storage device of the computer device, such as a plug-in hard disk, a smart memory card (SMC), a secure digital (SD) card, or a flash memory equipped on the computer device. flash card, etc. Further, the computer-readable storage medium may also include both an internal storage unit of the computer device and an external storage device. The computer-readable storage medium is used to store the computer program and other programs and data required by the computer device. The computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

The steps in the methods of the embodiments of this application can be sequence adjusted, combined, and deleted according to actual needs.

Modules in the device of the embodiment of the present application can be merged, divided, and deleted according to actual needs.

What is disclosed above is only some of the embodiments of the present application. Of course, it cannot be used to limit the scope of rights of the present application. Those of ordinary skill in the art can understand all or part of the processes for implementing the above embodiments and make decisions according to the claims of the present application. Equivalent changes still fall within the scope of the invention.

Claims (10)

1. A freeRTOS file information storage method, the method comprising:

screening and determining a plurality of subfiles to obtain a subfile set to be processed;

determining the size of the target file according to the size of the sub-file set and the number of the sub-files;

dividing the storage space of the target file into a file header storage area, a file name index storage area, a file information storage area and a text storage area;

determining storage areas of the file header storage area and the file name index storage area;

writing file header information in the file header storage area;

initializing the file name index storage area and the file information storage area;

sequentially determining file information storage offset of each sub-file of the sub-file set, and updating the file name index storage area information;

writing and updating the file information storage area and writing each sub-file into the text storage area.

2. The method of claim 1, wherein the header information includes a target file identifier, a number of subfiles, a body offset, and a check bit, and wherein writing the header information in the header storage area includes:

writing target file identifier information and sub-file quantity information;

calculating to obtain text offset according to the number of subfiles and the length of each subfile name;

writing text offset information;

and writing verification information of the target file.

3. The method of claim 1, wherein sequentially determining file information storage offsets for each subfile of the set of subfiles and updating the file name index storage area information comprises:

extracting the file name of the current sub-file, and carrying out hash calculation on the file name of each sub-file to obtain hash values of each sub-file name;

the hash value of the current sub-file name is calculated and calculated with the number of the sub-files;

determining the position of the index area of the current sub-file name and the offset of the information storage area of the current sub-file according to the residual result;

and writing the offset of the current sub-file information storage area into and updating the corresponding file name index area information.

4. A method according to claim 3, wherein writing the updated file information storage area and writing each subfile to the body storage area comprises:

determining and obtaining the text offset of the current subfile according to the residual result of the current subfile;

determining a storage area of the current sub-file information according to the offset of the current sub-file information storage area;

writing the sub-file name size, the sub-file text offset and the sub-file name into a current sub-file information storage area;

and moving the current sub-file to the text offset area of the current sub-file, and writing the current sub-file.

5. The method of claim 4, wherein the file information storage area further includes an offset for hash collision of next subfile information, the method further comprising:

judging whether collision exists in the residual result of the current subfile;

if the sub file exists, the text offset of the current sub file information storage area is redetermined;

and updating the file information offset of the current sub-file, and writing the file information offset of the current sub-file into the hash of the previous file to collide with the offset of the next sub-file information.

6. The method according to any one of claims 1-5, characterized in that the method comprises:

extracting the file names of all the subfiles, and carrying out hash calculation on the file names of all the subfiles to obtain hash values of all the subfiles;

the hash value of each sub-file name is calculated and calculated with the quantity of the sub-files;

sorting the residual results corresponding to the subfiles;

obtaining the storage sequence of each sub-file according to the sequencing result;

and updating the file name index storage area information one by one according to the storage sequence of each sub-file, and writing and updating the file information storage area and the text storage area one by one.

7. A freeRTOS-based file information reading method, the method comprising:

acquiring a sub-file name to be read;

calculating a hash value according to the subfolder to obtain the position of the file in a file name index area;

obtaining the storage offset of the corresponding file information area according to the position of the file name index area;

acquiring the text offset and the file size of the current sub-file according to the offset of the file information area;

and positioning to the text position of the subfile according to the text offset and the file size of the current subfile, and reading the text information of the subfile according to the file size.

8. The method of claim 7, wherein the obtaining the text offset and the file size of the current sub-file according to the storage offset of the file information area comprises:

positioning according to the storage offset of the file information area;

judging whether the file names are the same, if so, reading text offset information and file size information;

if the information areas are different, obtaining the offset information of the next sub-file information of the hash collision, and circularly searching for the information of the next file information area until the text offset and the file size of the current sub-file are found.

9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the method steps of any of claims 1 to 8 when the computer program is executed.

10. A computer readable storage medium storing a computer program, which when executed by a processor causes the processor to perform the method steps of any one of claims 1 to 8.