WO2018094937A1

WO2018094937A1 - Quick upgrade method for embedded software and embedded device

Info

Publication number: WO2018094937A1
Application number: PCT/CN2017/078847
Authority: WO
Inventors: 刘均; 周宁杰
Original assignee: 深圳市元征软件开发有限公司
Priority date: 2016-11-22
Filing date: 2017-03-30
Publication date: 2018-05-31
Also published as: CN106648751B; CN106648751A

Abstract

Disclosed in embodiments of the present invention are a quick upgrade method for embedded software and an embedded device. The method comprises: determining valid data in a target upgrade file, and dividing the valid data into N valid data blocks; reading an i ^th valid data block, and detecting whether the valid data block is identical to an original data block; if they are identical, adding 1 to i to obtain a new value of i, and determining whether the new value of i is larger than N, if not, returning to perform the step of reading the i ^th valid data block; if they are not identical, detecting whether all data in the valid data block consist of the same number in hexadecimal format, if yes, erasing the original data block, adding 1 to i to obtain a new value of i, and determining whether the new value of i is larger than N, if not, returning to perform the step of reading the i ^th valid data block; and if it is determined that the new value of i is larger than N, reading an end data block of the upgrade file and writing the same into a memory. The present invention can shorten the writing time of a file, and thus accelerate the upgrade speed of embedded software.

Description

Method for quickly upgrading embedded software and embedded device

[0001] Technical Field

[0002] The present invention relates to the field of embedded technologies, and in particular, to a method for quickly upgrading embedded software and an embedded device.

BACKGROUND

[0004] Embedded software is software based on embedded system design. It is a kind of computer software. It consists of programs and their documents. It can be subdivided into system software, supporting software and application software. It is an embedded system. An important part of. Embedded software is widely used in defense, industrial control, home, commercial, office, medical and other fields. For example, our common mobile phones, handheld computers, digital cameras, set-top boxes, MP3 players, etc. are all embedded products using traditional software technology. The result of intelligent transformation.

[0005] In the process of bursting embedded software, there may be unknown bugs. During the use of the user, these bugs may cause problems such as catastrophic or flashback. You need to upgrade the software to fix these bugs.

Embedded software can also be upgraded to add or adjust certain features to increase the versatility and usability of the software.

[0006] At present, many Micro Control Unit (MCU) chips can generally be upgraded by using a Bootstrap loader (Bootloader) method. The main upgrade process is to delete the data of the original file. Delete in memory, and burn the data of the upgrade file into the memory. To upgrade the embedded software in this way, you need to burn the data of all the upgrade files into the memory. If the upgrade file is large, the upgrade will take a long time.

SUMMARY OF THE INVENTION

[0008] The embodiment of the invention discloses a method for quickly upgrading an embedded software and an embedded device, which can shorten the file writing time, so as to speed up the upgrading speed of the embedded software.

[0009] The first aspect of the present invention also discloses a method for quickly upgrading an embedded software and an embedded device.

, including:

[0010] determining valid data in the target upgrade file, and dividing the valid data into N valid data blocks, where there is a correspondence between the N valid data blocks and the M data blocks, where the M and The N is Positive integer

[0011] reading the i-th valid data block from the N valid data blocks, detecting whether the i-th valid data block is the same as the j-th data block, and the j-th data block is the M One of the data blocks, the i-th data block corresponds to the j-th data block, and the i and the j are both positive integers;

[0012] If they are the same, the i is incremented by 1 to obtain a new i value, and it is determined whether the new i value is greater than N. If not, returning to perform the reading of the i th from the N valid data blocks. Steps of valid data blocks;

[0013] if not, detecting whether all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F, and if yes, the j-th data block Erasing from the memory unit, performing the step of adding 1 to the new i value, determining whether the new i value is greater than N, and returning to execute when the new i value is less than N吋The step of reading the i-th valid data block from the N valid data blocks;

[0014] when it is determined that the new i value is greater than N吋, reading the end data block of the upgrade file, erasing the end data block of the original file from the memory unit, and upgrading the The data block at the end of the file is written to the memory unit.

[0015] In an optional implementation manner, the method further includes:

[0016] if it is detected that all data in the i-th valid data block is not entirely composed of the same number in hexadecimal numbers 0 to F, the j-th data block is wiped from the memory unit Dividing, and writing the i-th valid data block to the memory unit, performing the step of adding 1 to the i to obtain a new i value, determining whether the new i value is greater than N, and The new i value is less than N吋, and the step of reading the ith valid data block from the N valid data blocks is performed.

[0017] In an optional implementation manner, before the determining the valid data in the target upgrade file, the method further includes:

[0018] reading a data block of the end of the target upgrade file, and obtaining a size of the valid data from the last data block.

[0019] In an optional implementation manner, the determining the valid data in the target upgrade file, and dividing the valid data into N valid data blocks includes:

[0020] determining valid data in the target upgrade file according to the size of the valid data and a preset location, and dividing the valid data into N valid data blocks according to the size of the valid data.

[0021] In an optional implementation manner, the size of the valid data block of any one of the N valid data blocks It is the same size as any one of the M data blocks.

[0022] The second aspect of the present invention also discloses an embedded device, including:

[0023] the processing unit is configured to determine valid data in the target upgrade file, and divide the valid data into N valid data blocks, where there is a correspondence between the N valid data blocks and the M data blocks. M and the N are both positive integers;

