Update package generation employing matching technique with controlled number of mismatches

• US 20080148250A1
• Filed: 10/30/2006
• Published: 06/19/2008
• Est. Priority Date: 10/28/2005
• Status: Abandoned Application

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Motta, Giovanni
• Application Number:
  US11/590,137
• Publication Number:
  US 20080148250A1
• Time in Patent Office: Days
• US Class Current: 717/170
• 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

A generator of update packages with a matching component employs a matching technique that allows matching of programs that have been relocated to (compiled for) different memory segments. In relocated programs, the code remains the same, while the pointers assume different values, and the matching component is able to allow for such changes while still being able to match them. The matching component is able to capture in the flagged mismatches the changed pointers, addresses, etc. and thereby preserving long sections of the code that have not been modified.

Claims

1. A matching component in a generator of update packages that matches a first version of code to a second version of code, the matching component comprising:

a first string buffer that holds a first string that is derived from the first version of code;

a second string buffer that holds a second string that is derived from the second version of code; and

the matching component extending the length of the matches found by the longest common substring technique by allowing a controlled number of mismatches.

2. The matching component of claim 1 wherein the matching is flexible with variable-length insertions allowed.

3. The matching component of claim 1 wherein the first code version and the second code version are both executable code that can be relocated at least partially and wherein the matching component matches a first segment of first code version with a second segment of the second code version that has been relocated to a different memory segment in the second code version compared to its location in the first code version.

4. A matching component in a generator of update packages that matches a first version of code to a second version of code, the first version of code comprising a first chunk of code, the second version of code comprising a relocated version of the first chunk of code wherein the relocation involves changed memory addresses in the first chunk of code, the matching component comprising:

a first string buffer that holds a first string that is derived from the first version of code and comprises the first chunk of code;

a second string buffer that holds a second string that is derived from the second version of code and comprises the relocated version of the first chunk of code;

the matching component extending the length of the matches found by allowing a controlled number of mismatches; and

the matching component determining a match at least between the first chunk of code and the relocated version of the first chunk of code.

5. The matching component of claim 4 wherein the relocated version of the first chunk of code is a modified version of the first chunk of code wherein the addresses are changed due to relocation in memory.

6. The matching component of claim 4 wherein the relocated version of the first chunk of code is a modified version of the first chunk of code wherein the pointers assume different values.