WO2022257319A1

WO2022257319A1 - Data burning method and apparatus, terminal, and storage medium

Info

Publication number: WO2022257319A1
Application number: PCT/CN2021/124813
Authority: WO
Inventors: 林示麟
Original assignee: 深圳市昂科技术有限公司
Priority date: 2021-06-06
Filing date: 2021-10-20
Publication date: 2022-12-15
Also published as: CN113312065B; CN113312065A

Abstract

A data burning method and apparatus, a terminal, and a storage medium. The method comprises: dividing pre-acquired burning data into at least one burning unit according to a preset chip minimum burning unit size for storage, each burning unit corresponding to one bit (S101); scanning the data corresponding to each bit in sequence, and when the data corresponding to the bit is valid data, marking the bit to obtain a storage mapping table (S102); and extracting the valid data corresponding to the marked bits in sequence, and sending the storage mapping table and the valid data to a burning terminal, so that the burning terminal performs burning by using a valid data set and the storage table (S103). According to the method, after burning data is split into minimum burning units, only minimum burning units are extracted and transmitted to a burning terminal, so that the situation that burning data is too large and occupies a large amount of memory is avoided, and hardware requirements for a burning terminal are reduced.

Description

Data burning method, device, terminal and storage medium

technical field

The present application relates to the technical field of chip programming, in particular to a data programming method, device, terminal and storage medium.

Background technique

Burning refers to writing the software program into the chip or microcontroller. The current chip programming scheme is mainly divided into two types, one of which is: directly store the programming file in the programming device, and the programming device directly parses the programming file to obtain the programming data, and then performs programming. The storage space can be minimized, but the parsing process needs to be performed by the burning device itself, which has high requirements on the hardware of the burning device, and some burning devices need to use the smallest unit as the writing unit to write when burning. And the writing position is an integer multiple of the smallest unit. For example, eMMC programming needs to be written in units of 512 bytes, and the write address of the chip must be an integer multiple of 512 bytes. This will make each read After the data in the cache area needs to be filled with data and aligned with the address, resulting in low reading efficiency of the programming data; another solution is to write a cache of the same size as the area to be written in the chip on the computer terminal, The computer terminal parses the burning file and stores it in the cache, and then transfers all the burning data in the cache to the burning device. This method does not have the problems of data completion and address alignment in solution 1, but other There are strict requirements on the size of the buffer space of the programming device, which must be larger than the size of the area to be written in the chip, resulting in an increase in hardware costs.

Contents of the invention

The present application provides a data programming method, device, terminal and storage medium to solve the problem that the existing chip programming scheme has too high requirements on the hardware of the programming equipment.

In order to solve the above problems, a technical solution adopted by this application is: provide a data programming method, which is applied to the data analysis end; It is divided into at least one burning unit for storage, and each burning unit corresponds to a bit; the data corresponding to each bit is scanned in turn, and when the data corresponding to the bit is valid data, the bit is marked to obtain the storage mapping table; The marked bits correspond to valid data, and send the storage mapping table and the valid data to the programming terminal, so that the programming terminal can use the valid data set and the storage table to perform programming.

In order to solve the above problems, another technical solution adopted by this application is to provide a data burning method, which is applied to the burning terminal; Store in the storage area in turn; when receiving the burning request input by the user, build a cache area corresponding to the area to be written in the chip, the cache area includes multiple cache units, and each cache unit corresponds to a bit of the storage mapping table; read valid data corresponding to the marked bits in the storage mapping table in the storage area, and storing the valid data into the cache unit corresponding to the marked bits to obtain final programming data; and burning the final programming data into the chip.

As a further improvement of the present application, the burning request includes the data start bit and data length of the burning data in the storage mapping table; The data is stored in the buffer unit corresponding to the marked bit, and the final burning data is obtained, including: sequentially judging whether each bit in the data length range starting from the data start bit in the storage mapping table is the marked target bit; If so, calculate the number of marked bits between the target bit and the first bit of the storage mapping table, and confirm the target valid data corresponding to the target bit from the storage area according to the number of marked bits; data, and write the target valid data into the cache unit corresponding to the target bit to obtain the final programming data.