[0024] a reading unit, configured to read the i th valid data block from the N valid data blocks;

[0025] a detecting unit, configured to detect whether the i-th valid data block is the same as the j-th data block, the j-th data block is one of the M data blocks, and the i-th data a block corresponding to the jth data block, wherein the i and the j are both positive integers;

[0026] an operation unit, configured to: when the i-th valid data block is the same as the j-th data block, add 1 to a new i value;

[0027] a determining unit, configured to: when the computing unit adds 1 to the new i value, to determine whether the new i value is greater than N;

[0028] the reading unit is further configured to: when the determining unit determines that the result is negative, read the i th valid data block from the N valid data blocks;

[0029] the detecting unit is further configured to: when the i-th valid data block is different from the j-th data block, detecting whether all data in the i-th valid data block is all hexadecimal Number 0 to F in the same number

[0030] an erasing unit, configured to: when all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F, the j-th data block is Memory unit erase;

[0031] the operation unit is further configured to: after the erasing unit erases the jth data block from the memory unit, add the i to 1 to obtain a new i value;

[0032] the determining unit is further configured to: when the computing unit adds 1 to the new i value, to determine whether the new value of i is greater than N;

[0033] the reading unit is further configured to: when the determining unit determines that the result is 吋, read a data block at the end of the upgrade file;

[0034] the erasing unit is further configured to erase the end data block of the original file from the memory unit; [0035] the writing unit is further used for the end data block of the upgrade file Write to the memory unit. [0036] In an alternative implementation,

[0037] the erasing unit is further configured to: when detecting that all data in the i-th valid data block is not completely composed of the same number in hexadecimal numbers 0 to F, the jth The data block is erased from the memory unit; [0038] the writing unit is further configured to: after the erasing unit erases the jth data block from the memory unit, Writing an i-th valid data block to the memory unit;

[0039] the operation unit is further configured to: after the writing unit writes the i th valid data block into the memory unit, add the i to 1 to obtain a new i value;

[0040] the determining unit is further configured to: when the computing unit adds the i to 1 to obtain a new value of i, determine whether the new value of i is greater than N;

[0041] The reading unit is further configured to: when the determining unit determines that the result is negative, read the i th valid data block from the N valid data blocks.

[0042] In an alternative implementation,

[0043] The reading unit is further configured to read a data block at the end of the target upgrade file, and obtain a size of the valid data from the last data block.

[0044] In an optional implementation manner, the processing unit determines valid data in the target upgrade file, and the manner of dividing the valid data into N valid data blocks is specifically:

[0045] the processing unit determines a valid number in the target upgrade file according to the size of the valid data and a preset position, and divides the valid data into N valid data blocks according to the size of the valid data. .

[0046] In an alternative implementation,

[0047] The size of any one of the N valid data blocks is the same as the size of any one of the M data blocks.

[0048] It can be seen from the above technical solution that the embodiment of the present invention has the following advantages: only valid data in the upgrade file that is not completely composed of the same number of hexadecimal numbers 0 to F is written into the memory, in the upgrade file. The other data is not written into the memory, which can effectively shorten the writing time, speed up the upgrade of the embedded software, and solve the problem of the long time of the embedded software upgrade.

BRIEF DESCRIPTION OF THE DRAWINGS

[0050] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly described below. It is obvious that the drawings in the following description are only some of the present invention. For the embodiments, other drawings can be obtained from those skilled in the art without any inventive labor.

1 is a schematic flowchart of a method for rapidly upgrading an embedded software according to an embodiment of the present invention; [0052] FIG. 2 is a schematic diagram of another method for quickly upgrading an embedded software according to an embodiment of the present invention; [0053] FIG. 3 is a schematic structural diagram of an embedded device according to an embodiment of the present invention;

4 is a schematic diagram of a data storage according to an embodiment of the present invention;

5 is a schematic diagram of a data storage according to an embodiment of the present invention;

6 is a schematic diagram of a file before and after upgrading according to an embodiment of the present invention; [0056] FIG.

7 is a schematic structural diagram of another embedded device according to an embodiment of the present invention.

DETAILED DESCRIPTION

The present invention will be further described in detail with reference to the accompanying drawings, in which FIG. An embodiment. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without making creative labor are within the scope of the present invention.

Referring to FIG. 1, FIG. 1 is a schematic flowchart of a method for rapidly upgrading an embedded software according to an embodiment of the present invention. As shown in FIG. 1, the method for rapidly upgrading an embedded software includes the following steps.

[0061] 101. The embedded device determines valid data obtained in the target upgrade file.

[0062] Embedded devices may include, but are not limited to: traditional industrial control and business management equipment, such as smart industrial equipment, point of sale (POS), automatic teller machine (ATM), integration Integrated circuit card (IC) card, etc.; home field devices, such as set-top boxes, digital TVs, network refrigerators, network air conditioners, and many other consumer and healthcare electronic devices; in addition, multimedia phones, pocket computers, handheld computers , car navigator, etc.

[0063] The target upgrade file may also be referred to as an object file or an upgrade file, which is not distinguished in the embodiment of the present invention.

[0064] Optionally, the valid data is defined by an embedded system or an embedded software that includes the valid data, where the valid data is distributed in a certain location of the target upgrade file, such as a starting position of the target upgrade file, or a middle Location; wherein, the target upgrade file is a file that needs to be upgraded in the above embedded software.

