move_extent.c 44 KB

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