WebSVN - Projects - Blame - Rev 297

Rev	Author	Line No.	Line
297	killagreg	1	#include <string.h>
		2	#include "printf_P.h"
		3	#include "timer0.h"
231	killagreg	4	#include "fat16.h"
		5	#include "sdc.h"
297	killagreg	6	#include "uart1.h"
231	killagreg	7
		8
297	killagreg	9	/*
		10	FAT16 Drive Layout:
		11	Description Offset
		12	Volume Boot Sector Start of Partition
		13	Fat Tables Start + # of Reserved Sectors
		14	Root Directory Entry Start + # of Reserved + (# of Sectors Per FAT * 2)
		15	Data Area (Starts with Cluster #2) Start + # of Reserved + (# of Sectors Per FAT * 2) + ((Maximum Root Directory Entries * 32) / Bytes per Sector)
		16	*/
231	killagreg	17
		18
297	killagreg	19	/*
		20	________________________________________________________________________________________________________________________________________
231	killagreg	21
297	killagreg	22	Structure of an partition entry
		23	________________________________________________________________________________________________________________________________________
231	killagreg	24
297	killagreg	25	Partition Entry is 16 bytes long
		26	*/
		27	typedef struct
		28	{
		29	uint8_t PartitionState; // Current State of Partition (00h=Inactive, 80h=Active)
		30	uint8_t BeginningHead; // Beginning of Partition - Head
		31	uint16_t BeginningCylSec; // Beginning of Partition - Cylinder/Sector (See Below)
		32	uint8_t Type; // Type of Partition (See List Below)
		33	uint8_t EndHead; // End of Partition - Head
		34	uint16_t EndCylSec; // End of Partition - Cylinder/Sector
		35	uint32_t NoSectorsBeforePartition; // Number of Sectors between the MBR and the First Sector in the Partition
		36	uint32_t NoSectorsPartition ; // Number of Sectors in the Partition
		37	} __attribute__((packed)) PartitionEntry_t;
231	killagreg	38
297	killagreg	39	/*
		40	Coding of Cylinder/Sector words
231	killagreg	41
297	killagreg	42	Cylinder is 10 bits: [7:0] at [15:8] and [9:8] at [7:6]
		43	Sector is 5 bits: [5:0] at [5:0]
		44	*/
231	killagreg	45
297	killagreg	46	// Partition Types:
		47	#define PART_TYPE_UNKNOWN 0x00
		48	#define PART_TYPE_FAT12 0x01
		49	#define PART_TYPE_XENIX 0x02
		50	#define PART_TYPE_FAT16_ST_32_MB 0x04
		51	#define PART_TYPE_EXTDOS 0x05
		52	#define PART_TYPE_FAT16_LT_32_MB 0x06
		53	#define PART_TYPE_NTFS 0x07
		54	#define PART_TYPE_FAT32 0x0B
		55	#define PART_TYPE_FAT32LBA 0x0C
		56	#define PART_TYPE_FAT16LBA 0x0E
		57	#define PART_TYPE_EXTDOSLBA 0x0F
		58	#define PART_TYPE_EISA 0x12
		59	#define PART_TYPE_ONTRACK 0x33
		60	#define PART_TYPE_NOVELL 0x40
		61	#define PART_TYPE_DYNAMIC 0x42
		62	#define PART_TYPE_PCIX 0x4B
		63	#define PART_TYPE_LINUX_SWAP 0x82
		64	#define PART_TYPE_LINUX_NATIVE 0x83
		65	#define PART_TYPE_LINUX_LVM 0x8E
		66	#define PART_TYPE_PHOENIXSAVE 0xA0
		67	#define PART_TYPE_FREEBSD 0xA5
		68	#define PART_TYPE_OPENBSD 0xA6
		69	#define PART_TYPE_NETNBSD 0xA9
		70	#define PART_TYPE_CPM 0xDB
		71	#define PART_TYPE_DBFS 0xE0
		72	#define PART_TYPE_BBT 0xFF
231	killagreg	73
		74
297	killagreg	75	/*
		76	________________________________________________________________________________________________________________________________________
231	killagreg	77
297	killagreg	78	Structure of the MasterBootRecord
		79	________________________________________________________________________________________________________________________________________
		80
		81	Master Boot Record is 512 bytes long
		82	The Master Boot Record is the same for pretty much all Operating Systems.
		83	It is located on the first Sector of the Hard Drive, at Cylinder 0, Head 0, Sector 1
		84	*/
		85	typedef struct
231	killagreg	86	{
297	killagreg	87	uint8_t ExecutableCode[446]; // 446 bytes for machine start code
		88	PartitionEntry_t PartitionEntry1; // 16 bytes for partition entry 1
		89	PartitionEntry_t PartitionEntry2; // 16 bytes for partition entry 2
		90	PartitionEntry_t PartitionEntry3; // 16 bytes for partition entry 3
		91	PartitionEntry_t PartitionEntry4; // 16 bytes for partition entry 4
		92	uint16_t ExecutableMarker; // BIOS-Signature (0x55 0xAA)
		93	} __attribute__((packed)) MBR_Entry_t;
231	killagreg	94
		95
297	killagreg	96	/*
		97	________________________________________________________________________________________________________________________________________
231	killagreg	98
297	killagreg	99	Structure of the VolumeBootRecord
		100	________________________________________________________________________________________________________________________________________
231	killagreg	101
297	killagreg	102	The Volume Boot Record is 512 bytes long
		103	This information is located in the first sector of every partition.
		104	*/
		105	typedef struct
		106	{
		107	uint8_t JumpCode[3]; // Jump Code + NOP
		108	int8_t OEMName[8]; // OEM Name
		109	uint16_t BytesPerSector; // Bytes Per Sector
		110	uint8_t SectorsPerCluster; // Sectors Per Cluster
		111	uint16_t ReservedSectors; // Reserved Sectors
		112	uint8_t NoFATCopies; // Number of Copies of FAT
		113	uint16_t MaxRootEntries; // Maximum Root Directory Entries
		114	uint16_t NoSectorsInPartSml32MB; // Number of Sectors in Partition Smaller than 32 MB
		115	uint8_t MediaDescriptor; // Media Descriptor (0xF8 for Hard Disks)
		116	uint16_t SectorsPerFAT; // Sectors Per FAT
		117	uint16_t SectorsPerTrack; // Sectors Per Track
		118	uint16_t NoHeads; // Number of Heads
		119	uint32_t NoHiddenSectors; // Number of Hidden Sectors in Partition
		120	uint32_t NoSectors; // Number of Sectors in Partition
		121	uint16_t DriveNo; // Logical Drive Number of Partition
		122	uint8_t ExtendedSig; // Extended Signature (0x29)
		123	uint32_t SerialNo; // Serial Number of the Partition
		124	int8_t VolumeName[11]; // Volume Name of the Partititon
		125	int8_t FATName[8]; // FAT Name (FAT16)
		126	uint8_t ExecutableCode[446]; // 446 bytes for machine start code
		127	uint16_t ExecutableMarker; // Executable Marker (0x55 0xAA)
		128	} __attribute__((packed)) VBR_Entry_t;
231	killagreg	129
		130
		131
297	killagreg	132	/*
		133	________________________________________________________________________________________________________________________________________
		134
		135	Structure of an directory entry
		136	________________________________________________________________________________________________________________________________________
		137
		138	Directory entry is 32 bytes.
		139	*/
		140	typedef struct
231	killagreg	141	{
297	killagreg	142	int8_t Name[8]; // 8 bytes name, padded with spaces.
		143	uint8_t Extension[3]; // 3 bytes extension, padded with spaces.
		144	uint8_t Attribute; // attribute of the directory entry (unused,archive,read-only,system,directory,volume)
		145	uint8_t Reserved[10]; // reserved bytes within the directory entry.
		146	uint32_t DateTime; // date and time of last write access to the file or directory.
		147	uint16_t StartCluster; // first cluster of the file or directory.
		148	uint32_t Size; // size of the file or directory in bytes.
		149	} __attribute__((packed)) DirEntry_t;
231	killagreg	150
297	killagreg	151	#define SLOT_EMPTY 0x00 // slot has never been used
		152	#define SLOT_E5 0x05 // the real value is 0xe5
		153	#define SLOT_DELETED 0xE5 // file in this slot deleted
231	killagreg	154
297	killagreg	155	#define ATTR_NONE 0x00 // normal file
		156	#define ATTR_READONLY 0x01 // file is readonly
		157	#define ATTR_HIDDEN 0x02 // file is hidden
		158	#define ATTR_SYSTEM 0x04 // file is a system file
		159	#define ATTR_VOLUMELABEL 0x08 // entry is a volume label
		160	#define ATTR_LONG_FILENAME 0x0F // this is a long filename entry
		161	#define ATTR_SUBDIRECTORY 0x10 // entry is a directory name
		162	#define ATTR_ARCHIVE 0x20 // file is new or modified
231	killagreg	163
		164
297	killagreg	165	/*
		166	________________________________________________________________________________________________________________________________________
231	killagreg	167
297	killagreg	168	Structure of an entry within the fileallocationtable.
		169	________________________________________________________________________________________________________________________________________
		170	*/
		171	typedef struct
		172	{
		173	uint16_t NextCluster; // the next cluster of the file.
		174	} __attribute__((packed)) Fat16Entry_t;
231	killagreg	175
297	killagreg	176	// secial fat entries
		177	#define FAT16_CLUSTER_FREE 0x0000
		178	#define FAT16_CLUSTER_RESERVED 0x0001
		179	#define FAT16_CLUSTER_USED_MIN 0x0002
		180	#define FAT16_CLUSTER_USED_MAX 0xFFEF
		181	#define FAT16_CLUSTER_ROOTDIR_MIN 0xFFF0
		182	#define FAT16_CLUSTER_ROOTDIR_MAX 0xFFF6
		183	#define FAT16_CLUSTER_BAD 0xFFF7
		184	#define FAT16_CLUSTER_LAST_MIN 0xFFF8
		185	#define FAT16_CLUSTER_LAST_MAX 0xFFFF
231	killagreg	186
297	killagreg	187	/*****************************************************************************************************************************************/
		188	/* */
		189	/* Global variables needed for read- or write-acces to the FAT16- filesystem. */
		190	/* */
		191	/*****************************************************************************************************************************************/
231	killagreg	192
297	killagreg	193	#define MBR_SECTOR 0x00 // the masterboot record is located in sector 0.
		194	#define DIRENTRY_SIZE 32 //bytes
		195	#define DIRENTRIES_PER_SECTOR BYTES_PER_SECTOR/DIRENTRY_SIZE
		196	#define FAT16_BYTES 2
		197	#define FAT16_ENTRIES_PER_SECTOR BYTES_PER_SECTOR/FAT16_BYTES
		198
		199	#define FSTATE_UNUSED 0
		200	#define FSTATE_USED 1
		201
		202	typedef struct
231	killagreg	203	{
297	killagreg	204	uint8_t IsValid; // 0 means invalid, else valid
		205	uint8_t SectorsPerCluster; // how many sectors does a cluster contain?
		206	uint8_t FatCopies; // Numbers of copies of the FAT
		207	uint16_t MaxRootEntries; // Possible number of entries in the root directory.
		208	uint16_t SectorsPerFat; // how many sectors does a fat16 contain?
		209	uint32_t FirstFatSector; // sector of the start of the fat
		210	uint32_t FirstRootDirSector; // sector of the rootdirectory
		211	uint32_t FirstDataSector; // sector of the first cluster containing data (cluster2).
		212	uint32_t LastDataSector; // the last data sector of the partition
		213	} Partition_t;
231	killagreg	214
297	killagreg	215	Partition_t Partition; // Structure holds partition information
231	killagreg	216
297	killagreg	217	File_t FilePointer[FILE_MAX_OPEN]; // Allocate Memmoryspace for each filepointer used.
231	killagreg	218
		219
297	killagreg	220	/****************************************************************************************************************************************/
		221	/* Function: FileDateTime(DateTime_t ); /
		222	/* */
		223	/* Description: This function calculates the DOS date time from a pointer to a time structure. */
		224	/* */
		225	/* Returnvalue: Returns the DOS date time. */
		226	/****************************************************************************************************************************************/
		227
		228	uint32_t FileDateTime(DateTime_t * pTimeStruct)
231	killagreg	229	{
297	killagreg	230	uint32_t datetime = 0;
		231	if((pTimeStruct == 0) \|\| !(pTimeStruct->Valid)) return datetime;
		232
		233	datetime \|= (0x0000007FL & (uint32_t)(pTimeStruct->Year - 1980))<<25; // set year
		234	datetime \|= (0x0000000FL & (uint32_t)(pTimeStruct->Month))<<21; // set month
		235	datetime \|= (0x0000001FL & (uint32_t)(pTimeStruct->Day))<<16;
		236	datetime \|= (0x0000001FL & (uint32_t)(pTimeStruct->Hour))<<11;
		237	datetime \|= (0x0000003FL & (uint32_t)(pTimeStruct->Min))<<5;
		238	datetime \|= (0x0000001FL & (uint32_t)(pTimeStruct->Sec/2));
		239	return datetime;
231	killagreg	240	}
		241
		242
297	killagreg	243	/****************************************************************************************************************************************/
		244	/* Function: LockFilePointer(); */
		245	/* */
		246	/* Description: This function trys to lock a free file pointer. */
		247	/* */
		248	/* Returnvalue: Returns the Filepointer on success or 0. */
		249	/****************************************************************************************************************************************/
		250	File_t * LockFilePointer(void)
231	killagreg	251	{
297	killagreg	252	uint8_t i;
		253	File_t * File = 0;
		254	for(i = 0; i < FILE_MAX_OPEN; i++)
231	killagreg	255	{
297	killagreg	256	if(FilePointer[i].State == FSTATE_UNUSED) // found an unused one
231	killagreg	257	{
297	killagreg	258	File = &FilePointer[i]; // set pointer to that entry
		259	FilePointer[i].State = FSTATE_USED; // mark it as used
		260	break;
231	killagreg	261	}
		262	}
297	killagreg	263	return(File);
231	killagreg	264	}
		265
297	killagreg	266	/****************************************************************************************************************************************/
		267	/* Function: UnlockFilePointer(file_t ); /
		268	/* */
		269	/* Description: This function trys to unlock a file pointer. */
		270	/* */
		271	/* Returnvalue: Returns 1 if file pointer was freed else 0. */
		272	/****************************************************************************************************************************************/
		273	uint8_t UnlockFilePointer(File_t * file)
231	killagreg	274	{
297	killagreg	275	uint8_t cnt;
		276	if(file == NULL) return(0);
		277	for(cnt = 0; cnt < FILE_MAX_OPEN; cnt++)
231	killagreg	278	{
297	killagreg	279	if(&FilePointer[cnt] == file) // filepointer to be freed found?
231	killagreg	280	{
297	killagreg	281	file->State = FSTATE_UNUSED;
		282	file->FirstSectorOfFirstCluster = 0; // Sectorpointer to the first sector of the first datacluster of the file.
		283	file->FirstSectorOfCurrCluster = 0;
		284	file->SectorOfCurrCluster = 0; // Pointer to the cluster which is edited at the moment.
		285	file->SectorOfCurrCluster = 0; // The sector which is edited at the moment (cluster_pointer + sector_index).
		286	file->ByteOfCurrSector = 0; // The bytelocation within the current sector (cluster_pointer + sector_index + byte_index).
		287	file->Mode = 0; // mode of fileoperation (read,write)
		288	file->Size = 0; // the size of the opend file in bytes.
		289	file->Position = 0; // pointer to a character within the file 0 < fileposition < filesize
		290	file->SectorInCache = 0; // the last sector read, wich is still in the sectorbuffer.
		291	file->DirectorySector = 0; // the sectorposition where the directoryentry has been made.
		292	file->DirectoryIndex = 0; // the index to the directoryentry within the specified sector.
		293	file->Attribute = 0; // the attribute of the file opened.
		294	file = NULL;
		295	return(1);
231	killagreg	296	}
		297	}
297	killagreg	298	return(0);
		299	}
231	killagreg	300
297	killagreg	301	/****************************************************************************************************************************************/
		302	/* Function: SeperateDirName(int8_t, int8_t); */
		303	/* */
		304	/* Description: This function seperates the first dirname from filepath and brings them */
		305	/* into the needed format ('test.txt' -> 'TEST TXT') */
		306	/* The subpath is the pointer to the remaining substring if the filepath */
		307	/* */
		308	/* Returnvalue: Return NULL on error or pointer to subpath */
		309	/****************************************************************************************************************************************/
		310	int8_t* SeperateDirName(const int8_t filepath, int8_t dirname)
231	killagreg	311	{
297	killagreg	312	int8_t* subpath = NULL;
		313	uint8_t readpointer = 0;
		314	uint8_t writepointer = 0;
231	killagreg	315
297	killagreg	316	// search subpath from beginning of filepath
		317	subpath = NULL;
		318	readpointer = 0;
		319	if(filepath[0] == '/') readpointer = 1; // ignore first '/'
		320	while(subpath == NULL) // search the filepath until a subpath was found.
231	killagreg	321	{
297	killagreg	322	if(((filepath[readpointer] == 0) \|\| (filepath[readpointer] == '/'))) // if '/' found or end of filepath reached
		323	{
		324	subpath = (int8_t*)&filepath[readpointer]; // store the position of the first "/" found after the beginning of the filenpath
		325	}
		326	readpointer++;
231	killagreg	327	}
		328
297	killagreg	329	// clear dirname with spaces
		330	dirname[11] = 0; // terminate dirname
		331	for(writepointer = 0; writepointer < 11; writepointer++) dirname[writepointer] = ' ';
		332	writepointer = 0;
		333	// start seperating the dirname from the filepath.
		334	readpointer = 0;
		335	if(filepath[0] == '/') readpointer = 1; // ignore first '/'
		336	while( &filepath[readpointer] < subpath)
231	killagreg	337	{
297	killagreg	338	if(writepointer >= 11) return(NULL); // dirname to long
		339	if(filepath[readpointer] == '.') // seperating dirname and extension.
231	killagreg	340	{
297	killagreg	341	if(writepointer <= 8)
231	killagreg	342	{
297	killagreg	343	readpointer++; // next character in filename
		344	writepointer = 8; // jump to start of extension
231	killagreg	345	}
297	killagreg	346	else return(NULL); // dirbasename to long
		347	}
		348	else
		349	{
		350	if((0x60 < filepath[readpointer]) && (filepath[readpointer] < 0x7B))
		351	{
		352	dirname[writepointer] = (filepath[readpointer] - 0x20); // all characters must be upper case.
		353	}
231	killagreg	354	else
		355	{
297	killagreg	356	dirname[writepointer] = filepath[readpointer];
231	killagreg	357	}
297	killagreg	358	readpointer++;
		359	writepointer++;
231	killagreg	360	}
		361	}
297	killagreg	362	return(subpath);
231	killagreg	363	}
		364
		365
297	killagreg	366	/*************************************************************************************************************************************+/
		367	/* Function: Fat16ClusterToSector( uint16_t cluster); */
		368	/* */
		369	/* Description: This function converts a cluster number given by the fat to the corresponding */
		370	/* sector that points to the start of the data area that is represented by the cluster number. */
		371	/* */
		372	/* Returnvalue: The sector number with the data area of the given cluster */
		373	/****************************************************************************************************************************************/
		374	uint32_t Fat16ClusterToSector(uint16_t cluster)
231	killagreg	375	{
297	killagreg	376	if(!Partition.IsValid) return 0;
		377	if (cluster < 2) cluster = 2; // the 0. and 1. cluster in the fat are used for the media descriptor
		378	return ( (cluster - 2) * Partition.SectorsPerCluster) + Partition.FirstDataSector; // the first data sector is represented by the 2nd cluster
		379	}
231	killagreg	380
297	killagreg	381	/****************************************************************************************************************************************/
		382	/* Function: SectorToFat16Cluster( uint32_t sector); */
		383	/* */
		384	/* Description: This function converts a given sector number given to the corresponding */
		385	/* cluster number in the fat that represents this data area. */
		386	/* */
		387	/* Returnvalue: The cluster number representing the data area of the sector. */
		388	/****************************************************************************************************************************************/
		389	uint16_t SectorToFat16Cluster(uint32_t sector)
		390	{
		391	if(!Partition.IsValid) return 0;
		392	return ((uint16_t)((sector - Partition.FirstDataSector) / Partition.SectorsPerCluster) + 2);
		393	}
		394
		395
		396	/****************************************************************************************************************************************/
		397	/* Function: Fat16_Deinit(void); */
		398	/* */
		399	/* Description: This function uninitializes the fat 16 api */
		400	/* */
		401	/* Returnvalue: The function returns "0" on success */
		402	/****************************************************************************************************************************************/
		403	uint8_t Fat16_Deinit(void)
		404	{
		405	int16_t returnvalue = 0;
		406	uint8_t cnt;
		407	// declare the filepointers as unused.
		408	for(cnt = 0; cnt < FILE_MAX_OPEN; cnt++)
231	killagreg	409	{
297	killagreg	410	if(FilePointer[cnt].State == FSTATE_USED)
231	killagreg	411	{
297	killagreg	412	returnvalue += fclose_(&FilePointer[cnt]); // try to close open file pointers
231	killagreg	413	}
		414
		415	}
297	killagreg	416	SDC_Deinit(); // uninitialize interface to sd-card
		417	Partition.IsValid = 0; // mark data in partition structure as invalid
		418	return(returnvalue);
231	killagreg	419	}
		420