[0065] Optionally, the target upgrade file is composed of three parts: valid data, invalid data, and last number According to which, the end data is the data at the end of the target upgrade file. For example, refer to Figure 6, in the upgraded object file in Figure 6, the end data includes check digits, such as the previous "31 and 41", The data also includes the size of the valid data, which may also be referred to as valid data. It is not distinguished in the embodiment of the present invention, such as the following four bytes "FF, 1C, FD, EF"; wherein, the invalid data is in addition to the valid data. And the data outside the end data, as shown in Figure 4 and Figure 5, the partial data consisting of FF, which has been defined by the embedded system or the embedded software containing the data before the upgrade.

[0066] 102. The embedded device divides the valid data into N valid data blocks, where the original file includes M data blocks, and there is a correspondence between the N valid data blocks and the M data blocks.

Wherein M and N are positive integers greater than or equal to 1.

[0068] wherein, the data block is a group or groups of records continuously arranged in sequence, and is a data unit for transferring between the main memory and the input device, the output device, or the external memory; the original file may also be referred to as The original file is a file stored in the memory of the embedded device. In this upgrade, the original file is replaced with the target upgrade file, and the data in the original file is completely or replaced with the data in the target upgrade file. The definition or description is specifically defined or described in the following steps.

[0069] The above correspondence can be discussed in three cases:

[0070] First, if M>N, the N valid data blocks correspond to N data blocks in the M data blocks of the original file.

[0071] Next, if M=N, the N valid data blocks are in one-to-one correspondence with the original file M data blocks.

[0072] Finally, if M<N, due to the upgrade of the embedded software, the actual modification range is not large. Therefore, the size of the valid data in the target upgrade file is small, that is, the possibility of M<N is not large.

[0073] 103. The embedded device reads the i th valid data block from the N valid data blocks.

In the embodiment of the present invention, the initial value of the above i is 1, and the first valid data block is read when the first reading is performed.

[0075] 104. The embedded device detects whether the i-th valid data block is the same as the j-th data block, the j-th data block is one of M data blocks, and the i-th data block corresponds to the j-th data block. .

[0076] wherein, i and j are both positive integers, and both are greater than one.

[0077] Optionally, the size of any one of the N valid data blocks is the same as the size of any one of the M data blocks. [0078] Optionally, detecting whether the i-th valid data block is identical to the j-th data block comprises: detecting whether the size and data of the i-th valid data block are the same as the size and data of the j-th data block.

[0079] In the embodiment of the present invention, if the embedded device detects that the i-th valid data block is the same as the j-th data block, the step of performing i plus 1 to obtain a new i value is performed, that is, the j-th data is not to be The block is erased from the memory unit, and the i-th valid data block is not written to the memory. After i is incremented by 1, the new i value (i<N) is returned, and the i-th reading is returned (notably, this吋i is the new i value) valid data block; if the embedded device detects that the i-th valid data block is different from the j-th data block, then it is performed to detect whether all data in the i-th valid data block is full A step consisting of the same number in hexadecimal numbers 0 through F.

[0080] 105. The embedded device detects whether all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F.

[0081] In the embodiment of the present invention, the embedded device detects whether all data in the i valid data blocks are all hexadecimal numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, The same number in A, B, C, D, and F.

[0082] 106. The embedded device erases the jth data block from the memory unit.

[0083] wherein, the memory unit is a memory size occupied by storing one data block, and can be understood as a unit for storing one data block.

[0084] The above erasing of the jth data block from the memory unit can be understood as erasing the data in the jth data block from the memory unit.

In the embodiment of the present invention, if the embedded device detects that all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F, the embedded device will use the j-th data. The block is erased from the memory unit and the ith valid data block is not written to the memory unit. For example, if the valid data of the target upgrade file is the first 10 rows, there are 10 valid data blocks for each data block, and the data in the 6th to 10th rows of data blocks are all hexadecimal numbers 0. To a certain number of F, it is possible to make the data of the 6th to 10th data blocks all consist of 0, 1, 2, 3, 4 and 5. Then, the embedded device erases the jth data block from the memory unit, and the 6th to 10th data blocks are not written into the memory, that is, erased, but not written. The data blocks of the first row to the fifth row are written to the memory cell after the embedded device erases the jth data block from the memory cell, as shown in FIG. 6.

[0086] 107. The embedded device adds i to 1 to obtain a new i value.

[0087] wherein, i is a positive integer less than or equal to N before adding 1, and a new i value is obtained when 1 is added, the new i The value may be greater than N.

[0088] 108. The embedded device determines whether the new value of i is greater than N.

In the embodiment of the present invention, the embedded device determines whether the new i value is greater than N, and if it is less than N, returns to step 103, that is, executing the embedded device to read the i th valid data from the N valid data blocks. The step of the block; if greater than N, the step of reading the end data block of the upgrade file is performed.

[0090] 109. The embedded device reads the end data block of the upgrade file.

[0091] 110. The embedded device erases the end data block of the original file from the memory unit, and writes the end data block of the upgrade file to the memory unit.

[0092] wherein, the last data block is a data block at the end of the target upgrade file, and the data block includes a check digit, such as the foregoing "31 and 41", and also includes the size of the valid data, which may also be called For the valid data, no distinction is made in the embodiment of the present invention, such as the following four bytes "FF, 1C, FD, EF".

[0093] The above erasing the end data block of the original file from the memory unit can be understood as erasing the data of the end data block of the original file from the memory unit.

