CN101115246B - Data storage method of mobile terminal - Google Patents
Data storage method of mobile terminal Download PDFInfo
- Publication number
- CN101115246B CN101115246B CN2006100889092A CN200610088909A CN101115246B CN 101115246 B CN101115246 B CN 101115246B CN 2006100889092 A CN2006100889092 A CN 2006100889092A CN 200610088909 A CN200610088909 A CN 200610088909A CN 101115246 B CN101115246 B CN 101115246B
- Authority
- CN
- China
- Prior art keywords
- block
- clauses
- subclauses
- virtual
- storage method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The invention discloses a data storage method of a movable termination, which comprises: step one, N BLOCK is divided out from FLASH to be used as virtual NvRam to make mapping from the virtual NvRam to the physical BLOCK, and making memory spatial configuration and initiation to the virtual NvRam, N is a natural number which is more than or equal to two; step two, the virtual NvRam executes corresponding operations according to types of operating instructions received; when the type is a reading item, then the position of the reading item is found according to initial position of the item distribution and the reading item operation is executed; when the type is a written item, then the position of the written item is found according to initial position of the item distribution and the written item operation is executed; when the type is BLOCK arrangement, then the obligate item of the virtual BLOCK is checked and the BLOCK arrangement operation is executed when the obligate item of the virtual BLOCK is less than one set valve value. By adopting the invention, the storage efficiency and the storage stability of data are improved.
Description
Technical field
The present invention relates to data storage technology, particularly relate to a kind of FLASH memory that in portable terminal, uses and realize the non-volatile date storage method of NvRam (Non Volatile RAM, nonvolatile memory).
Background technology
At present, the use of communication terminal (mobile phone) is very universal, and the memory requirement to terminal (mobile phone) is also more and more higher, not only deposit the software of terminal operating in the non-volatile memory device in terminal (mobile phone), also must deposit important informations such as mobile phone relevant configuration data, user resources.In the development process of portable terminal,, use the FLASH memory to deposit related data mostly in order to save cost, simplified design.A kind of method is to adopt file system, and the advantage of this method is to use simply, but the stability of file system is difficult to guarantee.Therefore, need to propose a kind of date storage method of on FLASH, realizing NvRam.
In existing relevant patent, (patent No. is US2006026211 as patent, international Main classification is G06F12/00) " Systems, methods, computer readable medium and apparatus formemory management using NvRam " in, this patent is provided at the method that integrity of data storage and efficient are provided in the computer system.It adopts two kinds of storage medium: FLASH and NvRam in system, utilize the function of NvRam as Cache (cache memory), and the data that buffer memory is nearest avoid FLASH frequently by erasable problem, have improved the useful life of efficient and FLASH.Though this method also is the method for storage, implementation and the present invention are different fully, and the present invention is the function that realizes NvRam and FLASH with a kind of storage medium FLASH.
Summary of the invention
Technical problem to be solved by this invention is to provide a kind of date storage method of portable terminal, is used to improve data storage efficiency and storage stability.
To achieve these goals, the invention provides a kind of date storage method of portable terminal, it is characterized in that, comprising:
Step 1, mark off N BLOCK as virtual nonvolatile memory from the FLASH of described portable terminal, carry out the mapping of virtual BLOCK to physics BLOCK, and virtual nonvolatile memory is carried out memory space configuration and initialization, N is the natural number more than or equal to 2;
Step 2 is carried out corresponding operation by described virtual nonvolatile memory according to the type of the operational order that receives;
When the type of described operational order when reading clauses and subclauses, then the initial position that distributes according to clauses and subclauses finds the position of reading clauses and subclauses, reads entry operation;
When the type of described operational order when writing clauses and subclauses, then the initial position that distributes according to clauses and subclauses finds the position of writing clauses and subclauses, writes entry operation;
When the type of described operational order is the BLOCK arrangement, then detects the reservation entries of virtual BLOCK and when the reservation entries of this virtual BLOCK is less than a preset threshold, this virtual BLOCK is carried out the BLOCK housekeeping operation.
The date storage method of described portable terminal, wherein, described BLOCK is divided into again: data BLOCK, backup BLOCK, described data BLOCK is used to store data, Backup Data when described backup BLOCK is used to carry out the disk arrangement.
The date storage method of described portable terminal, wherein, described data BLOCK is N-1, described backup BLOCK is one.
The date storage method of described portable terminal, wherein, the information among described each physics BLOCK comprises: with the numbering of this physics BLOCK corresponding virtual BLOCK, whether spendable expression and with the available items of this physics BLOCK corresponding virtual BLOCK and the number of entries of reservation.
The date storage method of described portable terminal wherein, is provided with one and is used for the information of the corresponding virtual BLOCK of mark and the BLOCK Info parameter of state among described each virtual BLOCK.
The date storage method of described portable terminal wherein, is provided with an information header that is used to store the information of corresponding clauses and subclauses in described each clauses and subclauses.
The date storage method of described portable terminal, wherein, the described step of reading entry operation is specially:
Determine the virtual BLOCK at this clauses and subclauses place according to the initial position of this clauses and subclauses distribution, obtain the state information of virtual BLOCK at this clauses and subclauses place and the state and the flag information of these clauses and subclauses by the initial position at this clauses and subclauses place, search out the position of finally reading clauses and subclauses according to described information again, carry out read operation.
The date storage method of described portable terminal, wherein, the described step of writing entry operation is specially:
Determine the virtual BLOCK at this clauses and subclauses place according to the initial position of this clauses and subclauses distribution, obtain the state information of virtual BLOCK at this clauses and subclauses place and the state and the flag information of these clauses and subclauses by the initial position at this clauses and subclauses place, again according to described Info Link to the position of finally writing clauses and subclauses, carry out write operation.
The date storage method of described portable terminal wherein, in the described step 2, comprises that also one judges whether the step that operational order arrives by described virtual nonvolatile memory.
The date storage method of described portable terminal wherein, in the described step 2, also comprises a step of the type of operational order being judged by described virtual nonvolatile memory.
Adopt the inventive method to improve data storage efficiency and storage security, specifically be:
1) mechanism that adopts clauses and subclauses to reserve improves the efficient of visiting when particularly rewriting a record;
2) data are adopted semi-static management, strengthen the transparency and the stability of data management.
Describe the present invention below in conjunction with the drawings and specific embodiments, but not as a limitation of the invention.
Description of drawings
Fig. 1 is the overall procedure schematic diagram of the virtual NvRam of the present invention;
Fig. 2 reads a rule purpose schematic flow sheet for the present invention;
Fig. 3 writes a rule purpose schematic flow sheet for the present invention;
Fig. 4 puts the schematic flow sheet in the BLOCK space of FLASH in order for the present invention.
Embodiment
As shown in Figure 1, be overall procedure schematic diagram to virtual NvRam operation.The overall procedure of this virtual NvRam comprises: the management of virtual NvRam, read-write clauses and subclauses/record and BLOCK housekeeping operation.Specifically comprise the steps:
First order management is the mapping of virtual NvRam to the BLOCK of the FLASH of physics.BLOCK is the minimum operation unit of FLASH, must monoblock wipe when just wiping.Adopt whole BLOCK space so distribute to the space of virtual NvRam, promptly adopt N BLOCK to use for virtual NvRam, wherein N-1 BLOCK is used as the storage data, this N-1 BLOCK is called data BLOCK again, backup was used when a BLOCK put in order as disk, this BLOCK is called backup BLOCK or BAK BLOCK again, and the BLOCK of N-1 so in logic data BLOCK and a BAKBLOCK and N physics has dynamic mapping relations.Physical message, stored information and current state to BLOCK manage.In each physics BLOCK, comprise the numbering LBN of corresponding logic BLOCK, whether spendable sign IUF (Is Used Flag), the available items of this BLOCK and the number of entries of reservation.All be mapped to the fixed position of logic BLOCK in addition for the initial position of each clauses and subclauses (for example which bar short message, which bar phone directory).
Wherein, IUF is used to represent whether current BLOCK is available, if during the arrangement of positive conducting disk, then BLOCK just can't use; When referring to initialization, the fixed position of logic BLOCK distributed the fixed position of this BLOCK.
Second level management is the BLOCK management, all has a BLOCK Info to come information and the state of this BLOCK of mark at each BLOCK.(whether this BLOCK is available for surface state and information: BLOCKIS_USED under comprising among the BLOCK Info, after finishing, can put Disk Cleanup this position), BLOCKCLEANING (expression BLOCK clears up), ITEM_SIZE (full-sizes of clauses and subclauses), ITEM_NUM (entry number that in this BLOCK, can deposit at most), RESEVED ITEM_NUM (reserving the entry number of sharing), the RECORD IS_USED (operating position of every initial record), thereserved BLOCK IS_USED (operating position of every record of reservation).
Third level management, it is management to items for information, each clauses and subclauses all has an information header to be used to store the relevant information of these clauses and subclauses, comprise: IS_USED (whether the space of this record is used), PRE_ITEM (record of the transfer of record front), CHANGE_ITEM (position of this record was write, and transferred to following position), SELF_COMPLETE (data write and finish, and represent that promptly it is complete that these clauses and subclauses write).
When carrying out the read operation of target entry, determine its certain clauses and subclauses according to the initial position that each clauses and subclauses is distributed at certain logic BLOCK, check the state of place BLOCK according to clauses and subclauses place initial position, and the state of relevant entry and sign, search out the position (memory locations of final clauses and subclauses) of finally being read, carry out read operation.
When carrying out the write operation of target entry, determine its certain clauses and subclauses according to the initial position that each clauses and subclauses is distributed at certain logic BLOCK, check the state of place BLOCK according to clauses and subclauses place initial position, and the state of relevant entry and sign, judgement is just to write or rewrite, various signs according to clauses and subclauses are linked to the position of finally writing clauses and subclauses, carry out write operation.
When the reservation entries that detects certain BLOCK when system is less than certain threshold value, just when having new data clauses and subclauses to rewrite again, when not having too many space to use again, will put in order this BLOCK.In the BLOCK finishing processes, need do relevant backup, guarantee to be organized safety of data.
Among Fig. 1, clauses and subclauses are represented a record storing, for example a short message, a phone directory recording; So clauses and subclauses are also referred to as record;
Target entry/record is indicated to the clauses and subclauses/record of its operation (reading and writing etc.);
Clauses and subclauses/LSN is represented the index of each clauses and subclauses/record;
The initial position of clauses and subclauses/record is represented the mapping position that each clauses and subclauses/record is initial;
Logic BLOCK represents a memory cell with BLOCK size (for example 128K), and the storage physical address of its reality changes and changes along with physical address, but the content of its storage is fixed.
As shown in Figure 2, read a rule purpose schematic flow sheet for the present invention.This flow process specifically comprises the steps:
Step 201 at first finds the position of this record initial storage by the method for searching the entry map table, i.e. BLOCK and the clauses and subclauses sequence number of this record place FLASH; Wherein, the entry map table is the mapping table of each clauses and subclauses (record) initial position;
Step 202 judges whether the BLOCK of place FLASH is current available, if system's conducting disk arrangement, at this moment this BLOCK is disabled; If current available, then carry out 203; Otherwise, execution in step 204;
Step 203 reads the relevant information of this record initial position, searches the initial position of record, and whether the IS_USED flag bit of judging the initial position of record put, if do not put, illustrates that this record is not write, clauses and subclauses are empty, return execution in step 208; If put, illustrated that this record had been write, execution in step 205;
Step 204, thread suspension is waited for, and further judges whether to have obtained semaphore, if obtain, then execution in step 203; Otherwise the hang-up thread continues to wait for;
Step 205 judges whether the CHANGE_ITEM flag bit is set, if there is not set, illustrates that this record does not have new link, execution in step 207; Otherwise, illustrate that these clauses and subclauses are rewritten, to new position, execution in step 206;
Step 206 is searched the next record (Next position) of link according to the CHANGE_ITEM flag bit, judges the whether set of CHANGE_ITEM flag bit of this record, if set continues to search, find the CHANGE_ITEM flag bit not have set always, otherwise, execution in step 207;
Step 207 is from up-to-date entry positions reading corresponding data;
Step 208 finishes.
As shown in Figure 3, write a rule purpose schematic flow sheet for the present invention.This flow process specifically comprises the steps:
Step 304 is searched an available locus from the record space of the reservation of this BLOCK; Find available record.
Step 305 is write the IS_USED flag bit;
Step 306 is write data in the data field;
Step 307 if desired, is write the PRE_ITEM flag bit;
Step 308 if desired, is write the CHANGE_ITEM flag bit;
Step 309 is write the SELF_COMPLETE flag bit, represents that these clauses and subclauses have write.
See also shown in Figure 4ly, put the arrangement schematic flow sheet in the BLOCK space of FLASH for the present invention in order.This flow process specifically comprises the steps:
Step 401, whether less than minimum threshold, if less than minimum threshold, then execution in step 402 to judge the clauses and subclauses (available reservation record) that this BLOCK reserves according to the monitoring thread; Otherwise continue monitoring;
Step 402 is prepared to enter the disk collating condition, judges whether standby BLOCK is available at present, if available, then carries out 403, otherwise execution in step 404;
Step 403 backups to the data of the BLOCK of FLASH in the BLOCK buffering area of FLASH (internal memory), continues step 405;
Step 404 waits for that standby BLOCK reaches upstate, changes step 402 over to;
Step 405, disposal data is got back to initial position with the data of reserving, and the relevant information area and sign are rewritten again;
Step 406 is write reduced data among the BAK BLOCK (or claim BAK FLASH), and mapping logic BLOCK again, the corresponding logic BLOCK of mark number;
Step 407 is wiped original FLASH (content of former whole BLOCK), and annotated logic BLOCK is BAK BLOCK, is about to this logic BLOCK and is mapped as BAR BLOCK;
Step 408, clear buffer.
Among Fig. 4, the BLOCK of logic is to the dynamic mapping of the physics BLOCK of FLASH; Each BLOCK except distributing original clauses and subclauses, used when also reserving certain entry number and being used to rewrite, the latest position of its clauses and subclauses is indexed by chained list, the management of chained list is crucial.
The inventive method is the storage means of a kind of NvRam of succinct practicality, by the mechanism that adopts clauses and subclauses to reserve, makes that efficient is improved when a record is particularly rewritten in visit; Adopt semi-static mode to manage to data, strengthened the transparency of data management.
Certainly; the present invention also can have other various embodiments; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art work as can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of the appended claim of the present invention.
Claims (10)
1. the date storage method of a portable terminal is characterized in that, comprising:
Step 1, mark off N BLOCK as virtual nonvolatile memory from the FLASH of described portable terminal, carry out the mapping of virtual BLOCK to physics BLOCK, and virtual nonvolatile memory is carried out memory space configuration and initialization, N is the natural number more than or equal to 2;
Step 2 is carried out corresponding operation by described virtual nonvolatile memory according to the type of the operational order that receives;
When the type of described operational order when reading clauses and subclauses, then the initial position that distributes according to clauses and subclauses finds the position of reading clauses and subclauses, reads entry operation;
When the type of described operational order when writing clauses and subclauses, then the initial position that distributes according to clauses and subclauses finds the position of writing clauses and subclauses, writes entry operation;
When the type of described operational order is the BLOCK arrangement, then detects the reservation entries of virtual BLOCK and when the reservation entries of this virtual BLOCK is less than a preset threshold, this virtual BLOCK is carried out the BLOCK housekeeping operation.
2. the date storage method of portable terminal according to claim 1, it is characterized in that, described BLOCK is divided into again: data BLOCK, backup BLOCK, described data BLOCK is used to store data, Backup Data when described backup BLOCK is used to carry out the disk arrangement.
3. the date storage method of portable terminal according to claim 2 is characterized in that, described data BLOCK is N-1, and described backup BLOCK is one.
4. according to the date storage method of claim 1,2 or 3 described portable terminals, it is characterized in that the information among described each physics BLOCK comprises: with the numbering of this physics BLOCK corresponding virtual BLOCK, whether spendable expression and with the available items of this physics BLOCK corresponding virtual BLOCK and the number of entries of reservation.
5. according to the date storage method of claim 1,2 or 3 described portable terminals, it is characterized in that, be provided with one among described each virtual BLOCK and be used for the information of the corresponding virtual BLOCK of mark and the BLOCK Info parameter of state.
6. according to the date storage method of claim 1,2 or 3 described portable terminals, it is characterized in that, be provided with an information header that is used to store the information of corresponding clauses and subclauses in described each clauses and subclauses.
7. according to the date storage method of claim 1,2 or 3 described portable terminals, it is characterized in that the described step of reading entry operation is specially:
Determine the virtual BLOCK at this clauses and subclauses place according to the initial position of this clauses and subclauses distribution, obtain the state information of virtual BLOCK at this clauses and subclauses place and the state and the flag information of these clauses and subclauses by the initial position at this clauses and subclauses place, search out the position of finally reading clauses and subclauses according to described information again, carry out read operation.
8. according to the date storage method of claim 1,2 or 3 described portable terminals, it is characterized in that the described step of writing entry operation is specially:
Determine the virtual BLOCK at this clauses and subclauses place according to the initial position of this clauses and subclauses distribution, obtain the state information of virtual BLOCK at this clauses and subclauses place and the state and the flag information of these clauses and subclauses by the initial position at this clauses and subclauses place, again according to described Info Link to the position of finally writing clauses and subclauses, carry out write operation.
9. according to the date storage method of claim 1,2 or 3 described portable terminals, it is characterized in that, in the described step 2, comprise that also one judges whether the step that operational order arrives by described virtual nonvolatile memory.
10. according to the date storage method of claim 1,2 or 3 described portable terminals, it is characterized in that, in the described step 2, also comprise a step of the type of operational order being judged by described virtual nonvolatile memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100889092A CN101115246B (en) | 2006-07-25 | 2006-07-25 | Data storage method of mobile terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100889092A CN101115246B (en) | 2006-07-25 | 2006-07-25 | Data storage method of mobile terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101115246A CN101115246A (en) | 2008-01-30 |
| CN101115246B true CN101115246B (en) | 2010-06-09 |
Family
ID=39023292
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006100889092A Active CN101115246B (en) | 2006-07-25 | 2006-07-25 | Data storage method of mobile terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101115246B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101594420B (en) * | 2008-05-26 | 2011-09-21 | 中兴通讯股份有限公司 | Rapid access method of cellphone application module |
| US8549516B2 (en) | 2008-12-23 | 2013-10-01 | Citrix Systems, Inc. | Systems and methods for controlling, by a hypervisor, access to physical resources |
| CN102801768A (en) * | 2012-01-20 | 2012-11-28 | 华为技术有限公司 | Data processing method and system and network device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1243317A (en) * | 1998-07-28 | 2000-02-02 | 索尼公司 | Non-volatile memory, recording apparatus and recording method |
| CN1270394A (en) * | 1999-04-02 | 2000-10-18 | 株式会社东芝 | Non-volatile semiconductor memroy device and control method for data erasion |
| WO2005071549A1 (en) * | 2004-01-26 | 2005-08-04 | Matsushita Electric Industrial Co., Ltd. | Semiconductor memory device and its control method |
| CN1794214A (en) * | 2005-12-22 | 2006-06-28 | 北京中星微电子有限公司 | Method of direct storage access for non-volatibility storage and its device |
-
2006
- 2006-07-25 CN CN2006100889092A patent/CN101115246B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1243317A (en) * | 1998-07-28 | 2000-02-02 | 索尼公司 | Non-volatile memory, recording apparatus and recording method |
| CN1270394A (en) * | 1999-04-02 | 2000-10-18 | 株式会社东芝 | Non-volatile semiconductor memroy device and control method for data erasion |
| WO2005071549A1 (en) * | 2004-01-26 | 2005-08-04 | Matsushita Electric Industrial Co., Ltd. | Semiconductor memory device and its control method |
| CN1794214A (en) * | 2005-12-22 | 2006-06-28 | 北京中星微电子有限公司 | Method of direct storage access for non-volatibility storage and its device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101115246A (en) | 2008-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1782176B1 (en) | Systems, methods, computer readable medium and apparatus for memory management using nvram | |
| US9817588B2 (en) | Memory device and operating method of same | |
| CN103577121B (en) | A kind of highly reliable linear file access method based on Nand Flash | |
| CN102981963B (en) | A kind of implementation method of flash translation layer (FTL) of solid-state disk | |
| US20080270680A1 (en) | Controller for Non-Volatile Memories and Methods of Operating the Memory Controller | |
| CN102779096B (en) | Page, block and face-based three-dimensional flash memory address mapping method | |
| CN103631536B (en) | A kind of method utilizing the invalid data of SSD to optimize RAID5/6 write performance | |
| CN102135942B (en) | Method for realizing wear-leveling in storage equipment as well as the storage equipment | |
| CN101515276B (en) | Method for write operation of file data, and recovery method and recovery system for file data | |
| CN105718206B (en) | The flash translation layer (FTL) and its implementation of RAID can be perceived | |
| CN103092766A (en) | Balanced loss achievement method for NAND FLASH | |
| CN101876949A (en) | Date memorizing system and method thereof | |
| CN104102591A (en) | Computer subsystem and method for implementing flash translation layer in computer subsystem | |
| CN102981966B (en) | A kind of date storage method of equilibrium assignment Flash storage block | |
| CN101556555B (en) | Block managing method for flash memory as well as controller and storage system thereof | |
| CN112231244B (en) | SIM card file erasing and writing system and method applied to SoftSIM and readable storage medium | |
| CN101425041A (en) | Optimizing method for establishing FAT file systems on NAND FLASH memory | |
| CN103544110A (en) | Block-level continuous data protection method based on solid-state disc | |
| CN109669889B (en) | Light Nor Flash control method and device | |
| CN106155915A (en) | The processing method and processing device of data storage | |
| CN103049393B (en) | Memory headroom management method and device | |
| CN109634873A (en) | Solid-state disk host system log information method, apparatus, equipment and medium | |
| CN110018790A (en) | A kind of method and system guaranteeing persistence data in EMS memory crash consistency | |
| CN109558335A (en) | A kind of file memory format of the embedded system based on Nor flash storage | |
| CN110287068B (en) | NandFlash driving method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |