Generally described, there are a number of portable computing devices, such as digital still cameras, digital video cameras, media players, mobile phones, mobile computing devices, personal digital assistants, and the like that maintain data on a storage media, such as a portable storage media. The continued development of more complex portable computing devices and larger storage capacity portable storage media places a greater demand for flexibility on the file system format used on the storage media. Current file system format approaches can become deficient in that they may provide inadequate flexibility for increasing storage size capacities and/or storage media applications.
An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries.
In some embodiments, a computer-readable medium having computer-executable components for storing data is provided. The computer-readable components can include specific structures for improving the efficiency of determining if a target file name exists. In some embodiments, determining if the target file name exists includes (1) determining a file name hash, (2) finding a directory entry set containing the same hash and a potentially matching filename, thus either reducing the set of possible directory entries or more quickly removing a directory entry from consideration, and (3) determining the target file name exists by matching its file name against the potentially matching filename. In some embodiments, target file name may be converted to an uppercase version of the filename, e.g. for operating systems which perform case-insensitive operations on files. In some embodiments, conversion to uppercase may be based on an Up-Case Table stored on the media. In some embodiments, the directory entry can be read from one or more computer readable storage media, and the file name hash is compared to the directory entry set name hash value. In some embodiments, determining the file name hash can include using a set of pre-calculated hash values for at least a portion of the target file name. For example, if the device only creates 1000 file names, it can lookup the corresponding file name hash from a pre-computed corresponding set of values instead of performing the calculation. In some embodiments, if the a portion of the file names commonly created by the device are the same (e.g., all files start with “IMG” followed by a four digit number), a portion of the hash can be precomputed (e.g., “IMG0”, “IMG1”, “IMG2”, “IMG”, etc.) to further reduce computation of the hash value. As would be appreciated, the above processes can enable determination if a file name exists by allowing a comparison of fixed-length file hashes prior to comparisons of variable-length strings.
In some embodiments, a directory entry set on one or more computer-readable storage media is updated to contain information corresponding to a file. The directory entry set can be comprised of at least three contiguous DirectoryEntry data structures, the first of which can be a File DirectoryEntry data structure, the second can be a Stream Extension DirectoryEntry data structure, and the third can be a first File Name Extension DirectoryEntry data structure of a one or more contiguous File Name Extension DirectoryEntry data structures, the Stream Extension DirectoryEntry data structure can include a name hash field and a name length field, and the name length field can indicate the number of characters in the file name stored in the one or more contiguous File Name Extension DirectoryEntry data structures. In some embodiments, the DirectoryEntry data structures are all of the same fixed length, to further improve computational efficiencies.
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This summary is not intended to identify key features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
The foregoing aspects and many of the attendant advantages embodied herein will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:
Generally described, the application relates to an extensible file system format and various processes associated with the extensible file system format. In an illustrative embodiment, the extensible file system format corresponds to an extensible file system format for portable storage media and various processes associated with the extensible file system format on the portable storage media. Although one aspect will be described with regard to a portable storage media file system format, one skilled in the relevant art will appreciate that the disclosed embodiments are illustrative in nature and should not be construed as limiting. Additionally, one skilled in the relevant art will appreciate that the data structures and data layouts used in the illustrative examples may require additional information related to performance, security, and the like.
Extensible File Allocation Table (exFAT) is one illustrative embodiment of the disclosed file system. The exFAT embodiment retains both the simplicity and ease of implementation of other FAT-based file systems. In order to keep the simplicity of implementation, and in order to enable implementations on devices with limited memory and processor capacity, the file directory structure has been kept unsorted and “flat”. The exFAT embodiment also enables many files (e.g. up to 2,796,202) in a single directory. In order to find if a target file name exists in a “flat” unsorted directory structure (for example, to create, open, update, or delete a file with that name), a comparison of the target file name can be done against each file record (e.g. DirectoryEntry set). A string comparison can be more processor, power, and energy intensive than an integer comparison. Thus, by first creating a Name Hash based on the target file name, and then only performing a string comparison on file records (e.g. DirectoryEntry sets) which have a matching Name Hash, the speed and efficiency of the operatin to find the matching target file name is improved. Similarly, by creating a Name Hash when creating or updating a directory entry for a file, the speed and efficiency of later operations to find this file by name can be improved. In addition, because some computing device systems perform case-insensitive file operations, in some embodiments the hash function can be based on a partly case-insensitive manner. In some embodiments, the file system can embed the lower-case to upper-case translation table on the media. Embedding the lower-case to upper-case translation table can provide support for unicode character mappings which may spring into existence or change in the future, without affecting the resulting hash on existing media. Additional details of an exFAT embodiment can be found more fully described in Appendix A.
In an illustrative embodiment, the mobile computing device 102 may be in communication with other computing devices for collecting/exchanging data to be stored on the portable storage media 104. With reference to
With reference now to
The volume layout 200 also includes an extensible parameters component, designated as OEM parameters 204, that define various additional data structures used in conjunction with the file system. In an illustrative embodiment, an original equipment manufacture (OEM) may specify various extensible data structures, such as performance parameters for a storage medium, that can be defined at time of manufacture. The volume layout 200 can further include a file allocation table component 206 that defines file and directory allocations. In an illustrative embodiment, each entry in the file allocation table component 206 corresponds to a 32-bit entry that represents an allocated cluster, an unallocated cluster or an unusable cluster. The volume layout 200 can still further include series of file data components 208A-208X that correspond to the data stored according to the file system format. Various data structures for defining a portion of the file data components 208A-208X will be defined with regard to
Turning now to
With continued reference to
In a manner similar to primary directory entries 302, secondary directory entries 304 may also be further classified as critical secondary directory entries 310 and benign secondary directory entries 312. As described above, the critical secondary directory entries 310 and benign secondary directory entries 312 are associated with a benign primary directory entry and extend the metadata associated with the primary directory entry. Both the critical secondary directory entries 310 and the benign secondary directory entries 312 can be associated with another cluster chain the volume.
To mount a corresponding to the extensible file system format, the file system implements a mount volume procedure. In an illustrative embodiment, the mount volume procedure attempts to a look at a version number for the volume. If the version number is not understood (e.g., the version number is higher), the volume will not be mounted. During a normal directory enumeration, any critical primary directory entries not known by the file system will prevent the volume from being mounted. Thereafter, various user-initiated processes, such as a file open, will cause the file system to enumerate the secondary directory entries. If the critical secondary directory entries 310 are not known by a file system, the entire directory entry will be skipped. Additionally, if benign secondary directory entries 312 are not known by the file system, the particular unknown benign secondary directory entry will be ignored.
With reference now to
Turning now to
Turning now to
Turning now to
With reference now to
With reference to
With reference to
In an illustrative embodiment, a benign primary directory entry and/or secondary directory entries may be associated with access control list (ACL) information.
With reference now to
At decision block 1108, a test is conducted to determine whether the target hash value matches the current directory entry hash value. This enables implementations to perform a quick comparison when searching for a file by name. Importantly, the NameHash provides a sure verification of a mismatch. However, the NameHash does not provide a sure verification of a match. If they do not match, the routine 1100 returns to block 1106 (until all the directory entries have been examined. If the hash values match at decision block 1108, at block 1110, the file system obtains the full file name for the potentially matching directory entry. In some embodiments, this comparison is done by comparing the converted versions of the two file names. For example, an embodiment may compare an Up-Cased version of the specific file name against an Up-Cased version of the full file name for the potentially matching directory entry. An illustrative directory entry type for storing directory entry full file names is described above with regard to data components 600 (
In some embodiments at block 1104, when generating the name hash, the target file name is first converted into a second string via a conversion table. For example, the second string can be an up-cased version of the target file name, and the conversion table can be an Up-Case table. In some embodiments, the conversion table is stored on the same one or more pieces of media that contain the directory entries. The calculation of the name hash can initialize a temporary value to a predetermined start value (e.g. zero). For each character of the second string, the temporary value can be rotated right by one bit, and then have the current character of the second string added to the temporary value.
An example of code implementing one embodiment of the name hash generation written in psuedo-code based on the “C” language:
In some embodiments at block 1104, the generating the name hash, either the target file name or the second string may be determined to correspond to a naming convention, such as a digital camera picture naming convention, which uses the same prefix (e.g. “IMG”) for many file names. In some embodiments, the calculation of a hash value for a common prefix will always yield the same temporary value (i.e. partial hash) after the hash function includes the common prefix and before it includes the variable portion of the file name. In these embodiments, a common prefix (e.g. “IMG”, “IMG00”, “IMG01”, and the like) can have its corresponding partial hash value pre-computed. Thus, when computing the hash value for a second string with a common prefix, the temporary value may instead be initialized to the pre-computed partial hash value corresponding to the common prefix. The remaining hash generating steps (e.g. rotation and addition steps) would then be applied only to the variable portion of the file name, thus saving a few instruction cycles in the computation of the name hash of the target file name, while resulting in the same name hash.
An example of code implementing one embodiment of the name hash generation for a common prefix, written in psuedo-code based on the “C” language, is as follows:
As can be appreciated, in the above example pseudo-code, the PrecomputedHash for a name where a portion of the file name does not have a common prefix, the partial hash value may be a predetermined value (e.g. zero), thus allowing the same function to generate the hash for all file names. It will be appreciated that the same operations can be applied to directory entry names. As can be further appreciated, the conversion of the file name to the second string may occur as an integral part of the name hash generation, as opposed to occurring prior to the generation of the hash. For example, in psuedo-code based on the “C” language, the same result occurs with:
Similarly, in some embodiments, if a device only creates files with a limited set of file names (i.e. 10,000 files with names “DSCN0000.JPG”, “DSCN0001.JPG”, . . . “DSCN9999.JPG”), some or all of these file names may have their hash fully precomputed and stored in a device's memory. Then, when determining if a file exists or creating a new file record, the corresponding precomputed final hash may be simply read from the device's memory.
Embodiments of the invention are operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with embodiments of the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices (such as mobile phones, media players, etc.), multiprocessor systems, microprocessor-based systems, set top boxes, consumer electronics (such as televisions, optical disk players, digital picture frames, etc.), media kiosks, network PCs, minicomputers, mainframe computers, telephony systems, distributed computing environments that include any of the above systems or devices, and the like.
Embodiments of the invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. In some embodiments of the invention, at least a portion of processes described above may be implemented by computer-executable instructions executable by one or more computing systems. Embodiments of the invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
With reference to
Computer 9910 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 9910 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer readable storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 9910. Communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of any of the above should also be included within the scope of computer readable media.
The system memory 9930 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 9931 and random access memory (RAM) 9932. A basic input/output system 9933 (BIOS), containing the basic routines that help to transfer information between elements within computer 9910, such as during start-up, is typically stored in ROM 9931. RAM 9932 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 9920. By way of example, and not limitation,
The computer 9910 may also include other removable/non-removable volatile/nonvolatile computer storage media. By way of example only,
The drives and their associated computer storage media discussed above and illustrated in
A user may enter commands and information into the computer 9910 through input devices such as a keyboard 9962, a microphone 9963, and a pointing device 9961, such as a mouse, trackball or touch pad. Other input devices (not shown) may include a joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 9920 through a user input interface 9960 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 9991 or other type of display device is also connected to the system bus 9921 via an interface, such as a video interface 9990. In addition to the monitor, computers may also include other peripheral output devices such as speakers 9997 and printer 9996, which may be connected through an output peripheral interface 9995.
The computer 9910 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 9980. The remote computer 9980 may be a personal computer, a hand-held device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 9910. The logical connections depicted in
When used in a LAN networking environment, the computer 9910 is connected to the LAN 9971 through a network interface or adapter 9970. When used in a WAN networking environment, the computer 9910 typically includes a modem 9972 or other means for establishing communications over the WAN 9973, such as the Internet. The modem 9972, which may be internal or external, may be connected to the system bus 9921 via the user input interface 9960, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 9910, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,
In an example embodiment, the file structures used in the file system described herein can be those described more fully in Appendix A.
While illustrative embodiments have been illustrated and described, it will be appreciated that various changes can be made therein without departing from the spirit and scope of that which is disclosed herein.
The exFAT file system is the successor to FAT32 in the FAT family of file systems. This appendix describes portions of the exFAT file system.
In the context of this appendix, certain terms (see Table 1) carry specific meaning for the design and implementation of the exFAT file system.
Full Text of Common Acronyms
This appendix uses acronyms in common use in the personal computer industry (see Table 2).
Default Field and Structure Qualifiers
Fields and structures in this appendix have the following qualifiers (see list below), unless the appendix notes otherwise.
A volume is the set of all file system structures and data space necessary to store and retrieve user data. All exFAT volumes contain four regions (see Table 3).
Main and Backup Boot Regions
The Main Boot region provides all the necessary boot-strapping instructions, identifying information, and file system parameters to enable an implementation to perform the following:
1. Boot-strap a computer system from an exFAT volume.
2. Identify the file system on the volume as exFAT.
3. Discover the location of the exFAT file system structures.
The Backup Boot region is a backup of the Main Boot region. It aids recovery of the exFAT volume in the advent of the Main Boot region being in an inconsistent state.
Main and Backup Boot Sector Sub-Regions
The Main Boot Sector contains code for boot-strapping from an exFAT volume and fundamental exFAT parameters which describe the volume structure (see Table 4). BIOS, MBR, or other boot-strapping agents may inspect this sector and may load and execute any boot-strapping instructions contained therein.
The Backup Boot Sector is a backup of the Main Boot Sector and has the same structure (see Table 4).
JumpBoot Field
The JumpBoot field contains the jump instruction for CPUs common in personal computers, which, when executed, “jumps” the CPU to execute the boot-strapping instructions in the BootCode field.
The valid value for this field is (in order of low-order byte to high-order byte) EBh 76h 90h.
FileSystemName Field
The FileSystemName field contains the name of the file system on the volume.
The valid value for this field is, in ASCII characters, “EXFAT”, which includes three trailing white spaces.
MustBeZero Field
The MustBeZero field directly corresponds with the range of bytes the packed BIOS parameter block consumes on FAT12/16/32 volumes.
The valid value for this field is 0, which helps to prevent FAT12/16/32 implementations from mistakenly mounting an exFAT volume.
PartitionOffset Field
The PartitionOffset field describes the media-relative sector offset of the partition which hosts the given exFAT volume. This field aids boot-strapping from the volume using extended INT 13h on personal computers.
All possible values for this field are valid; however, the value 0 indicates implementations shall ignore this field.
VolumeLength Field
The VolumeLength field describes the size of the given exFAT volume in sectors.
The valid range of values for this field is:
However, if the size of the Excess Space sub-region is 0, then the value of this field is ClusterHeapOffset+(232−11)*2SectorsPerClusterShift.
FatOffset Field
The FatOffset field describes the volume-relative sector offset of the First FAT.
The valid range of values for this field is:
The FatLength field describes the length, in sectors, of each FAT table (the volume may contain up to two FATs).
The valid range of values for this field is:
This field may contain a value in excess of its lower bound (as described above) to enable the Second FAT, if present, to also be aligned to the characteristics of the underlying storage media. The contents of space which exceeds what the FAT itself requires, if any, are undefined.
ClusterHeapOffset Field
The ClusterHeapOffset field describes the volume-relative sector offset of the Cluster Heap. This field enables implementations to align the Cluster Heap to the characteristics of the underlying storage media.
The valid range of values for this field is:
The ClusterCount field describes the number of clusters the Cluster Heap contains.
The valid value for this field is the lesser of the following:
The value of the ClusterCount field determines the minimum size of a FAT.
FirstClusterOfRootDirectory Field
The FirstClusterOfRootDirectory field contains the cluster index of the first cluster of the root directory. The valid range of values for this field is:
The VolumeSerialNumber field contains a unique serial number. All possible values for this field are valid.
FileSystemRevision Field
The FileSystemRevision field describes the major and minor revision numbers of the exFAT structures on the given volume.
The high-order byte is the major revision number and the low-order byte is the minor revision number. For example, if the high-order byte contains the value 01h and if the low-order byte contains the value 05h, then the FileSystemRevision field describes the revision number 1.05. Likewise, if the high-order byte contains the value 0 Ah and if the low-order byte contains the value 0Fh, then the FileSystemRevision field describes the revision number 10.15.
The valid range of values for this field is:
The revision number of exFAT this appendix describes is 1.00.
VolumeFlags Field
The VolumeFlags field contains flags which indicate the status of various file system structures on the exFAT volume (see Table 5).
ActiveFat Field
The ActiveFat field describes which FAT and Allocation Bitmap are active (and implementations shall use), as follows:
Implementations shall consider the inactive FAT and Allocation Bitmap as stale.
VolumeDirty Field
The VolumeDirty field describes whether the volume is dirty or not, as follows:
The MediaFailure field describes whether an implementation has discovered media failures or not, as follows:
The ClearToZero field does not have significant meaning in this appendix.
The valid values for this field are:
The BytesPerSectorShift field describes the bytes per sector expressed as log2(N), where N is the number of bytes per sector. For example, for 512 bytes per sector, the value of this field is 9.
The valid range of values for this field is:
The SectorsPerClusterShift field describes the sectors per cluster expressed as log2(N), where N is number of sectors per cluster. For example, for 8 sectors per cluster, the value of this field is 3.
The valid range of values for this field is:
The NumberOfFats field describes the number of FATs and Allocation Bitmaps the volume contains.
The valid range of values for this field is:
The DriveSelect field contains the extended INT 13h drive number, which aids boot-strapping from this volume using extended INT 13h on personal computers.
All possible values for this field are valid. Similar fields in previous FAT-based file systems frequently contained the value 80h.
PercentInUse Field
The PercentInUse field describes the percentage of clusters in the Cluster Heap which are allocated.
The valid range of values for this field is:
The BootCode field contains boot-strapping instructions.
BootSignature Field
The BootSignature field describes whether the intent of given sector is for it to be a Boot Sector or not.
The valid value for this field is AA55h.
Main and Backup Extended Boot Sectors Sub-Regions
Each sector of the Main Extended Boot Sectors has the same structure; however, each sector may hold distinct boot-strapping instructions (see Table 6).
The Backup Extended Boot Sectors is a backup of the Main Extended Boot Sectors and has the same structure (see Table 6).
ExtendedBootCode Field
The ExtendedBootCode field contains boot-strapping instructions.
ExtendedBootSignature Field
The ExtendedBootSignature field describes whether the intent of given sector is for it to be an Extended Boot Sector or not.
The valid value for this field is AA550000h.
Main and Backup OEM Parameters Sub-Regions
The Main OEM Parameters contains ten parameters structures which contain manufacturer-specific information (see Table 7). Each of the ten parameters structures derives from the Generic Parameters template. This appendix itself defines only one parameters structure: the Flash Parameters structure.
The Backup OEM Parameters is a backup of the Main OEM Parameters and has the same structure (see Table 7).
Parameters[0] . . . Parameters[9]
Each Parameters field in this array contains a parameters structure, which derives from the Generic Parameters template.
Any unused Parameters field shall be described as unused. When creating or appending to this array, implementations should consolidate unused Parameters structures at the end of the array, thereby leaving all other Parameters structures at the beginning of the array.
Generic Parameters Template
The Generic Parameters template provides the base definition of a parameters structure (see Table 8). All parameters structures derive from this template. Support for this Generic Parameters template is mandatory.
ParametersGuid Field
The ParametersGuid field describes a GUID, which determines the layout of the remainder of the given parameters structure.
All possible values for this field are valid.
The value, in GUID notation, {00000000-0000-0000-0000-000000000000}, indicates the given parameters structure is unused.
Main and Backup Boot Checksum Sub-Regions
The Main and Backup Boot Checksum contain a repeating pattern of the four-byte checksum of the contents of all other sub-regions in their respective Boot regions. The checksum calculation does not include the VolumeFlags and PercentInUse fields in their respective Boot Sector. The repeating pattern of the four-byte checksum fills its respective Boot Checksum sub-region from the beginning to the end of the sub-region.
File Allocation Table Region
The File Allocation Table (FAT) region may contain up to two FATs, one in the First FAT sub-region and another in the Second FAT sub-region. The NumberOfFats field describes how many FATs this region contains. The valid values for the NumberOfFats field are 1 and 2. Therefore, the First FAT sub-region always contains a FAT. If the NumberOfFats field is two, then the Second FAT sub-region also contains a FAT.
The ActiveFat field of the VolumeFlags field describes which FAT is active. Only the VolumeFlags field in the Main Boot Sector is current.
First and Second Fat Sub-Regions
A FAT describes cluster chains in the Cluster Heap (see Table 9). A cluster chain is a series of clusters which provides space for recording the contents of files, directories, and other file system structures. A FAT represents a cluster chain as a singly-linked list of cluster indices. With the exception of the first two entries, every entry in a FAT represents exactly one cluster.
FatEntry[0] Field
The FatEntry[0] field describes the media type in the first byte (the lowest order byte) and contains FFh in the remaining three bytes.
The media type (the first byte) should be F8h.
FatEntry[1] Field
The FatEntry[1] field only exists due to historical precedence and does not describe anything of interest.
The valid value for this field is FFFFFFFFh.
FatEntry[2] . . . FatEntry[ClusterCount+1] Fields
Each FatEntry field in this array represents a cluster in the Cluster Heap. FatEntry[2] represents the first cluster in the Cluster Heap and FatEntry[ClusterCount+1] represents the last cluster in the Cluster Heap.
The valid range of values for these fields is:
The Data region contains the Cluster Heap, which provides managed space for file system structures, directories, and files.
Cluster Heap Sub-Region
The Cluster Heap's structure is very simple (see Table 10); each consecutive series of sectors describes one cluster, as the SectorsPerClusterShift field defines. Importantly, the first cluster of the Cluster Heap has index two, which directly corresponds to the index of FatEntry[2].
In an exFAT volume, an Allocation Bitmap maintains the record of the allocation state of all clusters. This is a significant difference from exFAT's predecessors (FAT12, FAT16, and FAT32), in which a FAT maintained a record of the allocation state of all clusters in the Cluster Heap.
Cluster[2] . . . Cluster[ClusterCount+1] Fields
Each Cluster field in this array is a series of contiguous sectors, as the SectorsPerClusterShift field defines.
Directory Structure
The exFAT file system uses a directory tree approach to manage the file system structures and files which exist in the Cluster Heap. Directories have a one-to-many relationship between parent and child in the directory tree.
The directory to which the FirstClusterOfRootDirectory field refers is the root of the directory tree. All other directories descend from the root directory in a singly-linked fashion.
Each directory consists of a series of directory entries (see Table 11).
One or more directory entries combine into a directory entry set which describes something of interest, such as a file system structure, sub-directory, or file.
Directoryentry[0] . . . Directoryentry[N−1]
Each DirectoryEntry field in this array derives from the Generic DirectoryEntry template.
Generic Directoryentry Template
The Generic DirectoryEntry template provides the base definition for directory entries (see Table 12). All directory entry structures derive from this template and only Microsoft-defined directory entry structures are valid (exFAT does not have provisions for manufacturer-defined directory entry structures). The ability to interpret the Generic DirectoryEntry template is mandatory.
EntryType Field
The EntryType field has three modes of usage which the value of the field defines (see list below).
The value 80h is invalid.
TypeCode Field
The TypeCode field partially describes the specific type of the given directory entry. This field, plus the TypeImportance and TypeCategory fields uniquely identify the type of the given directory entry.
All possible values of this field are valid, unless the TypeImportance and TypeCategory fields both contain the value 0; in that case, the value 0 is invalid for this field.
TypeImportance Field
The TypeImportance field describes the importance of the given directory entry.
The valid values for this field are:
The TypeCategory field describes the category of the given directory entry.
The valid values for this field are:
The InUse field describes whether the given directory entry in use or not.
The valid values for this field are:
The FirstCluster field contains the index of the first cluster of an allocation in the Cluster Heap associated with the given directory entry.
The valid range of values for this field is:
Structures which derive from this template may redefine both the FirstCluster and DataLength fields, if a cluster allocation is not compatible with the derivative structure.
DataLength Field
The DataLength field describes the size, in bytes, of the data the associated cluster allocation contains.
The valid range of value for this field is:
Structures which derive from this template may redefine both the FirstCluster and DataLength fields, if a cluster allocation is not possible for the derivative structure.
Generic Primary Directoryentry Template
The first directory entry in a directory entry set is a primary directory entry. All subsequent directory entries, if any, in the directory entry set are secondary directory entries.
The ability to interpret the Generic Primary DirectoryEntry template is mandatory.
All primary directory entry structures derive from the Generic Primary DirectoryEntry template (see Table 14), which derives from the Generic DirectoryEntry template.
EntryType Field
The EntryType field conforms to the definition the Generic DirectoryEntry template provides.
TypeCode Field
The TypeCode field conforms to the definition the Generic DirectoryEntry template provides.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic DirectoryEntry template provides.
Critical Primary Directory Entries
Critical primary directory entries contain information which is critical to the proper management of an exFAT volume. Only the root directory contains critical primary directory entries (File directory entries are an exception).
The definition of critical primary directory entries correlates to the major exFAT revision number.
Benign Primary Directory Entries
Support for any benign primary directory entry this appendix defines is optional. An unrecognized benign primary directory entry renders the entire directory entry set as unrecognized (beyond the definition of the applicable directory entry templates).
TypeCategory Field
The TypeCategory field conforms to the definition the Generic DirectoryEntry template provides.
For this template, the valid value for this field is 0.
In Use Field
The InUse field conforms to the definition the Generic DirectoryEntry template provides.
SecondaryCount Field
The SecondaryCount field describes the number of secondary directory entries which immediately follow the given primary directory entry. These secondary directory entries, along with the given primary directory entry, comprise the directory entry set.
The valid range of values for this field is:
Critical primary directory entry structures which derive from this template may redefine both the SecondaryCount and SetChecksum fields.
SetChecksum Field
The SetChecksum field contains the checksum of all directory entries in the given directory entry set. However, the checksum excludes this field (see
Critical primary directory entry structures which derive from this template may redefine both the SecondaryCount and SetChecksum fields.
GeneralPrimaryFlags Field
The GeneralPrimaryFlags field contains flags (see Table 15).
Critical primary directory entry structures which derive from this template may redefine this field.
AllocationPossible Field
The AllocationPossible field describes whether or not an allocation in the Cluster Heap is possible for the given directory entry.
The valid values for this field are:
The NoFatChain field indicates whether or not the active FAT describes the given allocation's cluster chain.
The valid values for this field are:
If critical primary directory entry structures which derive from this template redefine the GeneralPrimaryFlags field, then the corresponding FAT entries for any associated allocation's cluster chain are valid.
FirstCluster Field
The FirstCluster field conforms to the definition the Generic DirectoryEntry template provides.
Critical primary directory entry structures which derive from this template may redefine the FirstCluster and DataLength fields. Other structures which derive from this template may redefine the FirstCluster and DataLength fields only if the AllocationPossible field contains the value 0.
DataLength Field
The DataCluster field conforms to the definition the Generic DirectoryEntry template provides.
Critical primary directory entry structures which derive from this template may redefine the FirstCluster and DataLength fields. Other structures which derive from this template may redefine the FirstCluster and DataLength fields only if the AllocationPossible field contains the value 0.
Generic Secondary Directoryentry Template
The ability to interpret the Generic Secondary DirectoryEntry template is mandatory. Support for any critical or benign secondary directory entry this appendix defines is optional.
All secondary directory entry structures derive from the Generic Secondary DirectoryEntry template (see Table 16), which derives from the Generic DirectoryEntry template.
EntryType Field
The EntryType field conforms to the definition the Generic DirectoryEntry template provides
TypeCode Field
The TypeCode field conforms to the definition the Generic DirectoryEntry template provides.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic DirectoryEntry template provides.
Critical Secondary Directory Entries
Critical secondary directory entries contain information which is critical to the proper management of its containing directory entry set. An unrecognized critical directory entry renders the entire directory entry set as unrecognized (beyond the definition of the applicable directory entry templates).
Benign Secondary Directory Entries
Benign secondary directory entries contain additional information which may be useful for managing its containing directory entry set. Support for any specific benign secondary directory entry is optional. Unrecognized benign secondary directory entries do not render the entire directory entry set as unrecognized.
TypeCategory Field
The TypeCategory field conforms to the definition the Generic DirectoryEntry template provides.
For this template, the valid value for this field is 1.
In Use Field
The InUse field conforms to the definition the Generic DirectoryEntry template provides.
GeneralSecondaryFlags Field
The GeneralSecondaryFlags field contains flags (see Table 17).
AllocationPossible Field
The AllocationPossible field has the same definition as the similarly-named field in the Generic Primary DirectoryEntry template.
NoFatChain Field
The NoFatChain field has the same definition as a similarly-named field in the Generic Primary DirectoryEntry template.
FirstCluster Field
The FirstCluster field conforms to the definition the Generic DirectoryEntry template provides.
DataLength Field
The DataCluster field conforms to the definition the Generic DirectoryEntry template provides.
Directory Entry Definitions
This appendix defines the following directory entries:
In the exFAT file system, a FAT does not describe allocation state of clusters; rather, an Allocation Bitmap does. Allocation Bitmaps exist in the Cluster Heap and have corresponding critical primary directory entries in the root directory (see Table 18).
The NumberOfFats field determines the number of valid Allocation Bitmap directory entries in the root directory. If the NumberOfFats field contains the value 1, then the only valid number of Allocation Bitmap directory entries is 1. Further, the one Allocation Bitmap directory entry is only valid if it describes the First Allocation Bitmap. If the NumberOfFats field contains the value 2, then the only valid number of Allocation Bitmap directory entries is 2. Further, the two Allocation Bitmap directory entries are only valid if one describes the First Allocation Bitmap and the other describes the Second Allocation Bitmap.
EntryType Field
The EntryType field conforms to the definition the Generic Primary DirectoryEntry template provides.
TypeCode Field
The TypeCode field conforms to the definition the Generic Primary DirectoryEntry template provides.
For an Allocation Bitmap directory entry, the valid value for this field is 1.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic Primary DirectoryEntry template provides.
For an Allocation Bitmap directory entry, the valid value for this field is 0.
TypeCategory Field
The TypeCategory field conforms to the definition the Generic Primary DirectoryEntry template provides.
In Use Field
The InUse field conforms to the definition the Generic Primary DirectoryEntry template provides.
BitmapFlags Field
The BitmapFlags field contains flags (see Table 19).
BitmapIdentifier Field
The BitmapIdentifier field indicates which Allocation Bitmap the given directory entry describes. Implementations shall use the First Allocation Bitmap in conjunction with the First FAT and shall use the Second Allocation Bitmap in conjunction with the Second FAT. The ActiveFat field describes which FAT and Allocation Bitmap are active.
The valid values for this field are:
The FirstCluster field conforms to the definition the Generic Primary DirectoryEntry template provides.
This field contains the index of the first cluster of the cluster chain, as the FAT describes, which hosts the Allocation Bitmap.
DataLength Field
The DataCluster field conforms to the definition the Generic Primary DirectoryEntry template provides.
Allocation Bitmap
An Allocation Bitmap records the allocation state of the clusters in the Cluster Heap. Each bit in an Allocation Bitmap indicates whether its corresponding cluster is available for allocation or not.
An Allocation Bitmap represents clusters from lowest to highest index (see Table 20). For historical reasons, the first cluster has index 2. Note: the first bit in the bitmap is the lowest-order bit of the first byte.
BitmapEntry[2] . . . BitmapEntry[ClusterCount+1] Fields
Each BitmapEntry field in this array represents a cluster in the Cluster Heap. BitmapEntry[2] represents the first cluster in the Cluster Heap and BitmapEntry[ClusterCount+1] represents the last cluster in the Cluster Heap.
The valid values for these fields are:
The Up-case Table defines the conversion from lower-case to upper-case characters. This is important due to the File Name directory entry using Unicode characters and the exFAT file system being case insensitive and case preserving. The Up-case Table exists in the Cluster Heap and has a corresponding critical primary directory entry in the root directory (see Table 21). The valid number of Up-case Table directory entries is 1.
EntryType Field
The EntryType field conforms to the definition the Generic Primary DirectoryEntry template provides.
TypeCode Field
The TypeCode field conforms to the definition the Generic Primary DirectoryEntry template provides.
For the Up-case Table directory entry, the valid value for this field is 2.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic Primary DirectoryEntry template provides.
For the Up-case Table directory entry, the valid value for this field is 0.
TypeCategory Field
The TypeCategory field conforms to the definition the Generic Primary DirectoryEntry template provides.
In Use Field
The InUse field conforms to the definition the Generic Primary DirectoryEntry template provides.
TableChecksum Field
The TableChecksum field contains the checksum of the Up-case Table (which the FirstCluster and DataLength fields describe). Implementations shall verify the contents of this field are valid prior to using the Up-case Table.
FirstCluster Field
The FirstCluster field conforms to the definition the Generic Primary DirectoryEntry template provides.
This field contains the index of the first cluster of the cluster chain, as the FAT describes, which hosts the Up-case Table.
DataLength Field
The DataCluster field conforms to the definition the Generic Primary DirectoryEntry template provides.
Up-Case Table
The Up-case Table is a series of Unicode character mappings. A character mapping consists of a 2-byte field, with the index of the field in the Up-case Table representing the Unicode character to be up-cased, and the 2-byte field representing the up-cased Unicode character.
The first 128 Unicode characters have mandatory mappings (see Table 22). An Up-case Table which has any other character mapping for any of the first 128 Unicode characters is invalid.
Implementations which only support characters from the mandatory mapping range may ignore the mappings of the rest of the Up-case Table. Such implementations shall only use characters from the mandatory mapping range when creating or renaming files (via the File Name directory entry). When up-casing existing file names, such implementations shall not up-case characters from the non-mandatory mapping range, but shall leave them intact in the resulting up-cased file name (this is a partial up-casing). When comparing file names, such implementations shall treat file names which differ from the name under comparison only by Unicode characters from the non-mandatory mapping range as equivalent. While such file names are only potentially equivalent, such implementations cannot ensure the fully up-cased file name does not collide with the name under comparison.
0041h
0042h
0043h
0044h
0045h
0046h
0047h
0048h
0049h
004Ah
004Bh
004Ch
004Dh
004Eh
004Fh
0050h
0051h
0052h
0053h
0054h
0055h
0056h
0057h
0058h
0059h
005Ah
Upon formatting a volume, implementations may generate the Up-case Table in a compressed format using identity-mapping compression, since a large portion of the Unicode character space has no concept of case (which means the “lower-case” and “upper-case” characters are equivalent). Implementations compress the Up-case Table by representing a series of identity mappings with the value FFFFh followed with the number of identity mappings.
For example, an implementation may represent the first 100 (64h) character mappings with the following eight entries of a compressed Up-case Table:
The first two entries indicate the first 97 (61h) characters (from 0000h to 0060h) have identity mappings. The subsequent characters, 0061h through 0063h, map to characters 0041h through 0043h, respectively.
The ability to provide a compressed Up-case Table upon formatting a volume is optional. However, the ability to interpret both an uncompressed and a compressed Up-case Table is mandatory.
Due to the relationship between the Up-case Table and file names, implementations shall not modify the Up-case Table on the volume.
Volume Label Directory Entry
The Volume Label is a Unicode string which enables end users to distinguish their storage volumes. In the exFAT file system, the Volume Label exists as a critical primary directory entry in the root directory (see Table 23). The valid number of Volume Label directory entries ranges from 0 to 1.
EntryType Field
The EntryType field conforms to the definition the Generic Primary DirectoryEntry template provides.
TypeCode Field
The TypeCode field conforms to the definition the Generic Primary DirectoryEntry template provides.
For the Volume Label directory entry, the valid value for this field is 3.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic Primary DirectoryEntry template provides.
For the Volume Label directory entry, the valid value for this field is 0.
TypeCategory Field
The TypeCategory field conforms to the definition the Generic Primary DirectoryEntry template provides.
In Use Field
The InUse field conforms to the definition the Generic Primary DirectoryEntry template provides.
CharacterCount Field
The CharacterCount field contains the length of the Unicode string the VolumeLabel field contains.
The valid range of values for this field is:
The VolumeLabel field contains a Unicode string, which is the user-friendly name of the volume. The VolumeLabel field has the same set of invalid characters as the FileName field of the File Name directory entry.
File Directory Entry
File directory entries describe files and directories. They are critical primary directory entries and any directory may contain zero or more File directory entries (see Table 24). For a File directory entry to be valid, at most one Stream Extension directory entry and at least one File Name directory entry immediately follow the File directory entry.
EntryType Field
The EntryType field conforms to the definition the Generic Primary DirectoryEntry template provides.
TypeCode Field
The TypeCode field conforms to the definition the Generic Primary DirectoryEntry template provides.
For a File directory entry, the valid value for this field is 5.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic Primary DirectoryEntry template provides.
For a File directory entry, the valid value for this field is 0.
TypeCategory Field
The TypeCategory field conforms to the definition the Generic Primary DirectoryEntry template provides.
In Use Field
The InUse field conforms to the definition the Generic Primary DirectoryEntry template provides.
SecondaryCount Field
The SecondaryCount field conforms to the definition the Generic Primary DirectoryEntry template provides.
SetChecksum Field
The SetChecksum field conforms to the definition the Generic Primary DirectoryEntry template provides.
FileAttributes Field
The FileAttributes field contains flags (see Table 25).
CreateTimestamp and Create10msIncrement Fields
In combination, the CreateTimestamp and CreateTime10msIncrement fields describe the date and time the given file/directory was created.
These two fields conform to the definitions of the Timestamp and 10msIncrement fields.
LastModifiedTimestamp and LastModified10msIncrement Fields
In combination, the LastModifiedTimestamp and LastModifiedTime10msIncrement fields describe the date and time any of the cluster allocations associated with the given directory entry set was last modified.
These two fields conform to the definitions of the Timestamp and 10msIncrement fields.
LastAccessedTimestamp and LastAccessed10msIncrement Fields
In combination, the LastAccessedTimestamp and LastAccessedTime10msIncrement fields describe the date and time any of the cluster allocations associated with the given directory entry set was last accessed (which includes read operations).
These two fields conform to the definitions of the Timestamp and 10msIncrement fields.
Timestamp Fields
Timestamp fields describe both local date and time, down to a two-second resolution (see Table 26).
DoubleSeconds Field
The DoubleSeconds field describes the seconds portion of the Timestamp field, in two-second multiples.
The valid range of values for this field is:
The Minute field describes the minutes portion of the Timestamp field.
The valid range of values for this field is:
The Hour field describes the hours portion of the Timestamp field.
The valid range of values for this field is:
The Day field describes the day portion of the Timestamp field.
The valid range of values for this field is:
Month Field
The Month field describes the month portion of the Timestamp field.
The valid range of values for this field is:
The Year field describes the year portion of the Timestamp field, relative to the year 1980. This field represents the year 1980 with the value 0 and the year 2107 with the value 127.
All possible values for this field are valid.
10msIncrement Fields
10msIncrement fields provide additional time resolution to their corresponding Timestamp fields in ten-millisecond multiples.
The valid range of values for these fields is:
The Volume GUID directory entry contains a GUID which enables implementations to uniquely and programmatically distinguish volumes. The Volume GUID exists as a benign primary directory entry in the root directory (see Table 27). The valid number of Volume GUID directory entries ranges from 0 to 1.
EntryType Field
The EntryType field conforms to the definition the Generic Primary DirectoryEntry template provides.
TypeCode Field
The TypeCode field conforms to the definition the Generic Primary DirectoryEntry template provides.
For the Volume GUID directory entry, the valid value for this field is 0.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic Primary DirectoryEntry template provides.
For the Volume GUID directory entry, the valid value for this field is 1.
TypeCategory Field
The TypeCategory field conforms to the definition the Generic Primary DirectoryEntry template provides.
In Use Field
The InUse field conforms to the definition the Generic Primary DirectoryEntry template provides.
SecondaryCount Field
The SecondaryCount field conforms to the definition the Generic Primary DirectoryEntry template provides.
For the Volume GUID directory entry, the valid value for this field is 0.
SetChecksum Field
The SetChecksum field conforms to the definition the Generic Primary DirectoryEntry template provides.
GeneralPrimaryFlags Field
The GeneralPrimaryFlags field conforms to the definition the Generic Primary DirectoryEntry template provides and defines the contents of the CustomDefined field to be reserved.
AllocationPossible Field
The AllocationPossible field conforms to the definition the Generic Primary DirectoryEntry template provides.
For the Volume GUID directory entry, the valid value for this field is 0.
NoFatChain Field
The NoFatChain field conforms to the definition the Generic Primary DirectoryEntry template provides.
VolumeGuid Field
The VolumeGuid field contains a GUID which uniquely identifies the given volume.
All possible values for this field are valid, except the null GUID, which is {00000000-0000-0000-0000-000000000000}.
TexFAT Padding Directory Entry
TexFAT Padding directory entries are useful in the context of TexFAT semantics. They are benign primary directory entries and are only valid in the first cluster of a directory and occupy every directory entry in the cluster.
This appendix, exFAT Revision 1.00 File System Basic Appendix, does not define the TexFAT Padding directory entry. However, its type code is 1 and its type importance is 1. Implementations of this appendix shall treat TexFAT Padding directory entries the same as any other unrecognized benign primary directory entries, except implementations shall not move TexFAT Padding directory entries.
Windows CE Access Control Table Directory Entry
The Windows CE Access Control Table directory entry is useful in the context of Windows CE applications. It exists as a benign primary directory entry in the root directory. The valid number of Windows CE Access Control Table directory entries ranges from 0 to 1.
This appendix, exFAT Revision 1.00 File System Basic Appendix, does not define the Windows CE Access Control Table directory entry. However, its type code is 2 and its type importance is 1. Implementations of this appendix shall treat the Windows CE Access Control Table directory entry the same as any other unrecognized benign primary directory entry.
Stream Extension Directory Entry
The Stream Extension directory entry is a critical secondary directory entry in File directory entry sets (see Table 28). The valid number of Stream Extension directory entries in a File directory entry set is 1. Further, this directory entry is valid only if it immediately follows the File directory entry.
EntryType Field
The EntryType field conforms to the definition the Generic Secondary DirectoryEntry template provides.
TypeCode Field
The TypeCode field conforms to the definition the Generic Secondary DirectoryEntry template provides.
For the Stream Extension directory entry, the valid value for this field is 0.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic Secondary DirectoryEntry template provides.
For the Stream Extension directory entry, the valid value for this field is 0.
TypeCategory Field
The TypeCategory field conforms to the definition the Generic Secondary DirectoryEntry template provides.
In Use Field
The InUse field conforms to the definition the Generic Secondary DirectoryEntry template provides.
GeneralSecondaryFlags Field
The GeneralSecondaryFlags field conforms to the definition the Generic Secondary DirectoryEntry template provides and defines the contents of the CustomDefined field to be reserved.
AllocationPossible Field
The AllocationPossible field conforms to the definition the Generic Secondary DirectoryEntry template provides.
For the Stream Extension directory entry, the valid value for this field is 1.
NoFatChain Field
The NoFatChain field conforms to the definition the Generic Secondary DirectoryEntry template provides.
NameLength Field
The NameLength field contains the length of the Unicode string the subsequent File Name directory entries collectively contain.
All possible values of this field are valid.
NameHash Field
The NameHash field contains a 2-byte hash (see
ValidDataLength Field
The ValidDataLength field describes how far into the data stream user data has been written. Implementations shall update this field as they write data further out into the data stream. On the storage media, the data between the valid data length and the data length of the data stream is undefined. Implementations shall return zeroes for read operations beyond the valid data length.
If the corresponding File directory entry describes a directory, then the only valid value for this field is equal to the value of the DataLength field. Otherwise, the range of valid values for this field is:
The FirstCluster field conforms to the definition the Generic Secondary DirectoryEntry template provides.
This field contains the index of the first cluster of the data stream, which hosts the user data.
DataLength Field
The DataLength field conforms to the definition the Generic Secondary DirectoryEntry template provides.
If the corresponding File directory entry describes a directory, then the valid value for this field is the entire size of the associated allocation, in bytes, which may be 0. Further, for directories, the maximum value for this field is 256 MB.
File Name Directory Entry
File Name directory entries are critical secondary directory entries in File directory entry sets (see Table 29). The valid number of File Name directory entries in a File directory entry set is NameLength/15, rounded up to the nearest integer. Further, File Name directory entries are valid only if they immediately follow the Stream Extension directory entry as a consecutive series. File Name directory entries combine to form the file name for the File directory entry set.
EntryType Field
The EntryType field conforms to the definition the Generic Secondary DirectoryEntry template provides.
TypeCode Field
The TypeCode field conforms to the definition the Generic Secondary DirectoryEntry template provides.
For the Stream Extension directory entry, the valid value for this field is 1.
TypeImportance Field
The TypeImportance field conforms to the definition the Generic Secondary DirectoryEntry template provides.
For the Stream Extension directory entry, the valid value for this field is 0.
TypeCategory Field
The TypeCategory field conforms to the definition the Generic Secondary DirectoryEntry template provides.
In Use Field
The InUse field conforms to the definition the Generic Secondary DirectoryEntry template provides.
GeneralSecondaryFlags Field
The GeneralSecondaryFlags field conforms to the definition the Generic Secondary DirectoryEntry template provides and defines the contents of the CustomDefined field to be reserved.
AllocationPossible Field
The AllocationPossible field conforms to the definition the Generic Secondary DirectoryEntry template provides.
For the Stream Extension directory entry, the valid value for this field is 0.
NoFatChain Field
The NoFatChain field conforms to the definition the Generic Secondary DirectoryEntry template provides.
FileName Field
The FileName field contains a Unicode string, which is a portion of the file name. In the order File Name directory entries exist in a File directory entry set, FileName fields concatenate to form the file name for the File directory entry set. Given the length of the FileName field, 15 characters, and the maximum number of File Name directory entries, 17, the maximum length of the final, concatenated file name is 255.
The concatenated file name has the same set of illegal characters as other FAT-based file systems (see Table 30). Implementations should set the unused characters of FileName fields to the value 0000h.
The file names “.” and “..” have the special meaning of “this directory” and “containing directory”, respectively. Implementations shall not record either file name in the FileName field. However, implementations may generate these two file names in directory listings to refer to the directory being listed and the containing directory.
This application is a divisional of U.S. application Ser. No. 13/685,018, entitled QUICK FILENAME LOOKUP USING NAME HASH, filed on Nov. 26, 2012, which is a divisional of U.S. application Ser. No. 12/389,396, entitled QUICK FILENAME LOOKUP USING NAME HASH, filed on Feb. 20, 2009, which claims the benefit of U.S. Provisional Application No. 61/030,043, entitled FILE ALLOCATION TABLE, filed on Feb. 20, 2008; U.S. application Ser. No. 12/389,396 is also a continuation-in-part of U.S. Non-Provisional application Ser. No. 11/229,485, entitled EXTENSIBLE FILE SYSTEM, filed on Sep. 16, 2005, which claims the benefit of U.S. Provisional Application No. 60/637,407, entitled FILE SYSTEM FORMAT FOR PORTABLE MEDIA, and filed on Dec. 17, 2004; The contents of U.S. application Ser. No. 12/389,396, U.S. application Ser. No. 11/229,485, U.S. Provisional Application No. 60/637,407, and U.S. Provisional Application No. 61/030,043 are incorporated by reference herein in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
4780821 | Crossley | Oct 1988 | A |
4987531 | Nishikado et al. | Jan 1991 | A |
5083264 | Platteter et al. | Jan 1992 | A |
5086502 | Malcom | Feb 1992 | A |
5201044 | Frey, Jr. et al. | Apr 1993 | A |
5202982 | Gramlich et al. | Apr 1993 | A |
5297148 | Harari et al. | Mar 1994 | A |
5307494 | Yasumatsu et al. | Apr 1994 | A |
5313646 | Hendricks et al. | May 1994 | A |
5359725 | Garcia et al. | Oct 1994 | A |
5363487 | Willman et al. | Nov 1994 | A |
5367671 | Feigenbaum et al. | Nov 1994 | A |
5371885 | Letwin | Dec 1994 | A |
5388257 | Bauer | Feb 1995 | A |
5392427 | Barrett et al. | Feb 1995 | A |
5412808 | Bauer | May 1995 | A |
5421001 | Methe | May 1995 | A |
5434974 | Loucks et al. | Jul 1995 | A |
5437029 | Sinha | Jul 1995 | A |
5469562 | Saether | Nov 1995 | A |
5483652 | Sudama et al. | Jan 1996 | A |
5535375 | Eshel et al. | Jul 1996 | A |
5537636 | Uchida et al. | Jul 1996 | A |
5546389 | Wippenbeck et al. | Aug 1996 | A |
5574907 | Jernigan et al. | Nov 1996 | A |
5579517 | Reynolds et al. | Nov 1996 | A |
5596755 | Pletcher et al. | Jan 1997 | A |
5627996 | Bauer | May 1997 | A |
5694606 | Pletcher et al. | Dec 1997 | A |
5699548 | Choudhury et al. | Dec 1997 | A |
5732268 | Bizzarri | Mar 1998 | A |
5734340 | Kennedy | Mar 1998 | A |
5745752 | Hurvig et al. | Apr 1998 | A |
5745902 | Miller et al. | Apr 1998 | A |
5754848 | Hanes | May 1998 | A |
5758352 | Reynolds et al. | May 1998 | A |
5761675 | Isenberg | Jun 1998 | A |
5761677 | Senator et al. | Jun 1998 | A |
5765169 | Conner | Jun 1998 | A |
5778168 | Fuller | Jul 1998 | A |
5813011 | Yoshida et al. | Sep 1998 | A |
5819275 | Badger et al. | Oct 1998 | A |
5825734 | Igarashi et al. | Oct 1998 | A |
5832515 | Ledain et al. | Nov 1998 | A |
5850506 | Gordons et al. | Dec 1998 | A |
5898868 | Krueger et al. | Apr 1999 | A |
5907672 | Matze et al. | May 1999 | A |
5923884 | Peyret et al. | Jul 1999 | A |
5926805 | Hurvig et al. | Jul 1999 | A |
5930828 | Jensen et al. | Jul 1999 | A |
5968127 | Kawabe | Oct 1999 | A |
5983240 | Shoroff et al. | Nov 1999 | A |
6023744 | Shoroff et al. | Feb 2000 | A |
6032223 | Beelitz | Feb 2000 | A |
6037738 | Morita et al. | Mar 2000 | A |
6038636 | Brown et al. | Mar 2000 | A |
6049807 | Carroll et al. | Apr 2000 | A |
6055527 | Badger et al. | Apr 2000 | A |
6078999 | Raju et al. | Jun 2000 | A |
6081804 | Smith | Jun 2000 | A |
6108759 | Orcutt et al. | Aug 2000 | A |
6144969 | Inokuchi | Nov 2000 | A |
6192432 | Slivka et al. | Feb 2001 | B1 |
6205558 | Sobel | Mar 2001 | B1 |
6253300 | Lawrence et al. | Jun 2001 | B1 |
6286013 | Reynolds et al. | Sep 2001 | B1 |
6286113 | Sembach et al. | Sep 2001 | B1 |
6374265 | Chen et al. | Apr 2002 | B1 |
6374268 | Testardi | Apr 2002 | B1 |
6377958 | Orcutt | Apr 2002 | B1 |
6378031 | Kuno et al. | Apr 2002 | B1 |
6427123 | Sedlar | Jul 2002 | B1 |
6470345 | Doutre et al. | Oct 2002 | B1 |
6510552 | Benayoun et al. | Jan 2003 | B1 |
6529966 | Willman et al. | Mar 2003 | B1 |
6571259 | Zheng et al. | May 2003 | B1 |
6594725 | Ando et al. | Jul 2003 | B2 |
6611907 | Maeda et al. | Aug 2003 | B1 |
6612490 | Herrendoerfer et al. | Sep 2003 | B1 |
6615365 | Jenevein et al. | Sep 2003 | B1 |
6615404 | Garfunkel et al. | Sep 2003 | B1 |
6654772 | Crow et al. | Nov 2003 | B1 |
6658437 | Lehman | Dec 2003 | B1 |
6662309 | Ando et al. | Dec 2003 | B2 |
6675180 | Yamashita | Jan 2004 | B2 |
6792518 | Armangau et al. | Sep 2004 | B2 |
6856993 | Verma et al. | Feb 2005 | B1 |
6883114 | Lasser | Apr 2005 | B2 |
6907184 | Yokota et al. | Jun 2005 | B1 |
6922708 | Sedlar | Jul 2005 | B1 |
7032107 | Stutton et al. | Apr 2006 | B2 |
7051251 | Moore et al. | May 2006 | B2 |
7062602 | Moore et al. | Jun 2006 | B1 |
7072917 | Wong et al. | Jul 2006 | B2 |
7089448 | Hinshaw et al. | Aug 2006 | B2 |
7092870 | Chen | Aug 2006 | B1 |
7174420 | Malueg et al. | Feb 2007 | B2 |
7274857 | Nallur et al. | Sep 2007 | B2 |
7363540 | Patel et al. | Apr 2008 | B2 |
7380140 | Weissman et al. | May 2008 | B1 |
7380157 | Brewer et al. | May 2008 | B2 |
7383288 | Miloushev et al. | Jun 2008 | B2 |
7493445 | Harada | Feb 2009 | B2 |
7613738 | Patel et al. | Nov 2009 | B2 |
7620620 | Sedlar | Nov 2009 | B1 |
7676491 | Jansen et al. | Mar 2010 | B2 |
7685171 | Beaverson et al. | Mar 2010 | B1 |
7747664 | Patel et al. | Jun 2010 | B2 |
7757100 | Weissman et al. | Jul 2010 | B2 |
7873596 | Pudipeddi et al. | Jan 2011 | B2 |
7941435 | Kao et al. | May 2011 | B2 |
7979409 | Kime | Jul 2011 | B2 |
8001165 | Patel et al. | Aug 2011 | B2 |
8024383 | Patel et al. | Sep 2011 | B2 |
8024507 | Patel et al. | Sep 2011 | B2 |
8156165 | Malueg et al. | Apr 2012 | B2 |
8321439 | Pudipeddi et al. | Nov 2012 | B2 |
8352697 | Lasser | Jan 2013 | B2 |
8364732 | Pudipeddi et al. | Jan 2013 | B2 |
8433677 | Pudipeddi et al. | Apr 2013 | B2 |
8452729 | Pudipeddi et al. | May 2013 | B2 |
8583708 | Pudipeddi et al. | Nov 2013 | B2 |
8606830 | Pudipeddi et al. | Dec 2013 | B2 |
8725772 | Pudipeddi et al. | May 2014 | B2 |
20010016841 | Karasudani | Aug 2001 | A1 |
20010054129 | Wouters | Dec 2001 | A1 |
20020040361 | Tikkanen | Apr 2002 | A1 |
20020042796 | Igakura | Apr 2002 | A1 |
20020062301 | Rudoff et al. | May 2002 | A1 |
20020116406 | Goldick | Aug 2002 | A1 |
20020152354 | Harmer | Oct 2002 | A1 |
20030028765 | Cromer et al. | Feb 2003 | A1 |
20030088587 | Merrells | May 2003 | A1 |
20030105781 | Morris | Jun 2003 | A1 |
20030135650 | Kana et al. | Jul 2003 | A1 |
20030163802 | Takahashi | Aug 2003 | A1 |
20030177107 | Brown et al. | Sep 2003 | A1 |
20030182330 | Manley et al. | Sep 2003 | A1 |
20030221095 | Gaunt et al. | Nov 2003 | A1 |
20030233385 | Srinivasa et al. | Dec 2003 | A1 |
20040003289 | Bhogal et al. | Jan 2004 | A1 |
20040030847 | Tremaine | Feb 2004 | A1 |
20040064483 | Bulka et al. | Apr 2004 | A1 |
20040078704 | Malueg et al. | Apr 2004 | A1 |
20040210706 | In et al. | Oct 2004 | A1 |
20040215600 | Aridor | Oct 2004 | A1 |
20040250172 | Patel et al. | Dec 2004 | A1 |
20050015354 | Grubbs | Jan 2005 | A1 |
20050027746 | Lin et al. | Feb 2005 | A1 |
20050060316 | Kamath et al. | Mar 2005 | A1 |
20050172005 | Goodwin | Aug 2005 | A1 |
20050246612 | Leis | Nov 2005 | A1 |
20050256838 | Lasser | Nov 2005 | A1 |
20060020745 | Conley et al. | Jan 2006 | A1 |
20060095649 | Netter et al. | May 2006 | A1 |
20060136529 | Pudipeddi et al. | Jun 2006 | A1 |
20060224578 | Kadatch et al. | Oct 2006 | A1 |
20070136387 | Malueg et al. | Jun 2007 | A1 |
20070239957 | Lin | Oct 2007 | A1 |
20080091702 | Pudipeddi et al. | Apr 2008 | A1 |
20080168029 | Pudipeddi et al. | Jul 2008 | A1 |
20080172425 | Patel et al. | Jul 2008 | A1 |
20080172426 | Patel et al. | Jul 2008 | A1 |
20080177939 | Patel et al. | Jul 2008 | A1 |
20080215646 | Pudipeddi et al. | Sep 2008 | A1 |
20080215647 | Pudipeddi et al. | Sep 2008 | A1 |
20090164440 | Pudipeddi et al. | Jun 2009 | A1 |
20090164539 | Pudipeddi et al. | Jun 2009 | A1 |
20090265400 | Pudipeddi et al. | Oct 2009 | A1 |
20100049776 | Patel et al. | Feb 2010 | A1 |
20100217788 | Patel et al. | Aug 2010 | A1 |
20120011177 | Patel et al. | Jan 2012 | A1 |
20120011179 | Patel et al. | Jan 2012 | A1 |
20130080485 | Pudipeddi et al. | Mar 2013 | A1 |
Number | Date | Country |
---|---|---|
1477518 | Feb 2004 | CN |
1790328 | Jun 2006 | CN |
0462587 | Dec 1991 | EP |
0618540 | Oct 1994 | EP |
1376405 | Jan 2004 | EP |
1677214 | Jul 2006 | EP |
64-041039 | Feb 1989 | JP |
01-315843 | Dec 1989 | JP |
02-148341 | Jun 1990 | JP |
03-017753 | Jan 1991 | JP |
04-188239 | Jul 1992 | JP |
60-019763 | Jan 1994 | JP |
06-103140 | Apr 1994 | JP |
07-234879 | Sep 1995 | JP |
2001-160068 | Jun 2001 | JP |
2001-325134 | Nov 2001 | JP |
2002-099454 | Apr 2002 | JP |
2002-132566 | May 2002 | JP |
2003-162709 | Jun 2003 | JP |
2003-345708 | Dec 2003 | JP |
2004-288007 | Oct 2004 | JP |
2159467 | Nov 2000 | RU |
2170454 | Jul 2001 | RU |
533377 | May 2003 | TW |
WO 2001011486 | Feb 2001 | WO |
Entry |
---|
Athicha Muthitacharoen, Benjie Chen, and David Mazi' eres. A low-bandwidth network file system. In Proceedings of the 18th ACM Symposium on Operating Systems Principles, 2001. 6 pages (Year: 2001). |
“Above Software Introduces Golden Retriever 2.0b,” News Release, Dateline: Irvine, California, Mar. 29, 1993. |
“File Sharing Protocol,” Microsoft Corporation, Nov. 7, 1988. |
“Long Filenames,” Article 15, pp. 19-47, date unknown. |
“The Intelligent Way to Search”, News Release, Dateline: Burlington, Massachusetts, Oct. 1987. |
“World Software Corporation (WSC) Launches Extend-a-name in Europe,” Computer Product Update, Jul. 27, 1990. |
Australian Patent Application No. 2005229678: Rejection dated May 17, 2010, 1 page. |
Bonner, P., “Build a Document Manager under Windows,” PC/Computing 4 (2):275(7), Dec. 1991. |
Bonner, P., “What's in a Name?” PC/Computing 2(9):169(2), Sep. 1989. |
Chile Patent Application No. 2936-05: Rejection dated Nov. 11, 2005, 6 pages. |
China Patent Application No. 200510125054.1: Rejection dated Jul. 4, 2008, 8 pages. |
China Patent Office Application No. 200510125054.1: Rejection dated Jan. 15, 2010, 9 pages. |
Duncan, R. “Design Goals and Implementation of the New High Performance File System,” Microsoft Systems Journal 4(5):1-13, Sep. 1989. |
Duncan, R., “Power Programming Using Long Filenames and Extended Attributes, Part 1,” PC Magazine 9(8):317-322, Apr. 24, 1990. |
Duncan, R., “Power Programming Using Long Filenames and Extended Attributes, Part II,” PC Magazine 9(9):305-310, May 15, 1990. |
EP Patent Application No. 05111554.1: Rejection dated Jun. 24, 2009, 4 pages. |
Glass, B., “Create Your Own Environment,” PC-Computing 3(10):106-110, Oct. 1990. |
Hurwicz, M., “MS-DOS 3.1 Makes It Easy to Use IBM PCs on a Network,” Data Communications, Nov. 1985, pp. 223-237. |
Israel Patent Application No. 172014: Rejection dated Dec. 17, 2009, 2 pages. |
Karpovich et al., “Extensible File System (ELFS): An Object-Oriented Approach to High Performance File 1/0”, OOPSLA 1994-Proceedings of the Ninth Annual Conference on Object-Oriented Programming Systems, Language and Applications, ACM SIGPLAN Notices, Oct. 1994, 29(10), 191-204. |
Khalidi et al., “Extensible File System in Spring”, Sun Microsystems Laboratories, Inc., Sep. 1993, 1-18. |
Leffler, S.J., et al., “The Design and Implementation of the 4.3BSD UNIX Operating System,” Addison-Wesley Publishing Company, New York, 1989, Chap.2, “Design Overview of 4.3BSD,” pp. 34-36. |
Lent, A.F. and S. Miastkowski, “New, Improved Windows,”PC World 11(12):252(17), Dec. 1993. |
Mallory, J., “Breakthrough on DOS Filename Limits,” Newsbytes News Network, Apr. 12, 1993, <http://calbears.findarticles.com/p/articlerohs/mi_mONEW/is_1993_April_12/ai_13786607/print>[retrieved May 24, 2006]. |
McCormick, J., “Presentation Manager Under OS/2 Encourages Lengthy Name-Calling,” Government Computer News D 9(1):16, 18, May 14, 1990. |
Mexican Patent Application No. PNa/2005/012405: Rejection dated Mar. 10, 2010,4 pages. |
Mexican Patent Application No. PNa/2005/012405: Rejection dated May 6, 2009, 2 pages. |
O'Malley, C., “Fetching Desktop Files: Standalone Document Managers,” Windows Sources 1(2):443-444, Mar. 1993. |
Rohan, R., “Golden Retriever Fetches Files in Windows,” Computer Shopper 12(11):947, Nov. 1992. |
Russian Application No. 2005134810/09: Office Action dated Dec. 14, 2009, citing the Russian Counterpart RU 2159467 of 5,923,884, Peyret et al. |
Russian Patent Application No. 2005134810/09: Rejection dated Sep. 11, 2005, 5 pages. |
Tanenbaum, A.S. (ed), MINIX Operating System, Keiichiro Sakamoto, Tokyo, Japan, 1989, Chap. 5, “File System,” pp. 310-313 (English translation of Japanese publication). |
Tanenbaum, A.S., “Modem Operating Systems”, 2nd ed., Prentice Hall, Englewood Cliffs, NJ, 2001, pp. 442-445, 830-834, 835-839. |
Trivette, D.B., “Utility Provides 50-Character Filenames,” PC Magazine 7(16):56, Sep. 27, 1988. |
Wang, “Universal_File_Names for Ada,” Ada Letters 10(1):111-117, Jan./Feb. 1990. |
Takenori Yamamori, “Guide to Rise Higher than a Novice, PC UNIX Deciphered from Boot Files,” Software Design, No. 131, pp. 110-121, Gijutsu-Hyohron Co., Ltd., Japan, Sep. 18, 2001. |
Hiroo Shirasaki, “Observe the Boot Process of FreeBSD 14,” UNIX Magazine, vol. 20, No. 2, pp. 91-99, ASCII Corporation, Japan, Feb. 1, 2005. |
Japanese Patent Application No. 2012-040595: English translation of Notice of Rejection dated Mar. 26, 2013, 2 pages. |
“Reverse Engineering the Microsoft exFAT File System”, Retrieved from <<https://www.sans.org/reading-room/whitepapers/forensics/reverse-engineering-microsoft-exfat-file-system-33274>>, Dec. 1, 2009, 86 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 15/411,376”, dated Apr. 7, 2017, 10 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 11/229,485”, dated Mar. 30, 2012, 20 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 11/229,485”, dated Nov. 7, 2007, 14 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 11/229,485”, dated Jan. 15, 2009, 11 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 11/229,485”, dated Feb. 22, 2010, 11 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/052,584”, dated Aug. 17, 2011, 10 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/052,584”, dated Jun. 14, 2010, 18 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/052,584”, dated Feb. 29, 2012, 11 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/052,594”, dated Jun. 12, 2012, 21 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/052,594”, dated Aug. 6, 2010, 16 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/493,172”, dated Aug. 31, 2011, 16 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/493,172”, dated Jun. 17, 2014, 23 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 14/075,525”, dated Jul. 28, 2014, 10 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 14/099,307”, dated Apr. 8, 2015, 11 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 14/099,307”, dated Oct. 23, 2015, 10 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 14/815,076”, dated Feb. 26, 2016, 7 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/052,603”, dated Aug. 24, 2010, 11 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/052,603”, dated Dec. 17, 2013, 13 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 12/052,603”, dated Jul. 6, 2012, 11 Pages. |
Otoo, et al., “Non-shared Disk Cluster-A Fault Tolerant, Commodity Approach to Hi-Bandwidth Data Analysis”, Retreived from: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.133.7039&rep=rep1&type=pdf, Retrieved on: Sep. 2001, 5 Pages. |
“Office Action and Search Report Issued in Norway Patent Application No. 20151214”, dated Oct. 27, 2015, 5 Pages. |
“Office Action and Search Report Issued in Taiwan Patent Application No. 094139703”, dated Oct. 5, 2012, 10 Pages. |
“Office Action Issued in Australian Patent Application No. 2011200838”, dated May 18, 2011, 1 Page. |
“Office Action Issued in Brazil Patent Application No. PI 0520885-8”, dated May 30, 2017, 6 Pages. |
PI0505077-4“Office Action Issued in Brazil Patent Application No. PI0505077-4”, dated May 30, 2017, 7 Pages. |
“Office Action Issued in Canadian Patent Application No. 2,527,060”, dated Sep. 5, 2012, 2 Pages. |
“Office Action Issued in Canadian Patent Application No. 2,527,060”, dated Mar. 25, 2014, 3 Pages. |
“Office Action Issued in Canadian Patent Application No. 2,820,339”, dated Apr. 28, 2015, 5 Pages. |
“Office Action Issued in European Application No. 10012810.7”, dated Sep. 21, 2018, 4 Pages. |
“Office Action Issued in European Application No. 10012811.5”, dated Sep. 20, 2018, 5 Pages. |
“Office Action Issued in European Patent Application No. 05111554.1”, dated Dec. 20, 2007, 7 Pages. |
“Office Action Issued in European Patent Application No. 05111554.1”, dated Sep. 23, 2010, 14 Pages. |
“Office Action Issued in European Patent Application No. 05111554.1”, dated Jul. 18, 2013, 8 Pages. |
“Office Action Issued in European Patent Application No. 10012810.7”, dated Jan. 5, 2012, 7 Pages. |
“Office Action Issued in European Patent Application No. 10012810.7”, dated Jul. 28, 2015, 4 Pages. |
“Office Action Issued in European Patent Application No. 10012811.5”, dated Dec. 21, 2011, 4 Pages. |
“Office Action Issued in European Patent Application No. 10012811.5”, dated Jul. 28, 2015, 4 Pages. |
“Office Action Issued in Indian Patent Application No. 3021/DEL/2005”, dated Dec. 19, 2013,1 Page. |
“Office Action Issued in Indonesia Patent Application No. P00200500645”, dated May 14, 2010, 2 Pages. |
“Office Action Issued in Indonesian Patent Application No. P00201100295”, dated Sep. 28, 2012, 1 Page. |
“Office Action Issued in Israel Patent Application No. 172014”, dated Aug. 31, 2014, 1 Page. (W/o English Translation). |
“Office Action Issued in Israel Patent Application No. 172014”, dated Oct. 15, 2013, 7 Pages. |
“Office Action Issued in Japanese Patent Application No. 2005-364036”, dated Jun. 3, 2011, 6 Pages. |
“Office Action Issued in Japanese Patent Application No. 2005-364036”, dated Oct. 25, 2011, 4 Pages. |
“Office Action Issued in Japanese Patent Application No. 2010-129852”, dated Apr. 13, 2012, 4 Pages. |
“Office Action Issued in Japanese Patent Application No. 2010-129852”, dated Sep. 7, 2012, 4 Pages. |
“Office Action Issued in Japanese Patent Application No. 2013-000671”, dated Oct. 15, 2013, 4 Pages. |
“Office Action Issued in Korean Patent Application No. 10-2005-0110061”, dated Jun. 20, 2012, 4 Pages. |
“Office Action Issued in Korean Patent Application No. 10-2010-0112978”, dated Jun. 20, 2012, 7 Pages. |
“Office Action Issued in Malaysian Patent Application No. PI 20055510”, dated Jun. 29, 2012, 4 Pages. |
“Office Action Issued in Mexico Patent Application No. MX/a/2010/012831”, dated Mar. 22, 2013, 4 Pages. (w/o English Translation). |
“Office Action Issued in Norway Patent Application No. 20056016”, dated Jan. 27, 2015, 3 Pages. |
“Office Action Issued in Norway Patent Application No. 20056016”, dated Mar. 26, 2014, 6 Pages. |
“Office Action Issued in Norway Patent Application No. 20161346”, dated Dec. 28, 2016, 5 Pages. |
“Office Action Issued in Philippines Patent Application No. 1-2011-000219”, dated Feb. 12, 2018, 3 Pages. |
“Office Action Issued in Philippines Patent Application No. PH/1/2005/563”, dated Aug. 26, 2008, 1 Page. |
“Office Action Issued in Philippines Patent Application No. PH/1/2005/563”, dated Apr. 29, 2011, 1 Page. |
“Office Action Issued in Philippines Patent Application No. PH/1/2011/219”, dated Oct. 21, 2011, 1 Page. |
“Office Action Issued in Philippines Patent Application No. PH/1/2011/219”, dated Oct. 27, 2014, 1 Page. |
“Office Action Issued in Russian Patent Application No. 2005134810”, dated Oct. 12, 2010, 4 Pages. (w/o English Translation). |
“Office Action Issued in Russian Patent Application No. 2010119961”, dated Feb. 17, 2015, 5 Pages. (w/o English Translation). |
“Office Action Issued in Russian Patent Application No. 2011106779”, dated Feb. 6, 2015, 3 Pages. (w/o English Translation). |
“Office Action Issued in Singapore Patent Application No. 200507941-3”, dated Feb. 19, 2007, 7 Pages. |
“Office Action Issued in Taiwan Patent Application No. 102144605”, dated Aug. 19, 2016, 4 Pages. (w/o English Translation). |
“Office Action Issued in Taiwan Patent Application No. 102144605”, dated Nov. 24, 2015, 7 Pages. (w/o English Translation). |
“Office Action Issued in Taiwan Patent Application No. 094139703”, dated Mar. 25, 2013, 3 Pages. (w/o English Translation). |
“Oral Hearing Issued in European Patent Application No. 05111554.1”, dated Oct. 6, 2015, 10 Pages. |
Gooch, et al., “Overview of the Linux Virtual File Systems”, Retrieved From : https://www.kernel.org/doc/Documentation/filesystems/vfs.txt, Jun. 24, 2007, 18 Pages. |
“Second Office Action and Search Report Issued in Chinese Patent Application No. 201210063035.0”, dated Sep. 2, 2014, 13 Pages. |
Chiung-San, Lee, “Server-Based Maintenance Approach for Computer Classroom Workstations”, In Proceedings of the IEICE Transactions on Information and Systems, vol. 83, Issue 4, Apr. 25, 2000, pp. 807-814. |
De Jonge, et al., “The Logical Disk: A New Approach to Improving File Systems”, In Proceedings of the Fourteenth ACM Symposium on Operating Systems Principles, Jan. 1994, pp. 15-28. |
Chen, et al., “The Rio File Cache: Surviving Operating System Crashes”, In Proceedings of the ACM SIGPLAN Notices, vol. 31, Issue 9, Oct. 1, 1996, 11 Pages. |
“Third Office Action Issued in Chinese Patent Application No. 200510125054.1”, dated Jul. 13, 2011, 6 Pages. |
“Transactional File Access”, In Proceedings of the Commons Transactions by Apache Commons, Version: 1.3-Snapshot, Jun. 2, 2005, 1 Page. |
“Transaction-Safe Fat File System”, Retrieved from: <<https://msdn.microsoft.com/en-us/library/aa516909.aspx>>, Retrieved on: May 30, 2006, 1 Page. |
“Universal Disk Format Specification”, Retrieved from: http://www.osta.org/specs/pdf/udf250.pdf, Apr. 30, 2003, 165 Pages. |
Trivette, Donald B., “Utility Provides 60-Character Filenames”, In Proceedings of the PC Magazine, vol. 7, Issue 16, Sep. 27, 1988, 1 Page. |
Amy, Rich, “ZFS, Sun's Cutting-Edge File System (Part 1: Storage Integrity, Security, and Scalability)”, In Technical Report, Sun Microsystems, BigAdmin System Administration Portal, Aug. 2006, 8 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 15/380,341”, dated Jun. 20, 2019, 6 Pages. |
Barreto, et al., “A Highly Available Replicated File System for Resource-Constrained Windows CE .Net Devices”, In Proceedings of the 3rd International Conference on .Net Technologies, May 30, 2005, 6 Pages. |
Muthitacharoen, et al., “A low-bandwidth network file system”, In ACM SIGOPS Operating Systems Review, vol. 35, No. 5, 2001, 14 Pages. |
Farr, et al., “An Optimum Disc Organization for a Virtual Memory System”, In Proceedings of the Computer Decisions, Jun. 1971, pp. 49-53. |
Karpovich, et al., “Breaking the I/O Bottleneck at the National Radio Astronomy Observatory (NRAO)”, In Technical Report CS-94-37, University of Virginia, Department of Computer Science, Sep. 1993, 43 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 15/411,376”, dated May 22, 2018, 8 Pages. |
“Corrected Office Action Issued in Singapore Patent Application No. 200507941-3”, dated Nov. 12, 2007, 8 Pages. |
“European Search Report Issued in Application No. 10012810.7”, dated Jan. 21, 2011, 5 Pages. |
“European Search Report Issued in Application No. 10012811.5”, dated Jan. 21, 2011, 11 Pages. |
“Search Report Issued in European Patent Application No. 05111554.1”, dated May 24, 2006, 8 Pages. |
Kashyap, Aditya, “File System Extensibility and Reliability Using an in-Kernel Database”, A Thesis Presented to the Graduate School in partial fulfillment of the Requirements for the degree of Master of Science in Computer Science, Stony Brook University, Dec. 2004, 30 Pages. |
“Final Office Action Issued in U.S. Appl. No. 11/229,485”, dated Oct. 17, 2012, 18 Pages. |
“Final Office Action Issued in U.S. Appl. No. 11/229,485”, dated Nov. 12, 2010, 17 Pages. |
“Final Office Action Issued in U.S. Appl. No. 11/229,485”, dated Jul. 16, 2008, 12 Pages. |
“Final Office Action Issued in U.S. Appl. No. 11/229,485”, dated Aug. 18, 2009, 9 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/052,584”, dated Nov. 19, 2012, 11 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/052,584”, dated Jan. 20, 2011, 19 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/052,594”, dated Apr. 18, 2011, 23 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/052,594”, dated Jan. 17, 2013, 24 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/052,603”, dated Apr. 15, 2011, 12 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/052,603”, dated Dec. 19, 2012, 13 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/052,603”, dated Jul. 16, 2014, 11 Pages. |
“Final Office Action Issued in U.S. Appl. No. 14/099,307”, dated Jun. 17, 2016, 12 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/493,172”, dated Apr. 24, 2012, 25 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/493,172”, dated Nov. 21, 2013, 20 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/389,391”, dated Feb. 21, 2013, 10 Pages. |
“Final Office Action Issued in U.S. Appl. No. 13/006,063”, dated May 30, 2012, 8 Pages. |
“Final Office Action Issued in U.S. Appl. No. 13/901,997”, dated Jan. 14, 2014, 6 Pages. |
“Final Office Action Issued in U.S. Appl. No. 12/493,172”, dated Dec. 29, 2014, 23 Pages. |
“Final Office Action Issued in U.S. Appl. No. 14/075,525”, dated May 1, 2015, 12 Pages. |
“First Office Action and Search Report Issued in Chinese Patent Application No. 201210063035.0”, dated Jan. 26, 2014, 11 Pages. |
“First Office Action Issued in Chinese Patent Application No. 201010189026.7”, dated Nov. 25, 2010, 8 Pages. |
“Flush”, In Microsoft Press Computer Dictionary, Third Edition, 1997, 1 Page. |
“Fragmentation”, In Microsoft Press Computer Dictionary, Third Edition, 1997, 1 Page. |
Eager, Bob, “Implementation of Extended Attributes on the Fat File System”, Retrieved from: https://web.archive.org/web/20030211023515/http://www.tavi.co.uk/os2pages/eadata.html, Oct. 28, 2000, 3 Pages. |
Sivathanu, et al.,“Life or Death at Block-Level”, In Proceedings of the 6th Symposium on Operating Systems Design and Implementation, vol. 4, Dec. 6, 2004, 16 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 12/493,172”, dated Mar. 14, 2013, 34 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 12/389,391”, dated Jul. 31, 2012, 8 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 12/389,391”, dated Apr. 14, 2011, 12 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 13/006,088”, dated Dec. 21, 2011, 8 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 13/685,018”, dated Nov. 23, 2015, 18 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 13/875,386”, dated Jul. 30, 2013, 10 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 13/901,997”, dated Jul. 15, 2013, 6 Pages. |
“Non Final Office Action issued in U.S. Appl. No. 14/456,419”, dated Jan. 15, 2015, 6 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 11/752,872”, dated Nov. 12, 2009, 7 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 13/006,063”, dated Dec. 22, 2011, 7 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 13/006,088”, dated May 18, 2011, 8 Pages. |
“Non Final Office Action issued in U.S. Appl. No. 13/162,189”, dated Nov. 10, 2011, 7 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 12/389,396”, dated Oct. 31, 2011, 12 Pages. |
“Non Final Office Action Issued in U.S. Appl. No. 15/397,093”, dated Aug. 11, 2017, 16 Pages. |
“Office Action Issued in European Patent Application No. 10012811.5”, dated Dec. 3, 2019, 4 Pages. |
Number | Date | Country | |
---|---|---|---|
20150370821 A1 | Dec 2015 | US |
Number | Date | Country | |
---|---|---|---|
61030043 | Feb 2008 | US | |
60637407 | Dec 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13685018 | Nov 2012 | US |
Child | 14842963 | US | |
Parent | 12389396 | Feb 2009 | US |
Child | 13685018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11229485 | Sep 2005 | US |
Child | 12389396 | US |