As a further improvement of the present application, after sequentially judging whether each bit in the storage mapping table starting from the data start bit and within the data length range is the marked target bit, it also includes: if not, skip the bit and confirm the next Whether a bit is marked.

As a further improvement of the present application, after obtaining the final programming data, it further includes: recording the access data table between the target valid data and the cache unit.

As a further improvement of the present application, burning the final programming data into the chip includes: when burning the final programming data into the chip, judging whether the data stored in the current programming unit is valid data; The burning unit burns to the corresponding position on the chip, and then burns the next burning unit until the last burning unit; if not, skips the current burning unit and burns the next burning unit until the last A burning unit.

In order to solve the above problems, another technical solution adopted by the present application is to provide a data programming device, which includes: a division module for dividing the pre-acquired programming data according to the preset minimum chip programming unit size It is at least one burning unit, and each burning unit corresponds to one bit; the scanning module is used to sequentially scan the data corresponding to each bit, and when the data corresponding to the bit is valid data, mark the bit to obtain the storage mapping table; the data The sending module is used to sequentially extract the valid data corresponding to the marked bits, and send the storage mapping table and valid data to the programming terminal, so that the programming terminal can use the valid data set and the storage table to perform programming.

In order to solve the above problems, another technical solution adopted by the present application is to provide a data burning device, which includes: a receiving module, which is used to receive the valid data and the storage mapping table sent by the data analysis end, and store the valid data in sequence to the storage area; a building module, used to construct a buffer area corresponding to the area to be written into the chip when receiving a burning request input by the user. The buffer area includes multiple cache units, and each cache unit corresponds to a bit of the storage mapping table ; The reading module is used to read the valid data corresponding to the marked bit in the storage mapping table in the storage area, and store the valid data to the buffer unit corresponding to the marked bit to obtain the final burning data; burning Module, used to burn the final programming data into the chip.

In order to solve the above problems, another technical solution adopted by this application is to provide a terminal. The terminal includes a processor and a memory coupled to the processor. Program instructions are stored in the memory. When the program instructions are executed by the processor, the processing The device executes the steps of any one of the above-mentioned data burning methods.

In order to solve the above problems, another technical solution adopted by the present application is to provide a storage medium storing program files capable of implementing any one of the above data burning methods.

The beneficial effects of the present application are: the data burning method of the present application obtains the burning data by parsing the burning file at the data analysis end, and divides the burning data into a plurality of burning units according to the minimum burning unit requirements of the chip for storage, Each burning unit corresponds to one bit, and then identify whether the data stored in each bit is valid data one by one in order, and if so, mark the bit until the last bit is identified, and then obtain the storage mapping table, and then store The valid data corresponding to the mapping table and the marked bits are sent to the programming terminal to program the chip. It only sends valid data to the programming terminal for storage instead of the entire programming data, thus reducing the need for the programming terminal. Due to the hardware requirements, the programming device with a small buffer space can also complete the programming of the chip.

Description of drawings

The above and other objects, features and advantages of exemplary embodiments of the present disclosure will become readily understood by reading the following detailed description with reference to the accompanying drawings. In the drawings, several embodiments of the present disclosure are shown by way of illustration and not limitation, and the same or corresponding reference numerals indicate the same or corresponding parts, wherein:

Fig. 1 is a schematic structural view of an embodiment of the data burning system of the present invention;

Fig. 2 is the flowchart of the first embodiment of the data burning method of the present invention;

Fig. 3 is a schematic diagram of the burn data burn unit mark of the present invention;

Fig. 4 is the flowchart of the second embodiment of the data burning method of the present invention;

Fig. 5 is a schematic diagram of effective data reading in the present invention;

6 is a schematic diagram of the functional modules of the first embodiment of the data burning device of the present invention;

7 is a schematic diagram of functional modules of the second embodiment of the data burning device of the present invention;

FIG. 8 is a schematic structural diagram of a terminal of the present invention;