[0094] In the embodiment of the present invention, when it is determined that the new i value is greater than N吋, the embedded device reads the end data block of the upgrade file, and erases the end data block of the original file from the memory unit, and the file is upgraded. The last data block is written to the memory unit, and after the step of writing the last data block to the memory unit, the writing of the target upgrade file is completed.

[0095] In short, the embodiment of the present invention can determine valid data of the target upgrade file, and divide the valid data into N data blocks, if there are a (a<N) data blocks respectively. Same as a data block in the original file, the a valid data block is not written into the memory, and the corresponding original data block is not deleted; if the b valid data blocks are different from the original file, and b All data in any valid data block of the valid data block is composed of the same number in hexadecimal numbers 0 to F, then the corresponding original data block is erased from the memory, but the above b valid data The block is not written to memory, where a+b≤N.

[0096] According to the solution of the embodiment of the present invention, valid data in the upgrade file is determined, and valid data consisting of the same number of hexadecimal numbers 0 to F is not written into the memory, and invalid data is not written into the memory. It can reduce the data written in the memory, improve the writing efficiency, effectively shorten the writing time, thereby speeding up the upgrade speed of the embedded software, and solving the problem that the embedded software upgrade takes a long time.

Please refer to FIG. 2. FIG. 2 is a flow chart of another method for quickly upgrading embedded software according to an embodiment of the present invention. Schematic diagram, FIG. 2 is further optimized based on FIG. 1. As shown in FIG. 2, the method for quickly upgrading the embedded software includes the following steps.

[0098] 201. The embedded device reads the end data block of the target upgrade file, and obtains the size of the valid data from the last data block.

[0099] Optionally, the valid data is defined by an embedded system or an embedded software that includes the valid data, where the valid data is distributed in a certain location of the target upgrade file, such as a starting position of the target upgrade file, or a middle Location; wherein, the target upgrade file is a file that needs to be upgraded in the above embedded software.

[0100] Optionally, the foregoing target upgrade file is composed of three parts: valid data, invalid data, and last data. The end data is the data at the end of the target upgrade file. For example, refer to Figure 6, in the upgraded object file in Figure 6, the end data includes check digits, such as the previous "31 and 41", the data Also included is the size of the valid data, which may also be referred to as valid data, which is not distinguished in the embodiment of the present invention, such as the following four bytes "FF, 1C, FD, EF"; wherein, invalid data is in addition to valid data and the end Data outside the data, such as partial data consisting of FFs in Figures 4 and 5, which have been defined by the embedded system or embedded software containing the data prior to the upgrade.

[0101] In the embodiment of the present invention, the embedded device reads the end data block of the target upgrade file, and knows the size of the valid data from the last four bytes "FF, 1C, FD, EF" of the last data block.

[0102] 202. The embedded device determines valid data in the target upgrade file according to the size of the valid data and the preset location.

[0103] In the embodiment of the present invention, the size of the valid data and the preset location determine valid data in the target upgrade file.

. The preset position is the starting position of the valid data, and its setting is determined by the embedded system or embedded software containing the data.

[0104] 203. The embedded device divides the valid data into N valid data blocks according to the size of the valid data.

[0105] 204. The embedded device reads the i th valid data block from the N valid data blocks.

[0106] 205. The embedded device detects whether the i-th valid data block is the same as the j-th data block, the j-th data block is one of M data blocks, and the i-th data block corresponds to the j-th data block. .

[0107] 206. The embedded device detects whether all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F.

[0108] The specific implementation manner of the foregoing steps 203-206 can refer to the embedded software fast upgrade method described in FIG. Steps 102-105, which are not described in detail in the embodiments of the present invention.

[0109] 207. The embedded device erases the jth data block from the memory unit, and writes the i-th valid data block into the memory unit.

[0110] When the embedded device detects that all data in the i-th valid data block is not completely composed of the same number in hexadecimal numbers 0 to F, the j-th data block is erased from the memory unit, and The i-th valid data block is written to the memory unit.

[0111] 208. The embedded device erases the jth data block from the memory unit.

[0112] The specific implementation of the foregoing step 208 may refer to the step 106 of the embedded software rapid upgrade method described in FIG. 1 , which is not described in detail in the embodiment of the present invention.

[0113] 209. The embedded device adds i to 1 to obtain a new value of i.

[0114] 210. The embedded device determines whether the value of i is greater than N.

[0115] 211. The embedded device reads the end data block of the upgrade file.

[0116] 212. The embedded device erases the end data block of the original file from the memory unit, and writes the end data block of the upgrade file to the memory unit.

[0117] The specific implementation manners of the foregoing steps 209-212 may refer to steps 107-110 of the embedded software rapid upgrade method described in FIG. 1, which are not detailed in the embodiments of the present invention.

[0118] In short, the embodiment of the present invention obtains valid data information from the end data block of the target upgrade file, determines valid data of the target upgrade file according to the information, and divides the valid data into N data blocks and N valid data. In the block, if a (a<N) data blocks are the same as a data block in the original file, the a valid data block is not written into the memory, and the corresponding original data block is not deleted; b valid data blocks are different from the original file data, and all data in any valid data block in b (b<N) valid data blocks are all composed of the same number in hexadecimal numbers 0 to F , the corresponding original data block is erased from the memory, but the above b valid data blocks are not written into the memory; if all data in any valid data block of t (t<N) valid data blocks is not all ten When the hexadecimal numbers 0 to F are composed of the same number, the corresponding original data block is erased from the memory, and the above b valid data blocks are not written into the memory, where a+b+t=N.

