patrick/Sylva
1
1
Fork 0
Code Issues 2 Pull Requests Actions Packages Projects 1 Releases Wiki Activity

[feat] Simple Disk Benchmark

Browse Source
This commit is contained in:
pyao12
2026-06-05 19:27:41 +08:00
Unverified
parent ed7fd54e35
commit 0f344b8c3e
4 changed files with 60 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files
kernel/fs.cpp
+20 -9
View File
@@ -372,28 +372,32 @@ static UINT8 lfn_checksum(const UINT8 *SFN) {
struct lfn_state {
CHAR16 frags[LFN_MAX_FRAGS][LFN_FRAG_SIZE + 1];
UINTN count;
UINT8 checksum;
};
static void lfn_reset(struct lfn_state *lfn) {
lfn->count = 0;
lfn->checksum = 0;
}
static void lfn_add(struct lfn_state *lfn, const UINT8 *E) {
if (lfn->count >= LFN_MAX_FRAGS) return;
lfn->checksum = E[13];
UINTN pos = 0;
for (SSINT32 i = 0; i < 5 && pos < LFN_FRAG_SIZE; i++) {
BOOLEAN done = FALSE;
for (SSINT32 i = 0; i < 5 && pos < LFN_FRAG_SIZE && !done; i++) {
CHAR16 c = *(const UINT16*)(E + 1 + i * 2);
if (c == 0x0000 || c == 0xFFFF) { lfn->frags[lfn->count][pos] = 0; return; }
if (c == 0x0000 || c == 0xFFFF) { done = TRUE; break; }
lfn->frags[lfn->count][pos++] = c;
}
for (SSINT32 i = 0; i < 6 && pos < LFN_FRAG_SIZE; i++) {
for (SSINT32 i = 0; i < 6 && pos < LFN_FRAG_SIZE && !done; i++) {
CHAR16 c = *(const UINT16*)(E + 14 + i * 2);
if (c == 0x0000 || c == 0xFFFF) { lfn->frags[lfn->count][pos] = 0; return; }
if (c == 0x0000 || c == 0xFFFF) { done = TRUE; break; }
lfn->frags[lfn->count][pos++] = c;
}
for (SSINT32 i = 0; i < 2 && pos < LFN_FRAG_SIZE; i++) {
for (SSINT32 i = 0; i < 2 && pos < LFN_FRAG_SIZE && !done; i++) {
CHAR16 c = *(const UINT16*)(E + 28 + i * 2);
if (c == 0x0000 || c == 0xFFFF) { lfn->frags[lfn->count][pos] = 0; return; }
if (c == 0x0000 || c == 0xFFFF) { done = TRUE; break; }
lfn->frags[lfn->count][pos++] = c;
}
lfn->frags[lfn->count][pos] = 0;
@@ -445,7 +449,7 @@ static BOOLEAN process_sector(struct fat_fs *fs, UINT8 *Buf,
UINT8 Attr = E[11];
if (Attr == 0x0F) {
if ((Attr & 0x3F) == 0x0F) {
if (E[0] & 0x40) lfn_reset(lfn);
lfn_add(lfn, E);
continue;
@@ -454,7 +458,7 @@ static BOOLEAN process_sector(struct fat_fs *fs, UINT8 *Buf,
// SFN entry
CHAR16 Name[256];
BOOLEAN use_lfn = FALSE;
if (lfn->count > 0 && lfn_checksum(E) == E[13]) {
if (lfn->count > 0 && lfn_checksum(E) == lfn->checksum) {
lfn_build(lfn, Name, 256);
use_lfn = TRUE;
}
@@ -626,7 +630,14 @@ struct find_ctx {
};
static BOOLEAN name_match(const CHAR16 *a, const CHAR16 *b) {
return wstr_eq((WString)a, (WString)b);
while (*a && *b) {
CHAR16 ca = *a, cb = *b;
if (ca >= L'A' && ca <= L'Z') ca += 32;
if (cb >= L'A' && cb <= L'Z') cb += 32;
if (ca != cb) return FALSE;
a++; b++;
}
return *a == 0 && *b == 0;
}
static void find_callback(void *ctx, const CHAR16 *Name, UINT8 Attr,