Fig. 9 is a schematic structural diagram of a storage medium of the present invention.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present disclosure with reference to the accompanying drawings in the embodiments of the present disclosure. Apparently, the described embodiments are part of the embodiments of the present disclosure, not all of them. Based on the embodiments in the present disclosure, all other embodiments obtained by those skilled in the art without making creative efforts belong to the protection scope of the present disclosure.

Specific embodiments of the present disclosure will be described in detail below in conjunction with the accompanying drawings.

FIG. 1 is a schematic structural diagram of a data burning system according to an embodiment of the present invention. As shown in Figure 1, the data burning system 1 comprises a data analyzing terminal 10 and a burning terminal 11, wherein the data analyzing terminal 10 is connected to the burning terminal 11 in communication, and the data analyzing terminal 10 comprises an analyzing module 100, a cache module 101 and Transmission module 102, the analysis file input by the user includes multiple formats, the analysis module 100 is used to analyze the burning file input by the user to obtain the burning data, and store it in the cache module 101, and the transmission module 102 is used for the burning in the cache module 101 The recording data is scanned according to the minimum programming unit of the preset chip, and multiple programming units and storage mapping tables with valid data are obtained, and then the multiple programming units and storage mapping tables are sent to the programming terminal 11; The recording terminal 11 includes a buffering and reading module 111, a storage module 112 and a burning module 113. The buffering and reading module 111 is used to receive a plurality of burning units and storage mapping tables transmitted by the data analysis terminal 10, and then convert a plurality of burning units into The recording units are sequentially stored in the storage module 112. When the chip needs to be programmed, the programming module 113 reads the programming data from the storage module 112 in combination with the programming request input by the user and the storage mapping table, and then programs the chip according to the programming data. .

FIG. 2 is a schematic flowchart of a data burning method according to a first embodiment of the present invention. It should be noted that the method of the present invention is not limited to the flow sequence shown in FIG. 2 if substantially the same result is obtained. It should be noted that the data burning method is applied to the data analysis end, as shown in Figure 2, the data burning method includes steps:

Step S101: Divide the pre-acquired programming data into at least one programming unit according to the preset minimum chip programming unit size for storage, and each programming unit corresponds to one bit.

In step S101, after analyzing the data file and obtaining the programming data, the data analysis terminal stores the programming data in the pre-built buffer area of the analysis terminal, which is equal in size to the allowable write-in area of the chip. The total size of the recorded data and the minimum programming unit are used to calculate the number of bytes required to store the programmed data. The calculation formula is:

Among them, BitMapBytes is the number of bytes, DevSize is the total size of the programming data, SectorSize is the minimum programming unit, the minimum programming unit can be obtained from the chip manual, or set by the user, Ceiling refers to rounding up, for example , when the calculation result in brackets is 1.2, round up to get the final result of 2.

Specifically, a byte includes 8 bits, assuming that the total size of the programming data is 127M, and the minimum programming unit is 1M, substitute the above formula for calculation:

That is to say, 16 bytes are needed to store the programming data, that is, to build a 16-byte parser cache area.

After storing the programming data in the cache area of the analysis end, divide the programming data into at least one programming unit according to the minimum programming unit, for example, when the total size of the programming data is 127M and the minimum programming unit is 1M, then divide There are 127 programming units, and each programming unit corresponds to one bit.

Step S102: Scan the data corresponding to each bit in turn, and when the data corresponding to the bit is valid data, mark the bit to obtain the storage mapping table.

It should be understood that the programming data is divided into multiple programming units, and each programming unit corresponds to one bit, and there may be a lot of blank value data in the multiple bits. Therefore, in step S102, please refer to FIG. 3 together, scan the data corresponding to each bit in the programming data in turn, and judge whether the data corresponding to each bit is the initial default value or valid data, if the initial default value ( If it is a blank block in the figure), the corresponding bit is not marked, and if it is valid data (shaded block in the figure), the corresponding bit is marked, so as to obtain a storage mapping table in which each marked bit is recorded.

Step S103: sequentially extract valid data corresponding to the marked bits, and send the storage mapping table and the valid data to the programming terminal, so that the programming terminal can use the valid data set and the storage table for programming.