[0119] With the solution of the embodiment of the present invention, only valid data that is not composed of the same number of hexadecimal numbers 0 to F in the upgrade file may be written into the memory, and data of the last data block is written into the memory. Other numbers According to the memory not written, such as invalid data and the same data consisting of the same number of hexadecimal numbers 0 to F are not written into the memory, which can effectively improve the writing efficiency, shorten the writing time, and speed up The upgrade speed of embedded software solves the problem of long time spent on embedded software upgrades.

Referring to FIG. 3, FIG. 3 is a schematic structural diagram of an embedded device according to an embodiment of the present invention. As shown in FIG. 3, the embedded device includes:

[0121] The processing unit 301 is configured to determine valid data in the target upgrade file, and divide the valid data into N valid data blocks, where the N valid data blocks and the M data blocks have a corresponding relationship.

M and the above N are both positive integers.

[0122] The reading unit 302 is configured to read the i th valid data block from the N valid data blocks;

[0123] The detecting unit 303 is configured to detect whether the i-th valid data block is the same as the j-th data block, and the j-th data block is one of the M data blocks, the i-th data block and the j-th data block. Correspondingly, i and j are both positive integers; [0124] an operation unit 304, configured to: when the ith valid data block is the same as the jth data block, add i to 1 to obtain a new i value;

[0125] The determining unit 305 is configured to: when the computing unit 304 adds i to 1 to obtain a new value of i, determine whether the new value of i is greater than ^

[0126] The reading unit 302 is further configured to: when the determining unit 305 determines that the result is negative, read the i-th valid data block from the N valid data blocks.

[0127] The detecting unit 303 is further configured to: when the i-th valid data block is different from the j-th data block, detecting whether all data in the i-th valid data block is all hexadecimal 0 to F The same number in the middle;

[0128] The erasing unit 306 is configured to: when all the data in the i-th valid data block is composed of the same number in the hexadecimal numbers 0 to F, the j-th data block is wiped from the memory unit Save

[0129] The operation unit 304 is further configured to: after the erasing unit 306 erases the jth data block from the memory unit, add 1 to 1 to obtain a new value of i.

[0130] The determining unit 305 is further configured to: when the computing unit adds the above i to get a new i value, determine whether the new i value is greater than N.

The reading unit 302 is further configured to read the end data block of the upgrade file when the determining unit 305 determines that the result is 吋.

[0132] The above-mentioned erasing unit 306 is further configured to erase the end data block of the original file from the memory unit [0133] The writing unit 307 writes the last data block for the above upgrade file into the above memory unit.

[0134] The above-mentioned erasing unit 306 is further configured to: when detecting that all data in the i-th valid data block is not completely composed of the same number in the hexadecimal numbers 0 to F, the j-th data block is from the memory Erase in the cell.

[0135] The writing unit 307 is further configured to write the i th valid data block to the memory unit after the erasing unit 306 erases the jth data block from the memory unit.

[0136] The operation unit 304 is further configured to add i to 1 to obtain a new value of i after the writing unit 307 writes the i-th valid data block to the memory unit.

[0137] The determining unit 305 is further configured to: when the computing unit 304 adds the above i to get a new i value, determine whether the new i value is greater than N.

[0138] The reading unit 302 is further configured to: when the determining unit 305 determines that the result is negative, read the i th valid data block from the N valid data blocks.

[0139] The reading unit 302 is further configured to read the end data block of the target upgrade file, and obtain the size of the valid data from the last data block.

[0140] The processing unit 301 determines a valid number in the target upgrade file according to the size of the valid data and a preset position, and divides the valid data into N valid data blocks according to the size of the valid data.

[0141] wherein, the size of any one of the N valid data blocks is the same as the size of any one of the M data blocks.

[0142] With the embedded device, the following method steps can be performed:

[0143] (1) The reading unit 302 reads the end data block of the target upgrade file, and obtains the size of the valid data from the last data block.

[0144] Optionally, the valid data is defined by an embedded system or an embedded software that includes the valid data, where the valid data is distributed in a certain location of the target upgrade file, such as a starting position of the target upgrade file, or a middle Location; wherein, the target upgrade file is a file that needs to be upgraded in the above embedded software.

[0145] Optionally, the target upgrade file is composed of three parts: valid data, invalid data, and end data. The end data is the data at the end of the target upgrade file. For example, refer to Figure 6, in the upgraded object file in Figure 6, the end data includes check digits, such as the previous "31 and 41", the data Still The size of the valid data, which may also be referred to as the length of the valid data, is not distinguished in the embodiment of the present invention, such as the following four bytes "FF, 1C, FD, EF"; wherein the invalid data is in addition to the valid data and the end Data outside the data, such as partial data consisting of FFs in Figures 4 and 5, which have been defined by the embedded system or embedded software containing the data prior to the upgrade.

[0146] In the embodiment of the present invention, the embedded device reads the end data block of the target upgrade file, and knows the size of the valid data from the last four bytes "FF, 1C, FD, EF" of the last data block.

[0147] (2) The processing unit 301 determines valid data in the target upgrade file according to the size of the valid data and the preset position.

[0148] In the embodiment of the present invention, the size of the valid data and the preset location determine valid data in the target upgrade file. The preset position is the starting position of the valid data, and its setting is determined by the embedded system or embedded software containing the data.

