move_extent.c 44 KB

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