Data burning method and device, storage medium and electronic equipment

Abstract

The invention provides a data burning method and device, a storage medium and electronic equipment, and the method comprises the steps: generating a sparse table based on an original file, the sparse table comprises at least one data segment, and the data segment comprises a segment of continuous and valid data or a segment of continuous and invalid data in the original file; generating a sparse mirror image file corresponding to the original file based on the sparse table; and sending the sparse mirror image file to the target equipment, so that the target equipment completes burning based on the sparse mirror image file. Due to the fact that the offset address, in the sparse mirror image file, of each data segment in the sparse mirror image file is aligned according to the requirement of the target device, after the sparse mirror image file is decompressed in the memory of the target device, the sparse mirror image file is directly burnt into the flash, moving and copying do not need to be conducted in the memory, and therefore the burning efficiency is improved.

Description

Technical Field

[0001] This invention relates to the field of computer technology, and more specifically, to a data burning method, apparatus, storage medium, and electronic device. Background Technology

[0002] Electronic products contain control chips, which can be, but are not limited to, microcontrollers or ARM controllers. Initially, the control chip has no program. To enable the control chip to perform its designed functions, a pre-written program file needs to be burned into the chip.

[0003] Based on this, how to further optimize the burning process and improve the burning speed has become a problem of concern to those skilled in the art. Summary of the Invention

[0004] The purpose of this invention is to provide a data burning method, apparatus, storage medium, and electronic device to at least partially improve the above-mentioned problems.

[0005] To achieve the above objectives, the technical solutions adopted in the embodiments of the present invention are as follows:

[0006] In a first aspect, embodiments of the present invention provide a data burning method, the method comprising:

[0007] A sparse table is generated based on the original file, wherein the sparse table includes at least one data segment, and the data segment includes a continuous and valid data segment or a continuous and invalid data segment from the original file;

[0008] A sparse image file corresponding to the original file is generated based on the sparse table. The sparse image file includes valid data segments from the sparse table, and the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device.

[0009] The sparse image file is sent to the target device so that the target device can complete the burning process based on the sparse image file.

[0010] Secondly, embodiments of the present invention provide a data burning apparatus, the apparatus comprising:

[0011] A processing unit is configured to generate a sparse table based on an original file, wherein the sparse table includes at least one data segment, and the data segment includes either a continuous and valid data segment or a continuous and invalid data segment from the original file.

[0012] The processing unit is further configured to generate a sparse image file corresponding to the original file based on the sparse table, wherein the sparse image file includes valid data segments in the sparse table, and the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device.

[0013] An information sending unit is used to send the sparse image file to the target device so that the target device can complete the burning based on the sparse image file.

[0014] Thirdly, embodiments of the present invention provide a storage medium having a computer program stored thereon, which, when executed by a processor, implements the above-described method.

[0015] Fourthly, embodiments of the present invention provide an electronic device, the electronic device comprising: a processor and a memory, the memory being used to store one or more programs; when the one or more programs are executed by the processor, the above-described method is implemented.

[0016] Compared to existing technologies, the present invention provides a data burning method, apparatus, storage medium, and electronic device, comprising: generating a sparse table based on an original file, wherein the sparse table includes at least one data segment, the data segment including a continuous and valid data segment or a continuous and invalid data segment in the original file; generating a sparse image file corresponding to the original file based on the sparse table, wherein the sparse image file includes the valid data segments in the sparse table, and the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device; and sending the sparse image file to the target device so that the target device can complete the burning based on the sparse image file. Because the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device, the sparse image file can be directly burned to flash memory after being decompressed in the memory of the target device, without the need for copying and moving data in memory, thereby improving burning efficiency.

[0017] To make the above-mentioned objects, features and advantages of the present invention more apparent and understandable, preferred embodiments are described below in detail with reference to the accompanying drawings. Attached Figure Description

[0018] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0019] Figure 1This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention.

[0020] Figure 2 This is a flowchart illustrating the data burning method provided in an embodiment of the present invention.

[0021] Figure 3 This is a schematic diagram of a document provided for an embodiment of the present invention.

[0022] Figure 4 A schematic diagram of the data burning device provided in this embodiment of the invention.

[0023] In the diagram: 10-Processor; 11-Memory; 12-Bus; 13-Communication Interface; 501-Processing Unit; 502-Information Transmission Unit. Detailed Implementation

[0024] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