In step S103, according to the storage mapping table, each bit of the cache area of the analysis end is traversed in turn. When the data corresponding to the current bit recorded in the storage mapping table is the default value, this bit is skipped. When the data is valid data, the valid data is extracted, and all valid data are sequentially extracted according to the storage mapping table, and then all valid data and the storage mapping table are sent to the programming terminal, so that the programming terminal can use the valid data set and storage table to burn.

In the data programming method of the first embodiment of the present invention, after the programming data is obtained by analyzing the programming file at the data analysis terminal, the programming data is divided into multiple programming units according to the minimum programming unit requirements of the chip for storage. The recording unit corresponds to a bit, and then identify whether the data stored in each bit is valid data one by one in order, and if so, mark the bit until the last bit is identified, obtain the storage mapping table, and then store the mapping table and The valid data corresponding to the marked bits is sent to the programming terminal to program the chip, which reduces the requirements for the programming terminal hardware by only sending valid data to the programming terminal for storage instead of the entire programming data , so that the programming device with a small buffer space can also complete the programming of the chip.

FIG. 4 is a schematic flowchart of a data burning method according to a second embodiment of the present invention. It should be noted that, if substantially the same result is obtained, the method of the present invention is not limited to the flow sequence shown in FIG. 4 . It should be noted that the data burning method is applied to the burning terminal, as shown in Figure 4, the data burning method includes steps:

Step S201: Receive the valid data and the storage mapping table sent by the data analysis end, and store the valid data in the storage area in sequence.

It should be noted that the programming terminal includes a data storage module, and the data storage module may be a DDR memory of the programming terminal or an external Flash, which is not limited in this embodiment.

Step S202: When a programming request input by the user is received, a buffer area corresponding to the area to be written in the chip is constructed. The buffer area includes a plurality of buffer units, and each buffer unit corresponds to a bit of the storage mapping table.

In step S202, after receiving the programming request input by the user, a buffer area corresponding to the area to be written in the chip is constructed in combination with the storage mapping table, and each buffer unit in the buffer area corresponds to a bit of the storage mapping table.

Step S203: Read the valid data corresponding to the marked bits in the storage mapping table in the storage area, and store the valid data in the cache unit corresponding to the marked bits to obtain the final programming data.

In step S203, combined with the storage mapping table, the stored valid data is read from the storage area, and then according to the position of the bit corresponding to the valid data in the storage mapping table, the valid data is filled into the corresponding cache unit, thereby obtaining a complete The final burning data.

It should be noted that the burning request includes the data start bit and the data length of the burning data in the storage mapping table, and the step S203 specifically includes:

1. In order to determine whether each bit in the storage mapping table starting from the data start bit and within the data length range is a marked target bit.

2. If yes, calculate the number of marked bits between the target bit and the first bit of the storage mapping table, and confirm the target valid data corresponding to the target bit from the storage area according to the number of marked bits.

3. Read the target valid data, and write the target valid data into the cache unit corresponding to the target bit, to obtain the final programming data.

4. If not, skip the bit and check if the next bit is marked.

Specifically, please refer to Figure 5 together, assuming that M is the data start bit, N is the data length, starting from M, scan each bit in the range of M+N-1 in turn; when scanning to M+A bits is When the target bit is marked, calculate the number X of marked bits between the first bit and M+A bits in the storage mapping table, and then query the X+1th valid data from the storage area according to the number X , and read the X+1th valid data, and then write the X+1th valid data to the cache unit corresponding to the M+A bit; when the currently scanned bit is not marked, jump Pass the current bit and start to confirm whether the next bit is marked. After confirming the last bit, get the final programming data.

Further, in order to avoid frequently calculating the corresponding relationship between valid data and cache units when programming chips in batches, after obtaining the final programming data, it also includes: recording the access data table between the target valid data and cache units.

Specifically, by recording the access data table between the target valid data and the cache unit, when programming the same type of chip again, read the valid data directly from the storage area according to the access data table, and perform programming again without It is then necessary to repeatedly calculate the corresponding relationship between the target valid data and the cache unit bracket.

