WO2011032443A1

WO2011032443A1 - Method and device for storing and retrieving non-volatile data

Info

Publication number: WO2011032443A1
Application number: PCT/CN2010/075939
Authority: WO
Inventors: 党茂昌
Original assignee: 中兴通讯股份有限公司
Priority date: 2009-09-16
Filing date: 2010-08-12
Publication date: 2011-03-24
Also published as: CN101650689A; CN101650689B

Abstract

A method for storing and retrieving non-volatile data is disclosed. The method involves: setting the classified non-volatile data as a tree structure and evaluating the nodes of the tree; compiling and linking the tree structure whose nodes have been evaluated, programming the compiled and linked result, and storing the base address for programming; calculating the offset and size of the non-volatile data to be retrieved according to the compiled and linked result and the base address for programming; and retrieving the non-volatile data according to the base address for programming and the calculated result for the offset and size of the non-volatile data to be retrieved. A device for storing and retrieving non-volatile data is also disclosed. With the method and device, the stored non-volatile data can be conveniently extended and deeply nested, the utilization ratio of a storage space is improved, and the retrieving method is intuitive.

Description

Method and device for storing and retrieving non-volatile data

The present invention relates to data storage technologies in communication systems, and more particularly to a method and apparatus for storing and retrieving non-volatile data. Background technique

With the development of mobile communication technology, the update speed of terminals is also getting faster and faster. Each terminal manufacturer is constantly developing terminal products with multiple service functions in order to attract more users. The terminal manufacturer develops the terminal functions by means of the terminal software platform during the development process. In the development process, various kinds of non-volatile data are involved, such as: factory parameters of the terminal, physical layer parameters, communication protocols and Network parameters, etc., the number of subdivisions is about 100,000, so it is important to organize the management of non-volatile data of the terminal.

Organization methods for non-volatile data include: storage and retrieval. At present, the organization of non-volatile data is as follows: 存储 Array structure is used for storage, and Id index access method is used for retrieval. However, due to the limitation of the linear structure of the array itself, that is, each data item in the array is arranged according to the corresponding number, and the numbers are arranged in order from small to large, or from large to small, such as: 1, 2, 3, 4, 5, etc. If you want to insert or delete data items in the array, you need to re-number the data items in the array. Therefore, the non-volatile data in the array is difficult to expand, the migration process is cumbersome, and the nesting is poor. Since the retrieval of non-volatile data is performed according to the number corresponding to different data items, the retrieval method is not intuitive enough; in addition, the storage space size of the data items in the non-volatile data storage needs to be the same, thus causing partial data items. The corresponding storage space is not fully utilized, and a lot of storage space is wasted, so that the utilization of the storage space is not high. Summary of the invention

In view of this, the main object of the present invention is to provide a method and apparatus for storing and retrieving non-volatile data, so that the stored non-volatile data of the terminal is easy to expand, can be deeply nested, and the storage space utilization is improved, and The retrieval method is intuitive.

In order to achieve the above object, the technical solution of the present invention is achieved as follows:

The present invention proposes a method for storing and retrieving non-volatile data, the method comprising: setting the classified non-volatile data to a tree structure, and assigning values to nodes in the tree; The structure is compiled and linked, the result of compiling the link is written, and the base address at the time of programming is stored;

Calculate the offset and size of the non-volatile data to be retrieved according to the result of the compiled link and the base address at the time of programming, and calculate the offset and size according to the base address at the time of programming and the non-volatile data to be retrieved. The result retrieves non-volatile data.

Before the setting the classified non-volatile data to a tree structure, the method further includes: classifying the non-volatile data according to requirements.

Wherein, when the classified non-volatile data is set to a tree structure, the C language is used; correspondingly,

The offset and size of the non-volatile data to be retrieved are:

Based on the result of compiling the link and the base address at the time of writing, the calculation method of the data offset provided by the C language is used. The offsetof and the data size calculation method sizeof calculates the offset and size of the non-volatile data to be retrieved.

In the above solution, when the non-volatile data needs to be expanded, the method further includes: classifying the newly added non-volatile data, and accessing the originally set tree structure to form a new node, Recompile and burn the entire new tree structure.

