2 * Acess2 FAT12/16/32 Driver
3 * - By John Hodge (thePowersGang)
6 * - Directory access/manipulation code
14 void FAT_int_ProperFilename(char *dest, const char *src);
15 int FAT_int_CreateName(fat_filetable *ft, const Uint16 *LongFileName, char *Dest);
16 int FAT_int_ConvertUTF16_to_UTF8(Uint8 *Dest, const Uint16 *Source);
17 int FAT_int_ConvertUTF8_to_UTF16(Uint16 *Dest, const Uint8 *Source);
19 int FAT_int_GetEntryByName(tVFS_Node *DirNode, const char *Name, fat_filetable *Entry);
20 int FAT_int_GetEntryByCluster(tVFS_Node *DirNode, Uint32 Cluster, fat_filetable *Entry);
21 int FAT_int_ReadDirSector(tVFS_Node *Node, int Sector, fat_filetable *Buffer);
23 int FAT_int_WriteDirEntry(tVFS_Node *Node, int ID, fat_filetable *Entry);
26 Uint16 *FAT_int_GetLFN(tVFS_Node *Node, int ID);
27 void FAT_int_DelLFN(tVFS_Node *Node, int ID);
29 int FAT_ReadDir(tVFS_Node *Node, int ID, char Dest[FILENAME_MAX]);
30 tVFS_Node *FAT_FindDir(tVFS_Node *Node, const char *Name);
31 tVFS_Node *FAT_GetNodeFromINode(tVFS_Node *Root, Uint64 Inode);
33 tVFS_Node *FAT_Mknod(tVFS_Node *Node, const char *Name, Uint Flags);
34 int FAT_int_IsValid83Filename(const char *Name);
35 int FAT_Link(tVFS_Node *DirNode, const char *NewName, tVFS_Node *Node);
36 int FAT_Relink(tVFS_Node *node, const char *OldName, const char *NewName);
42 * \brief Converts a FAT directory entry name into a proper filename
43 * \param dest Destination array (must be at least 13 bytes in size)
44 * \param src 8.3 filename (concatenated, e.g 'FILE1 TXT')
46 void FAT_int_ProperFilename(char *dest, const char *src)
52 for( inpos = 0; inpos < 8; inpos++ ) {
53 if(src[inpos] == ' ') break;
54 dest[outpos++] = src[inpos];
57 // Check for empty extensions
61 for( ; inpos < 11; inpos++) {
62 if(src[inpos] == ' ') break;
63 dest[outpos++] = src[inpos];
66 dest[outpos++] = '\0';
68 //LOG("dest='%s'", dest);
72 * \fn char *FAT_int_CreateName(fat_filetable *ft, Uint8 *LongFileName)
73 * \brief Converts either a LFN or a 8.3 Name into a proper name
74 * \param ft Pointer to the file's entry in the parent directory
75 * \param LongFileName Long file name pointer
76 * \return Filename as a heap string
78 int FAT_int_CreateName(fat_filetable *ft, const Uint16 *LongFileName, char *Dest)
80 ENTER("pft sLongFileName", ft, LongFileName);
82 if(LongFileName && LongFileName[0] != 0)
84 int len = FAT_int_ConvertUTF16_to_UTF8(NULL, LongFileName);
85 if( len > FILENAME_MAX ) {
88 FAT_int_ConvertUTF16_to_UTF8((Uint8*)Dest, LongFileName);
93 FAT_int_ProperFilename(Dest, ft->name);
101 int FAT_int_CompareUTF16_UTF8(const Uint16 *Str16, const char *Str8)
103 int pos16 = 0, pos8 = 0;
104 const Uint8 *str8 = (const Uint8 *)Str8;
106 while( Str16[pos16] && str8[pos8] )
109 if( Str16[pos16] & 0x8000 ) {
117 pos8 += ReadUTF8(str8 + pos8, &cp8);
119 if(cp16 == cp8) continue ;
126 if(Str16[pos16] == str8[pos8])
128 if(Str16[pos16] < str8[pos8])
134 int FAT_int_ConvertUTF16_to_UTF8(Uint8 *Dest, const Uint16 *Source)
137 for( ; *Source; Source ++ )
139 // TODO: Decode/Reencode
149 int FAT_int_ConvertUTF8_to_UTF16(Uint16 *Dest, const Uint8 *Source)
157 cpl = ReadUTF8(Source, &cp);
172 int FAT_int_ParseLFN(const fat_filetable *Entry, Uint16 *Buffer)
174 const fat_longfilename *lfnInfo;
177 lfnInfo = (const void*)Entry;
179 if(lfnInfo->id & 0x40) {
180 memset(Buffer, 0, 256*2);
182 ofs = (lfnInfo->id & 0x3F) * 13 - 1;
186 Buffer[ofs--] = lfnInfo->name3[1]; Buffer[ofs--] = lfnInfo->name3[0];
187 Buffer[ofs--] = lfnInfo->name2[5]; Buffer[ofs--] = lfnInfo->name2[4];
188 Buffer[ofs--] = lfnInfo->name2[3]; Buffer[ofs--] = lfnInfo->name2[2];
189 Buffer[ofs--] = lfnInfo->name2[1]; Buffer[ofs--] = lfnInfo->name2[0];
190 Buffer[ofs--] = lfnInfo->name1[4]; Buffer[ofs--] = lfnInfo->name1[3];
191 Buffer[ofs--] = lfnInfo->name1[2]; Buffer[ofs--] = lfnInfo->name1[1];
192 Buffer[ofs--] = lfnInfo->name1[0];
194 if((lfnInfo->id&0x3F) == 1)
200 int FAT_int_GetEntryByName(tVFS_Node *DirNode, const char *Name, fat_filetable *Entry)
202 fat_filetable fileinfo[16];
209 ENTER("pDirNode sName pEntry", DirNode, Name, Entry);
211 for( int i = 0; ; i++ )
214 if(FAT_int_ReadDirSector(DirNode, i/16, fileinfo))
221 //Check if the files are free
222 if(fileinfo[i&0xF].name[0] == '\0') break; // End of List marker
223 if(fileinfo[i&0xF].name[0] == '\xE5') continue; // Free entry
227 // Long File Name Entry
228 if(fileinfo[i & 0xF].attrib == ATTR_LFN)
230 if( FAT_int_ParseLFN(&fileinfo[i&0xF], lfn) )
234 // Remove LFN if it does not apply
235 if(lfnId != i) lfn[0] = 0;
237 if(fileinfo[i&0xF].attrib == ATTR_LFN) continue;
241 FAT_int_ProperFilename(tmpName, fileinfo[i&0xF].name);
242 // LOG("tmpName = '%s'", tmpName);
244 // Debug_HexDump("FAT tmpName", tmpName, strlen(tmpName));
250 Uint8 lfntmp[256*3+1];
251 FAT_int_ConvertUTF16_to_UTF8(lfntmp, lfn);
252 LOG("lfntmp = '%s'", lfntmp);
257 // Only the long name is case sensitive, 8.3 is not
259 if(strucmp(tmpName, Name) == 0 || FAT_int_CompareUTF16_UTF8(lfn, Name) == 0)
261 if(strucmp(tmpName, Name) == 0)
264 memcpy(Entry, fileinfo + (i&0xF), sizeof(*Entry));
265 LOG("Found %s at %i", Name, i);
275 int FAT_int_GetEntryByCluster(tVFS_Node *DirNode, Uint32 Cluster, fat_filetable *Entry)
277 int ents_per_sector = 512 / sizeof(fat_filetable);
278 fat_filetable fileinfo[ents_per_sector];
281 if( Mutex_Acquire(&DirNode->Lock) ) {
288 if( i == 0 || i == ents_per_sector )
290 if(FAT_int_ReadDirSector(DirNode, sector, fileinfo))
292 LOG("ReadDirSector failed");
299 // Check for free/end of list
300 if(fileinfo[i].name[0] == '\0') break; // End of List marker
301 if(fileinfo[i].name[0] == '\xE5') continue; // Free entry
303 if(fileinfo[i].attrib == ATTR_LFN) continue;
305 LOG("fileinfo[i].cluster = %x:%04x", fileinfo[i].clusterHi, fileinfo[i].cluster);
309 FAT_int_ProperFilename(tmpName, fileinfo[i].name);
310 LOG("tmpName = '%s'", tmpName);
315 if(fileinfo[i].cluster != (Cluster & 0xFFFF)) continue;
316 if(fileinfo[i].clusterHi != ((Cluster >> 16) & 0xFFFF)) continue;
318 memcpy(Entry, &fileinfo[i], sizeof(*Entry));
319 Mutex_Release(&DirNode->Lock);
323 Mutex_Release(&DirNode->Lock);
328 * ====================
330 * ====================
334 * \brief Reads a sector from the disk
335 * \param Node Directory node to read
336 * \param Sector Sector number in the directory to read
337 * \param Buffer Destination buffer for the read data
339 int FAT_int_ReadDirSector(tVFS_Node *Node, int Sector, fat_filetable *Buffer)
342 tFAT_VolInfo *disk = Node->ImplPtr;
344 ENTER("pNode iSector pEntry", Node, Sector, Buffer);
347 if(FAT_int_GetAddress(Node, Sector * 512, &addr, NULL))
353 LOG("addr = 0x%llx", addr);
355 if(VFS_ReadAt(disk->fileHandle, addr, 512, Buffer) != 512)
367 * \brief Write a sector to the disk
368 * \param Node Directory node to write
369 * \param Sector Sector number in the directory to write
370 * \param Buffer Source data
372 int FAT_int_WriteDirSector(tVFS_Node *Node, int Sector, const fat_filetable *Buffer)
375 tFAT_VolInfo *disk = Node->ImplPtr;
377 ENTER("pNode iSector pEntry", Node, Sector, Buffer);
380 if(FAT_int_GetAddress(Node, Sector * 512, &addr, NULL))
387 if(VFS_WriteAt(disk->fileHandle, addr, 512, Buffer) != 512)
398 * \brief Writes an entry to the disk
399 * \todo Support expanding a directory
400 * \param Node Directory node
401 * \param ID ID of entry to update
402 * \param Entry Entry data
403 * \return Zero on success, non-zero on error
405 int FAT_int_WriteDirEntry(tVFS_Node *Node, int ID, fat_filetable *Entry)
410 tFAT_VolInfo *disk = Node->ImplPtr;
412 ENTER("pNode iID pEntry", Node, ID, Entry);
414 tmp = FAT_int_GetAddress(Node, ID * sizeof(fat_filetable), &addr, &cluster);
417 //TODO: Allocate a cluster
418 cluster = FAT_int_AllocateCluster(Node->ImplPtr, cluster);
420 Log_Warning("FAT", "Unable to allocate an other cluster for %p", Node);
424 FAT_int_GetAddress(Node, ID * sizeof(fat_filetable), &addr, &cluster);
428 LOG("addr = 0x%llx", addr);
430 // Wriet data to disk
431 VFS_WriteAt(disk->fileHandle, addr, sizeof(fat_filetable), Entry);
440 * \fn Uint16 *FAT_int_GetLFN(tVFS_Node *node)
441 * \brief Return pointer to LFN cache entry
442 * \param Node Directory node
443 * \param ID ID of the short name
444 * \return Pointer to the LFN cache entry
446 Uint16 *FAT_int_GetLFN(tVFS_Node *Node, int ID)
448 tFAT_LFNCache *cache;
451 if( Mutex_Acquire( &Node->Lock ) ) {
455 // TODO: Thread Safety (Lock things)
458 // Create a cache if it isn't there
460 cache = Node->Data = malloc( sizeof(tFAT_LFNCache) + sizeof(tFAT_LFNCacheEnt) );
461 cache->NumEntries = 1;
462 cache->Entries[0].ID = ID;
463 cache->Entries[0].Data[0] = 0;
464 Mutex_Release( &Node->Lock );
465 //Log_Debug("FAT", "Return = %p (new)", cache->Entries[0].Data);
466 return cache->Entries[0].Data;
469 // Scan for this entry
471 for( i = 0; i < cache->NumEntries; i++ )
473 if( cache->Entries[i].ID == ID ) {
474 Mutex_Release( &Node->Lock );
475 //Log_Debug("FAT", "Return = %p (match)", cache->Entries[i].Data);
476 return cache->Entries[i].Data;
478 if( cache->Entries[i].ID == -1 && firstFree == -1 )
482 if(firstFree == -1) {
483 // Use `i` for temp length
484 i = sizeof(tFAT_LFNCache) + (cache->NumEntries+1)*sizeof(tFAT_LFNCacheEnt);
485 Node->Data = realloc( Node->Data, i );
487 Log_Error("FAT", "realloc() fail, unable to allocate %i for LFN cache", i);
488 Mutex_Release( &Node->Lock );
491 //Log_Debug("FAT", "Realloc (%i)\n", i);
493 i = cache->NumEntries;
494 cache->NumEntries ++;
501 cache->Entries[ i ].ID = ID;
502 cache->Entries[ i ].Data[0] = '\0';
504 Mutex_Release( &Node->Lock );
505 //Log_Debug("FAT", "Return = %p (firstFree, i = %i)", cache->Entries[i].Data, i);
506 return cache->Entries[ i ].Data;
510 * \fn void FAT_int_DelLFN(tVFS_Node *node)
511 * \brief Delete a LFN cache entry
512 * \param Node Directory node
513 * \param ID File Entry ID
515 void FAT_int_DelLFN(tVFS_Node *Node, int ID)
517 tFAT_LFNCache *cache = Node->Data;
523 // Scan for a current entry
524 for( i = 0; i < cache->NumEntries; i++ )
526 if( cache->Entries[i].ID == ID )
527 cache->Entries[i].ID = -1;
534 * \fn char *FAT_ReadDir(tVFS_Node *Node, int ID)
535 * \param Node Node structure of directory
536 * \param ID Directory position
537 * \return Filename as a heap string, NULL or VFS_SKIP
539 int FAT_ReadDir(tVFS_Node *Node, int ID, char Dest[FILENAME_MAX])
541 fat_filetable fileinfo[16]; // sizeof(fat_filetable)=32, so 16 per sector
547 ENTER("pNode iID", Node, ID);
549 if(FAT_int_ReadDirSector(Node, ID/16, fileinfo))
551 LOG("End of chain, end of dir");
559 LOG("fileinfo[%i].name[0] = 0x%x", a, (Uint8)fileinfo[a].name[0]);
561 // Check if this is the last entry
562 if( fileinfo[a].name[0] == '\0' ) {
566 return -ENOENT; // break
569 // Check for empty entry
570 if( (Uint8)fileinfo[a].name[0] == 0xE5 ) {
572 LEAVE_RET('i', 1); // Skip
576 // Get Long File Name Cache
577 if(fileinfo[a].attrib == ATTR_LFN)
579 fat_longfilename *lfnInfo;
581 lfnInfo = (fat_longfilename *) &fileinfo[a];
583 // Get cache for corresponding file
584 // > ID + Index gets the corresponding short node
585 lfn = FAT_int_GetLFN( Node, ID + (lfnInfo->id & 0x3F) );
587 a = FAT_int_ParseLFN(&fileinfo[a], lfn);
589 LOG("Invalid LFN, error");
590 LEAVE_RET('i', -EIO);
593 LEAVE_RET('i', 1); // Skip
597 // Check if it is a volume entry
598 if(fileinfo[a].attrib & 0x08) {
599 LEAVE_RET('i', 1); // Skip
602 if(fileinfo[a].name[0] == '.' && fileinfo[a].name[1] == ' ') {
603 LEAVE_RET('i', 1); // Skip
606 if(fileinfo[a].name[0] == '.' && fileinfo[a].name[1] == '.' && fileinfo[a].name[2] == ' ') {
607 LEAVE_RET('i', 1); // Skip
610 LOG("name='%c%c%c%c%c%c%c%c.%c%c%c'",
611 fileinfo[a].name[0], fileinfo[a].name[1], fileinfo[a].name[2], fileinfo[a].name[3],
612 fileinfo[a].name[4], fileinfo[a].name[5], fileinfo[a].name[6], fileinfo[a].name[7],
613 fileinfo[a].name[8], fileinfo[a].name[9], fileinfo[a].name[10] );
616 lfn = FAT_int_GetLFN(Node, ID);
617 //Log_Debug("FAT", "lfn = %p'%s'", lfn, lfn);
618 FAT_int_CreateName(&fileinfo[a], lfn, Dest);
620 FAT_int_CreateName(&fileinfo[a], NULL, Dest);
628 * \fn tVFS_Node *FAT_FindDir(tVFS_Node *node, char *name)
629 * \brief Finds an entry in the current directory
631 tVFS_Node *FAT_FindDir(tVFS_Node *Node, const char *Name)
633 fat_filetable fileent;
635 ENTER("pNode sname", Node, Name);
638 if(!Name || Name[0] == '\0') {
643 if( FAT_int_GetEntryByName(Node, Name, &fileent) == -1 ) {
649 tVFS_Node *ret = FAT_int_CreateNode(Node, &fileent);
650 LOG("Found %s as %p", Name, ret);
655 tVFS_Node *FAT_GetNodeFromINode(tVFS_Node *Root, Uint64 Inode)
657 tFAT_VolInfo *disk = Root->ImplPtr;
658 tVFS_Node *dirnode, *ret;
661 ENTER("pRoot XInode", Root, Inode);
663 ret = FAT_int_GetNode(disk, Inode & 0xFFFFFFFF);
665 if( (ret->Inode >> 32) != 0 ) {
666 LOG("Node in cache, quick return");
671 LOG("Node cached, but incomplete");
677 dirnode = FAT_int_CreateIncompleteDirNode(disk, Inode >> 32);
679 int id = FAT_int_GetEntryByCluster(dirnode, Inode & 0xFFFFFFFF, &ft);
681 ret = FAT_int_CreateNode(dirnode, &ft);
684 dirnode->Type->Close(dirnode);
692 * \brief Create a new node
694 tVFS_Node *FAT_Mknod(tVFS_Node *DirNode, const char *Name, Uint Flags)
696 tFAT_VolInfo *disk = DirNode->ImplPtr;
699 memset(&ft, 0, sizeof(ft));
701 ENTER("pDirNode sName xFlags", DirNode, Name, Flags);
703 // Allocate a cluster
704 Uint32 cluster = FAT_int_AllocateCluster(disk, -1);
705 LOG("Cluster 0x%07x allocated", cluster);
707 // Create a temporary file table entry for an empty node
708 ft.cluster = cluster & 0xFFFF;
709 ft.clusterHi = cluster >> 16;
711 if( Flags & VFS_FFLAG_DIRECTORY )
712 ft.attrib = ATTR_DIRECTORY;
716 tVFS_Node *newnode = FAT_int_CreateNode(DirNode, &ft);
721 LOG("newnode = %p", newnode);
724 if( (rv = FAT_Link(DirNode, Name, newnode)) ) {
725 newnode->ImplInt |= FAT_FLAG_DELETE;
732 * \brief Internal - Checks if a character is valid in an 8.3 filename
734 static inline int is_valid_83_char(char ch)
736 if( '0' <= ch && ch <= '9' )
738 if( 'A' <= ch && ch <= 'Z' )
740 if( 'a' <= ch && ch <= 'z' )
742 if( strchr("$%'-_@~`#!(){}^#&", ch) )
749 Uint8 FAT_int_UnicodeTo83(Uint32 Input)
751 Input = toupper(Input);
752 // Input = unicode_to_oem(Input);
755 if(!is_valid_83_char(Input))
761 * \brief Internal - Determines if a filename is a valid 8.3 filename
763 int FAT_int_IsValid83Filename(const char *Name)
767 if( !Name[0] || Name[0] == '.' )
770 // Check filename portion
771 for( i = 0; Name[i] && i < 8; i ++ )
775 if( !is_valid_83_char(Name[i]) )
778 // If the next char is not \0 or '.', it's not valid
779 if( Name[i] && Name[i++] != '.' )
782 // Check the extension portion
783 for( j = 0; Name[i+j] && j < 3; j ++ )
785 if( !is_valid_83_char(Name[i+j]) )
789 // After the extension must be the end
796 Uint8 FAT_int_MakeLFNChecksum(const char *ShortName)
799 for( int i = 0; i < 11; i++ )
801 // ret = (ret >>> 1) + ShortName[i]
802 // where >>> is rotate right
803 ret = ((ret & 1) ? 0x80 : 0x00) + (ret >> 1) + ShortName[i];
809 * \brief Create a new name for a file
810 * \note Since FAT doesn't support reference counting, this will cause double-references if
811 * a file is hardlinked and not unlinked
813 int FAT_Link(tVFS_Node *DirNode, const char *NewName, tVFS_Node *NewNode)
818 const int eps = 512 / sizeof(fat_filetable);
819 fat_filetable fileinfo[eps];
821 if( Mutex_Acquire( &DirNode->Lock ) ) {
825 // -- Ensure duplicates aren't created --
826 if( FAT_int_GetEntryByName(DirNode, NewName, &ft) >= 0 ) {
827 Mutex_Release( &DirNode->Lock );
831 // -- Create filetable entry --
836 while( NewName[inofs] && NewName[inofs] == '.' )
837 inofs ++, bDirty = 1;
838 for( int i = 0; i < 8 && NewName[inofs] && NewName[inofs] != '.'; i ++ )
841 inofs += ReadUTF8(NewName + inofs, &cp);
842 // Spaces are silently skipped
847 ft.name[i] = FAT_int_UnicodeTo83(cp);
851 while( NewName[inofs] && NewName[inofs] != '.' )
852 inofs ++, bDirty = 1;
853 for( ; i < 8+3 && NewName[inofs]; i ++ )
856 inofs += ReadUTF8(NewName + inofs, &cp);
857 // Spaces are silently skipped
862 ft.name[i] = FAT_int_UnicodeTo83(cp);
866 if( !NewName[inofs] ) bDirty = 1;
870 int lfnlen = FAT_int_ConvertUTF8_to_UTF16(lfn, (const Uint8*)NewName);
872 nLFNEnt = DivUp(lfnlen, 13);
876 int bNeedsLFN = !FAT_int_IsValid83Filename(NewName);
879 int lfnlen = FAT_int_ConvertUTF8_to_UTF16(lfn, (const Uint8*)NewName);
881 nLFNEnt = DivUp(lfnlen, 13);
883 // Create a base mangled filetable entry
885 while(NewName[j] == '.') j ++; // Eat leading dots
886 for( i = 0; i < 6 && NewName[j] && NewName[j] != '.'; i ++, j ++ )
888 if( !isalpha(NewName[j]) && !is_valid_83_char(NewName[j]) )
891 ft.name[i] = toupper(NewName[j]);
895 while(i < 8) ft.name[i++] = ' ';
896 while(NewName[j] && NewName[j] != '.') j ++;
897 for( ; i < 8+3 && NewName[j]; i ++, j ++ )
899 if( NewName[j] == '.' )
901 else if( !is_valid_83_char(NewName[j]) )
904 ft.name[i] = toupper(NewName[j]);
906 while(i < 8+3) ft.name[i++] = ' ';
908 // - Ensure there isn't a duplicate short-name
909 int bIsDuplicate = 1;
910 while( bIsDuplicate )
912 bIsDuplicate = 0; // Assume none
915 for( int id = 0; ; id ++ )
919 if(FAT_int_ReadDirSector(DirNode, id/eps, fileinfo))
920 break; // end of cluster chain
924 if( fileinfo[id%eps].name[0] == '\0' ) break;
926 if( fileinfo[id%eps].name[0] == '\xE5' ) continue;
928 if( fileinfo[id%eps].attrib == ATTR_LFN ) continue;
930 // Is this a duplicate?
931 if( memcmp(ft.name, fileinfo[id%eps].name, 8+3) == 0 ) {
939 // If a duplicate was found, increment the suffix
942 if( ft.name[7] == '9' ) {
943 // TODO: Expand into ~00
944 Log_Error("FAT", "TODO: Use two digit LFN suffixes");
945 Mutex_Release(&DirNode->Lock);
955 // Create pure filetable entry
958 for( i = 0; i < 8 && *NewName && *NewName != '.'; i ++, NewName++ )
959 ft.name[i] = *NewName;
967 for( ; i < 8+3 && *NewName; i ++, NewName++ )
968 ft.name[i] = *NewName;
970 for( ; i < 8+3; i ++ )
975 if(NewNode->Flags & VFS_FFLAG_DIRECTORY )
976 ft.attrib |= ATTR_DIRECTORY;
978 FAT_int_GetFATTimestamp(NewNode->CTime, &ft.cdate, &ft.ctime, &ft.ctimems);
979 // ft.ctimems = ft.ctimems;
980 ft.ctime = LittleEndian16(ft.ctime);
981 ft.cdate = LittleEndian16(ft.cdate);
982 FAT_int_GetFATTimestamp(NewNode->MTime, &ft.mdate, &ft.mtime, NULL);
983 ft.mtime = LittleEndian16(ft.mtime);
984 ft.mdate = LittleEndian16(ft.mdate);
985 FAT_int_GetFATTimestamp(NewNode->ATime, &ft.adate, NULL, NULL);
986 ft.adate = LittleEndian16(ft.adate);
987 ft.clusterHi = LittleEndian16((NewNode->Inode >> 16) & 0xFFFF);
988 ft.cluster = LittleEndian16(NewNode->Inode & 0xFFFF);
989 ft.size = LittleEndian32(NewNode->Size);
991 LOG("ft.name = '%.11s'", ft.name);
993 // -- Add entry to the directory --
994 // Locate a range of nLFNEnt + 1 free entries
996 int range_first = 0, range_last = -1;
997 for( int id = 0; ; id ++ )
1001 if(FAT_int_ReadDirSector(DirNode, id/eps, fileinfo))
1002 break; // end of cluster chain
1005 // End of file list, break out
1006 if( fileinfo[id%eps].name[0] == '\0' ) {
1007 if( id - range_first == nLFNEnt )
1013 // If an entry is occupied, clear the range
1014 if( fileinfo[id%eps].name[0] != '\xE5' ) {
1015 range_first = id + 1;
1019 // Free entry, check if we have enough
1020 if( id - range_first == nLFNEnt ) {
1024 // Check the next one
1026 if( range_last == -1 )
1028 // - If there are none, defragment the directory?
1030 // - Else, expand the directory
1031 if( end_id == -1 ) {
1032 // End of cluster chain
1035 // Just end of block
1037 // - and if that fails, return an error
1038 Log_Warning("FAT", "TODO: Impliment directory expansion / defragmenting");
1039 Mutex_Release(&DirNode->Lock);
1043 // Calculate the checksum used for LFN
1044 Uint8 lfn_checksum = 0;
1047 lfn_checksum = FAT_int_MakeLFNChecksum(ft.name);
1051 if( range_first % eps != 0 )
1052 FAT_int_ReadDirSector(DirNode, range_first/eps, fileinfo);
1053 for( int id = range_first; id <= range_last; id ++ )
1055 if( id % eps == 0 ) {
1056 if( id != range_first )
1057 FAT_int_WriteDirSector(DirNode, (id-1)/eps, fileinfo);
1058 FAT_int_ReadDirSector(DirNode, id/eps, fileinfo);
1061 if( id == range_last ) {
1063 memcpy(fileinfo + id % eps, &ft, sizeof(fat_filetable));
1067 int lfnid = (nLFNEnt - (id - range_first));
1068 int ofs = (lfnid-1) * 13;
1070 fat_longfilename *lfnent = (void*)( fileinfo + id%eps );
1072 lfnent->id = 0x40 | lfnid;
1073 lfnent->attrib = ATTR_LFN;
1075 lfnent->firstCluster = 0;
1076 lfnent->checksum = lfn_checksum; // ???
1078 for( i = 0; i < 13; i ++ )
1081 if( (wd = lfn[ofs+j]) ) j ++;
1082 wd = LittleEndian16(wd);
1084 lfnent->name1[i ] = wd;
1086 lfnent->name2[i-5 ] = wd;
1088 lfnent->name3[i-5-6] = wd;
1092 FAT_int_WriteDirSector(DirNode, range_last/eps, fileinfo);
1094 Mutex_Release( &DirNode->Lock );
1099 * \fn int FAT_Relink(tVFS_Node *Node, char *OldName, char *NewName)
1100 * \brief Rename / Delete a file
1102 int FAT_Unlink(tVFS_Node *Node, const char *OldName)
1107 if( Mutex_Acquire(&Node->Lock) ) {
1111 int id = FAT_int_GetEntryByName(Node, OldName, &ft);
1113 Mutex_Release(&Node->Lock);
1117 child = FAT_int_CreateNode(Node->ImplPtr, &ft);
1119 Mutex_Release(&Node->Lock);
1122 child->ImplInt |= FAT_FLAG_DELETE; // Mark for deletion on close
1124 // TODO: If it has a LFN, remove that too
1126 // Delete from the directory
1127 ft.name[0] = '\xE5';
1128 FAT_int_WriteDirEntry(Node, id, &ft);
1131 child->Type->Close( child );
1132 Mutex_Release( &Node->Lock );