namei_vfat.c 26 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109
  1. /*
  2. * linux/fs/vfat/namei.c
  3. *
  4. * Written 1992,1993 by Werner Almesberger
  5. *
  6. * Windows95/Windows NT compatible extended MSDOS filesystem
  7. * by Gordon Chaffee Copyright (C) 1995. Send bug reports for the
  8. * VFAT filesystem to <chaffee@cs.berkeley.edu>. Specify
  9. * what file operation caused you trouble and if you can duplicate
  10. * the problem, send a script that demonstrates it.
  11. *
  12. * Short name translation 1999, 2001 by Wolfram Pienkoss <wp@bszh.de>
  13. *
  14. * Support Multibyte characters and cleanup by
  15. * OGAWA Hirofumi <hirofumi@mail.parknet.co.jp>
  16. */
  17. #include <linux/module.h>
  18. #include <linux/jiffies.h>
  19. #include <linux/ctype.h>
  20. #include <linux/slab.h>
  21. #include <linux/buffer_head.h>
  22. #include <linux/namei.h>
  23. #include "fat.h"
  24. /*
  25. * If new entry was created in the parent, it could create the 8.3
  26. * alias (the shortname of logname). So, the parent may have the
  27. * negative-dentry which matches the created 8.3 alias.
  28. *
  29. * If it happened, the negative dentry isn't actually negative
  30. * anymore. So, drop it.
  31. */
  32. static int vfat_revalidate_shortname(struct dentry *dentry)
  33. {
  34. int ret = 1;
  35. spin_lock(&dentry->d_lock);
  36. if (dentry->d_time != dentry->d_parent->d_inode->i_version)
  37. ret = 0;
  38. spin_unlock(&dentry->d_lock);
  39. return ret;
  40. }
  41. static int vfat_revalidate(struct dentry *dentry, struct nameidata *nd)
  42. {
  43. if (nd && nd->flags & LOOKUP_RCU)
  44. return -ECHILD;
  45. /* This is not negative dentry. Always valid. */
  46. if (dentry->d_inode)
  47. return 1;
  48. return vfat_revalidate_shortname(dentry);
  49. }
  50. static int vfat_revalidate_ci(struct dentry *dentry, struct nameidata *nd)
  51. {
  52. if (nd && nd->flags & LOOKUP_RCU)
  53. return -ECHILD;
  54. /*
  55. * This is not negative dentry. Always valid.
  56. *
  57. * Note, rename() to existing directory entry will have ->d_inode,
  58. * and will use existing name which isn't specified name by user.
  59. *
  60. * We may be able to drop this positive dentry here. But dropping
  61. * positive dentry isn't good idea. So it's unsupported like
  62. * rename("filename", "FILENAME") for now.
  63. */
  64. if (dentry->d_inode)
  65. return 1;
  66. /*
  67. * This may be nfsd (or something), anyway, we can't see the
  68. * intent of this. So, since this can be for creation, drop it.
  69. */
  70. if (!nd)
  71. return 0;
  72. /*
  73. * Drop the negative dentry, in order to make sure to use the
  74. * case sensitive name which is specified by user if this is
  75. * for creation.
  76. */
  77. if (nd->flags & (LOOKUP_CREATE | LOOKUP_RENAME_TARGET))
  78. return 0;
  79. return vfat_revalidate_shortname(dentry);
  80. }
  81. /* returns the length of a struct qstr, ignoring trailing dots */
  82. static unsigned int __vfat_striptail_len(unsigned int len, const char *name)
  83. {
  84. while (len && name[len - 1] == '.')
  85. len--;
  86. return len;
  87. }
  88. static unsigned int vfat_striptail_len(const struct qstr *qstr)
  89. {
  90. return __vfat_striptail_len(qstr->len, qstr->name);
  91. }
  92. /*
  93. * Compute the hash for the vfat name corresponding to the dentry.
  94. * Note: if the name is invalid, we leave the hash code unchanged so
  95. * that the existing dentry can be used. The vfat fs routines will
  96. * return ENOENT or EINVAL as appropriate.
  97. */
  98. static int vfat_hash(const struct dentry *dentry, const struct inode *inode,
  99. struct qstr *qstr)
  100. {
  101. qstr->hash = full_name_hash(qstr->name, vfat_striptail_len(qstr));
  102. return 0;
  103. }
  104. /*
  105. * Compute the hash for the vfat name corresponding to the dentry.
  106. * Note: if the name is invalid, we leave the hash code unchanged so
  107. * that the existing dentry can be used. The vfat fs routines will
  108. * return ENOENT or EINVAL as appropriate.
  109. */
  110. static int vfat_hashi(const struct dentry *dentry, const struct inode *inode,
  111. struct qstr *qstr)
  112. {
  113. struct nls_table *t = MSDOS_SB(dentry->d_sb)->nls_io;
  114. const unsigned char *name;
  115. unsigned int len;
  116. unsigned long hash;
  117. name = qstr->name;
  118. len = vfat_striptail_len(qstr);
  119. hash = init_name_hash();
  120. while (len--)
  121. hash = partial_name_hash(nls_tolower(t, *name++), hash);
  122. qstr->hash = end_name_hash(hash);
  123. return 0;
  124. }
  125. /*
  126. * Case insensitive compare of two vfat names.
  127. */
  128. static int vfat_cmpi(const struct dentry *parent, const struct inode *pinode,
  129. const struct dentry *dentry, const struct inode *inode,
  130. unsigned int len, const char *str, const struct qstr *name)
  131. {
  132. struct nls_table *t = MSDOS_SB(parent->d_sb)->nls_io;
  133. unsigned int alen, blen;
  134. /* A filename cannot end in '.' or we treat it like it has none */
  135. alen = vfat_striptail_len(name);
  136. blen = __vfat_striptail_len(len, str);
  137. if (alen == blen) {
  138. if (nls_strnicmp(t, name->name, str, alen) == 0)
  139. return 0;
  140. }
  141. return 1;
  142. }
  143. /*
  144. * Case sensitive compare of two vfat names.
  145. */
  146. static int vfat_cmp(const struct dentry *parent, const struct inode *pinode,
  147. const struct dentry *dentry, const struct inode *inode,
  148. unsigned int len, const char *str, const struct qstr *name)
  149. {
  150. unsigned int alen, blen;
  151. /* A filename cannot end in '.' or we treat it like it has none */
  152. alen = vfat_striptail_len(name);
  153. blen = __vfat_striptail_len(len, str);
  154. if (alen == blen) {
  155. if (strncmp(name->name, str, alen) == 0)
  156. return 0;
  157. }
  158. return 1;
  159. }
  160. static const struct dentry_operations vfat_ci_dentry_ops = {
  161. .d_revalidate = vfat_revalidate_ci,
  162. .d_hash = vfat_hashi,
  163. .d_compare = vfat_cmpi,
  164. };
  165. static const struct dentry_operations vfat_dentry_ops = {
  166. .d_revalidate = vfat_revalidate,
  167. .d_hash = vfat_hash,
  168. .d_compare = vfat_cmp,
  169. };
  170. /* Characters that are undesirable in an MS-DOS file name */
  171. static inline wchar_t vfat_bad_char(wchar_t w)
  172. {
  173. return (w < 0x0020)
  174. || (w == '*') || (w == '?') || (w == '<') || (w == '>')
  175. || (w == '|') || (w == '"') || (w == ':') || (w == '/')
  176. || (w == '\\');
  177. }
  178. static inline wchar_t vfat_replace_char(wchar_t w)
  179. {
  180. return (w == '[') || (w == ']') || (w == ';') || (w == ',')
  181. || (w == '+') || (w == '=');
  182. }
  183. static wchar_t vfat_skip_char(wchar_t w)
  184. {
  185. return (w == '.') || (w == ' ');
  186. }
  187. static inline int vfat_is_used_badchars(const wchar_t *s, int len)
  188. {
  189. int i;
  190. for (i = 0; i < len; i++)
  191. if (vfat_bad_char(s[i]))
  192. return -EINVAL;
  193. if (s[i - 1] == ' ') /* last character cannot be space */
  194. return -EINVAL;
  195. return 0;
  196. }
  197. static int vfat_find_form(struct inode *dir, unsigned char *name)
  198. {
  199. struct fat_slot_info sinfo;
  200. int err = fat_scan(dir, name, &sinfo);
  201. if (err)
  202. return -ENOENT;
  203. brelse(sinfo.bh);
  204. return 0;
  205. }
  206. /*
  207. * 1) Valid characters for the 8.3 format alias are any combination of
  208. * letters, uppercase alphabets, digits, any of the
  209. * following special characters:
  210. * $ % ' ` - @ { } ~ ! # ( ) & _ ^
  211. * In this case Longfilename is not stored in disk.
  212. *
  213. * WinNT's Extension:
  214. * File name and extension name is contain uppercase/lowercase
  215. * only. And it is expressed by CASE_LOWER_BASE and CASE_LOWER_EXT.
  216. *
  217. * 2) File name is 8.3 format, but it contain the uppercase and
  218. * lowercase char, muliti bytes char, etc. In this case numtail is not
  219. * added, but Longfilename is stored.
  220. *
  221. * 3) When the one except for the above, or the following special
  222. * character are contained:
  223. * . [ ] ; , + =
  224. * numtail is added, and Longfilename must be stored in disk .
  225. */
  226. struct shortname_info {
  227. unsigned char lower:1,
  228. upper:1,
  229. valid:1;
  230. };
  231. #define INIT_SHORTNAME_INFO(x) do { \
  232. (x)->lower = 1; \
  233. (x)->upper = 1; \
  234. (x)->valid = 1; \
  235. } while (0)
  236. static inline int to_shortname_char(struct nls_table *nls,
  237. unsigned char *buf, int buf_size,
  238. wchar_t *src, struct shortname_info *info)
  239. {
  240. int len;
  241. if (vfat_skip_char(*src)) {
  242. info->valid = 0;
  243. return 0;
  244. }
  245. if (vfat_replace_char(*src)) {
  246. info->valid = 0;
  247. buf[0] = '_';
  248. return 1;
  249. }
  250. len = nls->uni2char(*src, buf, buf_size);
  251. if (len <= 0) {
  252. info->valid = 0;
  253. buf[0] = '_';
  254. len = 1;
  255. } else if (len == 1) {
  256. unsigned char prev = buf[0];
  257. if (buf[0] >= 0x7F) {
  258. info->lower = 0;
  259. info->upper = 0;
  260. }
  261. buf[0] = nls_toupper(nls, buf[0]);
  262. if (isalpha(buf[0])) {
  263. if (buf[0] == prev)
  264. info->lower = 0;
  265. else
  266. info->upper = 0;
  267. }
  268. } else {
  269. info->lower = 0;
  270. info->upper = 0;
  271. }
  272. return len;
  273. }
  274. /*
  275. * Given a valid longname, create a unique shortname. Make sure the
  276. * shortname does not exist
  277. * Returns negative number on error, 0 for a normal
  278. * return, and 1 for valid shortname
  279. */
  280. static int vfat_create_shortname(struct inode *dir, struct nls_table *nls,
  281. wchar_t *uname, int ulen,
  282. unsigned char *name_res, unsigned char *lcase)
  283. {
  284. struct fat_mount_options *opts = &MSDOS_SB(dir->i_sb)->options;
  285. wchar_t *ip, *ext_start, *end, *name_start;
  286. unsigned char base[9], ext[4], buf[5], *p;
  287. unsigned char charbuf[NLS_MAX_CHARSET_SIZE];
  288. int chl, chi;
  289. int sz = 0, extlen, baselen, i, numtail_baselen, numtail2_baselen;
  290. int is_shortname;
  291. struct shortname_info base_info, ext_info;
  292. is_shortname = 1;
  293. INIT_SHORTNAME_INFO(&base_info);
  294. INIT_SHORTNAME_INFO(&ext_info);
  295. /* Now, we need to create a shortname from the long name */
  296. ext_start = end = &uname[ulen];
  297. while (--ext_start >= uname) {
  298. if (*ext_start == 0x002E) { /* is `.' */
  299. if (ext_start == end - 1) {
  300. sz = ulen;
  301. ext_start = NULL;
  302. }
  303. break;
  304. }
  305. }
  306. if (ext_start == uname - 1) {
  307. sz = ulen;
  308. ext_start = NULL;
  309. } else if (ext_start) {
  310. /*
  311. * Names which start with a dot could be just
  312. * an extension eg. "...test". In this case Win95
  313. * uses the extension as the name and sets no extension.
  314. */
  315. name_start = &uname[0];
  316. while (name_start < ext_start) {
  317. if (!vfat_skip_char(*name_start))
  318. break;
  319. name_start++;
  320. }
  321. if (name_start != ext_start) {
  322. sz = ext_start - uname;
  323. ext_start++;
  324. } else {
  325. sz = ulen;
  326. ext_start = NULL;
  327. }
  328. }
  329. numtail_baselen = 6;
  330. numtail2_baselen = 2;
  331. for (baselen = i = 0, p = base, ip = uname; i < sz; i++, ip++) {
  332. chl = to_shortname_char(nls, charbuf, sizeof(charbuf),
  333. ip, &base_info);
  334. if (chl == 0)
  335. continue;
  336. if (baselen < 2 && (baselen + chl) > 2)
  337. numtail2_baselen = baselen;
  338. if (baselen < 6 && (baselen + chl) > 6)
  339. numtail_baselen = baselen;
  340. for (chi = 0; chi < chl; chi++) {
  341. *p++ = charbuf[chi];
  342. baselen++;
  343. if (baselen >= 8)
  344. break;
  345. }
  346. if (baselen >= 8) {
  347. if ((chi < chl - 1) || (ip + 1) - uname < sz)
  348. is_shortname = 0;
  349. break;
  350. }
  351. }
  352. if (baselen == 0) {
  353. return -EINVAL;
  354. }
  355. extlen = 0;
  356. if (ext_start) {
  357. for (p = ext, ip = ext_start; extlen < 3 && ip < end; ip++) {
  358. chl = to_shortname_char(nls, charbuf, sizeof(charbuf),
  359. ip, &ext_info);
  360. if (chl == 0)
  361. continue;
  362. if ((extlen + chl) > 3) {
  363. is_shortname = 0;
  364. break;
  365. }
  366. for (chi = 0; chi < chl; chi++) {
  367. *p++ = charbuf[chi];
  368. extlen++;
  369. }
  370. if (extlen >= 3) {
  371. if (ip + 1 != end)
  372. is_shortname = 0;
  373. break;
  374. }
  375. }
  376. }
  377. ext[extlen] = '\0';
  378. base[baselen] = '\0';
  379. /* Yes, it can happen. ".\xe5" would do it. */
  380. if (base[0] == DELETED_FLAG)
  381. base[0] = 0x05;
  382. /* OK, at this point we know that base is not longer than 8 symbols,
  383. * ext is not longer than 3, base is nonempty, both don't contain
  384. * any bad symbols (lowercase transformed to uppercase).
  385. */
  386. memset(name_res, ' ', MSDOS_NAME);
  387. memcpy(name_res, base, baselen);
  388. memcpy(name_res + 8, ext, extlen);
  389. *lcase = 0;
  390. if (is_shortname && base_info.valid && ext_info.valid) {
  391. if (vfat_find_form(dir, name_res) == 0)
  392. return -EEXIST;
  393. if (opts->shortname & VFAT_SFN_CREATE_WIN95) {
  394. return (base_info.upper && ext_info.upper);
  395. } else if (opts->shortname & VFAT_SFN_CREATE_WINNT) {
  396. if ((base_info.upper || base_info.lower) &&
  397. (ext_info.upper || ext_info.lower)) {
  398. if (!base_info.upper && base_info.lower)
  399. *lcase |= CASE_LOWER_BASE;
  400. if (!ext_info.upper && ext_info.lower)
  401. *lcase |= CASE_LOWER_EXT;
  402. return 1;
  403. }
  404. return 0;
  405. } else {
  406. BUG();
  407. }
  408. }
  409. if (opts->numtail == 0)
  410. if (vfat_find_form(dir, name_res) < 0)
  411. return 0;
  412. /*
  413. * Try to find a unique extension. This used to
  414. * iterate through all possibilities sequentially,
  415. * but that gave extremely bad performance. Windows
  416. * only tries a few cases before using random
  417. * values for part of the base.
  418. */
  419. if (baselen > 6) {
  420. baselen = numtail_baselen;
  421. name_res[7] = ' ';
  422. }
  423. name_res[baselen] = '~';
  424. for (i = 1; i < 10; i++) {
  425. name_res[baselen + 1] = i + '0';
  426. if (vfat_find_form(dir, name_res) < 0)
  427. return 0;
  428. }
  429. i = jiffies;
  430. sz = (jiffies >> 16) & 0x7;
  431. if (baselen > 2) {
  432. baselen = numtail2_baselen;
  433. name_res[7] = ' ';
  434. }
  435. name_res[baselen + 4] = '~';
  436. name_res[baselen + 5] = '1' + sz;
  437. while (1) {
  438. snprintf(buf, sizeof(buf), "%04X", i & 0xffff);
  439. memcpy(&name_res[baselen], buf, 4);
  440. if (vfat_find_form(dir, name_res) < 0)
  441. break;
  442. i -= 11;
  443. }
  444. return 0;
  445. }
  446. /* Translate a string, including coded sequences into Unicode */
  447. static int
  448. xlate_to_uni(const unsigned char *name, int len, unsigned char *outname,
  449. int *longlen, int *outlen, int escape, int utf8,
  450. struct nls_table *nls)
  451. {
  452. const unsigned char *ip;
  453. unsigned char nc;
  454. unsigned char *op;
  455. unsigned int ec;
  456. int i, k, fill;
  457. int charlen;
  458. if (utf8) {
  459. *outlen = utf8s_to_utf16s(name, len, UTF16_HOST_ENDIAN,
  460. (wchar_t *) outname, FAT_LFN_LEN + 2);
  461. if (*outlen < 0)
  462. return *outlen;
  463. else if (*outlen > FAT_LFN_LEN)
  464. return -ENAMETOOLONG;
  465. op = &outname[*outlen * sizeof(wchar_t)];
  466. } else {
  467. if (nls) {
  468. for (i = 0, ip = name, op = outname, *outlen = 0;
  469. i < len && *outlen <= FAT_LFN_LEN;
  470. *outlen += 1)
  471. {
  472. if (escape && (*ip == ':')) {
  473. if (i > len - 5)
  474. return -EINVAL;
  475. ec = 0;
  476. for (k = 1; k < 5; k++) {
  477. nc = ip[k];
  478. ec <<= 4;
  479. if (nc >= '0' && nc <= '9') {
  480. ec |= nc - '0';
  481. continue;
  482. }
  483. if (nc >= 'a' && nc <= 'f') {
  484. ec |= nc - ('a' - 10);
  485. continue;
  486. }
  487. if (nc >= 'A' && nc <= 'F') {
  488. ec |= nc - ('A' - 10);
  489. continue;
  490. }
  491. return -EINVAL;
  492. }
  493. *op++ = ec & 0xFF;
  494. *op++ = ec >> 8;
  495. ip += 5;
  496. i += 5;
  497. } else {
  498. if ((charlen = nls->char2uni(ip, len - i, (wchar_t *)op)) < 0)
  499. return -EINVAL;
  500. ip += charlen;
  501. i += charlen;
  502. op += 2;
  503. }
  504. }
  505. if (i < len)
  506. return -ENAMETOOLONG;
  507. } else {
  508. for (i = 0, ip = name, op = outname, *outlen = 0;
  509. i < len && *outlen <= FAT_LFN_LEN;
  510. i++, *outlen += 1)
  511. {
  512. *op++ = *ip++;
  513. *op++ = 0;
  514. }
  515. if (i < len)
  516. return -ENAMETOOLONG;
  517. }
  518. }
  519. *longlen = *outlen;
  520. if (*outlen % 13) {
  521. *op++ = 0;
  522. *op++ = 0;
  523. *outlen += 1;
  524. if (*outlen % 13) {
  525. fill = 13 - (*outlen % 13);
  526. for (i = 0; i < fill; i++) {
  527. *op++ = 0xff;
  528. *op++ = 0xff;
  529. }
  530. *outlen += fill;
  531. }
  532. }
  533. return 0;
  534. }
  535. static int vfat_build_slots(struct inode *dir, const unsigned char *name,
  536. int len, int is_dir, int cluster,
  537. struct timespec *ts,
  538. struct msdos_dir_slot *slots, int *nr_slots)
  539. {
  540. struct msdos_sb_info *sbi = MSDOS_SB(dir->i_sb);
  541. struct fat_mount_options *opts = &sbi->options;
  542. struct msdos_dir_slot *ps;
  543. struct msdos_dir_entry *de;
  544. unsigned char cksum, lcase;
  545. unsigned char msdos_name[MSDOS_NAME];
  546. wchar_t *uname;
  547. __le16 time, date;
  548. u8 time_cs;
  549. int err, ulen, usize, i;
  550. loff_t offset;
  551. *nr_slots = 0;
  552. uname = __getname();
  553. if (!uname)
  554. return -ENOMEM;
  555. err = xlate_to_uni(name, len, (unsigned char *)uname, &ulen, &usize,
  556. opts->unicode_xlate, opts->utf8, sbi->nls_io);
  557. if (err)
  558. goto out_free;
  559. err = vfat_is_used_badchars(uname, ulen);
  560. if (err)
  561. goto out_free;
  562. err = vfat_create_shortname(dir, sbi->nls_disk, uname, ulen,
  563. msdos_name, &lcase);
  564. if (err < 0)
  565. goto out_free;
  566. else if (err == 1) {
  567. de = (struct msdos_dir_entry *)slots;
  568. err = 0;
  569. goto shortname;
  570. }
  571. /* build the entry of long file name */
  572. cksum = fat_checksum(msdos_name);
  573. *nr_slots = usize / 13;
  574. for (ps = slots, i = *nr_slots; i > 0; i--, ps++) {
  575. ps->id = i;
  576. ps->attr = ATTR_EXT;
  577. ps->reserved = 0;
  578. ps->alias_checksum = cksum;
  579. ps->start = 0;
  580. offset = (i - 1) * 13;
  581. fatwchar_to16(ps->name0_4, uname + offset, 5);
  582. fatwchar_to16(ps->name5_10, uname + offset + 5, 6);
  583. fatwchar_to16(ps->name11_12, uname + offset + 11, 2);
  584. }
  585. slots[0].id |= 0x40;
  586. de = (struct msdos_dir_entry *)ps;
  587. shortname:
  588. /* build the entry of 8.3 alias name */
  589. (*nr_slots)++;
  590. memcpy(de->name, msdos_name, MSDOS_NAME);
  591. de->attr = is_dir ? ATTR_DIR : ATTR_ARCH;
  592. de->lcase = lcase;
  593. fat_time_unix2fat(sbi, ts, &time, &date, &time_cs);
  594. de->time = de->ctime = time;
  595. de->date = de->cdate = de->adate = date;
  596. de->ctime_cs = time_cs;
  597. de->start = cpu_to_le16(cluster);
  598. de->starthi = cpu_to_le16(cluster >> 16);
  599. de->size = 0;
  600. out_free:
  601. __putname(uname);
  602. return err;
  603. }
  604. static int vfat_add_entry(struct inode *dir, struct qstr *qname, int is_dir,
  605. int cluster, struct timespec *ts,
  606. struct fat_slot_info *sinfo)
  607. {
  608. struct msdos_dir_slot *slots;
  609. unsigned int len;
  610. int err, nr_slots;
  611. len = vfat_striptail_len(qname);
  612. if (len == 0)
  613. return -ENOENT;
  614. slots = kmalloc(sizeof(*slots) * MSDOS_SLOTS, GFP_NOFS);
  615. if (slots == NULL)
  616. return -ENOMEM;
  617. err = vfat_build_slots(dir, qname->name, len, is_dir, cluster, ts,
  618. slots, &nr_slots);
  619. if (err)
  620. goto cleanup;
  621. err = fat_add_entries(dir, slots, nr_slots, sinfo);
  622. if (err)
  623. goto cleanup;
  624. /* update timestamp */
  625. dir->i_ctime = dir->i_mtime = dir->i_atime = *ts;
  626. if (IS_DIRSYNC(dir))
  627. (void)fat_sync_inode(dir);
  628. else
  629. mark_inode_dirty(dir);
  630. cleanup:
  631. kfree(slots);
  632. return err;
  633. }
  634. static int vfat_find(struct inode *dir, struct qstr *qname,
  635. struct fat_slot_info *sinfo)
  636. {
  637. unsigned int len = vfat_striptail_len(qname);
  638. if (len == 0)
  639. return -ENOENT;
  640. return fat_search_long(dir, qname->name, len, sinfo);
  641. }
  642. /*
  643. * (nfsd's) anonymous disconnected dentry?
  644. * NOTE: !IS_ROOT() is not anonymous (I.e. d_splice_alias() did the job).
  645. */
  646. static int vfat_d_anon_disconn(struct dentry *dentry)
  647. {
  648. return IS_ROOT(dentry) && (dentry->d_flags & DCACHE_DISCONNECTED);
  649. }
  650. static struct dentry *vfat_lookup(struct inode *dir, struct dentry *dentry,
  651. struct nameidata *nd)
  652. {
  653. struct super_block *sb = dir->i_sb;
  654. struct fat_slot_info sinfo;
  655. struct inode *inode;
  656. struct dentry *alias;
  657. int err;
  658. lock_super(sb);
  659. err = vfat_find(dir, &dentry->d_name, &sinfo);
  660. if (err) {
  661. if (err == -ENOENT) {
  662. inode = NULL;
  663. goto out;
  664. }
  665. goto error;
  666. }
  667. inode = fat_build_inode(sb, sinfo.de, sinfo.i_pos);
  668. brelse(sinfo.bh);
  669. if (IS_ERR(inode)) {
  670. err = PTR_ERR(inode);
  671. goto error;
  672. }
  673. alias = d_find_alias(inode);
  674. if (alias && !vfat_d_anon_disconn(alias)) {
  675. /*
  676. * This inode has non anonymous-DCACHE_DISCONNECTED
  677. * dentry. This means, the user did ->lookup() by an
  678. * another name (longname vs 8.3 alias of it) in past.
  679. *
  680. * Switch to new one for reason of locality if possible.
  681. */
  682. BUG_ON(d_unhashed(alias));
  683. if (!S_ISDIR(inode->i_mode))
  684. d_move(alias, dentry);
  685. iput(inode);
  686. unlock_super(sb);
  687. return alias;
  688. } else
  689. dput(alias);
  690. out:
  691. unlock_super(sb);
  692. dentry->d_time = dentry->d_parent->d_inode->i_version;
  693. dentry = d_splice_alias(inode, dentry);
  694. if (dentry)
  695. dentry->d_time = dentry->d_parent->d_inode->i_version;
  696. return dentry;
  697. error:
  698. unlock_super(sb);
  699. return ERR_PTR(err);
  700. }
  701. static int vfat_create(struct inode *dir, struct dentry *dentry, umode_t mode,
  702. struct nameidata *nd)
  703. {
  704. struct super_block *sb = dir->i_sb;
  705. struct inode *inode;
  706. struct fat_slot_info sinfo;
  707. struct timespec ts;
  708. int err;
  709. lock_super(sb);
  710. ts = CURRENT_TIME_SEC;
  711. err = vfat_add_entry(dir, &dentry->d_name, 0, 0, &ts, &sinfo);
  712. if (err)
  713. goto out;
  714. dir->i_version++;
  715. inode = fat_build_inode(sb, sinfo.de, sinfo.i_pos);
  716. brelse(sinfo.bh);
  717. if (IS_ERR(inode)) {
  718. err = PTR_ERR(inode);
  719. goto out;
  720. }
  721. inode->i_version++;
  722. inode->i_mtime = inode->i_atime = inode->i_ctime = ts;
  723. /* timestamp is already written, so mark_inode_dirty() is unneeded. */
  724. dentry->d_time = dentry->d_parent->d_inode->i_version;
  725. d_instantiate(dentry, inode);
  726. out:
  727. unlock_super(sb);
  728. return err;
  729. }
  730. static int vfat_rmdir(struct inode *dir, struct dentry *dentry)
  731. {
  732. struct inode *inode = dentry->d_inode;
  733. struct super_block *sb = dir->i_sb;
  734. struct fat_slot_info sinfo;
  735. int err;
  736. lock_super(sb);
  737. err = fat_dir_empty(inode);
  738. if (err)
  739. goto out;
  740. err = vfat_find(dir, &dentry->d_name, &sinfo);
  741. if (err)
  742. goto out;
  743. err = fat_remove_entries(dir, &sinfo); /* and releases bh */
  744. if (err)
  745. goto out;
  746. drop_nlink(dir);
  747. clear_nlink(inode);
  748. inode->i_mtime = inode->i_atime = CURRENT_TIME_SEC;
  749. fat_detach(inode);
  750. out:
  751. unlock_super(sb);
  752. return err;
  753. }
  754. static int vfat_unlink(struct inode *dir, struct dentry *dentry)
  755. {
  756. struct inode *inode = dentry->d_inode;
  757. struct super_block *sb = dir->i_sb;
  758. struct fat_slot_info sinfo;
  759. int err;
  760. lock_super(sb);
  761. err = vfat_find(dir, &dentry->d_name, &sinfo);
  762. if (err)
  763. goto out;
  764. err = fat_remove_entries(dir, &sinfo); /* and releases bh */
  765. if (err)
  766. goto out;
  767. clear_nlink(inode);
  768. inode->i_mtime = inode->i_atime = CURRENT_TIME_SEC;
  769. fat_detach(inode);
  770. out:
  771. unlock_super(sb);
  772. return err;
  773. }
  774. static int vfat_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
  775. {
  776. struct super_block *sb = dir->i_sb;
  777. struct inode *inode;
  778. struct fat_slot_info sinfo;
  779. struct timespec ts;
  780. int err, cluster;
  781. lock_super(sb);
  782. ts = CURRENT_TIME_SEC;
  783. cluster = fat_alloc_new_dir(dir, &ts);
  784. if (cluster < 0) {
  785. err = cluster;
  786. goto out;
  787. }
  788. err = vfat_add_entry(dir, &dentry->d_name, 1, cluster, &ts, &sinfo);
  789. if (err)
  790. goto out_free;
  791. dir->i_version++;
  792. inc_nlink(dir);
  793. inode = fat_build_inode(sb, sinfo.de, sinfo.i_pos);
  794. brelse(sinfo.bh);
  795. if (IS_ERR(inode)) {
  796. err = PTR_ERR(inode);
  797. /* the directory was completed, just return a error */
  798. goto out;
  799. }
  800. inode->i_version++;
  801. set_nlink(inode, 2);
  802. inode->i_mtime = inode->i_atime = inode->i_ctime = ts;
  803. /* timestamp is already written, so mark_inode_dirty() is unneeded. */
  804. dentry->d_time = dentry->d_parent->d_inode->i_version;
  805. d_instantiate(dentry, inode);
  806. unlock_super(sb);
  807. return 0;
  808. out_free:
  809. fat_free_clusters(dir, cluster);
  810. out:
  811. unlock_super(sb);
  812. return err;
  813. }
  814. static int vfat_rename(struct inode *old_dir, struct dentry *old_dentry,
  815. struct inode *new_dir, struct dentry *new_dentry)
  816. {
  817. struct buffer_head *dotdot_bh;
  818. struct msdos_dir_entry *dotdot_de;
  819. struct inode *old_inode, *new_inode;
  820. struct fat_slot_info old_sinfo, sinfo;
  821. struct timespec ts;
  822. loff_t dotdot_i_pos, new_i_pos;
  823. int err, is_dir, update_dotdot, corrupt = 0;
  824. struct super_block *sb = old_dir->i_sb;
  825. old_sinfo.bh = sinfo.bh = dotdot_bh = NULL;
  826. old_inode = old_dentry->d_inode;
  827. new_inode = new_dentry->d_inode;
  828. lock_super(sb);
  829. err = vfat_find(old_dir, &old_dentry->d_name, &old_sinfo);
  830. if (err)
  831. goto out;
  832. is_dir = S_ISDIR(old_inode->i_mode);
  833. update_dotdot = (is_dir && old_dir != new_dir);
  834. if (update_dotdot) {
  835. if (fat_get_dotdot_entry(old_inode, &dotdot_bh, &dotdot_de,
  836. &dotdot_i_pos) < 0) {
  837. err = -EIO;
  838. goto out;
  839. }
  840. }
  841. ts = CURRENT_TIME_SEC;
  842. if (new_inode) {
  843. if (is_dir) {
  844. err = fat_dir_empty(new_inode);
  845. if (err)
  846. goto out;
  847. }
  848. new_i_pos = MSDOS_I(new_inode)->i_pos;
  849. fat_detach(new_inode);
  850. } else {
  851. err = vfat_add_entry(new_dir, &new_dentry->d_name, is_dir, 0,
  852. &ts, &sinfo);
  853. if (err)
  854. goto out;
  855. new_i_pos = sinfo.i_pos;
  856. }
  857. new_dir->i_version++;
  858. fat_detach(old_inode);
  859. fat_attach(old_inode, new_i_pos);
  860. if (IS_DIRSYNC(new_dir)) {
  861. err = fat_sync_inode(old_inode);
  862. if (err)
  863. goto error_inode;
  864. } else
  865. mark_inode_dirty(old_inode);
  866. if (update_dotdot) {
  867. int start = MSDOS_I(new_dir)->i_logstart;
  868. dotdot_de->start = cpu_to_le16(start);
  869. dotdot_de->starthi = cpu_to_le16(start >> 16);
  870. mark_buffer_dirty_inode(dotdot_bh, old_inode);
  871. if (IS_DIRSYNC(new_dir)) {
  872. err = sync_dirty_buffer(dotdot_bh);
  873. if (err)
  874. goto error_dotdot;
  875. }
  876. drop_nlink(old_dir);
  877. if (!new_inode)
  878. inc_nlink(new_dir);
  879. }
  880. err = fat_remove_entries(old_dir, &old_sinfo); /* and releases bh */
  881. old_sinfo.bh = NULL;
  882. if (err)
  883. goto error_dotdot;
  884. old_dir->i_version++;
  885. old_dir->i_ctime = old_dir->i_mtime = ts;
  886. if (IS_DIRSYNC(old_dir))
  887. (void)fat_sync_inode(old_dir);
  888. else
  889. mark_inode_dirty(old_dir);
  890. if (new_inode) {
  891. drop_nlink(new_inode);
  892. if (is_dir)
  893. drop_nlink(new_inode);
  894. new_inode->i_ctime = ts;
  895. }
  896. out:
  897. brelse(sinfo.bh);
  898. brelse(dotdot_bh);
  899. brelse(old_sinfo.bh);
  900. unlock_super(sb);
  901. return err;
  902. error_dotdot:
  903. /* data cluster is shared, serious corruption */
  904. corrupt = 1;
  905. if (update_dotdot) {
  906. int start = MSDOS_I(old_dir)->i_logstart;
  907. dotdot_de->start = cpu_to_le16(start);
  908. dotdot_de->starthi = cpu_to_le16(start >> 16);
  909. mark_buffer_dirty_inode(dotdot_bh, old_inode);
  910. corrupt |= sync_dirty_buffer(dotdot_bh);
  911. }
  912. error_inode:
  913. fat_detach(old_inode);
  914. fat_attach(old_inode, old_sinfo.i_pos);
  915. if (new_inode) {
  916. fat_attach(new_inode, new_i_pos);
  917. if (corrupt)
  918. corrupt |= fat_sync_inode(new_inode);
  919. } else {
  920. /*
  921. * If new entry was not sharing the data cluster, it
  922. * shouldn't be serious corruption.
  923. */
  924. int err2 = fat_remove_entries(new_dir, &sinfo);
  925. if (corrupt)
  926. corrupt |= err2;
  927. sinfo.bh = NULL;
  928. }
  929. if (corrupt < 0) {
  930. fat_fs_error(new_dir->i_sb,
  931. "%s: Filesystem corrupted (i_pos %lld)",
  932. __func__, sinfo.i_pos);
  933. }
  934. goto out;
  935. }
  936. static const struct inode_operations vfat_dir_inode_operations = {
  937. .create = vfat_create,
  938. .lookup = vfat_lookup,
  939. .unlink = vfat_unlink,
  940. .mkdir = vfat_mkdir,
  941. .rmdir = vfat_rmdir,
  942. .rename = vfat_rename,
  943. .setattr = fat_setattr,
  944. .getattr = fat_getattr,
  945. };
  946. static void setup(struct super_block *sb)
  947. {
  948. MSDOS_SB(sb)->dir_ops = &vfat_dir_inode_operations;
  949. if (MSDOS_SB(sb)->options.name_check != 's')
  950. sb->s_d_op = &vfat_ci_dentry_ops;
  951. else
  952. sb->s_d_op = &vfat_dentry_ops;
  953. }
  954. static int vfat_fill_super(struct super_block *sb, void *data, int silent)
  955. {
  956. return fat_fill_super(sb, data, silent, 1, setup);
  957. }
  958. static struct dentry *vfat_mount(struct file_system_type *fs_type,
  959. int flags, const char *dev_name,
  960. void *data)
  961. {
  962. return mount_bdev(fs_type, flags, dev_name, data, vfat_fill_super);
  963. }
  964. static struct file_system_type vfat_fs_type = {
  965. .owner = THIS_MODULE,
  966. .name = "vfat",
  967. .mount = vfat_mount,
  968. .kill_sb = kill_block_super,
  969. .fs_flags = FS_REQUIRES_DEV,
  970. };
  971. static int __init init_vfat_fs(void)
  972. {
  973. return register_filesystem(&vfat_fs_type);
  974. }
  975. static void __exit exit_vfat_fs(void)
  976. {
  977. unregister_filesystem(&vfat_fs_type);
  978. }
  979. MODULE_LICENSE("GPL");
  980. MODULE_DESCRIPTION("VFAT filesystem support");
  981. MODULE_AUTHOR("Gordon Chaffee");
  982. module_init(init_vfat_fs)
  983. module_exit(exit_vfat_fs)