Step S204: Burn the final programming data into the chip.

Further, in order to improve chip programming efficiency, step S204 specifically includes:

1. When burning the final programming data to the chip, judge whether the data stored in the current programming unit is valid data.

Specifically, after the final programming data is obtained, the final programming data is sequentially programmed according to the smallest programming unit. When programming each programming unit, it is first judged whether the data corresponding to the programming unit is valid data or default data. data.

2. If yes, burn the current programming unit to the corresponding position on the chip, and then burn the next programming unit until the last programming unit.

Specifically, when the data corresponding to the current programming unit is valid data, the current programming unit is burned to the corresponding position on the chip, and then the next programming unit is programmed.

3. If not, skip the current burning unit, and burn the next burning unit until the last burning unit.

Specifically, when the data corresponding to the current programming unit is the default data, the current programming unit is directly skipped and the programming is not performed, thereby saving the programming time and improving the programming efficiency.

The data burning method of the second embodiment of the present invention reads the valid data based on the storage mapping table and the burning request input by the user after receiving the valid data and the storage mapping table, and writes the valid data into the corresponding In the cache unit, the complete programming data is obtained, and then burned to the chip according to the complete programming data. The storage area on the burning terminal stores the effective data in the burning data, which greatly reduces the occupied storage space, thus reducing the hardware requirements.

FIG. 6 shows a schematic diagram of the functional modules of the data burning device according to the first embodiment of the present invention. As shown in FIG. 6 , the data burning device 60 includes a dividing module 61 , a scanning module 62 and a data delivery module 63 .

The dividing module 61 is used to divide the pre-acquired programming data into at least one programming unit according to the preset chip minimum programming unit size, and each programming unit corresponds to one bit;

The scanning module 62 is used to scan the data corresponding to each bit in turn, and when the data corresponding to the bit is valid data, mark the bit to obtain the storage mapping table;

The data sending module 63 is used to sequentially extract the valid data corresponding to the marked bits, and send the storage mapping table and valid data to the programming terminal, so that the programming terminal can use the valid data set and the storage table to perform programming.

FIG. 7 shows a schematic diagram of functional modules of a data burning device according to a second embodiment of the present invention. As shown in FIG. 7 , the data burning device 70 includes a receiving module 71 , a building module 72 , a reading module 73 and a burning module 74 .

The receiving module 71 is used to receive the valid data and the storage mapping table sent by the data parsing end, and store the valid data in the storage area in sequence;

The construction module 72 is configured to construct a cache area corresponding to the area to be written into the chip when receiving a burning request input by the user, the cache area includes a plurality of cache units, and each cache unit corresponds to a bit of the storage mapping table;

The reading module 73 is used to read the valid data corresponding to the marked bit in the storage mapping table in the storage area, and store the valid data to the cache unit corresponding to the marked bit to obtain the final burning data;

The burning module 74 is used for burning the final burning data into the chip.

Optionally, the burning request includes the data start bit and the data length of the burning data in the storage mapping table; the reading module 73 executes reading the effective data corresponding to the bit marked in the storage mapping table in the reading storage area, and The operation of storing the valid data into the buffer unit corresponding to the marked bit to obtain the final burning data can also be: sequentially judge whether each bit in the data length range starting from the data start bit in the storage mapping table is Marked target bits; if so, calculate the number of marked bits between the target bit and the first bit of the storage mapping table, and confirm from the storage area that the target corresponding to the target bit is valid according to the number of marked bits Data: read the target valid data, and write the target valid data into the cache unit corresponding to the target bit to obtain the final programming data.

Optionally, after the reading module 73 executes sequentially judging whether each bit in the data length range is a marked target bit starting from the data start bit in the storage mapping table, it is also used for: if the bit is not marked, then Skip bits and check if the next bit is marked.

Optionally, after the reading module 73 obtains the final programming data, it is further configured to: record the access data table between the target valid data and the cache unit.

