move_extent.c 41 KB

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