US5761675A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Diagnosis and repair of defective long filenames
Assignee: Gen Digital Inc
•
Filing: 1996-03-19
•
Granted: 1998-06-02
•
Expires: 2016-03-19
Abstract
Abstract Defective long filenames (LFNS) are diagnosed and repaired in computer systems that have a file allocation table (FAT) structure (2) and that use both short filenames (SFNs) and long filenames (LFNs). Each LFN comprises at least one LFN entry. Defective LFN entries that are repaired are from the group comprising orphaned LFN entries, malformed LFN entries, improperly terminated chains of LFN entries, and improper matches between LFNs and corresponding SFNs.
Inventors
- 👤 Henri Isenberg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 15:59
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/14; G06F11/1402; G06F11/1415; G06F11/1435
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
79 words
A computer-implemented method for diagnosing and repairing defective long filenames (LFNs), said method comprising the steps of: providing at least one directory, wherein each directory may contain at least one entry representing a file; assigning a short filename (SFN) to each file; optionally assigning a long filename (LFN) to at least one of the files, wherein each LFN comprises at least one LFN entry; diagnosing defective LFN entries; and repairing LFN entries that have been diagnosed as being defective.
Claim 2
Dependent Claim
79 words
A computer-implemented method for diagnosing and repairing defective long filenames (LFNs), said method comprising the steps of: providing at least one directory, wherein each directory may contain at least one entry representing a file; assigning a short filename (SFN) to each file; optionally assigning a long filename (LFN) to at least one of the files, wherein each LFN comprises at least one LFN entry; diagnosing defective LFN entries; and repairing LFN entries that have been diagnosed as being defective.
Claim 3
Dependent Claim
39 words
The method of claim 1, wherein the defective LFN entries that are repaired are from the group comprising: orphaned LFN entries; malformed LFN entries; improperly terminated chains of LFN entries; and improper matches between LFN entries and corresponding SFNS.
Claim 4
Dependent Claim
41 words
The method of claim 2, wherein the malformed LFN entries are from the group comprising: LFN entries where the cluster number is non-zero; LFN entries where the type byte is non-zero; and LFN entries having filename character fields containing invalid characters.
Claim 5
Dependent Claim
26 words
The method of claim 3, wherein the malformed LFN entry has a non-zero cluster number, and the repairing step comprises setting the cluster number to zero.
Claim 6
Dependent Claim
26 words
The method of claim 3, wherein the malformed LFN entry has a non-zero type byte, and the repairing step comprises setting the type byte to zero.
Claim 7
Dependent Claim
35 words
The method of claim 3, wherein the malformed LFN entry has at least one filename character field containing at least one invalid character, and the repairing step comprises replacing the invalid characters with valid characters.
Claim 8
Dependent Claim
61 words
A computer-implemented method for diagnosing and repairing defective long filenames (LFNs) in a directory having at least one entry, said method comprising the steps of: for each directory entry, determining whether the entry constitutes an LFN entry; for each LFN entry, determining whether the LFN entry is orphaned; for non-orphaned LFN entries, determining whether the LFN entry has been properly formed.
Claim 9
Dependent Claim
61 words
A computer-implemented method for diagnosing and repairing defective long filenames (LFNs) in a directory having at least one entry, said method comprising the steps of: for each directory entry, determining whether the entry constitutes an LFN entry; for each LFN entry, determining whether the LFN entry is orphaned; for non-orphaned LFN entries, determining whether the LFN entry has been properly formed.
Claim 10
Dependent Claim
81 words
The method of claim 7, further comprising the steps of: determining whether each LFN entry is the last entry in a chain of LFN entries; for each last LFN entry in a chain, determining whether a basis name of the LFN entry matches a short filename (SFN) associated with the LFN entry; and for each instance where the basis name matches the SFN, determining whether checksums of all the LFN entries in the chain match a checksum calculated from the SFN.
Claim 11
Dependent Claim
16 words
The method of claim 7, wherein the entries within the directory are examined in reverse order.
Claim 12
Dependent Claim
111 words
A computer-implemented method for diagnosing and repairing defective long filenames (LFNs) in a directory containing lists of files, with a short filename (SFN) associated with each file, and an LFN optionally associated with at least one of the SFNS, said method comprising the steps of: beginning the method at the end of the directory; inquiring as to whether there are additional directory entries to process; when there are additional entries to process, inquiring as to whether the present entry is an LFN entry; when the entry is an LFN entry, determining whether the LFN entry is orphaned; and when the LFN entry is determined to be orphaned, deleting the LFN entry.
Claim 13
Dependent Claim
111 words
A computer-implemented method for diagnosing and repairing defective long filenames (LFNs) in a directory containing lists of files, with a short filename (SFN) associated with each file, and an LFN optionally associated with at least one of the SFNS, said method comprising the steps of: beginning the method at the end of the directory; inquiring as to whether there are additional directory entries to process; when there are additional entries to process, inquiring as to whether the present entry is an LFN entry; when the entry is an LFN entry, determining whether the LFN entry is orphaned; and when the LFN entry is determined to be orphaned, deleting the LFN entry.
Claim 14
Dependent Claim
130 words
The method of claim 10, further comprising the steps of: when the LFN entry is not determined to be orphaned, determining whether the LFN entry has been properly formed; when the LFN entry is determined to have not been properly formed, repairing said entry; when the LFN entry is determined to have been properly formed, determining whether the LFN entry is the last in a chain of LFN entries; when the LFN entry is determined to be the last in a chain of LFN entries, determining whether a basis name of the LFN entry matches a short filename (SFN) associated with the LFN entry; and when the basis name matches the SFN, determining whether checksums of all the LFN entries in the chain match a checksum calculated from the SFN.
Claim 15
Dependent Claim
112 words
The method of claim 11, further comprising the steps of: when the current LFN entry being examined is not the last LFN entry a chain, determining whether an ordinal of the LFN entry is correct; when the ordinal of the current LFN entry is not correct, truncating the previous LFN entry, making the current LFN entry an orphan; when the ordinal of the current LFN entry is correct, determining whether the current LFN entry has been properly formed; when the current LFN entry is determined to have been improperly formed, repairing said current LFN entry; and when the current LFN entry is determined to have been properly formed, clearing an SFN flag.
Claim 16
Dependent Claim
89 words
Computer apparatus comprising: a central processing unit (CPU); coupled to the CPU, a storage medium containing at least one directory, wherein each directory may have at least one short filename (SFN) entry with a long filename (LFN) optionally associated therewith; coupled to the CPU, a random-access memory; coupled to the CPU, a register for storing an indication as to whether a directory entry being examined by the central processing unit is an SFN; and coupled to the CPU, a register for storing an ordinal field associated with each LFN.
Claim 17
Dependent Claim
89 words
Computer apparatus comprising: a central processing unit (CPU); coupled to the CPU, a storage medium containing at least one directory, wherein each directory may have at least one short filename (SFN) entry with a long filename (LFN) optionally associated therewith; coupled to the CPU, a random-access memory; coupled to the CPU, a register for storing an indication as to whether a directory entry being examined by the central processing unit is an SFN; and coupled to the CPU, a register for storing an ordinal field associated with each LFN.
Claim 18
Dependent Claim
105 words
A computer-readable medium containing a computer program that diagnoses and repairs defective long filenames (LFNs) in a computer directory containing at least one short filename (SFN) with at least one long filename (LFN) entry associated therewith, said computer program performing the steps of: providing at least one directory, wherein each directory may contain at least one entry representing a file; assigning a short filename (SFN) to each file; optionally assigning a long filename (LFN) to at least one of the files, wherein each LFN comprises at least one LFN entry; diagnosing defective LFN entries; and repairing LFN entries that have been diagnosed as being defective.
Claim 19
Dependent Claim
105 words
A computer-readable medium containing a computer program that diagnoses and repairs defective long filenames (LFNs) in a computer directory containing at least one short filename (SFN) with at least one long filename (LFN) entry associated therewith, said computer program performing the steps of: providing at least one directory, wherein each directory may contain at least one entry representing a file; assigning a short filename (SFN) to each file; optionally assigning a long filename (LFN) to at least one of the files, wherein each LFN comprises at least one LFN entry; diagnosing defective LFN entries; and repairing LFN entries that have been diagnosed as being defective.
References Cited (Backward Citations)
US5579517A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-01 | 2001-12-01 | 2002-06-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-01 | 2005-12-01 | 2006-06-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-01 | 2009-12-01 | 2010-06-02 | $7700.00 | Window Closed / Lapsed |