Optionally, the burning module 74 performs the operation of burning the final burning data into the chip, and may also be: when burning the final burning data into the chip, it is judged whether the data stored in the current burning unit is valid data ; If yes, burn the current programming unit to the corresponding position on the chip, and then burn the next programming unit until the last programming unit; if not, skip the current programming unit and burn the next one Programming units until the last programming unit.

For other details of implementing the technical solution of each module in the data burning device of the above embodiment, please refer to the description of the data burning method in the above embodiment, which will not be repeated here.

It should be noted that each embodiment in this specification is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. For the same and similar parts in each embodiment, refer to each other, that is, Can. As for the device-type embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and for related parts, please refer to part of the description of the method embodiments.

Please refer to FIG. 8 , which is a schematic structural diagram of a terminal according to an embodiment of the present invention. As shown in FIG. 8 , the terminal 80 includes a processor 81 and a memory 82 coupled to the processor 81. Program instructions are stored in the memory 82. When the program instructions are executed by the processor 81, the processor 81 executes any of the above implementations. The steps of the data burning method described in the example.

Wherein, the processor 81 may also be referred to as a CPU (Central Processing Unit, central processing unit). The processor 81 may be an integrated circuit chip with signal processing capability. The processor 81 can also be a general-purpose processor, 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, discrete hardware components . A general-purpose processor may be a microprocessor, or the processor may be any conventional processor, and the like.

Referring to FIG. 9 , FIG. 9 is a schematic structural diagram of a storage medium according to an embodiment of the present invention. The storage medium in the embodiment of the present invention stores a program file 91 capable of realizing all the above-mentioned methods, wherein the program file 91 can be stored in the above-mentioned storage medium in the form of a software product, and includes several instructions to make a computer device (which can It is a personal computer, a server, or a network device, etc.) or a processor (processor) that executes all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disc, etc., which can store program codes. , or terminal devices such as computers, servers, mobile phones, and tablets.

In the several embodiments provided in this application, it should be understood that the disclosed terminal, device and method may be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated. to another system, or some features may be ignored, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units. The above is only the implementation mode of this application, and does not limit the scope of patents of this application. Any equivalent structure or equivalent process transformation made by using the contents of this application specification and drawings, or directly or indirectly used in other related technical fields, All are included in the scope of patent protection of the present application in the same way.

In the above descriptions of this specification, unless otherwise clearly specified and limited, terms such as "fixed", "installed", "connected" or "connected" should be interpreted in a broad sense. For example, as far as the term "connection" is concerned, it may be a fixed connection or a detachable connection, or integrated; it may be a mechanical connection or an electrical connection; it may be a direct connection or an indirect connection through an intermediary , or it can be the internal communication of two elements or the interaction relationship between two elements. Therefore, unless otherwise clearly defined in this specification, those skilled in the art can understand the specific meanings of the above terms in the present invention according to specific situations.

According to the above description of this specification, those skilled in the art can also understand the terms used as follows, such as "upper", "lower", "front", "rear", "left", "right", "length", "width" ", "Thickness", "Vertical", "Horizontal", "Top", "Bottom", "Inner", "Outer", "Axial", "Radial", "Circumferential", "Center", " Terms indicating orientation or positional relationship, such as "longitudinal", "transverse", "clockwise" or "counterclockwise", are based on the orientation or positional relationship shown in the drawings of this specification, which are only for the convenience of explaining the solution of the present invention and simplify the description, rather than express or imply that the device or element involved must have the specific orientation, be constructed and operate in a specific orientation, so the above orientation or positional relationship terms cannot be understood or interpreted as Limitations on the Protocols of the Invention.

In addition, terms such as "first" or "second" used in this specification to refer to numbers or ordinal numbers are used for descriptive purposes only, and should not be interpreted as express or implied relative importance or implied indications The number of technical characteristics. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of such features. In the description of this specification, "plurality" means at least two, such as two, three or more, etc., unless otherwise specifically defined.

While various embodiments of the invention have been illustrated and described, it will be obvious to those skilled in the art that such embodiments are provided by way of example only. Many modifications, changes and substitutions will occur to those skilled in the art without departing from the idea and spirit of the present invention. It should be understood that various alternatives to the embodiments of the invention described herein may be employed in practicing the invention. It is intended that the appended claims define the scope of the invention and therefore cover modular compositions, equivalents or alternatives within the scope of these claims.