297	killagreg	421	/****************************************************************************************************************************************/
		422	/* Function: Fat16_Init(void); */
		423	/* */
		424	/* Description: This function reads the Masterbootrecord and finds the position of the Volumebootrecord, the FAT and the Rootdir */
		425	/* and stores the information in global variables. */
		426	/* */
		427	/* Returnvalue: The function returns "0" if the filesystem is initialized. */
		428	/****************************************************************************************************************************************/
		429	uint8_t Fat16_Init(void)
231	killagreg	430	{
297	killagreg	431	uint8_t cnt = 0;
		432	uint32_t partitionfirstsector;
		433	VBR_Entry_t *VBR;
		434	MBR_Entry_t *MBR;
		435	File_t *file;
		436	uint8_t result = 0;
231	killagreg	437
297	killagreg	438	printf("\r\n FAT16 init...");
		439	Partition.IsValid = 0;
		440
		441	// declare the filepointers as unused.
		442	for(cnt = 0; cnt < FILE_MAX_OPEN; cnt++)
231	killagreg	443	{
297	killagreg	444	FilePointer[cnt].State = FSTATE_UNUSED;
231	killagreg	445	}
297	killagreg	446	// set current file pinter to first position in list
		447	file = &FilePointer[0];
231	killagreg	448
297	killagreg	449	// try to initialise the sd-card.
		450	if(SD_SUCCESS != SDC_Init())
231	killagreg	451	{
297	killagreg	452	printf("SD-Card could not be initialized.");
		453	result = 1;
		454	goto end;
231	killagreg	455	}
297	killagreg	456
		457	// SD-Card is initialized successfully
		458	if(SD_SUCCESS != SDC_GetSector((uint32_t)MBR_SECTOR,file->Cache)) // Read the MasterBootRecord
231	killagreg	459	{
297	killagreg	460	printf("Error reading the MBR.");
		461	result = 2;
		462	goto end;
		463	}
		464	MBR = (MBR_Entry_t *)file->Cache; // Enter the MBR using the structure MBR_Entry_t.
		465	if((MBR->PartitionEntry1.Type == PART_TYPE_FAT16_ST_32_MB) \|\|
		466	(MBR->PartitionEntry1.Type == PART_TYPE_FAT16_LT_32_MB) \|\|
		467	(MBR->PartitionEntry1.Type == PART_TYPE_FAT16LBA))
		468	{
		469	// get sector offset 1st partition
		470	partitionfirstsector = MBR->PartitionEntry1.NoSectorsBeforePartition;
		471	// Start of Partition is the Volume Boot Sector
		472	if(SD_SUCCESS != SDC_GetSector(partitionfirstsector,file->Cache)) // Read the volume boot record
231	killagreg	473	{
297	killagreg	474	printf("Error reading the VBR.");
		475	result = 3;
		476	goto end;
231	killagreg	477	}
		478	}
297	killagreg	479	else // maybe the medium has no partition assuming sector 0 is the vbr
		480	{
		481	partitionfirstsector = 0;
		482	}
231	killagreg	483
297	killagreg	484	VBR = (VBR_Entry_t *) file->Cache; // Enter the VBR using the structure VBR_Entry_t.
		485	if(VBR->BytesPerSector != BYTES_PER_SECTOR)
		486	{
		487	printf("VBR: Sector size not supported.");
		488	result = 4;
		489	goto end;
		490	}
		491	Partition.SectorsPerCluster = VBR->SectorsPerCluster; // Number of sectors per cluster. Depends on the memorysize of the sd-card.
		492	Partition.FatCopies = VBR->NoFATCopies; // Number of fatcopies.
		493	Partition.MaxRootEntries = VBR->MaxRootEntries; // How many Entries are possible in the rootdirectory (FAT16 allows max. 512 entries).
		494	Partition.SectorsPerFat = VBR->SectorsPerFAT; // The number of sectors per FAT.
231	killagreg	495
297	killagreg	496	/* Calculate the sectorpositon of the FAT, the Rootdirectory and the first Datacluster. */
		497	// Calculate the position of the FileAllocationTable:
		498	// Start + # of Reserved Sectors
		499	Partition.FirstFatSector = (uint32_t)(partitionfirstsector + (uint32_t)(VBR->ReservedSectors));
		500	// Calculate the position of the Rootdirectory:
		501	// Start + # of Reserved Sectors + (# of Sectors Per FAT * # of FAT Copies)
		502	Partition.FirstRootDirSector = Partition.FirstFatSector + (uint32_t)((uint32_t)Partition.SectorsPerFat*(uint32_t)Partition.FatCopies);
		503	// Calculate the position of the first datacluster:
		504	// Start + # of Reserved + (# of Sectors Per FAT * # of FAT Copies) + ((Maximum Root Directory Entries * 32) / Bytes per Sector)
		505	Partition.FirstDataSector = Partition.FirstRootDirSector + (uint32_t)(Partition.MaxRootEntries>>4); // assuming 512 Byte Per Sector
		506	// Calculate the last data sector
		507	if(VBR->NoSectors == 0)
231	killagreg	508	{
297	killagreg	509	printf("VBR: Bad number of sectors.");
		510	result = 5;
		511	goto end;
231	killagreg	512	}
297	killagreg	513	Partition.LastDataSector = Partition.FirstDataSector + VBR->NoSectors - 1;
		514	// check for FAT16 in VBR of first partition
		515	if(!((VBR->FATName[0]=='F') && (VBR->FATName[1]=='A') && (VBR->FATName[2]=='T') && (VBR->FATName[3]=='1')&&(VBR->FATName[4]=='6')))
		516	{
		517	printf("VBR: Partition ist not FAT16 type.");
		518	result = 6;
		519	goto end;
		520	}
		521	Partition.IsValid = 1; // mark data in partition structure as valid
		522	result = 0;
		523	end:
		524	if(result != 0) Fat16_Deinit();
		525	else printf(" ...ok");
		526	return(result);
231	killagreg	527	}
		528
		529
297	killagreg	530
		531	/****************************************************************************************************************************************/
		532	/* Function: ClearCurrCluster(File_t); /
		533	/* */
		534	/* Description: This function fills the current cluster with 0. */
		535	/* */
		536	/* Returnvalue: The function returns 1 on success else 0. */
		537	/****************************************************************************************************************************************/
		538	uint8_t ClearCurrCluster(File_t * file)
231	killagreg	539	{
297	killagreg	540	uint8_t retvalue = 1;
		541	uint32_t i;
231	killagreg	542
297	killagreg	543	if((!Partition.IsValid) \|\| (file == NULL)) return(0);
		544
		545	for(i = 0; i < BYTES_PER_SECTOR; i++) file->Cache[i] = 0; // clear file cache
		546	for(i = 0; i < Partition.SectorsPerCluster; i++)
231	killagreg	547	{
297	killagreg	548	file->SectorInCache = file->FirstSectorOfCurrCluster + i;
		549	if(SD_SUCCESS != SDC_PutSector(file->SectorInCache, file->Cache))
231	killagreg	550	{
297	killagreg	551	Fat16_Deinit();
		552	retvalue = 0;
231	killagreg	553	}
		554	}
297	killagreg	555	return(retvalue);
231	killagreg	556	}
		557
297	killagreg	558	/*****************************************************************************************************************************************/
		559	/* Function: GetNextCluster(File_t* ); */
		560	/* */
		561	/* Description: This function finds the next datacluster of the file specified with File File. /
		562	/* */
		563	/* Returnvalue: The function returns the next cluster or 0 if the last cluster has already reached. */
		564	/*****************************************************************************************************************************************/
		565	uint16_t GetNextCluster(File_t * file)
231	killagreg	566	{
297	killagreg	567	uint16_t cluster = 0;
		568	uint32_t fat_byte_offset, sector, byte;
		569	Fat16Entry_t * fat;
231	killagreg	570
297	killagreg	571	if((!Partition.IsValid) \|\| (file == NULL)) return(cluster);
		572	// if sector is within the data area
		573	if((Partition.FirstDataSector <= file->FirstSectorOfCurrCluster)&& (file->FirstSectorOfCurrCluster <= Partition.LastDataSector))
231	killagreg	574	{
297	killagreg	575	// determine current file cluster
		576	cluster = SectorToFat16Cluster(file->FirstSectorOfCurrCluster);
		577	// calculate byte offset in the fat for corresponding entry
		578	fat_byte_offset = ((uint32_t)cluster)<<1; // two FAT bytes (16 bits) for every cluster
		579	// calculate the sector that contains the current cluster within the fat
		580	sector = Partition.FirstFatSector + ( fat_byte_offset / BYTES_PER_SECTOR);
		581	// calculate byte offset of the current cluster within that fat sector
		582	byte = fat_byte_offset % BYTES_PER_SECTOR;
		583	// read this sector to the file cache
		584	if(file->SectorInCache != sector)
231	killagreg	585	{
297	killagreg	586	file->SectorInCache = sector; // update sector stored in buffer
		587	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache)) // read sector from sd-card
		588	{
		589	Fat16_Deinit();
		590	return (cluster);
		591	}
231	killagreg	592	}
297	killagreg	593	// read the next cluster from cache
		594	fat = (Fat16Entry_t *)(&(file->Cache[byte]));
		595	cluster = fat->NextCluster;
		596	// if last cluster fat entry
		597	if(FAT16_CLUSTER_LAST_MIN <= cluster)
		598	{
		599	cluster = 0;
		600	}
231	killagreg	601	else
		602	{
297	killagreg	603	file->FirstSectorOfCurrCluster = Fat16ClusterToSector(cluster);
		604	file->SectorOfCurrCluster = 0;
		605	file->ByteOfCurrSector = 0;
231	killagreg	606	}
		607	}
297	killagreg	608	return(cluster);
231	killagreg	609	}
		610
		611
297	killagreg	612	/****************************************************************************************************************************************/
		613	/* Function: FindNextFreeCluster(File_t ); /
		614	/* */
		615	/* Description: This function looks in the fat to find the next free cluster */
		616	/* */
		617	/* Returnvalue: The function returns the cluster number of the next free cluster found within the fat. */
		618	/****************************************************************************************************************************************/
		619	uint16_t FindNextFreeCluster(File_t *file)
231	killagreg	620	{
297	killagreg	621	uint32_t fat_sector; // current sector within the fat relative to the first sector of the fat.
		622	uint32_t curr_sector; // current sector
		623	uint16_t fat_entry; // index to an fatentry within the actual sector (256 fatentries are possible within one sector).
		624	uint16_t free_cluster = 0; // next free cluster number.
		625	Fat16Entry_t * fat;
231	killagreg	626
297	killagreg	627	if((!Partition.IsValid) \|\| (file == NULL)) return(0);
231	killagreg	628
297	killagreg	629	// start searching for an empty cluster at the beginning of the fat.
		630	fat_sector = 0;
		631	do
231	killagreg	632	{
297	killagreg	633	curr_sector = Partition.FirstFatSector + fat_sector; // calculate sector to read
		634	file->SectorInCache = curr_sector; // upate the sector number of file cache.
		635	if( SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache)) // read sector of fat from sd-card.
		636	{
		637	Fat16_Deinit();
		638	return(free_cluster);
		639	}
231	killagreg	640
297	killagreg	641	fat = (Fat16Entry_t *)file->Cache; // set fat pointer to file cache
231	killagreg	642
297	killagreg	643	for(fat_entry = 0; fat_entry < FAT16_ENTRIES_PER_SECTOR; fat_entry++) // look for an free cluster at all entries in this sector of the fat.
231	killagreg	644	{
297	killagreg	645	if(fat[fat_entry].NextCluster == FAT16_CLUSTER_FREE) // empty cluster found!!
		646	{
		647	fat[fat_entry].NextCluster = FAT16_CLUSTER_LAST_MAX; // mark this fat-entry as used
		648	if(SD_SUCCESS != SDC_PutSector(file->SectorInCache, file->Cache)) // and save the sector at the sd-card.
		649	{
		650	Fat16_Deinit();
		651	return(free_cluster);
		652	}
		653	free_cluster = (uint16_t)(fat_sector * FAT16_ENTRIES_PER_SECTOR + (uint32_t)fat_entry);
		654	fat_entry = FAT16_ENTRIES_PER_SECTOR; // terminate the search for a free cluster in this sector.
		655	}
231	killagreg	656	}
297	killagreg	657	fat_sector++; // continue the search in next fat sector
		658	// repeat until the end of the fat is reached and no free cluster has been found so far
		659	}while((fat_sector < Partition.SectorsPerFat) && (!free_cluster));
		660	return(free_cluster);
231	killagreg	661	}
		662
		663
297	killagreg	664	/****************************************************************************************************************************************************/
		665	/* Function: int16_t fseek_(File_t , int32_t , uint8_t) */
		666	/* */
		667	/* Description: This function sets the pointer of the stream relative to the position */
		668	/* specified by origin (SEEK_SET, SEEK_CUR, SEEK_END) */
		669	/* Returnvalue: Is 1 if seek was successful */
		670	/****************************************************************************************************************************************************/
		671	int16_t fseek_(File_t *file, int32_t offset, int16_t origin)
231	killagreg	672	{
297	killagreg	673	int32_t fposition = 0;
		674	int16_t retvalue = 1;
231	killagreg	675
297	killagreg	676	if((!Partition.IsValid) \|\| (file == NULL)) return(0);
		677	switch(origin)
231	killagreg	678	{
297	killagreg	679	case SEEK_SET: // Fileposition relative to the beginning of the file.
		680	fposition = 0;
		681	break;
		682	case SEEK_END: // Fileposition relative to the end of the file.
		683	fposition = (int32_t)file->Size;
		684	break;
		685	case SEEK_CUR: // Fileposition relative to the current position of the file.
		686	default:
		687	fposition = file->Position;
		688	break;
		689	}
		690
		691	fposition += offset;
		692
		693	if((fposition >= 0) && (fposition <= (int32_t)file->Size)) // is the pointer still within the file?
		694	{
		695	// reset file position to start of the file
		696	file->FirstSectorOfCurrCluster = file->FirstSectorOfFirstCluster;
		697	file->SectorOfCurrCluster = 0;
		698	file->ByteOfCurrSector = 0;
		699	file->Position = 0;
		700
		701	while(file->Position < fposition) // repeat until the current position is less than target
231	killagreg	702	{
297	killagreg	703	file->Position++; // increment file position
		704	file->ByteOfCurrSector++; // next byte in current sector
		705	if(file->ByteOfCurrSector >= BYTES_PER_SECTOR)
231	killagreg	706	{
297	killagreg	707	file->ByteOfCurrSector = 0; // reading at the beginning of new sector.
		708	file->SectorOfCurrCluster++; // continue reading in next sector
		709	if(file->SectorOfCurrCluster >= Partition.SectorsPerCluster) // if end of cluster is reached, the next datacluster has to be searched in the FAT.
		710	{
		711	if(GetNextCluster(file)) // Sets the clusterpointer of the file to the next datacluster.
		712	{
		713	file->SectorOfCurrCluster = 0;
		714	}
		715	else // the last cluster was allready reached
		716	{
		717	file->SectorOfCurrCluster--; // jump back to the ast sector in the last cluster
		718	file->ByteOfCurrSector = BYTES_PER_SECTOR; // set ByteOfCurrSector one byte over sector end
		719	}
		720	}
231	killagreg	721	}
		722	}
		723	}
297	killagreg	724	if(file->Position == fposition) retvalue = 0;
		725	return(retvalue);
231	killagreg	726	}
		727
		728
297	killagreg	729	/****************************************************************************************************************************************/
		730	/* Function: uint16_t DeleteClusterChain(File file); /
		731	/* */
		732	/* Description: This function trances along a cluster chain in the fat and frees all clusters visited. */
		733	/* */
		734	/****************************************************************************************************************************************/
		735	uint8_t DeleteClusterChain(uint16_t StartCluster)
231	killagreg	736	{
297	killagreg	737	uint16_t cluster;
		738	uint32_t fat_byte_offset, sector, byte;
		739	Fat16Entry_t * fat;
		740	uint8_t buffer[BYTES_PER_SECTOR];
		741	uint32_t sector_in_buffer = 0;
		742	uint8_t repeat = 0;
231	killagreg	743
297	killagreg	744	if(!Partition.IsValid) return 0;
231	killagreg	745
297	killagreg	746	cluster = StartCluster; // init chain trace
		747	// calculate byte offset in the fat for corresponding entry
		748	fat_byte_offset = ((uint32_t)cluster)<<1; // two FAT bytes (16 bits) for every cluster
		749	// calculate the sector that contains the current cluster within the fat
		750	sector = Partition.FirstFatSector + ( fat_byte_offset / BYTES_PER_SECTOR);
		751	// calculate byte offset of the current cluster within that fat sector
		752	byte = fat_byte_offset % BYTES_PER_SECTOR;
		753	do
		754	{
		755	if(sector != sector_in_buffer)
		756	{
		757	// read this sector to buffer
		758	sector_in_buffer = sector;
		759	if(SD_SUCCESS != SDC_GetSector(sector_in_buffer, buffer)) return 0; // read sector from sd-card
		760	}
		761	// read the next cluster from cache
		762	fat = (Fat16Entry_t *)(&(buffer[byte]));
		763	cluster = fat->NextCluster;
		764	if((FAT16_CLUSTER_USED_MIN <= cluster) && (cluster <= FAT16_CLUSTER_USED_MAX) ) repeat = 1;
		765	else repeat = 0;
231	killagreg	766
297	killagreg	767	fat->NextCluster = FAT16_CLUSTER_FREE; // mark current cluster as free
		768	// calculate byte offset in the fat for corresponding entry
		769	fat_byte_offset = ((uint32_t)cluster)<<1; // two FAT bytes (16 bits) for every cluster
		770	// calculate the sector that contains the current cluster within the fat
		771	sector = Partition.FirstFatSector + ( fat_byte_offset / BYTES_PER_SECTOR);
		772	// calculate byte offset of the current cluster within that fat sector
		773	byte = fat_byte_offset % BYTES_PER_SECTOR;
		774	// if new sector is not the sector in buffer or the last cluster in the chain was traced
		775	if((sector != sector_in_buffer) \|\| !repeat)
		776	{ // write sector in buffer
		777	if(SD_SUCCESS != SDC_PutSector(sector_in_buffer,buffer)) return 0;
		778	}
		779	}
		780	while(repeat);
231	killagreg	781
297	killagreg	782	return 1;
231	killagreg	783	}
		784
		785
297	killagreg	786	/****************************************************************************************************************************************/
		787	/* Function: uint16_t AppendCluster(File file); /
		788	/* */
		789	/* Description: This function looks in the fat to find the next free cluster and appends it to the file. */
		790	/* */
		791	/* Returnvalue: The function returns the appened cluster number or 0 of no cluster was appended. */
		792	/****************************************************************************************************************************************/
		793	uint16_t AppendCluster(File_t *file)
231	killagreg	794	{
297	killagreg	795	uint16_t last_cluster, new_cluster = 0;
		796	uint32_t fat_byte_offset, sector, byte;
		797	Fat16Entry_t * fat;
231	killagreg	798
297	killagreg	799	if((!Partition.IsValid) \|\| (file == NULL)) return(new_cluster);
231	killagreg	800
297	killagreg	801	new_cluster = FindNextFreeCluster(file); // the next free cluster found on the disk.
		802	if(new_cluster)
		803	{ // A free cluster was found and can be added to the end of the file.
		804	fseek_(file, 0, SEEK_END); // jump to the end of the file
		805	last_cluster = SectorToFat16Cluster(file->FirstSectorOfCurrCluster); // determine current file cluster
		806	fat_byte_offset = ((uint32_t)last_cluster)<<1;
		807	sector = Partition.FirstFatSector + ( fat_byte_offset / BYTES_PER_SECTOR);
		808	byte = fat_byte_offset % BYTES_PER_SECTOR;
231	killagreg	809
297	killagreg	810	if(file->SectorInCache != sector)
231	killagreg	811	{
297	killagreg	812	file->SectorInCache = sector; // update sector stored in buffer
		813	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache)) // read sector from sd-card
		814	{
		815	Fat16_Deinit();
		816	return(0);
		817	}
231	killagreg	818	}
297	killagreg	819	fat = (Fat16Entry_t *)(&(file->Cache[byte]));
		820	fat->NextCluster = new_cluster; // append the free cluster to the end of the file in the FAT.
		821	if(SD_SUCCESS != SDC_PutSector(file->SectorInCache, file->Cache)) // save the modified sector to the FAT.
231	killagreg	822	{
297	killagreg	823	Fat16_Deinit();
		824	return(0);
231	killagreg	825	}
297	killagreg	826	file->FirstSectorOfCurrCluster = Fat16ClusterToSector(new_cluster);
		827	file->SectorOfCurrCluster = 0;
		828	file->ByteOfCurrSector = 0;
231	killagreg	829	}
297	killagreg	830	return(new_cluster);
231	killagreg	831	}
		832
297	killagreg	833	/****************************************************************************************************************************************************/
		834	/* Function: DirectoryEntryExist(int8_t , uint8_t, uint8_t, File_t ) */
		835	/* */
		836	/* Description: This function searches all possible dir entries until the file or directory is found or the end of the directory is reached */
		837	/* */
		838	/* Returnvalue: This function returns 1 if the directory entry specified was found. */
		839	/****************************************************************************************************************************************************/
		840	uint8_t DirectoryEntryExist(int8_t dirname, uint8_t attribfilter, uint8_t attribmask, File_t file)
		841	{
		842	uint32_t dir_sector, max_dir_sector, curr_sector;
		843	uint16_t dir_entry = 0;
231	killagreg	844
297	killagreg	845	uint16_t end_of_directory_not_reached = 0;
		846	uint8_t i = 0;
		847	uint8_t direntry_exist = 0;
		848	DirEntry_t * dir;
231	killagreg	849
297	killagreg	850	// if incomming pointers are useless return immediatly
		851	if((!Partition.IsValid) \|\| (file == NULL) \|\| (dirname == NULL)) return(direntry_exist);
231	killagreg	852
297	killagreg	853	// dir entries can be searched only in filesclusters that have
		854	// a corresponding dir entry with adir-flag set in its attribute
		855	// or direct within the root directory area
231	killagreg	856
297	killagreg	857	file->FirstSectorOfFirstCluster = 0;
		858	// no current directory exist therefore assume searching in the root
		859	if(file->DirectorySector == 0)
		860	{
		861	max_dir_sector = (Partition.MaxRootEntries * DIRENTRY_SIZE)/BYTES_PER_SECTOR;
		862	file->FirstSectorOfFirstCluster = Partition.FirstRootDirSector;
		863	}
		864	// within the root directory area we can read sectors sequentially until the end of this area
		865	else if((Partition.FirstRootDirSector <= file->DirectorySector) && (file->DirectorySector < Partition.FirstDataSector))
		866	{
		867	max_dir_sector = (Partition.MaxRootEntries * DIRENTRY_SIZE)/BYTES_PER_SECTOR;
		868	}
		869	// within the data clusters we can read sectors sequentially only within the cluster
		870	else if((Partition.FirstDataSector <= file->DirectorySector) && (file->DirectorySector <= Partition.LastDataSector))
		871	{
		872	max_dir_sector = Partition.SectorsPerCluster; // limit max secters before next cluster
		873	}
		874	else return (direntry_exist); // bad sector range for directory sector of the file
		875	// if search area is not defined yet
		876	if(file->FirstSectorOfFirstCluster == 0)
		877	{
		878	// check if the directory entry of current file is existent and has the dir-flag set
		879	file->SectorInCache = file->DirectorySector; // update the sector number of file cache.
		880	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache))// read in the sector.
		881	{
		882	Fat16_Deinit();
		883	return(direntry_exist);
		884	}
		885	dir = (DirEntry_t *)file->Cache; // set pointer to directory
		886	switch((uint8_t)dir[file->DirectoryIndex].Name[0]) // check if current directory exist
		887	{
		888	case SLOT_EMPTY:
		889	case SLOT_DELETED:
		890	// the directrory pointer of this file points to a deleted or not existen directory
		891	// therefore no file or subdirectory can be created
		892	return (direntry_exist);
		893	break;
		894	default: // and is a real directory
		895	if((dir[file->DirectoryIndex].Attribute & ATTR_SUBDIRECTORY) != ATTR_SUBDIRECTORY)
		896	{ // current file is not a directory therefore no file or subdirectory can be created here
		897	return (direntry_exist);
		898	}
		899	break;
		900	}
		901	file->FirstSectorOfFirstCluster = Fat16ClusterToSector(dir[file->DirectoryIndex].StartCluster);
		902	}
231	killagreg	903
297	killagreg	904	// update current file data area position to start of first cluster
		905	file->FirstSectorOfCurrCluster = file->FirstSectorOfFirstCluster;
		906	file->SectorOfCurrCluster = 0;
		907	file->ByteOfCurrSector = 0;
231	killagreg	908
297	killagreg	909	do // loop over all data clusters of the current directory entry
		910	{
		911	dir_sector = 0; // reset sector counter within a new cluster
		912	do // loop over all sectors of a cluster or all sectors of the root directory
		913	{
		914	curr_sector = file->FirstSectorOfCurrCluster + dir_sector; // calculate sector number
		915	file->SectorInCache = curr_sector; // upate the sector number of file cache.
		916	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache))// read the sector
		917	{
		918	Fat16_Deinit();
		919	return(direntry_exist);
		920	}
		921	dir = (DirEntry_t *)file->Cache; // set pointer to directory
		922	// search all directory entries within that sector
		923	for(dir_entry = 0; dir_entry < DIRENTRIES_PER_SECTOR; dir_entry++)
		924	{ // check for existing dir entry
		925	switch((uint8_t)dir[dir_entry].Name[0])
		926	{
		927	case SLOT_EMPTY:
		928	case SLOT_DELETED:
		929	// ignore empty or deleted dir entries
		930	break;
		931	default:
		932	// if existing check attributes before names are compared will safe performance
		933	if ((dir[dir_entry].Attribute & attribmask) != attribfilter) break; // attribute must match
		934	// then compare the name to the giveb dirname (first 11 characters include 8 chars of basename and 3 chars extension.)
		935	i = 0;
		936	while((i < 11) && (dir[dir_entry].Name[i] == dirname[i])) i++;
		937	if (i < 10) break; // names does not match
		938	// if dirname and attribute have matched
		939	file->Attribute = dir[dir_entry].Attribute; // store attribute of found dir entry
		940	file->FirstSectorOfFirstCluster = Fat16ClusterToSector(dir[dir_entry].StartCluster); // set sector of first data cluster
		941	file->FirstSectorOfCurrCluster = file->FirstSectorOfFirstCluster;
		942	file->SectorOfCurrCluster = 0;
		943	file->ByteOfCurrSector = 0;
		944	file->DirectorySector = curr_sector; // current sector
		945	file->DirectoryIndex = dir_entry; // current direntry in current sector
		946	file->Size = dir[dir_entry].Size;
		947	direntry_exist = 1; // mark as found
		948	dir_entry = DIRENTRIES_PER_SECTOR; // stop for-loop
		949	} // end of first byte of name check
		950	}
		951	dir_sector++; // search next sector
		952	// stop if we reached the end of the cluster or the end of the root dir
		953	}while((dir_sector < max_dir_sector) && (!direntry_exist));
231	killagreg	954
297	killagreg	955	// if we are seaching in the data area and the file not found in this cluster so take next cluster.
		956	if(!direntry_exist && ( Partition.FirstDataSector <= file->FirstSectorOfCurrCluster))
		957	{
		958	end_of_directory_not_reached = GetNextCluster(file); // updates File->FirstSectorOfCurrCluster
		959	}
		960	}while((end_of_directory_not_reached) && (!direntry_exist)); // repeat until a next cluster exist an no
		961	return(direntry_exist);
231	killagreg	962	}
		963
		964
297	killagreg	965	/****************************************************************************************************************************************/
		966	/* Function: CreateDirectoryEntry(int8_t , uint16_t, File_t ) */
		967	/* */
		968	/* Description: This function looks for the next free position in the directory and creates an entry. */
		969	/* The type of an directory entry is specified by the file attribute. */
		970	/* */
		971	/* Returnvalue: Return 0 on error */
		972	/****************************************************************************************************************************************/
		973	uint8_t CreateDirectoryEntry(int8_t dirname, uint8_t attrib, File_t file)
231	killagreg	974	{
297	killagreg	975	uint32_t dir_sector, max_dir_sector, curr_sector;
		976	uint16_t dir_entry = 0;
		977	uint16_t subdircluster, dircluster = 0;
		978	uint16_t end_of_directory_not_reached = 0;
		979	uint8_t i = 0;
		980	uint8_t retvalue = 0;
		981	DirEntry_t* dir;
231	killagreg	982
297	killagreg	983	if((!Partition.IsValid) \|\| (file == NULL) \|\| (dirname == NULL)) return (retvalue);
		984	// It is not checked here that the dir entry that should be created is already existent!
231	killagreg	985
297	killagreg	986	// Dir entries can be created only in file-clusters that have
		987	// the dir-flag set in its attribute or within the root directory
231	killagreg	988
297	killagreg	989	file->FirstSectorOfFirstCluster = 0;
		990	// no current directory exist therefore assume creating in the root
		991	if(file->DirectorySector == 0)
231	killagreg	992	{
297	killagreg	993	max_dir_sector = (Partition.MaxRootEntries * DIRENTRY_SIZE)/BYTES_PER_SECTOR;
		994	dircluster = 0;
		995	file->FirstSectorOfFirstCluster = Partition.FirstRootDirSector;
		996	}
		997	// within the root directory area we can read sectors sequentially until the end of this area
		998	else if((Partition.FirstRootDirSector <= file->DirectorySector) && (file->DirectorySector < Partition.FirstDataSector))
		999	{
		1000	max_dir_sector = (Partition.MaxRootEntries * DIRENTRY_SIZE)/BYTES_PER_SECTOR;
		1001	}
		1002	// within the data clusters we can read sectors sequentially only within the cluster
		1003	else if((Partition.FirstDataSector <= file->DirectorySector) && (file->DirectorySector <= Partition.LastDataSector))
		1004	{
		1005	max_dir_sector = Partition.SectorsPerCluster;
		1006	}
		1007	else return (retvalue); // bad sector range for directory sector of the file
		1008	// if search area is not defined yet
		1009	if(file->FirstSectorOfFirstCluster == 0)
		1010	{
		1011	// check if the directory entry of current file is existent and has the dir-flag set
		1012	file->SectorInCache = file->DirectorySector; // update the sector number of file cache.
		1013	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache))// read in the sector.
		1014	{
		1015	Fat16_Deinit();
		1016	return(retvalue);
		1017	}
		1018	dir = (DirEntry_t *)file->Cache; // set pointer to directory
		1019	switch((uint8_t)dir[file->DirectoryIndex].Name[0]) // check if current directory exist
		1020	{
		1021	case SLOT_EMPTY:
		1022	case SLOT_DELETED:
		1023	return (retvalue);
		1024	break;
		1025	default: // and is a real directory
		1026	if((dir[file->DirectoryIndex].Attribute & ATTR_SUBDIRECTORY) != ATTR_SUBDIRECTORY)
		1027	{ // current file is not a directory therefore no file or subdirectory can be created here
		1028	return (retvalue);
		1029	}
		1030	break;
		1031	}
		1032	dircluster = dir[file->DirectoryIndex].StartCluster;
		1033	file->FirstSectorOfFirstCluster = Fat16ClusterToSector(dircluster);
		1034	}
231	killagreg	1035
297	killagreg	1036	subdircluster = FindNextFreeCluster(file); // get the next free cluster on the disk and mark it as used.
		1037	if(subdircluster)
		1038	{
		1039	file->FirstSectorOfCurrCluster = file->FirstSectorOfFirstCluster;
		1040	file->SectorOfCurrCluster = 0;
		1041	do // loop over all clusters of current directory
		1042	{
		1043	dir_sector = 0; // reset sector counter within a new cluster
		1044	do // loop over all sectors of a cluster or all sectors of the root directory
231	killagreg	1045	{
297	killagreg	1046	curr_sector = file->FirstSectorOfCurrCluster + dir_sector; // calculate sector number
		1047	file->SectorInCache = curr_sector; // upate the sector number of file cache.
		1048	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache))// read in the sector.
231	killagreg	1049	{
297	killagreg	1050	Fat16_Deinit();
		1051	return(retvalue);
231	killagreg	1052	}
297	killagreg	1053	dir = (DirEntry_t *)file->Cache; // set pointer to directory
		1054	// search all directory entries of a sector
		1055	for(dir_entry = 0; dir_entry < DIRENTRIES_PER_SECTOR; dir_entry++)
		1056	{ // check if current direntry is available
		1057	if(((uint8_t)dir[dir_entry].Name[0] == SLOT_EMPTY) \|\| ((uint8_t)dir[dir_entry].Name[0] == SLOT_DELETED))
		1058	{ // a free direntry was found
		1059	for(i = 0; i < 11; i++) dir[dir_entry].Name[i] = dirname[i]; // Set dir name
		1060	dir[dir_entry].Attribute = attrib; // Set the attribute of the new directoryentry.
		1061	dir[dir_entry].StartCluster = subdircluster; // copy the location of the first datacluster to the directoryentry.
		1062	dir[dir_entry].DateTime = FileDateTime(&SystemTime); // set date/time
		1063	dir[dir_entry].Size = 0; // the new createted file has no content yet.
		1064	if(SD_SUCCESS != SDC_PutSector(file->SectorInCache, file->Cache)) // write back to card
		1065	{
		1066	Fat16_Deinit();
		1067	return(retvalue);
		1068	}
		1069	file->FirstSectorOfFirstCluster = Fat16ClusterToSector(subdircluster); // Calculate absolute sectorposition of first datacluster.
		1070	file->FirstSectorOfCurrCluster = file->FirstSectorOfFirstCluster; // Start reading the file with the first sector of the first datacluster.
		1071	file->SectorOfCurrCluster = 0; // reset sector of cureen cluster
		1072	file->ByteOfCurrSector = 0; // reset the byte location within the current sector
		1073	file->Attribute = attrib; // set file attribute to dir attribute
		1074	file->Size = 0; // new file has no size
		1075	file->DirectorySector = curr_sector;
		1076	file->DirectoryIndex = dir_entry;
		1077	if((attrib & ATTR_SUBDIRECTORY) == ATTR_SUBDIRECTORY) // if a new directory was created then initilize the data area
		1078	{
		1079	ClearCurrCluster(file); // fill cluster with zeros
		1080	file->SectorInCache = file->FirstSectorOfFirstCluster;
		1081	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache))// read in the sector.
		1082	{
		1083	Fat16_Deinit();
		1084	return(retvalue);
		1085	}
		1086	dir = (DirEntry_t *)file->Cache;
		1087	// create direntry "." to current dir
		1088	dir[0].Name[0] = 0x2E;
		1089	for(i = 1; i < 11; i++) dir[0].Name[i] = ' ';
		1090	dir[0].Attribute = ATTR_SUBDIRECTORY;
		1091	dir[0].StartCluster = subdircluster;
		1092	dir[0].DateTime = 0;
		1093	dir[0].Size = 0;
		1094	// create direntry ".." to the upper dir
		1095	dir[1].Name[0] = 0x2E;
		1096	dir[1].Name[1] = 0x2E;
		1097	for(i = 2; i < 11; i++) dir[1].Name[i] = ' ';
		1098	dir[1].Attribute = ATTR_SUBDIRECTORY;
		1099	dir[1].StartCluster = dircluster;
		1100	dir[1].DateTime = 0;
		1101	dir[1].Size = 0;
		1102	if(SD_SUCCESS != SDC_PutSector(file->SectorInCache, file->Cache))// read in the sector.
		1103	{
		1104	Fat16_Deinit();
		1105	return(retvalue);
		1106	}
		1107	}
		1108	retvalue = 1;
		1109	dir_entry = DIRENTRIES_PER_SECTOR; // stop for-loop
		1110	}
		1111	}
		1112	dir_sector++; // search next sector
		1113	// stop if we reached the end of the cluster or the end of the root dir
		1114	}while((dir_sector < max_dir_sector) && (!retvalue));
		1115
		1116	// if we are seaching in the data area and the file not found in this cluster so take next cluster.
		1117	if(!retvalue && ( Partition.FirstDataSector <= file->FirstSectorOfCurrCluster))
231	killagreg	1118	{
297	killagreg	1119	end_of_directory_not_reached = GetNextCluster(file); // updates File->FirstSectorOfCurrCluster
231	killagreg	1120	}
297	killagreg	1121	}while((end_of_directory_not_reached) && (!retvalue));
		1122	// Perhaps we are at the end of the last cluster of a directory file an have no free direntry found.
		1123	// Then we would need to add a cluster to that file and create the new direntry there.
		1124	// This code is not implemented yet, because its occurs only if more that 32*32=1024 direntries are
		1125	// within a subdirectory of root.
231	killagreg	1126	}
297	killagreg	1127	return(retvalue); // return 1 if file has been created otherwise return 0.
231	killagreg	1128	}
		1129
297	killagreg	1130	/********************************************************************************************************************************************/
		1131	/* Function: FileExist(const int8_t* filename, uint8_t attribfilter, uint8_t attribmask, File_t file); /
		1132	/* */
		1133	/* Description: This function looks for the specified file including its subdirectories beginning */
		1134	/* in the rootdirectory of the drive. If the file is found the Filepointer properties are */
		1135	/* updated. */
		1136	/* */
		1137	/* Returnvalue: 1 if file is found else 0. */
		1138	/********************************************************************************************************************************************/
		1139	uint8_t FileExist(const int8_t* filename, const uint8_t attribfilter, const uint8_t attribmask, File_t *file)
231	killagreg	1140	{
297	killagreg	1141	int8_t* path = 0;
		1142	int8_t* subpath = 0;
		1143	uint8_t af, am, file_exist = 0;
		1144	int8_t dirname[12]; // 8+3 + temination character
231	killagreg	1145
297	killagreg	1146	// if incomming pointers are useless return immediatly
		1147	if ((filename == NULL) \|\| (file == NULL) \|\| (!Partition.IsValid)) return 0;
231	killagreg	1148
297	killagreg	1149	// trace along the filepath
		1150	path = (int8_t*)filename; // start a the beginning of the filename string
		1151	file->DirectorySector = 0; // start at RootDirectory with file search
		1152	file->DirectoryIndex = 0;
		1153	// as long as the file was not found and the remaining path is not empty
		1154	while((*path != 0) && !file_exist)
		1155	{ // separate dirname and subpath from filepath string
		1156	subpath = SeperateDirName(path, dirname);
		1157	if(subpath != NULL)
231	killagreg	1158	{
297	killagreg	1159	if(*subpath == 0)
		1160	{ // empty subpath indicates last element of dir chain
		1161	af = attribfilter;
		1162	am = attribmask;
		1163	}
		1164	else // it must be a subdirectory and no volume label
231	killagreg	1165	{
297	killagreg	1166	af = ATTR_SUBDIRECTORY;
		1167	am = ATTR_SUBDIRECTORY\|ATTR_VOLUMELABEL;
		1168	}
		1169	if(!DirectoryEntryExist(dirname, af, am, file))
		1170	{
		1171	return (file_exist); // subdirectory does not exist
		1172	}
		1173	else
		1174	{
		1175	if (*subpath == 0)
231	killagreg	1176	{
297	killagreg	1177	file_exist = 1; // last element of path chain was found with the given attribute filter
231	killagreg	1178	}
		1179	}
		1180	}
297	killagreg	1181	else // error seperating the subpath
231	killagreg	1182	{
297	killagreg	1183	return file_exist; // bad subdir format
231	killagreg	1184	}
297	killagreg	1185	path = subpath;
		1186	subpath = 0;
231	killagreg	1187	}
297	killagreg	1188	return (file_exist);
231	killagreg	1189	}
		1190
		1191
297	killagreg	1192	/********************************************************************************************************************************************/
		1193	/* Function: FileCreate(const s8* filename, u8 attrib, File_t file); /
		1194	/* */
		1195	/* Description: This function looks for the specified file including its subdirectories beginning */
		1196	/* in the rootdirectory of the partition. If the file is found the Filepointer properties are */
		1197	/* updated. If file or its subdirectories are not found they will be created */
		1198	/* */
		1199	/* Returnvalue: 1 if file was created else 0. */
		1200	/********************************************************************************************************************************************/
		1201	uint8_t FileCreate(const int8_t* filename, const uint8_t attrib, File_t *file)
231	killagreg	1202	{
297	killagreg	1203	int8_t *path = 0;
		1204	int8_t *subpath = 0;
		1205	uint8_t af, am, file_created = 0;
		1206	int8_t dirname[12];
231	killagreg	1207
297	killagreg	1208	// if incomming pointers are useless return immediatly
		1209	if ((filename == NULL) \|\| (file == NULL) \|\| (!Partition.IsValid)) return 0;
231	killagreg	1210
297	killagreg	1211	// trace along the filepath
		1212	path = (int8_t*)filename; // start a the beginning of the filename string
		1213	file->DirectorySector = 0; // start at RootDirectory with file search
		1214	file->DirectoryIndex = 0;
		1215	// as long as the file was not created and the remaining file path is not empty
		1216	while((*path != 0) && !file_created)
		1217	{ // separate dirname and subpath from filepath string
		1218	subpath = SeperateDirName(path, dirname);
		1219	if(subpath != NULL)
231	killagreg	1220	{
297	killagreg	1221	if(*subpath == 0)
		1222	{ // empty subpath indicates last element of dir chain
		1223	af = ATTR_NONE;
		1224	am = ATTR_SUBDIRECTORY\|ATTR_VOLUMELABEL; // any file that is no subdir or volume label
		1225	}
		1226	else // it must be a subdirectory and no volume label
231	killagreg	1227	{
297	killagreg	1228	af = ATTR_SUBDIRECTORY;
		1229	am = ATTR_SUBDIRECTORY\|ATTR_VOLUMELABEL;
231	killagreg	1230	}
297	killagreg	1231	if(!DirectoryEntryExist(dirname, af, am, file)) // if subdir or file is not existent
		1232	{ // try to create subdir or file
		1233	if(*subpath == 0) af = attrib; // if last element in dir chain take the given attribute
		1234	if(!CreateDirectoryEntry(dirname, af, file))
		1235	{ // could not be created
		1236	return(file_created);
231	killagreg	1237	}
297	killagreg	1238	else if (*subpath == 0) file_created = 1; // last element of path chain was created
231	killagreg	1239	}
		1240	}
297	killagreg	1241	else // error seperating the subpath
231	killagreg	1242	{
297	killagreg	1243	return file_created; // bad subdir format
231	killagreg	1244	}
297	killagreg	1245	path = subpath;
		1246	subpath = 0;
231	killagreg	1247	}
297	killagreg	1248	return (file_created);
231	killagreg	1249	}
		1250
		1251
297	killagreg	1252	/********************************************************************************************************************************************/
		1253	/* Function: File_t * fopen_(int8_t* filename, int8_t mode); */
		1254	/* */
		1255	/* Description: This function looks for the specified file in the rootdirectory of the drive. If the file is found the number of the */
		1256	/* corrosponding filepointer is returned. Only modes 'r' (reading) and 'a' append are implemented yet. */
		1257	/* */
		1258	/* Returnvalue: The filepointer to the file or 0 if faild. */
		1259	/********************************************************************************************************************************************/
		1260	File_t * fopen_(const int8_t *filename, const int8_t mode)
231	killagreg	1261	{
297	killagreg	1262	File_t *file = 0;
231	killagreg	1263
297	killagreg	1264	if((!Partition.IsValid) \|\| (filename == 0)) return(file);
		1265
		1266	// Look for an unused filepointer in the file pointer list?
		1267	file = LockFilePointer();
		1268	// if no unused file pointer was found return 0
		1269	if(file == NULL) return(file);
		1270
		1271	// now we have found a free filepointer and claimed it
		1272	// so let initiate its property values
		1273	file->FirstSectorOfFirstCluster = 0; // Sectorpointer to the first sector of the first datacluster of the file.
		1274	file->FirstSectorOfCurrCluster = 0; // Pointer to the cluster which is edited at the moment.
		1275	file->SectorOfCurrCluster = 0; // The sector which is edited at the moment (cluster_pointer + sector_index).
		1276	file->ByteOfCurrSector = 0; // The bytelocation within the current sector (cluster_pointer + sector_index + byte_index).
		1277	file->Mode = mode; // mode of fileoperation (read,write)
		1278	file->Size = 0; // the size of the opened file in bytes.
		1279	file->Position = 0; // pointer to a byte within the file 0 < fileposition < filesize
		1280	file->SectorInCache = 0; // the last sector read, wich is still in the sectorbuffer.
		1281	file->DirectorySector = 0; // the sectorposition where the directoryentry has been made.
		1282	file->DirectoryIndex = 0; // the index to the directoryentry within the specified sector.
		1283	file->Attribute = 0; // the attribute of the file opened.
		1284
		1285	// check if a real file (no directory) to the given filename exist
		1286	if(FileExist(filename, ATTR_NONE, ATTR_SUBDIRECTORY\|ATTR_VOLUMELABEL, file))
		1287	{ // file exist
		1288	switch(mode) // check mode
231	killagreg	1289	{
297	killagreg	1290	case 'a': // if mode is: append to file
		1291	if((file->Attribute & ATTR_READONLY) == ATTR_READONLY)
		1292	{ // file is marked as readonly --> do not open this file
		1293	fclose_(file);
		1294	file = NULL;
		1295	}
		1296	else
		1297	{ // file is not marked as read only --> goto end of file
		1298	fseek_(file, 0, SEEK_END); // point to the end of the file
		1299	}
		1300	break;
		1301	case 'w': // if mode is: write to file
		1302	if((file->Attribute & ATTR_READONLY) == ATTR_READONLY)
		1303	{ // file is marked as readonly --> do not open this file
		1304	fclose_(file);
		1305	file = NULL;
		1306	}
		1307	else
		1308	{ // file is not marked as read only --> goto start of file
		1309	// free all clusters of that file
		1310	DeleteClusterChain(SectorToFat16Cluster(file->FirstSectorOfFirstCluster));
		1311	// mar an empy cluster as the last one and store the corresponding sector
		1312	file->FirstSectorOfFirstCluster = Fat16ClusterToSector(FindNextFreeCluster(file));
		1313	file->FirstSectorOfCurrCluster = file->FirstSectorOfFirstCluster;
		1314	file->SectorOfCurrCluster = 0;
		1315	file->ByteOfCurrSector = 0;
		1316	file->Size = 0;
		1317	file->Position = 0;
		1318	fseek_(file, 0, SEEK_SET);
		1319	}
		1320	break;
		1321	case 'r': // if mode is: read from file
		1322	// goto end of file
		1323	fseek_(file, 0, SEEK_SET);
		1324	break;
		1325	default: // other modes are not supported
		1326	fclose_(file);
		1327	file = NULL;
231	killagreg	1328	break;
		1329	}
297	killagreg	1330	return(file);
231	killagreg	1331	}
297	killagreg	1332	else // file does not exist
231	killagreg	1333	{
297	killagreg	1334	switch(mode) // check mode
231	killagreg	1335	{
297	killagreg	1336	case 'a':
		1337	case 'w': // if mode is write or append
		1338	// try to create the file
		1339	if(!FileCreate(filename, ATTR_ARCHIVE, file))
		1340	{ // if it could not be created
		1341	fclose_(file);
		1342	file = NULL;
		1343	}
		1344	break;
		1345	case 'r': // else opened for 'r'
		1346	default: // of unsupported mode
		1347	fclose_(file);
		1348	file = NULL;
		1349	break;
231	killagreg	1350	}
297	killagreg	1351	return(file);
231	killagreg	1352	}
297	killagreg	1353	// we should never come to this point
		1354	fclose_(file);
		1355	file = NULL;
		1356	return(file);
231	killagreg	1357	}
		1358
297	killagreg	1359	/****************************************************************************************************************************************************/
		1360	/* Function: fflush_(File ); /
		1361	/* */
		1362	/* Description: This function writes the data already in the buffer but not yet written to the file. */
		1363	/* */
		1364	/* Returnvalue: 0 on success EOF on error */
		1365	/****************************************************************************************************************************************************/
		1366	int16_t fflush_(File_t *file)
		1367	{
		1368	DirEntry_t *dir;
231	killagreg	1369
297	killagreg	1370	if((file == NULL) \|\| (!Partition.IsValid)) return (EOF);
231	killagreg	1371
297	killagreg	1372	switch(file->Mode)
		1373	{
		1374	case 'a':
		1375	case 'w':
		1376	if(file->ByteOfCurrSector > 0) // has data been added to the file?
		1377	{
		1378	if(SD_SUCCESS != SDC_PutSector(file->SectorInCache, file->Cache))// save the data still in the buffer
		1379	{
		1380	Fat16_Deinit();
		1381	return(EOF);
		1382	}
		1383	}
		1384	file->SectorInCache = file->DirectorySector;
		1385	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache)) // read the directory entry for this file.
		1386	{
		1387	Fat16_Deinit();
		1388	return(EOF);
		1389	}
231	killagreg	1390
297	killagreg	1391	dir = (DirEntry_t *)file->Cache;
		1392	dir[file->DirectoryIndex].Size = file->Size; // update file size
		1393	dir[file->DirectoryIndex].DateTime = FileDateTime(&SystemTime); // update date time
		1394	if(SD_SUCCESS != SDC_PutSector(file->SectorInCache, file->Cache)) // write back to sd-card
		1395	{
		1396	Fat16_Deinit();
		1397	return(EOF);
		1398	}
		1399	break;
		1400	case 'r':
		1401	default:
		1402	return(EOF);
		1403	break;
231	killagreg	1404
297	killagreg	1405	}
		1406	return(0);
231	killagreg	1407	}
		1408
297	killagreg	1409	/****************************************************************************************************************************************/
		1410	/* Function: fclose_(File file); /
		1411	/* */
		1412	/* Description: This function closes the open file by writing the remaining data */
		1413	/* from the buffer to the device and entering the filesize in the directory entry. */
		1414	/* */
		1415	/* Returnvalue: 0 on success EOF on error */
		1416	/****************************************************************************************************************************************/
		1417	int16_t fclose_(File_t *file)
		1418	{
		1419	int16_t returnvalue = EOF;
231	killagreg	1420
297	killagreg	1421	if(file == NULL) return(returnvalue);
		1422	returnvalue = fflush_(file);
		1423	UnlockFilePointer(file);
		1424	return(returnvalue);
		1425	}
231	killagreg	1426
297	killagreg	1427	/********************************************************************************************************************************************/
		1428	/* Function: fgetc_(File file); /
		1429	/* */
		1430	/* Description: This function reads and returns one character from the specified file. Is the end of the actual sector reached the */
		1431	/* next sector of the cluster is read. If the last sector of the cluster read the next cluster will be searched in FAT. */
		1432	/* */
		1433	/* Returnvalue: The function returns the character read from the specified memorylocation as u8 casted to s16 or EOF. */
		1434	/********************************************************************************************************************************************/
		1435	int16_t fgetc_(File_t *file)
231	killagreg	1436	{
297	killagreg	1437	int16_t c = EOF;
		1438	uint32_t curr_sector;
231	killagreg	1439
297	killagreg	1440	if( (!Partition.IsValid) \|\| (file == NULL)) return(c);
		1441	// if the end of the file is not reached, get the next character.
		1442	if((0 < file->Size) && ((file->Position+1) < file->Size) )
231	killagreg	1443	{
297	killagreg	1444	curr_sector = file->FirstSectorOfCurrCluster; // calculate the sector of the next character to be read.
		1445	curr_sector += file->SectorOfCurrCluster;
231	killagreg	1446
297	killagreg	1447	if(file->SectorInCache != curr_sector)
231	killagreg	1448	{
297	killagreg	1449	file->SectorInCache = curr_sector;
		1450	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache,file->Cache))
		1451	{
		1452	Fat16_Deinit();
		1453	return(c);
		1454	}
231	killagreg	1455	}
297	killagreg	1456	c = (int16_t) file->Cache[file->ByteOfCurrSector];
		1457	file->Position++; // increment file position
		1458	file->ByteOfCurrSector++; // goto next byte in sector
		1459	if(file->ByteOfCurrSector >= BYTES_PER_SECTOR) // if end of sector
231	killagreg	1460	{
297	killagreg	1461	file->ByteOfCurrSector = 0; // reset byte location
		1462	file->SectorOfCurrCluster++; // next sector
		1463	if(file->SectorOfCurrCluster >= Partition.SectorsPerCluster) // if end of cluster is reached, the next datacluster has to be searched in the FAT.
231	killagreg	1464	{
297	killagreg	1465
		1466	if(GetNextCluster(file)) // Sets the clusterpointer of the file to the next datacluster.
231	killagreg	1467	{
297	killagreg	1468	file->SectorOfCurrCluster = 0; // start reading new cluster at first sector of the cluster.
231	killagreg	1469	}
297	killagreg	1470	else // the last cluster was allready reached
		1471	{
		1472	file->SectorOfCurrCluster--; // jump back to the last sector in the last cluster
		1473	file->ByteOfCurrSector = BYTES_PER_SECTOR; // set ByteOfCurrSector one byte over sector end
		1474	}
231	killagreg	1475	}
		1476	}
		1477	}
297	killagreg	1478	return(c);
231	killagreg	1479	}
		1480
297	killagreg	1481	/********************************************************************************************************************************************/
		1482	/* Function: fputc_( const s8 c, File file); /
		1483	/* */
		1484	/* Description: This function writes a byte to the specified file and takes care of writing the necessary FAT- Entries. */
		1485	/* next sector of the cluster is read. If the last sector of the cluster read the next cluster will be searched in FAT. */
		1486	/* */
		1487	/* Returnvalue: The function returns the character written to the stream or EOF on error. */
		1488	/********************************************************************************************************************************************/
		1489	int16_t fputc_(const int8_t c, File_t *file)
