WO2010142196A1

WO2010142196A1 - Method and apparatus for maintaining data

Info

Publication number: WO2010142196A1
Application number: PCT/CN2010/073078
Authority: WO
Inventors: 王玉常
Original assignee: 中兴通讯股份有限公司
Priority date: 2009-06-12
Filing date: 2010-05-21
Publication date: 2010-12-16
Also published as: CN101582092A; CN101582092B

Abstract

A method and apparatus for maintaining data are disclosed. The method includes: an application program pre-constructs memory structure with the unit of intra-block block cells for maintaining data in the memory; the memory structure at least comprises block sizes and the number of the block cells in each block, and the structure of the block cells at least comprises block cell identification; mapping the block cell identification and the number of the block cells in each block to block cell addresses and intra-block addresses; when requiring to maintain data within the block cell, the application program maintains the memory structure into a file and, maintains the data within the block cell in the file in sequence of the block cell identification, so as to realize maintaining data into the memory. The present invention resolves faced problems when restarting during transfer of data with complex data structure between multi-tasks.

Description

God preservation method and device

Wood field

This relates to embedded interiors, and more particularly to methods and apparatus for storage and storage. Background

With the increasing popularity of handwritten watches and the increasing use of their functions, the use of handbooks is also rapidly increasing, and higher demands are placed on internal management and counting in the handwriting.

In terms of the name, the , and even the legal teaching. If there is no good wood in the handwriting, then the handwriting is used, and in some of these, the low-efficiency wood has to be used. However, there are many solutions, such as balancing the binary, etc., but because of the high functionality, it is often used, it means that the handwriting is re-constructed, and the user's rest has a certain impact. Content

The wood to be solved by the Institute is a method and device for providing God's preservation, and the internal line is effectively saved and convenient.

To solve the problem, the book provides a method for saving the gods, including the seat program in the memory to store the pre-inner, the inner sheep, the at least the size and the sheep meta-religion, and at least the sheep to map the sheep paper and the number of sheep. The address and the address of the Lipo sheep and

Use the program to save the sheep, save it in the file, and save the number in the sheep to the file, and save it in memory. Nene, inside includes the address index, the index of the sheep in the memory of the address of the sheep including the address of the goat

The steps of mapping include

Divide the sheep's sheep meta-recognition, depending on the address of the sheep in the address index of the sheep and the number of sheep in the sheep. The address and internal address of the sheep depending on the internal address of the sheep are represented by the address.

The steps of saving the inside and the sheep in the file include saving the information contained in the file to the file, and then saving the sheep to the file in turn.

Use the program to save the information in the required file, first of all, the information stored in the file, the core information in the memory and the address index.

Including the steps of the sheep and the sheep in the order of the sheep and the order of the address index

The size of the information in the information, the address index table containing the address and

The file depends on the end of the table in turn, updating the address.

The sheep are included in the sheep, and the sheep are stored in order.

The seat program will be stored in the middle of the need, the sheep or the sheep will be allocated, or the sheep will be stored in the sheep, the medium or the sheep.

The tail of the sheep table.

The inside includes the former one, The steps to assign a sheep intermediary or multiple sheep include

If the sheep are nearly fully allocated sheep, the sheep will take out the assigned sheep, return the assigned sheep's address and the sheep or

The sheep's epidermis has a well-distributed sheep, and the memory is introduced to the tail of the inner table. Before the renewal, the tail of the same sheep and sheep table is taken, and the sheep are taken out of the allocated sheep, the address of the assigned sheep and the sheep.

Use the program to find the address of the sheep in the sheep and sheep that need to be kept, according to the location of the sheep.

In order to solve the problem, this book provides a device for God to save, including internal and internal storage.

Within the inner and inner sheep , including at least the size and size of the sheep , the sheep including at least the sheep and the sheep and the sheep are mapped to the address and the address of the sheep .

