move_extent.c 45 KB

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