MATCH ANALYSIS FOR ENCODING OPTIMIZED UPDATE PACKAGES

• US 20130047145A1
• Filed: 04/23/2010
• Published: 02/21/2013
• Est. Priority Date: 04/23/2010
• Status: Abandoned Application

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Cui, Quan-Jie
• Application Number:
  US13/640,751
• Publication Number:
  US 20130047145A1
• Time in Patent Office: Days
• US Class Current: 717/168
• CPC Class Codes: G06F 8/65 Updates security arrangements therefor G06F21/57
• CPC Class Codes: G06F 8/654 using techniques specially adapted for alterable solid state memories, e.g. for EEPROM or flash memories
• CPC Class Codes: G06F 8/658 Incremental updates; Differential updates

Abstract

Various embodiments relate to optimization of an update package by performing analysis of matches. In some embodiments, a mechanism is provided to receive an updated executable file and a previous executable file. In addition, a mechanism is provided to determine a plurality of matches, each match representing a set of commands used to generate a portion of the updated executable file using the previous executable file. Furthermore, a mechanism is provided to analyze the matches and, based on the analysis, encode an optimized update package.

Claims

1. A machine-readable storage medium encoded with instructions executable by a processor of a computing device, the machine-readable storage medium comprising:

instructions for receiving an updated executable file and a previous executable file;

instructions for determining a plurality of matches, each match representing a set of commands used to generate a portion of the updated executable file using the previous executable file;

instructions for comparing a matching with mismatches technique with a matching without mismatches technique for each of the plurality of matches;

instructions for selecting an optimal technique that provides a minimal cost for each respective match of the plurality of matches, wherein the optimal technique is either the matching with mismatches technique or the matching without mismatches technique;

instructions for encoding an optimized update package, the optimized update package applying the optimal technique selected for each respective match.

2. The machine-readable storage medium of claim 1, wherein each command represented by a particular match is selected from the group consisting of a copy command and a set pointer command.

3. The machine-readable storage medium of claim 2, wherein:

the instructions for selecting the optimal technique determine an optimal location in the particular match that provides a minimal cost when utilizing the matching with mismatches technique, and

the instructions for encoding the optimized update package utilize the copy command in combination with zero or more set pointer commands up to the optimal location in the particular match and utilize a set command after the optimal location.

4. The machine-readable storage medium of claim 2, wherein:

when the optimal technique for the particular match is the matching without mismatches technique, the instructions for outputting the optimized update package utilize only a copy command for the particular match.

5. The machine-readable storage medium of claim 1, wherein:

each match includes at least one check unit, and

the boundaries of each check unit correspond to command boundaries created by the matching without mismatches technique.

6. The machine-readable storage medium of claim 5, wherein:

the instructions for comparing the techniques comprise instructions for determining, for each of the plurality of matches;

a local cost decrement and a local cost increment obtained at each of a plurality of locations in selected check units of the match by using the matching with mismatches technique, and

a total cost decrement and a total cost increment obtained at a boundary of each check unit in the match by using the matching with mismatches technique.

7. The machine-readable storage medium of claim 6, wherein:

when the total cost decrement exceeds the total cost increment for at least one check unit, the optimized update package uses the matching with mismatches technique up to a check unit boundary at which the difference between the total cost decrement and the total cost increment is maximized, and

when the local cost decrement exceeds the local cost increment for at least one location, the optimized update package uses the matching with mismatches technique at least up to a location at which the difference between the local cost decrement and the local cost increment is maximized.

8. The machine-readable storage medium of claim 5, wherein:

the instructions for comparing the techniques comprise instructions for determining a position at which a greatest local cost savings is obtained in each respective check unit by using the matching with mismatches technique, if such a position exists,

the optimized update package uses a single copy command for the entire match,

when there is a position at which a greatest local savings is obtained for the respective check unit, the optimized update package uses the matching with mismatches technique up to the position and uses an inner set data command subsequent to the position in the respective check unit,

when there is no position at which a greatest local cost savings is obtained for the respective check unit, the optimized update package uses the inner set data command for encoding an entire mismatches portion of the check unit.

9. A computing device comprising:

a processor; and

a machine-readable storage medium encoded with instructions executable by the processor, the machine-readable storage medium comprising;

instructions for receiving an updated executable file and a previous executable file,

instructions for determining a plurality of matches, each match representing a set of commands used to generate a portion of the updated executable file using the previous executable file, wherein each match represents a combination of copy and set pointer commands,

instructions for analyzing each match to determine an optimal number of set pointer commands that minimizes a cost of encoding the match, wherein the optimal number of set pointer commands is between zero and a number of set pointer commands included in the match, and

instructions for encoding an optimized update package, the optimized update package including the optimal number of set pointer commands in each match.

10. The computing device of claim 9, wherein the instructions for analyzing determine the optimal number of set pointer commands for a particular match by determining a position of a set pointer command at which the difference between a cost decrement gained by using the set pointer command and a cost increment imposed by using the set pointer command is maximized.

11. The computing device of claim 10, wherein, for a first check unit of the match that contains a combination of copy and set pointer commands:

when the difference between a total cost decrement and a total cost increment for the entire first check unit of the match is non-negative, the instructions for analyzing select the entire first check unit of the match including all set pointer commands, and

when the difference between the total cost decrement and the total cost increment for the entire first check unit of the match is negative, the instructions for analyzing select the match up to a local position of the set pointer command at which the difference is maximized, if such a local position exists.

12. A method for minimizing a size of an update package, the method comprising:

determining a plurality of matches between an updated executable file and a previous executable file, each match representing a set of commands used to generate a portion of the updated executable file using the previous executable file, wherein the set of commands includes a copy command and zero or more set pointer commands;

analyzing each match to determine a cost increment imposed by each set pointer commands in the match and a cost decrement obtained by avoiding duplication of bytes contained in the previous executable file;

comparing the cost increment and the cost decrement for each match to determine whether to use the matching with mismatches technique or a matching without mismatches technique for the match; and

encoding an optimized update package, the optimized update package using the determined technique for each match.

13. The method of claim 12, wherein comparing the cost increment and the cost decrement for each match comprises:

determining a difference between the cost decrement and the cost increment at each set pointer command location in the match,

when there is at least one location at which the difference is non-negative, using the matching with mismatches technique up to a location at which the difference is maximized and using a set section after the location, and

when the difference is negative at all locations in the match, using the matching without mismatches technique for the entire match.

14. The method of claim 13, wherein comparing the cost increment and the cost decrement for each match further comprises:

determining a difference between a total cost decrement for the match and a total cost increment for the match, and

when the difference between the total cost decrement and the total cost increment is non-negative at a particular location, using the matching with mismatches technique up to the particular location.

15. The method of claim 12, wherein:

for each set pointer command, the cast increment is equal to a numb of bytes required to encode the set pointer command plus a number of bytes required to encode a location of a mismatch, and

for each set pointer command, the cost decrement is equal to a number of bytes copied from the previous executable it that would be included in corresponding set commands in the matching without mismatches technique.