namei.c 44 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692
  1. /*
  2. * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
  3. *
  4. * Trivial changes by Alan Cox to remove EHASHCOLLISION for compatibility
  5. *
  6. * Trivial Changes:
  7. * Rights granted to Hans Reiser to redistribute under other terms providing
  8. * he accepts all liability including but not limited to patent, fitness
  9. * for purpose, and direct or indirect claims arising from failure to perform.
  10. *
  11. * NO WARRANTY
  12. */
  13. #include <linux/time.h>
  14. #include <linux/bitops.h>
  15. #include <linux/slab.h>
  16. #include "reiserfs.h"
  17. #include "acl.h"
  18. #include "xattr.h"
  19. #include <linux/quotaops.h>
  20. #define INC_DIR_INODE_NLINK(i) if (i->i_nlink != 1) { inc_nlink(i); if (i->i_nlink >= REISERFS_LINK_MAX) set_nlink(i, 1); }
  21. #define DEC_DIR_INODE_NLINK(i) if (i->i_nlink != 1) drop_nlink(i);
  22. /*
  23. * directory item contains array of entry headers. This performs
  24. * binary search through that array
  25. */
  26. static int bin_search_in_dir_item(struct reiserfs_dir_entry *de, loff_t off)
  27. {
  28. struct item_head *ih = de->de_ih;
  29. struct reiserfs_de_head *deh = de->de_deh;
  30. int rbound, lbound, j;
  31. lbound = 0;
  32. rbound = ih_entry_count(ih) - 1;
  33. for (j = (rbound + lbound) / 2; lbound <= rbound;
  34. j = (rbound + lbound) / 2) {
  35. if (off < deh_offset(deh + j)) {
  36. rbound = j - 1;
  37. continue;
  38. }
  39. if (off > deh_offset(deh + j)) {
  40. lbound = j + 1;
  41. continue;
  42. }
  43. /* this is not name found, but matched third key component */
  44. de->de_entry_num = j;
  45. return NAME_FOUND;
  46. }
  47. de->de_entry_num = lbound;
  48. return NAME_NOT_FOUND;
  49. }
  50. /*
  51. * comment? maybe something like set de to point to what the path points to?
  52. */
  53. static inline void set_de_item_location(struct reiserfs_dir_entry *de,
  54. struct treepath *path)
  55. {
  56. de->de_bh = get_last_bh(path);
  57. de->de_ih = tp_item_head(path);
  58. de->de_deh = B_I_DEH(de->de_bh, de->de_ih);
  59. de->de_item_num = PATH_LAST_POSITION(path);
  60. }
  61. /*
  62. * de_bh, de_ih, de_deh (points to first element of array), de_item_num is set
  63. */
  64. inline void set_de_name_and_namelen(struct reiserfs_dir_entry *de)
  65. {
  66. struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num;
  67. BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
  68. de->de_entrylen = entry_length(de->de_bh, de->de_ih, de->de_entry_num);
  69. de->de_namelen = de->de_entrylen - (de_with_sd(deh) ? SD_SIZE : 0);
  70. de->de_name = ih_item_body(de->de_bh, de->de_ih) + deh_location(deh);
  71. if (de->de_name[de->de_namelen - 1] == 0)
  72. de->de_namelen = strlen(de->de_name);
  73. }
  74. /* what entry points to */
  75. static inline void set_de_object_key(struct reiserfs_dir_entry *de)
  76. {
  77. BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
  78. de->de_dir_id = deh_dir_id(&de->de_deh[de->de_entry_num]);
  79. de->de_objectid = deh_objectid(&de->de_deh[de->de_entry_num]);
  80. }
  81. static inline void store_de_entry_key(struct reiserfs_dir_entry *de)
  82. {
  83. struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num;
  84. BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
  85. /* store key of the found entry */
  86. de->de_entry_key.version = KEY_FORMAT_3_5;
  87. de->de_entry_key.on_disk_key.k_dir_id =
  88. le32_to_cpu(de->de_ih->ih_key.k_dir_id);
  89. de->de_entry_key.on_disk_key.k_objectid =
  90. le32_to_cpu(de->de_ih->ih_key.k_objectid);
  91. set_cpu_key_k_offset(&de->de_entry_key, deh_offset(deh));
  92. set_cpu_key_k_type(&de->de_entry_key, TYPE_DIRENTRY);
  93. }
  94. /*
  95. * We assign a key to each directory item, and place multiple entries in a
  96. * single directory item. A directory item has a key equal to the key of
  97. * the first directory entry in it.
  98. * This function first calls search_by_key, then, if item whose first entry
  99. * matches is not found it looks for the entry inside directory item found
  100. * by search_by_key. Fills the path to the entry, and to the entry position
  101. * in the item
  102. */
  103. /* The function is NOT SCHEDULE-SAFE! */
  104. int search_by_entry_key(struct super_block *sb, const struct cpu_key *key,
  105. struct treepath *path, struct reiserfs_dir_entry *de)
  106. {
  107. int retval;
  108. retval = search_item(sb, key, path);
  109. switch (retval) {
  110. case ITEM_NOT_FOUND:
  111. if (!PATH_LAST_POSITION(path)) {
  112. reiserfs_error(sb, "vs-7000", "search_by_key "
  113. "returned item position == 0");
  114. pathrelse(path);
  115. return IO_ERROR;
  116. }
  117. PATH_LAST_POSITION(path)--;
  118. break;
  119. case ITEM_FOUND:
  120. break;
  121. case IO_ERROR:
  122. return retval;
  123. default:
  124. pathrelse(path);
  125. reiserfs_error(sb, "vs-7002", "no path to here");
  126. return IO_ERROR;
  127. }
  128. set_de_item_location(de, path);
  129. #ifdef CONFIG_REISERFS_CHECK
  130. if (!is_direntry_le_ih(de->de_ih) ||
  131. COMP_SHORT_KEYS(&de->de_ih->ih_key, key)) {
  132. print_block(de->de_bh, 0, -1, -1);
  133. reiserfs_panic(sb, "vs-7005", "found item %h is not directory "
  134. "item or does not belong to the same directory "
  135. "as key %K", de->de_ih, key);
  136. }
  137. #endif /* CONFIG_REISERFS_CHECK */
  138. /*
  139. * binary search in directory item by third component of the
  140. * key. sets de->de_entry_num of de
  141. */
  142. retval = bin_search_in_dir_item(de, cpu_key_k_offset(key));
  143. path->pos_in_item = de->de_entry_num;
  144. if (retval != NAME_NOT_FOUND) {
  145. /*
  146. * ugly, but rename needs de_bh, de_deh, de_name,
  147. * de_namelen, de_objectid set
  148. */
  149. set_de_name_and_namelen(de);
  150. set_de_object_key(de);
  151. }
  152. return retval;
  153. }
  154. /* Keyed 32-bit hash function using TEA in a Davis-Meyer function */
  155. /*
  156. * The third component is hashed, and you can choose from more than
  157. * one hash function. Per directory hashes are not yet implemented
  158. * but are thought about. This function should be moved to hashes.c
  159. * Jedi, please do so. -Hans
  160. */
  161. static __u32 get_third_component(struct super_block *s,
  162. const char *name, int len)
  163. {
  164. __u32 res;
  165. if (!len || (len == 1 && name[0] == '.'))
  166. return DOT_OFFSET;
  167. if (len == 2 && name[0] == '.' && name[1] == '.')
  168. return DOT_DOT_OFFSET;
  169. res = REISERFS_SB(s)->s_hash_function(name, len);
  170. /* take bits from 7-th to 30-th including both bounds */
  171. res = GET_HASH_VALUE(res);
  172. if (res == 0)
  173. /*
  174. * needed to have no names before "." and ".." those have hash
  175. * value == 0 and generation conters 1 and 2 accordingly
  176. */
  177. res = 128;
  178. return res + MAX_GENERATION_NUMBER;
  179. }
  180. static int reiserfs_match(struct reiserfs_dir_entry *de,
  181. const char *name, int namelen)
  182. {
  183. int retval = NAME_NOT_FOUND;
  184. if ((namelen == de->de_namelen) &&
  185. !memcmp(de->de_name, name, de->de_namelen))
  186. retval =
  187. (de_visible(de->de_deh + de->de_entry_num) ? NAME_FOUND :
  188. NAME_FOUND_INVISIBLE);
  189. return retval;
  190. }
  191. /* de's de_bh, de_ih, de_deh, de_item_num, de_entry_num are set already */
  192. /* used when hash collisions exist */
  193. static int linear_search_in_dir_item(struct cpu_key *key,
  194. struct reiserfs_dir_entry *de,
  195. const char *name, int namelen)
  196. {
  197. struct reiserfs_de_head *deh = de->de_deh;
  198. int retval;
  199. int i;
  200. i = de->de_entry_num;
  201. if (i == ih_entry_count(de->de_ih) ||
  202. GET_HASH_VALUE(deh_offset(deh + i)) !=
  203. GET_HASH_VALUE(cpu_key_k_offset(key))) {
  204. i--;
  205. }
  206. RFALSE(de->de_deh != B_I_DEH(de->de_bh, de->de_ih),
  207. "vs-7010: array of entry headers not found");
  208. deh += i;
  209. for (; i >= 0; i--, deh--) {
  210. /* hash value does not match, no need to check whole name */
  211. if (GET_HASH_VALUE(deh_offset(deh)) !=
  212. GET_HASH_VALUE(cpu_key_k_offset(key))) {
  213. return NAME_NOT_FOUND;
  214. }
  215. /* mark that this generation number is used */
  216. if (de->de_gen_number_bit_string)
  217. set_bit(GET_GENERATION_NUMBER(deh_offset(deh)),
  218. de->de_gen_number_bit_string);
  219. /* calculate pointer to name and namelen */
  220. de->de_entry_num = i;
  221. set_de_name_and_namelen(de);
  222. /*
  223. * de's de_name, de_namelen, de_recordlen are set.
  224. * Fill the rest.
  225. */
  226. if ((retval =
  227. reiserfs_match(de, name, namelen)) != NAME_NOT_FOUND) {
  228. /* key of pointed object */
  229. set_de_object_key(de);
  230. store_de_entry_key(de);
  231. /* retval can be NAME_FOUND or NAME_FOUND_INVISIBLE */
  232. return retval;
  233. }
  234. }
  235. if (GET_GENERATION_NUMBER(le_ih_k_offset(de->de_ih)) == 0)
  236. /*
  237. * we have reached left most entry in the node. In common we
  238. * have to go to the left neighbor, but if generation counter
  239. * is 0 already, we know for sure, that there is no name with
  240. * the same hash value
  241. */
  242. /*
  243. * FIXME: this work correctly only because hash value can not
  244. * be 0. Btw, in case of Yura's hash it is probably possible,
  245. * so, this is a bug
  246. */
  247. return NAME_NOT_FOUND;
  248. RFALSE(de->de_item_num,
  249. "vs-7015: two diritems of the same directory in one node?");
  250. return GOTO_PREVIOUS_ITEM;
  251. }
  252. /*
  253. * may return NAME_FOUND, NAME_FOUND_INVISIBLE, NAME_NOT_FOUND
  254. * FIXME: should add something like IOERROR
  255. */
  256. static int reiserfs_find_entry(struct inode *dir, const char *name, int namelen,
  257. struct treepath *path_to_entry,
  258. struct reiserfs_dir_entry *de)
  259. {
  260. struct cpu_key key_to_search;
  261. int retval;
  262. if (namelen > REISERFS_MAX_NAME(dir->i_sb->s_blocksize))
  263. return NAME_NOT_FOUND;
  264. /* we will search for this key in the tree */
  265. make_cpu_key(&key_to_search, dir,
  266. get_third_component(dir->i_sb, name, namelen),
  267. TYPE_DIRENTRY, 3);
  268. while (1) {
  269. retval =
  270. search_by_entry_key(dir->i_sb, &key_to_search,
  271. path_to_entry, de);
  272. if (retval == IO_ERROR) {
  273. reiserfs_error(dir->i_sb, "zam-7001", "io error");
  274. return IO_ERROR;
  275. }
  276. /* compare names for all entries having given hash value */
  277. retval =
  278. linear_search_in_dir_item(&key_to_search, de, name,
  279. namelen);
  280. /*
  281. * there is no need to scan directory anymore.
  282. * Given entry found or does not exist
  283. */
  284. if (retval != GOTO_PREVIOUS_ITEM) {
  285. path_to_entry->pos_in_item = de->de_entry_num;
  286. return retval;
  287. }
  288. /*
  289. * there is left neighboring item of this directory
  290. * and given entry can be there
  291. */
  292. set_cpu_key_k_offset(&key_to_search,
  293. le_ih_k_offset(de->de_ih) - 1);
  294. pathrelse(path_to_entry);
  295. } /* while (1) */
  296. }
  297. static struct dentry *reiserfs_lookup(struct inode *dir, struct dentry *dentry,
  298. unsigned int flags)
  299. {
  300. int retval;
  301. struct inode *inode = NULL;
  302. struct reiserfs_dir_entry de;
  303. INITIALIZE_PATH(path_to_entry);
  304. if (REISERFS_MAX_NAME(dir->i_sb->s_blocksize) < dentry->d_name.len)
  305. return ERR_PTR(-ENAMETOOLONG);
  306. reiserfs_write_lock(dir->i_sb);
  307. de.de_gen_number_bit_string = NULL;
  308. retval =
  309. reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
  310. &path_to_entry, &de);
  311. pathrelse(&path_to_entry);
  312. if (retval == NAME_FOUND) {
  313. inode = reiserfs_iget(dir->i_sb,
  314. (struct cpu_key *)&de.de_dir_id);
  315. if (!inode || IS_ERR(inode)) {
  316. reiserfs_write_unlock(dir->i_sb);
  317. return ERR_PTR(-EACCES);
  318. }
  319. /*
  320. * Propagate the private flag so we know we're
  321. * in the priv tree. Also clear IOP_XATTR
  322. * since we don't have xattrs on xattr files.
  323. */
  324. if (IS_PRIVATE(dir)) {
  325. inode->i_flags |= S_PRIVATE;
  326. inode->i_opflags &= ~IOP_XATTR;
  327. }
  328. }
  329. reiserfs_write_unlock(dir->i_sb);
  330. if (retval == IO_ERROR) {
  331. return ERR_PTR(-EIO);
  332. }
  333. return d_splice_alias(inode, dentry);
  334. }
  335. /*
  336. * looks up the dentry of the parent directory for child.
  337. * taken from ext2_get_parent
  338. */
  339. struct dentry *reiserfs_get_parent(struct dentry *child)
  340. {
  341. int retval;
  342. struct inode *inode = NULL;
  343. struct reiserfs_dir_entry de;
  344. INITIALIZE_PATH(path_to_entry);
  345. struct inode *dir = d_inode(child);
  346. if (dir->i_nlink == 0) {
  347. return ERR_PTR(-ENOENT);
  348. }
  349. de.de_gen_number_bit_string = NULL;
  350. reiserfs_write_lock(dir->i_sb);
  351. retval = reiserfs_find_entry(dir, "..", 2, &path_to_entry, &de);
  352. pathrelse(&path_to_entry);
  353. if (retval != NAME_FOUND) {
  354. reiserfs_write_unlock(dir->i_sb);
  355. return ERR_PTR(-ENOENT);
  356. }
  357. inode = reiserfs_iget(dir->i_sb, (struct cpu_key *)&de.de_dir_id);
  358. reiserfs_write_unlock(dir->i_sb);
  359. return d_obtain_alias(inode);
  360. }
  361. /* add entry to the directory (entry can be hidden).
  362. insert definition of when hidden directories are used here -Hans
  363. Does not mark dir inode dirty, do it after successesfull call to it */
  364. static int reiserfs_add_entry(struct reiserfs_transaction_handle *th,
  365. struct inode *dir, const char *name, int namelen,
  366. struct inode *inode, int visible)
  367. {
  368. struct cpu_key entry_key;
  369. struct reiserfs_de_head *deh;
  370. INITIALIZE_PATH(path);
  371. struct reiserfs_dir_entry de;
  372. DECLARE_BITMAP(bit_string, MAX_GENERATION_NUMBER + 1);
  373. int gen_number;
  374. /*
  375. * 48 bytes now and we avoid kmalloc if we
  376. * create file with short name
  377. */
  378. char small_buf[32 + DEH_SIZE];
  379. char *buffer;
  380. int buflen, paste_size;
  381. int retval;
  382. BUG_ON(!th->t_trans_id);
  383. /* cannot allow items to be added into a busy deleted directory */
  384. if (!namelen)
  385. return -EINVAL;
  386. if (namelen > REISERFS_MAX_NAME(dir->i_sb->s_blocksize))
  387. return -ENAMETOOLONG;
  388. /* each entry has unique key. compose it */
  389. make_cpu_key(&entry_key, dir,
  390. get_third_component(dir->i_sb, name, namelen),
  391. TYPE_DIRENTRY, 3);
  392. /* get memory for composing the entry */
  393. buflen = DEH_SIZE + ROUND_UP(namelen);
  394. if (buflen > sizeof(small_buf)) {
  395. buffer = kmalloc(buflen, GFP_NOFS);
  396. if (!buffer)
  397. return -ENOMEM;
  398. } else
  399. buffer = small_buf;
  400. paste_size =
  401. (get_inode_sd_version(dir) ==
  402. STAT_DATA_V1) ? (DEH_SIZE + namelen) : buflen;
  403. /*
  404. * fill buffer : directory entry head, name[, dir objectid | ,
  405. * stat data | ,stat data, dir objectid ]
  406. */
  407. deh = (struct reiserfs_de_head *)buffer;
  408. deh->deh_location = 0; /* JDM Endian safe if 0 */
  409. put_deh_offset(deh, cpu_key_k_offset(&entry_key));
  410. deh->deh_state = 0; /* JDM Endian safe if 0 */
  411. /* put key (ino analog) to de */
  412. /* safe: k_dir_id is le */
  413. deh->deh_dir_id = INODE_PKEY(inode)->k_dir_id;
  414. /* safe: k_objectid is le */
  415. deh->deh_objectid = INODE_PKEY(inode)->k_objectid;
  416. /* copy name */
  417. memcpy((char *)(deh + 1), name, namelen);
  418. /* padd by 0s to the 4 byte boundary */
  419. padd_item((char *)(deh + 1), ROUND_UP(namelen), namelen);
  420. /*
  421. * entry is ready to be pasted into tree, set 'visibility'
  422. * and 'stat data in entry' attributes
  423. */
  424. mark_de_without_sd(deh);
  425. visible ? mark_de_visible(deh) : mark_de_hidden(deh);
  426. /* find the proper place for the new entry */
  427. memset(bit_string, 0, sizeof(bit_string));
  428. de.de_gen_number_bit_string = bit_string;
  429. retval = reiserfs_find_entry(dir, name, namelen, &path, &de);
  430. if (retval != NAME_NOT_FOUND) {
  431. if (buffer != small_buf)
  432. kfree(buffer);
  433. pathrelse(&path);
  434. if (retval == IO_ERROR) {
  435. return -EIO;
  436. }
  437. if (retval != NAME_FOUND) {
  438. reiserfs_error(dir->i_sb, "zam-7002",
  439. "reiserfs_find_entry() returned "
  440. "unexpected value (%d)", retval);
  441. }
  442. return -EEXIST;
  443. }
  444. gen_number =
  445. find_first_zero_bit(bit_string,
  446. MAX_GENERATION_NUMBER + 1);
  447. if (gen_number > MAX_GENERATION_NUMBER) {
  448. /* there is no free generation number */
  449. reiserfs_warning(dir->i_sb, "reiserfs-7010",
  450. "Congratulations! we have got hash function "
  451. "screwed up");
  452. if (buffer != small_buf)
  453. kfree(buffer);
  454. pathrelse(&path);
  455. return -EBUSY;
  456. }
  457. /* adjust offset of directory enrty */
  458. put_deh_offset(deh, SET_GENERATION_NUMBER(deh_offset(deh), gen_number));
  459. set_cpu_key_k_offset(&entry_key, deh_offset(deh));
  460. /* update max-hash-collisions counter in reiserfs_sb_info */
  461. PROC_INFO_MAX(th->t_super, max_hash_collisions, gen_number);
  462. /* we need to re-search for the insertion point */
  463. if (gen_number != 0) {
  464. if (search_by_entry_key(dir->i_sb, &entry_key, &path, &de) !=
  465. NAME_NOT_FOUND) {
  466. reiserfs_warning(dir->i_sb, "vs-7032",
  467. "entry with this key (%K) already "
  468. "exists", &entry_key);
  469. if (buffer != small_buf)
  470. kfree(buffer);
  471. pathrelse(&path);
  472. return -EBUSY;
  473. }
  474. }
  475. /* perform the insertion of the entry that we have prepared */
  476. retval =
  477. reiserfs_paste_into_item(th, &path, &entry_key, dir, buffer,
  478. paste_size);
  479. if (buffer != small_buf)
  480. kfree(buffer);
  481. if (retval) {
  482. reiserfs_check_path(&path);
  483. return retval;
  484. }
  485. dir->i_size += paste_size;
  486. dir->i_mtime = dir->i_ctime = current_time(dir);
  487. if (!S_ISDIR(inode->i_mode) && visible)
  488. /* reiserfs_mkdir or reiserfs_rename will do that by itself */
  489. reiserfs_update_sd(th, dir);
  490. reiserfs_check_path(&path);
  491. return 0;
  492. }
  493. /*
  494. * quota utility function, call if you've had to abort after calling
  495. * new_inode_init, and have not called reiserfs_new_inode yet.
  496. * This should only be called on inodes that do not have stat data
  497. * inserted into the tree yet.
  498. */
  499. static int drop_new_inode(struct inode *inode)
  500. {
  501. dquot_drop(inode);
  502. make_bad_inode(inode);
  503. inode->i_flags |= S_NOQUOTA;
  504. iput(inode);
  505. return 0;
  506. }
  507. /*
  508. * utility function that does setup for reiserfs_new_inode.
  509. * dquot_initialize needs lots of credits so it's better to have it
  510. * outside of a transaction, so we had to pull some bits of
  511. * reiserfs_new_inode out into this func.
  512. */
  513. static int new_inode_init(struct inode *inode, struct inode *dir, umode_t mode)
  514. {
  515. /*
  516. * Make inode invalid - just in case we are going to drop it before
  517. * the initialization happens
  518. */
  519. INODE_PKEY(inode)->k_objectid = 0;
  520. /*
  521. * the quota init calls have to know who to charge the quota to, so
  522. * we have to set uid and gid here
  523. */
  524. inode_init_owner(&init_user_ns, inode, dir, mode);
  525. return dquot_initialize(inode);
  526. }
  527. static int reiserfs_create(struct user_namespace *mnt_userns, struct inode *dir,
  528. struct dentry *dentry, umode_t mode, bool excl)
  529. {
  530. int retval;
  531. struct inode *inode;
  532. /*
  533. * We need blocks for transaction + (user+group)*(quotas
  534. * for new inode + update of quota for directory owner)
  535. */
  536. int jbegin_count =
  537. JOURNAL_PER_BALANCE_CNT * 2 +
  538. 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
  539. REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
  540. struct reiserfs_transaction_handle th;
  541. struct reiserfs_security_handle security;
  542. retval = dquot_initialize(dir);
  543. if (retval)
  544. return retval;
  545. if (!(inode = new_inode(dir->i_sb))) {
  546. return -ENOMEM;
  547. }
  548. retval = new_inode_init(inode, dir, mode);
  549. if (retval) {
  550. drop_new_inode(inode);
  551. return retval;
  552. }
  553. jbegin_count += reiserfs_cache_default_acl(dir);
  554. retval = reiserfs_security_init(dir, inode, &dentry->d_name, &security);
  555. if (retval < 0) {
  556. drop_new_inode(inode);
  557. return retval;
  558. }
  559. jbegin_count += retval;
  560. reiserfs_write_lock(dir->i_sb);
  561. retval = journal_begin(&th, dir->i_sb, jbegin_count);
  562. if (retval) {
  563. drop_new_inode(inode);
  564. goto out_failed;
  565. }
  566. retval =
  567. reiserfs_new_inode(&th, dir, mode, NULL, 0 /*i_size */ , dentry,
  568. inode, &security);
  569. if (retval)
  570. goto out_failed;
  571. inode->i_op = &reiserfs_file_inode_operations;
  572. inode->i_fop = &reiserfs_file_operations;
  573. inode->i_mapping->a_ops = &reiserfs_address_space_operations;
  574. retval =
  575. reiserfs_add_entry(&th, dir, dentry->d_name.name,
  576. dentry->d_name.len, inode, 1 /*visible */ );
  577. if (retval) {
  578. int err;
  579. drop_nlink(inode);
  580. reiserfs_update_sd(&th, inode);
  581. err = journal_end(&th);
  582. if (err)
  583. retval = err;
  584. unlock_new_inode(inode);
  585. iput(inode);
  586. goto out_failed;
  587. }
  588. reiserfs_update_inode_transaction(inode);
  589. reiserfs_update_inode_transaction(dir);
  590. d_instantiate_new(dentry, inode);
  591. retval = journal_end(&th);
  592. out_failed:
  593. reiserfs_write_unlock(dir->i_sb);
  594. reiserfs_security_free(&security);
  595. return retval;
  596. }
  597. static int reiserfs_mknod(struct user_namespace *mnt_userns, struct inode *dir,
  598. struct dentry *dentry, umode_t mode, dev_t rdev)
  599. {
  600. int retval;
  601. struct inode *inode;
  602. struct reiserfs_transaction_handle th;
  603. struct reiserfs_security_handle security;
  604. /*
  605. * We need blocks for transaction + (user+group)*(quotas
  606. * for new inode + update of quota for directory owner)
  607. */
  608. int jbegin_count =
  609. JOURNAL_PER_BALANCE_CNT * 3 +
  610. 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
  611. REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
  612. retval = dquot_initialize(dir);
  613. if (retval)
  614. return retval;
  615. if (!(inode = new_inode(dir->i_sb))) {
  616. return -ENOMEM;
  617. }
  618. retval = new_inode_init(inode, dir, mode);
  619. if (retval) {
  620. drop_new_inode(inode);
  621. return retval;
  622. }
  623. jbegin_count += reiserfs_cache_default_acl(dir);
  624. retval = reiserfs_security_init(dir, inode, &dentry->d_name, &security);
  625. if (retval < 0) {
  626. drop_new_inode(inode);
  627. return retval;
  628. }
  629. jbegin_count += retval;
  630. reiserfs_write_lock(dir->i_sb);
  631. retval = journal_begin(&th, dir->i_sb, jbegin_count);
  632. if (retval) {
  633. drop_new_inode(inode);
  634. goto out_failed;
  635. }
  636. retval =
  637. reiserfs_new_inode(&th, dir, mode, NULL, 0 /*i_size */ , dentry,
  638. inode, &security);
  639. if (retval) {
  640. goto out_failed;
  641. }
  642. inode->i_op = &reiserfs_special_inode_operations;
  643. init_special_inode(inode, inode->i_mode, rdev);
  644. /* FIXME: needed for block and char devices only */
  645. reiserfs_update_sd(&th, inode);
  646. reiserfs_update_inode_transaction(inode);
  647. reiserfs_update_inode_transaction(dir);
  648. retval =
  649. reiserfs_add_entry(&th, dir, dentry->d_name.name,
  650. dentry->d_name.len, inode, 1 /*visible */ );
  651. if (retval) {
  652. int err;
  653. drop_nlink(inode);
  654. reiserfs_update_sd(&th, inode);
  655. err = journal_end(&th);
  656. if (err)
  657. retval = err;
  658. unlock_new_inode(inode);
  659. iput(inode);
  660. goto out_failed;
  661. }
  662. d_instantiate_new(dentry, inode);
  663. retval = journal_end(&th);
  664. out_failed:
  665. reiserfs_write_unlock(dir->i_sb);
  666. reiserfs_security_free(&security);
  667. return retval;
  668. }
  669. static int reiserfs_mkdir(struct user_namespace *mnt_userns, struct inode *dir,
  670. struct dentry *dentry, umode_t mode)
  671. {
  672. int retval;
  673. struct inode *inode;
  674. struct reiserfs_transaction_handle th;
  675. struct reiserfs_security_handle security;
  676. /*
  677. * We need blocks for transaction + (user+group)*(quotas
  678. * for new inode + update of quota for directory owner)
  679. */
  680. int jbegin_count =
  681. JOURNAL_PER_BALANCE_CNT * 3 +
  682. 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
  683. REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
  684. retval = dquot_initialize(dir);
  685. if (retval)
  686. return retval;
  687. #ifdef DISPLACE_NEW_PACKING_LOCALITIES
  688. /*
  689. * set flag that new packing locality created and new blocks
  690. * for the content of that directory are not displaced yet
  691. */
  692. REISERFS_I(dir)->new_packing_locality = 1;
  693. #endif
  694. mode = S_IFDIR | mode;
  695. if (!(inode = new_inode(dir->i_sb))) {
  696. return -ENOMEM;
  697. }
  698. retval = new_inode_init(inode, dir, mode);
  699. if (retval) {
  700. drop_new_inode(inode);
  701. return retval;
  702. }
  703. jbegin_count += reiserfs_cache_default_acl(dir);
  704. retval = reiserfs_security_init(dir, inode, &dentry->d_name, &security);
  705. if (retval < 0) {
  706. drop_new_inode(inode);
  707. return retval;
  708. }
  709. jbegin_count += retval;
  710. reiserfs_write_lock(dir->i_sb);
  711. retval = journal_begin(&th, dir->i_sb, jbegin_count);
  712. if (retval) {
  713. drop_new_inode(inode);
  714. goto out_failed;
  715. }
  716. /*
  717. * inc the link count now, so another writer doesn't overflow
  718. * it while we sleep later on.
  719. */
  720. INC_DIR_INODE_NLINK(dir)
  721. retval = reiserfs_new_inode(&th, dir, mode, NULL /*symlink */,
  722. old_format_only(dir->i_sb) ?
  723. EMPTY_DIR_SIZE_V1 : EMPTY_DIR_SIZE,
  724. dentry, inode, &security);
  725. if (retval) {
  726. DEC_DIR_INODE_NLINK(dir)
  727. goto out_failed;
  728. }
  729. reiserfs_update_inode_transaction(inode);
  730. reiserfs_update_inode_transaction(dir);
  731. inode->i_op = &reiserfs_dir_inode_operations;
  732. inode->i_fop = &reiserfs_dir_operations;
  733. /* note, _this_ add_entry will not update dir's stat data */
  734. retval =
  735. reiserfs_add_entry(&th, dir, dentry->d_name.name,
  736. dentry->d_name.len, inode, 1 /*visible */ );
  737. if (retval) {
  738. int err;
  739. clear_nlink(inode);
  740. DEC_DIR_INODE_NLINK(dir);
  741. reiserfs_update_sd(&th, inode);
  742. err = journal_end(&th);
  743. if (err)
  744. retval = err;
  745. unlock_new_inode(inode);
  746. iput(inode);
  747. goto out_failed;
  748. }
  749. /* the above add_entry did not update dir's stat data */
  750. reiserfs_update_sd(&th, dir);
  751. d_instantiate_new(dentry, inode);
  752. retval = journal_end(&th);
  753. out_failed:
  754. reiserfs_write_unlock(dir->i_sb);
  755. reiserfs_security_free(&security);
  756. return retval;
  757. }
  758. static inline int reiserfs_empty_dir(struct inode *inode)
  759. {
  760. /*
  761. * we can cheat because an old format dir cannot have
  762. * EMPTY_DIR_SIZE, and a new format dir cannot have
  763. * EMPTY_DIR_SIZE_V1. So, if the inode is either size,
  764. * regardless of disk format version, the directory is empty.
  765. */
  766. if (inode->i_size != EMPTY_DIR_SIZE &&
  767. inode->i_size != EMPTY_DIR_SIZE_V1) {
  768. return 0;
  769. }
  770. return 1;
  771. }
  772. static int reiserfs_rmdir(struct inode *dir, struct dentry *dentry)
  773. {
  774. int retval, err;
  775. struct inode *inode;
  776. struct reiserfs_transaction_handle th;
  777. int jbegin_count;
  778. INITIALIZE_PATH(path);
  779. struct reiserfs_dir_entry de;
  780. /*
  781. * we will be doing 2 balancings and update 2 stat data, we
  782. * change quotas of the owner of the directory and of the owner
  783. * of the parent directory. The quota structure is possibly
  784. * deleted only on last iput => outside of this transaction
  785. */
  786. jbegin_count =
  787. JOURNAL_PER_BALANCE_CNT * 2 + 2 +
  788. 4 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
  789. retval = dquot_initialize(dir);
  790. if (retval)
  791. return retval;
  792. reiserfs_write_lock(dir->i_sb);
  793. retval = journal_begin(&th, dir->i_sb, jbegin_count);
  794. if (retval)
  795. goto out_rmdir;
  796. de.de_gen_number_bit_string = NULL;
  797. if ((retval =
  798. reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
  799. &path, &de)) == NAME_NOT_FOUND) {
  800. retval = -ENOENT;
  801. goto end_rmdir;
  802. } else if (retval == IO_ERROR) {
  803. retval = -EIO;
  804. goto end_rmdir;
  805. }
  806. inode = d_inode(dentry);
  807. reiserfs_update_inode_transaction(inode);
  808. reiserfs_update_inode_transaction(dir);
  809. if (de.de_objectid != inode->i_ino) {
  810. /*
  811. * FIXME: compare key of an object and a key found in the entry
  812. */
  813. retval = -EIO;
  814. goto end_rmdir;
  815. }
  816. if (!reiserfs_empty_dir(inode)) {
  817. retval = -ENOTEMPTY;
  818. goto end_rmdir;
  819. }
  820. /* cut entry from dir directory */
  821. retval = reiserfs_cut_from_item(&th, &path, &de.de_entry_key,
  822. dir, NULL, /* page */
  823. 0 /*new file size - not used here */ );
  824. if (retval < 0)
  825. goto end_rmdir;
  826. if (inode->i_nlink != 2 && inode->i_nlink != 1)
  827. reiserfs_error(inode->i_sb, "reiserfs-7040",
  828. "empty directory has nlink != 2 (%d)",
  829. inode->i_nlink);
  830. clear_nlink(inode);
  831. inode->i_ctime = dir->i_ctime = dir->i_mtime = current_time(dir);
  832. reiserfs_update_sd(&th, inode);
  833. DEC_DIR_INODE_NLINK(dir)
  834. dir->i_size -= (DEH_SIZE + de.de_entrylen);
  835. reiserfs_update_sd(&th, dir);
  836. /* prevent empty directory from getting lost */
  837. add_save_link(&th, inode, 0 /* not truncate */ );
  838. retval = journal_end(&th);
  839. reiserfs_check_path(&path);
  840. out_rmdir:
  841. reiserfs_write_unlock(dir->i_sb);
  842. return retval;
  843. end_rmdir:
  844. /*
  845. * we must release path, because we did not call
  846. * reiserfs_cut_from_item, or reiserfs_cut_from_item does not
  847. * release path if operation was not complete
  848. */
  849. pathrelse(&path);
  850. err = journal_end(&th);
  851. reiserfs_write_unlock(dir->i_sb);
  852. return err ? err : retval;
  853. }
  854. static int reiserfs_unlink(struct inode *dir, struct dentry *dentry)
  855. {
  856. int retval, err;
  857. struct inode *inode;
  858. struct reiserfs_dir_entry de;
  859. INITIALIZE_PATH(path);
  860. struct reiserfs_transaction_handle th;
  861. int jbegin_count;
  862. unsigned long savelink;
  863. retval = dquot_initialize(dir);
  864. if (retval)
  865. return retval;
  866. inode = d_inode(dentry);
  867. /*
  868. * in this transaction we can be doing at max two balancings and
  869. * update two stat datas, we change quotas of the owner of the
  870. * directory and of the owner of the parent directory. The quota
  871. * structure is possibly deleted only on iput => outside of
  872. * this transaction
  873. */
  874. jbegin_count =
  875. JOURNAL_PER_BALANCE_CNT * 2 + 2 +
  876. 4 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
  877. reiserfs_write_lock(dir->i_sb);
  878. retval = journal_begin(&th, dir->i_sb, jbegin_count);
  879. if (retval)
  880. goto out_unlink;
  881. de.de_gen_number_bit_string = NULL;
  882. if ((retval =
  883. reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
  884. &path, &de)) == NAME_NOT_FOUND) {
  885. retval = -ENOENT;
  886. goto end_unlink;
  887. } else if (retval == IO_ERROR) {
  888. retval = -EIO;
  889. goto end_unlink;
  890. }
  891. reiserfs_update_inode_transaction(inode);
  892. reiserfs_update_inode_transaction(dir);
  893. if (de.de_objectid != inode->i_ino) {
  894. /*
  895. * FIXME: compare key of an object and a key found in the entry
  896. */
  897. retval = -EIO;
  898. goto end_unlink;
  899. }
  900. if (!inode->i_nlink) {
  901. reiserfs_warning(inode->i_sb, "reiserfs-7042",
  902. "deleting nonexistent file (%lu), %d",
  903. inode->i_ino, inode->i_nlink);
  904. set_nlink(inode, 1);
  905. }
  906. drop_nlink(inode);
  907. /*
  908. * we schedule before doing the add_save_link call, save the link
  909. * count so we don't race
  910. */
  911. savelink = inode->i_nlink;
  912. retval =
  913. reiserfs_cut_from_item(&th, &path, &de.de_entry_key, dir, NULL,
  914. 0);
  915. if (retval < 0) {
  916. inc_nlink(inode);
  917. goto end_unlink;
  918. }
  919. inode->i_ctime = current_time(inode);
  920. reiserfs_update_sd(&th, inode);
  921. dir->i_size -= (de.de_entrylen + DEH_SIZE);
  922. dir->i_ctime = dir->i_mtime = current_time(dir);
  923. reiserfs_update_sd(&th, dir);
  924. if (!savelink)
  925. /* prevent file from getting lost */
  926. add_save_link(&th, inode, 0 /* not truncate */ );
  927. retval = journal_end(&th);
  928. reiserfs_check_path(&path);
  929. reiserfs_write_unlock(dir->i_sb);
  930. return retval;
  931. end_unlink:
  932. pathrelse(&path);
  933. err = journal_end(&th);
  934. reiserfs_check_path(&path);
  935. if (err)
  936. retval = err;
  937. out_unlink:
  938. reiserfs_write_unlock(dir->i_sb);
  939. return retval;
  940. }
  941. static int reiserfs_symlink(struct user_namespace *mnt_userns,
  942. struct inode *parent_dir, struct dentry *dentry,
  943. const char *symname)
  944. {
  945. int retval;
  946. struct inode *inode;
  947. char *name;
  948. int item_len;
  949. struct reiserfs_transaction_handle th;
  950. struct reiserfs_security_handle security;
  951. int mode = S_IFLNK | S_IRWXUGO;
  952. /*
  953. * We need blocks for transaction + (user+group)*(quotas for
  954. * new inode + update of quota for directory owner)
  955. */
  956. int jbegin_count =
  957. JOURNAL_PER_BALANCE_CNT * 3 +
  958. 2 * (REISERFS_QUOTA_INIT_BLOCKS(parent_dir->i_sb) +
  959. REISERFS_QUOTA_TRANS_BLOCKS(parent_dir->i_sb));
  960. retval = dquot_initialize(parent_dir);
  961. if (retval)
  962. return retval;
  963. if (!(inode = new_inode(parent_dir->i_sb))) {
  964. return -ENOMEM;
  965. }
  966. retval = new_inode_init(inode, parent_dir, mode);
  967. if (retval) {
  968. drop_new_inode(inode);
  969. return retval;
  970. }
  971. retval = reiserfs_security_init(parent_dir, inode, &dentry->d_name,
  972. &security);
  973. if (retval < 0) {
  974. drop_new_inode(inode);
  975. return retval;
  976. }
  977. jbegin_count += retval;
  978. reiserfs_write_lock(parent_dir->i_sb);
  979. item_len = ROUND_UP(strlen(symname));
  980. if (item_len > MAX_DIRECT_ITEM_LEN(parent_dir->i_sb->s_blocksize)) {
  981. retval = -ENAMETOOLONG;
  982. drop_new_inode(inode);
  983. goto out_failed;
  984. }
  985. name = kmalloc(item_len, GFP_NOFS);
  986. if (!name) {
  987. drop_new_inode(inode);
  988. retval = -ENOMEM;
  989. goto out_failed;
  990. }
  991. memcpy(name, symname, strlen(symname));
  992. padd_item(name, item_len, strlen(symname));
  993. retval = journal_begin(&th, parent_dir->i_sb, jbegin_count);
  994. if (retval) {
  995. drop_new_inode(inode);
  996. kfree(name);
  997. goto out_failed;
  998. }
  999. retval =
  1000. reiserfs_new_inode(&th, parent_dir, mode, name, strlen(symname),
  1001. dentry, inode, &security);
  1002. kfree(name);
  1003. if (retval) { /* reiserfs_new_inode iputs for us */
  1004. goto out_failed;
  1005. }
  1006. reiserfs_update_inode_transaction(inode);
  1007. reiserfs_update_inode_transaction(parent_dir);
  1008. inode->i_op = &reiserfs_symlink_inode_operations;
  1009. inode_nohighmem(inode);
  1010. inode->i_mapping->a_ops = &reiserfs_address_space_operations;
  1011. retval = reiserfs_add_entry(&th, parent_dir, dentry->d_name.name,
  1012. dentry->d_name.len, inode, 1 /*visible */ );
  1013. if (retval) {
  1014. int err;
  1015. drop_nlink(inode);
  1016. reiserfs_update_sd(&th, inode);
  1017. err = journal_end(&th);
  1018. if (err)
  1019. retval = err;
  1020. unlock_new_inode(inode);
  1021. iput(inode);
  1022. goto out_failed;
  1023. }
  1024. d_instantiate_new(dentry, inode);
  1025. retval = journal_end(&th);
  1026. out_failed:
  1027. reiserfs_write_unlock(parent_dir->i_sb);
  1028. reiserfs_security_free(&security);
  1029. return retval;
  1030. }
  1031. static int reiserfs_link(struct dentry *old_dentry, struct inode *dir,
  1032. struct dentry *dentry)
  1033. {
  1034. int retval;
  1035. struct inode *inode = d_inode(old_dentry);
  1036. struct reiserfs_transaction_handle th;
  1037. /*
  1038. * We need blocks for transaction + update of quotas for
  1039. * the owners of the directory
  1040. */
  1041. int jbegin_count =
  1042. JOURNAL_PER_BALANCE_CNT * 3 +
  1043. 2 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
  1044. retval = dquot_initialize(dir);
  1045. if (retval)
  1046. return retval;
  1047. reiserfs_write_lock(dir->i_sb);
  1048. if (inode->i_nlink >= REISERFS_LINK_MAX) {
  1049. /* FIXME: sd_nlink is 32 bit for new files */
  1050. reiserfs_write_unlock(dir->i_sb);
  1051. return -EMLINK;
  1052. }
  1053. /* inc before scheduling so reiserfs_unlink knows we are here */
  1054. inc_nlink(inode);
  1055. retval = journal_begin(&th, dir->i_sb, jbegin_count);
  1056. if (retval) {
  1057. drop_nlink(inode);
  1058. reiserfs_write_unlock(dir->i_sb);
  1059. return retval;
  1060. }
  1061. /* create new entry */
  1062. retval =
  1063. reiserfs_add_entry(&th, dir, dentry->d_name.name,
  1064. dentry->d_name.len, inode, 1 /*visible */ );
  1065. reiserfs_update_inode_transaction(inode);
  1066. reiserfs_update_inode_transaction(dir);
  1067. if (retval) {
  1068. int err;
  1069. drop_nlink(inode);
  1070. err = journal_end(&th);
  1071. reiserfs_write_unlock(dir->i_sb);
  1072. return err ? err : retval;
  1073. }
  1074. inode->i_ctime = current_time(inode);
  1075. reiserfs_update_sd(&th, inode);
  1076. ihold(inode);
  1077. d_instantiate(dentry, inode);
  1078. retval = journal_end(&th);
  1079. reiserfs_write_unlock(dir->i_sb);
  1080. return retval;
  1081. }
  1082. /* de contains information pointing to an entry which */
  1083. static int de_still_valid(const char *name, int len,
  1084. struct reiserfs_dir_entry *de)
  1085. {
  1086. struct reiserfs_dir_entry tmp = *de;
  1087. /* recalculate pointer to name and name length */
  1088. set_de_name_and_namelen(&tmp);
  1089. /* FIXME: could check more */
  1090. if (tmp.de_namelen != len || memcmp(name, de->de_name, len))
  1091. return 0;
  1092. return 1;
  1093. }
  1094. static int entry_points_to_object(const char *name, int len,
  1095. struct reiserfs_dir_entry *de,
  1096. struct inode *inode)
  1097. {
  1098. if (!de_still_valid(name, len, de))
  1099. return 0;
  1100. if (inode) {
  1101. if (!de_visible(de->de_deh + de->de_entry_num))
  1102. reiserfs_panic(inode->i_sb, "vs-7042",
  1103. "entry must be visible");
  1104. return (de->de_objectid == inode->i_ino) ? 1 : 0;
  1105. }
  1106. /* this must be added hidden entry */
  1107. if (de_visible(de->de_deh + de->de_entry_num))
  1108. reiserfs_panic(NULL, "vs-7043", "entry must be visible");
  1109. return 1;
  1110. }
  1111. /* sets key of objectid the entry has to point to */
  1112. static void set_ino_in_dir_entry(struct reiserfs_dir_entry *de,
  1113. struct reiserfs_key *key)
  1114. {
  1115. /* JDM These operations are endian safe - both are le */
  1116. de->de_deh[de->de_entry_num].deh_dir_id = key->k_dir_id;
  1117. de->de_deh[de->de_entry_num].deh_objectid = key->k_objectid;
  1118. }
  1119. /*
  1120. * process, that is going to call fix_nodes/do_balance must hold only
  1121. * one path. If it holds 2 or more, it can get into endless waiting in
  1122. * get_empty_nodes or its clones
  1123. */
  1124. static int reiserfs_rename(struct user_namespace *mnt_userns,
  1125. struct inode *old_dir, struct dentry *old_dentry,
  1126. struct inode *new_dir, struct dentry *new_dentry,
  1127. unsigned int flags)
  1128. {
  1129. int retval;
  1130. INITIALIZE_PATH(old_entry_path);
  1131. INITIALIZE_PATH(new_entry_path);
  1132. INITIALIZE_PATH(dot_dot_entry_path);
  1133. struct item_head new_entry_ih, old_entry_ih, dot_dot_ih;
  1134. struct reiserfs_dir_entry old_de, new_de, dot_dot_de;
  1135. struct inode *old_inode, *new_dentry_inode;
  1136. struct reiserfs_transaction_handle th;
  1137. int jbegin_count;
  1138. umode_t old_inode_mode;
  1139. unsigned long savelink = 1;
  1140. struct timespec64 ctime;
  1141. if (flags & ~RENAME_NOREPLACE)
  1142. return -EINVAL;
  1143. /*
  1144. * three balancings: (1) old name removal, (2) new name insertion
  1145. * and (3) maybe "save" link insertion
  1146. * stat data updates: (1) old directory,
  1147. * (2) new directory and (3) maybe old object stat data (when it is
  1148. * directory) and (4) maybe stat data of object to which new entry
  1149. * pointed initially and (5) maybe block containing ".." of
  1150. * renamed directory
  1151. * quota updates: two parent directories
  1152. */
  1153. jbegin_count =
  1154. JOURNAL_PER_BALANCE_CNT * 3 + 5 +
  1155. 4 * REISERFS_QUOTA_TRANS_BLOCKS(old_dir->i_sb);
  1156. retval = dquot_initialize(old_dir);
  1157. if (retval)
  1158. return retval;
  1159. retval = dquot_initialize(new_dir);
  1160. if (retval)
  1161. return retval;
  1162. old_inode = d_inode(old_dentry);
  1163. new_dentry_inode = d_inode(new_dentry);
  1164. /*
  1165. * make sure that oldname still exists and points to an object we
  1166. * are going to rename
  1167. */
  1168. old_de.de_gen_number_bit_string = NULL;
  1169. reiserfs_write_lock(old_dir->i_sb);
  1170. retval =
  1171. reiserfs_find_entry(old_dir, old_dentry->d_name.name,
  1172. old_dentry->d_name.len, &old_entry_path,
  1173. &old_de);
  1174. pathrelse(&old_entry_path);
  1175. if (retval == IO_ERROR) {
  1176. reiserfs_write_unlock(old_dir->i_sb);
  1177. return -EIO;
  1178. }
  1179. if (retval != NAME_FOUND || old_de.de_objectid != old_inode->i_ino) {
  1180. reiserfs_write_unlock(old_dir->i_sb);
  1181. return -ENOENT;
  1182. }
  1183. old_inode_mode = old_inode->i_mode;
  1184. if (S_ISDIR(old_inode_mode)) {
  1185. /*
  1186. * make sure that directory being renamed has correct ".."
  1187. * and that its new parent directory has not too many links
  1188. * already
  1189. */
  1190. if (new_dentry_inode) {
  1191. if (!reiserfs_empty_dir(new_dentry_inode)) {
  1192. reiserfs_write_unlock(old_dir->i_sb);
  1193. return -ENOTEMPTY;
  1194. }
  1195. }
  1196. /*
  1197. * directory is renamed, its parent directory will be changed,
  1198. * so find ".." entry
  1199. */
  1200. dot_dot_de.de_gen_number_bit_string = NULL;
  1201. retval =
  1202. reiserfs_find_entry(old_inode, "..", 2, &dot_dot_entry_path,
  1203. &dot_dot_de);
  1204. pathrelse(&dot_dot_entry_path);
  1205. if (retval != NAME_FOUND) {
  1206. reiserfs_write_unlock(old_dir->i_sb);
  1207. return -EIO;
  1208. }
  1209. /* inode number of .. must equal old_dir->i_ino */
  1210. if (dot_dot_de.de_objectid != old_dir->i_ino) {
  1211. reiserfs_write_unlock(old_dir->i_sb);
  1212. return -EIO;
  1213. }
  1214. }
  1215. retval = journal_begin(&th, old_dir->i_sb, jbegin_count);
  1216. if (retval) {
  1217. reiserfs_write_unlock(old_dir->i_sb);
  1218. return retval;
  1219. }
  1220. /* add new entry (or find the existing one) */
  1221. retval =
  1222. reiserfs_add_entry(&th, new_dir, new_dentry->d_name.name,
  1223. new_dentry->d_name.len, old_inode, 0);
  1224. if (retval == -EEXIST) {
  1225. if (!new_dentry_inode) {
  1226. reiserfs_panic(old_dir->i_sb, "vs-7050",
  1227. "new entry is found, new inode == 0");
  1228. }
  1229. } else if (retval) {
  1230. int err = journal_end(&th);
  1231. reiserfs_write_unlock(old_dir->i_sb);
  1232. return err ? err : retval;
  1233. }
  1234. reiserfs_update_inode_transaction(old_dir);
  1235. reiserfs_update_inode_transaction(new_dir);
  1236. /*
  1237. * this makes it so an fsync on an open fd for the old name will
  1238. * commit the rename operation
  1239. */
  1240. reiserfs_update_inode_transaction(old_inode);
  1241. if (new_dentry_inode)
  1242. reiserfs_update_inode_transaction(new_dentry_inode);
  1243. while (1) {
  1244. /*
  1245. * look for old name using corresponding entry key
  1246. * (found by reiserfs_find_entry)
  1247. */
  1248. if ((retval =
  1249. search_by_entry_key(new_dir->i_sb, &old_de.de_entry_key,
  1250. &old_entry_path,
  1251. &old_de)) != NAME_FOUND) {
  1252. pathrelse(&old_entry_path);
  1253. journal_end(&th);
  1254. reiserfs_write_unlock(old_dir->i_sb);
  1255. return -EIO;
  1256. }
  1257. copy_item_head(&old_entry_ih, tp_item_head(&old_entry_path));
  1258. reiserfs_prepare_for_journal(old_inode->i_sb, old_de.de_bh, 1);
  1259. /* look for new name by reiserfs_find_entry */
  1260. new_de.de_gen_number_bit_string = NULL;
  1261. retval =
  1262. reiserfs_find_entry(new_dir, new_dentry->d_name.name,
  1263. new_dentry->d_name.len, &new_entry_path,
  1264. &new_de);
  1265. /*
  1266. * reiserfs_add_entry should not return IO_ERROR,
  1267. * because it is called with essentially same parameters from
  1268. * reiserfs_add_entry above, and we'll catch any i/o errors
  1269. * before we get here.
  1270. */
  1271. if (retval != NAME_FOUND_INVISIBLE && retval != NAME_FOUND) {
  1272. pathrelse(&new_entry_path);
  1273. pathrelse(&old_entry_path);
  1274. journal_end(&th);
  1275. reiserfs_write_unlock(old_dir->i_sb);
  1276. return -EIO;
  1277. }
  1278. copy_item_head(&new_entry_ih, tp_item_head(&new_entry_path));
  1279. reiserfs_prepare_for_journal(old_inode->i_sb, new_de.de_bh, 1);
  1280. if (S_ISDIR(old_inode->i_mode)) {
  1281. if ((retval =
  1282. search_by_entry_key(new_dir->i_sb,
  1283. &dot_dot_de.de_entry_key,
  1284. &dot_dot_entry_path,
  1285. &dot_dot_de)) != NAME_FOUND) {
  1286. pathrelse(&dot_dot_entry_path);
  1287. pathrelse(&new_entry_path);
  1288. pathrelse(&old_entry_path);
  1289. journal_end(&th);
  1290. reiserfs_write_unlock(old_dir->i_sb);
  1291. return -EIO;
  1292. }
  1293. copy_item_head(&dot_dot_ih,
  1294. tp_item_head(&dot_dot_entry_path));
  1295. /* node containing ".." gets into transaction */
  1296. reiserfs_prepare_for_journal(old_inode->i_sb,
  1297. dot_dot_de.de_bh, 1);
  1298. }
  1299. /*
  1300. * we should check seals here, not do
  1301. * this stuff, yes? Then, having
  1302. * gathered everything into RAM we
  1303. * should lock the buffers, yes? -Hans
  1304. */
  1305. /*
  1306. * probably. our rename needs to hold more
  1307. * than one path at once. The seals would
  1308. * have to be written to deal with multi-path
  1309. * issues -chris
  1310. */
  1311. /*
  1312. * sanity checking before doing the rename - avoid races many
  1313. * of the above checks could have scheduled. We have to be
  1314. * sure our items haven't been shifted by another process.
  1315. */
  1316. if (item_moved(&new_entry_ih, &new_entry_path) ||
  1317. !entry_points_to_object(new_dentry->d_name.name,
  1318. new_dentry->d_name.len,
  1319. &new_de, new_dentry_inode) ||
  1320. item_moved(&old_entry_ih, &old_entry_path) ||
  1321. !entry_points_to_object(old_dentry->d_name.name,
  1322. old_dentry->d_name.len,
  1323. &old_de, old_inode)) {
  1324. reiserfs_restore_prepared_buffer(old_inode->i_sb,
  1325. new_de.de_bh);
  1326. reiserfs_restore_prepared_buffer(old_inode->i_sb,
  1327. old_de.de_bh);
  1328. if (S_ISDIR(old_inode_mode))
  1329. reiserfs_restore_prepared_buffer(old_inode->
  1330. i_sb,
  1331. dot_dot_de.
  1332. de_bh);
  1333. continue;
  1334. }
  1335. if (S_ISDIR(old_inode_mode)) {
  1336. if (item_moved(&dot_dot_ih, &dot_dot_entry_path) ||
  1337. !entry_points_to_object("..", 2, &dot_dot_de,
  1338. old_dir)) {
  1339. reiserfs_restore_prepared_buffer(old_inode->
  1340. i_sb,
  1341. old_de.de_bh);
  1342. reiserfs_restore_prepared_buffer(old_inode->
  1343. i_sb,
  1344. new_de.de_bh);
  1345. reiserfs_restore_prepared_buffer(old_inode->
  1346. i_sb,
  1347. dot_dot_de.
  1348. de_bh);
  1349. continue;
  1350. }
  1351. }
  1352. RFALSE(S_ISDIR(old_inode_mode) &&
  1353. !buffer_journal_prepared(dot_dot_de.de_bh), "");
  1354. break;
  1355. }
  1356. /*
  1357. * ok, all the changes can be done in one fell swoop when we
  1358. * have claimed all the buffers needed.
  1359. */
  1360. mark_de_visible(new_de.de_deh + new_de.de_entry_num);
  1361. set_ino_in_dir_entry(&new_de, INODE_PKEY(old_inode));
  1362. journal_mark_dirty(&th, new_de.de_bh);
  1363. mark_de_hidden(old_de.de_deh + old_de.de_entry_num);
  1364. journal_mark_dirty(&th, old_de.de_bh);
  1365. ctime = current_time(old_dir);
  1366. old_dir->i_ctime = old_dir->i_mtime = ctime;
  1367. new_dir->i_ctime = new_dir->i_mtime = ctime;
  1368. /*
  1369. * thanks to Alex Adriaanse <[email protected]> for patch
  1370. * which adds ctime update of renamed object
  1371. */
  1372. old_inode->i_ctime = ctime;
  1373. if (new_dentry_inode) {
  1374. /* adjust link number of the victim */
  1375. if (S_ISDIR(new_dentry_inode->i_mode)) {
  1376. clear_nlink(new_dentry_inode);
  1377. } else {
  1378. drop_nlink(new_dentry_inode);
  1379. }
  1380. new_dentry_inode->i_ctime = ctime;
  1381. savelink = new_dentry_inode->i_nlink;
  1382. }
  1383. if (S_ISDIR(old_inode_mode)) {
  1384. /* adjust ".." of renamed directory */
  1385. set_ino_in_dir_entry(&dot_dot_de, INODE_PKEY(new_dir));
  1386. journal_mark_dirty(&th, dot_dot_de.de_bh);
  1387. /*
  1388. * there (in new_dir) was no directory, so it got new link
  1389. * (".." of renamed directory)
  1390. */
  1391. if (!new_dentry_inode)
  1392. INC_DIR_INODE_NLINK(new_dir);
  1393. /* old directory lost one link - ".. " of renamed directory */
  1394. DEC_DIR_INODE_NLINK(old_dir);
  1395. }
  1396. /*
  1397. * looks like in 2.3.99pre3 brelse is atomic.
  1398. * so we can use pathrelse
  1399. */
  1400. pathrelse(&new_entry_path);
  1401. pathrelse(&dot_dot_entry_path);
  1402. /*
  1403. * FIXME: this reiserfs_cut_from_item's return value may screw up
  1404. * anybody, but it will panic if will not be able to find the
  1405. * entry. This needs one more clean up
  1406. */
  1407. if (reiserfs_cut_from_item
  1408. (&th, &old_entry_path, &old_de.de_entry_key, old_dir, NULL,
  1409. 0) < 0)
  1410. reiserfs_error(old_dir->i_sb, "vs-7060",
  1411. "couldn't not cut old name. Fsck later?");
  1412. old_dir->i_size -= DEH_SIZE + old_de.de_entrylen;
  1413. reiserfs_update_sd(&th, old_dir);
  1414. reiserfs_update_sd(&th, new_dir);
  1415. reiserfs_update_sd(&th, old_inode);
  1416. if (new_dentry_inode) {
  1417. if (savelink == 0)
  1418. add_save_link(&th, new_dentry_inode,
  1419. 0 /* not truncate */ );
  1420. reiserfs_update_sd(&th, new_dentry_inode);
  1421. }
  1422. retval = journal_end(&th);
  1423. reiserfs_write_unlock(old_dir->i_sb);
  1424. return retval;
  1425. }
  1426. /* directories can handle most operations... */
  1427. const struct inode_operations reiserfs_dir_inode_operations = {
  1428. .create = reiserfs_create,
  1429. .lookup = reiserfs_lookup,
  1430. .link = reiserfs_link,
  1431. .unlink = reiserfs_unlink,
  1432. .symlink = reiserfs_symlink,
  1433. .mkdir = reiserfs_mkdir,
  1434. .rmdir = reiserfs_rmdir,
  1435. .mknod = reiserfs_mknod,
  1436. .rename = reiserfs_rename,
  1437. .setattr = reiserfs_setattr,
  1438. .listxattr = reiserfs_listxattr,
  1439. .permission = reiserfs_permission,
  1440. .get_acl = reiserfs_get_acl,
  1441. .set_acl = reiserfs_set_acl,
  1442. .fileattr_get = reiserfs_fileattr_get,
  1443. .fileattr_set = reiserfs_fileattr_set,
  1444. };
  1445. /*
  1446. * symlink operations.. same as page_symlink_inode_operations, with xattr
  1447. * stuff added
  1448. */
  1449. const struct inode_operations reiserfs_symlink_inode_operations = {
  1450. .get_link = page_get_link,
  1451. .setattr = reiserfs_setattr,
  1452. .listxattr = reiserfs_listxattr,
  1453. .permission = reiserfs_permission,
  1454. };
  1455. /*
  1456. * special file operations.. just xattr/acl stuff
  1457. */
  1458. const struct inode_operations reiserfs_special_inode_operations = {
  1459. .setattr = reiserfs_setattr,
  1460. .listxattr = reiserfs_listxattr,
  1461. .permission = reiserfs_permission,
  1462. .get_acl = reiserfs_get_acl,
  1463. .set_acl = reiserfs_set_acl,
  1464. };