Claims

A data burning method is characterized in that it is applied to a data analysis end; the method includes:

Divide the pre-acquired programming data into at least one programming unit according to the preset chip minimum programming unit size for storage, and each programming unit corresponds to one bit;

Scanning the data corresponding to each bit in turn, and when the data corresponding to the bit is valid data, marking the bit to obtain a storage mapping table;

Sequentially extract the valid data corresponding to the marked bits, and send the storage mapping table and the valid data to the burning terminal, so that the burning terminal can use the valid data set and the storage table to burn .
A data burning method is characterized in that it is applied to a burning terminal; the method comprises:

receiving the valid data and the storage mapping table sent by the data parsing end, and storing the valid data in the storage area in sequence;

When a programming request input by the user is received, a buffer area corresponding to the area to be written into the chip is constructed, the buffer area includes a plurality of buffer units, and each buffer unit corresponds to a bit of the storage mapping table;

reading valid data in the storage area corresponding to the marked bits in the storage mapping table, and storing the valid data in the buffer unit corresponding to the marked bits to obtain final programming data ;

Burn the final programming data into the chip.
The data burning method according to claim 2, wherein the burning request includes a data start bit and a data length of the burning data in the storage mapping table;

Reading the valid data in the storage area corresponding to the marked bit in the storage mapping table, and storing the valid data in the cache unit corresponding to the marked bit, to obtain the final burned record data, including:

Sequentially judge whether each bit within the data length range is a marked target bit starting from the data start bit in the storage mapping table;

If so, calculate the number of marked bits between the target bit and the first bit of the storage mapping table, and confirm the target bit from the storage area according to the number of marked bits Corresponding target valid data;

reading the target valid data, and writing the target valid data into a buffer unit corresponding to the target bit to obtain final programming data.
The data burning method according to claim 3, characterized in that the sequentially judging whether each bit in the data length range is marked starting from the data start bit in the storage mapping table After the target bit, also include:

If not, skip the bit and check if the next bit is marked.
The data burning method according to claim 3, characterized in that, after said obtaining the final burning data, further comprising:

Record the access data table between the target valid data and the cache unit.
The data burning method according to claim 2, wherein said burning said final burning data into the chip comprises:

When burning the final programming data to the chip, it is judged whether the data stored in the current programming unit is valid data;

If yes, then burn the current programming unit to the corresponding position on the chip, and then burn the next programming unit until the last programming unit;

If not, skip the current burning unit, and burn the next burning unit until the last burning unit.
A data burning device is characterized in that it comprises:

The dividing module is used to divide the pre-acquired programming data into at least one programming unit according to the preset minimum programming unit size of the chip, and each programming unit corresponds to one bit;

A scanning module, configured to sequentially scan the data corresponding to each bit, and when the data corresponding to the bit is valid data, mark the bit to obtain a storage mapping table;

The data sending module is used to sequentially extract the valid data corresponding to the marked bits, and send the storage mapping table and the valid data to the burning terminal, so that the burning terminal can use the valid data set and The storage table is programmed.
A data burning device is characterized in that it comprises:

The receiving module is used to receive the valid data and the storage mapping table sent by the data parsing end, and store the valid data in the storage area in sequence;

A construction module, configured to construct a cache area corresponding to the area to be written into the chip when receiving a burning request input by the user, the cache area includes a plurality of cache units, and each cache unit corresponds to a bit of the storage mapping table ;

A reading module, configured to read valid data in the storage area corresponding to the marked bits in the storage mapping table, and store the valid data in the cache unit corresponding to the marked bits , to get the final programming data;

The burning module is used for burning the final burning data into the chip.
A terminal, characterized in that the terminal includes a processor and a memory coupled to the processor, and program instructions are stored in the memory, and when the program instructions are executed by the processor, the processing The device executes the steps of the data burning method according to any one of claims 1-6.
A storage medium, characterized in that it stores a program file capable of realizing the data burning method according to any one of claims 1-6.