[0025] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0026] It should be noted that similar reference numerals and letters in the following figures indicate similar items; therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures. Furthermore, in the description of this invention, terms such as "first," "second," etc., are used only to distinguish descriptions and should not be construed as indicating or implying relative importance.

[0027] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0028] In the description of this invention, it should be noted that the terms "upper," "lower," "inner," "outer," etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings, or the orientation or positional relationship in which the product of this invention is usually placed when in use. They are only for the convenience of describing this invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limiting this invention.

[0029] In the description of this invention, it should also be noted that, unless otherwise explicitly specified and limited, the terms "set" and "connection" should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral connection; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; and they can refer to the internal connection of two components. Those skilled in the art can understand the specific meaning of the above terms in this invention based on the specific circumstances.

[0030] The following detailed description of some embodiments of the present invention is provided in conjunction with the accompanying drawings. Unless otherwise specified, the following embodiments and features can be combined with each other.

[0031] Taking the Android system as an example, the file system components generated by the Android system can be sparsely compressed based on general file systems (ext2, ext3, ext4, NTFS, and FAT, etc.), which is the standard Android sparse file format (also known as the Android sparse file format). The Android sparse file format can effectively reduce the size of file system components. Because the files to be burned are smaller, the burning speed can be effectively improved. After the sparsely compressed data (which can be, but is not limited to, file system data) is transmitted to the target device (also known as the target board), the target device needs to decompress it and then write the decompressed data into the flash memory, thus completing the burning process.

[0032] After decompression, the data in memory may be uniformly aligned to 32-bit addresses. However, most flash controllers are already 64-bit aligned, so the data needs to be re-aligned to 64-bit before it can be properly burned into the flash memory. This alignment process involves copying data into memory, which significantly reduces the burning speed.

[0033] To overcome the above problems, this invention provides a data burning method that optimizes the burning process and improves burning speed by optimizing the sparse compression method and aligning the data to the required position on the hardware when generating the sparse image file.

[0034] This invention provides an electronic device, which may be a computer, a mobile phone, a server, etc. Please refer to... Figure 1 This is a schematic diagram of the structure of an electronic device. The electronic device includes a processor 10, a memory 11, and a bus 12. The processor 10 and the memory 11 are connected via the bus 12. The processor 10 is used to execute executable modules, such as computer programs, stored in the memory 11.

[0035] Processor 10 can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the data programming method can be completed through integrated logic circuits in the hardware or software instructions within processor 10. The aforementioned processor 10 can be a general-purpose processor, including a Central Processing Unit (CPU), a Network Processor (NP), etc.; it can also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field-Programmable Gate Array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0036] The memory 11 may include high-speed random access memory (RAM) and may also include non-volatile memory, such as at least one disk storage device.

[0037] Bus 12 can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus, or an EISA (Extended Industry Standard Architecture) bus, etc. Figure 1 The symbol is represented by a single double-headed arrow, but this does not mean that there is only one bus 12 or one type of bus 12.

[0038] The memory 11 is used to store programs, such as programs corresponding to the data burning device. The data burning device includes at least one software functional module that can be stored in the memory 11 in the form of software or firmware or embedded in the operating system (OS) of the electronic device. After receiving an execution instruction, the processor 10 executes the program to implement the data burning method.

[0039] The electronic device provided in this embodiment of the invention may further include a communication interface 13. The communication interface 13 is connected to the processor 10 via a bus.

[0040] It should be understood that, Figure 1 The structure shown is only a partial schematic diagram of the electronic device; the electronic device may also include components that are larger than... Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown. Figure 1 The components shown can be implemented using hardware, software, or a combination thereof.

[0041] The data burning method provided in this embodiment of the invention can be applied to, but is not limited to, [various applications]. Figure 1 For the specific process of the electronic devices shown, please refer to [link / reference]. Figure 2 The data burning methods include S10, S20 and S30, which are described in detail below.

[0042] S10 generates a sparse table based on the original file.

[0043] The sparse table includes at least one data segment, which consists of a continuous and valid data segment or a continuous and invalid data segment from the original file. The length of the data segment can be an integer multiple of the preset block length.

[0044] S20, Generate a sparse image file corresponding to the original file based on the sparse table.

[0045] The sparse image file includes valid data segments from the sparse table, and the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device.

[0046] S30 sends the sparse image file to the target device so that the target device can complete the burning based on the sparse image file.