[0149] (3) The processing unit 301 divides the valid data into N valid data blocks according to the size of the valid data.

[0150] wherein the original file includes M data blocks, and there is a correspondence between the N valid data blocks and the M data blocks.

Wherein M and N are positive integers greater than or equal to 1.

[0152] wherein the data block is a group or groups of records continuously arranged in sequence, and is a data unit for transmitting between the main memory and the input device, the output device, or the external memory; the original file may also be referred to as The original file is a file stored in the memory of the embedded device. In this upgrade, the original file is replaced with the target upgrade file, and the data in the original file is completely or replaced with the data in the target upgrade file. The definition or description is specifically defined or described in the following steps.

[0153] The above correspondence can be discussed in three cases:

[0154] First, if M>N, the N valid data blocks correspond to N data blocks in the M data blocks of the original file.

[0155] Next, if M=N, the N valid data blocks are in one-to-one correspondence with the original file M data blocks.

[0156] Finally, if M<N, due to the upgrade of the embedded software, the actual modification scope is not large. Therefore, the size of the valid data in the target upgrade file is small, that is, the possibility of M<N is not large.

[0157] (4) The reading unit 302 reads the i-th valid data block from the N valid data blocks.

[0158] In the embodiment of the present invention, the initial value of the above i is 1, and the first valid number is read when the first reading is performed. According to the block.

[0159] (5) The detecting unit 303 detects whether the i-th valid data block is the same as the j-th data block, and the j-th data block is one of M data blocks, the i-th data block and the j-th data block. correspond.

[0160] wherein, i and j are both positive integers, and both are greater than one.

[0161] Optionally, the size of any one of the N valid data blocks is the same as the size of any one of the M data blocks.

[0162] Optionally, detecting, by the detecting unit 303, whether the i-th valid data block and the j-th data block are the same include: detecting whether the size and data of the i-th valid data block are the same as the size and data of the j-th data block .

[0163] In the embodiment of the present invention, if the detecting unit 303 detects that the i-th valid data block is the same as the j-th data block, the step of performing i plus 1 to obtain a new i value is performed, that is, the j-th data is not to be obtained. The block is erased from the memory unit, and the i-th valid data block is not written to the memory. After i is incremented by 1, the new i value (i<N) is returned, and the i-th reading is returned (notably, this Ii is a new i value) valid data block; if the detecting unit 303 detects that the i th valid data block is different from the jth data block, performing detection of whether all data in the i th valid data block is full A step consisting of the same number in hexadecimal numbers 0 through F.

[0164] (6) The detecting unit 303 detects whether all data in the i-th valid data block is composed entirely of the same number in hexadecimal numbers 0 to F.

[0165] In the embodiment of the present invention, the detecting unit 303 detects whether all data in the i valid data blocks are all hexadecimal numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, The same number in A, B, C, D, and F.

[0166] (7) The erase unit 306 erases the jth data block from the memory unit, and the write unit 307 writes the i-th valid data block to the memory unit.

[0167] When the detecting unit 303 detects that all the data in the i-th valid data block is not entirely composed of the same number in the hexadecimal numbers 0 to F, the erasing unit 306 takes the j-th data block from the memory unit. The erase, write unit 307 writes the ith valid data block to the memory unit.

[0168] (8) The erase unit 306 erases the jth data block from the memory unit.

[0169] wherein, the memory unit is a memory size occupied by storing one data block, and can be understood as a unit for storing one data block.

[0170] The above erasing of the jth data block from the memory unit can be understood as erasing data in the jth data block from the memory unit. [0171] In the embodiment of the present invention, if the embedded device detects that all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F, the embedded device will use the j-th data. The block is erased from the memory unit and the ith valid data block is not written to the memory unit. For example, if the valid data of the target upgrade file is the first 10 rows, there are 10 valid data blocks for each data block, and the data in the 6th to 10th rows of data blocks are all hexadecimal numbers 0. To a certain number of F, it is possible to make the data of the 6th to 10th data blocks all consist of 0, 1, 2, 3, 4 and 5. Then, the embedded device erases the jth data block from the memory unit, and the 6th to 10th data blocks are not written into the memory, that is, erased, but not written. The data blocks of the first row to the fifth row are written to the memory cell after the embedded device erases the jth data block from the memory cell, as shown in FIG. 6.

[0172] (9) The arithmetic unit 304 increments i by 1 to obtain a new value of i.

[0173] wherein, i is a positive integer less than or equal to N before adding 1, and a new i value is obtained when 1 is added, and the new i value may be greater than N.

[0174] (10) The judging unit 305 judges whether or not the value of i is greater than N.

In the embodiment of the present invention, the determining unit 305 determines whether the new value of i is greater than N, and if it is less than N, returns to step 103, that is, executing the embedded device to read the ith effective data from the N valid data blocks. Step of the block; if greater than N, the reading unit 302 reads the end data block of the upgrade file.

[0176] (11) The reading unit 302 reads the end data block of the upgrade file.

[0177] (12) The erasing unit 306 erases the end data block of the original file from the memory unit, and the writing unit 307 writes the end data block of the upgrade file to the memory unit.

[0178] wherein, the last data block is a data block at the end of the target upgrade file, and the data block includes a check digit, such as the foregoing "31 and 41", and also includes the size of the valid data, which may also be called The length of the valid data is not distinguished in the embodiment of the present invention, such as the following four bytes "FF, 1C, FD, EF".

