| 36,16 → 36,81 |
|---|
| */ |
| |
| #include "fat_dentry.h" |
| #include <ctype.h> |
| #include <string.h> |
| |
| #define FAT_PAD ' ' |
| static bool is_d_char(const char ch) |
| { |
| if (isalnum(ch) || ch == '_') |
| return true; |
| else |
| return false; |
| } |
| |
| #define FAT_DENTRY_UNUSED 0x00 |
| #define FAT_DENTRY_E5_ESC 0x05 |
| #define FAT_DENTRY_DOT 0x2e |
| #define FAT_DENTRY_ERASED 0xe5 |
| /** Compare path component with the name read from the dentry. |
| * |
| * This function compares the path component with the name read from the dentry. |
| * The comparison is case insensitive and tolerates a mismatch on the trailing |
| * dot character at the end of the name (i.e. when there is a dot, but no |
| * extension). |
| * |
| * @param name Node name read from the dentry. |
| * @param component Path component. |
| * |
| * @return Zero on match, non-zero otherwise. |
| */ |
| int fat_dentry_namecmp(char *name, const char *component) |
| { |
| int rc; |
| if (!(rc = stricmp(name, component))) |
| return rc; |
| if (!strchr(name, '.')) { |
| /* |
| * There is no '.' in the name, so we know that there is enough |
| * space for appending an extra '.' to name. |
| */ |
| name[strlen(name)] = '.'; |
| name[strlen(name) + 1] = '\0'; |
| rc = stricmp(name, component); |
| } |
| return rc; |
| } |
| |
| void dentry_name_canonify(fat_dentry_t *d, char *buf) |
| bool fat_dentry_name_verify(const char *name) |
| { |
| unsigned i, dot; |
| bool dot_found = false; |
| |
| |
| for (i = 0; name[i]; i++) { |
| if (name[i] == '.') { |
| if (dot_found) { |
| return false; |
| } else { |
| dot_found = true; |
| dot = i; |
| } |
| } else { |
| if (!is_d_char(name[i])) |
| return false; |
| } |
| } |
| |
| if (dot_found) { |
| if (dot > FAT_NAME_LEN) |
| return false; |
| if (i - dot > FAT_EXT_LEN + 1) |
| return false; |
| } else { |
| if (i > FAT_NAME_LEN) |
| return false; |
| } |
| |
| return true; |
| } |
| |
| void fat_dentry_name_get(const fat_dentry_t *d, char *buf) |
| { |
| int i; |
| |
| for (i = 0; i < FAT_NAME_LEN; i++) { |
| 71,8 → 136,47 |
|---|
| *buf = '\0'; |
| } |
| |
| fat_dentry_clsf_t fat_classify_dentry(fat_dentry_t *d) |
| void fat_dentry_name_set(fat_dentry_t *d, const char *name) |
| { |
| int i; |
| const char fake_ext[] = " "; |
| |
| |
| for (i = 0; i < FAT_NAME_LEN; i++) { |
| switch ((uint8_t) *name) { |
| case 0xe5: |
| d->name[i] = FAT_DENTRY_E5_ESC; |
| name++; |
| break; |
| case '\0': |
| case '.': |
| d->name[i] = FAT_PAD; |
| break; |
| default: |
| d->name[i] = toupper(*name++); |
| break; |
| } |
| } |
| if (*name++ != '.') |
| name = fake_ext; |
| for (i = 0; i < FAT_EXT_LEN; i++) { |
| switch ((uint8_t) *name) { |
| case 0xe5: |
| d->ext[i] = FAT_DENTRY_E5_ESC; |
| name++; |
| break; |
| case '\0': |
| d->ext[i] = FAT_PAD; |
| break; |
| default: |
| d->ext[i] = toupper(*name++); |
| break; |
| } |
| } |
| } |
| |
| fat_dentry_clsf_t fat_classify_dentry(const fat_dentry_t *d) |
| { |
| if (d->attr & FAT_ATTR_VOLLABEL) { |
| /* volume label entry */ |
| return FAT_DENTRY_SKIP; |
| 79,7 → 183,7 |
|---|
| } |
| if (d->name[0] == FAT_DENTRY_ERASED) { |
| /* not-currently-used entry */ |
| return FAT_DENTRY_SKIP; |
| return FAT_DENTRY_FREE; |
| } |
| if (d->name[0] == FAT_DENTRY_UNUSED) { |
| /* never used entry */ |