move_extent.c 45 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555
  1. /*
  2. * Copyright (c) 2008,2009 NEC Software Tohoku, Ltd.
  3. * Written by Takashi Sato <t-sato@yk.jp.nec.com>
  4. * Akira Fujita <a-fujita@rs.jp.nec.com>
  5. *
  6. * This program is free software; you can redistribute it and/or modify it
  7. * under the terms of version 2.1 of the GNU Lesser General Public License
  8. * as published by the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. */
  15. #include <linux/fs.h>
  16. #include <linux/quotaops.h>
  17. #include <linux/slab.h>
  18. #include "ext4_jbd2.h"
  19. #include "ext4.h"
  20. #include "ext4_extents.h"
  21. /**
  22. * get_ext_path - Find an extent path for designated logical block number.
  23. *
  24. * @inode: an inode which is searched
  25. * @lblock: logical block number to find an extent path
  26. * @path: pointer to an extent path pointer (for output)
  27. *
  28. * ext4_ext_find_extent wrapper. Return 0 on success, or a negative error value
  29. * on failure.
  30. */
  31. static inline int
  32. get_ext_path(struct inode *inode, ext4_lblk_t lblock,
  33. struct ext4_ext_path **orig_path)
  34. {
  35. int ret = 0;
  36. struct ext4_ext_path *path;
  37. path = ext4_ext_find_extent(inode, lblock, *orig_path);
  38. if (IS_ERR(path))
  39. ret = PTR_ERR(path);
  40. else if (path[ext_depth(inode)].p_ext == NULL)
  41. ret = -ENODATA;
  42. else
  43. *orig_path = path;
  44. return ret;
  45. }
  46. /**
  47. * copy_extent_status - Copy the extent's initialization status
  48. *
  49. * @src: an extent for getting initialize status
  50. * @dest: an extent to be set the status
  51. */
  52. static void
  53. copy_extent_status(struct ext4_extent *src, struct ext4_extent *dest)
  54. {
  55. if (ext4_ext_is_uninitialized(src))
  56. ext4_ext_mark_uninitialized(dest);
  57. else
  58. dest->ee_len = cpu_to_le16(ext4_ext_get_actual_len(dest));
  59. }
  60. /**
  61. * mext_next_extent - Search for the next extent and set it to "extent"
  62. *
  63. * @inode: inode which is searched
  64. * @path: this will obtain data for the next extent
  65. * @extent: pointer to the next extent we have just gotten
  66. *
  67. * Search the next extent in the array of ext4_ext_path structure (@path)
  68. * and set it to ext4_extent structure (@extent). In addition, the member of
  69. * @path (->p_ext) also points the next extent. Return 0 on success, 1 if
  70. * ext4_ext_path structure refers to the last extent, or a negative error
  71. * value on failure.
  72. */
  73. static int
  74. mext_next_extent(struct inode *inode, struct ext4_ext_path *path,
  75. struct ext4_extent **extent)
  76. {
  77. struct ext4_extent_header *eh;
  78. int ppos, leaf_ppos = path->p_depth;
  79. ppos = leaf_ppos;
  80. if (EXT_LAST_EXTENT(path[ppos].p_hdr) > path[ppos].p_ext) {
  81. /* leaf block */
  82. *extent = ++path[ppos].p_ext;
  83. path[ppos].p_block = ext4_ext_pblock(path[ppos].p_ext);
  84. return 0;
  85. }
  86. while (--ppos >= 0) {
  87. if (EXT_LAST_INDEX(path[ppos].p_hdr) >
  88. path[ppos].p_idx) {
  89. int cur_ppos = ppos;
  90. /* index block */
  91. path[ppos].p_idx++;
  92. path[ppos].p_block = ext4_idx_pblock(path[ppos].p_idx);
  93. if (path[ppos+1].p_bh)
  94. brelse(path[ppos+1].p_bh);
  95. path[ppos+1].p_bh =
  96. sb_bread(inode->i_sb, path[ppos].p_block);
  97. if (!path[ppos+1].p_bh)
  98. return -EIO;
  99. path[ppos+1].p_hdr =
  100. ext_block_hdr(path[ppos+1].p_bh);
  101. /* Halfway index block */
  102. while (++cur_ppos < leaf_ppos) {
  103. path[cur_ppos].p_idx =
  104. EXT_FIRST_INDEX(path[cur_ppos].p_hdr);
  105. path[cur_ppos].p_block =
  106. ext4_idx_pblock(path[cur_ppos].p_idx);
  107. if (path[cur_ppos+1].p_bh)
  108. brelse(path[cur_ppos+1].p_bh);
  109. path[cur_ppos+1].p_bh = sb_bread(inode->i_sb,
  110. path[cur_ppos].p_block);
  111. if (!path[cur_ppos+1].p_bh)
  112. return -EIO;
  113. path[cur_ppos+1].p_hdr =
  114. ext_block_hdr(path[cur_ppos+1].p_bh);
  115. }
  116. path[leaf_ppos].p_ext = *extent = NULL;
  117. eh = path[leaf_ppos].p_hdr;
  118. if (le16_to_cpu(eh->eh_entries) == 0)
  119. /* empty leaf is found */
  120. return -ENODATA;
  121. /* leaf block */
  122. path[leaf_ppos].p_ext = *extent =
  123. EXT_FIRST_EXTENT(path[leaf_ppos].p_hdr);
  124. path[leaf_ppos].p_block =
  125. ext4_ext_pblock(path[leaf_ppos].p_ext);
  126. return 0;
  127. }
  128. }
  129. /* We found the last extent */
  130. return 1;
  131. }
  132. /**
  133. * ext4_double_down_write_data_sem - Acquire two inodes' write lock
  134. * of i_data_sem
  135. *
  136. * Acquire write lock of i_data_sem of the two inodes
  137. */
  138. void
  139. ext4_double_down_write_data_sem(struct inode *first, struct inode *second)
  140. {
  141. if (first < second) {
  142. down_write(&EXT4_I(first)->i_data_sem);
  143. down_write_nested(&EXT4_I(second)->i_data_sem, SINGLE_DEPTH_NESTING);
  144. } else {
  145. down_write(&EXT4_I(second)->i_data_sem);
  146. down_write_nested(&EXT4_I(first)->i_data_sem, SINGLE_DEPTH_NESTING);
  147. }
  148. }
  149. /**
  150. * ext4_double_up_write_data_sem - Release two inodes' write lock of i_data_sem
  151. *
  152. * @orig_inode: original inode structure to be released its lock first
  153. * @donor_inode: donor inode structure to be released its lock second
  154. * Release write lock of i_data_sem of two inodes (orig and donor).
  155. */
  156. void
  157. ext4_double_up_write_data_sem(struct inode *orig_inode,
  158. struct inode *donor_inode)
  159. {
  160. up_write(&EXT4_I(orig_inode)->i_data_sem);
  161. up_write(&EXT4_I(donor_inode)->i_data_sem);
  162. }
  163. /**
  164. * mext_insert_across_blocks - Insert extents across leaf block
  165. *
  166. * @handle: journal handle
  167. * @orig_inode: original inode
  168. * @o_start: first original extent to be changed
  169. * @o_end: last original extent to be changed
  170. * @start_ext: first new extent to be inserted
  171. * @new_ext: middle of new extent to be inserted
  172. * @end_ext: last new extent to be inserted
  173. *
  174. * Allocate a new leaf block and insert extents into it. Return 0 on success,
  175. * or a negative error value on failure.
  176. */
  177. static int
  178. mext_insert_across_blocks(handle_t *handle, struct inode *orig_inode,
  179. struct ext4_extent *o_start, struct ext4_extent *o_end,
  180. struct ext4_extent *start_ext, struct ext4_extent *new_ext,
  181. struct ext4_extent *end_ext)
  182. {
  183. struct ext4_ext_path *orig_path = NULL;
  184. ext4_lblk_t eblock = 0;
  185. int new_flag = 0;
  186. int end_flag = 0;
  187. int err = 0;
  188. if (start_ext->ee_len && new_ext->ee_len && end_ext->ee_len) {
  189. if (o_start == o_end) {
  190. /* start_ext new_ext end_ext
  191. * donor |---------|-----------|--------|
  192. * orig |------------------------------|
  193. */
  194. end_flag = 1;
  195. } else {
  196. /* start_ext new_ext end_ext
  197. * donor |---------|----------|---------|
  198. * orig |---------------|--------------|
  199. */
  200. o_end->ee_block = end_ext->ee_block;
  201. o_end->ee_len = end_ext->ee_len;
  202. ext4_ext_store_pblock(o_end, ext4_ext_pblock(end_ext));
  203. }
  204. o_start->ee_len = start_ext->ee_len;
  205. eblock = le32_to_cpu(start_ext->ee_block);
  206. new_flag = 1;
  207. } else if (start_ext->ee_len && new_ext->ee_len &&
  208. !end_ext->ee_len && o_start == o_end) {
  209. /* start_ext new_ext
  210. * donor |--------------|---------------|
  211. * orig |------------------------------|
  212. */
  213. o_start->ee_len = start_ext->ee_len;
  214. eblock = le32_to_cpu(start_ext->ee_block);
  215. new_flag = 1;
  216. } else if (!start_ext->ee_len && new_ext->ee_len &&
  217. end_ext->ee_len && o_start == o_end) {
  218. /* new_ext end_ext
  219. * donor |--------------|---------------|
  220. * orig |------------------------------|
  221. */
  222. o_end->ee_block = end_ext->ee_block;
  223. o_end->ee_len = end_ext->ee_len;
  224. ext4_ext_store_pblock(o_end, ext4_ext_pblock(end_ext));
  225. /*
  226. * Set 0 to the extent block if new_ext was
  227. * the first block.
  228. */
  229. if (new_ext->ee_block)
  230. eblock = le32_to_cpu(new_ext->ee_block);
  231. new_flag = 1;
  232. } else {
  233. ext4_debug("ext4 move extent: Unexpected insert case\n");
  234. return -EIO;
  235. }
  236. if (new_flag) {
  237. err = get_ext_path(orig_inode, eblock, &orig_path);
  238. if (err)
  239. goto out;
  240. if (ext4_ext_insert_extent(handle, orig_inode,
  241. orig_path, new_ext, 0))
  242. goto out;
  243. }
  244. if (end_flag) {
  245. err = get_ext_path(orig_inode,
  246. le32_to_cpu(end_ext->ee_block) - 1, &orig_path);
  247. if (err)
  248. goto out;
  249. if (ext4_ext_insert_extent(handle, orig_inode,
  250. orig_path, end_ext, 0))
  251. goto out;
  252. }
  253. out:
  254. if (orig_path) {
  255. ext4_ext_drop_refs(orig_path);
  256. kfree(orig_path);
  257. }
  258. return err;
  259. }
  260. /**
  261. * mext_insert_inside_block - Insert new extent to the extent block
  262. *
  263. * @o_start: first original extent to be moved
  264. * @o_end: last original extent to be moved
  265. * @start_ext: first new extent to be inserted
  266. * @new_ext: middle of new extent to be inserted
  267. * @end_ext: last new extent to be inserted
  268. * @eh: extent header of target leaf block
  269. * @range_to_move: used to decide how to insert extent
  270. *
  271. * Insert extents into the leaf block. The extent (@o_start) is overwritten
  272. * by inserted extents.
  273. */
  274. static void
  275. mext_insert_inside_block(struct ext4_extent *o_start,
  276. struct ext4_extent *o_end,
  277. struct ext4_extent *start_ext,
  278. struct ext4_extent *new_ext,
  279. struct ext4_extent *end_ext,
  280. struct ext4_extent_header *eh,
  281. int range_to_move)
  282. {
  283. int i = 0;
  284. unsigned long len;
  285. /* Move the existing extents */
  286. if (range_to_move && o_end < EXT_LAST_EXTENT(eh)) {
  287. len = (unsigned long)(EXT_LAST_EXTENT(eh) + 1) -
  288. (unsigned long)(o_end + 1);
  289. memmove(o_end + 1 + range_to_move, o_end + 1, len);
  290. }
  291. /* Insert start entry */
  292. if (start_ext->ee_len)
  293. o_start[i++].ee_len = start_ext->ee_len;
  294. /* Insert new entry */
  295. if (new_ext->ee_len) {
  296. o_start[i] = *new_ext;
  297. ext4_ext_store_pblock(&o_start[i++], ext4_ext_pblock(new_ext));
  298. }
  299. /* Insert end entry */
  300. if (end_ext->ee_len)
  301. o_start[i] = *end_ext;
  302. /* Increment the total entries counter on the extent block */
  303. le16_add_cpu(&eh->eh_entries, range_to_move);
  304. }
  305. /**
  306. * mext_insert_extents - Insert new extent
  307. *
  308. * @handle: journal handle
  309. * @orig_inode: original inode
  310. * @orig_path: path indicates first extent to be changed
  311. * @o_start: first original extent to be changed
  312. * @o_end: last original extent to be changed
  313. * @start_ext: first new extent to be inserted
  314. * @new_ext: middle of new extent to be inserted
  315. * @end_ext: last new extent to be inserted
  316. *
  317. * Call the function to insert extents. If we cannot add more extents into
  318. * the leaf block, we call mext_insert_across_blocks() to create a
  319. * new leaf block. Otherwise call mext_insert_inside_block(). Return 0
  320. * on success, or a negative error value on failure.
  321. */
  322. static int
  323. mext_insert_extents(handle_t *handle, struct inode *orig_inode,
  324. struct ext4_ext_path *orig_path,
  325. struct ext4_extent *o_start,
  326. struct ext4_extent *o_end,
  327. struct ext4_extent *start_ext,
  328. struct ext4_extent *new_ext,
  329. struct ext4_extent *end_ext)
  330. {
  331. struct ext4_extent_header *eh;
  332. unsigned long need_slots, slots_range;
  333. int range_to_move, depth, ret;
  334. /*
  335. * The extents need to be inserted
  336. * start_extent + new_extent + end_extent.
  337. */
  338. need_slots = (start_ext->ee_len ? 1 : 0) + (end_ext->ee_len ? 1 : 0) +
  339. (new_ext->ee_len ? 1 : 0);
  340. /* The number of slots between start and end */
  341. slots_range = ((unsigned long)(o_end + 1) - (unsigned long)o_start + 1)
  342. / sizeof(struct ext4_extent);
  343. /* Range to move the end of extent */
  344. range_to_move = need_slots - slots_range;
  345. depth = orig_path->p_depth;
  346. orig_path += depth;
  347. eh = orig_path->p_hdr;
  348. if (depth) {
  349. /* Register to journal */
  350. ret = ext4_journal_get_write_access(handle, orig_path->p_bh);
  351. if (ret)
  352. return ret;
  353. }
  354. /* Expansion */
  355. if (range_to_move > 0 &&
  356. (range_to_move > le16_to_cpu(eh->eh_max)
  357. - le16_to_cpu(eh->eh_entries))) {
  358. ret = mext_insert_across_blocks(handle, orig_inode, o_start,
  359. o_end, start_ext, new_ext, end_ext);
  360. if (ret < 0)
  361. return ret;
  362. } else
  363. mext_insert_inside_block(o_start, o_end, start_ext, new_ext,
  364. end_ext, eh, range_to_move);
  365. if (depth) {
  366. ret = ext4_handle_dirty_metadata(handle, orig_inode,
  367. orig_path->p_bh);
  368. if (ret)
  369. return ret;
  370. } else {
  371. ret = ext4_mark_inode_dirty(handle, orig_inode);
  372. if (ret < 0)
  373. return ret;
  374. }
  375. return 0;
  376. }
  377. /**
  378. * mext_leaf_block - Move one leaf extent block into the inode.
  379. *
  380. * @handle: journal handle
  381. * @orig_inode: original inode
  382. * @orig_path: path indicates first extent to be changed
  383. * @dext: donor extent
  384. * @from: start offset on the target file
  385. *
  386. * In order to insert extents into the leaf block, we must divide the extent
  387. * in the leaf block into three extents. The one is located to be inserted
  388. * extents, and the others are located around it.
  389. *
  390. * Therefore, this function creates structures to save extents of the leaf
  391. * block, and inserts extents by calling mext_insert_extents() with
  392. * created extents. Return 0 on success, or a negative error value on failure.
  393. */
  394. static int
  395. mext_leaf_block(handle_t *handle, struct inode *orig_inode,
  396. struct ext4_ext_path *orig_path, struct ext4_extent *dext,
  397. ext4_lblk_t *from)
  398. {
  399. struct ext4_extent *oext, *o_start, *o_end, *prev_ext;
  400. struct ext4_extent new_ext, start_ext, end_ext;
  401. ext4_lblk_t new_ext_end;
  402. int oext_alen, new_ext_alen, end_ext_alen;
  403. int depth = ext_depth(orig_inode);
  404. int ret;
  405. start_ext.ee_block = end_ext.ee_block = 0;
  406. o_start = o_end = oext = orig_path[depth].p_ext;
  407. oext_alen = ext4_ext_get_actual_len(oext);
  408. start_ext.ee_len = end_ext.ee_len = 0;
  409. new_ext.ee_block = cpu_to_le32(*from);
  410. ext4_ext_store_pblock(&new_ext, ext4_ext_pblock(dext));
  411. new_ext.ee_len = dext->ee_len;
  412. new_ext_alen = ext4_ext_get_actual_len(&new_ext);
  413. new_ext_end = le32_to_cpu(new_ext.ee_block) + new_ext_alen - 1;
  414. /*
  415. * Case: original extent is first
  416. * oext |--------|
  417. * new_ext |--|
  418. * start_ext |--|
  419. */
  420. if (le32_to_cpu(oext->ee_block) < le32_to_cpu(new_ext.ee_block) &&
  421. le32_to_cpu(new_ext.ee_block) <
  422. le32_to_cpu(oext->ee_block) + oext_alen) {
  423. start_ext.ee_len = cpu_to_le16(le32_to_cpu(new_ext.ee_block) -
  424. le32_to_cpu(oext->ee_block));
  425. start_ext.ee_block = oext->ee_block;
  426. copy_extent_status(oext, &start_ext);
  427. } else if (oext > EXT_FIRST_EXTENT(orig_path[depth].p_hdr)) {
  428. prev_ext = oext - 1;
  429. /*
  430. * We can merge new_ext into previous extent,
  431. * if these are contiguous and same extent type.
  432. */
  433. if (ext4_can_extents_be_merged(orig_inode, prev_ext,
  434. &new_ext)) {
  435. o_start = prev_ext;
  436. start_ext.ee_len = cpu_to_le16(
  437. ext4_ext_get_actual_len(prev_ext) +
  438. new_ext_alen);
  439. start_ext.ee_block = oext->ee_block;
  440. copy_extent_status(prev_ext, &start_ext);
  441. new_ext.ee_len = 0;
  442. }
  443. }
  444. /*
  445. * Case: new_ext_end must be less than oext
  446. * oext |-----------|
  447. * new_ext |-------|
  448. */
  449. if (le32_to_cpu(oext->ee_block) + oext_alen - 1 < new_ext_end) {
  450. EXT4_ERROR_INODE(orig_inode,
  451. "new_ext_end(%u) should be less than or equal to "
  452. "oext->ee_block(%u) + oext_alen(%d) - 1",
  453. new_ext_end, le32_to_cpu(oext->ee_block),
  454. oext_alen);
  455. ret = -EIO;
  456. goto out;
  457. }
  458. /*
  459. * Case: new_ext is smaller than original extent
  460. * oext |---------------|
  461. * new_ext |-----------|
  462. * end_ext |---|
  463. */
  464. if (le32_to_cpu(oext->ee_block) <= new_ext_end &&
  465. new_ext_end < le32_to_cpu(oext->ee_block) + oext_alen - 1) {
  466. end_ext.ee_len =
  467. cpu_to_le16(le32_to_cpu(oext->ee_block) +
  468. oext_alen - 1 - new_ext_end);
  469. copy_extent_status(oext, &end_ext);
  470. end_ext_alen = ext4_ext_get_actual_len(&end_ext);
  471. ext4_ext_store_pblock(&end_ext,
  472. (ext4_ext_pblock(o_end) + oext_alen - end_ext_alen));
  473. end_ext.ee_block =
  474. cpu_to_le32(le32_to_cpu(o_end->ee_block) +
  475. oext_alen - end_ext_alen);
  476. }
  477. ret = mext_insert_extents(handle, orig_inode, orig_path, o_start,
  478. o_end, &start_ext, &new_ext, &end_ext);
  479. out:
  480. return ret;
  481. }
  482. /**
  483. * mext_calc_swap_extents - Calculate extents for extent swapping.
  484. *
  485. * @tmp_dext: the extent that will belong to the original inode
  486. * @tmp_oext: the extent that will belong to the donor inode
  487. * @orig_off: block offset of original inode
  488. * @donor_off: block offset of donor inode
  489. * @max_count: the maximum length of extents
  490. *
  491. * Return 0 on success, or a negative error value on failure.
  492. */
  493. static int
  494. mext_calc_swap_extents(struct ext4_extent *tmp_dext,
  495. struct ext4_extent *tmp_oext,
  496. ext4_lblk_t orig_off, ext4_lblk_t donor_off,
  497. ext4_lblk_t max_count)
  498. {
  499. ext4_lblk_t diff, orig_diff;
  500. struct ext4_extent dext_old, oext_old;
  501. BUG_ON(orig_off != donor_off);
  502. /* original and donor extents have to cover the same block offset */
  503. if (orig_off < le32_to_cpu(tmp_oext->ee_block) ||
  504. le32_to_cpu(tmp_oext->ee_block) +
  505. ext4_ext_get_actual_len(tmp_oext) - 1 < orig_off)
  506. return -ENODATA;
  507. if (orig_off < le32_to_cpu(tmp_dext->ee_block) ||
  508. le32_to_cpu(tmp_dext->ee_block) +
  509. ext4_ext_get_actual_len(tmp_dext) - 1 < orig_off)
  510. return -ENODATA;
  511. dext_old = *tmp_dext;
  512. oext_old = *tmp_oext;
  513. /* When tmp_dext is too large, pick up the target range. */
  514. diff = donor_off - le32_to_cpu(tmp_dext->ee_block);
  515. ext4_ext_store_pblock(tmp_dext, ext4_ext_pblock(tmp_dext) + diff);
  516. le32_add_cpu(&tmp_dext->ee_block, diff);
  517. le16_add_cpu(&tmp_dext->ee_len, -diff);
  518. if (max_count < ext4_ext_get_actual_len(tmp_dext))
  519. tmp_dext->ee_len = cpu_to_le16(max_count);
  520. orig_diff = orig_off - le32_to_cpu(tmp_oext->ee_block);
  521. ext4_ext_store_pblock(tmp_oext, ext4_ext_pblock(tmp_oext) + orig_diff);
  522. /* Adjust extent length if donor extent is larger than orig */
  523. if (ext4_ext_get_actual_len(tmp_dext) >
  524. ext4_ext_get_actual_len(tmp_oext) - orig_diff)
  525. tmp_dext->ee_len = cpu_to_le16(le16_to_cpu(tmp_oext->ee_len) -
  526. orig_diff);
  527. tmp_oext->ee_len = cpu_to_le16(ext4_ext_get_actual_len(tmp_dext));
  528. copy_extent_status(&oext_old, tmp_dext);
  529. copy_extent_status(&dext_old, tmp_oext);
  530. return 0;
  531. }
  532. /**
  533. * mext_check_coverage - Check that all extents in range has the same type
  534. *
  535. * @inode: inode in question
  536. * @from: block offset of inode
  537. * @count: block count to be checked
  538. * @uninit: extents expected to be uninitialized
  539. * @err: pointer to save error value
  540. *
  541. * Return 1 if all extents in range has expected type, and zero otherwise.
  542. */
  543. static int
  544. mext_check_coverage(struct inode *inode, ext4_lblk_t from, ext4_lblk_t count,
  545. int uninit, int *err)
  546. {
  547. struct ext4_ext_path *path = NULL;
  548. struct ext4_extent *ext;
  549. int ret = 0;
  550. ext4_lblk_t last = from + count;
  551. while (from < last) {
  552. *err = get_ext_path(inode, from, &path);
  553. if (*err)
  554. goto out;
  555. ext = path[ext_depth(inode)].p_ext;
  556. if (uninit != ext4_ext_is_uninitialized(ext))
  557. goto out;
  558. from += ext4_ext_get_actual_len(ext);
  559. ext4_ext_drop_refs(path);
  560. }
  561. ret = 1;
  562. out:
  563. if (path) {
  564. ext4_ext_drop_refs(path);
  565. kfree(path);
  566. }
  567. return ret;
  568. }
  569. /**
  570. * mext_replace_branches - Replace original extents with new extents
  571. *
  572. * @handle: journal handle
  573. * @orig_inode: original inode
  574. * @donor_inode: donor inode
  575. * @from: block offset of orig_inode
  576. * @count: block count to be replaced
  577. * @err: pointer to save return value
  578. *
  579. * Replace original inode extents and donor inode extents page by page.
  580. * We implement this replacement in the following three steps:
  581. * 1. Save the block information of original and donor inodes into
  582. * dummy extents.
  583. * 2. Change the block information of original inode to point at the
  584. * donor inode blocks.
  585. * 3. Change the block information of donor inode to point at the saved
  586. * original inode blocks in the dummy extents.
  587. *
  588. * Return replaced block count.
  589. */
  590. static int
  591. mext_replace_branches(handle_t *handle, struct inode *orig_inode,
  592. struct inode *donor_inode, ext4_lblk_t from,
  593. ext4_lblk_t count, int *err)
  594. {
  595. struct ext4_ext_path *orig_path = NULL;
  596. struct ext4_ext_path *donor_path = NULL;
  597. struct ext4_extent *oext, *dext;
  598. struct ext4_extent tmp_dext, tmp_oext;
  599. ext4_lblk_t orig_off = from, donor_off = from;
  600. int depth;
  601. int replaced_count = 0;
  602. int dext_alen;
  603. *err = ext4_es_remove_extent(orig_inode, from, count);
  604. if (*err)
  605. goto out;
  606. *err = ext4_es_remove_extent(donor_inode, from, count);
  607. if (*err)
  608. goto out;
  609. /* Get the original extent for the block "orig_off" */
  610. *err = get_ext_path(orig_inode, orig_off, &orig_path);
  611. if (*err)
  612. goto out;
  613. /* Get the donor extent for the head */
  614. *err = get_ext_path(donor_inode, donor_off, &donor_path);
  615. if (*err)
  616. goto out;
  617. depth = ext_depth(orig_inode);
  618. oext = orig_path[depth].p_ext;
  619. tmp_oext = *oext;
  620. depth = ext_depth(donor_inode);
  621. dext = donor_path[depth].p_ext;
  622. if (unlikely(!dext))
  623. goto missing_donor_extent;
  624. tmp_dext = *dext;
  625. *err = mext_calc_swap_extents(&tmp_dext, &tmp_oext, orig_off,
  626. donor_off, count);
  627. if (*err)
  628. goto out;
  629. /* Loop for the donor extents */
  630. while (1) {
  631. /* The extent for donor must be found. */
  632. if (unlikely(!dext)) {
  633. missing_donor_extent:
  634. EXT4_ERROR_INODE(donor_inode,
  635. "The extent for donor must be found");
  636. *err = -EIO;
  637. goto out;
  638. } else if (donor_off != le32_to_cpu(tmp_dext.ee_block)) {
  639. EXT4_ERROR_INODE(donor_inode,
  640. "Donor offset(%u) and the first block of donor "
  641. "extent(%u) should be equal",
  642. donor_off,
  643. le32_to_cpu(tmp_dext.ee_block));
  644. *err = -EIO;
  645. goto out;
  646. }
  647. /* Set donor extent to orig extent */
  648. *err = mext_leaf_block(handle, orig_inode,
  649. orig_path, &tmp_dext, &orig_off);
  650. if (*err)
  651. goto out;
  652. /* Set orig extent to donor extent */
  653. *err = mext_leaf_block(handle, donor_inode,
  654. donor_path, &tmp_oext, &donor_off);
  655. if (*err)
  656. goto out;
  657. dext_alen = ext4_ext_get_actual_len(&tmp_dext);
  658. replaced_count += dext_alen;
  659. donor_off += dext_alen;
  660. orig_off += dext_alen;
  661. BUG_ON(replaced_count > count);
  662. /* Already moved the expected blocks */
  663. if (replaced_count >= count)
  664. break;
  665. if (orig_path)
  666. ext4_ext_drop_refs(orig_path);
  667. *err = get_ext_path(orig_inode, orig_off, &orig_path);
  668. if (*err)
  669. goto out;
  670. depth = ext_depth(orig_inode);
  671. oext = orig_path[depth].p_ext;
  672. tmp_oext = *oext;
  673. if (donor_path)
  674. ext4_ext_drop_refs(donor_path);
  675. *err = get_ext_path(donor_inode, donor_off, &donor_path);
  676. if (*err)
  677. goto out;
  678. depth = ext_depth(donor_inode);
  679. dext = donor_path[depth].p_ext;
  680. tmp_dext = *dext;
  681. *err = mext_calc_swap_extents(&tmp_dext, &tmp_oext, orig_off,
  682. donor_off, count - replaced_count);
  683. if (*err)
  684. goto out;
  685. }
  686. out:
  687. if (orig_path) {
  688. ext4_ext_drop_refs(orig_path);
  689. kfree(orig_path);
  690. }
  691. if (donor_path) {
  692. ext4_ext_drop_refs(donor_path);
  693. kfree(donor_path);
  694. }
  695. return replaced_count;
  696. }
  697. /**
  698. * mext_page_double_lock - Grab and lock pages on both @inode1 and @inode2
  699. *
  700. * @inode1: the inode structure
  701. * @inode2: the inode structure
  702. * @index: page index
  703. * @page: result page vector
  704. *
  705. * Grab two locked pages for inode's by inode order
  706. */
  707. static int
  708. mext_page_double_lock(struct inode *inode1, struct inode *inode2,
  709. pgoff_t index, struct page *page[2])
  710. {
  711. struct address_space *mapping[2];
  712. unsigned fl = AOP_FLAG_NOFS;
  713. BUG_ON(!inode1 || !inode2);
  714. if (inode1 < inode2) {
  715. mapping[0] = inode1->i_mapping;
  716. mapping[1] = inode2->i_mapping;
  717. } else {
  718. mapping[0] = inode2->i_mapping;
  719. mapping[1] = inode1->i_mapping;
  720. }
  721. page[0] = grab_cache_page_write_begin(mapping[0], index, fl);
  722. if (!page[0])
  723. return -ENOMEM;
  724. page[1] = grab_cache_page_write_begin(mapping[1], index, fl);
  725. if (!page[1]) {
  726. unlock_page(page[0]);
  727. page_cache_release(page[0]);
  728. return -ENOMEM;
  729. }
  730. /*
  731. * grab_cache_page_write_begin() may not wait on page's writeback if
  732. * BDI not demand that. But it is reasonable to be very conservative
  733. * here and explicitly wait on page's writeback
  734. */
  735. wait_on_page_writeback(page[0]);
  736. wait_on_page_writeback(page[1]);
  737. if (inode1 > inode2) {
  738. struct page *tmp;
  739. tmp = page[0];
  740. page[0] = page[1];
  741. page[1] = tmp;
  742. }
  743. return 0;
  744. }
  745. /* Force page buffers uptodate w/o dropping page's lock */
  746. static int
  747. mext_page_mkuptodate(struct page *page, unsigned from, unsigned to)
  748. {
  749. struct inode *inode = page->mapping->host;
  750. sector_t block;
  751. struct buffer_head *bh, *head, *arr[MAX_BUF_PER_PAGE];
  752. unsigned int blocksize, block_start, block_end;
  753. int i, err, nr = 0, partial = 0;
  754. BUG_ON(!PageLocked(page));
  755. BUG_ON(PageWriteback(page));
  756. if (PageUptodate(page))
  757. return 0;
  758. blocksize = 1 << inode->i_blkbits;
  759. if (!page_has_buffers(page))
  760. create_empty_buffers(page, blocksize, 0);
  761. head = page_buffers(page);
  762. block = (sector_t)page->index << (PAGE_CACHE_SHIFT - inode->i_blkbits);
  763. for (bh = head, block_start = 0; bh != head || !block_start;
  764. block++, block_start = block_end, bh = bh->b_this_page) {
  765. block_end = block_start + blocksize;
  766. if (block_end <= from || block_start >= to) {
  767. if (!buffer_uptodate(bh))
  768. partial = 1;
  769. continue;
  770. }
  771. if (buffer_uptodate(bh))
  772. continue;
  773. if (!buffer_mapped(bh)) {
  774. err = ext4_get_block(inode, block, bh, 0);
  775. if (err) {
  776. SetPageError(page);
  777. return err;
  778. }
  779. if (!buffer_mapped(bh)) {
  780. zero_user(page, block_start, blocksize);
  781. if (!err)
  782. set_buffer_uptodate(bh);
  783. continue;
  784. }
  785. }
  786. BUG_ON(nr >= MAX_BUF_PER_PAGE);
  787. arr[nr++] = bh;
  788. }
  789. /* No io required */
  790. if (!nr)
  791. goto out;
  792. for (i = 0; i < nr; i++) {
  793. bh = arr[i];
  794. if (!bh_uptodate_or_lock(bh)) {
  795. err = bh_submit_read(bh);
  796. if (err)
  797. return err;
  798. }
  799. }
  800. out:
  801. if (!partial)
  802. SetPageUptodate(page);
  803. return 0;
  804. }
  805. /**
  806. * move_extent_per_page - Move extent data per page
  807. *
  808. * @o_filp: file structure of original file
  809. * @donor_inode: donor inode
  810. * @orig_page_offset: page index on original file
  811. * @data_offset_in_page: block index where data swapping starts
  812. * @block_len_in_page: the number of blocks to be swapped
  813. * @uninit: orig extent is uninitialized or not
  814. * @err: pointer to save return value
  815. *
  816. * Save the data in original inode blocks and replace original inode extents
  817. * with donor inode extents by calling mext_replace_branches().
  818. * Finally, write out the saved data in new original inode blocks. Return
  819. * replaced block count.
  820. */
  821. static int
  822. move_extent_per_page(struct file *o_filp, struct inode *donor_inode,
  823. pgoff_t orig_page_offset, int data_offset_in_page,
  824. int block_len_in_page, int uninit, int *err)
  825. {
  826. struct inode *orig_inode = file_inode(o_filp);
  827. struct page *pagep[2] = {NULL, NULL};
  828. handle_t *handle;
  829. ext4_lblk_t orig_blk_offset;
  830. long long offs = orig_page_offset << PAGE_CACHE_SHIFT;
  831. unsigned long blocksize = orig_inode->i_sb->s_blocksize;
  832. unsigned int w_flags = 0;
  833. unsigned int tmp_data_size, data_size, replaced_size;
  834. int err2, jblocks, retries = 0;
  835. int replaced_count = 0;
  836. int from = data_offset_in_page << orig_inode->i_blkbits;
  837. int blocks_per_page = PAGE_CACHE_SIZE >> orig_inode->i_blkbits;
  838. /*
  839. * It needs twice the amount of ordinary journal buffers because
  840. * inode and donor_inode may change each different metadata blocks.
  841. */
  842. again:
  843. *err = 0;
  844. jblocks = ext4_writepage_trans_blocks(orig_inode) * 2;
  845. handle = ext4_journal_start(orig_inode, EXT4_HT_MOVE_EXTENTS, jblocks);
  846. if (IS_ERR(handle)) {
  847. *err = PTR_ERR(handle);
  848. return 0;
  849. }
  850. if (segment_eq(get_fs(), KERNEL_DS))
  851. w_flags |= AOP_FLAG_UNINTERRUPTIBLE;
  852. orig_blk_offset = orig_page_offset * blocks_per_page +
  853. data_offset_in_page;
  854. offs = (long long)orig_blk_offset << orig_inode->i_blkbits;
  855. /* Calculate data_size */
  856. if ((orig_blk_offset + block_len_in_page - 1) ==
  857. ((orig_inode->i_size - 1) >> orig_inode->i_blkbits)) {
  858. /* Replace the last block */
  859. tmp_data_size = orig_inode->i_size & (blocksize - 1);
  860. /*
  861. * If data_size equal zero, it shows data_size is multiples of
  862. * blocksize. So we set appropriate value.
  863. */
  864. if (tmp_data_size == 0)
  865. tmp_data_size = blocksize;
  866. data_size = tmp_data_size +
  867. ((block_len_in_page - 1) << orig_inode->i_blkbits);
  868. } else
  869. data_size = block_len_in_page << orig_inode->i_blkbits;
  870. replaced_size = data_size;
  871. *err = mext_page_double_lock(orig_inode, donor_inode, orig_page_offset,
  872. pagep);
  873. if (unlikely(*err < 0))
  874. goto stop_journal;
  875. /*
  876. * If orig extent was uninitialized it can become initialized
  877. * at any time after i_data_sem was dropped, in order to
  878. * serialize with delalloc we have recheck extent while we
  879. * hold page's lock, if it is still the case data copy is not
  880. * necessary, just swap data blocks between orig and donor.
  881. */
  882. if (uninit) {
  883. ext4_double_down_write_data_sem(orig_inode, donor_inode);
  884. /* If any of extents in range became initialized we have to
  885. * fallback to data copying */
  886. uninit = mext_check_coverage(orig_inode, orig_blk_offset,
  887. block_len_in_page, 1, err);
  888. if (*err)
  889. goto drop_data_sem;
  890. uninit &= mext_check_coverage(donor_inode, orig_blk_offset,
  891. block_len_in_page, 1, err);
  892. if (*err)
  893. goto drop_data_sem;
  894. if (!uninit) {
  895. ext4_double_up_write_data_sem(orig_inode, donor_inode);
  896. goto data_copy;
  897. }
  898. if ((page_has_private(pagep[0]) &&
  899. !try_to_release_page(pagep[0], 0)) ||
  900. (page_has_private(pagep[1]) &&
  901. !try_to_release_page(pagep[1], 0))) {
  902. *err = -EBUSY;
  903. goto drop_data_sem;
  904. }
  905. replaced_count = mext_replace_branches(handle, orig_inode,
  906. donor_inode, orig_blk_offset,
  907. block_len_in_page, err);
  908. drop_data_sem:
  909. ext4_double_up_write_data_sem(orig_inode, donor_inode);
  910. goto unlock_pages;
  911. }
  912. data_copy:
  913. *err = mext_page_mkuptodate(pagep[0], from, from + replaced_size);
  914. if (*err)
  915. goto unlock_pages;
  916. /* At this point all buffers in range are uptodate, old mapping layout
  917. * is no longer required, try to drop it now. */
  918. if ((page_has_private(pagep[0]) && !try_to_release_page(pagep[0], 0)) ||
  919. (page_has_private(pagep[1]) && !try_to_release_page(pagep[1], 0))) {
  920. *err = -EBUSY;
  921. goto unlock_pages;
  922. }
  923. replaced_count = mext_replace_branches(handle, orig_inode, donor_inode,
  924. orig_blk_offset,
  925. block_len_in_page, err);
  926. if (*err) {
  927. if (replaced_count) {
  928. block_len_in_page = replaced_count;
  929. replaced_size =
  930. block_len_in_page << orig_inode->i_blkbits;
  931. } else
  932. goto unlock_pages;
  933. }
  934. /* Perform all necessary steps similar write_begin()/write_end()
  935. * but keeping in mind that i_size will not change */
  936. *err = __block_write_begin(pagep[0], from, replaced_size,
  937. ext4_get_block);
  938. if (!*err)
  939. *err = block_commit_write(pagep[0], from, from + replaced_size);
  940. if (unlikely(*err < 0))
  941. goto repair_branches;
  942. /* Even in case of data=writeback it is reasonable to pin
  943. * inode to transaction, to prevent unexpected data loss */
  944. *err = ext4_jbd2_file_inode(handle, orig_inode);
  945. unlock_pages:
  946. unlock_page(pagep[0]);
  947. page_cache_release(pagep[0]);
  948. unlock_page(pagep[1]);
  949. page_cache_release(pagep[1]);
  950. stop_journal:
  951. ext4_journal_stop(handle);
  952. /* Buffer was busy because probably is pinned to journal transaction,
  953. * force transaction commit may help to free it. */
  954. if (*err == -EBUSY && ext4_should_retry_alloc(orig_inode->i_sb,
  955. &retries))
  956. goto again;
  957. return replaced_count;
  958. repair_branches:
  959. /*
  960. * This should never ever happen!
  961. * Extents are swapped already, but we are not able to copy data.
  962. * Try to swap extents to it's original places
  963. */
  964. ext4_double_down_write_data_sem(orig_inode, donor_inode);
  965. replaced_count = mext_replace_branches(handle, donor_inode, orig_inode,
  966. orig_blk_offset,
  967. block_len_in_page, &err2);
  968. ext4_double_up_write_data_sem(orig_inode, donor_inode);
  969. if (replaced_count != block_len_in_page) {
  970. EXT4_ERROR_INODE_BLOCK(orig_inode, (sector_t)(orig_blk_offset),
  971. "Unable to copy data block,"
  972. " data will be lost.");
  973. *err = -EIO;
  974. }
  975. replaced_count = 0;
  976. goto unlock_pages;
  977. }
  978. /**
  979. * mext_check_arguments - Check whether move extent can be done
  980. *
  981. * @orig_inode: original inode
  982. * @donor_inode: donor inode
  983. * @orig_start: logical start offset in block for orig
  984. * @donor_start: logical start offset in block for donor
  985. * @len: the number of blocks to be moved
  986. *
  987. * Check the arguments of ext4_move_extents() whether the files can be
  988. * exchanged with each other.
  989. * Return 0 on success, or a negative error value on failure.
  990. */
  991. static int
  992. mext_check_arguments(struct inode *orig_inode,
  993. struct inode *donor_inode, __u64 orig_start,
  994. __u64 donor_start, __u64 *len)
  995. {
  996. ext4_lblk_t orig_blocks, donor_blocks;
  997. unsigned int blkbits = orig_inode->i_blkbits;
  998. unsigned int blocksize = 1 << blkbits;
  999. if (donor_inode->i_mode & (S_ISUID|S_ISGID)) {
  1000. ext4_debug("ext4 move extent: suid or sgid is set"
  1001. " to donor file [ino:orig %lu, donor %lu]\n",
  1002. orig_inode->i_ino, donor_inode->i_ino);
  1003. return -EINVAL;
  1004. }
  1005. if (IS_IMMUTABLE(donor_inode) || IS_APPEND(donor_inode))
  1006. return -EPERM;
  1007. /* Ext4 move extent does not support swapfile */
  1008. if (IS_SWAPFILE(orig_inode) || IS_SWAPFILE(donor_inode)) {
  1009. ext4_debug("ext4 move extent: The argument files should "
  1010. "not be swapfile [ino:orig %lu, donor %lu]\n",
  1011. orig_inode->i_ino, donor_inode->i_ino);
  1012. return -EINVAL;
  1013. }
  1014. /* Ext4 move extent supports only extent based file */
  1015. if (!(ext4_test_inode_flag(orig_inode, EXT4_INODE_EXTENTS))) {
  1016. ext4_debug("ext4 move extent: orig file is not extents "
  1017. "based file [ino:orig %lu]\n", orig_inode->i_ino);
  1018. return -EOPNOTSUPP;
  1019. } else if (!(ext4_test_inode_flag(donor_inode, EXT4_INODE_EXTENTS))) {
  1020. ext4_debug("ext4 move extent: donor file is not extents "
  1021. "based file [ino:donor %lu]\n", donor_inode->i_ino);
  1022. return -EOPNOTSUPP;
  1023. }
  1024. if ((!orig_inode->i_size) || (!donor_inode->i_size)) {
  1025. ext4_debug("ext4 move extent: File size is 0 byte\n");
  1026. return -EINVAL;
  1027. }
  1028. /* Start offset should be same */
  1029. if (orig_start != donor_start) {
  1030. ext4_debug("ext4 move extent: orig and donor's start "
  1031. "offset are not same [ino:orig %lu, donor %lu]\n",
  1032. orig_inode->i_ino, donor_inode->i_ino);
  1033. return -EINVAL;
  1034. }
  1035. if ((orig_start >= EXT_MAX_BLOCKS) ||
  1036. (*len > EXT_MAX_BLOCKS) ||
  1037. (orig_start + *len >= EXT_MAX_BLOCKS)) {
  1038. ext4_debug("ext4 move extent: Can't handle over [%u] blocks "
  1039. "[ino:orig %lu, donor %lu]\n", EXT_MAX_BLOCKS,
  1040. orig_inode->i_ino, donor_inode->i_ino);
  1041. return -EINVAL;
  1042. }
  1043. if (orig_inode->i_size > donor_inode->i_size) {
  1044. donor_blocks = (donor_inode->i_size + blocksize - 1) >> blkbits;
  1045. /* TODO: eliminate this artificial restriction */
  1046. if (orig_start >= donor_blocks) {
  1047. ext4_debug("ext4 move extent: orig start offset "
  1048. "[%llu] should be less than donor file blocks "
  1049. "[%u] [ino:orig %lu, donor %lu]\n",
  1050. orig_start, donor_blocks,
  1051. orig_inode->i_ino, donor_inode->i_ino);
  1052. return -EINVAL;
  1053. }
  1054. /* TODO: eliminate this artificial restriction */
  1055. if (orig_start + *len > donor_blocks) {
  1056. ext4_debug("ext4 move extent: End offset [%llu] should "
  1057. "be less than donor file blocks [%u]."
  1058. "So adjust length from %llu to %llu "
  1059. "[ino:orig %lu, donor %lu]\n",
  1060. orig_start + *len, donor_blocks,
  1061. *len, donor_blocks - orig_start,
  1062. orig_inode->i_ino, donor_inode->i_ino);
  1063. *len = donor_blocks - orig_start;
  1064. }
  1065. } else {
  1066. orig_blocks = (orig_inode->i_size + blocksize - 1) >> blkbits;
  1067. if (orig_start >= orig_blocks) {
  1068. ext4_debug("ext4 move extent: start offset [%llu] "
  1069. "should be less than original file blocks "
  1070. "[%u] [ino:orig %lu, donor %lu]\n",
  1071. orig_start, orig_blocks,
  1072. orig_inode->i_ino, donor_inode->i_ino);
  1073. return -EINVAL;
  1074. }
  1075. if (orig_start + *len > orig_blocks) {
  1076. ext4_debug("ext4 move extent: Adjust length "
  1077. "from %llu to %llu. Because it should be "
  1078. "less than original file blocks "
  1079. "[ino:orig %lu, donor %lu]\n",
  1080. *len, orig_blocks - orig_start,
  1081. orig_inode->i_ino, donor_inode->i_ino);
  1082. *len = orig_blocks - orig_start;
  1083. }
  1084. }
  1085. if (!*len) {
  1086. ext4_debug("ext4 move extent: len should not be 0 "
  1087. "[ino:orig %lu, donor %lu]\n", orig_inode->i_ino,
  1088. donor_inode->i_ino);
  1089. return -EINVAL;
  1090. }
  1091. return 0;
  1092. }
  1093. /**
  1094. * ext4_inode_double_lock - Lock i_mutex on both @inode1 and @inode2
  1095. *
  1096. * @inode1: the inode structure
  1097. * @inode2: the inode structure
  1098. *
  1099. * Lock two inodes' i_mutex
  1100. */
  1101. void
  1102. ext4_inode_double_lock(struct inode *inode1, struct inode *inode2)
  1103. {
  1104. BUG_ON(inode1 == inode2);
  1105. if (inode1 < inode2) {
  1106. mutex_lock_nested(&inode1->i_mutex, I_MUTEX_PARENT);
  1107. mutex_lock_nested(&inode2->i_mutex, I_MUTEX_CHILD);
  1108. } else {
  1109. mutex_lock_nested(&inode2->i_mutex, I_MUTEX_PARENT);
  1110. mutex_lock_nested(&inode1->i_mutex, I_MUTEX_CHILD);
  1111. }
  1112. }
  1113. /**
  1114. * ext4_inode_double_unlock - Release i_mutex on both @inode1 and @inode2
  1115. *
  1116. * @inode1: the inode that is released first
  1117. * @inode2: the inode that is released second
  1118. *
  1119. */
  1120. void
  1121. ext4_inode_double_unlock(struct inode *inode1, struct inode *inode2)
  1122. {
  1123. mutex_unlock(&inode1->i_mutex);
  1124. mutex_unlock(&inode2->i_mutex);
  1125. }
  1126. /**
  1127. * ext4_move_extents - Exchange the specified range of a file
  1128. *
  1129. * @o_filp: file structure of the original file
  1130. * @d_filp: file structure of the donor file
  1131. * @orig_start: start offset in block for orig
  1132. * @donor_start: start offset in block for donor
  1133. * @len: the number of blocks to be moved
  1134. * @moved_len: moved block length
  1135. *
  1136. * This function returns 0 and moved block length is set in moved_len
  1137. * if succeed, otherwise returns error value.
  1138. *
  1139. * Note: ext4_move_extents() proceeds the following order.
  1140. * 1:ext4_move_extents() calculates the last block number of moving extent
  1141. * function by the start block number (orig_start) and the number of blocks
  1142. * to be moved (len) specified as arguments.
  1143. * If the {orig, donor}_start points a hole, the extent's start offset
  1144. * pointed by ext_cur (current extent), holecheck_path, orig_path are set
  1145. * after hole behind.
  1146. * 2:Continue step 3 to step 5, until the holecheck_path points to last_extent
  1147. * or the ext_cur exceeds the block_end which is last logical block number.
  1148. * 3:To get the length of continues area, call mext_next_extent()
  1149. * specified with the ext_cur (initial value is holecheck_path) re-cursive,
  1150. * until find un-continuous extent, the start logical block number exceeds
  1151. * the block_end or the extent points to the last extent.
  1152. * 4:Exchange the original inode data with donor inode data
  1153. * from orig_page_offset to seq_end_page.
  1154. * The start indexes of data are specified as arguments.
  1155. * That of the original inode is orig_page_offset,
  1156. * and the donor inode is also orig_page_offset
  1157. * (To easily handle blocksize != pagesize case, the offset for the
  1158. * donor inode is block unit).
  1159. * 5:Update holecheck_path and orig_path to points a next proceeding extent,
  1160. * then returns to step 2.
  1161. * 6:Release holecheck_path, orig_path and set the len to moved_len
  1162. * which shows the number of moved blocks.
  1163. * The moved_len is useful for the command to calculate the file offset
  1164. * for starting next move extent ioctl.
  1165. * 7:Return 0 on success, or a negative error value on failure.
  1166. */
  1167. int
  1168. ext4_move_extents(struct file *o_filp, struct file *d_filp,
  1169. __u64 orig_start, __u64 donor_start, __u64 len,
  1170. __u64 *moved_len)
  1171. {
  1172. struct inode *orig_inode = file_inode(o_filp);
  1173. struct inode *donor_inode = file_inode(d_filp);
  1174. struct ext4_ext_path *orig_path = NULL, *holecheck_path = NULL;
  1175. struct ext4_extent *ext_prev, *ext_cur, *ext_dummy;
  1176. ext4_lblk_t block_start = orig_start;
  1177. ext4_lblk_t block_end, seq_start, add_blocks, file_end, seq_blocks = 0;
  1178. ext4_lblk_t rest_blocks;
  1179. pgoff_t orig_page_offset = 0, seq_end_page;
  1180. int ret, depth, last_extent = 0;
  1181. int blocks_per_page = PAGE_CACHE_SIZE >> orig_inode->i_blkbits;
  1182. int data_offset_in_page;
  1183. int block_len_in_page;
  1184. int uninit;
  1185. if (orig_inode->i_sb != donor_inode->i_sb) {
  1186. ext4_debug("ext4 move extent: The argument files "
  1187. "should be in same FS [ino:orig %lu, donor %lu]\n",
  1188. orig_inode->i_ino, donor_inode->i_ino);
  1189. return -EINVAL;
  1190. }
  1191. /* orig and donor should be different inodes */
  1192. if (orig_inode == donor_inode) {
  1193. ext4_debug("ext4 move extent: The argument files should not "
  1194. "be same inode [ino:orig %lu, donor %lu]\n",
  1195. orig_inode->i_ino, donor_inode->i_ino);
  1196. return -EINVAL;
  1197. }
  1198. /* Regular file check */
  1199. if (!S_ISREG(orig_inode->i_mode) || !S_ISREG(donor_inode->i_mode)) {
  1200. ext4_debug("ext4 move extent: The argument files should be "
  1201. "regular file [ino:orig %lu, donor %lu]\n",
  1202. orig_inode->i_ino, donor_inode->i_ino);
  1203. return -EINVAL;
  1204. }
  1205. /* TODO: This is non obvious task to swap blocks for inodes with full
  1206. jornaling enabled */
  1207. if (ext4_should_journal_data(orig_inode) ||
  1208. ext4_should_journal_data(donor_inode)) {
  1209. return -EINVAL;
  1210. }
  1211. /* Protect orig and donor inodes against a truncate */
  1212. ext4_inode_double_lock(orig_inode, donor_inode);
  1213. /* Wait for all existing dio workers */
  1214. ext4_inode_block_unlocked_dio(orig_inode);
  1215. ext4_inode_block_unlocked_dio(donor_inode);
  1216. inode_dio_wait(orig_inode);
  1217. inode_dio_wait(donor_inode);
  1218. /* Protect extent tree against block allocations via delalloc */
  1219. ext4_double_down_write_data_sem(orig_inode, donor_inode);
  1220. /* Check the filesystem environment whether move_extent can be done */
  1221. ret = mext_check_arguments(orig_inode, donor_inode, orig_start,
  1222. donor_start, &len);
  1223. if (ret)
  1224. goto out;
  1225. file_end = (i_size_read(orig_inode) - 1) >> orig_inode->i_blkbits;
  1226. block_end = block_start + len - 1;
  1227. if (file_end < block_end)
  1228. len -= block_end - file_end;
  1229. ret = get_ext_path(orig_inode, block_start, &orig_path);
  1230. if (ret)
  1231. goto out;
  1232. /* Get path structure to check the hole */
  1233. ret = get_ext_path(orig_inode, block_start, &holecheck_path);
  1234. if (ret)
  1235. goto out;
  1236. depth = ext_depth(orig_inode);
  1237. ext_cur = holecheck_path[depth].p_ext;
  1238. /*
  1239. * Get proper starting location of block replacement if block_start was
  1240. * within the hole.
  1241. */
  1242. if (le32_to_cpu(ext_cur->ee_block) +
  1243. ext4_ext_get_actual_len(ext_cur) - 1 < block_start) {
  1244. /*
  1245. * The hole exists between extents or the tail of
  1246. * original file.
  1247. */
  1248. last_extent = mext_next_extent(orig_inode,
  1249. holecheck_path, &ext_cur);
  1250. if (last_extent < 0) {
  1251. ret = last_extent;
  1252. goto out;
  1253. }
  1254. last_extent = mext_next_extent(orig_inode, orig_path,
  1255. &ext_dummy);
  1256. if (last_extent < 0) {
  1257. ret = last_extent;
  1258. goto out;
  1259. }
  1260. seq_start = le32_to_cpu(ext_cur->ee_block);
  1261. } else if (le32_to_cpu(ext_cur->ee_block) > block_start)
  1262. /* The hole exists at the beginning of original file. */
  1263. seq_start = le32_to_cpu(ext_cur->ee_block);
  1264. else
  1265. seq_start = block_start;
  1266. /* No blocks within the specified range. */
  1267. if (le32_to_cpu(ext_cur->ee_block) > block_end) {
  1268. ext4_debug("ext4 move extent: The specified range of file "
  1269. "may be the hole\n");
  1270. ret = -EINVAL;
  1271. goto out;
  1272. }
  1273. /* Adjust start blocks */
  1274. add_blocks = min(le32_to_cpu(ext_cur->ee_block) +
  1275. ext4_ext_get_actual_len(ext_cur), block_end + 1) -
  1276. max(le32_to_cpu(ext_cur->ee_block), block_start);
  1277. while (!last_extent && le32_to_cpu(ext_cur->ee_block) <= block_end) {
  1278. seq_blocks += add_blocks;
  1279. /* Adjust tail blocks */
  1280. if (seq_start + seq_blocks - 1 > block_end)
  1281. seq_blocks = block_end - seq_start + 1;
  1282. ext_prev = ext_cur;
  1283. last_extent = mext_next_extent(orig_inode, holecheck_path,
  1284. &ext_cur);
  1285. if (last_extent < 0) {
  1286. ret = last_extent;
  1287. break;
  1288. }
  1289. add_blocks = ext4_ext_get_actual_len(ext_cur);
  1290. /*
  1291. * Extend the length of contiguous block (seq_blocks)
  1292. * if extents are contiguous.
  1293. */
  1294. if (ext4_can_extents_be_merged(orig_inode,
  1295. ext_prev, ext_cur) &&
  1296. block_end >= le32_to_cpu(ext_cur->ee_block) &&
  1297. !last_extent)
  1298. continue;
  1299. /* Is original extent is uninitialized */
  1300. uninit = ext4_ext_is_uninitialized(ext_prev);
  1301. data_offset_in_page = seq_start % blocks_per_page;
  1302. /*
  1303. * Calculate data blocks count that should be swapped
  1304. * at the first page.
  1305. */
  1306. if (data_offset_in_page + seq_blocks > blocks_per_page) {
  1307. /* Swapped blocks are across pages */
  1308. block_len_in_page =
  1309. blocks_per_page - data_offset_in_page;
  1310. } else {
  1311. /* Swapped blocks are in a page */
  1312. block_len_in_page = seq_blocks;
  1313. }
  1314. orig_page_offset = seq_start >>
  1315. (PAGE_CACHE_SHIFT - orig_inode->i_blkbits);
  1316. seq_end_page = (seq_start + seq_blocks - 1) >>
  1317. (PAGE_CACHE_SHIFT - orig_inode->i_blkbits);
  1318. seq_start = le32_to_cpu(ext_cur->ee_block);
  1319. rest_blocks = seq_blocks;
  1320. /*
  1321. * Up semaphore to avoid following problems:
  1322. * a. transaction deadlock among ext4_journal_start,
  1323. * ->write_begin via pagefault, and jbd2_journal_commit
  1324. * b. racing with ->readpage, ->write_begin, and ext4_get_block
  1325. * in move_extent_per_page
  1326. */
  1327. ext4_double_up_write_data_sem(orig_inode, donor_inode);
  1328. while (orig_page_offset <= seq_end_page) {
  1329. /* Swap original branches with new branches */
  1330. block_len_in_page = move_extent_per_page(
  1331. o_filp, donor_inode,
  1332. orig_page_offset,
  1333. data_offset_in_page,
  1334. block_len_in_page, uninit,
  1335. &ret);
  1336. /* Count how many blocks we have exchanged */
  1337. *moved_len += block_len_in_page;
  1338. if (ret < 0)
  1339. break;
  1340. if (*moved_len > len) {
  1341. EXT4_ERROR_INODE(orig_inode,
  1342. "We replaced blocks too much! "
  1343. "sum of replaced: %llu requested: %llu",
  1344. *moved_len, len);
  1345. ret = -EIO;
  1346. break;
  1347. }
  1348. orig_page_offset++;
  1349. data_offset_in_page = 0;
  1350. rest_blocks -= block_len_in_page;
  1351. if (rest_blocks > blocks_per_page)
  1352. block_len_in_page = blocks_per_page;
  1353. else
  1354. block_len_in_page = rest_blocks;
  1355. }
  1356. ext4_double_down_write_data_sem(orig_inode, donor_inode);
  1357. if (ret < 0)
  1358. break;
  1359. /* Decrease buffer counter */
  1360. if (holecheck_path)
  1361. ext4_ext_drop_refs(holecheck_path);
  1362. ret = get_ext_path(orig_inode, seq_start, &holecheck_path);
  1363. if (ret)
  1364. break;
  1365. depth = holecheck_path->p_depth;
  1366. /* Decrease buffer counter */
  1367. if (orig_path)
  1368. ext4_ext_drop_refs(orig_path);
  1369. ret = get_ext_path(orig_inode, seq_start, &orig_path);
  1370. if (ret)
  1371. break;
  1372. ext_cur = holecheck_path[depth].p_ext;
  1373. add_blocks = ext4_ext_get_actual_len(ext_cur);
  1374. seq_blocks = 0;
  1375. }
  1376. out:
  1377. if (*moved_len) {
  1378. ext4_discard_preallocations(orig_inode);
  1379. ext4_discard_preallocations(donor_inode);
  1380. }
  1381. if (orig_path) {
  1382. ext4_ext_drop_refs(orig_path);
  1383. kfree(orig_path);
  1384. }
  1385. if (holecheck_path) {
  1386. ext4_ext_drop_refs(holecheck_path);
  1387. kfree(holecheck_path);
  1388. }
  1389. ext4_double_up_write_data_sem(orig_inode, donor_inode);
  1390. ext4_inode_resume_unlocked_dio(orig_inode);
  1391. ext4_inode_resume_unlocked_dio(donor_inode);
  1392. ext4_inode_double_unlock(orig_inode, donor_inode);
  1393. return ret;
  1394. }