[0179] The above erasing of the end data block of the original file from the memory unit can be understood as erasing the data of the end data block of the original file from the memory unit.

[0180] In the embodiment of the present invention, when it is determined that the new i value is greater than N吋, the reading unit 302 reads the end data block of the upgrade file, and erases the last data block of the original file from the memory unit, and the upgrade file is upgraded. The end of the data block is written to the memory unit, and after the step of writing the end data block to the memory unit, the writing of the target upgrade file is completed. [0181] In short, the embodiment of the present invention obtains valid data information from the end data block of the target upgrade file, determines valid data of the target upgrade file according to the information, and divides the valid data into N data blocks and N valid data. In the block, if a (a<N) data blocks are the same as a data block in the original file, the a valid data block is not written into the memory, and the corresponding original data block is not deleted; b valid data blocks are different from the original file data, and all data in any valid data block in b (b<N) valid data blocks are all composed of the same number in hexadecimal numbers 0 to F , the corresponding original data block is erased from the memory, but the above b valid data blocks are not written into the memory; if all data in any valid data block of t (t<N) valid data blocks is not all ten When the hexadecimal numbers 0 to F are composed of the same number, the corresponding original data block is erased from the memory, and the above b valid data blocks are not written into the memory, where a+b+t=N.

[0182] According to the solution of the embodiment of the present invention, only valid data that is not composed of the same number of hexadecimal numbers 0 to F in the upgrade file may be written into the memory, and data of the last data block is written into the memory. Other data is not written to the memory. For example, invalid data and valid data consisting of the same number in hexadecimal numbers 0 to F are not written into the memory, which can effectively improve the writing efficiency and shorten the writing time. , speed up the upgrade of embedded software, and solve the problem of long-term cost of embedded software upgrades.

Please refer to FIG. 7. FIG. 7 is a schematic structural diagram of another embedded device according to an embodiment of the present invention. As shown in FIG. 7, the embedded device includes:

[0184] The input device 701, the output device 702, the processor 703, and the memory 704, and the communication input 701, the output device 702, the processor 703, and the memory 704 are connected by a bus 705.

[0185] The input device 701 may be specifically a USB interface, a keyboard, a mouse, or the like.

[0186] The output device 702 described above may specifically be a display screen or an indicator light.

[0187] The above memory 704 may be a high speed RAM memory or a non-volatile memory such as a disk memory. The above memory 704 is used to store a set of program codes, and the input device 701, the output device 702, and the processor 703 are used to call the program code stored in the memory 704, and perform the following operations:

[0188] The processor 703 is configured to:

[0189] The original file is upgraded, and the original file includes M data blocks, including:

[0190] determining valid data in the target upgrade file, and dividing the valid data into N valid data blocks, N There is a correspondence between valid data blocks and M data blocks, and M and N are positive integers;

[0191] reading the i-th valid data block from the N valid data blocks, detecting whether the i-th valid data block is the same as the j-th data block, and the j-th data block is one of M data blocks, i data blocks correspond to the jth data block, and i and j are positive integers;

[0192] If they are the same, add i to 1 to obtain a new value of i, determine whether the new value of i is greater than N, and if not, return to perform the step of reading the i-th valid data block from the N valid data blocks;

[0193] If not, detecting whether all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F, and if so, wiping the j-th data block from the memory unit Except, the step of adding i to 1 to obtain a new i value, judging whether the new i value is greater than N, and returning the execution of the i th valid data from the N valid data blocks when the new i value is less than N吋Block step

[0194] When it is judged that the new i value is greater than N吋, the end data block of the upgrade file is read, the end data block of the original file is erased from the memory unit, and the end data block of the upgrade file is written into the memory unit.

[0195] Optionally, the processor 703 is further configured to:

[0196] if it is detected that all data in the ith valid data block is not completely composed of the same number in hexadecimal numbers 0 to F, the jth data block is erased from the memory unit, and The ith valid data block is written into the memory unit, and the i is incremented by 1 to obtain a new I. It is determined whether the new i value is greater than N. If not, the ith data of the N valid data blocks is read and executed. The steps of the block.

[0197] Optionally, the foregoing processor 703 is further configured to: before determining valid data in the target upgrade file, the method further includes:

[0198] reading the last data block of the target upgrade file, and obtaining the size of the valid data from the last data block.

[0199] Optionally, the foregoing processor 703 is further configured to:

[0200] determining valid data in the target upgrade file according to the size of the valid data and the preset position, and dividing the valid data into N valid data blocks according to the size of the valid data.

[0201] wherein, the size of any one of the N valid data blocks is the same as the size of any one of the M data blocks.

[0202] According to the solution of the embodiment of the present invention, only valid data that is not composed of the same number of hexadecimal numbers 0 to F in the upgrade file may be written into the memory, and data of the last data block is written into the memory. Other numbers According to the memory not written, such as invalid data and the same data consisting of the same number of hexadecimal numbers 0 to F are not written into the memory, which can effectively improve the writing efficiency, shorten the writing time, and speed up The upgrade speed of embedded software solves the problem of long time spent on embedded software upgrades.

While the invention has been described in terms of the specific embodiments and embodiments thereof, it will be understood that various modifications and combinations may be made without departing from the spirit and scope of the invention. Accordingly, the description and drawings are to be regarded as It is apparent that those skilled in the art can make various modifications and variations to the invention without departing from the spirit and scope of the invention. Thus, it is intended that the present invention cover the modifications and modifications of the invention

