CN1959677A - Method for arranging items of directory in file system - Google Patents
Method for arranging items of directory in file system Download PDFInfo
- Publication number
- CN1959677A CN1959677A CN 200610144195 CN200610144195A CN1959677A CN 1959677 A CN1959677 A CN 1959677A CN 200610144195 CN200610144195 CN 200610144195 CN 200610144195 A CN200610144195 A CN 200610144195A CN 1959677 A CN1959677 A CN 1959677A
- Authority
- CN
- China
- Prior art keywords
- bunch
- directory
- directory entry
- district
- target
- 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 29
- 239000000047 product Substances 0.000 description 4
- 238000004140 cleaning Methods 0.000 description 3
- COCAUCFPFHUGAA-MGNBDDOMSA-N n-[3-[(1s,7s)-5-amino-4-thia-6-azabicyclo[5.1.0]oct-5-en-7-yl]-4-fluorophenyl]-5-chloropyridine-2-carboxamide Chemical compound C=1C=C(F)C([C@@]23N=C(SCC[C@@H]2C3)N)=CC=1NC(=O)C1=CC=C(Cl)C=N1 COCAUCFPFHUGAA-MGNBDDOMSA-N 0.000 description 3
- 241000255789 Bombyx mori Species 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000010902 straw Substances 0.000 description 2
- 238000000429 assembly Methods 0.000 description 1
- 230000000712 assembly Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000012467 final product Substances 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Abstract
A method for arranging catalogue item of file system includes confirming object catalogue and checking catalogue item, judging whether each catalogue item in object catalogue is effective catalogue item or deleted catalogue item, moving found-deleted catalogue item into a cluster when found-deleted catalogue items are enough to be packed in a cluster, setting first byte of all catalogue items in cluster to be zero when movement is finished and deleting said cluster off from cluster chain of object catalogue.
Description
Technical field
The present invention relates to file system, particularly the arranging items of directory of file system.
Background technology
Now a lot of embedded handhold equipments such as mobile phone, MP3/MP4 player etc. all begins to support external memory interface, as SD card standard interface, NandFlash interface etc.These embedded handhold equipments all use the interface of FAT (file allocation table file allocation table) file system as access external memory, carry out operations such as file read-write according to the different FAT12/FAT16/FAT32 file system of using of external memory storage capacity.
File system on the nonvolatile memory generally has BIOS (Basic Input or Output System (BIOS)) parameter block, file allocation table (FAT table), root directory and data field, such file system is commonly referred to as the FAT file system, comprise three kinds of FAT12, FAT16 and FAT32 at present, in the file system with bunch as basic storage unit.Wherein:
The data field is used to deposit the data of file content.
The BIOS parameter block has write down the sector number, sector sum, root directory item number of every sector byte number, every bunch of sector number, each FAT or the like parameter.
Write down the directory entry of each file and catalogue in the root directory, be also referred to as directory entry or list item; Writing down file or directory name, file or catalogue in the directory entry first bunch number, the data of the description logic file data structures such as date of file size, document creation.Root directory and each straton catalogue all have the FDT (File Directory Table) of oneself to be used to deposit the directory entry of each file and catalogue under this catalogue.
FAT table is the chained list of each logical file of record in the physical storage locations of data field, generally bunch being unit; The logical file here comprises file and catalogue.The FAT list area is divided into a plurality of intervals (also can be referred to as unit, element) by 1 nibble (FAT12), 2 bytes (FAT16), 4 bytes (FAT32), each interval is corresponding to one bunch of the data field, be these interval numberings in order, be called bunch number, this bunch is number except being the data, also corresponding to a certain interval of FAT list area and bunch of data field.
Logical file can take one or above bunch,, document storage the data field bunch in be data; And catalogue leave in the data field bunch in be directory entry, these directory entries are writing down the information of all sub-directories and file under this catalogue.When taking more than one bunch, logical file is after filling one bunch, adorns in next bunch again.Since bunch deposit the order may not be continuous on physical address, therefore in the FAT of logical file table, the interval of each bunch number correspondence all deposit this logical file data place the next one bunch bunch number, it is the next one bunch that each bunch number all has this logical file data place of a chained list pointed, thereby constitute a chained list, be called a bunch chain; If what deposit in one bunch number the interval is not next bunch number but FF represents that then this bunch is last bunch of logical file.Like this, as long as know logical file first bunch number, can find a bunch of chain, and then obtain the memory location of these all data of logical file.Root directory and each straton catalogue all have separately independently bunch chain.
Along with the user creates increasing of file, delete file operation, the directory entry of file system in the external memory storage---comprises file and catalogue---also can constantly be increased, up to the maximum directory entry number that reaches under the catalogue.Catalogue is the i.e. directory area of this catalogue of corresponding memory space in the data field, and the directory entry in the catalogue promptly leaves in its directory area.In the directory area of file system, increase along with deltree item and new directory item, the structure of directory area can be more and more huger, when file of deletion or catalogue, except with it the data deletion of data field, also can be with the change of its directory entry, generally be that the first byte with its directory entry changes E5 into, at this moment its directory entry just becomes the item that deltreed, and item in fact also is present in the origin-location of directory area but this has deltreed.Carry out file or catalogue search or during creation operation, the name of file destination or catalogue and each directory entry in the directory area need be compared, because directory entry is deposited continuously, go comparison successively by physical address relatively exactly, therefore also can compare the item that deltrees, item is a lot of if deltreed, and this useless search operation will be many more, causes the more resources waste.For example: in the External memory equipment file system in certain embedded system, be 100 at a useful directory entry number, a number that deltreed is 0 catalogue, and the time of creating a new file approximately is 150 milliseconds; But at a useful directory entry number is 100, a number that deltreed is 6000 catalogue, the time of creating a new file is approximately 1400 milliseconds, and the used time approximately differs 10 times, and the time of wasting on the item that deltrees has taken the resource of system 90%.
The resource of embedded system and performance are all more limited, in this case, can be very consuming time when carrying out file operation as operations such as creating, delete, search, cause the product overall performance to descend, can't meet customer need.
Summary of the invention
At above-mentioned deficiency, the present invention proposes a kind of method for arranging items of directory of file system, this method can be removed the item that deltrees in the assigned catalogue district, and effective directory entry is left concentratedly.
The technical solution used in the present invention is:
A kind of method for arranging items of directory of file system is characterized in that, comprising:
(a) determine target directory and enter this target directory district and begin to check directory entry;
(b) judge in the target directory district that each directory entry is effective directory entry item that still deltreed, when deltreeing of finding enough filled one bunch, carry out (c);
(c) deltreeing of will finding moved in Xiang Xiangyi bunch; Move after finishing will this bunch in the first byte of all directory entries put 0, then this bunch deleted from bunch chain in target directory district; Carry out (d);
(d) do not check out then as directory entry in the target directory district and return (b), otherwise finish arrangement.
Further, in the step (b), the number that deltrees that finds with counter records when the product of this number and directory entry space size during more than or equal to one bunch space size, thinks that the item that deltrees that finds enough fills one bunch.
Further, step (b) further is refined as:
(b1) judge whether the directory entry of being checked is the item that deltrees, and execution (b2);
(b2) judge whether the directory entry of being checked is last directory entry of working as in the prevariety, if then carry out (b3); Otherwise check the next directory entry in prevariety and carry out (b1);
(b3) judge whether the item that deltrees that finds enough fills one bunch, enough then execution (c) is then carried out (d) inadequately.
Further, in the step (c), with deltreeing to moving in prevariety of finding, implementation method is: will work as in bunch chain in prevariety and target directory district before it bunch in effective directory entry move on successively, change over the item that deltrees that finds; When prevariety and before bunch in effective directory entry move on all after, move and finish.
Further, in the step (c), described bunch is deleted from bunch chain in target directory district, its implementation is: in file allocation table, replace previous bunch chain list index with described bunch chain list index, and the chain list index that will work as prevariety puts 0; Described previous bunch is bunch before described bunch in bunch chain in target directory district.
Further, in the step (d), judge when prevariety whether be last bunch in target directory district, if then in the target directory district directory entry inspected intact, finish arrangement; Otherwise directory entry does not check out in the target directory district, and the next one of target approach directory area bunch is also checked first directory entry, and returns (b1).
Further, each directory entry has corresponding logical number by its ordering in whole target directory district in the target directory district; When the directory entry of being checked when deltreeing, the position that deltrees of using that the array record finds; Described recording method is with the numbering of array element assignment successively for each item that deltrees that finds; Move on successively at effective directory entry, when changing over, the value of respective element in the array changed to by the numbering that deltrees move preceding numbering on the effective directory entry that moves in the institute with the item that deltrees that finds.
Further, the method for determining target directory comprises: by user's input directory name or be preset in the system.
After adopting technical scheme of the present invention, the assigned catalogue district carries out the arrangement of directory entry as required, by removing the item that deltrees in this directory area, effective directory entry can be deposited continuously, need directory entry number relatively thereby reduce, improve the operating efficiency of FAT file system in the embedded system, finally promote the performance of embedded system; A shared storage space that deltrees can also be discharged simultaneously, improve usage factor of system resource.
Description of drawings
Fig. 1 is the structural representation in target directory district in the application example of the present invention.
Fig. 2 is the concrete process flow diagram of implementing of file system directories item method for sorting of the present invention;
Embodiment
Below in conjunction with drawings and Examples technical scheme of the present invention is described in detail.
For convenience of the explanation of back, simply introduce the structure of directory area below again, as shown in Figure 1.Directory area takies one or above bunch, and the physical address of these bunches is not necessarily continuous, and contact between bunch and sequencing are according to bunch chain decision of directory area in the FAT table, account for 3 bunches altogether such as this directory area: 1,2 and 3; 1 the next one bunch is 2 in a small bundle of straw, etc. for silkworms to spin cocoons on chain, i.e. 1 chained list pointed 2; 2 the next one bunch is 3, i.e. 2 chained list pointed 3.
Be recorded in the BIOS parameter block for first bunch number of root directory.And first bunch number of sub-directory is recorded among the FDT of last layer catalogue of this sub-directory.Known and just equaled to know the entry address of catalogue first bunch number.
Deposited a plurality of directory entries in each bunch, the size in bunch space is the integral multiple of directory entry space size, for for system, bunch and the catalogue item size all be fixed value, therefore in system, what directory entries each bunch can adorn is also fixed.Except last bunch, other bunch all filled directory entry in the directory area; Leaving on the physical address of each directory entry is continuous in bunch, for the directory entry in same bunch, the back of adding up, the direct physical address, address of the directory entry of front just can be obtained the address of the directory entry of back.If the space size of directory entry is 32 bytes, then bunch first directory entry in is exactly first 32 byte of the pairing data field of this bunch.Because the integral multiple that size that the directory area took up space may not be bunch, therefore often leave some untapped directory entries in last bunch, its first byte is 0, and when running into such directory entry, the file system program can think that this is last directory entry in the directory area.
The invention provides a kind of method for sorting of file system directories item, be applied to embedded system, the FAT file system here comprises FAT12, FAT16 and FAT32 file system; Because the space size of directory entry is generally 32 bytes in the practical application, so the situation that all accounts for 32 bytes by a directory entry illustrates technical scheme of the present invention herein; If the space size of directory entry is not the situation of 32 bytes, the space size that 32 bytes in then will explaining change to directory entry gets final product.
Said method comprising the steps of, as shown in Figure 2:
A0: determine target directory---promptly need catalogue that directory entry is wherein put in order;
The mode of determining can be set as required, such as imported the title of wanting the catalogue of putting in order when needed by the user; The catalogue here refers to the catalogue in the memory file system, can be root directory, also can be each straton catalogue; For another example, can also be preset in the timed task of system, allow system after arriving the schedule time, predetermined catalogue is put in order.
Enter first bunch in the target directory district after determining, a counter is set simultaneously and its initial value is made as 0.
A1: begin to check first directory entry in first bunch in the target directory district;
B1: when the first byte of the directory entry of being checked is E5, represent that this directory entry is the item that deltrees, the value of counter is added 1, carry out b2.Otherwise this directory entry is effective directory entry---promptly use also not deleted directory entry, also carried out b2.
In this step, can write down the item that deltrees that each finds.For making things convenient for the explanation of back, suppose that here bunch can be adorned a N directory entry.
Directory entry has corresponding logical number by its ordering in whole target directory district in bunch, the logical number here is actually a kind of virtual numbering, only sets for convenience of record, is numbered 0 such as directory entry in first bunch, 1, ..., N-1, directory entry is numbered N in second bunch, N+2, ..., 2N-1, by that analogy.Define an array variable that 2N-1 element arranged then and write down the position of being found that deltrees, whenever find the item that deltreed, just be the described numbering that has deltreed successively with the assignment of an element of this array, thus the position that deltrees that record is found.
B2: judge that whether the directory entry checked is last directory entry in prevariety,, can adorn N bunch in one bunch, then last directory entry that is exactly this bunch of N directory entry in each bunch according to the calculating among the a0; As what check is when in the prevariety during N directory entry, execution b3; If not then checking next directory entry and returning b1
B3: judge whether the item that deltrees that finds can fill one bunch; When the numerical value of counter during more than or equal to N, or when the space of directory entry size---when promptly the product of the value of 32 bytes and counter is more than or equal to one bunch space size, the item that deltrees that expression is found has enough been filled one bunch, carry out c, value with counter here or in step c deducts N, and the value of described counter is promptly represented the number that deltrees that finds; Otherwise carry out d.
C: that at first will find deltrees to moving in prevariety, and implementation method is work as prevariety in the target directory district---i.e. last that find at present bunch---and bunch chain in target directory district in whole effective directory entries in each bunch before it move on successively.Described " successively " be meant move be by effective directory entry bunch in put in order and carry out one by one because more than one of the directory entry of the long filenames that has, but connect together two or several, so effectively the order between the directory entry can not change.
On the practical operation that moves be: replace with an effective directory entry at every turn and cover first item that deltreed of its front in other words---seek the scope of " front first deltreed " here, be first directory entry from first bunch of target directory district to this effective directory entry, what that is to say that effective directory entry covers also may be the item that deltrees in other bunch.If do not adopt the array record, then need to judge that while moving which directory entry is deleted; If adopted the array record, then when mobile, can directly use the information in the array that directory entry is moved.
After the covering, as do not adopt the first byte that array record then will former effective directory entry to change E5 into, as adopted the array record, then with the value of respective element in the array by the numbering that deltrees that is capped change on move preceding numbering on effective directory entry of moving.On effect, can regard the process that each effective directory entry moves as the effective directory entry and the item that deltrees change over; Then the more effective directory entry of the next one is carried out same operation; During if do not deltreed before the effective directory entry then go to the effective directory entry operation of the next one, up to will work as prevariety and before the effective directory entry in each bunch moved on all.On effect, on the process of moving just be equivalent to deltreeing in prevariety, moving.
Move finish after, depositing in prevariety just all is to have deltreed, at this moment the item that deltrees that can not load leaves last when previous bunch of prevariety in.When prevariety is that last cluster in the target directory district and its have been deposited when not using directory entry, situation have not with because do not use directory entry to move on not, therefore move when finishing, what deposit in this bunch is to have deltreed and do not use directory entry.Certainly, also can allow in actual applications and do not use directory entry to move on together.
At this moment, all directory entries in prevariety are carried out 0 operation clearly, the first byte that is about to them puts 0; Clear 0 result thoroughly removes these directory entries in the data field, discharged the shared storage space of these directory entries in other words conj.or perhaps, and its original storage space can be utilized again.
Upgrade the chain list index of target directory district in the FAT table then, to work as bunch number from bunch chain in target directory district, deleting of prevariety, step is with covering previous bunch of corresponding interval content when prevariety corresponding interval content in the FAT table, and the corresponding interval that will work as prevariety puts 0, in other words conj.or perhaps with replacing previous bunch chain list index when the chain list index of prevariety, and the chain list index that will work as prevariety puts 0.Previous bunch is at one bunch before prevariety in bunch chain in target directory district.Bunch chain such as original target directory is: 1 the next one bunch is 2,2 the next one bunch is 3, filled the item that deltreed this moment 2, change the chain list index of target directory district in the FAT table so, with bunches numbers 3 intervals of putting 1 correspondence into of originally being deposited in the 2 corresponding intervals, be about to 1 and change into and point to 3 by pointing to 2, its essence is exactly with 2 shieldings.
If do not shield, when the file system program ran into directory entry in this bunch, can take for the back did not have other directory entry, thereby makes the mistake operation; Working as prevariety after the shielding becomes an available cluster again, that is to say that file system can be new data storage in this bunch.And, just can not find this bunch again, thereby just need not the item that deltrees in this bunch have been compared yet again after this when in target directory, creating or locating file need compare directory entry the time.
Carry out d.
D: if when prevariety be in the target directory district last, deposit in the pairing interval of this bunch so be not next bunch bunch number, but FF finishes the arrangement task at this moment; Then enter next bunch if not FF and begin to check first directory entry, return b1.
After finishing the arrangement task, perhaps also have some items that deltreed in the target directory, these directory entries are owing to can not or filling one bunch inadequately, so it is deleted to fail; If counter is arranged, the value of this hour counter is not 0.But these remaining items that deltreed are very little to the influence of system, can ignore substantially.
Above-mentioned is optimum embodiment of the present invention, under the situation that does not deviate from spirit of the present invention and essence thereof, those of ordinary skill in the art can make various corresponding distortion according to the present invention, but these corresponding distortion all should belong in the scope that claims of the present invention and equivalent thereof protect, and have deltreed and just go to judge whether deltreeing of finding enough fills one bunch such as can whenever being checked through one; Can whenever be checked through the item that deltreed for another example just moves all unchecked directory entries of its back on successively; When moving for another example can except when prevariety and before bunch in effective directory entry, also when prevariety after bunch in all directory entries move on all, moved last bunch that afterwards shields in the target directory district.
Further be illustrated with an application example of the present invention below.
This example adopts determines target directory by the mode of user's input directory name.In this example, the software systems of realization technical solution of the present invention comprise following component software:
Assembly 1, user interface application, for the user provides application interface, user's input directory name is come a target directory district in the specified file system;
Assembly 2, the catalogue cleaning assembly, receive the directory name of user's input, directory entry in the target directory district is checked, if find to have deltreed and run up to the size that directory entry number sum equals bunch, will put in order this part associative directory item, delete these items that deltreed, put other useful directory entries in order;
Assembly 3, the FAT file system component provides the fundamental operating software interface to the FAT file system, as the directory access interface, file access interface etc.; And
Assembly 4, storer controlling and driving program is used for control store, provides storer is resetted, reads the sector, writes the software interface of operation such as sector.
Wherein, assembly 1 is the interface in the face of user's application; Assembly 2 is assembly 1 service, and specific procedure is provided; And assembly 3 provides interface to the FAT file system operation for assembly 2; Assembly 4 is functional modules of the bottom, and it provides the interface of operating physical layer for assembly 3.When clearing up directory entry, above-mentioned 4 assemblies are done as a whole, have realized this operation jointly in different aspects.
Should be with in the example, the directory area structure that needs cleaning as shown in Figure 2, wherein bunch 1 is first bunch of this directory area, bunches 2 is the second bunches of this directory area, by that analogy, bunch m is last bunch of directory area; Some directory entries are arranged in each bunch, and bunch 1 being example, directory entry 1 is first bunch in bunch 1, and by that analogy, directory entry n is last bunch in bunch 1, promptly can deposit n directory entry for one bunch; Suppose that directory entry 1, directory entry 2, directory entry 3, directory entry 6 are effective directory entry, directory entry 4 and directory entry 5 are the item that deltrees.
The step of cleaning directory entry is as follows in above-mentioned directory area:
At first, user's input directory name, definite target directory district that will clear up, this part work is finished by assembly 1.
Assembly 2 receives this directory name, and finds from the BIOS piece first bunch number of root directory, enters root directory; If target directory is not root directory then searches the directory entry of target directory in the FDT of root directory, obtains first bunch number of target directory district.The position that deltrees of adopting in should be that the array record finds with example, the logical number of each directory entry is: in bunch 1 directory entry 1 be numbered 0, by that analogy, directory entry n is numbered n-1; In bunches 2 first directory entry be numbered n, by that analogy, last bunch is numbered m * n-1 among bunch m; Define an array that 2n-1 element arranged then and be used for record.
In the target approach directory area first bunch, promptly bunch 1, begin to check first directory entry, promptly directory entry 1, a numerical value is set simultaneously is 0 counter; Judging promptly behind directory entry of every inspection that whether it is last directory entry in bunch 1, is not then to check next directory entry.Directory entry 1 is effective directory entry; Then check directory entry 2; By that analogy.When being checked through directory entry 4, find that the first byte of this directory entry is E5, this means that directory entry 4 is the item that deltrees; With the value of counter add 1 and in array the position of record directory entry 4, the numbering 3 that recording method is is directory entry 4 with first element assignment in the array.
Check directory entry 5 then; Directory entry 5 also is the item that deltreed, and the value of counter is added 1 and the position of writing down directory entry 5 again, is about to second numbering 4 that the element assignment is a directory entry 5 in the array; Then check directory entry 6; By that analogy, up to checking out last directory entry, i.e. directory entry n in bunch 1.
At this moment, judge whether the item that deltrees that finds enough fills one bunch; If the product with 32 bytes on duty in the counter is less than one bunch space size, then explanation is filled one bunch inadequately, so just to bunch 1 whether last bunch in target directory district judge, be not then to enter bunches 2 to check first directory entries, and repeat above-mentioned steps.Whenever check out the directory entry in bunch, whether just judging has once deltreed enough fills one bunch, not enough below just continuing to check bunch.After supposing to check out bunch x, found n+y the item that deltreed altogether, promptly the value of counter is n+y, has enough filled one bunch, the step below at this moment carrying out.
Effective directory entry in bunch 1 to bunch x is moved on successively, and according to the record of array, first finds deltrees and is directory entry 4, and then directory entry 1, directory entry 2 and directory entry 3 need not move; With the effective directory entry of the next one, it is the content overlay directory item 4 of directory entry 6, change the value of first element in the array numbering 5 of directory entry 6 into by the numbering 3 of directory entry 4 then, " deltreed " that original directory entry 6 is become prepare in the future to be capped; By that analogy, up to the effective directory entry among bunch x has been moved on all.At this moment, just all be to have deltreed item among bunch x, and also have y the item that deltreed in bunch x-1.
At this moment, bunch x is carried out 0 operation clearly, soon wherein the first byte of all directory entries puts 0; Change the chain list index in the FAT table in the target directory district then, bunch x is deleted from bunch chain in target directory district, promptly in a small bundle of straw, etc. for silkworms to spin cocoons on chain, allow bunch x-1 point to bunch x+1 here, and the chain list index of bunch x is put 0.Also the value of counter to be deducted n, promptly become y.
Since in the FAT table in the interval of bunch x be next bunch bunch number, therefore rather than FF continues to check directory entry in next bunch according to the step of front.If FF, then expression has been checked through last bunch, is a bunch m in should be with example, and at this moment clean-up task is finished.At this moment, can set the prompting of feedback one " finishing ".
The interface that assembly 2 utilizes assembly 3 to provide---such as directory access interface etc.---is finished above operation; The operation of 3 pairs of storeies of assembly etc. is then finished by the interface that assembly 4 provides.
Claims (8)
1, a kind of method for arranging items of directory of file system is characterized in that, comprising:
(a) determine target directory and enter this target directory district and begin to check directory entry;
(b) judge in the target directory district that each directory entry is effective directory entry item that still deltreed, when deltreeing of finding enough filled one bunch, carry out (c);
(c) deltreeing of will finding moved in Xiang Xiangyi bunch; Move after finishing will this bunch in the first byte of all directory entries put 0, then this bunch deleted from bunch chain in target directory district; Carry out (d);
(d) do not check out then as directory entry in the target directory district and return (b), otherwise finish arrangement.
2, the method for claim 1, it is characterized in that: in the step (b), the number that deltrees that finds with counter records, when the product of this number and directory entry space size during, think that deltreeing of finding enough fill one bunch more than or equal to one bunch space size.
3, the method for claim 1 is characterized in that, step (b) further is refined as:
(b1) judge whether the directory entry of being checked is the item that deltrees, and execution (b2);
(b2) judge whether the directory entry of being checked is last directory entry of working as in the prevariety, if then carry out (b3); Otherwise check the next directory entry in prevariety and carry out (b1);
(b3) judge whether the item that deltrees that finds enough fills one bunch, enough then execution (c) is then carried out (d) inadequately.
4, method as claimed in claim 3, it is characterized in that, in the step (c), the item that deltrees that finds is moved to working as in the prevariety, implementation method is: will work as in bunch chain in prevariety and target directory district before it bunch in effective directory entry move on successively, change over deltreeing of finding; When prevariety and before bunch in effective directory entry move on all after, move and finish.
5, the method for claim 1 is characterized in that, in the step (c), described bunch is deleted from bunch chain in target directory district, its implementation is: in file allocation table, replace previous bunch chain list index with described bunch chain list index, and the chain list index that will work as prevariety puts 0; Described previous bunch is bunch before described bunch in bunch chain in target directory district.
6, method as claimed in claim 3 is characterized in that, in the step (d), judge when prevariety whether be last bunch in target directory district, if then in the target directory district directory entry inspected intact, finish arrangement; Otherwise directory entry does not check out in the target directory district, and the next one of target approach directory area bunch is also checked first directory entry, and returns (b1).
7, method as claimed in claim 4 is characterized in that, each directory entry has corresponding logical number by its ordering in whole target directory district in the target directory district; When the directory entry of being checked when deltreeing, the position that deltrees of using that the array record finds; Described recording method is with the numbering of array element assignment successively for each item that deltrees that finds; Move on successively at effective directory entry, when changing over, the value of respective element in the array changed to by the numbering that deltrees move preceding numbering on the effective directory entry that moves in the institute with the item that deltrees that finds.
8, the method for claim 1 is characterized in that, determines that the method for target directory comprises: by user's input directory name or be preset in the system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101441952A CN100405373C (en) | 2006-11-29 | 2006-11-29 | Method for arranging items of directory in file system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101441952A CN100405373C (en) | 2006-11-29 | 2006-11-29 | Method for arranging items of directory in file system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1959677A true CN1959677A (en) | 2007-05-09 |
| CN100405373C CN100405373C (en) | 2008-07-23 |
Family
ID=38071375
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006101441952A Expired - Fee Related CN100405373C (en) | 2006-11-29 | 2006-11-29 | Method for arranging items of directory in file system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100405373C (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729671A (en) * | 2009-12-31 | 2010-06-09 | 宇龙计算机通信科技(深圳)有限公司 | Method for managing backup file, terminal thereof and system thereof |
| CN102024060A (en) * | 2010-12-31 | 2011-04-20 | 山西奥克斯电子系统工程中心 | Method for memorizing files and restoring error deleted files |
| CN102426586A (en) * | 2011-10-25 | 2012-04-25 | 厦门雅迅网络股份有限公司 | FAT (file allocation table) file storage method in embedded system |
| CN102968597A (en) * | 2012-11-05 | 2013-03-13 | 中国电力科学研究院 | Disk data connection chain-based file crushing method |
| CN117453632A (en) * | 2023-12-25 | 2024-01-26 | 杭州计算机外部设备研究所(中国电子科技集团公司第五十二研究所) | Data storage method and device |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6917949B1 (en) * | 2000-08-30 | 2005-07-12 | International Business Machines Corporation | Temporary lobs directory management |
| US20050010610A1 (en) * | 2003-07-08 | 2005-01-13 | Konica Minolta Business Technologies, Inc. | File management system, file management apparatus and image forming apparatus |
| US7730114B2 (en) * | 2004-11-12 | 2010-06-01 | Microsoft Corporation | Computer file system |
| JP2006309536A (en) * | 2005-04-28 | 2006-11-09 | Seiko Epson Corp | Program and device for managing file |
| CN1766845A (en) * | 2005-11-30 | 2006-05-03 | 吴晓栋 | Method for realizing high security and recoverable file system |
-
2006
- 2006-11-29 CN CNB2006101441952A patent/CN100405373C/en not_active Expired - Fee Related
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729671A (en) * | 2009-12-31 | 2010-06-09 | 宇龙计算机通信科技(深圳)有限公司 | Method for managing backup file, terminal thereof and system thereof |
| CN102024060A (en) * | 2010-12-31 | 2011-04-20 | 山西奥克斯电子系统工程中心 | Method for memorizing files and restoring error deleted files |
| CN102024060B (en) * | 2010-12-31 | 2012-10-24 | 山西奥克斯电子系统工程中心 | Method for memorizing files and restoring error deleted files |
| CN102426586A (en) * | 2011-10-25 | 2012-04-25 | 厦门雅迅网络股份有限公司 | FAT (file allocation table) file storage method in embedded system |
| CN102426586B (en) * | 2011-10-25 | 2017-02-08 | 厦门雅迅网络股份有限公司 | FAT (file allocation table) file storage method in embedded system |
| CN102968597A (en) * | 2012-11-05 | 2013-03-13 | 中国电力科学研究院 | Disk data connection chain-based file crushing method |
| CN102968597B (en) * | 2012-11-05 | 2015-06-24 | 中国电力科学研究院 | Disk data connection chain-based file crushing method |
| CN117453632A (en) * | 2023-12-25 | 2024-01-26 | 杭州计算机外部设备研究所(中国电子科技集团公司第五十二研究所) | Data storage method and device |
| CN117453632B (en) * | 2023-12-25 | 2024-04-12 | 杭州计算机外部设备研究所(中国电子科技集团公司第五十二研究所) | Data storage method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100405373C (en) | 2008-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109196459B (en) | Decentralized distributed heterogeneous storage system data distribution method | |
| CN101042696A (en) | Smart card storage system and managing method for file creation in the system | |
| CN109558084B (en) | Data processing method and related equipment | |
| US20150081964A1 (en) | Management apparatus and management method of computing system | |
| US20160188227A1 (en) | Method and apparatus for writing data into solid state disk | |
| CN103186350A (en) | Hybrid storage system and hot spot data block migration method | |
| CN1331817A (en) | Method and appts. for concurrent DBMS table operations | |
| CN1816795A (en) | Multi-volume file support | |
| CN1959677A (en) | Method for arranging items of directory in file system | |
| CN103246549B (en) | A kind of method and system of data conversion storage | |
| CN1955958A (en) | Sort data storage and split catalog inquiry method based on catalog tree | |
| CN1794208A (en) | Mass storage device and method for dynamically managing a mass storage device | |
| CN111813805A (en) | Data processing method and device | |
| CN106502587A (en) | Data in magnetic disk management method and magnetic disk control unit | |
| CN106294352A (en) | A kind of document handling method, device and file system | |
| CN1719422A (en) | Virtual access method of storage document data | |
| CN100338607C (en) | Method for organizing and accessing distributive catalogue of document system | |
| CN1896960A (en) | Fast photographic system and method | |
| CN1254735C (en) | Method and system for reducing fragmentation | |
| CN116662019B (en) | Request distribution method and device, storage medium and electronic device | |
| CN1221888C (en) | Information processing device and program | |
| WO2015140931A1 (en) | Hierarchical storage system provided with trial area, storage controller, and program | |
| CN104424204A (en) | Index mechanism combining method and searching method, unit and device | |
| CN106250188A (en) | A kind of generation method and system of system firmware image file | |
| CN1975935A (en) | External storing performance testing method and apparatus |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080723 Termination date: 20121129 |