dir.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870
  1. /*
  2. * JFFS2 -- Journalling Flash File System, Version 2.
  3. *
  4. * Copyright (C) 2001-2003 Red Hat, Inc.
  5. *
  6. * Created by David Woodhouse <dwmw2@infradead.org>
  7. *
  8. * For licensing information, see the file 'LICENCE' in this directory.
  9. *
  10. * $Id: dir.c,v 1.90 2005/11/07 11:14:39 gleixner Exp $
  11. *
  12. */
  13. #include <linux/kernel.h>
  14. #include <linux/slab.h>
  15. #include <linux/fs.h>
  16. #include <linux/crc32.h>
  17. #include <linux/jffs2.h>
  18. #include "jffs2_fs_i.h"
  19. #include "jffs2_fs_sb.h"
  20. #include <linux/time.h>
  21. #include "nodelist.h"
  22. static int jffs2_readdir (struct file *, void *, filldir_t);
  23. static int jffs2_create (struct inode *,struct dentry *,int,
  24. struct nameidata *);
  25. static struct dentry *jffs2_lookup (struct inode *,struct dentry *,
  26. struct nameidata *);
  27. static int jffs2_link (struct dentry *,struct inode *,struct dentry *);
  28. static int jffs2_unlink (struct inode *,struct dentry *);
  29. static int jffs2_symlink (struct inode *,struct dentry *,const char *);
  30. static int jffs2_mkdir (struct inode *,struct dentry *,int);
  31. static int jffs2_rmdir (struct inode *,struct dentry *);
  32. static int jffs2_mknod (struct inode *,struct dentry *,int,dev_t);
  33. static int jffs2_rename (struct inode *, struct dentry *,
  34. struct inode *, struct dentry *);
  35. const struct file_operations jffs2_dir_operations =
  36. {
  37. .read = generic_read_dir,
  38. .readdir = jffs2_readdir,
  39. .ioctl = jffs2_ioctl,
  40. .fsync = jffs2_fsync
  41. };
  42. const struct inode_operations jffs2_dir_inode_operations =
  43. {
  44. .create = jffs2_create,
  45. .lookup = jffs2_lookup,
  46. .link = jffs2_link,
  47. .unlink = jffs2_unlink,
  48. .symlink = jffs2_symlink,
  49. .mkdir = jffs2_mkdir,
  50. .rmdir = jffs2_rmdir,
  51. .mknod = jffs2_mknod,
  52. .rename = jffs2_rename,
  53. .permission = jffs2_permission,
  54. .setattr = jffs2_setattr,
  55. .setxattr = jffs2_setxattr,
  56. .getxattr = jffs2_getxattr,
  57. .listxattr = jffs2_listxattr,
  58. .removexattr = jffs2_removexattr
  59. };
  60. /***********************************************************************/
  61. /* We keep the dirent list sorted in increasing order of name hash,
  62. and we use the same hash function as the dentries. Makes this
  63. nice and simple
  64. */
  65. static struct dentry *jffs2_lookup(struct inode *dir_i, struct dentry *target,
  66. struct nameidata *nd)
  67. {
  68. struct jffs2_inode_info *dir_f;
  69. struct jffs2_sb_info *c;
  70. struct jffs2_full_dirent *fd = NULL, *fd_list;
  71. uint32_t ino = 0;
  72. struct inode *inode = NULL;
  73. D1(printk(KERN_DEBUG "jffs2_lookup()\n"));
  74. if (target->d_name.len > JFFS2_MAX_NAME_LEN)
  75. return ERR_PTR(-ENAMETOOLONG);
  76. dir_f = JFFS2_INODE_INFO(dir_i);
  77. c = JFFS2_SB_INFO(dir_i->i_sb);
  78. down(&dir_f->sem);
  79. /* NB: The 2.2 backport will need to explicitly check for '.' and '..' here */
  80. for (fd_list = dir_f->dents; fd_list && fd_list->nhash <= target->d_name.hash; fd_list = fd_list->next) {
  81. if (fd_list->nhash == target->d_name.hash &&
  82. (!fd || fd_list->version > fd->version) &&
  83. strlen(fd_list->name) == target->d_name.len &&
  84. !strncmp(fd_list->name, target->d_name.name, target->d_name.len)) {
  85. fd = fd_list;
  86. }
  87. }
  88. if (fd)
  89. ino = fd->ino;
  90. up(&dir_f->sem);
  91. if (ino) {
  92. inode = iget(dir_i->i_sb, ino);
  93. if (!inode) {
  94. printk(KERN_WARNING "iget() failed for ino #%u\n", ino);
  95. return (ERR_PTR(-EIO));
  96. }
  97. }
  98. d_add(target, inode);
  99. return NULL;
  100. }
  101. /***********************************************************************/
  102. static int jffs2_readdir(struct file *filp, void *dirent, filldir_t filldir)
  103. {
  104. struct jffs2_inode_info *f;
  105. struct jffs2_sb_info *c;
  106. struct inode *inode = filp->f_path.dentry->d_inode;
  107. struct jffs2_full_dirent *fd;
  108. unsigned long offset, curofs;
  109. D1(printk(KERN_DEBUG "jffs2_readdir() for dir_i #%lu\n", filp->f_path.dentry->d_inode->i_ino));
  110. f = JFFS2_INODE_INFO(inode);
  111. c = JFFS2_SB_INFO(inode->i_sb);
  112. offset = filp->f_pos;
  113. if (offset == 0) {
  114. D1(printk(KERN_DEBUG "Dirent 0: \".\", ino #%lu\n", inode->i_ino));
  115. if (filldir(dirent, ".", 1, 0, inode->i_ino, DT_DIR) < 0)
  116. goto out;
  117. offset++;
  118. }
  119. if (offset == 1) {
  120. unsigned long pino = parent_ino(filp->f_path.dentry);
  121. D1(printk(KERN_DEBUG "Dirent 1: \"..\", ino #%lu\n", pino));
  122. if (filldir(dirent, "..", 2, 1, pino, DT_DIR) < 0)
  123. goto out;
  124. offset++;
  125. }
  126. curofs=1;
  127. down(&f->sem);
  128. for (fd = f->dents; fd; fd = fd->next) {
  129. curofs++;
  130. /* First loop: curofs = 2; offset = 2 */
  131. if (curofs < offset) {
  132. D2(printk(KERN_DEBUG "Skipping dirent: \"%s\", ino #%u, type %d, because curofs %ld < offset %ld\n",
  133. fd->name, fd->ino, fd->type, curofs, offset));
  134. continue;
  135. }
  136. if (!fd->ino) {
  137. D2(printk(KERN_DEBUG "Skipping deletion dirent \"%s\"\n", fd->name));
  138. offset++;
  139. continue;
  140. }
  141. D2(printk(KERN_DEBUG "Dirent %ld: \"%s\", ino #%u, type %d\n", offset, fd->name, fd->ino, fd->type));
  142. if (filldir(dirent, fd->name, strlen(fd->name), offset, fd->ino, fd->type) < 0)
  143. break;
  144. offset++;
  145. }
  146. up(&f->sem);
  147. out:
  148. filp->f_pos = offset;
  149. return 0;
  150. }
  151. /***********************************************************************/
  152. static int jffs2_create(struct inode *dir_i, struct dentry *dentry, int mode,
  153. struct nameidata *nd)
  154. {
  155. struct jffs2_raw_inode *ri;
  156. struct jffs2_inode_info *f, *dir_f;
  157. struct jffs2_sb_info *c;
  158. struct inode *inode;
  159. int ret;
  160. ri = jffs2_alloc_raw_inode();
  161. if (!ri)
  162. return -ENOMEM;
  163. c = JFFS2_SB_INFO(dir_i->i_sb);
  164. D1(printk(KERN_DEBUG "jffs2_create()\n"));
  165. inode = jffs2_new_inode(dir_i, mode, ri);
  166. if (IS_ERR(inode)) {
  167. D1(printk(KERN_DEBUG "jffs2_new_inode() failed\n"));
  168. jffs2_free_raw_inode(ri);
  169. return PTR_ERR(inode);
  170. }
  171. inode->i_op = &jffs2_file_inode_operations;
  172. inode->i_fop = &jffs2_file_operations;
  173. inode->i_mapping->a_ops = &jffs2_file_address_operations;
  174. inode->i_mapping->nrpages = 0;
  175. f = JFFS2_INODE_INFO(inode);
  176. dir_f = JFFS2_INODE_INFO(dir_i);
  177. ret = jffs2_do_create(c, dir_f, f, ri,
  178. dentry->d_name.name, dentry->d_name.len);
  179. if (ret)
  180. goto fail;
  181. ret = jffs2_init_security(inode, dir_i);
  182. if (ret)
  183. goto fail;
  184. ret = jffs2_init_acl(inode, dir_i);
  185. if (ret)
  186. goto fail;
  187. dir_i->i_mtime = dir_i->i_ctime = ITIME(je32_to_cpu(ri->ctime));
  188. jffs2_free_raw_inode(ri);
  189. d_instantiate(dentry, inode);
  190. D1(printk(KERN_DEBUG "jffs2_create: Created ino #%lu with mode %o, nlink %d(%d). nrpages %ld\n",
  191. inode->i_ino, inode->i_mode, inode->i_nlink, f->inocache->nlink, inode->i_mapping->nrpages));
  192. return 0;
  193. fail:
  194. make_bad_inode(inode);
  195. iput(inode);
  196. jffs2_free_raw_inode(ri);
  197. return ret;
  198. }
  199. /***********************************************************************/
  200. static int jffs2_unlink(struct inode *dir_i, struct dentry *dentry)
  201. {
  202. struct jffs2_sb_info *c = JFFS2_SB_INFO(dir_i->i_sb);
  203. struct jffs2_inode_info *dir_f = JFFS2_INODE_INFO(dir_i);
  204. struct jffs2_inode_info *dead_f = JFFS2_INODE_INFO(dentry->d_inode);
  205. int ret;
  206. uint32_t now = get_seconds();
  207. ret = jffs2_do_unlink(c, dir_f, dentry->d_name.name,
  208. dentry->d_name.len, dead_f, now);
  209. if (dead_f->inocache)
  210. dentry->d_inode->i_nlink = dead_f->inocache->nlink;
  211. if (!ret)
  212. dir_i->i_mtime = dir_i->i_ctime = ITIME(now);
  213. return ret;
  214. }
  215. /***********************************************************************/
  216. static int jffs2_link (struct dentry *old_dentry, struct inode *dir_i, struct dentry *dentry)
  217. {
  218. struct jffs2_sb_info *c = JFFS2_SB_INFO(old_dentry->d_inode->i_sb);
  219. struct jffs2_inode_info *f = JFFS2_INODE_INFO(old_dentry->d_inode);
  220. struct jffs2_inode_info *dir_f = JFFS2_INODE_INFO(dir_i);
  221. int ret;
  222. uint8_t type;
  223. uint32_t now;
  224. /* Don't let people make hard links to bad inodes. */
  225. if (!f->inocache)
  226. return -EIO;
  227. if (S_ISDIR(old_dentry->d_inode->i_mode))
  228. return -EPERM;
  229. /* XXX: This is ugly */
  230. type = (old_dentry->d_inode->i_mode & S_IFMT) >> 12;
  231. if (!type) type = DT_REG;
  232. now = get_seconds();
  233. ret = jffs2_do_link(c, dir_f, f->inocache->ino, type, dentry->d_name.name, dentry->d_name.len, now);
  234. if (!ret) {
  235. down(&f->sem);
  236. old_dentry->d_inode->i_nlink = ++f->inocache->nlink;
  237. up(&f->sem);
  238. d_instantiate(dentry, old_dentry->d_inode);
  239. dir_i->i_mtime = dir_i->i_ctime = ITIME(now);
  240. atomic_inc(&old_dentry->d_inode->i_count);
  241. }
  242. return ret;
  243. }
  244. /***********************************************************************/
  245. static int jffs2_symlink (struct inode *dir_i, struct dentry *dentry, const char *target)
  246. {
  247. struct jffs2_inode_info *f, *dir_f;
  248. struct jffs2_sb_info *c;
  249. struct inode *inode;
  250. struct jffs2_raw_inode *ri;
  251. struct jffs2_raw_dirent *rd;
  252. struct jffs2_full_dnode *fn;
  253. struct jffs2_full_dirent *fd;
  254. int namelen;
  255. uint32_t alloclen;
  256. int ret, targetlen = strlen(target);
  257. /* FIXME: If you care. We'd need to use frags for the target
  258. if it grows much more than this */
  259. if (targetlen > 254)
  260. return -EINVAL;
  261. ri = jffs2_alloc_raw_inode();
  262. if (!ri)
  263. return -ENOMEM;
  264. c = JFFS2_SB_INFO(dir_i->i_sb);
  265. /* Try to reserve enough space for both node and dirent.
  266. * Just the node will do for now, though
  267. */
  268. namelen = dentry->d_name.len;
  269. ret = jffs2_reserve_space(c, sizeof(*ri) + targetlen, &alloclen,
  270. ALLOC_NORMAL, JFFS2_SUMMARY_INODE_SIZE);
  271. if (ret) {
  272. jffs2_free_raw_inode(ri);
  273. return ret;
  274. }
  275. inode = jffs2_new_inode(dir_i, S_IFLNK | S_IRWXUGO, ri);
  276. if (IS_ERR(inode)) {
  277. jffs2_free_raw_inode(ri);
  278. jffs2_complete_reservation(c);
  279. return PTR_ERR(inode);
  280. }
  281. inode->i_op = &jffs2_symlink_inode_operations;
  282. f = JFFS2_INODE_INFO(inode);
  283. inode->i_size = targetlen;
  284. ri->isize = ri->dsize = ri->csize = cpu_to_je32(inode->i_size);
  285. ri->totlen = cpu_to_je32(sizeof(*ri) + inode->i_size);
  286. ri->hdr_crc = cpu_to_je32(crc32(0, ri, sizeof(struct jffs2_unknown_node)-4));
  287. ri->compr = JFFS2_COMPR_NONE;
  288. ri->data_crc = cpu_to_je32(crc32(0, target, targetlen));
  289. ri->node_crc = cpu_to_je32(crc32(0, ri, sizeof(*ri)-8));
  290. fn = jffs2_write_dnode(c, f, ri, target, targetlen, ALLOC_NORMAL);
  291. jffs2_free_raw_inode(ri);
  292. if (IS_ERR(fn)) {
  293. /* Eeek. Wave bye bye */
  294. up(&f->sem);
  295. jffs2_complete_reservation(c);
  296. jffs2_clear_inode(inode);
  297. return PTR_ERR(fn);
  298. }
  299. /* We use f->target field to store the target path. */
  300. f->target = kmalloc(targetlen + 1, GFP_KERNEL);
  301. if (!f->target) {
  302. printk(KERN_WARNING "Can't allocate %d bytes of memory\n", targetlen + 1);
  303. up(&f->sem);
  304. jffs2_complete_reservation(c);
  305. jffs2_clear_inode(inode);
  306. return -ENOMEM;
  307. }
  308. memcpy(f->target, target, targetlen + 1);
  309. D1(printk(KERN_DEBUG "jffs2_symlink: symlink's target '%s' cached\n", (char *)f->target));
  310. /* No data here. Only a metadata node, which will be
  311. obsoleted by the first data write
  312. */
  313. f->metadata = fn;
  314. up(&f->sem);
  315. jffs2_complete_reservation(c);
  316. ret = jffs2_init_security(inode, dir_i);
  317. if (ret) {
  318. jffs2_clear_inode(inode);
  319. return ret;
  320. }
  321. ret = jffs2_init_acl(inode, dir_i);
  322. if (ret) {
  323. jffs2_clear_inode(inode);
  324. return ret;
  325. }
  326. ret = jffs2_reserve_space(c, sizeof(*rd)+namelen, &alloclen,
  327. ALLOC_NORMAL, JFFS2_SUMMARY_DIRENT_SIZE(namelen));
  328. if (ret) {
  329. /* Eep. */
  330. jffs2_clear_inode(inode);
  331. return ret;
  332. }
  333. rd = jffs2_alloc_raw_dirent();
  334. if (!rd) {
  335. /* Argh. Now we treat it like a normal delete */
  336. jffs2_complete_reservation(c);
  337. jffs2_clear_inode(inode);
  338. return -ENOMEM;
  339. }
  340. dir_f = JFFS2_INODE_INFO(dir_i);
  341. down(&dir_f->sem);
  342. rd->magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
  343. rd->nodetype = cpu_to_je16(JFFS2_NODETYPE_DIRENT);
  344. rd->totlen = cpu_to_je32(sizeof(*rd) + namelen);
  345. rd->hdr_crc = cpu_to_je32(crc32(0, rd, sizeof(struct jffs2_unknown_node)-4));
  346. rd->pino = cpu_to_je32(dir_i->i_ino);
  347. rd->version = cpu_to_je32(++dir_f->highest_version);
  348. rd->ino = cpu_to_je32(inode->i_ino);
  349. rd->mctime = cpu_to_je32(get_seconds());
  350. rd->nsize = namelen;
  351. rd->type = DT_LNK;
  352. rd->node_crc = cpu_to_je32(crc32(0, rd, sizeof(*rd)-8));
  353. rd->name_crc = cpu_to_je32(crc32(0, dentry->d_name.name, namelen));
  354. fd = jffs2_write_dirent(c, dir_f, rd, dentry->d_name.name, namelen, ALLOC_NORMAL);
  355. if (IS_ERR(fd)) {
  356. /* dirent failed to write. Delete the inode normally
  357. as if it were the final unlink() */
  358. jffs2_complete_reservation(c);
  359. jffs2_free_raw_dirent(rd);
  360. up(&dir_f->sem);
  361. jffs2_clear_inode(inode);
  362. return PTR_ERR(fd);
  363. }
  364. dir_i->i_mtime = dir_i->i_ctime = ITIME(je32_to_cpu(rd->mctime));
  365. jffs2_free_raw_dirent(rd);
  366. /* Link the fd into the inode's list, obsoleting an old
  367. one if necessary. */
  368. jffs2_add_fd_to_list(c, fd, &dir_f->dents);
  369. up(&dir_f->sem);
  370. jffs2_complete_reservation(c);
  371. d_instantiate(dentry, inode);
  372. return 0;
  373. }
  374. static int jffs2_mkdir (struct inode *dir_i, struct dentry *dentry, int mode)
  375. {
  376. struct jffs2_inode_info *f, *dir_f;
  377. struct jffs2_sb_info *c;
  378. struct inode *inode;
  379. struct jffs2_raw_inode *ri;
  380. struct jffs2_raw_dirent *rd;
  381. struct jffs2_full_dnode *fn;
  382. struct jffs2_full_dirent *fd;
  383. int namelen;
  384. uint32_t alloclen;
  385. int ret;
  386. mode |= S_IFDIR;
  387. ri = jffs2_alloc_raw_inode();
  388. if (!ri)
  389. return -ENOMEM;
  390. c = JFFS2_SB_INFO(dir_i->i_sb);
  391. /* Try to reserve enough space for both node and dirent.
  392. * Just the node will do for now, though
  393. */
  394. namelen = dentry->d_name.len;
  395. ret = jffs2_reserve_space(c, sizeof(*ri), &alloclen, ALLOC_NORMAL,
  396. JFFS2_SUMMARY_INODE_SIZE);
  397. if (ret) {
  398. jffs2_free_raw_inode(ri);
  399. return ret;
  400. }
  401. inode = jffs2_new_inode(dir_i, mode, ri);
  402. if (IS_ERR(inode)) {
  403. jffs2_free_raw_inode(ri);
  404. jffs2_complete_reservation(c);
  405. return PTR_ERR(inode);
  406. }
  407. inode->i_op = &jffs2_dir_inode_operations;
  408. inode->i_fop = &jffs2_dir_operations;
  409. /* Directories get nlink 2 at start */
  410. inode->i_nlink = 2;
  411. f = JFFS2_INODE_INFO(inode);
  412. ri->data_crc = cpu_to_je32(0);
  413. ri->node_crc = cpu_to_je32(crc32(0, ri, sizeof(*ri)-8));
  414. fn = jffs2_write_dnode(c, f, ri, NULL, 0, ALLOC_NORMAL);
  415. jffs2_free_raw_inode(ri);
  416. if (IS_ERR(fn)) {
  417. /* Eeek. Wave bye bye */
  418. up(&f->sem);
  419. jffs2_complete_reservation(c);
  420. jffs2_clear_inode(inode);
  421. return PTR_ERR(fn);
  422. }
  423. /* No data here. Only a metadata node, which will be
  424. obsoleted by the first data write
  425. */
  426. f->metadata = fn;
  427. up(&f->sem);
  428. jffs2_complete_reservation(c);
  429. ret = jffs2_init_security(inode, dir_i);
  430. if (ret) {
  431. jffs2_clear_inode(inode);
  432. return ret;
  433. }
  434. ret = jffs2_init_acl(inode, dir_i);
  435. if (ret) {
  436. jffs2_clear_inode(inode);
  437. return ret;
  438. }
  439. ret = jffs2_reserve_space(c, sizeof(*rd)+namelen, &alloclen,
  440. ALLOC_NORMAL, JFFS2_SUMMARY_DIRENT_SIZE(namelen));
  441. if (ret) {
  442. /* Eep. */
  443. jffs2_clear_inode(inode);
  444. return ret;
  445. }
  446. rd = jffs2_alloc_raw_dirent();
  447. if (!rd) {
  448. /* Argh. Now we treat it like a normal delete */
  449. jffs2_complete_reservation(c);
  450. jffs2_clear_inode(inode);
  451. return -ENOMEM;
  452. }
  453. dir_f = JFFS2_INODE_INFO(dir_i);
  454. down(&dir_f->sem);
  455. rd->magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
  456. rd->nodetype = cpu_to_je16(JFFS2_NODETYPE_DIRENT);
  457. rd->totlen = cpu_to_je32(sizeof(*rd) + namelen);
  458. rd->hdr_crc = cpu_to_je32(crc32(0, rd, sizeof(struct jffs2_unknown_node)-4));
  459. rd->pino = cpu_to_je32(dir_i->i_ino);
  460. rd->version = cpu_to_je32(++dir_f->highest_version);
  461. rd->ino = cpu_to_je32(inode->i_ino);
  462. rd->mctime = cpu_to_je32(get_seconds());
  463. rd->nsize = namelen;
  464. rd->type = DT_DIR;
  465. rd->node_crc = cpu_to_je32(crc32(0, rd, sizeof(*rd)-8));
  466. rd->name_crc = cpu_to_je32(crc32(0, dentry->d_name.name, namelen));
  467. fd = jffs2_write_dirent(c, dir_f, rd, dentry->d_name.name, namelen, ALLOC_NORMAL);
  468. if (IS_ERR(fd)) {
  469. /* dirent failed to write. Delete the inode normally
  470. as if it were the final unlink() */
  471. jffs2_complete_reservation(c);
  472. jffs2_free_raw_dirent(rd);
  473. up(&dir_f->sem);
  474. jffs2_clear_inode(inode);
  475. return PTR_ERR(fd);
  476. }
  477. dir_i->i_mtime = dir_i->i_ctime = ITIME(je32_to_cpu(rd->mctime));
  478. inc_nlink(dir_i);
  479. jffs2_free_raw_dirent(rd);
  480. /* Link the fd into the inode's list, obsoleting an old
  481. one if necessary. */
  482. jffs2_add_fd_to_list(c, fd, &dir_f->dents);
  483. up(&dir_f->sem);
  484. jffs2_complete_reservation(c);
  485. d_instantiate(dentry, inode);
  486. return 0;
  487. }
  488. static int jffs2_rmdir (struct inode *dir_i, struct dentry *dentry)
  489. {
  490. struct jffs2_inode_info *f = JFFS2_INODE_INFO(dentry->d_inode);
  491. struct jffs2_full_dirent *fd;
  492. int ret;
  493. for (fd = f->dents ; fd; fd = fd->next) {
  494. if (fd->ino)
  495. return -ENOTEMPTY;
  496. }
  497. ret = jffs2_unlink(dir_i, dentry);
  498. if (!ret)
  499. drop_nlink(dir_i);
  500. return ret;
  501. }
  502. static int jffs2_mknod (struct inode *dir_i, struct dentry *dentry, int mode, dev_t rdev)
  503. {
  504. struct jffs2_inode_info *f, *dir_f;
  505. struct jffs2_sb_info *c;
  506. struct inode *inode;
  507. struct jffs2_raw_inode *ri;
  508. struct jffs2_raw_dirent *rd;
  509. struct jffs2_full_dnode *fn;
  510. struct jffs2_full_dirent *fd;
  511. int namelen;
  512. union jffs2_device_node dev;
  513. int devlen = 0;
  514. uint32_t alloclen;
  515. int ret;
  516. if (!new_valid_dev(rdev))
  517. return -EINVAL;
  518. ri = jffs2_alloc_raw_inode();
  519. if (!ri)
  520. return -ENOMEM;
  521. c = JFFS2_SB_INFO(dir_i->i_sb);
  522. if (S_ISBLK(mode) || S_ISCHR(mode))
  523. devlen = jffs2_encode_dev(&dev, rdev);
  524. /* Try to reserve enough space for both node and dirent.
  525. * Just the node will do for now, though
  526. */
  527. namelen = dentry->d_name.len;
  528. ret = jffs2_reserve_space(c, sizeof(*ri) + devlen, &alloclen,
  529. ALLOC_NORMAL, JFFS2_SUMMARY_INODE_SIZE);
  530. if (ret) {
  531. jffs2_free_raw_inode(ri);
  532. return ret;
  533. }
  534. inode = jffs2_new_inode(dir_i, mode, ri);
  535. if (IS_ERR(inode)) {
  536. jffs2_free_raw_inode(ri);
  537. jffs2_complete_reservation(c);
  538. return PTR_ERR(inode);
  539. }
  540. inode->i_op = &jffs2_file_inode_operations;
  541. init_special_inode(inode, inode->i_mode, rdev);
  542. f = JFFS2_INODE_INFO(inode);
  543. ri->dsize = ri->csize = cpu_to_je32(devlen);
  544. ri->totlen = cpu_to_je32(sizeof(*ri) + devlen);
  545. ri->hdr_crc = cpu_to_je32(crc32(0, ri, sizeof(struct jffs2_unknown_node)-4));
  546. ri->compr = JFFS2_COMPR_NONE;
  547. ri->data_crc = cpu_to_je32(crc32(0, &dev, devlen));
  548. ri->node_crc = cpu_to_je32(crc32(0, ri, sizeof(*ri)-8));
  549. fn = jffs2_write_dnode(c, f, ri, (char *)&dev, devlen, ALLOC_NORMAL);
  550. jffs2_free_raw_inode(ri);
  551. if (IS_ERR(fn)) {
  552. /* Eeek. Wave bye bye */
  553. up(&f->sem);
  554. jffs2_complete_reservation(c);
  555. jffs2_clear_inode(inode);
  556. return PTR_ERR(fn);
  557. }
  558. /* No data here. Only a metadata node, which will be
  559. obsoleted by the first data write
  560. */
  561. f->metadata = fn;
  562. up(&f->sem);
  563. jffs2_complete_reservation(c);
  564. ret = jffs2_init_security(inode, dir_i);
  565. if (ret) {
  566. jffs2_clear_inode(inode);
  567. return ret;
  568. }
  569. ret = jffs2_init_acl(inode, dir_i);
  570. if (ret) {
  571. jffs2_clear_inode(inode);
  572. return ret;
  573. }
  574. ret = jffs2_reserve_space(c, sizeof(*rd)+namelen, &alloclen,
  575. ALLOC_NORMAL, JFFS2_SUMMARY_DIRENT_SIZE(namelen));
  576. if (ret) {
  577. /* Eep. */
  578. jffs2_clear_inode(inode);
  579. return ret;
  580. }
  581. rd = jffs2_alloc_raw_dirent();
  582. if (!rd) {
  583. /* Argh. Now we treat it like a normal delete */
  584. jffs2_complete_reservation(c);
  585. jffs2_clear_inode(inode);
  586. return -ENOMEM;
  587. }
  588. dir_f = JFFS2_INODE_INFO(dir_i);
  589. down(&dir_f->sem);
  590. rd->magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
  591. rd->nodetype = cpu_to_je16(JFFS2_NODETYPE_DIRENT);
  592. rd->totlen = cpu_to_je32(sizeof(*rd) + namelen);
  593. rd->hdr_crc = cpu_to_je32(crc32(0, rd, sizeof(struct jffs2_unknown_node)-4));
  594. rd->pino = cpu_to_je32(dir_i->i_ino);
  595. rd->version = cpu_to_je32(++dir_f->highest_version);
  596. rd->ino = cpu_to_je32(inode->i_ino);
  597. rd->mctime = cpu_to_je32(get_seconds());
  598. rd->nsize = namelen;
  599. /* XXX: This is ugly. */
  600. rd->type = (mode & S_IFMT) >> 12;
  601. rd->node_crc = cpu_to_je32(crc32(0, rd, sizeof(*rd)-8));
  602. rd->name_crc = cpu_to_je32(crc32(0, dentry->d_name.name, namelen));
  603. fd = jffs2_write_dirent(c, dir_f, rd, dentry->d_name.name, namelen, ALLOC_NORMAL);
  604. if (IS_ERR(fd)) {
  605. /* dirent failed to write. Delete the inode normally
  606. as if it were the final unlink() */
  607. jffs2_complete_reservation(c);
  608. jffs2_free_raw_dirent(rd);
  609. up(&dir_f->sem);
  610. jffs2_clear_inode(inode);
  611. return PTR_ERR(fd);
  612. }
  613. dir_i->i_mtime = dir_i->i_ctime = ITIME(je32_to_cpu(rd->mctime));
  614. jffs2_free_raw_dirent(rd);
  615. /* Link the fd into the inode's list, obsoleting an old
  616. one if necessary. */
  617. jffs2_add_fd_to_list(c, fd, &dir_f->dents);
  618. up(&dir_f->sem);
  619. jffs2_complete_reservation(c);
  620. d_instantiate(dentry, inode);
  621. return 0;
  622. }
  623. static int jffs2_rename (struct inode *old_dir_i, struct dentry *old_dentry,
  624. struct inode *new_dir_i, struct dentry *new_dentry)
  625. {
  626. int ret;
  627. struct jffs2_sb_info *c = JFFS2_SB_INFO(old_dir_i->i_sb);
  628. struct jffs2_inode_info *victim_f = NULL;
  629. uint8_t type;
  630. uint32_t now;
  631. /* The VFS will check for us and prevent trying to rename a
  632. * file over a directory and vice versa, but if it's a directory,
  633. * the VFS can't check whether the victim is empty. The filesystem
  634. * needs to do that for itself.
  635. */
  636. if (new_dentry->d_inode) {
  637. victim_f = JFFS2_INODE_INFO(new_dentry->d_inode);
  638. if (S_ISDIR(new_dentry->d_inode->i_mode)) {
  639. struct jffs2_full_dirent *fd;
  640. down(&victim_f->sem);
  641. for (fd = victim_f->dents; fd; fd = fd->next) {
  642. if (fd->ino) {
  643. up(&victim_f->sem);
  644. return -ENOTEMPTY;
  645. }
  646. }
  647. up(&victim_f->sem);
  648. }
  649. }
  650. /* XXX: We probably ought to alloc enough space for
  651. both nodes at the same time. Writing the new link,
  652. then getting -ENOSPC, is quite bad :)
  653. */
  654. /* Make a hard link */
  655. /* XXX: This is ugly */
  656. type = (old_dentry->d_inode->i_mode & S_IFMT) >> 12;
  657. if (!type) type = DT_REG;
  658. now = get_seconds();
  659. ret = jffs2_do_link(c, JFFS2_INODE_INFO(new_dir_i),
  660. old_dentry->d_inode->i_ino, type,
  661. new_dentry->d_name.name, new_dentry->d_name.len, now);
  662. if (ret)
  663. return ret;
  664. if (victim_f) {
  665. /* There was a victim. Kill it off nicely */
  666. drop_nlink(new_dentry->d_inode);
  667. /* Don't oops if the victim was a dirent pointing to an
  668. inode which didn't exist. */
  669. if (victim_f->inocache) {
  670. down(&victim_f->sem);
  671. victim_f->inocache->nlink--;
  672. up(&victim_f->sem);
  673. }
  674. }
  675. /* If it was a directory we moved, and there was no victim,
  676. increase i_nlink on its new parent */
  677. if (S_ISDIR(old_dentry->d_inode->i_mode) && !victim_f)
  678. inc_nlink(new_dir_i);
  679. /* Unlink the original */
  680. ret = jffs2_do_unlink(c, JFFS2_INODE_INFO(old_dir_i),
  681. old_dentry->d_name.name, old_dentry->d_name.len, NULL, now);
  682. /* We don't touch inode->i_nlink */
  683. if (ret) {
  684. /* Oh shit. We really ought to make a single node which can do both atomically */
  685. struct jffs2_inode_info *f = JFFS2_INODE_INFO(old_dentry->d_inode);
  686. down(&f->sem);
  687. inc_nlink(old_dentry->d_inode);
  688. if (f->inocache)
  689. f->inocache->nlink++;
  690. up(&f->sem);
  691. printk(KERN_NOTICE "jffs2_rename(): Link succeeded, unlink failed (err %d). You now have a hard link\n", ret);
  692. /* Might as well let the VFS know */
  693. d_instantiate(new_dentry, old_dentry->d_inode);
  694. atomic_inc(&old_dentry->d_inode->i_count);
  695. new_dir_i->i_mtime = new_dir_i->i_ctime = ITIME(now);
  696. return ret;
  697. }
  698. if (S_ISDIR(old_dentry->d_inode->i_mode))
  699. drop_nlink(old_dir_i);
  700. new_dir_i->i_mtime = new_dir_i->i_ctime = old_dir_i->i_mtime = old_dir_i->i_ctime = ITIME(now);
  701. return 0;
  702. }