CN105446664A - Memory file storage method and storage apparatus - Google Patents
Memory file storage method and storage apparatus Download PDFInfo
- Publication number
- CN105446664A CN105446664A CN201510876978.9A CN201510876978A CN105446664A CN 105446664 A CN105446664 A CN 105446664A CN 201510876978 A CN201510876978 A CN 201510876978A CN 105446664 A CN105446664 A CN 105446664A
- Authority
- CN
- China
- Prior art keywords
- address
- data
- file
- block
- write
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000013507 mapping Methods 0.000 abstract description 5
- 238000013500 data storage Methods 0.000 abstract 2
- 238000010586 diagram Methods 0.000 description 3
- 230000005055 memory storage Effects 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0643—Management of files
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
- G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
- G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to storage systems
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a memory file storage method. The file storage method comprises the following steps of: dividing a memory into two regions, wherein one region is a configuration storage region and the other region is a data storage region; dividing the data storage region into two file regions, wherein one region is a file data region and the other region is a file exchange region; writing the file exchange region into the memory and updating a storage mapping table, wherein the storage mapping table is used for indicating a relationship between a logic address and a physical address of the file data region and the file exchange region; determining whether file data are all successfully written, and if yes, updating the written file data to the file data region; and storing the updated storage mapping table into the configuration storage region. According to the file storage method, the completeness of files can be ensured.
Description
Technical field
The present invention relates to peace electronics field, particularly relate to one and file memory method and memory storage are carried out to storer.
Background technology
Current many electronic products can be increased by the mode of upgrade software packet or the function of upgrading products, are not needing to make product can meet the demand of client under the prerequisite changing product.
Along with the continuous renewal of product is upgraded, the individual data stored in product is also increasing, also increasing to the demand of the storer in product, such one side will increase the cost of product, on the other hand due to the increase of single data, in the kind excessively of Data Update, the probability of Data Update failure also will increase thereupon, because the data major part upgraded is program software, if upgrade unsuccessfully, the serious consequence of damage of product may be caused.
The memory technology of current use, one is better simply a kind of mode, two sections of storage spaces are distributed on a memory by all data that will upgrade, when upgrading, this two sector addresses space-alternating uses, can guarantee that whole file is successfully updated after in memory device like this, then delete old data.This method can guarantee that whole file is updated in memory device by correct, but can cause the demand of storer very large like this, adds the cost of product.
Another kind of mode, namely general file system, such as FAT32, JFFS2 etc., this kind of file system can well solve the problem of storage space, but the integrality of the monolithic data of current write can only be guaranteed, the integrality of whole file can not be guaranteed, if occur abnormal in data writing process, such as power down suddenly, then need the data of the file upgraded that one may be had to be old, and some is new write, cause whole data not to be complete, be namely new data entirely or be old data entirely.Although the method can save storage space, reduce the cost of product, the integrality of whole file data can not be guaranteed, the serious consequence of damage of product may be caused.
Summary of the invention
Object of the present invention is intended at least solve one of above-mentioned technological deficiency, provides a kind of and carries out file memory method and memory storage to storer.
The invention provides one and carry out file memory method to storer, described file memory method comprises the following steps:
Storer is divided into two regions, one of them region is stored configuration district, and another region is for storing data field;
Storage data field is divided into two file areas, one of them region is file data district, and another region is exchange files district;
To storer writing in files exchange area, and upgrade memory map assignments, wherein said memory map assignments is used to indicate described file data district and the logical address in exchange files district and the relation of physical address;
Judge whether file data successfully writes, if so, the file data of write is updated to described file data district;
Memory map assignments after upgrading is saved in described stored configuration district.
As can be seen from the scheme of said method, when all data one-time writes of file, and after all data successfully write, then memory map assignments is deposited be saved in memory map assignments storage block.Before data do not write successfully, old data are also present in storer always, and what memory map assignments was pointed to is also old data, only have when after data integrity write, memory map assignments just can point to new data, and old data are by invalid, thus guarantees integrality and the reliability of data.
1, the present invention also provides one to carry out file storage device to storer, and described file storage device comprises:
First divides module, and for storer being divided into two regions, one of them region is stored configuration district, and another region is for storing data field;
Second divides module, and for storage data field is divided into two file areas, one of them region is file data district, and another region is exchange files district;
Writing module, for storer writing in files exchange area, and upgrades memory map assignments, and wherein said memory map assignments is used to indicate described file data district and the logical address in exchange files district and the relation of physical address;
Judge module, judges whether file data successfully writes;
First update module, for when the result of judge module is for being, is updated to described file data district by the file data of write;
Second update module, for being saved to the memory map assignments after renewal in described stored configuration district.
As can be seen from the scheme of said apparatus, when all data one-time writes of file, and after all data successfully write, then memory map assignments is deposited be saved in memory map assignments storage block.Before data do not write successfully, old data are also present in storer always, and what memory map assignments was pointed to is also old data, only have when after data integrity write, memory map assignments just can point to new data, and old data are by invalid, thus guarantees integrality and the reliability of data.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of a kind of embodiment of file memory method of the present invention;
Fig. 2 is the structural representation of storer of the present invention;
Fig. 3 is the structural representation of memory map assignments of the present invention;
Fig. 4 is the process flow diagram of a kind of embodiment of write operation of file data flow process of the present invention;
Fig. 5 is the process flow diagram of the another kind of embodiment of file memory method of the present invention;
Fig. 6 is the structural representation of a kind of embodiment of file storage device of the present invention.
Embodiment
In order to make technical matters solved by the invention, technical scheme and beneficial effect clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
What the invention provides a kind of embodiment carries out file memory method to storer, and as shown in Figure 1, described file memory method comprises:
Step S01, is divided into two regions by storer, one of them region is stored configuration district, and another region is for storing data field;
Step S02, is divided into two file areas by storage data field, one of them region is file data district, and another region is exchange files district;
Step S03, to storer writing in files exchange area, and upgrades memory map assignments, and wherein said memory map assignments is used to indicate described file data district and the logical address in exchange files district and the relation of physical address;
Step S04, judges whether file data successfully writes, if so, enters step S05, if not, enter step S03;
Step S05, is updated to described file data district by the file data of write;
Step S06, is saved to the memory map assignments after upgrading in described stored configuration district.
In step S01 and S02, as shown in Figure 2, described storer comprises stored configuration district 120, is used to refer to the parameter of the storage of this method; Store data field 110, be used for storing actual data; File data district 112, is used for storing actual file data; Exchange files district 111, is used for the interim store file data when file writes, and first writes data into exchange area, waits file data all successfully after write, then exchanges with the storage block in file data district; Information table memory 122, is used to refer to some informations parameter of storage; Memory map assignments 121, is used to refer to the logical address in file data district and exchange files district and the relation of physical address.
In concrete enforcement, in described information table memory 122, have recorded the physical storage locations, the physical storage locations of memory map assignments, the size of memory map assignments, the size of storage block, file storage area size and the exchange files district size that store data field;
The size of described memory map assignments can determine that can map how many stores data block;
The size of storage block indicates the size of data of minimum exchange in file storage area and exchange files district;
File storage area size indicates the max cap. that can store, and is the size that reality can store data;
Exchange files district size indicates the size of the maximum Single document that can write, and this size is configured to the maximum file size that may write.
In concrete enforcement, as shown in Figure 3, described memory map assignments 121 records and indicates the address of the physical storage block corresponding to logical storage block address, comprise file data district 112 and exchange files district 111, a memory map assignments end mark is had at the final area of memory map assignments, this mark will be used to be confirmed whether as effectively when recovering memory map assignments, if be not end mark, then show for current page did not preserve the memory map assignments of memory map assignments or mistake.
In concrete enforcement, described to storer writing in files exchange area, and upgrade the step of memory map assignments, specifically comprise the following steps:
Search memory map assignments, in described exchange files district, obtain the physical address of a swap block;
Empty the original data in swap block corresponding to described physical address;
File data is written in swap block corresponding to described physical address;
When the data of swap block corresponding to described physical address are write full, upgrade described physical address counterlogic address;
Upgrade memory map assignments.
In concrete enforcement, the described step be written to by file data in swap block corresponding to described physical address, comprises the following steps:
Judge that whether the initial address write is the initial address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Start address from the start address copies data of script physical block to swap block, wherein size of data is the current initial address of address to described swap block that will write data;
File data is to described swap block address.
In concrete enforcement, as shown in Figure 4, the described step be written to by file data in swap block corresponding to described physical address, comprises the following steps:
Step S041, judges that whether the initial address write is the initial address of swap block; If not, enter step S042, if so, step S044;
Step S042, if not, searches memory map assignments, obtains the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Step S043, the start address from the start address copies data of script physical block to swap block, wherein size of data is the current initial address of address to described swap block that will write data;
Step S044, file data is to described swap block address;
Step S045, judges that whether the end address write is the end address of swap block, if not, enters step S046, if so, enter step S048;
Step S046, if not, searches memory map assignments, obtains the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Step S047, the current end address from the start address copies data of script physical block to swap block, wherein size of data is the end address of described swap block to the current end address that will write data;
Step S048, when the data of swap block corresponding to described physical address are write full, upgrade described physical address counterlogic address, namely logical address is from adding 1.
That is, when carrying out write operation of file data flow process, in exchange files district, first being obtained the physical address of a swap block by memory map assignments 121, then write data in this physical storage block.Write operation each time all will upgrade in units of storage block, if the start address namely writing data is not storage block start address, then the current legacy data write before data start address can be copied to new storage block, more then write current data; If after current data write, this storage block is not also write full, copies in new storage block by by the legacy data of correspondence.If data write successfully, then upgrade the memory map assignments in internal memory, the physical address of swap block is written to corresponding logical memory blocks position, then physical store block address corresponding for logical memory blocks is before written to the position of swap block; If the data of this file are all successfully write, then last position memory map assignments in internal memory being written to correspondence in storer.
In concrete enforcement, the step of described renewal memory map assignments, comprises the following steps:
The physical address of described swap block is written to corresponding logical memory blocks position;
Physical store block address corresponding for logical memory blocks is written to the position of swap block.
That is, the storage block of preserving memory map assignments is referred to as memory map assignments storage block; Be several memory map assignments pages of memory map assignments size sized by memory map assignments storage block is divided.Memory map assignments storage block can adopt two storage blocks alternately to deposit memory map assignments in the realization of reality; Memory map assignments upgrades in storage mapping page new for the next one that is written in current storage block at every turn.If this storage block is fully written, first that is then written to another storage block stores in mapping page, what two storage blocks like this replaced deposits memory map assignments, after all data of file are successfully written to, then need the memory map assignments of renewal to be saved in storer, to confirm that the final data of file is for latest data, if memory map assignments is not saved in storer, then storer is when recovering memory map assignments next time, and the data that this file points to will be also old data.
In concrete enforcement, as shown in Figure 5, described file memory method is further comprising the steps of:
Step S07, when file reading data, searches memory map assignments, obtains the physical block address that LBA (Logical Block Addressing) is corresponding;
Step S08, reads data from the physical block acquired;
Step S09, upgrades described physical address counterlogic address;
Step S10, judges whether file data all runs through, if so, enters step S11, if not, enter step S07;
Step S11, file reads and terminates.
That is, when file reading data, the physical store block address of the logical memory blocks first finding file corresponding by memory map assignments 121, then reads corresponding data from the physical storage block of reality.
In addition, the size in exchange files district is configured to the size of the maximum data file that may write, so the data of each file can disposablely complete be written to exchange files district.When all data one-time writes of file, and after all data successfully write, then memory map assignments is deposited be saved in memory map assignments storage block.Before data do not write successfully, old data are also present in storer always, and what memory map assignments was pointed to is also old data, and only have when after data integrity write, memory map assignments just can point to new data, and old data are by invalid.By above process, thus guarantee integrality and the reliability of data.And, because all files are all shared same file exchange areas, do not need for each file allocation exchange files district, so save storage space greatly, and file more more piece economize space more.
As can be seen from the scheme of said method, when all data one-time writes of file, and after all data successfully write, then memory map assignments is deposited be saved in memory map assignments storage block.Before data do not write successfully, old data are also present in storer always, and what memory map assignments was pointed to is also old data, only have when after data integrity write, memory map assignments just can point to new data, and old data are by invalid, thus guarantees integrality and the reliability of data.
In concrete enforcement, what the invention provides a kind of embodiment carries out file storage device to storer, and as shown in Figure 6, described file storage device comprises:
First divides module 61, and for storer being divided into two regions, one of them region is stored configuration district 120, and another region is for storing data field 110;
Second divides module 62, and for storage data field 110 is divided into two file areas, one of them region is file data district 112, and another region is exchange files district 111;
Writing module 63, for storer writing in files exchange area 111, and upgrades memory map assignments 121, and wherein said memory map assignments is used to indicate described file data district and the logical address in exchange files district and the relation of physical address;
Judge module 64, judges whether file data successfully writes;
First update module 65, for when the result of judge module is for being, is updated to described file data district 112 by the file data of write;
Second update module 66, for being saved to the memory map assignments 121 after renewal in described stored configuration district 120.
As shown in Figure 2, described storer 100 comprises stored configuration district 120, is used to refer to the parameter of the storage of this method; Store data field 110, be used for storing actual data; File data district 112, is used for storing actual file data; Exchange files district 111, is used for the interim store file data when file writes, and first writes data into exchange area, waits file data all successfully after write, then exchanges with the storage block in file data district; Information table memory 122, is used to refer to some informations parameter of storage; Memory map assignments 121, is used to refer to the logical address in file data district and exchange files district and the relation of physical address.
In concrete enforcement, in described information table memory 122, have recorded the physical storage locations, the physical storage locations of memory map assignments, the size of memory map assignments, the size of storage block, file storage area size and the exchange files district size that store data field;
The size of described memory map assignments can determine that can map how many stores data block;
The size of storage block indicates the size of data of minimum exchange in file storage area and exchange files district;
File storage area size indicates the max cap. that can store, and is the size that reality can store data;
Exchange files district size indicates the size of the maximum Single document that can write, and this size is configured to the maximum file size that may write.
In concrete enforcement, as shown in Figure 3, described memory map assignments 121 records and indicates the address of the physical storage block corresponding to logical storage block address, comprise file data district 112 and exchange files district 111, a memory map assignments end mark is had at the final area of memory map assignments, this mark will be used to be confirmed whether as effectively when recovering memory map assignments, if be not end mark, then show for current page did not preserve the memory map assignments of memory map assignments or mistake.
In concrete enforcement, said write module 63 also for:
Search memory map assignments, in described exchange files district, obtain the physical address of a swap block;
Empty the original data in swap block corresponding to described physical address;
File data is written in swap block corresponding to described physical address;
When the data of swap block corresponding to described physical address are write full, upgrade described physical address counterlogic address;
Upgrade memory map assignments 121.
In concrete enforcement, said write module 63 also for:
Judge that whether the initial address write is the initial address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Start address from the start address copies data of script physical block to swap block, wherein size of data is the current initial address of address to described swap block that will write data;
File data is to described swap block address.
In concrete enforcement, said write module 63 also for:
Said write module also for:
Judge that whether the initial address write is the initial address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Start address from the start address copies data of script physical block to swap block, wherein size of data is the current initial address of address to described swap block that will write data;
File data is to described swap block address;
Judge that whether the end address write is the end address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Current end address from the start address copies data of script physical block to swap block, wherein size of data is the end address of described swap block to the current end address that will write data;
If so, enter when the data of swap block corresponding to described physical address are write full, upgrade the step of described physical address counterlogic address.
That is, when carrying out write operation of file data flow process, in exchange files district, first being obtained the physical address of a swap block by memory map assignments 121, then write data in this physical storage block.Write operation each time all will upgrade in units of storage block, if the start address namely writing data is not storage block start address, then the current legacy data write before data start address can be copied to new storage block, more then write current data; If after current data write, this storage block is not also write full, copies in new storage block by by the legacy data of correspondence.If data write successfully, then upgrade the memory map assignments in internal memory, the physical address of swap block is written to corresponding logical memory blocks position, then physical store block address corresponding for logical memory blocks is before written to the position of swap block; If the data of this file are all successfully write, then last position memory map assignments in internal memory being written to correspondence in storer.
In addition, the size in exchange files district is configured to the size of the maximum data file that may write, so the data of each file can disposablely complete be written to exchange files district.When all data one-time writes of file, and after all data successfully write, then memory map assignments is deposited be saved in memory map assignments storage block.Before data do not write successfully, old data are also present in storer always, and what memory map assignments was pointed to is also old data, and only have when after data integrity write, memory map assignments just can point to new data, and old data are by invalid.By above process, thus guarantee integrality and the reliability of data.And, because all files are all shared same file exchange areas, do not need for each file allocation exchange files district, so save storage space greatly, and file more more piece economize space more.
As can be seen from the scheme of said apparatus, when all data one-time writes of file, and after all data successfully write, then memory map assignments is deposited be saved in memory map assignments storage block.Before data do not write successfully, old data are also present in storer always, and what memory map assignments was pointed to is also old data, only have when after data integrity write, memory map assignments just can point to new data, and old data are by invalid, thus guarantees integrality and the reliability of data.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a file memory method is carried out to storer, it is characterized in that: described file memory method comprises the following steps:
Storer is divided into two regions, one of them region is stored configuration district, and another region is for storing data field;
Storage data field is divided into two file areas, one of them region is file data district, and another region is exchange files district;
To storer writing in files exchange area, and upgrade memory map assignments, wherein said memory map assignments is used to indicate described file data district and the logical address in exchange files district and the relation of physical address;
Judge whether file data successfully writes, if so, the file data of write is updated to described file data district;
Memory map assignments after upgrading is saved in described stored configuration district.
2. file memory method as claimed in claim 1, is characterized in that: described to storer writing in files exchange area, and upgrades the step of memory map assignments, specifically comprise the following steps:
Search memory map assignments, in described exchange files district, obtain the physical address of a swap block;
Empty the original data in swap block corresponding to described physical address;
File data is written in swap block corresponding to described physical address;
When the data of swap block corresponding to described physical address are write full, upgrade described physical address counterlogic address;
Upgrade memory map assignments.
3. file memory method as claimed in claim 2, is characterized in that: the described step be written to by file data in swap block corresponding to described physical address, comprises the following steps:
Judge that whether the initial address write is the initial address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Start address from the start address copies data of script physical block to swap block, wherein size of data is the current initial address of address to described swap block that will write data;
File data is to described swap block address.
4. file memory method as claimed in claim 2, is characterized in that: the described step be written to by file data in swap block corresponding to described physical address, comprises the following steps:
Judge that whether the initial address write is the initial address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Start address from the start address copies data of script physical block to swap block, wherein size of data is the current initial address of address to described swap block that will write data;
File data is to described swap block address;
Judge that whether the end address write is the end address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Current end address from the start address copies data of script physical block to swap block, wherein size of data is the end address of described swap block to the current end address that will write data;
If so, enter when the data of swap block corresponding to described physical address are write full, upgrade the step of described physical address counterlogic address.
5. file memory method as claimed in claim 2, is characterized in that: the step of described renewal memory map assignments, comprises the following steps:
The physical address of described swap block is written to corresponding logical memory blocks position;
Physical store block address corresponding for logical memory blocks is written to the position of swap block.
6. file memory method as claimed in claim 1, is characterized in that: further comprising the steps of:
When file reading data, search memory map assignments, obtain the physical block address that LBA (Logical Block Addressing) is corresponding;
Data are read from the physical block acquired;
Upgrade described physical address counterlogic address;
Judge whether file data all runs through, if so, described in entering, search memory map assignments, obtain the step of physical block address corresponding to LBA (Logical Block Addressing).
7. a file storage device is carried out to storer, it is characterized in that: described file storage device comprises:
First divides module, and for storer being divided into two regions, one of them region is stored configuration district, and another region is for storing data field;
Second divides module, and for storage data field is divided into two file areas, one of them region is file data district, and another region is exchange files district;
Writing module, for storer writing in files exchange area, and upgrades memory map assignments, and wherein said memory map assignments is used to indicate described file data district and the logical address in exchange files district and the relation of physical address;
Judge module, judges whether file data successfully writes;
First update module, for when the result of judge module is for being, is updated to described file data district by the file data of write;
Second update module, for being saved to the memory map assignments after renewal in described stored configuration district.
8. file storage device as claimed in claim 7, is characterized in that: said write module also for:
Search memory map assignments, in described exchange files district, obtain the physical address of a swap block;
Empty the original data in swap block corresponding to described physical address;
File data is written in swap block corresponding to described physical address;
When the data of swap block corresponding to described physical address are write full, upgrade described physical address counterlogic address;
Upgrade memory map assignments.
9. file storage device as claimed in claim 8, is characterized in that: said write module also for:
Judge that whether the initial address write is the initial address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Start address from the start address copies data of script physical block to swap block, wherein size of data is the current initial address of address to described swap block that will write data;
File data is to described swap block address.
10. file storage device as claimed in claim 8, is characterized in that: said write module also for:
Judge that whether the initial address write is the initial address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Start address from the start address copies data of script physical block to swap block, wherein size of data is the current initial address of address to described swap block that will write data;
File data is to described swap block address;
Judge that whether the end address write is the end address of swap block;
If not, search memory map assignments, obtain the physical block address that original data LBA (Logical Block Addressing) is corresponding;
Current end address from the start address copies data of script physical block to swap block, wherein size of data is the end address of described swap block to the current end address that will write data;
If so, enter when the data of swap block corresponding to described physical address are write full, upgrade the step of described physical address counterlogic address.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510876978.9A CN105446664B (en) | 2015-12-03 | 2015-12-03 | A kind of pair of memory carries out file memory method and storage device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510876978.9A CN105446664B (en) | 2015-12-03 | 2015-12-03 | A kind of pair of memory carries out file memory method and storage device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105446664A true CN105446664A (en) | 2016-03-30 |
| CN105446664B CN105446664B (en) | 2018-11-20 |
Family
ID=55556924
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510876978.9A Expired - Fee Related CN105446664B (en) | 2015-12-03 | 2015-12-03 | A kind of pair of memory carries out file memory method and storage device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105446664B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106339431A (en) * | 2016-08-18 | 2017-01-18 | 佛山智能装备技术研究院 | Processing method and system for robot program files based on text blocks |
| WO2017185579A1 (en) * | 2016-04-26 | 2017-11-02 | 杭州海康威视数字技术股份有限公司 | Method and apparatus for data storage |
| CN109783440A (en) * | 2018-12-19 | 2019-05-21 | 平安普惠企业管理有限公司 | Date storage method and data retrieval method, device, medium, electronic equipment |
| WO2020094063A1 (en) * | 2018-11-06 | 2020-05-14 | 中兴通讯股份有限公司 | Data storage method and device, storage medium and electronic device |
| CN111897744A (en) * | 2019-05-05 | 2020-11-06 | 北京兆易创新科技股份有限公司 | Data writing method and device, electronic equipment and storage medium |
| CN113553005A (en) * | 2021-07-06 | 2021-10-26 | 杭州宏杉科技股份有限公司 | Data reading and writing method, device and equipment for simplifying LUN |
| CN113722340A (en) * | 2021-08-27 | 2021-11-30 | 科大智能电气技术有限公司 | Processing method and system for remote automatic point table updating based on power distribution device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1183842A (en) * | 1995-05-09 | 1998-06-03 | 软体未来设计股份有限公司 | Interface circuit and data processing apparatus and method |
| US20080126712A1 (en) * | 2006-11-28 | 2008-05-29 | Hitachi, Ltd. | Semiconductor memory system having a snapshot function |
| WO2010070427A2 (en) * | 2008-12-17 | 2010-06-24 | Sandisk Il Ltd. | Ruggedized memory device |
| CN102572330A (en) * | 2010-12-29 | 2012-07-11 | 厦门华侨电子股份有限公司 | Method for reading, writing and erasing data of liquid crystal television Flash chip |
| CN102929563A (en) * | 2012-10-12 | 2013-02-13 | 大唐微电子技术有限公司 | Transaction data processing method and device |
-
2015
- 2015-12-03 CN CN201510876978.9A patent/CN105446664B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1183842A (en) * | 1995-05-09 | 1998-06-03 | 软体未来设计股份有限公司 | Interface circuit and data processing apparatus and method |
| US20080126712A1 (en) * | 2006-11-28 | 2008-05-29 | Hitachi, Ltd. | Semiconductor memory system having a snapshot function |
| WO2010070427A2 (en) * | 2008-12-17 | 2010-06-24 | Sandisk Il Ltd. | Ruggedized memory device |
| CN102572330A (en) * | 2010-12-29 | 2012-07-11 | 厦门华侨电子股份有限公司 | Method for reading, writing and erasing data of liquid crystal television Flash chip |
| CN102929563A (en) * | 2012-10-12 | 2013-02-13 | 大唐微电子技术有限公司 | Transaction data processing method and device |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017185579A1 (en) * | 2016-04-26 | 2017-11-02 | 杭州海康威视数字技术股份有限公司 | Method and apparatus for data storage |
| CN106339431A (en) * | 2016-08-18 | 2017-01-18 | 佛山智能装备技术研究院 | Processing method and system for robot program files based on text blocks |
| WO2020094063A1 (en) * | 2018-11-06 | 2020-05-14 | 中兴通讯股份有限公司 | Data storage method and device, storage medium and electronic device |
| CN109783440A (en) * | 2018-12-19 | 2019-05-21 | 平安普惠企业管理有限公司 | Date storage method and data retrieval method, device, medium, electronic equipment |
| CN109783440B (en) * | 2018-12-19 | 2023-09-19 | 爱云保(上海)科技有限公司 | Data storage method, data retrieval method, data storage device, medium and electronic equipment |
| CN111897744A (en) * | 2019-05-05 | 2020-11-06 | 北京兆易创新科技股份有限公司 | Data writing method and device, electronic equipment and storage medium |
| CN113553005A (en) * | 2021-07-06 | 2021-10-26 | 杭州宏杉科技股份有限公司 | Data reading and writing method, device and equipment for simplifying LUN |
| CN113553005B (en) * | 2021-07-06 | 2023-12-22 | 杭州宏杉科技股份有限公司 | Data read-write method, device and equipment for simplifying LUN |
| CN113722340A (en) * | 2021-08-27 | 2021-11-30 | 科大智能电气技术有限公司 | Processing method and system for remote automatic point table updating based on power distribution device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105446664B (en) | 2018-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105446664A (en) | Memory file storage method and storage apparatus | |
| US11474972B2 (en) | Metadata query method and apparatus | |
| US10007468B2 (en) | Method and apparatus for erasing data in data section in flash memory | |
| US20180275887A1 (en) | Data Storage Device and Operating Method of Data Storage Device | |
| CN102508784B (en) | Data storage method of flash memory card in video monitoring equipment, and system thereof | |
| TWI394041B (en) | Method and device to improve usb flash write performance | |
| CN108475230B (en) | Storage system and system garbage recycling method | |
| US10572335B2 (en) | Metadata recovery method and apparatus | |
| CN105912475A (en) | System and method for copy on write on an SSD | |
| US20230244382A1 (en) | Deallocated Block Determination | |
| CN103970669A (en) | Method for accelerating physical-to-logic address mapping of recycling operation in solid-state equipment | |
| KR20170010810A (en) | Method, device and user equipment for reading/writing data in nand flash | |
| CN107273306B (en) | Data reading and writing method for solid state disk and solid state disk | |
| CN110795031A (en) | Data deduplication method, device and system based on full flash storage | |
| CN104408126A (en) | Persistent writing method, device and system of database | |
| KR100954603B1 (en) | A log file of file system and method for recovering file system | |
| CN112148220B (en) | Method, device, computer storage medium and terminal for realizing data processing | |
| KR101465426B1 (en) | Extent mapping flash device | |
| CN110837345A (en) | Bad block table storage method and device | |
| CN111143284A (en) | Dynamic indexing method and device for file system | |
| KR102053406B1 (en) | Data storage device and operating method thereof | |
| CN109388524B (en) | Virtual disk format addressing method and computer readable storage medium | |
| JP2008134777A (en) | Caching method of file allocation table | |
| CN117812095A (en) | Method, device, equipment and medium for detecting multi-data duplicate data consistency | |
| CN118277158A (en) | Data recovery method, computer readable storage medium and memory |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 22A, Guoshi building, 1801 Shahe West Road, high tech Zone, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Patentee after: GUOWEI GROUP (SHENZHEN) Co.,Ltd. Address before: 518000 Guangdong city of Shenzhen province Nanshan District high tech Industrial Park South high SSMEC building two floor Patentee before: SHENZHEN STATE MICRO TECHNOLOGY Co.,Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181120 |