Wherein, the non-volatile data is classified according to requirements as follows: according to different application domains of non-volatile data, or non-volatile data according to different data types of non-volatile data Line classification.

The present invention also provides a storage and retrieval device for non-volatile data, the device comprising: a setting module, a compiling module, a programming module, a computing module and a retrieval module;

The setting module is configured to set the classified non-volatile data into a tree structure, assign a value to a node in the tree, and send the result of setting and assigning to the compiling module;

The compiling module is configured to perform a compiling link operation according to a tree structure that has been assigned to the node set by the setting module, and notify the programming module of the result of compiling the link;

The programming module is configured to program a result of a compiled link sent by the compiling module, and store a base address when the programming is performed;

The calculation module is configured to calculate a offset and a size of the non-volatile data to be retrieved according to a result of the compiled link obtained by programming the programming module and a base address when the programming is performed, and send the calculation result to the retrieval module ;

The retrieval module is configured to retrieve non-volatile data according to a base address when the programming module is programmed and a calculation result of the offset and size of the non-volatile data to be retrieved by the calculation module.

The apparatus further includes a classification module for classifying the non-volatile data as needed and notifying the setting module of the classification result.

Wherein, the setting module uses the classified non-volatile data as a tree structure

C language; correspondingly,

The calculation module calculates the offset and size of the non-volatile data to be retrieved, and is: based on the result of the compiled link programmed by the programming module and the base address at the time of programming, using the data bias provided by the C language The shift calculation method offsetof and the data size calculation method sizeof calculates the offset and size of the non-volatile data to be retrieved.

In the above solution, the classification module classifies the non-volatile data according to requirements, as follows: according to different application domains of non-volatile data, or non-volatile data according to different data types of non-volatile data. sort. The method and device for storing and retrieving non-volatile data provided by the present invention sets the classified non-volatile data into a tree structure and assigns values to nodes in the tree; compiles the tree structure in which the nodes have been assigned Linking, compiling the result of compiling the link and storing the base address at the time of programming; calculating the offset and size of the non-volatile data to be retrieved according to the result of the compiled link and the base address at the time of writing, according to the base at the time of writing The address and the result of the calculation of the offset and size of the non-volatile data to be retrieved retrieve the non-volatile data. The non-volatile data in the present invention is set to a tree structure. If the branch of a certain layer in the tree structure is added or the number of layers of the tree structure is increased, the corresponding code line can be added without modification. The original code is easy to extend and deeply nested relative to the array structure.

In addition, in the storage process of non-volatile data, since the storage space corresponding to different nodes in the tree structure may be different, the size of the node is consistent with the size of the storage space, thereby saving storage space and improving utilization. In addition, the retrieval process is based on the parameter names corresponding to the non-volatile data, so the retrieval method has good intuitiveness with respect to the prior art. DRAWINGS

1 is a schematic diagram showing the implementation of a method for storing and retrieving non-volatile data according to the present invention; FIG. 2 is a schematic diagram showing a tree structure of each non-volatile data;

3 is a schematic diagram showing the storage layout structure of each node in the tree structure obtained by compiling the link; FIG. 4 is a schematic structural diagram of the storage and retrieval device of the nonvolatile data according to the present invention. detailed description

The basic idea of the present invention is: setting the classified non-volatile data into a tree structure, and assigning values to the nodes in the tree; compiling and linking the tree structure whose nodes have been assigned, burning the results of the compiled links and storing The base address at the time of programming; calculating the offset and size of the non-volatile data to be retrieved according to the result of the compiled link and the base address at the time of writing, according to the base address at the time of writing and the non-volatile data to be retrieved The calculation of the offset and size retrieves non-volatile data. The compiled language used in the implementation of the solution of the present invention may be: C, VB or Java, etc. The non-volatile data may be of different types for different devices, such as: terminal non-volatile data, or measurement and control Device non-volatile data, etc.

The following description will further explain the present invention by taking the compiled language as c and the non-volatile data as the terminal non-volatile data as an example.

FIG. 1 is a schematic flowchart showing the implementation of a method for storing and retrieving non-volatile data according to the present invention. As shown in FIG. 1, the process includes the following steps:

