namei_vfat.c 25 KB

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