Patent Grant
8032865
1. Field of the Invention
This application claims priority to U.S. patent application Ser. No. 09/927,131, filed on Aug. 10, 2001, and entitled “System and Method for Executing Wireless Communications Device Dynamic Instruction Sets;” and is related to U.S. patent application Ser. No. 09/916,900, filed on Jul. 26, 2001 and entitled “System and Method for Field Downloading a Wireless Communications Device Software Code Section,” and Ser. No. 09/916,460, filed on Jul. 26, 2001, and entitled “System and Method for Compacting Field Upgradeable Wireless Communication Device Software Code Sections,” all of which are incorporated herein by reference.
This invention generally relates to wireless communications devices and, more particularly, to a system and method for using dynamic instructions sets to diagnose wireless communications devices in the field.
2. Description of the Related Art
It is not uncommon to release software updates for phones that are already in the field. These updates may relate to problems found in the software once the phones have been manufactured and distributed to the public. Some updates may involve the use of new features on the phone, or services provided by the service provider. Yet other updates may involve regional problems, or problems associated with certain carriers. For example, in certain regions the network layout of carriers may impose airlink interface conditions on the handset that cause the handset to demonstrate unexpected behavior such as improper channel searching, improper call termination, improper audio, or the like.
The traditional approach to such updates has been to recall the wireless communications device, also referred to herein as a wireless device, phone, telephone, or handset, to the nearest carrier retail/service outlet, or to the manufacturer to process the changes. The costs involved in such updates are extensive and eat into the bottom line. Further, the customer is inconvenienced and likely to be irritated. Often times, the practical solution is to issue the customer new phones.
The wireless devices are used in a number of environments, with different subscriber services, for a number of different customer applications. Therefore, even if the software of a wireless device can be upgraded to improve service, it is unlikely that the upgrade will provide a uniform improvement for all users.
It would be advantageous if wireless communications device software could be upgraded cheaply, and without inconvenience to the customer.
It would be advantageous if wireless communications device software could be upgraded without the customer losing the use of their phones for a significant period of time.
It would be advantageous if wireless communications device software could be updated with a minimum of technician service time, or without the need to send the device into a service facility.
It would be advantageous if the wireless device system software could be differentiated into code sections, so that only specific code sections of system software would need to be replaced, in updating the system software. It would be advantageous if these code sections could be communicated to the wireless device via the airlink.
It would be advantageous if the wireless device could be operated with dynamically loaded instruction sets that would aid in the field updating of system software.
It would be advantageous if the dynamic instruction sets could tailor the modification to suit the needs or problems of individual device users.
It would be advantageous if these dynamic instruction sets could be used to troubleshoot and provide temporary fixes to problems in the system software.
Wireless communications device software updates give customers the best possible product and user experience. An expensive component of the business involves the recall of handsets to update the software. These updates may be necessary to offer the user additional services or to address problems discovered in the use of the phone after it has been manufactured. The present invention makes it possible to practically upgrade handset software in the field, via the airlink interface. More specifically, the present invention permits the wireless communication device to execute dynamic instruction sets. These dynamic instruction sets permit the wireless device to “intelligently”, or conditionally upgrade the system software and system data. Further, the dynamic instruction sets permit the wireless device to collect data and make changes to the system software in response to the collected data. Alternately, the data can be collected and transmitted to the wireless device manufacturer for analysis.
Accordingly, a method is provided for field diagnosing system software in a wireless communications device. The method comprises: executing system software; launching a run-time engine; receiving patch manager run time instructions (PMRTI), including dynamic instruction sets and new code sections, in a file system section nonvolatile memory; and, processing dynamic instruction sets to field diagnose the system software.
Processing the dynamic instruction sets includes: executing the diagnosis instruction sets with the system software to collect data; analyzing the collected data; and, in response to analyzing the collected data, operating on system data and system software. The method further comprises: following the operating on the system software and system data, executing the system software.
Details of the above-described system software field diagnosis method, and a system for field diagnosing system software in a wireless communications device are provided below.
a and 8b are depictions of the operation code (op-code) being accessed by the run-time engine.
a and 15b are flowcharts illustrating the present invention method for executing dynamic instruction sets in a wireless communications device.
Some portions of the detailed descriptions that follow are presented in terms of procedures, steps, logic blocks, codes, processing, and other symbolic representations of operations on data bits within a wireless device microprocessor or memory. These descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. A procedure, microprocessor executed step, application, logic block, process, etc., is here, and generally, conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a microprocessor based wireless device. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. Where physical devices, such as a memory are mentioned, they are connected to other physical devices through a bus or other electrical connection. These physical devices can be considered to interact with logical processes or applications and, therefore, are “connected” to logical operations. For example, a memory can store or access code to further a logical operation, or an application can call a code section from memory for execution.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the present invention, discussions utilizing terms such as “processing” or “connecting” or “translating” or “displaying” or “prompting” or “determining” or “displaying” or “recognizing” or the like, refer to the action and processes of in a wireless device microprocessor system that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the wireless device memories or registers or other such information storage, transmission or display devices.
The system software can be viewed as a collection of different subsystems. Code objects can be tightly coupled into one of these abstract subsystems and the resulting collection can be labeled as a symbol library. This provides a logical breakdown of the code base and software patches and fixes can be associated with one of these symbol libraries. In most cases, a single update is associated with one, or at most, two symbol libraries. The rest of the code base, the other symbol libraries, remains unchanged.
The notion of symbol libraries provides a mechanism to deal with code and constants. The read-write (RW) data, on the other hand, fits into a unique individual RW library that contains RAM based data for all libraries.
Once received by the wireless device 104, the transported code section must be processed. This wireless device over-writes a specific code section of nonvolatile memory 108. The nonvolatile memory 108 includes a file system section (FSS) 110 and a code storage section 112. The code section is typically compressed before transport in order to minimize occupancy in the FSS 110. Often the updated code section will be accompanied by its RW data, which is another kind of symbol library that contains all the RW data for each symbol library. Although loaded in random access volatile read-write memory 114 when the system software is executing, the RW data always needs to be stored in the nonvolatile memory 108, so it can be loaded into random access volatile read-write memory 114 each time the wireless device is reset. This includes the first time RW data is loaded into random access volatile read-write memory. As explained in more detail below, the RW data is typically arranged with a patch manager code section.
The system 100 includes the concept of virtual tables. Using such tables, symbol libraries in one code section can be patched (replaced), without breaking (replacing) other parts of the system software (other code sections). Virtual tables execute from random access volatile read-write memory 114 for efficiency purposes. A code section address table and symbol offset address table are virtual tables.
The updated code sections are received by the wireless device 104 and stored in the FSS 110. A wireless device user interface (UI) will typically notify the user that new software is available. In response to UI prompts the user acknowledges the notification and signals the patching or updating operation. Alternately, the updating operation is performed automatically. The wireless device may be unable to perform standard communication tasks as the updating process is performed. The patch manager code section includes a non-volatile read-write driver symbol library that is also loaded into random access volatile read-write memory 114. The non-volatile read-write driver symbol library causes code sections to be overwritten with updated code sections. The patch manager code section includes the read-write data, code section address table, and symbol offset address table, as well a symbol accessor code and the symbol accessor code address (discussed below). Portions of this data are invalid when updated code sections are introduced, and an updated patch manager code sections includes read-write data, a code section address table, and a symbol offset address table valid for the updated code sections. Once the updated code sections are loaded into the code storage section 112, the wireless device is reset. Following the reset operation, the wireless device can execute the updated system software. It should also be understood that the patch manager code section may include other symbol libraries that have not been discussed above. These other symbol libraries need not be loaded into read-write volatile memory 114.
IF RF CAL ITEM IS LESS THAN X
EXECUTE INSTRUCTION
ELSE
EXECUTE INSTRUCTION
A PMRTI can support basic mathematical operations, such as: addition, subtraction, multiplication, and division. As with the system software code sections, the PMRTI code section may be loaded in response to UI prompts, and the wireless device must be reset after the PMRTI is loaded into code storage section 112. Then the PMRTI section can be executed. If the PMRTI code section is associated with any virtual tables or read-write data, an updated patch manager code section will be transported with the PMRTI for installation in the code storage section 112. Alternately, the PMRTI can be kept and processed from the FSS 110. After the handset 104 has executed all the instructions in the PMRTI section, the PMRTI section can be deleted from the FSS 110. Alternately, the PMRTI is maintained for future operations. For example, the PMRTI may be executed every time the wireless device is energized.
PMRTI is a very powerful runtime instruction engine. The handset can execute any instruction delivered to it through the PMRTI environment. This mechanism may be used to support RF calibrations. More generally, PMRTI can be used to remote debug wireless device software when software problems are recognized by the manufacturer or service provider, typically as the result of user complaints. PMRTI can also record data needed to diagnose software problems. PMRTI can launch newly downloaded system applications for data analysis, debugging, and fixes. PMRTI can provide RW data based updates for analysis and possible short term fix to a problem in lieu of an updated system software code section. PMRTI can provide memory compaction algorithms for use by the wireless device.
In some aspects of the invention, the organization of the system software into symbol libraries may impact the size of the volatile memory 114 and nonvolatile memory 108 required for execution. This is due to the fact that the code sections are typically larger than the symbol libraries arranged in the code sections. These larger code sections exist to accommodate updated code sections. Organizing the system software as a collection of libraries impacts the nonvolatile memory size requirement. For the same code size, the amount of nonvolatile memory used will be higher due to the fact that code sections can be sized to be larger than the symbol libraries arranged within.
Once software updates have been delivered to the wireless device, the software maintenance system 100 supports memory compaction. Memory compaction is similar to disk de-fragmentation applications in desktop computers. The compaction mechanism ensures that memory is optimally used and is well balanced for future code section updates, where the size of the updated code sections are unpredictable. The system 100 analyzes the code storage section as it is being patched (updated). The system 100 attempts to fit updated code sections into the memory space occupied by the code section being replaced. If the updated code section is larger than the code section being replaced, the system 100 compacts the code sections in memory 112. Alternately, the compaction can be calculated by the manufacturer or service provider, and compaction instructions can be transported to the wireless device 104.
Compaction can be a time consuming process owing to the complexity of the algorithm and also the vast volume of data movement. The compaction algorithm predicts feasibility before it begins any processing. UI prompts can be used to apply for permission from the user before the compaction is attempted.
In some aspects of the invention, all the system software code sections can be updated simultaneously. A complete system software upgrade, however, would require a larger FSS 110.
Contrasting
In
Returning to
As noted above, each symbol library includes functionally related symbols. A symbol is a programmer-defined name for locating and using a routine body, variable, or data structure. Thus, a symbol can be an address or a value. Symbols can be internal or external. Internal symbols are not visible beyond the scope of the current code section. More specifically, they are not sought by other symbol libraries, in other code sections. External symbols are used and invoked across code sections and are sought by libraries in different code sections. The symbol offset address table typically includes a list of all external symbols.
For example, symbol library one (310) may generate characters on a wireless device display. Symbols in this library would, in turn, generate telephone numbers, names, the time, or other display features. Each feature is generated with routines, referred to herein as a symbol. For example, one symbol in symbol library one (310) generates telephone numbers on the display. This symbol is represented by an “X”, and is external. When the wireless device receives a phone call and the caller ID service is activated, the system must execute the “X” symbol to generate the number on the display. Therefore, the system must locate the “X” symbol.
Returning to
The first plurality of symbol libraries also includes symbol accessor code arranged in a code section to calculate the address of a sought symbol. The symbol accessor code can be arranged and stored at an address in a separate code section, code section two (304), for example. However, as shown, the symbol accessor code 332 is arranged and stored at an address in the patch manager code section 308. The system 300 further comprises a first location for storage of the symbol accessor code address. The first location can be a code section in the code storage section 112, or in a separate memory section of the wireless device (not shown). The first location can also be arranged in the same code section as the read-write data. As shown, the first location 334 is stored in the patch manager code section 308 with the read-write data 330, the symbol offset address table 328, the code section address table 326, and the symbol accessor code 332, and the patch library (patch symbol library) 336.
The symbol accessor code accesses the code section address table and symbol offset address tables to calculate, or find the address of a sought symbol in memory. That is, the symbol accessor code calculates the address of the sought symbol using a corresponding symbol identifier and a corresponding code section identifier. For example, if the “X” symbol in symbol library one is sought, the symbol accessor is invoked to seek the symbol identifier (symbol ID) “X—1”, corresponding to the “X” symbol (see
The symbol “X” is a reserved name since it is a part of the actual code. In other words, it has an absolute data associated with it. The data may be an address or a value. The symbol identifier is an alias created to track the symbol. The symbol offset address table and the code section address table both work with identifiers to avoid confusion with reserved symbol and code section names. It is also possible that the same symbol name is used across many symbol libraries. The use of identifiers prevents confusion between these symbols.
Returning to
Returning to
Contiguously addressed memory blocks refers to partitioning the physical memory space into logical blocks of variable size. Code sections and memory blocks are terms that are essentially interchangeable when the code section is stored in memory. The concept of a code section is used to identify a section of code that is perhaps larger than the symbol library, or the collection of symbol libraries in the code section as it is moved and manipulated.
As seen in
Returning to
As noted above, the updated code sections being received may include read-write data code sections, code section address table code sections, symbol libraries, symbol offset address table code sections, symbol accessor code sections, or a code section with a new patch library. All these code sections, with their associated symbol libraries and symbols, may be stored as distinct and independent code sections. Then each of these code sections would be replaced with a unique updated code section. That is, an updated read-write code section would be received and would replace the read-write code section in the code storage section. An updated code section address table code section would be received and would replace the code section address table code section in the code storage section. An updated symbol offset address table code section would be received and would replace the symbol offset address table code section in the code storage section. An updated symbol accessor code section would be received and would replace the symbol accessor code section in the code storage section. Likewise, an updated patch manager code section (with a patch library) would be received and would replace the patch manager code section in the code storage section.
However, the above-mentioned code sections are typically bundled together in the patch manager code section. Thus, the read-write code section in the code storage section is replaced with the updated read-write code section from the file system section 110 when the patch manager code section 308 is replaced with the updated patch manger code section 450. Likewise, the code section address table, the symbol offset address table, the symbol accessor code sections, as well as the patch library are replaced when the updated patch manager code section 450 is installed. The arrangement of the new read-write data, the new code section address table, the new symbol offset address table, the new symbol accessor code, and the new patch library as the updated patch manager code section 450, together with the current code sections in the code storage section, forms updated executable system software.
When the file system section 110 receives an updated symbol accessor code address, the patch manager replaces the symbol accessor code address in the first location in memory with updated symbol accessor code address. As noted above, the first location in memory 334 is typically in the patch manager code section (see
As seen in
With the organization, downloading, and compaction aspects of the invention now established, the following discussion will center on the wireless communications device dynamic instruction set execution system 300. The system 300 comprises executable system software and system data differentiated into code sections, as discussed in great detail, above. Further, the system 300 comprises dynamic instruction sets for operating on the system data and the system software, and controlling the execution of the system software. As seen in
The dynamic instruction sets are a single, or multiple sets of instructions that include conditional operation code, and generally include data items. The run-time engine reads the operation code and determines what operations need to be performed. Operation code can be conditional, mathematical, procedural, or logical. The run-time engine, or run-time library 370 processes the dynamic instruction sets to perform operations such as mathematical or logical operations. That is, the run-time engine reads the dynamic instruction set 470 and performs a sequence of operations in response to the operation code. Although the dynamic instruction sets are not limited to any particular language, the operation code is typically a form of machine code, as the wireless device memory is limited and execution speed is important. The operation code is considered conditional in that it analyzes a data item and makes a decision as a result of the analysis. The run-time engine may also determine that an operation be performed on data before it is analyzed.
For example, the operation code may specify that a data item from a wireless device memory be compared to a predetermined value. If the data item is less than the predetermined value, the data item is left alone, and if the data item is greater than the predetermined value, it is replaced with the predetermined value. Alternately, the operation code may add a second predetermined value to a data item from the wireless device memory, before the above-mentioned comparison operation is performed.
As mentioned above, the file system section nonvolatile memory 110 receives the dynamic instruction sets through an interface such as the airlink 150. As shown in
a and 8b are depictions of instructions being accessed by the run-time engine 370. Shown in
b is a more detailed depiction of the first instruction 800 of
After the run-time engine locates symbols corresponding to the received symbol identifiers using the code section address table and symbol offset address table, it extracts data when the located symbols are data items. For example, if the symbol “X” is a data item in symbol library one (310), the run-time engine extracts it. Alternately, the “X” symbol can be operation code, and the run-time engine executes the symbol “X” when it is located.
PMRTI can be used to update system data, or system data items. In some aspects of the invention system data is stored in a code section in the file system section 110, code section 472 for example, see
PMRTI can also be used to update data items in volatile memory 114. As an example, the volatile memory 114 accept read-write data 330, see
In some aspects of the invention, the run-time engine monitors the execution of the system software. Performance monitoring is broadly defined to include a great number of wireless device activities. For example, data such as channel parameters, channel characteristics, system stack, error conditions, or a record of data items in RAM through a sequence of operations leading to a specific failure condition or reduced performance condition can be collected. It is also possible to use dynamic instructions sets to analyze collected performance data, provide updated data variants, and recapture data to study possible solutions to the problem. Temporary fixes can also be provisioned using PMRTI processes.
More specifically, the run-time engine collects performance data, and stores the performance data in the file system section in response to the operation code. Then, the system software is controlled to execute by collecting the performance data for evaluation of the system software. Evaluation can occur as a form of analysis performed by dynamic instruction set operation code, or it can be performed outside the wireless device. In some aspects of the invention, the run-time engine accesses the performance data that has been collected from the file system section and transmits the performance data via an airlink interface in response to the operation code. Collecting performance data from wireless devices in the field permits a manufacturer to thoroughly analyze problems, either locally or globally, without recalling the devices.
In some aspects of the invention, file system section 110 receives a patch manager run time instruction including a new code section. For example, a new code section 474 is shown in
As explained above, the addition of a new code section or the updating of a code section typically requires the generation of a new code section address table, as these operation involve either new and/or changed code section start addresses. Further, a compaction operation also requires a new code section address table. The compaction operations may be a result of the operation of the compactor 342, explained above, or the result of PMRTI instructions that supply details as to how the compaction is to occur. When the PMRTI includes downloading and compaction instructions, the PMRTI typically also includes a new code section address table that becomes valid after the downloading and compaction operations have been completed.
Dynamic instruction sets 910 for field diagnosing system software are received via the airlink interface 902. The dynamic instruction sets 910, as well as new code sections 912, are part of patch manager run time instructions 914. Typically, the dynamic instruction sets 910 are stored in the file system section 906. A run-time engine, or run-time library 916 processes the dynamic instruction sets 910. As mentioned above, the run-time library 916 is typically part of the patch manager code section 918.
The executable system software and system data (code sections in permanent memory 904) are operated on by the dynamic instruction sets 910. The system software is executed following the operations on the system software and system data by the dynamic instruction sets 910.
As mentioned in detail above, the system software is formed into symbol libraries. Each symbol library comprises symbols having related functionality that are arranged into code sections in a code storage section nonvolatile memory 908. The file system section 906 of nonvolatile memory receives patch manager run time instructions (PMRTI) 914, including dynamic instruction sets 910 and new code sections (new code section 912 is shown).
In some aspects of the invention the dynamic instruction set 910 is a diagnosis instruction set, and the new code section 912 is a diagnosis code section. After being received in the file system section 906, the diagnosis code section 912 is stored in nonvolatile memory 904, typically in the code storage section 908 (see the dotted arrow labeled “1”). The diagnosis instruction set 910 executes the diagnosis code section 912 with the system software.
In another aspect of the invention the system software stores symbols and data items, and updates the stored symbols and data items to provide a record of the system software operation. This temporary status information can be kept in the volatile memory 1002. This permits the diagnosis instruction sets 910 to more simply collect the addresses and values of symbols stored in read-write volatile memory for storage in the collected data code section 1000.
The collected data in collected data code section 1000 can then be analyzed by the field diagnosis system 900 to enact a temporary fix, see the explanation of
The diagnosis instruction sets 912 execute a first temporary code, Y—1 (1300) for example. That is, the diagnosis instruction sets 912 cause the system software, code section 1312 for example, to execute using the first temporary code Y—1 (1300). System data is collected in response to executing the first temporary code Y—1 (1200), in collected data code section 1000 for example (see the dotted arrow labeled “1”). The diagnosis instruction sets 912 compare collected system data to the corresponding constraints YC—1 (1306). The analysis can be based upon simple or complex conditional logic or mathematic operations, as mentioned above, that are generated by diagnosis instruction sets. Simplistically, the diagnosis code section 914 includes constraints organized as system data trigger values, and the diagnosis instruction sets 912 analyze the collected data by comparing system data 1000, collected in response to executing the first temporary code Y—1 (1300), to the system data trigger values in YC—1 (1306).
If the collected system data 1000 passes analysis, then the first temporary code Y—1 (1200) is assumed to be operational and the system data is temporarily updated per the first temporary code constraints YC—1 (1306). Since the code section 1312 is to be operated with a temporary code section instead of the installed code, R—1 (1314) for example, the system software temporarily redirects selected system software symbols to counterpart symbols in the first temporary code symbol library Y—1 (1300) of the diagnosis code section 914, see the dotted arrow labeled “2”. As explained in detail above, the code section address tables and symbol offset address tables are used to locate code sections and symbols within code sections. When a temporary code section is patched into the system software, the diagnosis instruction sets 912 also update the symbol offset address table and code section address table with addresses in the diagnosis code section. As shown, the code section 1312 would be updated with symbols in temporary code section Y—1 (1300) to replace counterpart symbols in code section R—1 (1314).
However, the collected data 1000 may not favorable compare with the constraints. This unfavorable comparison is an indication that the temporary code is not a successful fix for the system software problem. Then, the diagnosis instruction sets 912 execute alternate temporary code symbol libraries if the collected system data does not pass analysis. The process iteratively tests temporary code sections until a “good” code section is found. If no “good” code is found, the system software continues to operate with the originally installed code. Note that the above-mentioned temporary fix is intended to be a diagnosis tool, however, the temporary fix can be left patched into the system indefinitely.
a and 15b are flowcharts illustrating the present invention method for executing dynamic instruction sets in a wireless communications device. Although depicted as a sequence of numbered steps for clarity, no order should be inferred from the numbering (and the numbering in the methods presented below) unless explicitly stated. The method starts at Step 1500. Step 1501a forms the system software into symbol libraries, each symbol library comprising symbols having related functionality. Step 1501b arranges the symbol libraries into code sections. Step 1502 executes system software. Step 1503 launches a run-time engine. Typically, launching a run-time engine includes invoking a run-time library from a first code section. The run-time engine can be launched from either volatile or nonvolatile memory. Step 1504, following Step 1503, receives the dynamic instruction sets. Receiving the dynamic instruction sets in Step 1504 includes receiving the dynamic instruction sets through an interface selected from the group including airlink, radio frequency (RF) hardline, installable memory module, infrared, and logic port interfaces. In some aspects of the invention, receiving the dynamic instruction set in Step 1504 includes receiving a patch manager run time instruction (PMRTI) in a file system section nonvolatile memory.
Step 1506 processes dynamic instruction sets. Processing dynamic instruction sets includes processing instructions in response to mathematical and logical operations. In some aspects of the invention, Step 1507 (not shown), following the processing of the dynamic instruction sets, deletes dynamic instruction sets. Step 1508 operates on system data and system software. Step 1510, in response to operating on the system data and system software, controls the execution of the system software.
Typically, receiving the patch manager run time instructions in Step 1504 includes receiving conditional operation code and data items. Then, processing dynamic instruction sets in Step 1506 includes substeps. Step 1506a1 uses the run-time engine to read the patch manager run time instruction operation code. Step 1506b performs a sequence of operations in response to the operation code.
In some aspects, arranging the symbol libraries into code sections in Step 1501b includes starting symbol libraries at the start of code sections and arranging symbols to be offset from their respective code section start addresses. Then the method comprises further steps. Step 1501c stores the start of code sections at corresponding start addresses. Step 1501d maintains a code section address table (CSAT) cross-referencing code section identifiers with corresponding start addresses. Step 1501e maintains a symbol offset address table (SOAT) cross-referencing symbol identifiers with corresponding offset addresses, and corresponding code section identifiers.
In some aspects of the invention, receiving the patch manager run time instruction in Step 1504 includes receiving symbol identifiers. Then, the method comprises a further step. Step 1506a2 locates symbols corresponding to the received symbol identifiers by using the code section address table and symbol offset address table. Performing a sequence of operations in response to the operation code in Step 1506b includes substeps. Step 1506b1 extracts the data when the located symbols are data items. Step 1506b2 executes the symbols when the located symbols are instructions.
In some aspects of the invention, processing dynamic instruction sets in Step 1506b1 includes additional substeps. Step 1506b1a uses the run-time engine to capture the length of the patch manager run time instruction. Step 1506b1b extracts the data items from the patch manager run time instruction, in response to the operation code. Step 1506b1c uses the extracted data in performing the sequence of operations responsive to the operation code.
Alternately, receiving a new code section in Step 2003 includes receiving an updated code section. Then, operating on the system data and system software in Step 2008 includes replacing a fourth code section in the code storage section with the updated code section.
As described earlier but not specifically shown in this figure, Step 2101a forms the system software into symbol libraries, each symbol library comprising symbols having related functionality and Step 2101b arranges the symbol libraries into code sections in a code storage section nonvolatile memory.
In some aspects of the invention, receiving dynamic instruction sets in Step 2106 includes receiving diagnosis instruction sets. Further, receiving a new code section includes receiving a diagnosis code section. Then, Step 2107 stores the diagnosis code sections in nonvolatile memory permanent storage, and processing dynamic instruction sets in Step 2108 includes processing the diagnosis instruction set to execute the diagnosis code section with the system software.
In some aspects of the invention the processing of diagnosis instruction sets in Step 2108 includes substeps. Step 2108a collects system data. Typically, system data is collected in response to executing the diagnosis code section with the system software. In some aspects, the collecting of system data in Step 2108a includes collecting the addresses and values of symbols in read-write volatile memory. Step 2108b stores the collected system data in a first code section in the file system section. Step 2108c uses conditional operation code to analyze the collected data. Then, operating on the system data and system software in Step 2110 includes updating the system data in response to analyzing the collected data. Executing the system software in Step 2112 includes using the updated system data. It should be understood that the order of collecting, storing, and analyzing the data in Steps 2108a through 2108c is not necessarily in the sequence depicted. Some processes are iterative, involving cycles of collecting, storing, and analyzing. Another process might analyze the data and then store it. Other variations of collecting, storing, and analyzing exist, as will be appreciated by those skilled in the art.
In some aspects of the invention receiving a diagnosis code section in Step 2106 includes receiving predetermined sets of updated system data. Processing diagnosis instruction sets in Step 2108 includes selecting an updated system data set and operating on the system data and system software in Step 2110 includes using the selected updated system data set to execute the system software.
Arranging the symbol libraries into code sections in Step 2101b includes starting symbol libraries at the start of code sections, and arranging symbols to be offset from their respective code section start addresses. As mentioned in detail above and, therefore not shown, Step 2101c stores the start of code sections at corresponding start addresses. Step 2101d maintains a code section address table cross-referencing code section identifiers with corresponding start addresses. Step 2101e maintains a symbol offset address table cross-referencing symbol identifiers with corresponding offset addresses and corresponding code section identifiers. Then, executing temporary code symbol libraries from the test code sections in Step 2112 includes updating the symbol offset address table and code section address table with addresses in the diagnosis code section.
In some aspects, receiving a diagnosis code section in Step 2106 includes receiving a test code section with temporary code symbol library and constraints organized as system data trigger values. Then, analyzing the collected data in Step 2108c includes comparing system data, collected in response to executing the first temporary code, to the sets of system data trigger values.
Step 2114 transmits the collection of temporary software data updates and temporarily redirects system software symbols via an airlink interface. Step 2116 receives an updated code section (a permanent update) with an updated code section address table and updated symbol offset address table in the file system section. Then, processing dynamic instruction sets in Step 2108 includes storing the updated code section with updated code section address table and symbol offset address table in permanent storage.
A system and method have been provided for executing dynamic instruction sets in a wireless communications device, so as to aid in the diagnosis and/or fixing, at least temporarily, of system software problems. The system is easily updateable because of the arrangement of symbol libraries in code sections, with tables to access the start addresses of the code sections in memory and the offset addresses of symbols in the symbol libraries. The use of dynamic instruction sets permits custom modifications to be performed to each wireless device, based upon specific characteristics of that device. A few general examples have been given illustrating possible uses for the dynamic instructions sets. However, the present invention is not limited to just these examples. Other variations and embodiments of the invention will occur to those skilled in the art.
This is a continuation of U.S. application Ser. No. 09/970,188, filed Oct. 3, 2001, now U.S. Pat. No. 6,918,108, which is a continuation in part of U.S. application Ser. No. 09/917,026, filed Jul. 26, 2001, now U.S. Pat. No. 7,328,007 and of U.S. application Ser. No.09/916,460, filed Jul. 26, 2001 now U.S. Pat. No. 7,159,214, and of U.S. application Ser. No. 09/916,900, filed Jul. 26, 2001.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4852047 | Lavallee et al. | Jul 1989 | A |
| 5046082 | Zicker et al. | Sep 1991 | A |
| 5337255 | Seidel et al. | Aug 1994 | A |
| 5400389 | Niiyama et al. | Mar 1995 | A |
| 5481706 | Peek | Jan 1996 | A |
| 5507009 | Grube et al. | Apr 1996 | A |
| 5600823 | Sherer et al. | Feb 1997 | A |
| 5673317 | Cooper | Sep 1997 | A |
| 5699275 | Beasley et al. | Dec 1997 | A |
| 5715462 | Iwamoto et al. | Feb 1998 | A |
| 5734904 | Kanamori et al. | Mar 1998 | A |
| 5740351 | Kasten | Apr 1998 | A |
| 5771386 | Baumbauer | Jun 1998 | A |
| 5784537 | Suzuki et al. | Jul 1998 | A |
| 5790704 | Rao et al. | Aug 1998 | A |
| 5790856 | Lillich | Aug 1998 | A |
| 5826005 | Fuller | Oct 1998 | A |
| 5832086 | Rosauer | Nov 1998 | A |
| 5835749 | Cobb | Nov 1998 | A |
| 5835778 | Yoshihara | Nov 1998 | A |
| 5867712 | Shaw et al. | Feb 1999 | A |
| 5875242 | Glaser et al. | Feb 1999 | A |
| 5901225 | Ireton et al. | May 1999 | A |
| 5920826 | Metso et al. | Jul 1999 | A |
| 5930704 | Kay | Jul 1999 | A |
| 5938766 | Anderson et al. | Aug 1999 | A |
| 5950006 | Crater et al. | Sep 1999 | A |
| 5960356 | Alperovich et al. | Sep 1999 | A |
| 5974312 | Hayes et al. | Oct 1999 | A |
| 6018543 | Blois et al. | Jan 2000 | A |
| 6023620 | Hansson | Feb 2000 | A |
| 6026400 | Suzuki | Feb 2000 | A |
| 6047071 | Shah | Apr 2000 | A |
| 6138009 | Birgerson | Oct 2000 | A |
| 6138153 | Collins et al. | Oct 2000 | A |
| 6145098 | Nouri et al. | Nov 2000 | A |
| 6151709 | Winkel | Nov 2000 | A |
| 6195546 | Leung et al. | Feb 2001 | B1 |
| 6212632 | Surine et al. | Apr 2001 | B1 |
| 6237114 | Wookey et al. | May 2001 | B1 |
| 6247065 | Greenspan et al. | Jun 2001 | B1 |
| 6272333 | Smith | Aug 2001 | B1 |
| 6275694 | Yoshida et al. | Aug 2001 | B1 |
| 6308061 | Criss et al. | Oct 2001 | B1 |
| 6343375 | Gupta et al. | Jan 2002 | B1 |
| 6351636 | Shaffer et al. | Feb 2002 | B2 |
| 6370455 | Larson et al. | Apr 2002 | B1 |
| 6415266 | Do | Jul 2002 | B1 |
| 6442660 | Henerlau et al. | Aug 2002 | B1 |
| 6449476 | Hutchison et al. | Sep 2002 | B1 |
| 6457174 | Kuroda et al. | Sep 2002 | B1 |
| 6460070 | Turek et al. | Oct 2002 | B1 |
| 6470447 | Lambert et al. | Oct 2002 | B1 |
| 6477702 | Yellin et al. | Nov 2002 | B1 |
| 6493549 | Axelson et al. | Dec 2002 | B1 |
| 6493871 | McGuire et al. | Dec 2002 | B1 |
| 6498789 | Honda | Dec 2002 | B1 |
| 6546492 | Walker et al. | Apr 2003 | B1 |
| 6549770 | Marran | Apr 2003 | B1 |
| 6578056 | Lamburt | Jun 2003 | B1 |
| 6578142 | Anderson et al. | Jun 2003 | B1 |
| 6611822 | Beams et al. | Aug 2003 | B1 |
| 6622017 | Hoffman | Sep 2003 | B1 |
| 6633759 | Kobayashi | Oct 2003 | B1 |
| 6643506 | Criss et al. | Nov 2003 | B1 |
| 6714992 | Kanojia et al. | Mar 2004 | B1 |
| 6731946 | Stanwood et al. | May 2004 | B1 |
| 6754894 | Costello et al. | Jun 2004 | B1 |
| 6754895 | Bartel et al. | Jun 2004 | B1 |
| 6763252 | Itazawa | Jul 2004 | B2 |
| 6785541 | Martin | Aug 2004 | B2 |
| 6804813 | Willems et al. | Oct 2004 | B1 |
| 6918108 | Rajaram | Jul 2005 | B2 |
| 6934931 | Plumer et al. | Aug 2005 | B2 |
| 6950847 | Harrisville-Wolff et al. | Sep 2005 | B2 |
| 6959192 | Cannon et al. | Oct 2005 | B1 |
| 6968546 | Lueh | Nov 2005 | B2 |
| 6990660 | Moshir et al. | Jan 2006 | B2 |
| 7017116 | Elsbree et al. | Mar 2006 | B2 |
| 7065347 | Vikse et al. | Jun 2006 | B1 |
| 7069452 | Hind et al. | Jun 2006 | B1 |
| 7096416 | Smith et al. | Aug 2006 | B1 |
| 7140007 | Lamping | Nov 2006 | B2 |
| 7237234 | Granston et al. | Jun 2007 | B2 |
| 7287243 | Dollin et al. | Oct 2007 | B2 |
| 7305666 | Burger et al. | Dec 2007 | B2 |
| 7359831 | Shrivastava et al. | Apr 2008 | B2 |
| 7401323 | Stall et al. | Jul 2008 | B2 |
| 7562208 | Reed et al. | Jul 2009 | B1 |
| 7647586 | Long et al. | Jan 2010 | B2 |
| 7694282 | Arkhipov et al. | Apr 2010 | B2 |
| 7730453 | Swafford | Jun 2010 | B2 |
| 7739664 | Bates et al. | Jun 2010 | B2 |
| 20010000538 | Kowaguchi | Apr 2001 | A1 |
| 20010005861 | Mousseau et al. | Jun 2001 | A1 |
| 20010019953 | Furukawa et al. | Sep 2001 | A1 |
| 20010027500 | Matsunaga | Oct 2001 | A1 |
| 20010051519 | Shirai | Dec 2001 | A1 |
| 20010054161 | Woodruff | Dec 2001 | A1 |
| 20020019973 | Hayashida | Feb 2002 | A1 |
| 20020026634 | Shaw | Feb 2002 | A1 |
| 20020065041 | Lunsford et al. | May 2002 | A1 |
| 20020072359 | Moles et al. | Jun 2002 | A1 |
| 20020077077 | Rezvani et al. | Jun 2002 | A1 |
| 20020083142 | Lagosanto et al. | Jun 2002 | A1 |
| 20020083143 | Cheng | Jun 2002 | A1 |
| 20020131397 | Patel et al. | Sep 2002 | A1 |
| 20020142762 | Chmaytelli et al. | Oct 2002 | A1 |
| 20020152268 | Kureshy et al. | Oct 2002 | A1 |
| 20020160763 | Mittal et al. | Oct 2002 | A1 |
| 20020161796 | Sylthe | Oct 2002 | A1 |
| 20020170039 | Kovacevic | Nov 2002 | A1 |
| 20030014561 | Cooper | Jan 2003 | A1 |
| 20030060189 | Minear et al. | Mar 2003 | A1 |
| 20030195013 | Zicker et al. | Oct 2003 | A1 |
| 20040158829 | Beresin et al. | Aug 2004 | A1 |
| 20040177072 | Salminen et al. | Sep 2004 | A1 |
| 20040203768 | Ylitalo et al. | Oct 2004 | A1 |
| 20040214551 | Kim | Oct 2004 | A1 |
| 20040229644 | Heie et al. | Nov 2004 | A1 |
| 20040240657 | Camarillo | Dec 2004 | A1 |
| 20040249657 | Kol et al. | Dec 2004 | A1 |
| 20040249768 | Kontio et al. | Dec 2004 | A1 |
| 20040266422 | Hotze et al. | Dec 2004 | A1 |
| 20050064847 | Kirbas et al. | Mar 2005 | A1 |
| 20050079863 | Macaluso | Apr 2005 | A1 |
| 20050209930 | Coppinger et al. | Sep 2005 | A1 |
| Number | Date | Country |
|---|---|---|
| 19502728 | Aug 1996 | DE |
| 19543843 | May 1997 | DE |
| 19850133 | May 1999 | DE |
| 0459344 | Dec 1991 | EP |
| 0889405 | Jan 1999 | EP |
| 0918420 | May 1999 | EP |
| 1014263 | Jun 2000 | EP |
| 2800963 | May 2001 | FR |
| 2227584 | Aug 1990 | GB |
| 2349485 | Nov 2000 | GB |
| WO 9300633 | Jan 1993 | WO |
| WO 9809208 | Mar 1998 | WO |
| WO 9922325 | May 1999 | WO |
| WO 0067112 | Nov 2000 | WO |
| WO 0073912 | Dec 2000 | WO |
| WO 0074412 | Dec 2000 | WO |
| WO 0135686 | May 2001 | WO |
| WO 02058364 | Jul 2002 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20050245248 A1 | Nov 2005 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09970188 | Oct 2001 | US |
| Child | 11174090 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09917026 | Jul 2001 | US |
| Child | 09970188 | US | |
| Parent | 09916460 | Jul 2001 | US |
| Child | 09917026 | US | |
| Parent | 09916900 | Jul 2001 | US |
| Child | 09916460 | US |
