US20060173923A1 - Method and program for file information write processing - Google Patents

Method and program for file information write processing Download PDF

Info

Publication number
US20060173923A1
US20060173923A1 US11/235,336 US23533605A US2006173923A1 US 20060173923 A1 US20060173923 A1 US 20060173923A1 US 23533605 A US23533605 A US 23533605A US 2006173923 A1 US2006173923 A1 US 2006173923A1
Authority
US
United States
Prior art keywords
file
write
clusters
movement
instruction
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.)
Abandoned
Application number
US11/235,336
Other languages
English (en)
Inventor
Naoki Abe
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Assigned to FUJITSU LIMITED reassignment FUJITSU LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ABE, NAOKI
Publication of US20060173923A1 publication Critical patent/US20060173923A1/en
Priority to US12/212,439 priority Critical patent/US8468290B2/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • A—HUMAN NECESSITIES
    • A47—FURNITURE; DOMESTIC ARTICLES OR APPLIANCES; COFFEE MILLS; SPICE MILLS; SUCTION CLEANERS IN GENERAL
    • A47K—SANITARY EQUIPMENT NOT OTHERWISE PROVIDED FOR; TOILET ACCESSORIES
    • A47K5/00—Holders or dispensers for soap, toothpaste, or the like
    • A47K5/02—Soap boxes or receptables
    • A47K5/03—Soap boxes or receptables separate from wall or wash-stand
    • 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/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0674—Disk device
    • G06F3/0676—Magnetic disk device
    • 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/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]