[0047] In the data burning method provided in this embodiment of the invention, since the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device, the sparse image file can be directly burned into the flash after being decompressed in the memory of the target device, without the need for moving and copying in memory, thereby improving the burning efficiency.

[0048] exist Figure 2 Based on the above, regarding the content of S10, this embodiment of the invention also provides an optional implementation method, please refer to the following. S10, the step of generating a sparse table based on the original file, includes: S11 and S12, which are described in detail below.

[0049] S11, Scan the original file according to the preset block length and generate a scan table.

[0050] The scan table includes multiple sequentially arranged block files and a status flag for each block file. The status flag indicates whether the corresponding block file is valid.

[0051] The preset block length can be, but is not limited to, 1KB, 2KB, 4KB, and 8KB, etc., and the preset block length is an integer power of 2.

[0052] Please refer to Figure 3 , Figure 3 This is a schematic diagram of a document provided for an embodiment of the present invention. For example... Figure 3 As shown, scanning the original file according to the preset block length can yield n block files, where Blockj represents the j-th block file, Flagj represents the status flag of the j-th block file, and 1≤j≤n.

[0053] Optionally, when Flagj is 1, it means that the j-th block file is valid, that is, the data in the j-th block file cannot be compressed; when Flagj is 0, it means that the j-th block file is invalid, that is, the data in the j-th block file can be compressed, and the j-th block file can be skipped.

[0054] S12, Generate a sparse table based on the scan table.

[0055] The sparse table includes at least one data segment, which consists of a set of consecutive blocks with the same status flag in the scan table.

[0056] It should be noted that each data segment includes at least one block file.

[0057] Based on the preceding text, regarding the content of S12, this embodiment of the invention also provides an optional implementation method, please refer to the following. S12, the step of generating a sparse table based on the scan table, includes: S121 and S122, which are specifically described below.

[0058] S121, organize the block files with the same and consecutive status markers in the scan table into one data segment.

[0059] S122, arrange all data segments in order to obtain a sparse table.

[0060] Please continue to refer to this. Figure 3 Sectioni represents the i-th data segment, which includes blocks N(i-1)+1 to N(i). The N(i-1)+1 block is the first block after the (i-1)-th data segment. Blocks N(i-1)+1 to N(i) are consecutive blocks with the same state label. The state labels of the N(i-1)+1 block and the N(i-1) block are different. N(0) equals 0, N(i) equals 1, and 1 ≤ i ≤ i.

[0061] Based on the preceding text, regarding the content of S20, this embodiment of the invention also provides an optional implementation method, please refer to the following text. S20, the step of generating a sparse image file corresponding to the original file based on the sparse table, includes: S21, S22, S23, S24, S25, S26, S27, and S28, which are specifically described below.

[0062] S21, Generate header data for sparse image files.

[0063] Optionally, the header data of a sparse image file includes an image tag (when this tag is carried, it indicates that the file is a sparse image file), the total length of the original file, and a preset block length.

[0064] S22, let k = 1.

[0065] S23, determine whether the k-th data segment is a valid data segment. If yes, proceed to S24; otherwise, proceed to S28.

[0066] S24, determine the offset of the current write start position of the k-th data segment relative to the target number of bits.

[0067] S25, Generate the header data of the kth data segment based on the offset corresponding to the kth data segment.

[0068] The header data of the kth data segment includes the offset corresponding to the kth data segment and the corresponding burning target address.

[0069] S26, after writing the header data of the kth data segment into the sparse image file, insert padding bytes into the sparse image file based on the offset corresponding to the kth data segment.

[0070] By inserting padding bytes into the sparse image file, the write start position (i.e., the offset address of the data segment in the sparse image file) corresponding to the k-th data segment is changed, and the changed write start position is aligned with the target bit width. In other words, the offset address of the k-th data segment in the sparse image file is aligned according to the requirements of the target device.

[0071] S27, after completing the insertion of padding bytes, write the k-th data segment to the sparse mirror file.

[0072] S28 is executed after the k-th data segment is written to the sparse image file, or when the k-th data segment is determined to be an invalid data segment.

[0073] S28, let k = k + 1, and determine if k is greater than the total number of data segments in the sparse table. If it is greater, then end; if it is less than or equal to, repeat S23 to determine if the k-th data segment is a valid data segment.