technical problem

Problem solution

Advantageous effects of the invention

Claims

Claim

[Claim 1] A method for rapidly upgrading an embedded software, wherein the method is used to upgrade an original file, where the original file includes M data blocks, and the method includes: determining a target upgrade file The valid data is divided into N valid data blocks, and the N valid data blocks and the M data blocks have a corresponding relationship, and the M and the N are positive integers;

Reading the i-th valid data block from the N valid data blocks, detecting whether the i-th valid data block is the same as the j-th data block, and the j-th data block is the M data block And the i-th data block corresponds to the j-th data block, and the i and the j are both positive integers;

If they are the same, the i is incremented by 1 to obtain a new i value, and it is determined whether the new i value is greater than N. If not, returning to perform the reading of the i th valid data from the N valid data blocks. Block step

If not, detecting whether all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F, and if so, the j-th data block is from the memory unit Erasing, performing the step of adding 1 to i to obtain a new i value, determining whether the new i value is greater than N, and returning execution of the slave from when the new i value is less than N吋The step of reading the i th valid data block in the N valid data blocks;

When it is determined that the new i value is greater than N吋, reading the end data block of the upgrade file, erasing the end data block of the original file from the memory unit, and ending the upgrade file A data block is written to the memory unit.

[Claim 2] The method according to claim 1, wherein the method further comprises:

If it is detected that all data in the i-th valid data block is not entirely composed of the same number in hexadecimal numbers 0 to F, the j-th data block is erased from the memory unit, and Writing the ith valid data block into the memory unit, performing the step of adding 1 to the new i value, determining whether the new i value is greater than N, and when the new If the value of i is less than N吋, returning to perform the reading of the i th valid data block from the N valid data blocks

[Claim 3] The method according to claim 1, wherein before the determining the valid data in the target upgrade file, the method further includes:

Reading the last data block of the target upgrade file, and obtaining the size of the valid data from the last data block.

[Claim 4] The method according to claim 3, wherein: determining the valid data in the target upgrade file, and dividing the valid data into N valid data blocks comprises: according to the size of the valid data Determining valid data in the target upgrade file with a preset location, and dividing the valid data into N valid data blocks according to the size of the valid data.

[Claim 5] The method according to any one of claims 1 to 4, characterized in that

The size of any one of the N valid data blocks is the same as the size of any one of the M data blocks.

[Claim 6] An embedded device, comprising:

The processing unit is configured to determine valid data in the target upgrade file, and divide the valid data into N valid data blocks, where there is a correspondence between the N valid data blocks and the M data blocks, where the M and The N is a positive integer;

a reading unit, configured to read an i th valid data block from the N valid data blocks, and a detecting unit, configured to detect whether the i th valid data block and the j th data block are the same, The j data blocks are one of the M data blocks, the i-th data block corresponds to the j-th data block, and the i and the j are both positive integers; The i-th valid data block is the same as the j-th data block, and the i is incremented by 1 to obtain a new i value;

a determining unit, configured to: when the computing unit adds 1 to the i to obtain a new i value, determining the Whether the new i value is greater than N;

The reading unit is further configured to: when the determining unit determines that the result is negative, read the i th valid data block from the N valid data blocks;

The detecting unit is further configured to: when the i-th valid data block is different from the j-th data block, detecting whether all data in the i-th valid data block is all from a hexadecimal number 0 to The same number in F;

An erasing unit, configured to: when all data in the i-th valid data block is composed of the same number in hexadecimal numbers 0 to F, wipe the j-th data block from the memory unit Save

The operation unit is further configured to: after the erasing unit erases the jth data block from the memory unit, add the i to 1 to obtain a new i value;

The determining unit is further configured to: when the computing unit adds the i to 1 to obtain a new i value, determine whether the new i value is greater than N;

The reading unit is further configured to: when the determining unit determines that the result is 吋, read a data block at the end of the upgrade file;

The erasing unit is further configured to erase the end data block of the original file from the memory unit;

a write unit, the end data block for the upgrade file is written to the memory unit.

[Claim 7] The apparatus according to claim 6, wherein

The erasing unit is further configured to: when detecting that all data in the i-th valid data block is not completely composed of the same number in hexadecimal numbers 0 to F, the j-th data block is The writing unit is further configured to: after the erasing unit erases the jth data block from the memory unit, the i-th valid data block Writing to the memory unit; the operation unit is further configured to: after the writing unit writes the i-th valid data block into the memory unit, add the i to 1 to obtain a new i value;

The determining unit is further configured to: when the computing unit adds 1 to the i to obtain a new i value, Whether the new i value is greater than N;

The reading unit is further configured to: when the determining unit determines that the result is negative, read the i th valid data block from the N valid data blocks.

[Claim 8] The apparatus according to claim 6, wherein

The reading unit is further configured to read a data block of the end of the target upgrade file, and obtain a size of the valid data from the last data block.

[Claim 9] The device according to claim 8, wherein the processing unit determines valid data in the target upgrade file, and the manner in which the valid data is divided into N valid data blocks is:

The processing unit determines a valid number in the target upgrade file according to the size of the valid data and a preset position, and divides the valid data into N valid data blocks according to the size of the valid data.

[Claim 10] The apparatus according to any one of claims 6 to 9, characterized in that