[258] | 1 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 2 | // File : fat32.c |
---|
| 3 | // Date : 01/09/2013 |
---|
| 4 | // Authors : Marco Jankovic, Cesar Fuguet & Alain Greiner |
---|
| 5 | // Copyright (c) UPMC-LIP6 |
---|
| 6 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 7 | // The fat.h and fat_common.c files define a library of access functions |
---|
[300] | 8 | // to a FAT32 disk on a block device. It is intended to be used |
---|
[258] | 9 | // by the GIET_VM nano-kernel for both the boot code and the kernel code. |
---|
| 10 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 11 | // Implementation notes: |
---|
| 12 | // 1. the "lba" (Logical Block Address) is the physical sector index on |
---|
| 13 | // the block device. The physical sector size is supposed to be 512 bytes. |
---|
| 14 | // 2. the "cluster" variable is actually a cluster index. A cluster contains |
---|
| 15 | // typically 8 sectors (4K bytes) and the cluster index is a 32 bits word. |
---|
[530] | 16 | // 3. This FAT32 library uses a FAT cache whose storage capacity is one |
---|
| 17 | // sector (512 bytes = 128 cluster indexes in FAT) |
---|
[258] | 18 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 19 | |
---|
| 20 | #include <giet_config.h> |
---|
[530] | 21 | #include <hard_config.h> |
---|
[258] | 22 | #include <fat32.h> |
---|
[530] | 23 | #include <utils.h> |
---|
| 24 | #include <vmem.h> |
---|
| 25 | #include <bdv_driver.h> |
---|
| 26 | #include <hba_driver.h> |
---|
| 27 | #include <sdc_driver.h> |
---|
| 28 | #include <rdk_driver.h> |
---|
| 29 | #include <mmc_driver.h> |
---|
[458] | 30 | #include <tty0.h> |
---|
[258] | 31 | |
---|
| 32 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[417] | 33 | // Global variable : internal FAT representation |
---|
[258] | 34 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 35 | |
---|
[530] | 36 | extern fat32_fs_t _fat; |
---|
[258] | 37 | |
---|
[530] | 38 | extern unsigned int _ptabs_vaddr[GIET_NB_VSPACE_MAX][X_SIZE][Y_SIZE]; |
---|
| 39 | |
---|
| 40 | ////////////////////////////////////////////////////////////////////////////// |
---|
| 41 | // This function computes the memory buffer physical address, and calls |
---|
| 42 | // the proper IOC driver depending on the subtype (BDV / HBA / SDC /RDK). |
---|
| 43 | // The use_irq argument allows to activate the descheduling mode, if it |
---|
| 44 | // supported by the IOC driver subtype |
---|
| 45 | ////////////////////////////////////////////////////////////////////////////// |
---|
| 46 | // Return 0 in case of success, return -1 in case of error |
---|
| 47 | ////////////////////////////////////////////////////////////////////////////// |
---|
| 48 | static |
---|
| 49 | int _fat_ioc_access( unsigned int use_irq, |
---|
| 50 | unsigned int to_mem, |
---|
| 51 | unsigned int lba, |
---|
| 52 | unsigned int buf_vaddr, |
---|
| 53 | unsigned int count ) |
---|
| 54 | { |
---|
| 55 | // compute memory buffer physical address |
---|
| 56 | unsigned int flags; // for _v2p_translate |
---|
| 57 | unsigned long long buf_paddr; // buffer physical address |
---|
| 58 | |
---|
| 59 | if ( ((_get_mmu_mode() & 0x4) == 0 ) || USE_IOC_RDK ) // identity |
---|
| 60 | { |
---|
| 61 | buf_paddr = (unsigned long long)buf_vaddr; |
---|
| 62 | } |
---|
| 63 | else // V2P translation required |
---|
| 64 | { |
---|
| 65 | buf_paddr = _v2p_translate( buf_vaddr , &flags ); |
---|
| 66 | } |
---|
| 67 | |
---|
| 68 | #if (GIET_DEBUG_FAT > 1) |
---|
| 69 | unsigned int procid = _get_procid(); |
---|
| 70 | unsigned int x = procid >> (Y_WIDTH + P_WIDTH); |
---|
| 71 | unsigned int y = (procid >> P_WIDTH) & ((1<<Y_WIDTH)-1); |
---|
| 72 | unsigned int p = procid & ((1<<P_WIDTH)-1); |
---|
| 73 | _printf("\n[DEBUG FAT] P[%d,%d,%d] enters _fat_ioc_access() at cycle %d\n" |
---|
| 74 | " to_mem = %d / vaddr = %x / paddr = %l / sectors = %d / lba = %x\n", |
---|
| 75 | x, y , p, _get_proctime(), to_mem, buf_vaddr, buf_paddr, count, lba ); |
---|
| 76 | #endif |
---|
| 77 | |
---|
| 78 | |
---|
[551] | 79 | #if GIET_NO_HARD_CC // L1 cache inval (virtual addresses) |
---|
| 80 | if ( to_mem ) _dcache_buf_invalidate( buf_vaddr, count<<9 ); |
---|
| 81 | #endif |
---|
[530] | 82 | |
---|
| 83 | |
---|
[551] | 84 | #if ( USE_IOC_BDV ) // call the proper driver |
---|
[530] | 85 | return( _bdv_access( use_irq , to_mem , lba , buf_paddr , count ) ); |
---|
| 86 | #elif ( USE_IOC_HBA ) |
---|
| 87 | return( _hba_access( use_irq , to_mem , lba , buf_paddr , count ) ); |
---|
| 88 | #elif ( USE_IOC_SPI ) |
---|
| 89 | return( _sdc_access( use_irq , to_mem , lba , buf_paddr , count ) ); |
---|
| 90 | #elif ( USE_IOC_RDK ) |
---|
| 91 | return( _rdk_access( use_irq , to_mem , lba , buf_paddr , count ) ); |
---|
| 92 | #else |
---|
| 93 | _printf("\n[FAT ERROR] in _fat_ioc_access() : no IOC driver\n"); |
---|
| 94 | _exit(); |
---|
| 95 | #endif |
---|
| 96 | |
---|
| 97 | } // end _fat_ioc_access() |
---|
| 98 | |
---|
| 99 | |
---|
[258] | 100 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 101 | // This function displays the content of the FAT cache |
---|
| 102 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 103 | #if (GIET_DEBUG_FAT > 1) |
---|
| 104 | static |
---|
[503] | 105 | void _display_fat_cache() |
---|
[258] | 106 | { |
---|
| 107 | unsigned int line; |
---|
| 108 | unsigned int word; |
---|
| 109 | unsigned int temp[9]; |
---|
| 110 | |
---|
| 111 | temp[8] = 0; |
---|
| 112 | |
---|
[417] | 113 | _puts("\n*********************** fat_cache_lba = "); |
---|
[530] | 114 | _putx( _fat.cache_lba ); |
---|
[417] | 115 | _puts(" *****************************\n"); |
---|
| 116 | |
---|
| 117 | for ( line = 0 ; line < 16 ; line++ ) |
---|
[258] | 118 | { |
---|
[417] | 119 | // display line index |
---|
| 120 | _putx( line ); |
---|
| 121 | _puts(" : "); |
---|
[258] | 122 | |
---|
[417] | 123 | // display 8*4 bytes hexa |
---|
[258] | 124 | for ( word=0 ; word<8 ; word++ ) |
---|
| 125 | { |
---|
| 126 | unsigned int byte = (line<<5) + (word<<2); |
---|
[530] | 127 | unsigned int hexa = (_fat.fat_cache[byte ]<<24) | |
---|
| 128 | (_fat.fat_cache[byte+1]<<16) | |
---|
| 129 | (_fat.fat_cache[byte+2]<< 8) | |
---|
| 130 | (_fat.fat_cache[byte+3]); |
---|
[417] | 131 | _putx( hexa ); |
---|
| 132 | _puts(" | "); |
---|
[258] | 133 | |
---|
| 134 | // prepare display ascii |
---|
[530] | 135 | temp[word] = _fat.fat_cache[byte] | |
---|
| 136 | (_fat.fat_cache[byte+1]<<8) | |
---|
| 137 | (_fat.fat_cache[byte+2]<<16) | |
---|
| 138 | (_fat.fat_cache[byte+3]<<24) ; |
---|
[258] | 139 | } |
---|
| 140 | |
---|
| 141 | // display data ascii |
---|
[417] | 142 | _puts( (char*)temp ); |
---|
| 143 | _puts("\n"); |
---|
[258] | 144 | } |
---|
[417] | 145 | _puts("***************************************************************************\n"); |
---|
| 146 | |
---|
[503] | 147 | } // end _display_fat_cache() |
---|
[530] | 148 | #endif |
---|
[291] | 149 | |
---|
[258] | 150 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 151 | // This function displays the FAT descriptor. |
---|
| 152 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 153 | #if GIET_DEBUG_FAT |
---|
| 154 | static |
---|
| 155 | void _fat_print() |
---|
| 156 | { |
---|
| 157 | _printf("\n########################## FAT32 ################################" |
---|
| 158 | "\nFAT initialised %x" |
---|
| 159 | "\nSector Size (bytes) %x" |
---|
| 160 | "\nSectors per cluster %x" |
---|
| 161 | "\nFAT region first lba %x" |
---|
| 162 | "\nData region first lba %x" |
---|
| 163 | "\nNumber of sectors for one FAT %x" |
---|
| 164 | "\nNumber of free clusters %x" |
---|
| 165 | "\nLast allocated cluster %x" |
---|
| 166 | "\n#################################################################\n", |
---|
| 167 | _fat.initialised, |
---|
| 168 | _fat.sector_size, |
---|
| 169 | _fat.sectors_per_cluster, |
---|
| 170 | _fat.fat_lba, |
---|
| 171 | _fat.data_lba, |
---|
| 172 | _fat.fat_sectors, |
---|
| 173 | _fat.number_free_cluster, |
---|
| 174 | _fat.last_cluster_allocated ); |
---|
| 175 | } // end _fat_print() |
---|
| 176 | #endif |
---|
| 177 | |
---|
| 178 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 179 | // This function returns the length of a FAT field. This field is identified |
---|
[417] | 180 | // by an (offset,length) mnemonic defined in fat32.h file. |
---|
[258] | 181 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 182 | static inline |
---|
| 183 | int get_length( int offset, |
---|
| 184 | int length ) |
---|
[258] | 185 | { |
---|
| 186 | return length; |
---|
| 187 | } |
---|
| 188 | |
---|
| 189 | ////////////////////////////////////////////////////////////////////////////// |
---|
[291] | 190 | // Write one 32 bits word "value" in a char[] buffer. |
---|
[417] | 191 | // The modified field in buffer is defined by the offset and size arguments. |
---|
[291] | 192 | ////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 193 | static |
---|
| 194 | void _write_entry( unsigned int offset, |
---|
| 195 | unsigned int size, |
---|
| 196 | char* buffer, |
---|
| 197 | unsigned int value ) |
---|
[291] | 198 | { |
---|
| 199 | unsigned int turn = 0; |
---|
| 200 | unsigned int res = value; |
---|
| 201 | unsigned int mask = 0x000000ff; |
---|
| 202 | |
---|
| 203 | while( turn != size - 1 ) |
---|
| 204 | { |
---|
| 205 | buffer[ offset + turn ] = res & mask; |
---|
| 206 | res = res >> 8; |
---|
| 207 | turn++; |
---|
| 208 | } |
---|
| 209 | buffer[offset + turn] = res & mask; |
---|
| 210 | } |
---|
| 211 | |
---|
| 212 | ////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 213 | // Read one 32 bits word in a char[] buffer, taking endianness into account. |
---|
[417] | 214 | // The analysed field in buffer is defined by the offset and size arguments. |
---|
[258] | 215 | ////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 216 | static |
---|
| 217 | unsigned int _read_entry( unsigned int offset, |
---|
| 218 | unsigned int size, |
---|
| 219 | char* buffer, |
---|
| 220 | unsigned int little_indian ) |
---|
[258] | 221 | { |
---|
| 222 | unsigned int turn; |
---|
| 223 | unsigned int res = 0; |
---|
| 224 | unsigned int mask = 0x000000ff; |
---|
| 225 | |
---|
| 226 | if( little_indian ) |
---|
| 227 | { |
---|
| 228 | turn = size; |
---|
| 229 | while( turn != 1 ) |
---|
| 230 | { |
---|
| 231 | res = res | (buffer[offset + (turn-1)] & mask); |
---|
| 232 | res = res << 8; |
---|
| 233 | turn--; |
---|
| 234 | } |
---|
| 235 | res = (buffer[offset + (turn-1)] & mask) | res; |
---|
| 236 | } |
---|
| 237 | else |
---|
| 238 | { |
---|
| 239 | turn = 0; |
---|
| 240 | while( turn != size - 1 ) |
---|
| 241 | { |
---|
| 242 | |
---|
| 243 | res = res | (buffer[ offset + turn ] & mask ); |
---|
| 244 | res = res << 8; |
---|
| 245 | turn++; |
---|
| 246 | } |
---|
| 247 | res = res | (buffer[offset + turn] & mask); |
---|
| 248 | } |
---|
| 249 | return res; |
---|
| 250 | } |
---|
| 251 | |
---|
| 252 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 253 | // This function retuns the cluster index from the lba of a DATA sector. |
---|
| 254 | // The lba must be larger than the lba of the first DATA sector. |
---|
| 255 | // The DATA region indexing starts a cluster 2. |
---|
| 256 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 257 | static inline |
---|
| 258 | unsigned int lba_to_cluster( unsigned int lba ) |
---|
[258] | 259 | { |
---|
[530] | 260 | if (lba < _fat.data_lba ) return 0; |
---|
[258] | 261 | |
---|
[530] | 262 | return ( (lba - _fat.data_lba) / _fat.sectors_per_cluster) + 2; |
---|
[258] | 263 | } |
---|
| 264 | |
---|
| 265 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 266 | // This function retuns the lba of first sector in DATA region |
---|
| 267 | // from the cluster index. The cluster index must be larger than 2. |
---|
| 268 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 269 | static inline |
---|
| 270 | unsigned int cluster_to_lba( unsigned int cluster ) |
---|
[258] | 271 | { |
---|
| 272 | if ( cluster < 2 ) return 0; |
---|
| 273 | |
---|
[530] | 274 | return (_fat.sectors_per_cluster * (cluster - 2)) + _fat.data_lba; |
---|
[258] | 275 | } |
---|
| 276 | |
---|
| 277 | ///////////////////////////////////////////////////////////////////////////////// |
---|
| 278 | // This function search the FAT (using the FAT cache), and returns |
---|
[300] | 279 | // the next cluster index from the current cluster index in the FAT. |
---|
[258] | 280 | // remark: a sector of FAT contains 128 cluster indexes. |
---|
| 281 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 282 | static |
---|
| 283 | unsigned int _get_next_cluster( unsigned int use_irq, |
---|
| 284 | unsigned int cluster ) |
---|
[258] | 285 | { |
---|
| 286 | // compute lba of the sector containing the cluster index |
---|
[530] | 287 | unsigned int lba = _fat.fat_lba + (cluster / 128); |
---|
[258] | 288 | |
---|
[530] | 289 | if ( lba != _fat.cache_lba ) // miss in fat_cache |
---|
[258] | 290 | { |
---|
| 291 | // access fat |
---|
[530] | 292 | if( _fat_ioc_access( use_irq, |
---|
| 293 | 1, // read |
---|
| 294 | lba, |
---|
| 295 | (unsigned int)_fat.fat_cache, |
---|
| 296 | 1 ) ) // one sector |
---|
[258] | 297 | { |
---|
[530] | 298 | _printf("[FAT_ERROR] in get_next_cluster_id() : cannot read block %x", |
---|
| 299 | lba ); |
---|
[258] | 300 | return 1; |
---|
| 301 | } |
---|
[530] | 302 | _fat.cache_lba = lba; |
---|
| 303 | } |
---|
[258] | 304 | |
---|
[417] | 305 | unsigned int next = _read_entry( ((cluster % 128) * 4), |
---|
| 306 | 4, |
---|
[530] | 307 | _fat.fat_cache, |
---|
[417] | 308 | 1 ); |
---|
[530] | 309 | #if (GIET_DEBUG_FAT > 1) |
---|
| 310 | unsigned int procid = _get_procid(); |
---|
| 311 | unsigned int x = procid >> (Y_WIDTH + P_WIDTH); |
---|
| 312 | unsigned int y = (procid >> P_WIDTH) & ((1<<Y_WIDTH)-1); |
---|
| 313 | unsigned int p = procid & ((1<<P_WIDTH)-1); |
---|
| 314 | _printf("\n[DEBUG FAT] P[%d,%d,%d] in _get_next_cluster() : next = %x\n", |
---|
| 315 | x , y , p , next ); |
---|
| 316 | _display_fat_cache(); |
---|
[417] | 317 | #endif |
---|
| 318 | |
---|
| 319 | return next; |
---|
[258] | 320 | } |
---|
| 321 | |
---|
| 322 | ////////////////////////////////////////////////////// |
---|
| 323 | static inline unsigned char to_upper(unsigned char c) |
---|
| 324 | { |
---|
| 325 | if (c >= 'a' && c <= 'z') return (c & ~(0x20)); |
---|
| 326 | else return c; |
---|
| 327 | } |
---|
| 328 | |
---|
| 329 | //////////////////////////////////////////////////////////////// |
---|
| 330 | // This function is a filter: |
---|
| 331 | // Return the c character if c is a legal short name character |
---|
| 332 | // Return the '_' character if c is illegal |
---|
| 333 | //////////////////////////////////////////////////////////////// |
---|
[530] | 334 | static |
---|
| 335 | unsigned char illegal_short(unsigned char c) |
---|
[258] | 336 | { |
---|
| 337 | const unsigned char illegal_char [] =";+=[]â,\"*\\<>/?:|\0"; |
---|
| 338 | short i = 0; |
---|
| 339 | while (illegal_char[i]!='\0') |
---|
| 340 | { |
---|
| 341 | if (c == illegal_char[i]) |
---|
| 342 | return '_'; |
---|
| 343 | i++; |
---|
| 344 | } |
---|
| 345 | return c; |
---|
| 346 | } |
---|
| 347 | |
---|
| 348 | ///////////////////////////////////////////////////////////////////////////////// |
---|
| 349 | // This function test if the string argument is a legal SFN (Short File Name) |
---|
| 350 | // and copies this name (removing the .) in the sfn_string argument. |
---|
| 351 | // Criteria for a Short File Name are: |
---|
| 352 | // - separator is '.' (extension is not mandatory) |
---|
| 353 | // - 1 <= name length <= 8 |
---|
| 354 | // - 0 <= extension length <= 3 |
---|
| 355 | // - no illegal character (see illega_short() function) |
---|
| 356 | // Return 1 if it string is a legal SFN |
---|
| 357 | // Return 0 if not legal SFN |
---|
| 358 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 359 | static |
---|
| 360 | int is_short( char* string, |
---|
| 361 | char* sfn_string) |
---|
[258] | 362 | { |
---|
| 363 | int s_size = 0; |
---|
| 364 | int dot_ext = 0; // dot offset in the filename |
---|
| 365 | int name_len = 0; // length of file name |
---|
| 366 | int ext_len = 0; // length of extension |
---|
| 367 | int i = 0; |
---|
| 368 | int sc_i = 0; |
---|
| 369 | char ch; |
---|
| 370 | |
---|
| 371 | if(string[0] == '.' && string[1] == '\0') |
---|
| 372 | { |
---|
| 373 | sfn_string[0] = '.'; |
---|
[354] | 374 | return 1; |
---|
| 375 | } |
---|
| 376 | if(string[0] == '.' && string[1] == '.' && string[2] == '\0') |
---|
| 377 | { |
---|
| 378 | sfn_string[0] = '.'; |
---|
| 379 | sfn_string[1] = '.'; |
---|
| 380 | return 1; |
---|
| 381 | } |
---|
| 382 | sfn_string[11] = '\0'; |
---|
| 383 | while (string[s_size] != '\0') |
---|
| 384 | { |
---|
| 385 | if (string[s_size] == '.') |
---|
| 386 | { |
---|
| 387 | dot_ext = s_size; |
---|
| 388 | ext_len = -1; |
---|
| 389 | } |
---|
| 390 | ext_len++; |
---|
| 391 | s_size++; |
---|
| 392 | } |
---|
| 393 | if (dot_ext != 0) |
---|
| 394 | { |
---|
| 395 | name_len = s_size - ext_len - 1; |
---|
| 396 | } |
---|
| 397 | else |
---|
| 398 | { |
---|
| 399 | name_len = s_size; |
---|
| 400 | ext_len = 0; |
---|
| 401 | } |
---|
| 402 | if ( ext_len > 3 || ( name_len > 8)) |
---|
| 403 | { |
---|
| 404 | return 0; |
---|
| 405 | } |
---|
| 406 | if (dot_ext != 0) |
---|
| 407 | { |
---|
| 408 | while (i != ext_len) |
---|
| 409 | { |
---|
| 410 | ch = to_upper(string[dot_ext + 1 + i]); |
---|
| 411 | ch = illegal_short(ch); |
---|
| 412 | sfn_string[8+i] = ch; |
---|
| 413 | i++; |
---|
| 414 | } |
---|
| 415 | } |
---|
| 416 | i = 0; |
---|
| 417 | sc_i = 0; |
---|
| 418 | while (i!= name_len) |
---|
| 419 | { |
---|
| 420 | ch = to_upper(string[i]); |
---|
| 421 | ch = illegal_short(ch); |
---|
| 422 | if (ch != '.') sfn_string[sc_i++] = ch; |
---|
| 423 | i++; |
---|
| 424 | } |
---|
| 425 | return 1; |
---|
[258] | 426 | } |
---|
| 427 | |
---|
[291] | 428 | /////////////////////////////////////////////////////////////////////// |
---|
| 429 | // This function analyses the pathname argument, from the character |
---|
| 430 | // defined by the *nb_read argument. |
---|
| 431 | // It copies the found name (between '/') in the name[] buffer, |
---|
| 432 | // and updates the nb_read argument. |
---|
| 433 | // Return 1 if name found, Return 0 if NUL character found, |
---|
| 434 | /////////////////////////////////////////////////////////////////////// |
---|
[530] | 435 | static |
---|
| 436 | int get_name_from_path( char* pathname, |
---|
| 437 | char* name, |
---|
| 438 | unsigned int* nb_read ) |
---|
[291] | 439 | { |
---|
| 440 | if ( pathname[*nb_read] == 0 ) return 0; |
---|
| 441 | |
---|
| 442 | int i = (pathname[*nb_read] == '/')? (*nb_read) + 1 : *nb_read; |
---|
| 443 | int j = 0; |
---|
| 444 | |
---|
| 445 | while(pathname[i] != '/' && pathname[i] != '\0') |
---|
| 446 | { |
---|
| 447 | name[j] = pathname[i]; |
---|
| 448 | j++; |
---|
| 449 | i++; |
---|
| 450 | } |
---|
| 451 | name[j] = 0; |
---|
| 452 | |
---|
| 453 | if ( pathname[i] == '/' ) *nb_read += j+1; |
---|
| 454 | else *nb_read += j; |
---|
| 455 | |
---|
| 456 | return 1; |
---|
| 457 | } |
---|
| 458 | |
---|
[258] | 459 | //////////////////////////////////////////////////////////////////////////////// |
---|
| 460 | static int get_name_from_short( char* dir_entry, // input: SFN dir_entry |
---|
| 461 | char* entry_name ) // output: name |
---|
| 462 | { |
---|
| 463 | unsigned int i = 0; |
---|
| 464 | unsigned int length = get_length(DIR_NAME); |
---|
| 465 | |
---|
| 466 | while ( i < length ) |
---|
| 467 | { |
---|
| 468 | entry_name[i] = dir_entry[i]; |
---|
| 469 | i++; |
---|
| 470 | } |
---|
| 471 | entry_name[i] = '\0'; |
---|
| 472 | |
---|
| 473 | return i; |
---|
| 474 | } |
---|
[291] | 475 | |
---|
[258] | 476 | /////////////////////////////////////////////////////////////////////////////// |
---|
[291] | 477 | static int get_name_from_long( char *dir_entry, // input : LFN dir_entry |
---|
| 478 | char *entry_name ) // output : name |
---|
[258] | 479 | { |
---|
| 480 | unsigned int entry_name_offset = 0; |
---|
| 481 | unsigned int dir_entry_offset = get_length(LDIR_ORD); |
---|
| 482 | unsigned int l_name_1 = get_length(LDIR_NAME_1); |
---|
| 483 | unsigned int l_name_2 = get_length(LDIR_NAME_2); |
---|
| 484 | unsigned int l_name_3 = get_length(LDIR_NAME_3); |
---|
| 485 | unsigned int l_attr = get_length(LDIR_ATTR); |
---|
| 486 | unsigned int l_type = get_length(LDIR_TYPE); |
---|
| 487 | unsigned int l_chksum = get_length(LDIR_CHKSUM); |
---|
| 488 | unsigned int l_rsvd = get_length(LDIR_RSVD); |
---|
| 489 | |
---|
| 490 | unsigned int j = 0; |
---|
| 491 | unsigned int eof = 0; |
---|
| 492 | |
---|
| 493 | while ( (dir_entry_offset != DIR_ENTRY_SIZE) && (!eof) ) |
---|
| 494 | { |
---|
| 495 | while (j != l_name_1 && !eof ) |
---|
| 496 | { |
---|
| 497 | if ( (dir_entry[dir_entry_offset] == 0x00) || |
---|
| 498 | (dir_entry[dir_entry_offset] == 0xFF) ) |
---|
| 499 | { |
---|
| 500 | eof = 1; |
---|
| 501 | continue; |
---|
| 502 | } |
---|
| 503 | entry_name[entry_name_offset] = dir_entry[dir_entry_offset]; |
---|
| 504 | dir_entry_offset += 2; |
---|
| 505 | j += 2; |
---|
| 506 | entry_name_offset++; |
---|
| 507 | } |
---|
| 508 | |
---|
| 509 | dir_entry_offset += (l_attr + l_type + l_chksum); |
---|
| 510 | j = 0; |
---|
| 511 | |
---|
| 512 | while (j != l_name_2 && !eof ) |
---|
| 513 | { |
---|
| 514 | if ( (dir_entry[dir_entry_offset] == 0x00) || |
---|
| 515 | (dir_entry[dir_entry_offset] == 0xFF) ) |
---|
| 516 | { |
---|
| 517 | eof = 1; |
---|
| 518 | continue; |
---|
| 519 | } |
---|
| 520 | entry_name[entry_name_offset] = dir_entry[dir_entry_offset]; |
---|
| 521 | dir_entry_offset += 2; |
---|
| 522 | j += 2; |
---|
| 523 | entry_name_offset++; |
---|
| 524 | } |
---|
| 525 | |
---|
| 526 | dir_entry_offset += l_rsvd; |
---|
| 527 | j = 0; |
---|
| 528 | |
---|
| 529 | while (j != l_name_3 && !eof ) |
---|
| 530 | { |
---|
| 531 | if ( (dir_entry[dir_entry_offset] == 0x00) || |
---|
| 532 | (dir_entry[dir_entry_offset] == 0xFF) ) |
---|
| 533 | { |
---|
| 534 | eof = 1; |
---|
| 535 | continue; |
---|
| 536 | } |
---|
| 537 | entry_name[entry_name_offset] = dir_entry[dir_entry_offset]; |
---|
| 538 | dir_entry_offset += 2; |
---|
| 539 | j += 2; |
---|
| 540 | entry_name_offset++; |
---|
| 541 | } |
---|
| 542 | } |
---|
| 543 | entry_name[entry_name_offset] = '\0'; |
---|
| 544 | |
---|
| 545 | return entry_name_offset; |
---|
| 546 | } // end get_name_from_long() |
---|
| 547 | |
---|
[530] | 548 | /////////////////////////////////////////////////////////////////////////////////// |
---|
[291] | 549 | // This function update a DIR_ENTRY, write a new value into a specific field |
---|
| 550 | // (ex : DIR_FILE_SIZE, when we want update the file size after a fat_write) |
---|
| 551 | // Return 0 in case of success, > 0 if failure. |
---|
[530] | 552 | /////////////////////////////////////////////////////////////////////////////////// |
---|
[291] | 553 | // TODO : make this function less complex |
---|
[530] | 554 | /////////////////////////////////////////////////////////////////////////////////// |
---|
| 555 | static inline |
---|
| 556 | unsigned int _update_entry( unsigned int use_irq, |
---|
| 557 | unsigned int fd_id, |
---|
| 558 | unsigned int field, |
---|
| 559 | unsigned int size, |
---|
| 560 | unsigned int value ) |
---|
[291] | 561 | { |
---|
| 562 | char dir_entry[32]; // buffer to store a full directory_entry |
---|
| 563 | char name_entry[14]; // buffer to store a 13 characters (partial) name |
---|
| 564 | char file_name[256]; // buffer to store the name (not pathname) of the file |
---|
| 565 | |
---|
[530] | 566 | char sfn_string[12] = {[0 ... 10] = ' ', '\0'}; // buffer Short File Name |
---|
| 567 | unsigned int lba = _fat.fd[fd_id].lba_dir_entry; // Lba of file dir_entry |
---|
[291] | 568 | unsigned int is_sfn; |
---|
[530] | 569 | unsigned int attr = 0; // dir entry attribute |
---|
| 570 | unsigned int ord = 0; // dir entry sequence |
---|
| 571 | unsigned int found = 0; // name found |
---|
| 572 | unsigned int offset = 0; // offset in fat_cache |
---|
[417] | 573 | unsigned int i = 0; |
---|
| 574 | unsigned int nb_read = 0; |
---|
[291] | 575 | |
---|
| 576 | for ( i = 0 ; i < 32 ; i++ ) dir_entry[i] = 0; |
---|
| 577 | for ( i = 0 ; i < 14 ; i++ ) name_entry[i] = 0; |
---|
| 578 | |
---|
| 579 | // Get the name of the file. |
---|
[530] | 580 | while ( get_name_from_path( _fat.fd[fd_id].name, file_name, &nb_read ) ) |
---|
[291] | 581 | { |
---|
| 582 | } |
---|
| 583 | |
---|
[417] | 584 | // Format file_name to SFN format |
---|
| 585 | is_sfn = is_short( file_name, sfn_string ); |
---|
[291] | 586 | |
---|
[530] | 587 | // access FAT |
---|
| 588 | if ( _fat_ioc_access( use_irq, |
---|
| 589 | 1, // read |
---|
| 590 | lba, |
---|
| 591 | (unsigned int)_fat.fat_cache, |
---|
| 592 | 1 ) ) // one sector |
---|
[291] | 593 | { |
---|
[530] | 594 | _printf("\n[FAT ERROR] in _update_entry() cannot read sector %x\n", |
---|
| 595 | lba ); |
---|
[291] | 596 | return 1; |
---|
| 597 | } |
---|
[530] | 598 | _fat.cache_lba = lba; |
---|
[291] | 599 | |
---|
| 600 | // - the offset increment is an integer number of directory entry (32 bytes) |
---|
| 601 | // - the exit condition is success (name found) or failure (end of directory) |
---|
| 602 | while ( !found ) |
---|
| 603 | { |
---|
[530] | 604 | attr = _read_entry( DIR_ATTR, _fat.fat_cache + offset, 0 ); |
---|
| 605 | ord = _read_entry( LDIR_ORD, _fat.fat_cache + offset, 0 ); |
---|
[291] | 606 | |
---|
| 607 | if ( is_sfn == 1 ) // searched name is short |
---|
| 608 | { |
---|
| 609 | if ( (ord != FREE_ENTRY ) && |
---|
| 610 | (ord != NO_MORE_ENTRY) && |
---|
| 611 | (attr == ATTR_LONG_NAME_MASK) ) // LFN entry : skipped |
---|
| 612 | { |
---|
| 613 | offset = offset + ((ord & 0xF) * DIR_ENTRY_SIZE); |
---|
| 614 | continue; |
---|
| 615 | } |
---|
| 616 | else if ( (attr != ATTR_LONG_NAME_MASK) && |
---|
| 617 | (ord != FREE_ENTRY) && |
---|
| 618 | (ord != NO_MORE_ENTRY ) ) // SFN entry : checked |
---|
| 619 | { |
---|
[530] | 620 | memcpy( dir_entry, _fat.fat_cache + offset, DIR_ENTRY_SIZE ); |
---|
[291] | 621 | } |
---|
| 622 | else if (ord == NO_MORE_ENTRY ) // end of directory : return |
---|
| 623 | { |
---|
[530] | 624 | _printf("\n[FAT ERROR] in _update_entry() : reaches end\n"); |
---|
[291] | 625 | return 1; |
---|
| 626 | } |
---|
| 627 | else // free entry : skipped |
---|
| 628 | { |
---|
| 629 | offset = offset + DIR_ENTRY_SIZE; |
---|
| 630 | continue; |
---|
| 631 | } |
---|
| 632 | } |
---|
| 633 | else // searched name is long |
---|
| 634 | { |
---|
| 635 | if ( (attr == ATTR_LONG_NAME_MASK) && |
---|
| 636 | (ord != FREE_ENTRY) && |
---|
| 637 | (ord != NO_MORE_ENTRY) ) // LFN entry : checked |
---|
| 638 | { |
---|
[530] | 639 | memcpy( dir_entry, _fat.fat_cache + offset, DIR_ENTRY_SIZE ); |
---|
[291] | 640 | } |
---|
| 641 | else if ( (attr != ATTR_LONG_NAME_MASK) && |
---|
| 642 | (ord != FREE_ENTRY) && |
---|
| 643 | (ord != NO_MORE_ENTRY)) // SFN entry : skipped |
---|
| 644 | { |
---|
| 645 | offset = offset + DIR_ENTRY_SIZE; |
---|
| 646 | continue; |
---|
| 647 | } |
---|
| 648 | else if (ord == NO_MORE_ENTRY ) // end of directory : return |
---|
| 649 | { |
---|
[530] | 650 | _printf("\n[FAT ERROR] in _update_entry() reaches end\n"); |
---|
[291] | 651 | return 1; |
---|
| 652 | } |
---|
| 653 | else // free entry : skipped |
---|
| 654 | { |
---|
| 655 | offset = offset + DIR_ENTRY_SIZE; |
---|
| 656 | continue; |
---|
| 657 | } |
---|
| 658 | } |
---|
| 659 | |
---|
| 660 | // testing the name extracted from dir entry |
---|
| 661 | |
---|
| 662 | if ( is_sfn == 1 ) // searched name is short |
---|
| 663 | { |
---|
| 664 | get_name_from_short( dir_entry, name_entry ); |
---|
| 665 | |
---|
[417] | 666 | if ( _strncmp( (char*)sfn_string, (char*)name_entry, 13 ) == 0 ) |
---|
[291] | 667 | { |
---|
[530] | 668 | _write_entry(offset + field, size, _fat.fat_cache, value); |
---|
[291] | 669 | found = 1; |
---|
| 670 | } |
---|
| 671 | else // no matching : skip |
---|
| 672 | { |
---|
| 673 | offset = offset + DIR_ENTRY_SIZE; |
---|
| 674 | } |
---|
| 675 | } |
---|
| 676 | else // searched name is long |
---|
| 677 | { |
---|
| 678 | get_name_from_long( dir_entry, name_entry ); |
---|
| 679 | |
---|
| 680 | unsigned shift = ((ord & 0xf) - 1) * 13; |
---|
[530] | 681 | if ( _strncmp( (char*)(file_name + shift), |
---|
| 682 | (char*)name_entry, 13 ) == 0 ) |
---|
[291] | 683 | { |
---|
| 684 | if ( (ord & 0xf) == 1 ) |
---|
| 685 | { |
---|
| 686 | offset = offset + DIR_ENTRY_SIZE; |
---|
[530] | 687 | _write_entry(offset + field, size, _fat.fat_cache, value); |
---|
[291] | 688 | found = 1; |
---|
| 689 | } |
---|
| 690 | offset = offset + DIR_ENTRY_SIZE; |
---|
| 691 | continue; |
---|
| 692 | } |
---|
| 693 | else // no matching : skip |
---|
| 694 | { |
---|
| 695 | offset = offset + ((ord & 0xf) * DIR_ENTRY_SIZE) + DIR_ENTRY_SIZE; |
---|
| 696 | } |
---|
| 697 | } |
---|
| 698 | } |
---|
| 699 | |
---|
[530] | 700 | // write block to FAT |
---|
| 701 | if ( _fat_ioc_access( use_irq, |
---|
| 702 | 0, // write |
---|
| 703 | lba, |
---|
| 704 | (unsigned int)_fat.fat_cache, |
---|
| 705 | 1 ) ) // one sector |
---|
| 706 | { |
---|
| 707 | _printf("\n[FAT ERROR] in _update_entry() cannot write sector %x\n", |
---|
| 708 | lba ); |
---|
| 709 | return 1; |
---|
| 710 | } |
---|
| 711 | |
---|
| 712 | return 0; |
---|
| 713 | } // end _update_entry() |
---|
| 714 | |
---|
| 715 | |
---|
[291] | 716 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 717 | // This function update the FS_INFO block: |
---|
[295] | 718 | // last cluster allocated and number of free cluster. |
---|
[291] | 719 | // Return 0 in case of success, > 0 if failure. |
---|
| 720 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 721 | static inline |
---|
| 722 | unsigned int _update_fs_info( unsigned int use_irq ) |
---|
[291] | 723 | { |
---|
[530] | 724 | unsigned int lba = _fat.fs_info_lba; |
---|
[291] | 725 | |
---|
| 726 | #if GIET_DEBUG_FAT |
---|
[530] | 727 | _printf("\n[DEBUG FAT] _update_fs_info()\n"); |
---|
[291] | 728 | #endif |
---|
| 729 | |
---|
[530] | 730 | // update FAT cache in case of miss |
---|
| 731 | if ( lba != _fat.cache_lba ) |
---|
[291] | 732 | { |
---|
[530] | 733 | if ( _fat_ioc_access( use_irq, |
---|
| 734 | 1, // read |
---|
| 735 | lba, |
---|
| 736 | (unsigned int)_fat.fat_cache, |
---|
| 737 | 1 ) ) // one sector |
---|
[291] | 738 | { |
---|
[530] | 739 | _printf("\n[FAT_ERROR] in _update_fs_info() cannot read block\n"); |
---|
[291] | 740 | return 1; |
---|
| 741 | } |
---|
[530] | 742 | _fat.cache_lba = lba; |
---|
[291] | 743 | } |
---|
| 744 | |
---|
[530] | 745 | _write_entry( FS_FREE_CLUSTER , _fat.fat_cache, _fat.number_free_cluster ); |
---|
| 746 | _write_entry( FS_FREE_CLUSTER_HINT, _fat.fat_cache, _fat.last_cluster_allocated ); |
---|
| 747 | |
---|
| 748 | // write bloc to FAT |
---|
| 749 | if ( _fat_ioc_access( use_irq, |
---|
| 750 | 0, // write |
---|
| 751 | lba, |
---|
| 752 | (unsigned int)_fat.fat_cache, |
---|
| 753 | 1 ) ) // one sector |
---|
| 754 | { |
---|
| 755 | _printf("\n[FAT_ERROR] in _update_fs_info() cannot write block\n"); |
---|
| 756 | return 1; |
---|
| 757 | } |
---|
| 758 | |
---|
| 759 | return 0; |
---|
| 760 | } // end _update_fs_info() |
---|
| 761 | |
---|
[291] | 762 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 763 | // This function update FAT, write a new value into cluster index. |
---|
| 764 | // Used by the function _fat_allocate to update the chaining of clusters. |
---|
| 765 | // Return 0 in case of success, > 0 if failure. |
---|
| 766 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 767 | static inline |
---|
| 768 | unsigned int _update_fat( unsigned int use_irq, |
---|
| 769 | unsigned int cluster, |
---|
| 770 | unsigned int value ) |
---|
[291] | 771 | { |
---|
[530] | 772 | unsigned int lba = _fat.fat_lba + (cluster / 128); |
---|
[291] | 773 | |
---|
| 774 | #if GIET_DEBUG_FAT |
---|
[530] | 775 | _printf("\n[DEBUG FAT] _update_fat() : cluster = %x / value = %x\n", |
---|
| 776 | cluster, value ); |
---|
[291] | 777 | #endif |
---|
| 778 | |
---|
[530] | 779 | // update FAT cache in case of miss |
---|
| 780 | if ( lba != _fat.cache_lba ) |
---|
[291] | 781 | { |
---|
[530] | 782 | if ( _fat_ioc_access( use_irq, |
---|
| 783 | 1, // read |
---|
| 784 | lba, |
---|
| 785 | (unsigned int)_fat.fat_cache, |
---|
| 786 | 1 ) ) // one sector |
---|
[291] | 787 | { |
---|
[530] | 788 | _printf("\n[FAT_ERROR] in _update_fat() cannot read block %x\n", |
---|
| 789 | lba ); |
---|
[291] | 790 | return 1; |
---|
| 791 | } |
---|
[530] | 792 | _fat.cache_lba = lba; |
---|
[291] | 793 | } |
---|
[530] | 794 | |
---|
| 795 | _write_entry( ((cluster % 128) << 2), 4, _fat.fat_cache, value ); |
---|
| 796 | |
---|
| 797 | // write bloc to FAT |
---|
| 798 | if ( _fat_ioc_access( use_irq, |
---|
| 799 | 0, // write |
---|
| 800 | lba, |
---|
| 801 | (unsigned int)_fat.fat_cache, |
---|
| 802 | 1 ) ) // one sector |
---|
| 803 | { |
---|
| 804 | _printf("\n[FAT_ERROR] in _update_fat() cannot write block %x\n", |
---|
| 805 | lba ); |
---|
| 806 | return 1; |
---|
| 807 | } |
---|
| 808 | |
---|
| 809 | return 0; |
---|
[417] | 810 | } // end update_fat() |
---|
[291] | 811 | |
---|
| 812 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[443] | 813 | // This function allocate count clusters to a file by calling the |
---|
[417] | 814 | // _update_fat function that takes care to update the chaining of clusters. |
---|
[291] | 815 | // return 0 if success, -1 if failure |
---|
| 816 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 817 | static inline |
---|
| 818 | int _fat_allocate( unsigned int use_irq, |
---|
| 819 | unsigned int fd_id, |
---|
| 820 | unsigned int count ) |
---|
[291] | 821 | { |
---|
[530] | 822 | unsigned int next_cluster = _fat.fd[fd_id].first_cluster; // first cluster |
---|
| 823 | unsigned int cluster_to_allocate = count; // to allocate |
---|
| 824 | unsigned int last_cluster_file; // Last cluster |
---|
| 825 | unsigned int free_cluster = _fat.last_cluster_allocated + 1; // First free |
---|
[291] | 826 | |
---|
| 827 | // Check if free_cluster is really free (must be true) |
---|
[530] | 828 | if ( _get_next_cluster( use_irq , free_cluster ) != FREE_CLUSTER) |
---|
[291] | 829 | { |
---|
[503] | 830 | _printf("\n[FAT ERROR] in _fat_allocate() : first free cluster not free\n"); |
---|
[291] | 831 | return -1; |
---|
| 832 | } |
---|
| 833 | // Check if FAT contains enough cluster free for this allocation |
---|
[530] | 834 | if ( count > _fat.number_free_cluster ) |
---|
[291] | 835 | { |
---|
[503] | 836 | _printf("\n[FAT ERROR] in _fat_allocate() : Not enough free cluster(s)\n"); |
---|
[291] | 837 | return -1; |
---|
| 838 | } |
---|
| 839 | |
---|
| 840 | #if GIET_DEBUG_FAT |
---|
[530] | 841 | _printf("\n[DEBUG FAT] _fat_allocate() for fd = %d\n", fd_id ); |
---|
[291] | 842 | #endif |
---|
| 843 | |
---|
| 844 | // Get the last cluster allocated for the file (seek END_OF_CHAIN_CLUSTER). |
---|
[503] | 845 | do |
---|
| 846 | { |
---|
[291] | 847 | last_cluster_file = next_cluster; |
---|
[530] | 848 | next_cluster = _get_next_cluster( use_irq , next_cluster ); |
---|
[503] | 849 | } |
---|
| 850 | while ( next_cluster < END_OF_CHAIN_CLUSTER ); |
---|
[291] | 851 | |
---|
[443] | 852 | // Loop on the number of clusters to be allocated |
---|
[291] | 853 | while ( cluster_to_allocate > 0 ) |
---|
| 854 | { |
---|
| 855 | |
---|
| 856 | #if GIET_DEBUG_FAT |
---|
[530] | 857 | _printf("\n[DEBUG FAT] cluster to update = %x / free cluster = %x / count = %d\n", |
---|
[503] | 858 | last_cluster_file , free_cluster , cluster_to_allocate ); |
---|
[291] | 859 | #endif |
---|
| 860 | |
---|
| 861 | // update, in the FAT, the value of last cluster allocated by the index |
---|
| 862 | // of free cluster. |
---|
[530] | 863 | if ( _update_fat( use_irq , last_cluster_file , free_cluster ) ) |
---|
[291] | 864 | { |
---|
[503] | 865 | _printf("\n[FAT ERROR] in _fat_allocate() : update fat failed\n"); |
---|
[291] | 866 | return -1; |
---|
| 867 | } |
---|
| 868 | |
---|
| 869 | cluster_to_allocate = cluster_to_allocate - 1; |
---|
| 870 | // Last cluster allocated is then free_cluster |
---|
| 871 | last_cluster_file = free_cluster; |
---|
| 872 | |
---|
| 873 | // Last cluster to allocate done, then we must close the chain of clusters |
---|
| 874 | if ( cluster_to_allocate == 0 ) |
---|
| 875 | { |
---|
| 876 | // update, in the FAT, the value of the last cluster allocated by |
---|
| 877 | // END_OF_CHAIN_CLUSTER |
---|
[530] | 878 | if ( _update_fat( use_irq , last_cluster_file , END_OF_CHAIN_CLUSTER ) ) |
---|
[291] | 879 | { |
---|
[503] | 880 | _printf("\n[FAT ERROR] in _fat_allocate() : update fat failed\n"); |
---|
[291] | 881 | return -1; |
---|
| 882 | } |
---|
| 883 | } |
---|
| 884 | |
---|
| 885 | free_cluster = free_cluster + 1; |
---|
| 886 | |
---|
| 887 | // Check if free_cluster is really free (must be true) |
---|
[530] | 888 | if ( _get_next_cluster( use_irq , free_cluster ) != FREE_CLUSTER) |
---|
[291] | 889 | { |
---|
[503] | 890 | _printf("\n[FAT ERROR] in _fat_allocate() : free_cluster not free\n"); |
---|
[291] | 891 | return -1; |
---|
| 892 | } |
---|
| 893 | } |
---|
| 894 | |
---|
| 895 | // Update field number_free_cluster and last_cluster_allocated |
---|
| 896 | // of structure fat for next fat_allocate |
---|
[530] | 897 | _fat.last_cluster_allocated = last_cluster_file; |
---|
| 898 | _fat.number_free_cluster = _fat.number_free_cluster - count; |
---|
[291] | 899 | |
---|
[530] | 900 | if ( _update_fs_info( use_irq ) ) |
---|
[291] | 901 | { |
---|
[503] | 902 | _printf("\n[FAT ERROR] in _fat_allocate() : update fs_info failed\n"); |
---|
[291] | 903 | return -1; |
---|
| 904 | } |
---|
| 905 | |
---|
| 906 | return 0; |
---|
[417] | 907 | } // end _fat_allocate() |
---|
[291] | 908 | |
---|
[530] | 909 | ////////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 910 | // This function read the blocks defined by the cluster index argument, in a data |
---|
[417] | 911 | // region containing a directory to search the name of a file/firectory. |
---|
| 912 | // It returns the cluster index of the file/directory when the name has been found, |
---|
| 913 | // as well as the file size, and the lba. |
---|
| 914 | // We consider 3 types of directory entries: |
---|
| 915 | // - SFN : directory entry associated to a Short File Name (8.3) |
---|
| 916 | // - LFN : directory entry associated to a Long File Name |
---|
| 917 | // - XTN : directory entry containing only a name extension for a Long File Name |
---|
| 918 | // The cluster index is always stored in a SFN or LFN entry. |
---|
| 919 | // Return cluster index if name found / Return -1 if not found. |
---|
[530] | 920 | ////////////////////////////////////////////////////////////////////////////////// |
---|
| 921 | static |
---|
| 922 | int _scan_directory( unsigned int use_irq, // use descheduling mode |
---|
| 923 | unsigned int cluster, // cluster of dir_entry |
---|
| 924 | char* file_name, // searched file/dir name |
---|
| 925 | unsigned int* file_size, // file size |
---|
| 926 | unsigned int* lba_dir_entry ) // lba of dir_entry |
---|
[258] | 927 | { |
---|
[417] | 928 | char dir_entry[32]; // buffer to store a full directory_entry |
---|
| 929 | char name_entry[14]; // buffer to store a 13 characters (partial) name |
---|
[258] | 930 | |
---|
[530] | 931 | char sfn_string[12] = {[0 ... 10] = ' ', '\0'}; // buffer Short File Name |
---|
| 932 | unsigned int is_sfn = is_short(file_name, sfn_string); // file_name is short |
---|
| 933 | unsigned int offset = 0; // byte offset in block |
---|
| 934 | unsigned int block_id = _fat.sectors_per_cluster; // sector index |
---|
| 935 | unsigned int lba = cluster_to_lba(cluster); // lba of cluster |
---|
| 936 | unsigned int attr = 0; // dir entry attribute |
---|
| 937 | unsigned int ord = 0; // dir entry sequence |
---|
| 938 | unsigned int found = 0; // searched name found |
---|
| 939 | unsigned int long_name_found = 0; // matching XTN found |
---|
| 940 | unsigned int searched_cluster; // searched cluster index |
---|
[417] | 941 | |
---|
[258] | 942 | #if GIET_DEBUG_FAT |
---|
[417] | 943 | unsigned int procid = _get_procid(); |
---|
[429] | 944 | unsigned int x = procid >> (Y_WIDTH + P_WIDTH); |
---|
| 945 | unsigned int y = (procid >> P_WIDTH) & ((1<<Y_WIDTH)-1); |
---|
| 946 | unsigned int p = procid & ((1<<P_WIDTH)-1); |
---|
| 947 | |
---|
[551] | 948 | _printf("\n[DEBUG FAT] _scan_directory() : P[%d,%d,%d] enters for %s\n", |
---|
[503] | 949 | x, y, p, file_name ); |
---|
[258] | 950 | #endif |
---|
| 951 | |
---|
| 952 | unsigned int i; |
---|
| 953 | for( i = 0 ; i < 32 ; i++ ) dir_entry[i] = 0; |
---|
| 954 | for( i = 0 ; i < 14 ; i++ ) name_entry[i] = 0; |
---|
| 955 | |
---|
[417] | 956 | // load first sector from DATA region into FAT cache |
---|
[258] | 957 | // other sectors will be loaded inside loop as required |
---|
[530] | 958 | if( _fat_ioc_access( use_irq, |
---|
| 959 | 1, // read |
---|
| 960 | lba, |
---|
| 961 | (unsigned int)_fat.fat_cache, |
---|
| 962 | 1 ) ) // one sector |
---|
[258] | 963 | { |
---|
[530] | 964 | _printf("[\nFAT ERROR] in _scan_directory() : cannot read sector %x\n", |
---|
| 965 | lba ); |
---|
[258] | 966 | return -1; |
---|
| 967 | } |
---|
[530] | 968 | _fat.cache_lba = lba; |
---|
[258] | 969 | |
---|
[358] | 970 | #if ( GIET_DEBUG_FAT > 1 ) |
---|
[503] | 971 | _display_fat_cache(); |
---|
[358] | 972 | #endif |
---|
| 973 | |
---|
[417] | 974 | // in this loop we scan all names in the directory identified by cluster index |
---|
[258] | 975 | // - the offset increment is an integer number of directory entry (32 bytes) |
---|
| 976 | // - the exit condition is success (name found) or failure (end of directory) |
---|
[417] | 977 | while( found == 0 ) |
---|
[258] | 978 | { |
---|
| 979 | // load a new sector if required |
---|
| 980 | if (offset >= 512) |
---|
| 981 | { |
---|
| 982 | if ( block_id ) // not a new cluster |
---|
| 983 | { |
---|
| 984 | lba += 1; |
---|
| 985 | block_id --; |
---|
| 986 | } |
---|
| 987 | else // get next cluster |
---|
| 988 | { |
---|
[530] | 989 | cluster = _get_next_cluster( use_irq , cluster ); |
---|
[258] | 990 | |
---|
| 991 | if ( cluster >= END_OF_CHAIN_CLUSTER ) return END_OF_CHAIN_CLUSTER; |
---|
| 992 | |
---|
| 993 | lba = cluster_to_lba(cluster); |
---|
[530] | 994 | block_id = _fat.sectors_per_cluster; |
---|
[258] | 995 | } |
---|
[530] | 996 | if( _fat_ioc_access( use_irq, |
---|
| 997 | 1, // read |
---|
| 998 | lba, |
---|
| 999 | (unsigned int)_fat.fat_cache, |
---|
| 1000 | 1 ) ) // one sector |
---|
[258] | 1001 | { |
---|
[530] | 1002 | _printf("\n[FAT ERROR] in _scan_directory() : cannot read sector %x\n", |
---|
| 1003 | lba); |
---|
[258] | 1004 | return -1; |
---|
| 1005 | } |
---|
[530] | 1006 | _fat.cache_lba = lba; |
---|
[258] | 1007 | block_id--; |
---|
| 1008 | offset = offset % 512; |
---|
| 1009 | } |
---|
| 1010 | |
---|
[417] | 1011 | // store the directory entry pointed by offset in dir_entry buffer, |
---|
| 1012 | // if it a possible candidate for the searched name |
---|
[258] | 1013 | |
---|
[530] | 1014 | attr = _read_entry( DIR_ATTR, _fat.fat_cache + offset, 0); |
---|
| 1015 | ord = _read_entry( LDIR_ORD, _fat.fat_cache + offset, 0); |
---|
[417] | 1016 | |
---|
| 1017 | if ( is_sfn == 1 ) // searched name is short |
---|
| 1018 | { |
---|
| 1019 | if ( (ord != FREE_ENTRY ) && |
---|
| 1020 | (ord != NO_MORE_ENTRY) && |
---|
| 1021 | (attr == ATTR_LONG_NAME_MASK) ) // EXT entry : skipped |
---|
[258] | 1022 | { |
---|
[417] | 1023 | offset = offset + ((ord & 0xF) * DIR_ENTRY_SIZE); |
---|
[258] | 1024 | } |
---|
[417] | 1025 | else if ( (attr != ATTR_LONG_NAME_MASK) && |
---|
| 1026 | (ord != FREE_ENTRY) && |
---|
| 1027 | (ord != NO_MORE_ENTRY ) ) // SFN entry : to be checked |
---|
[258] | 1028 | { |
---|
[530] | 1029 | memcpy( dir_entry, _fat.fat_cache + offset, DIR_ENTRY_SIZE ); |
---|
[417] | 1030 | |
---|
| 1031 | get_name_from_short( dir_entry, name_entry ); |
---|
| 1032 | |
---|
| 1033 | if ( _strncmp( (char*)sfn_string, |
---|
| 1034 | (char*)name_entry, 13 ) == 0 ) // short name found |
---|
[258] | 1035 | { |
---|
[417] | 1036 | found = 1; |
---|
[258] | 1037 | } |
---|
[417] | 1038 | else |
---|
[258] | 1039 | { |
---|
| 1040 | offset = offset + DIR_ENTRY_SIZE; |
---|
| 1041 | } |
---|
| 1042 | } |
---|
[417] | 1043 | else if (ord == NO_MORE_ENTRY ) // end of directory : return |
---|
[258] | 1044 | { |
---|
[417] | 1045 | return END_OF_CHAIN_CLUSTER; |
---|
[258] | 1046 | } |
---|
[417] | 1047 | } |
---|
| 1048 | else // searched name is long |
---|
| 1049 | { |
---|
| 1050 | if( (attr == ATTR_LONG_NAME_MASK) && |
---|
| 1051 | (ord != FREE_ENTRY) && |
---|
| 1052 | (ord != NO_MORE_ENTRY) ) // EXT entry : to be checked |
---|
[258] | 1053 | { |
---|
[530] | 1054 | memcpy( dir_entry, _fat.fat_cache + offset, DIR_ENTRY_SIZE ); |
---|
[417] | 1055 | |
---|
[258] | 1056 | get_name_from_long( dir_entry, name_entry ); |
---|
| 1057 | |
---|
| 1058 | unsigned shift = ((ord & 0xf) - 1) * 13; |
---|
[417] | 1059 | if ( _strncmp( (char*)(file_name + shift), |
---|
| 1060 | (char*)name_entry, 13 ) == 0 ) // matching EXT |
---|
[258] | 1061 | { |
---|
[417] | 1062 | if( (ord & 0xf) == 1 ) // long name found |
---|
| 1063 | { |
---|
| 1064 | long_name_found = 1; |
---|
| 1065 | } |
---|
[258] | 1066 | } |
---|
[417] | 1067 | offset = offset + DIR_ENTRY_SIZE; |
---|
| 1068 | } |
---|
| 1069 | else if( (attr != ATTR_LONG_NAME_MASK) && |
---|
| 1070 | (ord != FREE_ENTRY) && |
---|
| 1071 | (ord != NO_MORE_ENTRY) ) |
---|
| 1072 | { |
---|
| 1073 | if ( long_name_found ) // LFN entry |
---|
[258] | 1074 | { |
---|
[530] | 1075 | memcpy( dir_entry, _fat.fat_cache + offset, DIR_ENTRY_SIZE ); |
---|
[417] | 1076 | found = 1; |
---|
[258] | 1077 | } |
---|
[417] | 1078 | else // SFN entry: must be skipped |
---|
| 1079 | { |
---|
| 1080 | offset = offset + DIR_ENTRY_SIZE; |
---|
| 1081 | } |
---|
[258] | 1082 | } |
---|
[417] | 1083 | else if (ord == NO_MORE_ENTRY ) // end of directory : return |
---|
| 1084 | { |
---|
| 1085 | return END_OF_CHAIN_CLUSTER; |
---|
| 1086 | } |
---|
[258] | 1087 | } |
---|
[417] | 1088 | } // end while |
---|
[258] | 1089 | |
---|
[417] | 1090 | // returns cluster index |
---|
| 1091 | *file_size = _read_entry( DIR_FILE_SIZE, dir_entry, 1 ); |
---|
| 1092 | *lba_dir_entry = lba; |
---|
| 1093 | searched_cluster = (_read_entry( DIR_FST_CLUS_HI, dir_entry, 1 ) << 16) | |
---|
| 1094 | (_read_entry( DIR_FST_CLUS_LO, dir_entry, 1 ) ) ; |
---|
[258] | 1095 | |
---|
[417] | 1096 | #if GIET_DEBUG_FAT |
---|
[530] | 1097 | _printf("\n[DEBUG FAT] _scan_directory() : P[%d,%d,%d] found %s" |
---|
[503] | 1098 | " : cluster = %x\n", x, y, p, file_name, searched_cluster ); |
---|
[417] | 1099 | #endif |
---|
| 1100 | |
---|
| 1101 | return searched_cluster; |
---|
| 1102 | } // end _scan_directory() |
---|
| 1103 | |
---|
| 1104 | |
---|
[258] | 1105 | ////////////////////////////////////////////////////////////////////// |
---|
| 1106 | // This function create a new entry in a directory identified |
---|
| 1107 | // by "dir_cluster". The name is defined by "name". |
---|
| 1108 | // The type (dir/file) is defined by "is_file". |
---|
| 1109 | // Returns cluster index if success, Returns -1 if error. |
---|
| 1110 | ////////////////////////////////////////////////////////////////////// |
---|
[417] | 1111 | static int _fat_create( char* name, |
---|
| 1112 | unsigned int is_file, |
---|
| 1113 | unsigned int dir_cluster ) |
---|
[258] | 1114 | { |
---|
[503] | 1115 | _printf("\n[FAT ERROR] _fat_create() not implemented\n"); |
---|
[258] | 1116 | return 0; |
---|
| 1117 | } //end _fat_create() |
---|
| 1118 | |
---|
| 1119 | |
---|
| 1120 | |
---|
| 1121 | ////////////// Extern functions ////////////////////////////////////////// |
---|
| 1122 | |
---|
| 1123 | ////////////////////////////////////////////////////////////////////////// |
---|
[458] | 1124 | // This function initializes the FAT structure, including the open |
---|
| 1125 | // files descriptors array and the lock protecting the FAT, |
---|
| 1126 | // from informations found in the boot record. |
---|
| 1127 | // This should be done only once. |
---|
[258] | 1128 | ////////////////////////////////////////////////////////////////////////// |
---|
[503] | 1129 | // Return 0 if success, exit if failure |
---|
[258] | 1130 | ////////////////////////////////////////////////////////////////////////// |
---|
[530] | 1131 | int _fat_init( unsigned int use_irq ) |
---|
[258] | 1132 | { |
---|
| 1133 | |
---|
| 1134 | #if GIET_DEBUG_FAT |
---|
[295] | 1135 | unsigned int procid = _get_procid(); |
---|
[429] | 1136 | unsigned int x = procid >> (Y_WIDTH + P_WIDTH); |
---|
| 1137 | unsigned int y = (procid >> P_WIDTH) & ((1<<Y_WIDTH)-1); |
---|
| 1138 | unsigned int p = procid & ((1<<P_WIDTH)-1); |
---|
[530] | 1139 | _printf("\n[DEBUG FAT] P[%d,%d,%d] enters _fat_init\n",x,y,p); |
---|
[258] | 1140 | #endif |
---|
[458] | 1141 | |
---|
| 1142 | // FAT initialisation should be done only once |
---|
[530] | 1143 | if ( _fat.initialised == FAT_INITIALISED ) |
---|
[458] | 1144 | { |
---|
[530] | 1145 | _printf("\n[FAT ERROR] Strange, FAT already initialised...\n"); |
---|
[503] | 1146 | _exit(); |
---|
[458] | 1147 | } |
---|
| 1148 | |
---|
[300] | 1149 | // load Boot Record (VBR) into fat cache |
---|
[530] | 1150 | if ( _fat_ioc_access( use_irq, |
---|
| 1151 | 1, // read |
---|
| 1152 | 0, // sector index |
---|
| 1153 | (unsigned int)_fat.fat_cache, |
---|
| 1154 | 1 ) ) // one sector |
---|
[258] | 1155 | { |
---|
[503] | 1156 | _printf("\n[FAT ERROR] in _fat_init() cannot load VBR\n"); |
---|
| 1157 | _exit(); |
---|
[258] | 1158 | } |
---|
[530] | 1159 | _fat.cache_lba = 0; |
---|
[258] | 1160 | |
---|
[503] | 1161 | #if GIET_DEBUG_FAT > 1 |
---|
[530] | 1162 | _printf("\n[DEBUG FAT] _fat_init() : Boot Sector Loaded\n"); |
---|
[503] | 1163 | _display_fat_cache(); |
---|
[258] | 1164 | #endif |
---|
| 1165 | |
---|
| 1166 | // checking various FAT32 assuptions from boot sector |
---|
[530] | 1167 | if( _read_entry( BPB_BYTSPERSEC, _fat.fat_cache, 1 ) != 512 ) |
---|
[258] | 1168 | { |
---|
[503] | 1169 | _printf("\n[FAT ERROR] The sector size must be 512 bytes\n"); |
---|
| 1170 | _exit(); |
---|
[258] | 1171 | } |
---|
[530] | 1172 | if( _read_entry( BPB_NUMFATS, _fat.fat_cache, 1 ) != 1 ) |
---|
[258] | 1173 | { |
---|
[503] | 1174 | _printf("\n[FAT ERROR] The number of FAT copies in FAT region must be 1\n"); |
---|
| 1175 | _exit(); |
---|
[258] | 1176 | } |
---|
[530] | 1177 | if( (_read_entry( BPB_FAT32_FATSZ32, _fat.fat_cache, 1 ) & 0xF) != 0 ) |
---|
[258] | 1178 | { |
---|
[530] | 1179 | _printf("\n[FAT ERROR] The FAT region must be multiple of 32 sectors\n"); |
---|
[503] | 1180 | _exit(); |
---|
[258] | 1181 | } |
---|
[530] | 1182 | if( _read_entry( BPB_FAT32_ROOTCLUS, _fat.fat_cache, 1 ) != 2 ) |
---|
[258] | 1183 | { |
---|
[503] | 1184 | _printf("\n[FAT ERROR] The first cluster index must be 2\n"); |
---|
| 1185 | _exit(); |
---|
[258] | 1186 | } |
---|
[300] | 1187 | // FS Info always in sector 1 |
---|
[530] | 1188 | _fat.fs_info_lba = _read_entry( BPB_FAT32_FSINFO, _fat.fat_cache, 1 ); |
---|
[258] | 1189 | |
---|
[300] | 1190 | // initialise fat descriptor from VBR |
---|
[530] | 1191 | _fat.sectors_per_cluster = _read_entry( BPB_SECPERCLUS, _fat.fat_cache, 1 ); |
---|
| 1192 | _fat.sector_size = _read_entry( BPB_BYTSPERSEC, _fat.fat_cache, 1 ); |
---|
| 1193 | _fat.cluster_size = _fat.sectors_per_cluster * 512; |
---|
| 1194 | _fat.fat_sectors = _read_entry( BPB_FAT32_FATSZ32, _fat.fat_cache, 1 ); |
---|
| 1195 | _fat.fat_lba = _read_entry( BPB_RSVDSECCNT, _fat.fat_cache, 1 ); |
---|
| 1196 | _fat.data_lba = _fat.fat_lba + _fat.fat_sectors; |
---|
| 1197 | _fat.initialised = FAT_INITIALISED; |
---|
[258] | 1198 | |
---|
[458] | 1199 | // initalise the lock protecting the FAT |
---|
[530] | 1200 | _spin_lock_init( &_fat.fat_lock ); |
---|
[458] | 1201 | |
---|
[258] | 1202 | // initialise file descriptor array |
---|
[530] | 1203 | unsigned int n; |
---|
| 1204 | for( n = 0 ; n < GIET_OPEN_FILES_MAX ; n++ ) _fat.fd[n].used = 0; |
---|
[258] | 1205 | |
---|
[291] | 1206 | #if GIET_DEBUG_FAT |
---|
[530] | 1207 | _printf("\n[DEBUG FAT] _fat_init() : FS_INFO Sector = %x\n", _fat.fs_info_lba ); |
---|
[291] | 1208 | #endif |
---|
| 1209 | |
---|
| 1210 | // load FS_INFO into fat cache |
---|
[530] | 1211 | if ( _fat_ioc_access( use_irq, |
---|
| 1212 | 1, // read |
---|
| 1213 | _fat.fs_info_lba, |
---|
| 1214 | (unsigned int)_fat.fat_cache, |
---|
| 1215 | 1 ) ) // one sector |
---|
[291] | 1216 | { |
---|
[503] | 1217 | _printf("\n[FAT ERROR] in _fat_init() cannot load FS_INFO Sector\n"); |
---|
| 1218 | _exit(); |
---|
[291] | 1219 | } |
---|
[530] | 1220 | _fat.cache_lba = _fat.fs_info_lba; |
---|
[291] | 1221 | |
---|
[530] | 1222 | _fat.number_free_cluster = _read_entry( FS_FREE_CLUSTER , _fat.fat_cache, 1); |
---|
| 1223 | _fat.last_cluster_allocated = _read_entry( FS_FREE_CLUSTER_HINT, _fat.fat_cache, 1); |
---|
[291] | 1224 | |
---|
| 1225 | #if GIET_DEBUG_FAT |
---|
[358] | 1226 | _fat_print(); |
---|
[530] | 1227 | _printf("\n[DEBUG FAT] P[%d,%d,%d] exit _fat_init()\n", x,y,p ); |
---|
[291] | 1228 | #endif |
---|
| 1229 | |
---|
[258] | 1230 | return 0; |
---|
| 1231 | } // end _fat_init() |
---|
| 1232 | |
---|
| 1233 | /////////////////////////////////////////////////////////////////////////////// |
---|
[354] | 1234 | // This function checks that the kernel FAT structure has been initialised. |
---|
[458] | 1235 | // It searches a file identified by the "pathname" argument. |
---|
[258] | 1236 | // It starts from root (cluster 2) to scan successively each subdirectory. |
---|
| 1237 | // When the file is not found, but the path is found, and "creat" is set, |
---|
| 1238 | // a new file is created and introduced in the directory. |
---|
| 1239 | // Finally, it sets a new open file in the file descriptors array. |
---|
[354] | 1240 | // The same file can be open several times by differents tasks. |
---|
[258] | 1241 | /////////////////////////////////////////////////////////////////////////////// |
---|
| 1242 | // Returns file descriptor index if success, returns -1 if error. |
---|
| 1243 | /////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 1244 | int _fat_open( unsigned int use_irq, // use descheduling mode if possible |
---|
[258] | 1245 | char* pathname, |
---|
| 1246 | unsigned int creat ) |
---|
| 1247 | { |
---|
[354] | 1248 | char name[256]; // buffer for one name in pathname |
---|
| 1249 | unsigned int nb_read; // number of characters written in name[] |
---|
| 1250 | unsigned int cluster; // current cluster index when scanning FAT |
---|
| 1251 | unsigned int dir_cluster; // previous cluster index when scanning FAT |
---|
| 1252 | unsigned int fd_id; // index when scanning file descriptors array |
---|
| 1253 | unsigned int file_size = 0; // number of bytes |
---|
| 1254 | unsigned int last_name = 0; // directory containing file name is reached |
---|
| 1255 | unsigned int lba = 0; // lba of dir_entry for this file |
---|
[258] | 1256 | |
---|
| 1257 | #if GIET_DEBUG_FAT |
---|
[295] | 1258 | unsigned int procid = _get_procid(); |
---|
[429] | 1259 | unsigned int x = procid >> (Y_WIDTH + P_WIDTH); |
---|
| 1260 | unsigned int y = (procid >> P_WIDTH) & ((1<<Y_WIDTH)-1); |
---|
| 1261 | unsigned int p = procid & ((1<<P_WIDTH)-1); |
---|
[551] | 1262 | _printf("\n[DEBUG FAT] _fat_open() : P[%d,%d,%d] enters for path %s\n", |
---|
[503] | 1263 | x, y, p, pathname ); |
---|
[258] | 1264 | #endif |
---|
| 1265 | |
---|
[458] | 1266 | // checking creat argument |
---|
[295] | 1267 | if ( creat ) |
---|
| 1268 | { |
---|
[503] | 1269 | _printf("\n[FAT ERROR] in _fat_open() : create not supported yet\n"); |
---|
[295] | 1270 | return -1; |
---|
| 1271 | } |
---|
| 1272 | |
---|
[458] | 1273 | // checking FAT initialised |
---|
[530] | 1274 | if( _fat.initialised != FAT_INITIALISED ) |
---|
[458] | 1275 | { |
---|
[503] | 1276 | _printf("\n[FAT ERROR] in _fat_open() : FAT not initialised\n"); |
---|
[458] | 1277 | return -1; |
---|
| 1278 | } |
---|
[295] | 1279 | // takes the FAT lock for exclusive access |
---|
[530] | 1280 | _spin_lock_acquire( &_fat.fat_lock ); |
---|
[295] | 1281 | |
---|
| 1282 | #if GIET_DEBUG_FAT |
---|
[530] | 1283 | _printf("\n[DEBUG FAT] _fat_open() : P[%d,%d,%d] takes the FAT lock\n", |
---|
[503] | 1284 | x, y, p ); |
---|
[295] | 1285 | #endif |
---|
[258] | 1286 | |
---|
[263] | 1287 | // Scan the directories, starting from the root directory (cluster 2) |
---|
[258] | 1288 | // - The get_name_from_path() function extracts (successively) |
---|
| 1289 | // each directory name from the pathname, and store it in name[] buffer |
---|
[417] | 1290 | // - The _scan_directory() function scan one (or several) cluster(s) containing |
---|
[258] | 1291 | // a directory looking for name[], and return the cluster index |
---|
| 1292 | // corresponding to the directory/file found. |
---|
| 1293 | nb_read = 0; |
---|
| 1294 | cluster = 2; |
---|
| 1295 | last_name = 0; |
---|
| 1296 | while ( get_name_from_path( pathname, name, &nb_read) ) |
---|
| 1297 | { |
---|
| 1298 | |
---|
| 1299 | #if GIET_DEBUG_FAT |
---|
[530] | 1300 | _printf("\n[DEBUG FAT] _fat_open() : P[%d,%d,%d] search file/dir %s\n", |
---|
[503] | 1301 | x, y, p, name ); |
---|
[258] | 1302 | #endif |
---|
[291] | 1303 | |
---|
[258] | 1304 | // test if we reach the last name (file name) |
---|
| 1305 | if( pathname[nb_read] == 0 ) |
---|
| 1306 | { |
---|
| 1307 | last_name = 1; |
---|
| 1308 | dir_cluster = cluster; |
---|
| 1309 | } |
---|
| 1310 | |
---|
| 1311 | // scan current directory |
---|
[530] | 1312 | cluster = _scan_directory( use_irq , cluster , name , &file_size , &lba ); |
---|
[258] | 1313 | |
---|
| 1314 | if( cluster == END_OF_CHAIN_CLUSTER && last_name && creat ) |
---|
| 1315 | { |
---|
[417] | 1316 | cluster = _fat_create( name, 1, dir_cluster ); |
---|
[258] | 1317 | } |
---|
| 1318 | else if ( cluster == END_OF_CHAIN_CLUSTER ) |
---|
| 1319 | { |
---|
[503] | 1320 | _printf("\n[FAT ERROR] in _fat_open() cannot found %s\n", name ); |
---|
[530] | 1321 | _spin_lock_release( &_fat.fat_lock ); |
---|
[258] | 1322 | return -1; |
---|
| 1323 | } |
---|
| 1324 | } |
---|
| 1325 | |
---|
[417] | 1326 | #if GIET_DEBUG_FAT |
---|
[530] | 1327 | _printf("\n[DEBUG FAT] P[%d,%d,%d] in _fat_open() : cluster for %s = %x\n", |
---|
[503] | 1328 | x, y, p, pathname, cluster ); |
---|
[417] | 1329 | #endif |
---|
| 1330 | |
---|
[258] | 1331 | // check the next value for cluster index found |
---|
[530] | 1332 | unsigned next = _get_next_cluster( use_irq , cluster ); |
---|
[258] | 1333 | |
---|
| 1334 | if ( (next != BAD_CLUSTER) && (next != FREE_CLUSTER) ) |
---|
| 1335 | { |
---|
| 1336 | // Search an empty slot scanning open file descriptors array |
---|
| 1337 | fd_id = 0; |
---|
[530] | 1338 | while ( _fat.fd[fd_id].used != 0 && fd_id < GIET_OPEN_FILES_MAX ) |
---|
[258] | 1339 | { |
---|
| 1340 | fd_id++; |
---|
| 1341 | } |
---|
| 1342 | |
---|
| 1343 | // set file descriptor if found empty slot |
---|
| 1344 | if ( fd_id < GIET_OPEN_FILES_MAX ) |
---|
| 1345 | { |
---|
[530] | 1346 | _fat.fd[fd_id].used = 1; |
---|
| 1347 | _fat.fd[fd_id].first_cluster = cluster; |
---|
| 1348 | _fat.fd[fd_id].file_size = file_size; |
---|
| 1349 | _fat.fd[fd_id].lba_dir_entry = lba; |
---|
| 1350 | _strcpy( _fat.fd[fd_id].name, pathname ); |
---|
[258] | 1351 | |
---|
| 1352 | #if GIET_DEBUG_FAT |
---|
[530] | 1353 | _printf("\n[DEBUG FAT] _fat_open() : P[%d,%d,%d] exit : fd = %d for file %s\n", |
---|
[503] | 1354 | x, y, p, fd_id, pathname ); |
---|
[258] | 1355 | #endif |
---|
| 1356 | |
---|
[295] | 1357 | // release FAT lock |
---|
[530] | 1358 | _spin_lock_release( &_fat.fat_lock ); |
---|
[295] | 1359 | |
---|
[258] | 1360 | return fd_id; |
---|
| 1361 | } |
---|
| 1362 | else |
---|
| 1363 | { |
---|
[503] | 1364 | _printf("\n[FAT ERROR] in _fat_open() for file %s : fd array full\n", |
---|
| 1365 | pathname ); |
---|
[530] | 1366 | _spin_lock_release( &_fat.fat_lock ); |
---|
[258] | 1367 | return -1; |
---|
| 1368 | } |
---|
| 1369 | } |
---|
| 1370 | else |
---|
| 1371 | { |
---|
[503] | 1372 | _printf("\n[FAT ERROR] in _fat_open() for file %s : bad cluster\n", |
---|
| 1373 | pathname ); |
---|
[530] | 1374 | _spin_lock_release( &_fat.fat_lock ); |
---|
[258] | 1375 | return -1; |
---|
| 1376 | } |
---|
| 1377 | } // end _fat_open() |
---|
| 1378 | |
---|
| 1379 | /////////////////////////////////////////////////////////////////////////////// |
---|
| 1380 | // For an open file, identified by the file descriptor index, transfer |
---|
| 1381 | // an integer number of sectors from block device to a memory buffer. |
---|
| 1382 | // If the number of requested sectors exceeds the file size, it is reduced. |
---|
| 1383 | /////////////////////////////////////////////////////////////////////////////// |
---|
| 1384 | // Returns number of sectors transfered if success, < 0 if error. |
---|
| 1385 | /////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 1386 | int _fat_read( unsigned int use_irq, // use descheduling mode if possible |
---|
[258] | 1387 | unsigned int fd_id, // file descriptor |
---|
| 1388 | void* buffer, // target buffer base address |
---|
| 1389 | unsigned int count, // number of sector to read |
---|
| 1390 | unsigned int offset ) // nuber of sectors to skip in file |
---|
| 1391 | { |
---|
[530] | 1392 | unsigned int spc = _fat.sectors_per_cluster; |
---|
[258] | 1393 | |
---|
| 1394 | unsigned int file_size; // number of bytes in file |
---|
| 1395 | unsigned int file_sectors; // number of sectors in file |
---|
| 1396 | unsigned int total_sectors; // actual number of sectors to be transfered |
---|
| 1397 | unsigned int cluster; // cluster index |
---|
| 1398 | unsigned int clusters_to_skip; // number of clusters to skip because offset |
---|
| 1399 | unsigned int sectors_to_skip; // number of sectors to skip in first iteration |
---|
| 1400 | |
---|
| 1401 | // arguments checking |
---|
| 1402 | if ( fd_id >= GIET_OPEN_FILES_MAX ) |
---|
| 1403 | { |
---|
[503] | 1404 | _printf("\n[FAT ERROR] in _fat_read() : illegal file descriptor index\n"); |
---|
[258] | 1405 | return -1; |
---|
| 1406 | } |
---|
[530] | 1407 | if ( _fat.fd[fd_id].used != 1 ) |
---|
[258] | 1408 | { |
---|
[503] | 1409 | _printf("\n[FAT ERROR] in _fat_read() : file not open\n"); |
---|
[258] | 1410 | return -1; |
---|
| 1411 | } |
---|
| 1412 | if ( ((unsigned int)buffer & 0x1FF) != 0 ) |
---|
| 1413 | { |
---|
[503] | 1414 | _printf("\n[FAT ERROR] in _fat_read() : memory buffer not sector aligned\n"); |
---|
[258] | 1415 | return -1; |
---|
| 1416 | } |
---|
[358] | 1417 | |
---|
| 1418 | // compute file size as a number of sectors |
---|
[530] | 1419 | file_size = _fat.fd[fd_id].file_size; |
---|
[358] | 1420 | if ( file_size & 0x1FF ) file_sectors = (file_size >> 9) + 1; |
---|
| 1421 | else file_sectors = (file_size >> 9); |
---|
| 1422 | |
---|
[258] | 1423 | if ( offset >= file_sectors ) |
---|
| 1424 | { |
---|
[503] | 1425 | _printf("\n[FAT ERROR] offset larger than number of sectors\n"); |
---|
[258] | 1426 | return -1; |
---|
| 1427 | } |
---|
| 1428 | |
---|
| 1429 | // compute total number of sectors to read |
---|
| 1430 | if ( file_sectors < (offset + count) ) total_sectors = file_sectors - offset; |
---|
| 1431 | else total_sectors = count; |
---|
| 1432 | |
---|
| 1433 | // compute clusters and sectors to be skipped |
---|
| 1434 | clusters_to_skip = offset / spc; |
---|
| 1435 | sectors_to_skip = offset % spc; |
---|
| 1436 | |
---|
| 1437 | // get first cluster index |
---|
[530] | 1438 | cluster = _fat.fd[fd_id].first_cluster; |
---|
[258] | 1439 | |
---|
| 1440 | #if GIET_DEBUG_FAT |
---|
[354] | 1441 | unsigned int procid = _get_procid(); |
---|
[429] | 1442 | unsigned int x = procid >> (Y_WIDTH + P_WIDTH); |
---|
| 1443 | unsigned int y = (procid >> P_WIDTH) & ((1<<Y_WIDTH)-1); |
---|
| 1444 | unsigned int p = procid & ((1<<P_WIDTH)-1); |
---|
[530] | 1445 | _printf("\n[DEBUG FAT] _fat_read() : P[%d,%d,%d] enters for file %s\n" |
---|
[503] | 1446 | " - buffer vbase = %x\n" |
---|
| 1447 | " - skipped sectors = %x\n" |
---|
| 1448 | " - read sectors = %x\n" |
---|
| 1449 | " - first cluster = %x\n" |
---|
| 1450 | " - skipped clusters = %x\n", |
---|
[530] | 1451 | x, y, p, _fat.fd[fd_id].name, (unsigned int)buffer, |
---|
| 1452 | offset, count, cluster, clusters_to_skip ); |
---|
[258] | 1453 | #endif |
---|
| 1454 | |
---|
| 1455 | // compute index of first cluster to be loaded |
---|
| 1456 | while ( clusters_to_skip ) |
---|
| 1457 | { |
---|
[530] | 1458 | cluster = _get_next_cluster( use_irq , cluster ); |
---|
[258] | 1459 | clusters_to_skip--; |
---|
| 1460 | } |
---|
| 1461 | |
---|
| 1462 | // variables used in the loop on clusters |
---|
| 1463 | int todo_sectors; // number of sectors still to be loaded |
---|
| 1464 | unsigned int lba; // first sector index on device |
---|
| 1465 | unsigned int iter_sectors; // number of sectors to load in iteration |
---|
[530] | 1466 | unsigned int dst; // pointer on target buffer |
---|
[258] | 1467 | |
---|
| 1468 | // initialize these variables for the first iteration |
---|
| 1469 | todo_sectors = total_sectors; |
---|
[530] | 1470 | dst = (unsigned int)buffer; |
---|
[258] | 1471 | lba = cluster_to_lba(cluster) + sectors_to_skip; |
---|
| 1472 | if( total_sectors < (spc - sectors_to_skip) ) iter_sectors = total_sectors; |
---|
| 1473 | else iter_sectors = spc - sectors_to_skip; |
---|
| 1474 | |
---|
[358] | 1475 | // loop on the clusters: one IOC access per cluster |
---|
[258] | 1476 | while ( todo_sectors > 0 ) |
---|
| 1477 | { |
---|
| 1478 | |
---|
| 1479 | #if GIET_DEBUG_FAT |
---|
[530] | 1480 | _printf("\n[DEBUG FAT] _fat_read() : P[%d,%d,%d] makes an IOC read\n" |
---|
| 1481 | " cluster = %x / buffer = %x / lba = %x / sectors = %d\n", |
---|
| 1482 | x, y, p, cluster, dst, lba, iter_sectors ); |
---|
[258] | 1483 | #endif |
---|
| 1484 | |
---|
[530] | 1485 | if( _fat_ioc_access( use_irq, |
---|
| 1486 | 1, // read |
---|
| 1487 | lba, |
---|
| 1488 | dst, // buffer address |
---|
| 1489 | iter_sectors ) ) // number of sectors |
---|
[258] | 1490 | { |
---|
[503] | 1491 | _printf("\n[FAT ERROR] in _fat_read() cannot load block %x", lba ); |
---|
[258] | 1492 | return -1; |
---|
| 1493 | } |
---|
| 1494 | |
---|
| 1495 | // update variables for next iteration |
---|
[530] | 1496 | cluster = _get_next_cluster( use_irq , cluster ); |
---|
[258] | 1497 | todo_sectors = todo_sectors - iter_sectors; |
---|
| 1498 | dst = dst + (iter_sectors << 9); |
---|
| 1499 | lba = cluster_to_lba(cluster); |
---|
| 1500 | if ( todo_sectors > spc ) iter_sectors = spc; |
---|
| 1501 | else iter_sectors = todo_sectors; |
---|
| 1502 | } |
---|
| 1503 | |
---|
| 1504 | // returns number of sectors actually transfered |
---|
| 1505 | return total_sectors; |
---|
| 1506 | |
---|
| 1507 | } // end _fat_read() |
---|
| 1508 | |
---|
| 1509 | /////////////////////////////////////////////////////////////////////////////// |
---|
| 1510 | // For an open file, identified by the file descriptor index, transfer |
---|
| 1511 | // an integer number of sectors from a memory buffer to block device. |
---|
| 1512 | // Allocate new clusters if the offset+count larger than current file size, |
---|
| 1513 | // but the offset should be smaller than the current file size... |
---|
| 1514 | /////////////////////////////////////////////////////////////////////////////// |
---|
| 1515 | // Returns number of sectors written if success, < 0 if error. |
---|
| 1516 | /////////////////////////////////////////////////////////////////////////////// |
---|
[530] | 1517 | int _fat_write( unsigned int use_irq, // use descheduling mode if possible |
---|
[258] | 1518 | unsigned int fd_id, // file descriptor |
---|
| 1519 | void* buffer, // target buffer base address |
---|
| 1520 | unsigned int count, // number of sector to write |
---|
| 1521 | unsigned int offset ) // nuber of sectors to skip in file |
---|
| 1522 | { |
---|
[259] | 1523 | |
---|
[530] | 1524 | unsigned int spc = _fat.sectors_per_cluster; |
---|
[259] | 1525 | |
---|
| 1526 | unsigned int file_size; // number of bytes in file |
---|
| 1527 | unsigned int file_sectors; // number of sectors in file |
---|
| 1528 | unsigned int cluster; // cluster index |
---|
| 1529 | unsigned int clusters_to_skip; // number of clusters to skip because offset |
---|
| 1530 | unsigned int sectors_to_skip; // number of sectors to skip in first iteration |
---|
| 1531 | unsigned int allocate; // need allocate or not |
---|
[291] | 1532 | unsigned int current_cluster; // number of cluster allocated to the file |
---|
| 1533 | unsigned int required_cluster; // number of cluster needed for the write |
---|
[259] | 1534 | |
---|
| 1535 | // compute file size as a number of sectors |
---|
[530] | 1536 | file_size = _fat.fd[fd_id].file_size; |
---|
[259] | 1537 | if ( file_size & 0x1FF ) file_sectors = (file_size >> 9) + 1; |
---|
| 1538 | else file_sectors = (file_size >> 9); |
---|
| 1539 | |
---|
[291] | 1540 | // Compute the number of clusters occupied by the file |
---|
| 1541 | current_cluster = file_sectors / spc; |
---|
| 1542 | |
---|
| 1543 | // Compute the number of clusters that will occupy the file (after fat_write) |
---|
| 1544 | required_cluster = (count + offset) / spc; |
---|
| 1545 | |
---|
| 1546 | // Check if we need to allocate new cluster(s) for the file |
---|
| 1547 | allocate = ( required_cluster > current_cluster ); |
---|
| 1548 | |
---|
[259] | 1549 | #if GIET_DEBUG_FAT |
---|
[295] | 1550 | unsigned int procid = _get_procid(); |
---|
[429] | 1551 | unsigned int x = procid >> (Y_WIDTH + P_WIDTH); |
---|
| 1552 | unsigned int y = (procid >> P_WIDTH) & ((1<<Y_WIDTH)-1); |
---|
| 1553 | unsigned int p = procid & ((1<<P_WIDTH)-1); |
---|
[503] | 1554 | |
---|
[530] | 1555 | _printf("\n[DEBUG FAT] _fat_write() : P[%d,%d,%d] enters for file %s\n" |
---|
[503] | 1556 | " - buffer vbase = %x\n" |
---|
| 1557 | " - skipped sectors = %x\n" |
---|
| 1558 | " - write sectors = %x\n" |
---|
| 1559 | " - file sectors = %x\n" |
---|
| 1560 | " - need_allocate = %d\n", |
---|
[530] | 1561 | x, y, p, _fat.fd[fd_id].name, (unsigned int)buffer, |
---|
| 1562 | offset, count, file_sectors, allocate ); |
---|
[259] | 1563 | #endif |
---|
| 1564 | |
---|
| 1565 | // arguments checking |
---|
| 1566 | if ( fd_id >= GIET_OPEN_FILES_MAX ) |
---|
| 1567 | { |
---|
[503] | 1568 | _printf("\n[FAT ERROR] in _fat_write() : illegal file descriptor index\n"); |
---|
[259] | 1569 | return -1; |
---|
| 1570 | } |
---|
[530] | 1571 | if ( _fat.fd[fd_id].used != 1 ) |
---|
[259] | 1572 | { |
---|
[503] | 1573 | _printf("\n[FAT ERROR] in _fat_write() : file not open\n"); |
---|
[259] | 1574 | return -1; |
---|
| 1575 | } |
---|
| 1576 | if ( ((unsigned int)buffer & 0x1FF) != 0 ) |
---|
| 1577 | { |
---|
[503] | 1578 | _printf("\n[FAT ERROR] in _fat_write() : memory buffer not sector aligned\n"); |
---|
[259] | 1579 | return -1; |
---|
| 1580 | } |
---|
| 1581 | |
---|
[291] | 1582 | if ( allocate ) |
---|
| 1583 | { |
---|
[530] | 1584 | if ( _fat_allocate( use_irq , fd_id, (required_cluster-current_cluster) ) ) |
---|
[291] | 1585 | { |
---|
[503] | 1586 | _printf("\n[FAT ERROR] in _fat_write() : fat_allocate failed\n"); |
---|
[291] | 1587 | return -1; |
---|
| 1588 | } |
---|
| 1589 | } |
---|
| 1590 | |
---|
[259] | 1591 | // compute clusters and sectors to be skipped |
---|
| 1592 | clusters_to_skip = offset / spc; |
---|
| 1593 | sectors_to_skip = offset % spc; |
---|
| 1594 | |
---|
| 1595 | // get first cluster index |
---|
[530] | 1596 | cluster = _fat.fd[fd_id].first_cluster; |
---|
[259] | 1597 | |
---|
| 1598 | #if GIET_DEBUG_FAT |
---|
[530] | 1599 | _printf("\n[DEBUG FAT] _fat_write() : P[%d,%d,%d] get cluster %x\n", |
---|
[503] | 1600 | x, y, p, cluster ); |
---|
[259] | 1601 | #endif |
---|
| 1602 | |
---|
| 1603 | // compute index of first cluster to be loaded |
---|
| 1604 | while ( clusters_to_skip ) |
---|
| 1605 | { |
---|
[530] | 1606 | cluster = _get_next_cluster( use_irq , cluster ); |
---|
[259] | 1607 | clusters_to_skip--; |
---|
| 1608 | } |
---|
| 1609 | |
---|
| 1610 | // variables used in the loop on clusters |
---|
| 1611 | int todo_sectors; // number of sectors still to be loaded |
---|
| 1612 | unsigned int lba; // first sector index on device |
---|
| 1613 | unsigned int iter_sectors; // number of sectors to load in iteration |
---|
[530] | 1614 | unsigned int src; // pointer on target buffer |
---|
[259] | 1615 | |
---|
| 1616 | // initialize these variables for the first iteration |
---|
| 1617 | todo_sectors = count; |
---|
[530] | 1618 | src = (unsigned int)buffer; |
---|
[259] | 1619 | lba = cluster_to_lba(cluster) + sectors_to_skip; |
---|
| 1620 | if( count < (spc - sectors_to_skip) ) iter_sectors = count; |
---|
| 1621 | else iter_sectors = spc - sectors_to_skip; |
---|
| 1622 | |
---|
| 1623 | // loop on the clusters |
---|
| 1624 | while ( todo_sectors > 0 ) |
---|
| 1625 | { |
---|
| 1626 | |
---|
| 1627 | #if GIET_DEBUG_FAT |
---|
[530] | 1628 | _printf("\n[DEBUG FAT] _fat_write() : P[%d,%d,%d] makes an IOC write" |
---|
| 1629 | " cluster = %x / buffer = %x / lba = %x / sectors = %d\n", |
---|
| 1630 | x, y, p, cluster, src, lba, iter_sectors ); |
---|
[259] | 1631 | #endif |
---|
| 1632 | |
---|
[530] | 1633 | if( _fat_ioc_access( use_irq, |
---|
| 1634 | 0, // write |
---|
| 1635 | lba, |
---|
| 1636 | src, // source buffer address |
---|
| 1637 | iter_sectors ) ) // number of sectors |
---|
[259] | 1638 | { |
---|
[503] | 1639 | _printf("\n[FAT ERROR] in _fat_write() cannot write block %x\n", lba ); |
---|
[259] | 1640 | return -1; |
---|
| 1641 | } |
---|
| 1642 | |
---|
| 1643 | // update variables for next iteration |
---|
[530] | 1644 | cluster = _get_next_cluster( use_irq , cluster ); |
---|
[259] | 1645 | todo_sectors = todo_sectors - iter_sectors; |
---|
| 1646 | src = src + (iter_sectors << 9); |
---|
| 1647 | lba = cluster_to_lba(cluster); |
---|
| 1648 | if ( todo_sectors > spc ) iter_sectors = spc; |
---|
| 1649 | else iter_sectors = todo_sectors; |
---|
| 1650 | } |
---|
[291] | 1651 | |
---|
| 1652 | // Update structure file descriptor, field file_size with |
---|
| 1653 | // the new file size if the file is bigger than the previous file |
---|
| 1654 | if ( ( offset + count ) > file_sectors ) |
---|
| 1655 | { |
---|
[530] | 1656 | _fat.fd[fd_id].file_size = (count + offset) << 9; |
---|
[291] | 1657 | } |
---|
| 1658 | |
---|
| 1659 | // Update entry of directory with the new value |
---|
| 1660 | // of file size (Field : DIR_FILE_SIZE) |
---|
[530] | 1661 | if ( _update_entry( use_irq, fd_id , DIR_FILE_SIZE , _fat.fd[fd_id].file_size ) ) |
---|
[291] | 1662 | { |
---|
[530] | 1663 | _printf("\n[FAT ERROR] in _fat_write() update entry failed\n"); |
---|
| 1664 | return -1; |
---|
[291] | 1665 | } |
---|
[259] | 1666 | |
---|
| 1667 | // returns number of sectors actually transfered |
---|
| 1668 | return count; |
---|
[417] | 1669 | } // end _fat_write() |
---|
[258] | 1670 | |
---|
| 1671 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[260] | 1672 | // Return stats of a file identified by "fd". |
---|
| 1673 | // (Only the file_size in sectors for this moment) |
---|
| 1674 | ///////////////////////////////////////////////////////////////////////////////// |
---|
| 1675 | // Returns file size (on sectors) on success, -1 on failure. |
---|
| 1676 | ///////////////////////////////////////////////////////////////////////////////// |
---|
| 1677 | int _fat_fstat( unsigned int fd_id ) |
---|
| 1678 | { |
---|
| 1679 | unsigned int file_size = 0; |
---|
| 1680 | unsigned int file_sectors = 0; |
---|
| 1681 | |
---|
| 1682 | if( (fd_id < GIET_OPEN_FILES_MAX) ) |
---|
| 1683 | { |
---|
[530] | 1684 | file_size = _fat.fd[fd_id].file_size; |
---|
[260] | 1685 | |
---|
| 1686 | if ( file_size & 0x1FF ) file_sectors = (file_size >> 9) + 1; |
---|
| 1687 | else file_sectors = (file_size >> 9); |
---|
| 1688 | |
---|
| 1689 | return file_sectors; |
---|
| 1690 | } |
---|
| 1691 | else |
---|
| 1692 | { |
---|
[503] | 1693 | _printf("\n[FAT ERROR] in _fat_fstat() : illegal file descriptor index\n"); |
---|
[260] | 1694 | return -1; |
---|
| 1695 | } |
---|
| 1696 | } // end _fat_fstat() |
---|
| 1697 | |
---|
| 1698 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1699 | // Close the file identified by the file_descriptor index. |
---|
| 1700 | ///////////////////////////////////////////////////////////////////////////////// |
---|
| 1701 | // Returns 0 on success, -1 on failure. |
---|
| 1702 | ///////////////////////////////////////////////////////////////////////////////// |
---|
| 1703 | int _fat_close( unsigned int fd_id ) |
---|
| 1704 | { |
---|
| 1705 | if( (fd_id < GIET_OPEN_FILES_MAX) ) |
---|
| 1706 | { |
---|
[530] | 1707 | _fat.fd[fd_id].used = 0; |
---|
[258] | 1708 | return 0; |
---|
| 1709 | } |
---|
| 1710 | else |
---|
| 1711 | { |
---|
[503] | 1712 | _printf("\n[FAT ERROR] in _fat_close() : illegal file descriptor index\n"); |
---|
[258] | 1713 | return -1; |
---|
| 1714 | } |
---|
| 1715 | } // end fat_close() |
---|
| 1716 | |
---|
[530] | 1717 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1718 | // The following function implement the user_level system call. |
---|
[417] | 1719 | // The flags argument is not used, as file access modes are not implemented yet. |
---|
[530] | 1720 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1721 | // Return the file descriptor index if success / return -1 if failure |
---|
[530] | 1722 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1723 | int _fat_user_open( char* pathname, // absolute pathname from root |
---|
| 1724 | unsigned int flags ) // unused: TODO |
---|
| 1725 | { |
---|
[530] | 1726 | return _fat_open( 1, // use descheduling mode if possible |
---|
| 1727 | pathname, |
---|
| 1728 | 0 ); // no creation if not found |
---|
[258] | 1729 | } |
---|
| 1730 | |
---|
[530] | 1731 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1732 | // The following function implement the user_level system call. |
---|
[530] | 1733 | // This function should be modified to respect the UNIX specification. |
---|
| 1734 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1735 | // Return number of sectors actually transfered if success / return -1 if failure |
---|
[530] | 1736 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1737 | int _fat_user_read( unsigned int fd, // file descriptor index |
---|
| 1738 | void* buffer, // destination buffer |
---|
| 1739 | unsigned int count, // number of sectors to read |
---|
| 1740 | unsigned int offset ) // number of sectors to skip |
---|
| 1741 | { |
---|
[530] | 1742 | return _fat_read( 1, // use descheduling mode if possible |
---|
[258] | 1743 | fd, |
---|
| 1744 | buffer, |
---|
| 1745 | count, |
---|
| 1746 | offset ); |
---|
| 1747 | } |
---|
| 1748 | |
---|
[530] | 1749 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1750 | // The following function implement the user_level system call. |
---|
| 1751 | // This function should be modified to respect the UNIX specification. |
---|
[530] | 1752 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1753 | // Return number of sectors actually transfered if success / return -1 if failure |
---|
[530] | 1754 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1755 | int _fat_user_write( unsigned int fd, // file descriptor |
---|
| 1756 | void* buffer, // source buffer |
---|
| 1757 | unsigned int count, // number of sectors to write |
---|
| 1758 | unsigned int offset ) // number of sectors to skip on file |
---|
| 1759 | { |
---|
[530] | 1760 | return _fat_write( 1, // use descheduling mode if possible |
---|
[258] | 1761 | fd, |
---|
| 1762 | buffer, |
---|
| 1763 | count, |
---|
| 1764 | offset ); |
---|
| 1765 | } |
---|
| 1766 | |
---|
[530] | 1767 | ///////////////////////////////////////////////////////////////////////////////// |
---|
[258] | 1768 | int _fat_user_lseek( unsigned int fd_id, |
---|
| 1769 | unsigned int offset, |
---|
| 1770 | unsigned int whence ) |
---|
| 1771 | { |
---|
[503] | 1772 | _printf("\n[GIET ERROR] _fat_user_lseek() not implemented\n"); |
---|
[258] | 1773 | _exit(); |
---|
| 1774 | return 0; |
---|
| 1775 | } |
---|
| 1776 | |
---|
| 1777 | |
---|
| 1778 | // Local Variables: |
---|
| 1779 | // tab-width: 4 |
---|
| 1780 | // c-basic-offset: 4 |
---|
| 1781 | // c-file-offsets:((innamespace . 0)(inline-open . 0)) |
---|
| 1782 | // indent-tabs-mode: nil |
---|
| 1783 | // End: |
---|
| 1784 | // vim: filetype=c:expandtab:shiftwidth=4:tabstop=4:softtabstop=4 |
---|
| 1785 | |
---|