[0074] Based on the preceding text, regarding the content of S24, this embodiment of the invention also provides an optional implementation method, please refer to the following. S24, the step of determining the offset of the current write start position of the k-th data segment relative to the target number of bits, includes: S241, S242, S243, and S244, which are described in detail below.

[0075] S241, determine whether the current write start position corresponding to the k-th data segment is aligned with the target number of bits. If yes, execute S242; otherwise, execute S243.

[0076] Optionally, the current write start position corresponding to the kth data segment is determined based on the position of the file pointer corresponding to the sparse image file, that is, the position where the data in the kth data segment is about to be written.

[0077] S242, set the offset to 0.

[0078] S243, obtain the remainder when the current write start position of the kth data segment is divided by the target value.

[0079] The target value is the value corresponding to the target number of digits.

[0080] Alternatively, the target value is equal to the target number of bits divided by 8, for example, the target value for 64 bits is 8.

[0081] S244, determine the offset based on the target value and the remainder.

[0082] Optionally, the offset is the difference between the target value and the remainder.

[0083] Based on the preceding text, regarding the content of S23, this embodiment of the invention also provides an optional implementation method, please refer to the following text. S23, the step of determining whether the k-th data segment is a valid data segment, includes:

[0084] S231, determine whether the block file in the k-th data segment is valid. If the block file in the k-th data segment is valid, then execute S232; if the block file in the k-th data segment is invalid, then execute S233.

[0085] S232, determine the k-th data segment as a valid data segment.

[0086] S233, determine that the k-th data segment is an invalid data segment.

[0087] Please continue to refer to this. Figure 3 , Figure 3 In this context, Section'k represents the k-th valid data segment, where 1 ≤ k ≤ K and 1 ≤ K ≤ I. K represents the total number of valid data segments in the sparse table, and I represents the total number of data segments in the sparse table. Header represents the header data of the sparse image file. Section'k Header represents the header data of the k-th valid data segment, and Gapk represents the padding bytes corresponding to the k-th valid data segment.

[0088] In S30, after the sparse image file is sent to the target device, this embodiment of the invention also provides an optional implementation method for how the target device completes the burning process, please refer to the following.

[0089] The target device stores the sparse image file in its memory. The starting positions of the sparse image file are aligned according to the target device's requirements, specifically aligned with the target bit width (e.g., 64-bit address alignment). Based on the header data of the sparse image file and the header data of the kth valid data segment, the target device parses the data of the kth data segment from the sparse image file. This data is aligned with the target bit width and can be directly written into the flash memory for programming.

[0090] Please see Figure 4 , Figure 4 The present invention provides a data burning device, which is optionally applied to the electronic device described above.

[0091] The data burning device includes a processing unit 501 and an information sending unit 502.

[0092] Processing unit 501 is used to generate a sparse table based on the original file, wherein the sparse table includes at least one data segment, and the data segment includes a continuous and valid data segment or a continuous and invalid data segment in the original file;

[0093] Processing unit 501 is also used to generate a sparse image file corresponding to the original file based on the sparse table, wherein the sparse image file includes valid data segments in the sparse table, and the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device.

[0094] The information sending unit 502 is used to send the sparse image file to the target device so that the target device can complete the burning based on the sparse image file.

[0095] It should be noted that the data burning device provided in this embodiment can execute the method flow shown in the above method flow embodiment to achieve the corresponding technical effects. For the sake of brevity, any parts not mentioned in this embodiment can be referred to the corresponding content in the above embodiments.

[0096] This invention also provides a storage medium storing computer instructions and programs, which, when read and run, execute the data burning method described in the above embodiments. The storage medium may include memory, flash memory, registers, or a combination thereof.

[0097] The following describes an electronic device, which may be a computer device, a mobile phone device, a server device, etc., such as... Figure 1 As shown, the above-described data burning method can be implemented. Specifically, the electronic device includes: a processor 10, a memory 11, and a bus 12. The processor 10 may be a CPU. The memory 11 is used to store one or more programs, and when one or more programs are executed by the processor 10, the data burning method of the above embodiment is executed.

[0098] In summary, the data burning method, apparatus, storage medium, and electronic device provided by the embodiments of the present invention include: generating a sparse table based on an original file, wherein the sparse table includes at least one data segment, and the data segment includes a continuous and valid data segment or a continuous and invalid data segment in the original file; generating a sparse image file corresponding to the original file based on the sparse table, wherein the sparse image file includes the valid data segments in the sparse table, and the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device; and sending the sparse image file to the target device so that the target device can complete the burning based on the sparse image file. Because the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device, the sparse image file can be directly burned to flash memory after being decompressed in the memory of the target device, without the need for copying and moving data in memory, thereby improving burning efficiency.