Step 101: classify non-volatile data according to requirements;

Here, the non-volatile data of the terminal can be classified according to different application business fields of non-volatile data, or different data types of non-volatile data, for example: if different data according to non-volatile data For classifying, the method may be: dividing the parameter corresponding to the non-volatile data of the terminal into a read-only parameter and a read-write parameter; the read-only parameter is further divided into a calibration parameter CLIB and a fixed parameter FIXED, etc., for the terminal The function parameters are calibrated; the readable and writable parameters are further divided into MMI parameters, AFC parameters, RTC parameters, and CSD parameters, etc., which are used to indicate different functional characteristics of the terminal.

Step 102: Set a structure of the classified non-volatile data tree;

Specifically: 设置 Use the C language data structure (struct) setting method to set the classified non-volatile data to a tree structure, which can be represented by pseudo code as follows:

First, set the first layer under the root node of the tree structure. Here, the first layer under the root node nv_param includes two nodes, which are: read-write parameters nv-dynamic and non-volatile in non-volatile data. The read-only parameter nv_ static in the sex data, the code is:

Struct nv_param

{

Nv— static; /* read only parameters */

Nv— dynamic; /* read/write parameters */ Here, the root node nv_param indicates that any one of the set tree structures is non-volatile data.

Then set the second layer of the tree structure, that is, the branch of the first layer node nv-static and nv-dynamic, the branch of the first layer node nv-static includes three nodes, respectively: calibration parameter clib, free space The parameter spare and the fixed parameter fixed, the code is:

Struct nv— static

{

Clib; /* Calibration parameters */

Spare; /* Spare area */

Fixed; /* Fixed parameters */

The first layer node nv-dynamic branch includes four nodes, namely: interface access parameter mmi, automatic mask control parameter afc, real-time transmission control parameters rtc and csd, code: Struct nv- dynamic

{

Mmi; /* mmi parameters */

Afc; /* afc parameters */

Rtc; /* rtc parameters */

Csd; /* csd parameters */

}

Here, the structure of the nonvolatile data tree is set layer by layer from the root node, and the generated tree structure is as shown in FIG. 2, and it can be seen that if a branch of a certain layer in the tree structure is to be added or a tree is added The number of layers in the structure, just add the corresponding line of code, no need to modify the original code.

Step 103: Assign a value to a node in the set non-volatile data tree;

Specifically: Initializing each node in the tree structure composed of non-volatile data Values, ie: initial values are assigned to each node in the tree structure, and corresponding non-volatile data is written in the corresponding position of each node in the tree structure.

Here, according to different node settings, the initial value may be fixed in the application process of the terminal or may be modified according to the actual application.

Step 104: Compiling and linking the tree structure whose node has been assigned, burning the result of compiling the link and storing the base address at the time of programming;

Specifically: After the tree structure is set and the assignment is completed, the code is started, and the C compiler compiles and links the generated tree structure to obtain the storage layout of each node in the tree structure. At this time, the storage layout obtained by compiling the link Stored in the memory, the memory layout needs to be programmed into a non-volatile memory, such as: Erasable Programmable Read Only Memory (EPROM) or Flash (flash), ie: from a location in the EPROM or flash Starting to burn all the nodes of the non-volatile data in the tree structure, wherein a certain position of the EPROM or flash, that is, a base address at the time of programming, or a first address, stores the base address for subsequent retrieval process Used in.

Figure 3 shows the storage layout of each node in the tree structure obtained by compiling the link. It can be seen that the storage space size of different nodes is also different. The size of the node is the same as the size of the storage space, that is: when the node is large, Corresponding to a large storage space, when the node is small, it corresponds to a small storage space, so the storage space utilization is high.

Here, the compiling link process and the programming process of the C language compiler are prior art and will not be described in further detail.

Step 105: Calculate the offset and size of the non-volatile data to be retrieved according to the result of the compiled link and the base address at the time of writing;

Specifically: if a certain non-volatile data is to be retrieved, the parameter name corresponding to the non-volatile data to be retrieved, such as: spare, is notified to the compiler, and then the compiler combines the nodes in the tree structure obtained by compiling the link. Storage layout and base address when programming, using the data size calculation method provided by C language sizeof and data offset calculation method offsetof calculation of non-volatile data Spare size and offset. The specific implementation process of the two methods of sizeof and offsetof is prior art, and will not be described in detail herein.

It can be seen that, in the process of searching for non-volatile data, the parameter name corresponding to the non-volatile data to be retrieved is notified to the compiler to implement subsequent retrieval operations, that is, the retrieval operation is based on The parameter names corresponding to the non-volatile data are performed without the use of intermediate parameters, such as numbering, so that the retrieval method achieves the intuitive requirement.

Step 106: Retrieve nonvolatile data according to the calculation result of the base address at the time of writing and the offset and size of the nonvolatile data to be retrieved.

Here, if the original non-volatile data is to be adjusted, such as: expansion, etc., step 101 to step 104 are performed again, and the parameters corresponding to the newly added non-volatile data are classified, and then in the original code. Based on the addition of the code line, and initial assignment, then re-compiled the entire tree structure after the change, and burned the results of the compiled link.

4 is a schematic structural diagram of a non-volatile data storage and retrieval device according to the present invention. As shown in FIG. 4, the device includes: a setting module, a compiling module, a programming module, a computing module, and a retrieval module;

The retrieval module is configured to check according to a base address and a calculation module when the programming module is programmed Non-volatile data is retrieved by calculating the offset and size of the non-volatile data.

The setting module uses the C language when the classified non-volatile data is set to a tree structure; correspondingly,

The calculation module calculates the offset and size of the non-volatile data to be retrieved according to the result of the compiled link obtained by the programming module and the base address at the time of programming, specifically:

Based on the result of the compiled link programmed by the programming module and the base address at the time of programming, the data offset calculation method offsetof and the data size calculation method sizeof are used to calculate the non-volatile data to be retrieved. Offset and size.

The classification module classifies the non-volatile data according to requirements as follows: The non-volatile data is classified according to different application business areas of non-volatile data, or according to different data types of non-volatile data.

The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included. Within the scope of protection of the present invention.

Claims

Claim

A method for storing and retrieving non-volatile data, the method comprising: setting the classified non-volatile data to a tree structure, and assigning values to nodes in the tree; The tree structure compiles the link, burns the result of compiling the link and stores the base address at the time of programming;

2. The method of storing and retrieving non-volatile data according to claim 1, wherein before the setting the classified non-volatile data to a tree structure, the method further comprises: Loss data is classified on demand.

The method for storing and retrieving non-volatile data according to claim 1 or 2, wherein the C language is used when the classified non-volatile data is set to a tree structure; The calculating the offset and size of the non-volatile data to be retrieved is: based on the result of compiling the link and the base address at the time of writing, using the data offset calculation method offsetof and data provided by the C language The size calculation method sizeof, calculates the offset and size of the non-volatile data to be retrieved.

The method of storing and retrieving non-volatile data according to claim 2, wherein when the non-volatile data needs to be expanded, the method further comprises:

The newly added non-volatile data is classified, and a new node is formed in the previously set tree structure, and the entire new tree structure is recompiled and burned.

The method for storing and retrieving non-volatile data according to claim 2 or 4, wherein the non-volatile data is classified as required as follows: different application services according to non-volatile data Non-volatile data is classified by domain, or by different data types of non-volatile data.

6. A device for storing and retrieving non-volatile data, the device comprising: a setting module, a compiling module, a programming module, a computing module, and a retrieval module; wherein

7. The apparatus for storing and retrieving non-volatile data according to claim 6, wherein the apparatus further comprises a classification module for classifying the non-volatile data according to requirements, and notifying the classification result. Module.

The apparatus for storing and retrieving non-volatile data according to claim 6 or 7, wherein the setting module uses the C language when the classified non-volatile data is set to a tree structure; corresponding,

9. The apparatus for storing and retrieving non-volatile data according to claim 7, wherein the classification module classifies the non-volatile data as required as: Non-volatile data is categorized by different application business areas, or by different data types of non-volatile data.