The interface for saving the program for use in the program, in the program that needs to be saved, the information contained in the program is saved to the file, and the inside includes the address index, to index the address of the sheep in the memory, and the representation of the sheep includes the address of the sheep.

Inside is the sheep of the sheep

Division, depending on the address of the sheep, the address of the sheep depends on the sheep's address. The sheep's address and internal address are determined by the address. The information is stored in the file. The device includes an internal interface for internal connection and internal program, an information stored in the program file and stored in the file, and the core information is sequentially indexed.

Within the vicinity of the sheep, the sheep are stored in the file in the following way.

The size of the message, including the address and address of the address index table in the file depends on the end of the table, updating the address index. Inside, including sheep and sheep, in order to save the sheep file internal force, force the program interface,

The in-use program needs to be saved, assigned to the sheep or more sheep, or

In the seat program, you need to save the sheep, the middle or the more sheep, the tail of the sheep and sheep, or the program that needs to be stored in the seat.

The sheep and the sheep find the address of the sheep in the middle of the sheep.

Including the former, to indicate that the sheep has been assigned to the sheep or the sheep in the following way.

If the sheep has a sheep that is allocated enough , the sheep will take out the assigned sheep , return the assigned sheep 's address and the sheep or

The sheep do not have enough sheep to be allocated, then the memory intermediary To the end of the inner table, before the update, with the tail of the sheep and sheep table, the sheep are taken out of the assigned sheep, the address of the assigned sheep and the sheep meta-teaching.

By using the method and the device, the internal wood files are combined, and the internal numbers are stored in the file, and the internal numbers are mapped into the files, so that the numbers are saved in the form of files on the permanent storage medium. , and the permanent storage of files in the media into memory, and the solution in the multiple. Overview

1

2

3

Process in storage

The preferred way of this

The following combines and the wood scheme. The following is a description of the settlement and is not intended to limit this.

In the internal management of this book, there is already use inside the wood. The so-called internal refers to the internal distribution of the program, the pre-size internal force, and the internal and external operations can be completed. Only the size of the inner pool is required, and it is necessary to allocate the inner distribution of the inner distribution, except that the cutting operations in the other are in the control of the operation in the seat program. For the wood below, first the following wood.

The file is stored in the stored program and stored as a file.

The maximum storage allocated in the same.

The basic sheep and sheep in the sheep with small average force distribution, sheep and effort.

The method of saving memory in this, including

(1) Using the program to build the file and the sheep in it, map the sheep and the sheep to the address of the sheep and its internal address.

There are a lot of methods in it. The main purpose of this book is not the internal ones, but the combination of the internal files and the files in the file and the purpose of the files.

Therefore, the size of each medium is fixed and fixed within the file, that is, within each medium (ie, referenced in the program), and the size of the sheep is also fixed and fixed. That is to say, the size and size of the sheep are fixed and cannot be more.

Inside the file

Abstract 矣 ( bs ac aType, A T ) file

Size // has the same storage

Sheep / sheep contained inside

Sheep // in the form of an assignable sheep address index // in front of the // address in front of the index

// Save sheep in sheep and sheep In

It needs to be rebuilt within the load.

Each of the contents in the file is stored in the file. The internal management of the kernel common program file, including the internal, address mapping, and internal, is due to the importance of the nuclear commonality and needs to be stored in the file. The information of the nuclear common department is stored in the file.

Sheep's, taking into account the various programs of the sheep, and finally the Hugh ( ) sheep Yuan knot. Mainly contains

Sheep and address. All sheep are sorted, referring to sheep, which requires at least 16 (b) lengths of 矣.

Under the sheep

A T sheep

The address of the sheep // all the sheep in the list // the address of the sheep and its internal address

In the upper file and its sheep, the mapping of addresses can be mapped, and the sheep and the sheep are also mapped to the internal addresses of the sheep and the sheep.