[0099] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

[0100] It will be apparent to those skilled in the art that the present invention is not limited to the details of the exemplary embodiments described above, and that the invention can be implemented in other specific forms without departing from its spirit or essential characteristics. Therefore, the embodiments should be considered in all respects as exemplary and non-limiting, and the scope of the invention is defined by the appended claims rather than the foregoing description. Thus, all variations falling within the meaning and scope of equivalents of the claims are intended to be included within the present invention. No reference numerals in the claims should be construed as limiting the scope of the claims.

Claims

1. A data burning method, characterized in that, The method includes: A sparse table is generated based on the original file, wherein the sparse table includes at least one data segment, and the data segment includes a continuous and valid data segment or a continuous and invalid data segment from the original file; A sparse image file corresponding to the original file is generated based on the sparse table. The sparse image file includes valid data segments from the sparse table, and the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device. The sparse image file is sent to the target device so that the target device can complete the burning process based on the sparse image file.

2. The data burning method as described in claim 1, characterized in that, The step of generating a sparse table based on the original file includes: The original file is scanned according to a preset block length to generate a scan table. The scan table includes multiple sequentially arranged block files and a status flag corresponding to each block file. The status flag is used to indicate whether the corresponding block file is valid. A sparse table is generated based on the scan table, wherein the sparse table includes at least one data segment, and the data segment includes a set of consecutive block files with the same state label in the scan table.

3. The data burning method as described in claim 2, characterized in that, The step of generating a sparse table based on the scan table includes: Organize the consecutive block files with the same status marker in the scan table into one data segment; Arrange all data segments in order to obtain the sparse table.

4. The data burning method as described in claim 2, characterized in that, The step of generating a sparse image file corresponding to the original file based on the sparse table includes: Generate header data for sparse image files; Let k = 1; Determine whether the k-th data segment is a valid data segment; If so, then determine the offset of the current write start position of the kth data segment relative to the target number of bits; Based on the offset corresponding to the kth data segment, the header data of the kth data segment is generated, wherein the header data of the kth data segment includes the offset corresponding to the kth data segment and the corresponding burning target address; After writing the header data of the kth data segment into the sparse image file, padding bytes are inserted into the sparse image file based on the offset corresponding to the kth data segment. After the padding byte insertion is completed, the k-th data segment is written to the sparse image file; After writing the kth data segment into the sparse image file, or when the kth data segment is determined to be an invalid data segment, let k = k + 1, and determine whether k is greater than the total number of data segments in the sparse table; If it is less than or equal to, then repeatedly determine whether the k-th data segment is a valid data segment.

5. The data burning method as described in claim 4, characterized in that, The step of determining the offset of the current write start position of the k-th data segment relative to the target number of bits includes: Determine whether the current write start position of the k-th data segment is aligned with the target number of bits; If so, then set the offset to 0; If not, obtain the remainder when the current write start position of the kth data segment is divided by the target value, where the target value is the value corresponding to the target number of bits; The offset is determined based on the target value and the remainder.

6. The data burning method as described in claim 5, characterized in that, The offset is the difference between the target value and the remainder.

7. The data burning method as described in claim 4, characterized in that, The step of determining whether the k-th data segment is a valid data segment includes: Determine whether the block file in the k-th data segment is valid; If the block file in the k-th data segment is valid, then the k-th data segment is determined to be a valid data segment.

8. A data burning device, characterized in that, The device includes: A processing unit is configured to generate a sparse table based on an original file, wherein the sparse table includes at least one data segment, and the data segment includes either a continuous and valid data segment or a continuous and invalid data segment from the original file. The processing unit is further configured to generate a sparse image file corresponding to the original file based on the sparse table, wherein the sparse image file includes valid data segments in the sparse table, and the offset address of each data segment in the sparse image file is aligned according to the requirements of the target device. An information sending unit is used to send the sparse image file to the target device so that the target device can complete the burning based on the sparse image file.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the method as described in any one of claims 1-7.

10. An electronic device, characterized in that, include: Processor and memory, the memory being used to store one or more programs; When the one or more programs are executed by the processor, the method as described in any one of claims 1-7 is implemented.

Images