Definitions

  • the present invention relates to a processing method for writing file information and program thereof.
  • File access within a computer system is realized through a combination of three programs: application; file system (middleware); and device driver.
  • application refers to various application programs such as word processors and CAD software.
  • Device driver refers to a control program which performs read/write on each area within a (nonvolatile) secondary memory, such as magnetic disks and flash memory, wherein stored contents are retained even when power is tuned off.
  • File system (middleware) which is provided between application and device driver, performs a process for outputting instructions corresponding to the write instructions from the application to the device driver.
  • FIG. 1 is a diagram showing the data configuration of the file system.
  • the file system comprises three areas: a boot sector; file allocation table (FAT); and an actual data area.
  • FAT file allocation table
  • pointer information which indicates which cluster a cluster is connected to is stored in each entry of the FAT corresponding to individual clusters within the actual data area. If the cluster has no connection destination, “End” is set in this pointer information. If the cluster is freed, “NULL” is set in this pointer information (shown as blank in the diagram). In other words, data retained within the clusters corresponding to entries within FAT wherein a pointer value other than “NULL” is set is data which has meaning.
  • actual data area that is used is separated into (processing) units called clusters, and actual information regarding files and directories are stored therein.
  • FIG. 1 for simplicity, actual data area is divided into 16 clusters, and these clusters have head addresses of hexadecimal numerals 0 to 15, in sequence, with the progression from the upper-right to the lower-left; in other words, “0x0”, “0x1”, “0x2”, “0x3”, “0x4”, “0x5”, “0x6”, “0x7”, “0x8”, “0x9”, “0xA”, “0xB”, “0xC”, “0xD”, “0xE”, and “0xF”.
  • FIG. 2 is a diagram showing the state of the file before overwrite instruction is made.
  • File system specifies the (one or plural) cluster(s) within the secondary memory (actual data area) which is the target of write, implementing information regarding the starting location and the length of the overwrite comprised in the file overwrite instruction from the application.
  • clusters corresponding to Data 2 , Data 3 , and Data 4 are considered clusters which have been specified as such.
  • FIG. 6 is a flowchart of a conventional overwrite process.
  • data overwrite (write) process is performed on one or plural cluster(s) within the actual data area specified as overwrite target in Step S 101 .
  • file information for example last update time information, is changed (updated).
  • the data of the cluster which is being written in other words the cluster corresponding to Data 2 , Data 3 , or Data 4
  • the period from the start of overwrite of the cluster corresponding to Data 2 in FIG. 3 until before the completion of overwrite of the cluster corresponding to Data 4 in FIG. 5 is a period wherein incomplete data will be left within the secondary memory if a power supply interruption or the like occurs. In other words, it is a period wherein there is risk of data damage.
  • FIG. 7 is a diagram showing data configuration before the file is moved. Parts within the explanation of FIG. 7 which overlap with that of FIG. 1 are basically omitted.
  • the “0x0” cluster is referenced as the cluster within the actual data area which corresponds to the directory entry in directory dir, and from the contents of this directory dir, directories dir 1 and dir 2 exist below this directory dir, the directory entry of directory dir 1 is stored in the “0x3” cluster, and the directory entry of directory dir 2 is stored in the “0x4” cluster.
  • file file 1 has a configuration wherein the clusters of Data 1 , Data 2 , and Data 3 are connected in the sequential order of Data 1 , Data 2 , and Data 3 .
  • file file 2 has a configuration wherein the clusters of Data 4 , Data 5 , and Data 6 are connected in the sequential order of Data 4 , Data 5 , and Data 6 .
  • the actual data area and the FAT shown in the lower half of FIG. 7 indicate a file (directory) configuration such as that shown in the upper half of FIG. 7 .
  • FIG. 8 shows the process performed by the file system for the move instruction from the application.
  • the file system receives the information above, stating “move ⁇ dir ⁇ dir 1 ⁇ file 1 to ⁇ dir ⁇ dir 2 ⁇ file 2 ”, from the application, and after the directory entry in file file 1 of the source of the movement of the actual data area within the secondary memory is loaded to a primary memory based on this information, this directory entry in file file 1 of the source of the movement is deleted from the actual data area within the secondary memory.
  • file 2 which is a file that already exists in the destination of the movement, is deleted.
  • this directory entry in file file 2 of the destination of the movement is deleted from the actual data area within the secondary memory, and at the same time, point information of entries corresponding to Data 4 , Data 5 , and Data 6 , as actual data which configures file file 2 is cleared from the FAT (the chain subsequent to the entry corresponding to Data 4 is cleared).
  • file file 2 is created (the file 2 information is written) in the directory entry of the directory dir 2 within the actual data area so as to point the head actual data Data 1 of the file file 1 of the source of the movement.
  • FIG. 11 is a flowchart of a conventional file move process.
  • step S 201 first, after the directory entry in the file of the source of the movement of the actual data area within the secondary memory is loaded into the primary memory, the directory entry in the file of the source of the movement is deleted from the actual data area within the secondary memory in step S 201 . Then, in step S 202 , whether or not the file is overwritten at the destination of the movement is determined. If it is determined that overwrite is performed in step S 202 , the file already existing in the destination of the movement is deleted in step S 203 , and the process advances to step S 204 . On the other hand, if it determined that overwrite is not performed in step S 202 , the process immediately advances to step S 204 .
  • step S 204 file information of the destination of the movement is written to the directory entry in the directory of the destination of the movement so as to point the head actual data of the file of the source of the movement.
  • the file is the target to be moved in each of the steps explained above, directories can also be the targets of the movement.
  • step S 205 which determines whether or not the target to be moved is a directory, and, when the target to be moved is a directory, step S 206 which changes (updates) information regarding parent directory “ . . ” of the directory to be moved.
  • the period from after the file file 1 information of the source of the movement is deleted from the directory entry of file file 1 of this source of the movement of the actual data area within the secondary memory in FIG. 8 until this file file 1 information of the source of the movement is read from the primary memory in FIG. 10 is a period wherein information regarding location of the cluster which stores the head actual data of the file of the source of the movement vanishes when a write failure such as power supply interruption occurs, or in other words, this is a period wherein there is risk of data damage.
  • the objective of the present invention is to provide a write processing method and program which enables shortening of the period wherein there is risk of data damage when power supply interruption and the like occur.
  • the file information write processing method of the first aspect of the present invention is a file information write processing method wherein a computer executes a process for outputting instruction corresponding to a file information write instruction from an application to a device driver, wherein: searching clusters which are empty areas within an actual data area of a memory unit of the computer, and obtaining the search result; if clusters which are empty areas exist, writing information to be overwritten to one or more clusters within the actual data area of the memory unit which is a target of the write instruction from the application, to the clusters which are empty areas; and freeing clusters which were to be overwritten by the information written to the empty area clusters.
  • Data to be overwritten refers to update information, or in other words, “Data New”(shown in FIGS. 15 to 18 as Data 2 New, Data 3 New, and Data 4 New).
  • the file information write processing method of a second aspect of the present invention is a file information write processing method wherein a computer executes a process for outputting instruction corresponding to a file information write instruction from an application to a device driver, wherein: searching entries of the directory in a destination of a movement to determine whether or not the write instruction is a file move which is accompanied by overwrite, changing or generating a directory entry of a file in the destination of the movement so as to link to actual data of a file in the source of the movement in a state wherein the link between the directory entry of a file in the source of the movement and actual data of the file in the source of the movement is kept, according to whether or not said write instruction is a file move which is accompanied by overwrite; deleting the directory entry of the file in the source of the movement.
  • the change or the generation of the directory entry of the file of the destination of the movement is made so as to link to the actual data in the file of the source of the movement in a state wherein the link between the directory entry of the file of the source of the movement and the actual data of the file of the source of the movement is kept, the period wherein the information of the file of the source of the movement only exists in the primary memory, as in the conventional example, is eliminated, and the period wherein risk of data damage exists, when power supply interruption and the like occurs, can be shortened.
  • data which should be overwritten to the cluster specified as write target is written to the cluster of the empty area within the actual data area which has been searched and obtained
  • data which should be overwritten can be written to the empty area cluster all at once, when as many of these clusters which are empty areas as there are clusters which correspond to the data comprised in the write instruction from the application are secured.
  • this by comparing this to the conventional example wherein data is directly overwritten to this write target cluster, it is possible to eliminate the risk of storing incomplete data within the actual data area due to the power supply interruption during data overwrite, so when a power supply interruption and the like occur, the period wherein there is risk of data damage is shortened.
  • the change or the generation of the directory entry of the file of the destination of the movement is made so as to link to the actual data in the file of the source of the movement in a state wherein the link between the directory entry of the file of the source of the movement and the actual data of the file of the source of the movement is kept, the period wherein the information of the file of the source of the movement only exists in the primary memory, as in the conventional example, is eliminated, and the period wherein risk of data damage exists, when power supply interruption and the like occurs, can be shortened.
  • FIG. 1 is a diagram which shows the data configuration of a file system.
  • FIG. 2 is a diagram showing the file state before receiving an overwrite instruction.
  • FIG. 3 is a diagram (No. 1) explaining the operation of a conventional file system after receiving an overwrite instruction.
  • FIG. 4 is a diagram (No. 2) explaining the operation of a conventional file system after receiving an overwrite instruction.
  • FIG. 5 is a diagram (No. 3) explaining the operation of a conventional file system after receiving an overwrite instruction.
  • FIG. 6 is a flowchart showing the processing of a conventional file system after receiving an overwrite instruction.
  • FIG. 7 is a diagram showing the file state before receiving a move instruction.
  • FIG. 8 is a diagram (No. 1) explaining the operation of a conventional file system after receiving a move instruction.
  • FIG. 9 is a diagram (No. 2) explaining the operation of a conventional file system after receiving a move instruction.
  • FIG. 10 is a diagram (No. 3) explaining the operation of a conventional file system after receiving a move instruction.
  • FIG. 11 is a flowchart showing the processing of a conventional file system after receiving a move instruction.
  • FIG. 12 is a diagram explaining call relation between the processing of the entire system comprising a file system.
  • FIG. 13 is a diagram showing the call relation between the processing booted at the file system-end when the instruction from an application is to overwrite a file.
  • FIG. 14 is a block diagram showing the configuration of a write processing unit in a first embodiment of the present invention.
  • FIG. 15 is a diagram (No. 1) explaining the operations of the write processing unit in the first embodiment.
  • FIG. 16 is a diagram (No. 2) explaining the operations of the write processing unit in the first embodiment.
  • FIG. 17 is a diagram (No. 3) explaining the operations of the write processing unit in the first embodiment.
  • FIG. 18 is a diagram (No. 4) explaining the operations of the write processing unit in the first embodiment.
  • FIG. 19 is a flowchart of an overwrite process in the first embodiment.
  • FIG. 20 is a diagram showing the call relation between the processing booted at the file system-end when the instruction from an application is to move a file.
  • FIG. 21 is a block diagram showing the configuration of the write processing unit in a second embodiment of the present invention.
  • FIG. 22 is a diagram (No. 1) explaining the operations of the write processing unit in the second embodiment.
  • FIG. 23 is a diagram (No. 2) explaining the operations of the write processing unit in the second embodiment.
  • FIG. 24 is a diagram (No. 3) explaining the operations of the write processing unit in the second embodiment.
  • FIG. 25 is a flowchart of a move process in the second embodiment.
  • FIG. 26 is a diagram showing the hardware environment when actualizing each embodiment of the present invention by program.
  • FIG. 27 is a diagram explaining the loading of the program.
  • FIG. 12 is a diagram explaining call relation between the processing of the entire system comprising a file system.
  • process corresponding to each instruction from the application “file creation”, “file move”, “file copy” and “file overwrite”, is booted by the file system (middleware) side.
  • the file to be created is added to a directory entry in response to “file create”.
  • the directory entries of the directory of the source of the movement and the directory of the destination of the movement are changed in response to “file move”.
  • the file to be copied is added to the directory entry of the copy destination directory, and at the same time, the actual data of this file to be copied is created in the actual data area in response to “file copy”.
  • data which should be written to the cluster within the actual data area which is the file overwrite target is written to the empty area cluster(s), and at the same time, FAT information is changed according to this write process.
  • FIG. 13 is a diagram showing the call relation between the processing booted at the file system-end when the instruction from an application is to overwrite a file. As is shown in FIG. 13 , when an overwrite instruction of a file (output by an application) is output from the application to the file system-end, the corresponding “file overwrite” process is called at this file system-end.
  • each of the following processes are called: a “empty area search” process which is performed by reading the FAT; and various processes for updating data in FAT and the actual data area, or in other words, “FAT read” and “actual data read” processes which read these FAT and actual data areas from a media (secondary memory) to a primary memory, and “FAT write” and “actual data write” processes which write data of the FAT and actual data area updated in the primary memory to a media (secondary memory).
  • FIG. 14 is a block diagram showing the configuration of a write processing unit in a first embodiment of the present invention.
  • the write processing unit is configured between the application and the device driver and performs processing for outputting instruction corresponding to the file information write instruction from the application to the device driver.
  • This file information write instruction from the application is retained within the primary memory as information to be overwritten which comprise the overwrite start position, length, and data having the length.
  • the write processing unit comprises: write target specification unit 11 for specifying (one or plural) cluster(s) which will be the target of the write instruction, based on file information write instruction from the application; empty area search unit 12 for searching clusters which are empty areas within the actual data area of the secondary memory and obtaining the search result; write process execution unit 13 for writing information to be overwritten to one or more clusters within this actual data area of the secondary memory which is the target of the write instruction from the application, to the empty area clusters, if the empty area clusters exist; freeing unit 15 for freeing clusters which were to be overwritten by the information written to the empty area clusters, out of the clusters which are the target of the write instruction; and a determination unit 14 for determining whether or not there are sections which have not been written to the empty area clusters, out of the data included in the write instruction (information to be overwritten).
  • Each unit in FIG. 14 corresponds, for example, to combinations of CPU 51 and RAM 53 in FIG. 26 .
  • write process execution unit 13 receives a file overwrite instruction from the application
  • write target specification unit 11 and empty area search part 12 are booted with the reception of this overwrite instruction acting as the trigger.
  • the (one or plural) cluster(s) within the secondary memory (actual data area) which is to be the target of the write instruction is specified using information of the starting position and length of the overwrite within the information to be overwritten which is included in this write instruction from the application.
  • empty area search part 12 reads (references) the FAT, and searches the empty area clusters (clusters which are not in use) within the actual data area and obtains the search result.
  • Write process execution unit 13 which received the search result information from empty area search unit 12 , for example, information indicating the location of the empty area cluster, determines whether or not the empty area cluster exists in the actual data area from this search result information. If the cluster exists, information which should be overwritten to the (one or plural) cluster(s) within the actual data area which is the specified target of the write instruction is written to the empty area cluster within the search results by write process execution unit 13 . Although there are cases wherein data sections which are not changed are comprised in the head cluster and tail cluster of the actual data area, in these cases, the unchanged data section and the data section to be newly overwritten are merged by the merge part (not illustrated), and data which should be written to these clusters is created.
  • the empty area search unit 12 is again activated by the write process execution unit 13 , and the search for clusters which are empty areas is executed.
  • write process execution unit 13 performs a write process on these empty areas greater than or equal the number of freed clusters. Then, in this same way, the freeing process of the clusters which the information written to the empty area cluster was to be overwritten is performed by freeing unit 15 .
  • the clusters which are to be overwrite targets within the actual data area are specified as clusters corresponding to Data 2 , Data 3 , and Data 4 by write target specification unit 11 , based on the information on the starting position and length of the overwrite included in the overwrite instruction from the application.
  • FAT is read by the empty area search unit 12 , and clusters which correspond to entries of this FAT, having the NULL pointer (shown as blank within the diagram) are determined to be empty area clusters.
  • new data Data 1 New, Data 2 New, and Data 3 New
  • Data 4 are written to clusters within the actual data area by the write process execution unit 13 in the sequential order, for example, from the empty area cluster having the smallest address.
  • the “Data 2 ”, “Data 3 ”, and “Data 4 ” clusters of the actual data area are freed by the freeing unit 15 , by setting the pointer of the FAT entries corresponding to “Data 2 ”, “Data 3 ”, and “Data 4 ” clusters to NULL.
  • FIG. 19 is a flowchart of the overwrite process in the first embodiment. This procedure is performed by the write processing unit in FIG. 14 .
  • step S 301 empty area clusters within the actual data area are searched for by the empty area search unit 12 , by reading FAT, in step S 301 .
  • Write process execution unit 13 determines whether or not empty areas exist, in step S 302 , from the received search results. If no empty area clusters exist, the chain of processing is terminated as (empty area) error. On the other hand, if (one or more) empty area cluster(s) exists, the process advances to step S 303 , and in this step S 303 , data which should be overwritten to the cluster specified as overwrite target is written to the empty area clusters in the search results. Then, in the subsequent step S 304 , the pointer information of the FAT corresponding to the empty area clusters to which write was performed in step S 303 is changed.
  • step S 305 the pointer of the FAT which corresponds to the cluster immediately before the cluster specified as the overwrite target, out of the clusters storing the actual data of the file which is the overwrite target, is changed to point the head cluster of the clusters to which write was performed in step S 303 .
  • step S 306 file information, for example, the last update time is changed (updated). Then in step S 307 , by setting the pointer of the FAT entry corresponding to the clusters which were to be overwritten by the information written to the empty area clusters to NULL, these clusters which were to be overwritten are freed (becomes empty areas).
  • step S 308 whether or not all data write has been completed, or in other words, whether or not there are any sections wherein information within the data included in the write instruction (information to be overwritten) is not written to the empty area clusters is determined. If all data write is not completed, or in other words, if there are less empty area clusters found and obtained through step S 301 than the number of clusters specified as overwrite targets, the process returns to step S 301 and searched again for empty areas. On the other hand, if all data write has been completed, this chain of processing is completed.
  • the data which should be overwritten to the clusters specified as the write target is written to the empty area clusters within the actual data area which has been searched and obtained, if the these empty area clusters can secure the number of clusters corresponding to the data included in the write instruction from the application, the data which should be overwritten can be written to the empty area clusters all at once.
  • the data which should be overwritten can be written to the empty area clusters all at once.
  • FIG. 20 is a diagram showing the call relation between the processing booted at the file system when the instruction from an application is to move a file. As shown in FIG. 20 , when a move instruction to a file is output from the application to the file system, the corresponding “file move” process is called in the file system.
  • “directory read” and “directory write” processes are called as processes for changing the directory entries.
  • “FAT read” and “actual data read” processes for reading FAT and actual data area from the media (secondary memory) to the primary memory, are called, and from the “directory write” process, “FAT write” process and “actual data write” processes, for writing data updated in the FAT and actual data area within the primary memory to the media (secondary memory), are called.
  • FIG. 21 is a block diagram showing the configuration of the write processing unit in a second embodiment of the present invention.
  • the write processing unit is configured between the application and the device driver, and a process for outputting instruction corresponding to the file information write instruction from the application to the device driver is performed.
  • the write processing unit comprises: search unit 23 for searching the entry of the directory of the destination of the movement and finding whether or not the write instruction is a file move which is accompanied by overwrite; based on whether or not this write instruction of the file move is accompanied by overwrite, write process execution unit 21 for changing or generating a directory entry of a file in a destination of the movement so as to link to the actual data of the file of the source of the movement, in a state wherein the link between the directory entry of the file of the source of the movement and the actual data of the file of the source of the movement is kept; entry delete unit 22 for deleting the directory entry of the file of the source of the movement; and freeing unit 26 for freeing actual data which the file of the destination of the movement had been pointing to before the write instruction when the write instruction is determined, by the search, to be a file move which is accompanied by overwrite.
  • Each unit in FIG. 21 corresponds, for example, to combinations of CPU 51 and RAM 53 in FIG. 26 .
  • search unit 23 is booted with the reception of this move instruction acting as the trigger.
  • This search unit 23 comprises entry search unit 24 and entry empty area search unit 25 .
  • Write process execution unit 21 determines whether or not the write instruction is a file move which is accompanied by overwrite based on the search result of the search unit 23 . If it is determined to be a movement accompanied by an overwrite, freeing unit 26 is booted and corresponding entries within the FAT are cleared to free the actual data to which the file of the destination of the movement had been pointing before the move instruction.
  • FIG. 22 shows a case wherein file file 2 already exists within the directory dir 2 of the destination of the movement. Therefore, entry search unit 25 returns the fact that file file 2 of the same name already exists within the directory dir 2 of the destination of the movement as the search result to write process execution unit 21 .
  • Write process execution unit 21 changes the directory entry of file file 2 in the destination of the movement to point the head actual data Data 1 of file file 1 in the source of the movement, based on this search result information. In other words, the directory entry of file file 2 in the actual data area of the destination of the movement is changed.
  • the state such as that shown in FIG. 22 is a state wherein the cluster chain below Data 1 which is a required data connecting to the directory entry of either file is deleted simultaneously when implementing the file delete function by specifying one of file 1 and file 2 , and is not considered preferable.
  • the drawback above can be prevented by deleting information regarding the file in the source of the movement from the directory entry of the file in the source of the movement, using the entry delete function which is a part of the file delete function as is shown in FIG. 23 .
  • the procedure for movement in this embodiment also has an effect in that the period wherein write failures occur due to accidental power supply interruptions is shortened.
  • the file information in the destination of the movement is changed to point head actual data Data 1 of the file in the source of the movement in the directory entry in the destination of the movement while the file information of the source of the movement exists in the directory entry of the file in the source of the movement within the secondary memory, the period wherein the file information of the source of the movement only exists in the primary memory is eliminated, and the period wherein write failure occurs due to accidental power supply interruption is shortened.
  • write process execution unit 21 creates the information in file file 2 of the destination of the movement to point the head actual data Data 1 of the file file 2 in the source of the movement, based on the search result information.
  • FIG. 25 is a flowchart of a move process in the second embodiment. This flowchart is executed by the write processing unit of FIG. 21 .
  • step S 401 whether or not the target to be moved is a directory is determined, and if it is a directory, the information regarding parent directory “ . . ” of this target directory is changed from the (parent) directory of the source of the movement to the (parent) directory of the destination of the movement in step S 402 .
  • step S 403 the directory of the destination of the movement is searched, and based on whether or not the file designated as the destination of the movement already exists within this directory, file information of the directory entry of the directory of the destination of the movement is changed or generated to point the head actual data of the file in the source of the movement by write process execution unit 21 .
  • step S 404 file information of the source of the movement is deleted from the directory entry of the directory in the source of the movement by entry delete unit 22 .
  • step S 405 whether or not the file information has been overwritten in the destination of the movement is determined. If it is determined that it has not been overwritten, the chain of processing is terminated immediately, and if it is determined to have been overwritten, the actual data to which the file in the destination of the movement has been pointing to before the move instruction is freed in step S 406 .
  • FIG. 26 is a diagram showing the hardware environment when actualizing each embodiment of the present invention by program.
  • the computer as hardware is comprised by CPU 51 , ROM 52 , RAM 53 , communication interface 54 , input/output device 56 , memory device 55 , and (memory media) reader 58 , connected via bus 57 .
  • CPU 51 controls the entire computer
  • RAM 53 is a primary memory which temporarily stores data stored within the secondary memory such as memory device 55 , during program execution, data update and the like.
  • the user can give various instructions such as file overwrite and file move to the application via the input/output device 56 .
  • information on the results processed by the write processing unit in the embodiment is presented to the user via the application.
  • program and data of a portable memory media 59 which has been read by the reader 58 and program and data of the information provider 61 which has been read via network 62 and communication interface 54 can be used within the computer.
  • FIG. 27 is a diagram explaining the loading of the program.
  • File write processing such as file overwrite and move processing of the present invention can obviously be actualized by a common computer 74 .

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)
  • Health & Medical Sciences (AREA)
  • Public Health (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
US11/235,336 2004-12-24 2005-09-27 Method and program for file information write processing Abandoned US20060173923A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/212,439 US8468290B2 (en) 2004-12-24 2008-09-17 Method and program for file information write processing

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2004375074A JP4806183B2 (ja) 2004-12-24 2004-12-24 ファイル情報の書き込み処理方法およびプログラム
JP2004-375074 2004-12-24

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/212,439 Division US8468290B2 (en) 2004-12-24 2008-09-17 Method and program for file information write processing

Publications (1)

Publication Number Publication Date
US20060173923A1 true US20060173923A1 (en) 2006-08-03

Family

ID=36738074

Family Applications (2)

Application Number Title Priority Date Filing Date
US11/235,336 Abandoned US20060173923A1 (en) 2004-12-24 2005-09-27 Method and program for file information write processing
US12/212,439 Expired - Fee Related US8468290B2 (en) 2004-12-24 2008-09-17 Method and program for file information write processing

Family Applications After (1)

Application Number Title Priority Date Filing Date
US12/212,439 Expired - Fee Related US8468290B2 (en) 2004-12-24 2008-09-17 Method and program for file information write processing

Country Status (4)

Country Link
US (2) US20060173923A1 (zh)
JP (1) JP4806183B2 (zh)
KR (1) KR100637787B1 (zh)
CN (2) CN100524316C (zh)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5471547B2 (ja) * 2010-02-10 2014-04-16 ソニー株式会社 情報記録装置、撮像装置、情報更新方法及びプログラム
JP6053274B2 (ja) * 2011-10-31 2016-12-27 キヤノン株式会社 ファイル管理装置、ファイル管理方法およびプログラム
JP6142669B2 (ja) * 2013-05-22 2017-06-07 株式会社ソシオネクスト データ編集プログラム、データ編集装置、データ編集方法
TWI631461B (zh) * 2017-06-27 2018-08-01 晨星半導體股份有限公司 行車記錄器之儲存裝置的控制方法與儲存裝置控制系統
US11435922B2 (en) 2017-06-27 2022-09-06 Sigmastar Technology Ltd. Control method for storage device of driving recorder and storage device control system
CN113703985B (zh) * 2021-09-23 2023-10-10 瑞芯微电子股份有限公司 内存管理方法、介质及电子设备

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050262033A1 (en) * 2002-03-29 2005-11-24 Kazuhiko Yamashita Data recording apparatus, data recording method, program for implementing the method, and program recording medium

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0512405A (ja) * 1991-07-03 1993-01-22 Matsushita Electric Ind Co Ltd 画像情報記憶検索装置
JPH07175700A (ja) * 1993-12-20 1995-07-14 Fujitsu Ltd データベース管理方式
US6477632B1 (en) * 1997-12-05 2002-11-05 Tokyo Electron Device Limited Storage device and accessing method
US6714949B1 (en) * 2000-04-25 2004-03-30 Adaptec, Inc. Dynamic file system configurations
JP2002007204A (ja) * 2000-06-26 2002-01-11 Sony Corp 情報処理装置、情報処理方法
JP2002091806A (ja) * 2000-09-20 2002-03-29 Olympus Optical Co Ltd ファイルシステム
JP3722057B2 (ja) * 2001-11-30 2005-11-30 ソニー株式会社 データ記録再生装置及びデータ記録再生方法、並びにデジタルカメラ
JP2003271408A (ja) * 2002-03-14 2003-09-26 Hitachi Ltd 電子データの更新方法及びパッチデータ作成方法
KR100973871B1 (ko) * 2002-10-17 2010-08-03 파나소닉 주식회사 파일 갱신 장치
JP4391793B2 (ja) * 2002-10-17 2009-12-24 パナソニック株式会社 ファイル更新装置
JP4292882B2 (ja) * 2003-03-18 2009-07-08 株式会社日立製作所 複数のスナップショット維持方法及びサーバ装置及びストレージ装置
US7085909B2 (en) * 2003-04-29 2006-08-01 International Business Machines Corporation Method, system and computer program product for implementing copy-on-write of a file
EP1653362B1 (en) * 2003-08-06 2015-09-30 Panasonic Corporation Accessing device and method for a semiconductor memory card
US20050052550A1 (en) * 2003-09-04 2005-03-10 Pentax Corporation Image-file managing system and optical apparatus for observing object

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050262033A1 (en) * 2002-03-29 2005-11-24 Kazuhiko Yamashita Data recording apparatus, data recording method, program for implementing the method, and program recording medium

Also Published As

Publication number Publication date
CN1794205A (zh) 2006-06-28
KR20060073407A (ko) 2006-06-28
US20090024785A1 (en) 2009-01-22
JP2006184979A (ja) 2006-07-13
CN100524316C (zh) 2009-08-05
KR100637787B1 (ko) 2006-10-24
US8468290B2 (en) 2013-06-18
JP4806183B2 (ja) 2011-11-02
CN101114304A (zh) 2008-01-30
CN100367237C (zh) 2008-02-06

Similar Documents

Publication Publication Date Title
US8468290B2 (en) Method and program for file information write processing
US7302517B2 (en) Apparatus and method for controlling execute-in-place (XIP) in serial flash memory, and flash memory chip using the same
US8612722B2 (en) Determining an end of valid log in a log of write records
US20110060863A1 (en) Controller
US20110276794A1 (en) Information processing device having configuration changing function and system configuration method
US20100169546A1 (en) Flash memory access circuit
JPH0668736B2 (ja) ２個のシステムクロックサイクルを利用する書込み動作をもったキャッシュメモリユニットを供与する装置及び方法
US9361219B2 (en) Information processing device, information processing method and program product
JP5057887B2 (ja) データ更新装置及びデータ更新方法及びデータ更新プログラム
US6925522B2 (en) Device and method capable of changing codes of micro-controller
EP1510924A1 (en) Apparatus and method for handling transactions with writes and reads to EEPROM or Flash memories
US7107407B2 (en) Arithmetic unit with reduced startup time and method of loading data
JP2006202233A (ja) コントローラ、そのプログラム
US20080052682A1 (en) Debug device and debug processing method
US6634026B1 (en) Method and apparatus for correcting common errors in multiple versions of a computer program
JP3507728B2 (ja) メモリ削減方法および装置
JP2004206353A (ja) ソフトウェアのインストール方法
US20100094804A1 (en) Method and Device for Updating a Database, and Computer Program Product
TWI807824B (zh) 具有自動升級功能的開發系統以及開發系統的自動升級方法
JP3489153B2 (ja) ファイルシステム
JP2003140945A (ja) ファイルデータ読み出し装置，ナビゲーション装置，コンピュータプログラム，記録媒体及びファイルデータ読み出し方法
GB2540179A (en) An integrated system for the transactional management of main memory and data storage
JP2702356B2 (ja) デバッグ情報アクセス方式
JPH05241814A (ja) パッチ管理装置
JPH10240627A (ja) セクタ管理方法及び装置

Legal Events

Date Code Title Description
AS Assignment

Owner name: FUJITSU LIMITED, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ABE, NAOKI;REEL/FRAME:017040/0673

Effective date: 20050401

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION