Strona główna Odkrywaj Pomoc
Zarejestruj się Zaloguj się
stm32
/
armfly
2
0
Forkuj 0
Pliki Problemy 0 Oczekujące zmiany 0 Wiki
Drzewo: ae50c8c1a2
Gałęzie Tagi
armfly
/
Third_Party
/
FATFS
/
doc
/
en
/
appnote.html

appnote.html 28 KB
Historia Czysty

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275 
  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
    2. 

  2. <html lang="en">
    3. 

  3. <head>
    4. 

  4. <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
    5. 

  5. <meta http-equiv="Content-Style-Type" content="text/css">
    6. 

  6. <link rel="up" title="FatFs" href="../00index_e.html">
    7. 

  7. <link rel="alternate" hreflang="ja" title="Japanese" href="../ja/appnote.html">
    8. 

  8. <link rel="stylesheet" href="../css_e.css" type="text/css" media="screen" title="ELM Default">
    9. 

  9. <title>FatFs Module Application Note</title>
    10. 

  10. </head>
    11. 

  11. 

  12. <body>
    13. 

  13. <h1>FatFs Module Application Note</h1>
    14. 

  14. <ol class="toc">
    15. 

  15. <li><a href="#port">How to Port</a></li>
    16. 

  16. <li><a href="#limits">Limits</a></li>
    17. 

  17. <li><a href="#memory">Memory Usage</a></li>
    18. 

  18. <li><a href="#reduce">Module Size Reduction</a></li>
    19. 

  19. <li><a href="#lfn">Long File Name</a></li>
    20. 

  20. <li><a href="#unicode">Unicode API</a></li>
    21. 

  21. <li><a href="#reentrant">Re-entrancy</a></li>
    22. 

  22. <li><a href="#dup">Duplicated File Access</a></li>
    23. 

  23. <li><a href="#fs1">Performance Effective File Access</a></li>
    24. 

  24. <li><a href="#fs2">Considerations on Flash Memory Media</a></li>
    25. 

  25. <li><a href="#critical">Critical Section</a></li>
    26. 

  26. <li><a href="#fs3">Extended Use of FatFs API</a></li>
    27. 

  27. <li><a href="#license">About FatFs License</a></li>
    28. 

  28. </ol>
    29. 

  29. <hr>
    30. 

  30. 

  31. <div class="para" id="port">
    32. 

  32. <h3>How to Port</h3>
    33. 

  33. 

  34. <h4>Basic considerations</h4>
    35. 

  35. <p>The FatFs module is assuming following conditions on portability.</p>
    36. 

  36. <ul>
    37. 

  37. <li>ANSI C<br>
    38. 

  38. The FatFs module is a middleware written in ANSI C (C89). There is no platform dependence, so long as the compiler is in compliance with ANSI C.</li>
    39. 

  39. <li>Size of integer types<br>
    40. 

  40. The FatFs module assumes that size of char/short/long are 8/16/32 bit and int is 16 or 32 bit. These correspondence are defined in <tt>integer.h</tt>. This will not be a problem on most compilers. When any conflict with existing definitions is occured, you must resolve it with care.</li>
    41. 

  41. </ul>
    42. 

  42. 

  43. <h4>System organizations</h4>
    44. 

  44. <p>The dependency diagram shown below is a typical configuration of the embedded system with FatFs module.</p>
    45. 

  45. <p><img src="../img/modules.png" width="580" height="280" alt="dependency diagram"></p>
    46. 

  46. <p>(a) If a working disk module with FatFs API is provided, no additional function is needed. (b) To attach existing disk drivers with different API, glue functions are needed to translate the APIs between FatFs and the drivers.</p>
    47. 

  47. <p><img src="../img/funcs.png" width="680" height="430" alt="functional diagram"></p>
    48. 

  48. 

  49. <h4>Which function is required?</h4>
    50. 

  50. <p>You need to provide only low level disk I/O functions that required by FatFs module and nothing else. If a working disk module for the target is already existing, you need to write only glue functions to attach it to the FatFs module. If not, you need to port any other disk module or write it from scratch. Most of defined functions are not that always required. For example, disk write function is not required in read-only configuration. Following table shows which function is required depends on configuration options.</p>
    51. 

  51. <table class="lst2">
    52. 

  52. <tr><th>Function</th><th>Required when:</th><th>Note</th></tr>
    53. 

  53. <tr><td>disk_status<br>disk_initialize<br>disk_read</td><td>Always</td><td rowspan="5">Disk I/O functions.<br>Samples available in ffsample.zip.<br>There are many implementations on the web.</td></tr>
    54. 

  54. <tr><td>disk_write<br>get_fattime<br>disk_ioctl (CTRL_SYNC)</td><td>_FS_READONLY == 0</td></tr>
    55. 

  55. <tr><td>disk_ioctl (GET_SECTOR_COUNT)<br>disk_ioctl (GET_BLOCK_SIZE)</td><td>_USE_MKFS == 1</td></tr>
    56. 

  56. <tr><td>disk_ioctl (GET_SECTOR_SIZE)</td><td>_MAX_SS != _MIN_SS</td></tr>
    57. 

  57. <tr><td>disk_ioctl (CTRL_TRIM)</td><td>_USE_TRIM == 1</td></tr>
    58. 

  58. <tr><td>ff_convert<br>ff_wtoupper</td><td>_USE_LFN &gt;= 1</td><td>Unicode support functions.<br>Available in option/unicode.c.</td></tr>
    59. 

  59. <tr><td>ff_cre_syncobj<br>ff_del_syncobj<br>ff_req_grant<br>ff_rel_grant</td><td>_FS_REENTRANT == 1</td><td rowspan="2">O/S dependent functions.<br>Samples available in option/syscall.c.</td></tr>
    60. 

  60. <tr><td>ff_mem_alloc<br>ff_mem_free</td><td>_USE_LFN == 3</td></tr>
    61. 

  61. </table>
    62. 

  62. </div>
    63. 

  63. 

  64. <div class="para" id="limits">
    65. 

  65. <h3>Limits</h3>
    66. 

  66. <ul>
    67. 

  67. <li>FAT sub-types: FAT12, FAT16 and FAT32.</li>
    68. 

  68. <li>Number of open files: Unlimited, depends on available memory.</li>
    69. 

  69. <li>Number of volumes: Upto 10.</li>
    70. 

  70. <li>File size: Depends on the FAT specs. (upto 4G-1 bytes)</li>
    71. 

  71. <li>Volume size: Depends on the FAT specs. (upto 2T bytes at 512 bytes/sector)</li>
    72. 

  72. <li>Cluster size: Depends on the FAT specs. (upto 64K bytes at 512 bytes/sector)</li>
    73. 

  73. <li>Sector size: Depends on the FAT specs. (512, 1024, 2048 and 4096 bytes)</li>
    74. 

  74. </ul>
    75. 

  75. </div>
    76. 

  76. 

  77. <div class="para" id="memory">
    78. 

  78. <h3>Memory Usage</h3>
    79. 

  79. <table class="lst2">
    80. 

  80. <tr><th></th><th>ARM7<small><br>32bit</small></th><th>ARM7<small><br>Thumb</small></th><th>CM3<small><br>Thumb-2</small></th><th>AVR</th><th>H8/300H</th><th>PIC24</th><th>RL78</th><th>V850ES</th><th>SH-2A</th><th>RX600</th><th>IA-32</th></tr>
    81. 

  81. <tr class="cal">     <td>Compiler</td><td>GCC</td><td>GCC</td><td>GCC</td><td>GCC</td><td>CH38</td><td>C30</td><td>CC78K0R</td><td>CA850</td><td>SHC</td><td>RXC</td><td>VC6</td></tr>
    82. 

  82. <tr class="cal">     <td>_WORD_ACCESS</td><td>0</td><td>0</td><td>0</td><td>1</td><td>0</td><td>0</td><td>0</td><td>1</td><td>0</td><td>1</td><td>1</td></tr>
    83. 

  83. <!--                                                          ARM           Thumb        CM3          AVR           H8            PIC24         RL78          V850ES       SH-2A        RX600        IA-32   -->
    84. 

  84. <tr class="lst3 ral"><td class="cal">text (Full, R/W)</td><td>10675</td><td>7171</td><td>6617</td><td>13355</td><td>10940</td><td>11722</td><td>13262</td><td>8113</td><td>9048</td><td>6032</td><td>7952</td></tr>
    85. 

  85. <tr class="ral">     <td class="cal">text (Min, R/W)</td>  <td>6727</td><td>4631</td><td>4331</td> <td>8569</td> <td>7262</td> <td>7720</td> <td>9088</td><td>5287</td><td>5800</td><td>3948</td><td>5183</td></tr>
    86. 

  86. <tr class="ral">     <td class="cal">text (Full, R/O)</td> <td>4731</td><td>3147</td><td>2889</td> <td>6235</td> <td>5170</td> <td>5497</td> <td>6482</td><td>3833</td><td>3972</td><td>2862</td><td>3719</td></tr>
    87. 

  87. <tr class="ral">     <td class="cal">text (Min, R/O)</td>  <td>3559</td><td>2485</td><td>2295</td> <td>4575</td> <td>4064</td> <td>4240</td> <td>5019</td><td>2993</td><td>3104</td><td>2214</td><td>2889</td></tr>
    88. 

  88. <tr class="ral">     <td class="cal">bss</td><td>V*4 + 2</td><td>V*4 + 2</td><td>V*4 + 2</td><td>V*2 + 2</td><td>V*4 + 2</td><td>V*2 + 2</td><td>V*2 + 2</td><td>V*4 + 2</td><td>V*4 + 2</td><td>V*4 + 2</td><td>V*4 + 2</td></tr>
    89. 

  89. <tr class="ral">     <td class="cal">Work area<br>(_FS_TINY == 0)</td><td>V*560<br>+ F*550</td><td>V*560<br>+ F*550</td><td>V*560<br>+ F*550</td><td>V*560<br>+ F*544</td><td>V*560<br>+ F*550</td><td>V*560<br>+ F*544</td><td>V*560<br>+ F*544</td><td>V*560<br>+ F*544</td><td>V*560<br>+ F*550</td><td>V*560<br>+ F*550</td><td>V*560<br>+ F*550</td></tr>
    90. 

  90. <tr class="ral">     <td class="cal">Work area<br>(_FS_TINY == 1)</td><td>V*560<br>+ F*36</td><td>V*560<br>+ F*36</td><td>V*560<br>+ F*36</td><td>V*560<br>+ F*32</td><td>V*560<br>+ F*36</td><td>V*560<br>+ F*32</td><td>V*560<br>+ F*32</td><td>V*560<br>+ F*36</td><td>V*560<br>+ F*36</td><td>V*560<br>+ F*36</td><td>V*560<br>+ F*36</td></tr>
    91. 

  91. </table>
    92. 

  92. <p>These are the memory usage on some target systems with following condition. The memory sizes are in unit of byte, <em>V</em> denotes number of volumes and <em>F</em> denotes number of open files. All samples are optimezed in code size.</p>
    93. 

  93. <pre>
    94. 

  94. FatFs R0.10a options:
    95. 

  95. _FS_READONLY     0 (R/W) or 1 (R/O)
    96. 

  96. _FS_MINIMIZE     0 (Full function) or 3 (Minimized function)
    97. 

  97. _USE_STRFUNC     0 (Disable string functions)
    98. 

  98. _USE_MKFS        0 (Disable f_mkfs function)
    99. 

  99. _USE_FORWARD     0 (Disable f_forward function)
    100. 

  100. _USE_FASTSEEK    0 (Disable fast seek feature)
    101. 

  101. _CODE_PAGE       932 (Japanese Shift-JIS)
    102. 

  102. _USE_LFN         0 (Disable LFN feature)
    103. 

  103. _MAX_SS          512 (Fixed sector size)
    104. 

  104. _FS_RPATH        0 (Disable relative path feature)
    105. 

  105. _FS_LABEL        0 (Disable volume label functions)
    106. 

  106. _VOLUMES         V (Number of logical drives to be used)
    107. 

  107. _MULTI_PARTITION 0 (Single partition per drive)
    108. 

  108. _FS_REENTRANT    0 (Disable thread safe)
    109. 

  109. _FS_LOCK         0 (Disable file lock control)
    110. 

  110. </pre>
    111. 

  111. </div>
    112. 

  112. 

  113. <div class="para" id="reduce">
    114. 

  114. <h3>Module Size Reduction</h3>
    115. 

  115. <p>Follwing table shows which API function is removed by configuration options for the module size reduction.</p>
    116. 

  116. <table class="lst2">
    117. 

  117. <tr><td rowspan="2">Function</td><td colspan="4">_FS_MINIMIZE</td><td colspan="2">_FS_READONLY</td><td colspan="2">_USE_STRFUNC</td><td colspan="3">_FS_RPATH</td><td colspan="2">_FS_LABEL</td><td colspan="2">_USE_MKFS</td><td colspan="2">_USE_FORWARD</td><td colspan="2">_MULTI_PARTITION</td></tr>
    118. 

  118. <tr><td>0</td><td>1</td><td>2</td><td>3</td><td>0</td><td>1</td><td>0&nbsp;&nbsp;</td><td>1/2</td><td>0</td><td>1</td><td>2</td><td>0</td><td>1</td><td>0</td><td>1</td><td>0</td><td>1</td><td>0</td><td>1</td></tr>
    119. 

  119. <tr class="lst3"><td>f_mount</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    120. 

  120. <tr><td>f_open</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    121. 

  121. <tr><td>f_close</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    122. 

  122. <tr><td>f_read</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    123. 

  123. <tr><td>f_write</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    124. 

  124. <tr><td>f_sync</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    125. 

  125. <tr><td>f_lseek</td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    126. 

  126. <tr><td>f_opendir</td><td></td><td></td><td>x</td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    127. 

  127. <tr><td>f_closedir</td><td></td><td></td><td>x</td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    128. 

  128. <tr><td>f_readdir</td><td></td><td></td><td>x</td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    129. 

  129. <tr><td>f_stat</td><td></td><td>x</td><td>x</td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    130. 

  130. <tr><td>f_getfree</td><td></td><td>x</td><td>x</td><td>x</td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    131. 

  131. <tr><td>f_truncate</td><td></td><td>x</td><td>x</td><td>x</td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    132. 

  132. <tr><td>f_unlink</td><td></td><td>x</td><td>x</td><td>x</td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    133. 

  133. <tr><td>f_mkdir</td><td></td><td>x</td><td>x</td><td>x</td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    134. 

  134. <tr><td>f_chmod</td><td></td><td>x</td><td>x</td><td>x</td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    135. 

  135. <tr><td>f_utime</td><td></td><td>x</td><td>x</td><td>x</td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    136. 

  136. <tr><td>f_rename</td><td></td><td>x</td><td>x</td><td>x</td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    137. 

  137. <tr><td>f_chdir</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    138. 

  138. <tr><td>f_chdrive</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    139. 

  139. <tr><td>f_getcwd</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>x</td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    140. 

  140. <tr><td>f_getlabel</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    141. 

  141. <tr><td>f_setlabel</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    142. 

  142. <tr><td>f_forward</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td></tr>
    143. 

  143. <tr><td>f_mkfs</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td></tr>
    144. 

  144. <tr><td>f_fdisk</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td>x</td><td></td></tr>
    145. 

  145. <tr><td>f_putc</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    146. 

  146. <tr><td>f_puts</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    147. 

  147. <tr><td>f_printf</td><td></td><td></td><td></td><td></td><td></td><td>x</td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    148. 

  148. <tr><td>f_gets</td><td></td><td></td><td></td><td></td><td></td><td></td><td>x</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr>
    149. 

  149. </table>
    150. 

  150. </div>
    151. 

  151. 

  152. <div class="para" id="lfn">
    153. 

  153. <h3>Long File Name</h3>
    154. 

  154. <p>FatFs module supports LFN (long file name). The two different file names, SFN (short file name) and LFN, of a file is transparent on the API except for <tt>f_readdir()</tt> function. The LFN feature is disabled by default. To enable it, set <tt>_USE_LFN</tt> to 1, 2 or 3, and add <tt>option/unicode.c</tt> to the project. The LFN feature requiers a certain working buffer in addition. The buffer size can be configured by <tt>_MAX_LFN</tt> according to the available memory. The length of an LFN will reach up to 255 characters, so that the <tt>_MAX_LFN</tt> should be set to 255 for full featured LFN operation. If the size of working buffer is insufficient for the input file name, the file function fails with <tt>FR_INVALID_NAME</tt>. When enable the LFN feature with re-entrant configuration, <tt>_USE_LFN</tt> must be set to 2 or 3. In this case, the file function allocates the working buffer on the stack or heap. The working buffer occupies <tt>(_MAX_LFN + 1) * 2</tt> bytes.</p>
    155. 

  155. <table class="lst2 rset">
    156. 

  156. <caption>LFN cfg on ARM7TDMI</caption>
    157. 

  157. <tr><th>Code page</th><th>Program size</th></tr>
    158. 

  158. <tr><td>SBCS</td><td>+3.7K</td></tr>
    159. 

  159. <tr><td>932(Shift-JIS)</td><td>+62K</td></tr>
    160. 

  160. <tr><td>936(GBK)</td><td>+177K</td></tr>
    161. 

  161. <tr><td>949(Korean)</td><td>+139K</td></tr>
    162. 

  162. <tr><td>950(Big5)</td><td>+111K</td></tr>
    163. 

  163. </table>
    164. 

  164. <p>When the LFN feature is enabled, the module size will be increased depends on the selected code page. Right table shows how many bytes increased when LFN feature is enabled with some code pages. Especially, in the CJK region, tens of thousands of characters are being used. Unfortunately, it requires a huge OEM-Unicode bidirectional conversion table and the module size will be drastically increased that shown in the table. As the result, the FatFs with LFN feature with those code pages will not able to be implemented to most 8-bit microcontrollers.</p>
    165. 

  165. <p>Note that the LFN feature on the FAT file system is a patent of Microsoft Corporation. This is not the case on FAT32 but most FAT32 drivers come with the LFN feature. FatFs can swich the LFN feature off by configuration option. When enable LFN feature on the commercial products, a license from Microsoft may be required depends on the final destination.</p>
    166. 

  166. </div>
    167. 

  167. 

  168. <div class="para" id="unicode">
    169. 

  169. <h3>Unicode API</h3>
    170. 

  170. <p>By default, FatFs uses ANSI/OEM code set on the API under LFN configuration. FatFs can also switch the character encoding to Unicode on the API by <tt>_LFN_UNICODE</tt> option. This means that the FatFs supports the True-LFN feature. For more information, refer to the description in the <a href="filename.html">file name</a>.</p>
    171. 

  171. </div>
    172. 

  172. 

  173. <div class="para" id="reentrant">
    174. 

  174. <h3>Re-entrancy</h3>
    175. 

  175. <p>The file operations to the different volume is always re-entrant and can work simultaneously. The file operations to the same volume is not re-entrant but it can also be configured to thread-safe by <tt>_FS_REENTRANT</tt> option. In this case, also the OS dependent synchronization object control functions, <tt>ff_cre_syncobj(), ff_del_syncobj(), ff_req_grant() and ff_rel_grant()</tt> must be added to the project. There are some examples in the <tt>option/syscall.c</tt>.</p>
    176. 

  176. <p>When a file function is called while the volume is in use by any other task, the file function is suspended until that task leaves the file function. If wait time exceeded a period defined by <tt>_TIMEOUT</tt>, the file function will abort with <tt>FR_TIMEOUT</tt>. The timeout feature might not be supported by some RTOS.</p>
    177. 

  177. <p>There is an exception for <tt>f_mount(), f_mkfs(), f_fdisk()</tt> function. These functions are not re-entrant to the same volume or corresponding physical drive. When use these functions, all other tasks must unmount the volume and avoid to access the volume.</p>
    178. 

  178. <p>Note that this section describes on the re-entrancy of the FatFs module itself but also the low level disk I/O layer will need to be re-entrant.</p>
    179. 

  179. </div>
    180. 

  180. 

  181. <div class="para" id="dup">
    182. 

  182. <h3>Duplicated File Access</h3>
    183. 

  183. <p>FatFs module does not support the read/write collision control of duplicated open to a file. The duplicated open is permitted only when each of open method to a file is read mode. The duplicated open with one or more write mode to a file is always prohibited, and also open file must not be renamed and deleted. A violation of these rules can cause data colluption.</p>
    184. 

  184. <p>The file lock control can be enabled by <tt>_FS_LOCK</tt> option. The value of option defines the number of open objects to manage simultaneously. In this case, if any open, rename or remove that violating the file shareing rule that described above is attempted, the file function will fail with <tt>FR_LOCKED</tt>. If number of open objects, files and sub-directories, is equal to <tt>_FS_LOCK</tt>, an extra <tt>f_open(), f_optndir()</tt> function will fail with <tt>FR_TOO_MANY_OPEN_FILES</tt>.</p>
    185. 

  185. </div>
    186. 

  186. 

  187. <div class="para" id="fs1">
    188. 

  188. <h3>Performance Effective File Access</h3>
    189. 

  189. <p>For good read/write throughput on the small embedded systems with limited size of memory, application programmer should consider what process is done in the FatFs module. The file data on the volume is transferred in following sequence by <tt>f_read()</tt> function.</p>
    190. 

  190. <p>Figure 1. Sector misaligned read (short)<br>
    191. 

  191. <img src="../img/f1.png" width="490" height="110" alt="">
    192. 

  192. </p>
    193. 

  193. <p>Figure 2. Sector misaligned read (long)<br>
    194. 

  194. <img src="../img/f2.png" width="490" height="140" alt="">
    195. 

  195. </p>
    196. 

  196. <p>Figure 3. Fully sector aligned read<br>
    197. 

  197. <img src="../img/f3.png" width="490" height="119" alt="">
    198. 

  198. </p>
    199. 

  199. <p>The file I/O buffer is a sector buffer to read/write a partial data on the sector. The sector buffer is either file private sector buffer on each file object or shared sector buffer in the file system object. The buffer configuration option <tt>_FS_TINY</tt> determins which sector buffer is used for the file data transfer. When tiny buffer configuration (1) is selected, data memory consumption is reduced <tt>_MAX_SS</tt> bytes each file object. In this case, FatFs module uses only a sector buffer in the file system object for file data transfer and FAT/directory access. The disadvantage of the tiny buffer configuration is: the FAT data cached in the sector buffer will be lost by file data transfer and it must be reloaded at every cluster boundary. However it will be suitable for most application from view point of the decent performance and low memory comsumption.</p>
    200. 

  200. <p>Figure 1 shows that a partial sector, sector misaligned part of the file, is transferred via the file I/O buffer. At long data transfer shown in Figure 2, middle of transfer data that covers one or more sector is transferred to the application buffer directly. Figure 3 shows that the case of entier transfer data is aligned to the sector boundary. In this case, file I/O buffer is not used. On the direct transfer, the maximum extent of sectors are read with <tt>disk_read()</tt> function at a time but the multiple sector transfer is divided at cluster boundary even if it is contiguous.</p>
    201. 

  201. <p>Therefore taking effort to sector aligned read/write accesss eliminates buffered data transfer and the read/write performance will be improved. Besides the effect, cached FAT data will not be flushed by file data transfer at the tiny configuration, so that it can achieve same performance as non-tiny configuration with small memory footprint.</p>
    202. 

  202. </div>
    203. 

  203. 

  204. <div class="para" id="fs2">
    205. 

  205. <h3>Considerations on Flash Memory Media</h3>
    206. 

  206. <p>To maximize the write performance of flash memory media, such as SDC, CFC and U Disk, it must be controlled in consideration of its characteristitcs.</p>
    207. 

  207. <h4>Using Mutiple-Sector Write</h4>
    208. 

  208. <div class="rset">
    209. 

  209. Figure 6. Comparison between Multiple/Single Sector Write<br>
    210. 

  210. <img src="../img/f6.png" width="630" height="148" alt="fig.6">
    211. 

  211. </div>
    212. 

  212. <p>The write throughput of the flash memory media becomes the worst at single sector write transaction. The write throughput increases as the number of sectors per a write transaction. This effect more appers at faster interface speed and the performance ratio often becomes grater than ten. <a href="../img/rwtest2.png">This graph</a> is clearly explaining how fast is multiple block write (W:16K, 32 sectors) than single block write (W:100, 1 sector), and also larger card tends to be slow at single block write. The number of write transactions also affects the life time of the flash memory media. Therefore the application program should write the data in large block as possible. The ideal write chunk size and alighment is size of sector, and size of cluster is the best. Of course all layers between the application and the storage device must have consideration on multiple sector write, however most of open-source disk drivers lack it. Do not split a multiple sector write request into single sector write transactions or the write throughput gets poor. Note that FatFs module and its sample disk drivers supprt multiple sector read/write feature. </p>
    213. 

  213. <h4>Forcing Memory Erase</h4>
    214. 

  214. <p>When remove a file with <tt>f_remove()</tt> function, the data clusters occupied by the file are marked 'free' on the FAT. But the data sectors containing the file data are not that applied any process, so that the file data left occupies a part of the flash memory array as 'live block'. If the file data is forced erased on removing the file, those data blocks will be turned in to the free block pool. This may skip internal block erase operation to the data block on next write operation. As the result the write performance might be improved. FatFs can manage this feature by setting <tt>_USE_ERASE</tt> to 1. Note that this is an expectation of internal process of the flash memory storage and not that always effective. Also <tt>f_remove()</tt> function will take a time when remove a large file. Most applications will not need this feature.</p>
    215. 

  215. </div>
    216. 

  216. 

  217. <div class="para" id="critical">
    218. 

  218. <h3>Critical Section</h3>
    219. 

  219. <p>If a write operation to the FAT volume is interrupted due to any accidental failure, such as sudden blackout, incorrect disk removal and unrecoverable disk error, the FAT structure on the volume can be broken. Following images shows the critical section of the FatFs module.</p>
    220. 

  220. <div class="lset">
    221. 

  221. Figure 4. Long critical section<br>
    222. 

  222. <img src="../img/f4.png" width="320" height="436" alt="fig.4">
    223. 

  223. </div>
    224. 

  224. <div class="lset">
    225. 

  225. Figure 5. Minimized critical section<br>
    226. 

  226. <img src="../img/f5.png" width="320" height="436" alt="fig.5">
    227. 

  227. </div>
    228. 

  228. <br class="clr">
    229. 

  229. <p>An interruption in the red section can cause a cross link; as a result, the object being changed can be lost. If an interruption in the yellow section is occured, there is one or more possibility listed below.</p>
    230. 

  230. <ul>
    231. 

  231. <li>The file data being rewrited is collapsed.</li>
    232. 

  232. <li>The file being appended returns initial state.</li>
    233. 

  233. <li>The file created as new is gone.</li>
    234. 

  234. <li>The file created as new or overwritten remains but no content.</li>
    235. 

  235. <li>Efficiency of disk use gets worse due to lost clusters.</li>
    236. 

  236. </ul>
    237. 

  237. <p>Each case does not affect the files that not opened in write mode. To minimize risk of data loss, the critical section can be minimized by minimizing the time that file is opened in write mode or using <tt>f_sync()</tt> function as shown in Figure 5.</p>
    238. 

  238. </div>
    239. 

  239. 

  240. <div class="para" id="fs3">
    241. 

  241. <h3>Extended Use of FatFs API</h3>
    242. 

  242. <p>These are examples of extended use of FatFs APIs. New item will be added whenever a useful code is found.</p>
    243. 

  243. <ol>
    244. 

  244. <li><a href="../img/app1.c">Open or create a file for append</a></li>
    245. 

  245. <li><a href="../img/app2.c">Empty a directory</a></li>
    246. 

  246. <li><a href="../img/app3.c">Allocate contiguous area to the file</a></li>
    247. 

  247. <li><a href="../img/app4.c">Function/Compatible checker for low level disk I/O module</a></li>
    248. 

  248. <li><a href="../img/mkfatimg.zip">FAT image creator</a></li>
    249. 

  249. </ol>
    250. 

  250. </div>
    251. 

  251. 

  252. <div class="para" id="license">
    253. 

  253. <h3>About FatFs License</h3>
    254. 

  254. <p>FatFs has being developped as a personal project of author, ChaN. It is free from the code anyone else wrote. Following code block shows a copy of the FatFs license document that included in the source files.</p>
    255. 

  255. <pre>/*----------------------------------------------------------------------------/
    256. 

  256. /  FatFs - FAT file system module  R0.10b                    (C)ChaN, 2014
    257. 

  257. /-----------------------------------------------------------------------------/
    258. 

  258. / FatFs module is a generic FAT file system module for small embedded systems.
    259. 

  259. / This is a free software that opened for education, research and commercial
    260. 

  260. / developments under license policy of following trems.
    261. 

  261. /
    262. 

  262. /  Copyright (C) 2014, ChaN, all right reserved.
    263. 

  263. /
    264. 

  264. / * The FatFs module is a free software and there is NO WARRANTY.
    265. 

  265. / * No restriction on use. You can use, modify and redistribute it for
    266. 

  266. /   personal, non-profit or commercial products UNDER YOUR RESPONSIBILITY.
    267. 

  267. / * Redistributions of source code must retain the above copyright notice.
    268. 

  268. /
    269. 

  269. /-----------------------------------------------------------------------------/</pre>
    270. 

  270. <p>Therefore FatFs license is one of the BSD-style licenses but there is a significant feature. Because FatFs is for embedded projects, the conditions of redistributions in binary form, such as embedded code, hex file, binary library or any forms without source code, are not specified in order to extend usability for commercial products. The documentation of the distributions need not include about FatFs and its license document, and it may also. This is equivalent to the BSD 1-Clause License. Of course FatFs is compatible with the projects under GNU GPL. When redistribute the FatFs with any modification or branch it as a fork, the license can also be changed to GNU GPL, BSD-style license or any free software licenses that not conflict with FatFs license.</p>
    271. 

  271. </div>
    272. 

  272. 

  273. <p class="foot"><a href="../00index_e.html">Return</a></p>
    274. 

  274. </body>
    275. 

  275. </html>
    276.