Since each of the sheep contained in each medium is fixed, the size of the sheep is also fixed, and the sheep are sorted, for example, the sheep in the first medium is 0 99, and the second is the sheep 00-199. You can get the address of the sheep (also known as Yang Yusuke) and the sheep, in the way

(Sheep / Sheep) Among them, (Sheep / Sheep), means the sheep Sheep division

Internal address (sheep) % (of the sheep)

Among them, "%" means dividing the sheep of the sheep.

As shown in Figure 5, it is a schematic diagram of the internal address mapping, including the inner, address index, and presentation of the decision table. It can be seen that the address is indexed by the index, and the address stored in the memory is stored in the sheep in the order of the sheep and the sheep.

Use the program sheep and its internal address, according to the address index 10 and determine the address of the sheep in memory and its internal address.

(2) In the application of the seat, the operation of the phase, the phase of the interface, or the flow of the interface

Wherein, shown in the process 2, the following steps are included

210 sheep

15 220 If there is a sheep in the sheep, it is executed 230, otherwise 250

230 sheep taken out of the allocated sheep

240 return to the assigned sheep address and sheep, process

250 In-memory Into 20 260 Is it successful, that is, if there is near to be assignable, then execute 270, otherwise execute 290

270 will be the end of the table, before the update

280 will be inside the tail of the sheep and sheep, step 230 will be executed 290 return failure information, flow.

25 process, that is, the address of the sheep finds the sheep of the phase

, the sheep will be the sheep and sheep.

Process, The sheep and the sheep are found in the address of the sheep, but in the sheep.

In the inner wood, the sheep is different from the past, and there are no more pointers such as ex pev, but 32 integers, which contain the number of sheep and 5 sheep.

If the inner and the lower are introduced, it is necessary to find the address of the sheep under the guidance of the sheep.

(3) In the application program, you need to save the file to the file, or you need to save the file in the file (in the file).

Among them, the save process, that is, the file stored in the file, and then the order of the sheep, in turn, save the sheep to the file.

As shown in process 3, the following steps are included.

15 310 files in the tribal file

320 information depends on size

330 address index table

The address index table is shown in 1.

340 file, the end of the table, update address index 0

0 If there is a near or not in the file, then go back to step 340 to execute, otherwise the process.

The above method proposes to save the device in the memory, as shown in FIG. 5, the device 400 includes the inner 410 stored in sequence, the inner 410, the inner 430, and the inner file 430, including the file.

440 of which In 410, in the file saved by the program 4101 and its sheep, the address of the sheep and the sheep metaphysical mapping sheep in the file 4101 and its internal address

Among them, the document 4101 and its sheep's former, this is no longer.

Save 420, the interface for the program, the program in the seat needs to save the file to the file in the file system 4201, first save the file 4101 in the file, and then the order of the sheep will be Sheep, save to file

430, the interface for the program, the program in the program needs to transfer the files in the file system 4201 to the file 4101, the information in the file of the family file 4101, the total information depends on the size, the address index table, the sheep file In the middle of each, the end of the table, update the address index

Within the file 440, the interface of the program

The file of 410 is connected to 4101, which is needed in the program.

The operation of the 4101 phase of the sheep, sheep or sheep in the file.

Among them, sheep, sheep or sheep are operating before, this is no longer. The above-mentioned devices stored in the memory can be similarly stored in the 420, and the 430 is saved within 420.

It can be seen that this will combine the internal files together.

The number of the file is stored in the file, and the internal file is mapped to the file, so that the file is saved on the permanent storage medium, and the number of files in the permanent storage medium is stored in the memory, and the solution is solved. In many different ways of.

The above is not used to limit the book. In this field, Mudong said that there can be more and more. Any repairs, equivalents, etc. made within the spirit and principles of this book are included in this warranty.

Usability

This will combine the internal files together, save the inside of the file, map the inside to the file, and save the file in the form of a file on a permanent storage medium, and in a permanent storage medium. The file is in memory, and the solution is in the same way.

Claims

