move_extent.c 45 KB

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