231	killagreg	1490	{
297	killagreg	1491	uint32_t curr_sector = 0;
231	killagreg	1492
297	killagreg	1493	if((!Partition.IsValid) \|\| (file == NULL)) return(EOF);
231	killagreg	1494
297	killagreg	1495	// If file position equals to file size, then the end of file has reached.
		1496	// In this chase it has to be checked that the ByteOfCurrSector is BYTES_PER_SECTOR
		1497	// and a new cluster should be appended.
		1498	if((file->Position >= file->Size) && (file->ByteOfCurrSector >= BYTES_PER_SECTOR))
		1499	{
		1500	if(!AppendCluster(file)) return(EOF);
		1501	}
231	killagreg	1502
297	killagreg	1503	curr_sector = file->FirstSectorOfCurrCluster;
		1504	curr_sector += file->SectorOfCurrCluster;
		1505	if(file->SectorInCache != curr_sector)
		1506	{
		1507	file->SectorInCache = curr_sector;
		1508	if(SD_SUCCESS != SDC_GetSector(file->SectorInCache, file->Cache))
		1509	{
		1510	Fat16_Deinit();
		1511	return(EOF);
		1512	}
		1513	}
231	killagreg	1514
297	killagreg	1515	file->Cache[file->ByteOfCurrSector] = (uint8_t)c; // write databyte into the buffer. The byte will be written to the device at once
		1516	if(file->Size == file->Position) file->Size++; // a character has been written to the file so the size is incremented only when the character has been added at the end of the file.
		1517	file->Position++; // the actual positon within the file.
		1518	file->ByteOfCurrSector++; // goto next byte in sector
		1519	if(file->ByteOfCurrSector >= BYTES_PER_SECTOR) // if the end of this sector is reached yet
		1520	{ // save the sector to the sd-card
		1521	if(SD_SUCCESS != SDC_PutSector(file->SectorInCache, file->Cache))
231	killagreg	1522	{
297	killagreg	1523	Fat16_Deinit();
		1524	return(EOF);
		1525	}
		1526	file->ByteOfCurrSector = 0; // reset byte location
		1527	file->SectorOfCurrCluster++; // next sector
		1528	if(file->SectorOfCurrCluster >= Partition.SectorsPerCluster)// if end of cluster is reached, the next datacluster has to be searched in the FAT.
		1529	{
		1530	if(!GetNextCluster(file)) // Sets the clusterpointer of the file to the next datacluster.
		1531	{ // if current cluster was the last cluster of the file
		1532	if(!AppendCluster(file)) // append a new and free cluster at the end of the file.
231	killagreg	1533	{
297	killagreg	1534	file->SectorOfCurrCluster--; // jump back to last sector of last cluster
		1535	file->ByteOfCurrSector = BYTES_PER_SECTOR; // set byte location to 1 byte over sector len
		1536	return(EOF);
231	killagreg	1537	}
		1538	}
297	killagreg	1539	else // next cluster
231	killagreg	1540	{
297	killagreg	1541	file->SectorOfCurrCluster = 0; // start reading new cluster at first sector of the cluster.
231	killagreg	1542	}
		1543	}
		1544	}
297	killagreg	1545	return(0);
231	killagreg	1546	}
		1547
		1548
297	killagreg	1549	/****************************************************************************************************************************************/
		1550	/* Function: fread_(void buffer, uint32_t size, uint32_t count, File File); */
		1551	/* */
		1552	/* Description: This function reads count objects of the specified size */
		1553	/* from the actual position of the file to the specified buffer. */
		1554	/* */
		1555	/* Returnvalue: The function returns the number of objects (not bytes) read from the file. */
		1556	/****************************************************************************************************************************************/
		1557	uint32_t fread_(void buffer, uint32_t size, uint32_t count, File_t file)
		1558	{
		1559	uint32_t object_cnt = 0; // count the number of objects read from the file.
		1560	uint32_t object_size = 0; // count the number of bytes read from the actual object.
		1561	uint8_t *pbuff = 0; // a pointer to the actual bufferposition.
		1562	uint8_t success = 1; // no error occured during read operation to the file.
		1563	int16_t c;
231	killagreg	1564
297	killagreg	1565	if((!Partition.IsValid) \|\| (file == NULL) \|\| (buffer == NULL)) return(0);
231	killagreg	1566
297	killagreg	1567	pbuff = (uint8_t ) buffer; // cast the void pointer to an u8
231	killagreg	1568
297	killagreg	1569	while((object_cnt < count) && success)
231	killagreg	1570	{
297	killagreg	1571	object_size = size;
		1572	while((size > 0) && success)
		1573	{
		1574	c = fgetc_(file);
		1575	if(c != EOF)
		1576	{
		1577	*pbuff = (uint8_t)c; // read a byte from the buffer to the opened file.
		1578	pbuff++;
		1579	size--;
		1580	}
		1581	else // error or end of file reached
		1582	{
		1583	success = 0;
		1584	}
		1585	}
		1586	if(success) object_cnt++;
231	killagreg	1587	}
297	killagreg	1588	return(object_cnt); // return the number of objects succesfully read from the file
231	killagreg	1589	}
		1590
		1591
297	killagreg	1592	/****************************************************************************************************************************************/
		1593	/* Function: fwrite_(void buffer, uint32_t size, uint32_t count, File file); */
		1594	/* */
		1595	/* Description: This function writes count objects of the specified size */
		1596	/* from the buffer pointer to the actual position in the file. */
		1597	/* */
		1598	/* Returnvalue: The function returns the number of objects (not bytes) read from the file. */
		1599	/****************************************************************************************************************************************/
		1600	uint32_t fwrite_(void buffer, uint32_t size, uint32_t count, File_t file)
231	killagreg	1601	{
297	killagreg	1602	uint32_t object_cnt = 0; // count the number of objects written to the file.
		1603	uint32_t object_size = 0; // count the number of bytes written from the actual object.
		1604	uint8_t *pbuff = 0; // a pointer to the actual bufferposition.
		1605	uint8_t success = 1; // no error occured during write operation to the file.
		1606	int16_t c;
231	killagreg	1607
297	killagreg	1608	if((!Partition.IsValid) \|\| (file == NULL) \|\| (buffer == NULL)) return(0);
231	killagreg	1609
297	killagreg	1610	pbuff = (uint8_t ) buffer; // cast the void pointer to an u8
231	killagreg	1611
297	killagreg	1612	while((object_cnt < count) && success)
231	killagreg	1613	{
297	killagreg	1614	object_size = size;
		1615	while((size > 0) && success)
231	killagreg	1616	{
297	killagreg	1617	c = fputc_(*pbuff, file); // write a byte from the buffer to the opened file.
		1618	if(c != EOF)
231	killagreg	1619	{
297	killagreg	1620	pbuff++;
		1621	size--;
231	killagreg	1622	}
297	killagreg	1623	else
231	killagreg	1624	{
297	killagreg	1625	success = 0;
231	killagreg	1626	}
		1627	}
297	killagreg	1628	if(success) object_cnt++;
231	killagreg	1629	}
		1630
297	killagreg	1631	return(object_cnt); // return the number of objects succesfully written to the file
231	killagreg	1632	}
		1633
		1634
297	killagreg	1635	/****************************************************************************************************************************************/
		1636	/* Function: fputs_(const int8_t string, File_t File); */
		1637	/* */
		1638	/* Description: This function writes a string to the specified file. */
		1639	/* */
		1640	/* Returnvalue: The function returns a no negative value or EOF on error. */
		1641	/****************************************************************************************************************************************/
		1642	int16_t fputs_(const int8_t string, File_t file)
231	killagreg	1643	{
297	killagreg	1644	uint8_t i=0;
		1645	int16_t c = 0;
231	killagreg	1646
297	killagreg	1647	if((!Partition.IsValid) \|\| (file == NULL) \|\| (string == NULL)) return(0);
231	killagreg	1648
297	killagreg	1649	while((string[i] != 0)&& (c != EOF))
231	killagreg	1650	{
297	killagreg	1651	c = fputc_(string[i], file);
		1652	i++;
231	killagreg	1653	}
297	killagreg	1654	return(c);
231	killagreg	1655	}
		1656
297	killagreg	1657	/****************************************************************************************************************************************/
		1658	/* Function: fgets_(int8 , int16_t , File_t ); */
		1659	/* */
		1660	/* Description: This function reads a string from the file to the specifies string. */
		1661	/* */
		1662	/* Returnvalue: A pointer to the string read from the file or 0 on error. */
		1663	/****************************************************************************************************************************************/
		1664	uint8_t * fgets_(int8_t string, int16_t length, File_t file)
231	killagreg	1665	{
297	killagreg	1666	uint8_t *pbuff;
		1667	int16_t c = 0;
231	killagreg	1668
297	killagreg	1669	if((!Partition.IsValid) \|\| (file == NULL) \|\| (string == NULL) \|\| (length = 0)) return (0);
		1670	pbuff = string;
		1671	while(length > 1) // read the count-1 characters from the file to the string.
231	killagreg	1672	{
297	killagreg	1673	c = fgetc_(file); // read a character from the opened file.
		1674	switch(c)
		1675	{
		1676	case 0x0A:
		1677	c = 0; // set string terminator
		1678	length = 1; // stop loop
		1679	break;
231	killagreg	1680
297	killagreg	1681	case EOF:
		1682	c = 0; // set string terminator
		1683	length = 1; // stop loop
		1684	break;
231	killagreg	1685	}
297	killagreg	1686	*pbuff = (uint8_t)c; // copy byte to string
		1687	length--;
		1688	pbuff++;
231	killagreg	1689	}
297	killagreg	1690	return(string);
		1691	}
231	killagreg	1692
297	killagreg	1693	/****************************************************************************************************************************************/
		1694	/* Function: fexist_(const int8_t); /
		1695	/* */
		1696	/* Description: This function checks if a file already exist. */
		1697	/* */
		1698	/* Returnvalue: 1 if the file exist else 0. */
		1699	/****************************************************************************************************************************************/
		1700	uint8_t fexist_(const int8_t* filename)
		1701	{
		1702	uint8_t exist = 0;
		1703	File_t *file = 0;
		1704	file = LockFilePointer();
		1705	exist = FileExist(filename, ATTR_NONE, ATTR_SUBDIRECTORY\|ATTR_VOLUMELABEL, file);
		1706	UnlockFilePointer(file);
		1707	return(exist);
231	killagreg	1708	}
		1709
297	killagreg	1710	/****************************************************************************************************************************************/
		1711	/* Function: feof_(File_t File); /
		1712	/* */
		1713	/* Description: This function checks wether the end of the file has been reached. */
		1714	/* */
		1715	/* Returnvalue: 0 if the end of the file was not reached otherwise 1. */
		1716	/****************************************************************************************************************************************/
		1717	uint8_t feof_(File_t *file)
231	killagreg	1718	{
297	killagreg	1719	if(((file->Position)+1) < (file->Size))
231	killagreg	1720	{
297	killagreg	1721	return(0);
231	killagreg	1722	}
297	killagreg	1723	else
		1724	{
		1725	return(1);
		1726	}
		1727	}
231	killagreg	1728
		1729

Subversion Repositories Projects

(root)/FollowMe/fat16.c - Rev 297