Requirements 1, God's method of preservation, methods include

The seat program is stored in the memory. The sheep and the sheep in the inner and the inner part of the sheep include at least the size and the size of the sheep. The sheep include at least the sheep and the sheep, and the sheep's metaphysical map.

Use the program to save the sheep, save it in the file, and save the sheep to the file in turn, and save it in memory.

2. According to the method of requirement 1, where

Inside, inside includes the address index, the address index is in the address of the index sheep in the memory

The sheep’s near address includes the representation of the sheep

The steps of mapping include

Divide the sheep of the sheep and take the sheep

In the address index, the address of the sheep and the sheep's meta-religion are divided. The address and internal address of the sheep's internal address are represented by the address.

Save the information contained in the file and in the file.

3. According to the method of requirement 2, the method includes The information stored in the required file is saved in the file, and the information is sequentially indexed in the memory.

4. According to the method of claim 3, wherein the steps include: information sequence and address index table, the size of the information, the address index table of the address and the address address, and the update address index.

5. According to the method of claim 4, the method includes the sheep and the sheep in the order of the sheep.

The seat program is stored in the house, and the sheep or the sheep are allocated, or

Use the program to save the sheep in need

Intermediate or more sheep, will be the sheep and sheep.

6. In accordance with the method of requirement 5, the inside includes the former one, and the

The steps of assigning sheep to the middle or more sheep include the sheep taking out the allocated sheep, returning the assigned sheep and the address of the sheep or the sheep if the sheep are nearly fully allocated sheep

If the sheep does not have enough sheep to be allocated, then the memory is intervened to the tail of the inner table, and the tail of the sheep table before the renewal is The sheep are taken out of the assigned sheep, the address of the sheep being assigned and the sheep are taught.

7. According to the method of requirement 5 or 6, the method includes

The seat program is used to store the sheep and the sheep meta-teacher in the place where the sheep's address is found, according to the address of the sheep.

8. The device that God saves, including internal and internal storage,

Within the inner and inner sheep , the sheep and the sheep include at least the size and the size of the sheep , and the sheep include at least the sheep and the sheep 's metaphysical map to map the address and the address of the sheep .

The interface for saving the program in the program is stored in the file, and the sheep will save the information in the file to the file.

9. According to the device of claim 8, wherein

The inner index includes the address index to index the address of the sheep in the memory of the sheep.

Inside is the division of the sheep's sheep, and the sheep are taken.

The address of the sheep in the address index will be the sheep's

In addition to the law, the address and internal address of the sheep at the internal address of the sheep are represented by the address.

The internal save is to save the information in the file, but the sheep in turn save the sheep to the file.

10. According to the device of requirement 9, the device includes an interface for the inner and inner working programs of the internal storage connection, and is stored in the program file of the seat.

as well as

The information stored in the file,

1 1. According to the device of claim 10, wherein the inside is included, the inside is according to the size of the information stored in the file, and the address index table of the address and address is sequentially taken from the file.

The end of the table, update the address index.

12. A device according to claim 11, wherein the device comprises

The connected file contains the sheep and the sheep and sheep in order.

The interface of the program in the file, the program in the seat needs to be saved in the library, and the sheep or the sheep are saved.

The seat program needs to save the sheep,

Intermediate or more sheep, the tail of the sheep and sheep, or

In the seat application, it needs to be saved in the center.

The sheep and sheep found the address of the sheep in the place, according to the address of the sheep.

13. A device according to claim 12, wherein the inner portion includes the front portion to indicate the inner

Distribute the sheep intermediary or more sheep in the file as follows If the sheep has a sheep with a full distribution, the sheep will take out the assigned sheep, the address of the sheep to be distributed, and the sheep’s religion or

If the sheep does not have enough sheep to be distributed, then the memory will be introduced to the tail of the inner table, and the tail of the table will be updated.

The sheep takes out the assigned sheep, returns the address of the assigned sheep and teaches the sheep.