inode.c 89 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461
  1. /*
  2. * Copyright (C) 2007 Oracle. All rights reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public
  6. * License v2 as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public
  14. * License along with this program; if not, write to the
  15. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16. * Boston, MA 021110-1307, USA.
  17. */
  18. #include <linux/kernel.h>
  19. #include <linux/bio.h>
  20. #include <linux/buffer_head.h>
  21. #include <linux/fs.h>
  22. #include <linux/pagemap.h>
  23. #include <linux/highmem.h>
  24. #include <linux/time.h>
  25. #include <linux/init.h>
  26. #include <linux/string.h>
  27. #include <linux/smp_lock.h>
  28. #include <linux/backing-dev.h>
  29. #include <linux/mpage.h>
  30. #include <linux/swap.h>
  31. #include <linux/writeback.h>
  32. #include <linux/statfs.h>
  33. #include <linux/compat.h>
  34. #include <linux/bit_spinlock.h>
  35. #include <linux/version.h>
  36. #include <linux/xattr.h>
  37. #include "ctree.h"
  38. #include "disk-io.h"
  39. #include "transaction.h"
  40. #include "btrfs_inode.h"
  41. #include "ioctl.h"
  42. #include "print-tree.h"
  43. #include "volumes.h"
  44. struct btrfs_iget_args {
  45. u64 ino;
  46. struct btrfs_root *root;
  47. };
  48. static struct inode_operations btrfs_dir_inode_operations;
  49. static struct inode_operations btrfs_symlink_inode_operations;
  50. static struct inode_operations btrfs_dir_ro_inode_operations;
  51. static struct inode_operations btrfs_special_inode_operations;
  52. static struct inode_operations btrfs_file_inode_operations;
  53. static struct address_space_operations btrfs_aops;
  54. static struct address_space_operations btrfs_symlink_aops;
  55. static struct file_operations btrfs_dir_file_operations;
  56. static struct extent_io_ops btrfs_extent_io_ops;
  57. static struct kmem_cache *btrfs_inode_cachep;
  58. struct kmem_cache *btrfs_trans_handle_cachep;
  59. struct kmem_cache *btrfs_transaction_cachep;
  60. struct kmem_cache *btrfs_bit_radix_cachep;
  61. struct kmem_cache *btrfs_path_cachep;
  62. #define S_SHIFT 12
  63. static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
  64. [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE,
  65. [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR,
  66. [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV,
  67. [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV,
  68. [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO,
  69. [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK,
  70. [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK,
  71. };
  72. int btrfs_check_free_space(struct btrfs_root *root, u64 num_required,
  73. int for_del)
  74. {
  75. u64 total = btrfs_super_total_bytes(&root->fs_info->super_copy);
  76. u64 used = btrfs_super_bytes_used(&root->fs_info->super_copy);
  77. u64 thresh;
  78. unsigned long flags;
  79. int ret = 0;
  80. if (for_del)
  81. thresh = total * 90;
  82. else
  83. thresh = total * 85;
  84. do_div(thresh, 100);
  85. spin_lock_irqsave(&root->fs_info->delalloc_lock, flags);
  86. if (used + root->fs_info->delalloc_bytes + num_required > thresh)
  87. ret = -ENOSPC;
  88. spin_unlock_irqrestore(&root->fs_info->delalloc_lock, flags);
  89. return ret;
  90. }
  91. static int cow_file_range(struct inode *inode, u64 start, u64 end)
  92. {
  93. struct btrfs_root *root = BTRFS_I(inode)->root;
  94. struct btrfs_trans_handle *trans;
  95. u64 alloc_hint = 0;
  96. u64 num_bytes;
  97. u64 cur_alloc_size;
  98. u64 blocksize = root->sectorsize;
  99. u64 orig_start = start;
  100. u64 orig_num_bytes;
  101. struct btrfs_key ins;
  102. int ret;
  103. trans = btrfs_start_transaction(root, 1);
  104. BUG_ON(!trans);
  105. btrfs_set_trans_block_group(trans, inode);
  106. num_bytes = (end - start + blocksize) & ~(blocksize - 1);
  107. num_bytes = max(blocksize, num_bytes);
  108. ret = btrfs_drop_extents(trans, root, inode,
  109. start, start + num_bytes, start, &alloc_hint);
  110. orig_num_bytes = num_bytes;
  111. if (alloc_hint == EXTENT_MAP_INLINE)
  112. goto out;
  113. BUG_ON(num_bytes > btrfs_super_total_bytes(&root->fs_info->super_copy));
  114. while(num_bytes > 0) {
  115. cur_alloc_size = min(num_bytes, root->fs_info->max_extent);
  116. ret = btrfs_alloc_extent(trans, root, cur_alloc_size,
  117. root->sectorsize,
  118. root->root_key.objectid,
  119. trans->transid,
  120. inode->i_ino, start, 0,
  121. alloc_hint, (u64)-1, &ins, 1);
  122. if (ret) {
  123. WARN_ON(1);
  124. goto out;
  125. }
  126. cur_alloc_size = ins.offset;
  127. ret = btrfs_insert_file_extent(trans, root, inode->i_ino,
  128. start, ins.objectid, ins.offset,
  129. ins.offset);
  130. inode->i_blocks += ins.offset >> 9;
  131. btrfs_check_file(root, inode);
  132. if (num_bytes < cur_alloc_size) {
  133. printk("num_bytes %Lu cur_alloc %Lu\n", num_bytes,
  134. cur_alloc_size);
  135. break;
  136. }
  137. num_bytes -= cur_alloc_size;
  138. alloc_hint = ins.objectid + ins.offset;
  139. start += cur_alloc_size;
  140. }
  141. btrfs_drop_extent_cache(inode, orig_start,
  142. orig_start + orig_num_bytes - 1);
  143. btrfs_add_ordered_inode(inode);
  144. btrfs_update_inode(trans, root, inode);
  145. out:
  146. btrfs_end_transaction(trans, root);
  147. return ret;
  148. }
  149. static int run_delalloc_nocow(struct inode *inode, u64 start, u64 end)
  150. {
  151. u64 extent_start;
  152. u64 extent_end;
  153. u64 bytenr;
  154. u64 cow_end;
  155. u64 loops = 0;
  156. u64 total_fs_bytes;
  157. struct btrfs_root *root = BTRFS_I(inode)->root;
  158. struct extent_buffer *leaf;
  159. int found_type;
  160. struct btrfs_path *path;
  161. struct btrfs_file_extent_item *item;
  162. int ret;
  163. int err;
  164. struct btrfs_key found_key;
  165. total_fs_bytes = btrfs_super_total_bytes(&root->fs_info->super_copy);
  166. path = btrfs_alloc_path();
  167. BUG_ON(!path);
  168. again:
  169. ret = btrfs_lookup_file_extent(NULL, root, path,
  170. inode->i_ino, start, 0);
  171. if (ret < 0) {
  172. btrfs_free_path(path);
  173. return ret;
  174. }
  175. cow_end = end;
  176. if (ret != 0) {
  177. if (path->slots[0] == 0)
  178. goto not_found;
  179. path->slots[0]--;
  180. }
  181. leaf = path->nodes[0];
  182. item = btrfs_item_ptr(leaf, path->slots[0],
  183. struct btrfs_file_extent_item);
  184. /* are we inside the extent that was found? */
  185. btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
  186. found_type = btrfs_key_type(&found_key);
  187. if (found_key.objectid != inode->i_ino ||
  188. found_type != BTRFS_EXTENT_DATA_KEY) {
  189. goto not_found;
  190. }
  191. found_type = btrfs_file_extent_type(leaf, item);
  192. extent_start = found_key.offset;
  193. if (found_type == BTRFS_FILE_EXTENT_REG) {
  194. u64 extent_num_bytes;
  195. extent_num_bytes = btrfs_file_extent_num_bytes(leaf, item);
  196. extent_end = extent_start + extent_num_bytes;
  197. err = 0;
  198. if (loops && start != extent_start)
  199. goto not_found;
  200. if (start < extent_start || start >= extent_end)
  201. goto not_found;
  202. cow_end = min(end, extent_end - 1);
  203. bytenr = btrfs_file_extent_disk_bytenr(leaf, item);
  204. if (bytenr == 0)
  205. goto not_found;
  206. /*
  207. * we may be called by the resizer, make sure we're inside
  208. * the limits of the FS
  209. */
  210. if (bytenr + extent_num_bytes > total_fs_bytes)
  211. goto not_found;
  212. if (btrfs_count_snapshots_in_path(root, path, bytenr) != 1) {
  213. goto not_found;
  214. }
  215. start = extent_end;
  216. } else {
  217. goto not_found;
  218. }
  219. loop:
  220. if (start > end) {
  221. btrfs_free_path(path);
  222. return 0;
  223. }
  224. btrfs_release_path(root, path);
  225. loops++;
  226. goto again;
  227. not_found:
  228. cow_file_range(inode, start, cow_end);
  229. start = cow_end + 1;
  230. goto loop;
  231. }
  232. static int run_delalloc_range(struct inode *inode, u64 start, u64 end)
  233. {
  234. struct btrfs_root *root = BTRFS_I(inode)->root;
  235. int ret;
  236. mutex_lock(&root->fs_info->fs_mutex);
  237. if (btrfs_test_opt(root, NODATACOW) ||
  238. btrfs_test_flag(inode, NODATACOW))
  239. ret = run_delalloc_nocow(inode, start, end);
  240. else
  241. ret = cow_file_range(inode, start, end);
  242. mutex_unlock(&root->fs_info->fs_mutex);
  243. return ret;
  244. }
  245. int btrfs_set_bit_hook(struct inode *inode, u64 start, u64 end,
  246. unsigned long old, unsigned long bits)
  247. {
  248. unsigned long flags;
  249. if (!(old & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) {
  250. struct btrfs_root *root = BTRFS_I(inode)->root;
  251. spin_lock_irqsave(&root->fs_info->delalloc_lock, flags);
  252. BTRFS_I(inode)->delalloc_bytes += end - start + 1;
  253. root->fs_info->delalloc_bytes += end - start + 1;
  254. spin_unlock_irqrestore(&root->fs_info->delalloc_lock, flags);
  255. }
  256. return 0;
  257. }
  258. int btrfs_clear_bit_hook(struct inode *inode, u64 start, u64 end,
  259. unsigned long old, unsigned long bits)
  260. {
  261. if ((old & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) {
  262. struct btrfs_root *root = BTRFS_I(inode)->root;
  263. unsigned long flags;
  264. spin_lock_irqsave(&root->fs_info->delalloc_lock, flags);
  265. if (end - start + 1 > root->fs_info->delalloc_bytes) {
  266. printk("warning: delalloc account %Lu %Lu\n",
  267. end - start + 1, root->fs_info->delalloc_bytes);
  268. root->fs_info->delalloc_bytes = 0;
  269. BTRFS_I(inode)->delalloc_bytes = 0;
  270. } else {
  271. root->fs_info->delalloc_bytes -= end - start + 1;
  272. BTRFS_I(inode)->delalloc_bytes -= end - start + 1;
  273. }
  274. spin_unlock_irqrestore(&root->fs_info->delalloc_lock, flags);
  275. }
  276. return 0;
  277. }
  278. int btrfs_merge_bio_hook(struct page *page, unsigned long offset,
  279. size_t size, struct bio *bio)
  280. {
  281. struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
  282. struct btrfs_mapping_tree *map_tree;
  283. u64 logical = bio->bi_sector << 9;
  284. u64 length = 0;
  285. u64 map_length;
  286. int ret;
  287. length = bio->bi_size;
  288. map_tree = &root->fs_info->mapping_tree;
  289. map_length = length;
  290. ret = btrfs_map_block(map_tree, READ, logical,
  291. &map_length, NULL, 0);
  292. if (map_length < length + size) {
  293. return 1;
  294. }
  295. return 0;
  296. }
  297. int __btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
  298. int mirror_num)
  299. {
  300. struct btrfs_root *root = BTRFS_I(inode)->root;
  301. struct btrfs_trans_handle *trans;
  302. int ret = 0;
  303. char *sums = NULL;
  304. ret = btrfs_csum_one_bio(root, bio, &sums);
  305. BUG_ON(ret);
  306. mutex_lock(&root->fs_info->fs_mutex);
  307. trans = btrfs_start_transaction(root, 1);
  308. btrfs_set_trans_block_group(trans, inode);
  309. btrfs_csum_file_blocks(trans, root, inode, bio, sums);
  310. ret = btrfs_end_transaction(trans, root);
  311. BUG_ON(ret);
  312. mutex_unlock(&root->fs_info->fs_mutex);
  313. kfree(sums);
  314. return btrfs_map_bio(root, rw, bio, mirror_num);
  315. }
  316. int btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
  317. int mirror_num)
  318. {
  319. struct btrfs_root *root = BTRFS_I(inode)->root;
  320. int ret = 0;
  321. if (!(rw & (1 << BIO_RW))) {
  322. ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0);
  323. BUG_ON(ret);
  324. goto mapit;
  325. }
  326. if (btrfs_test_opt(root, NODATASUM) ||
  327. btrfs_test_flag(inode, NODATASUM)) {
  328. goto mapit;
  329. }
  330. return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
  331. inode, rw, bio, mirror_num,
  332. __btrfs_submit_bio_hook);
  333. mapit:
  334. return btrfs_map_bio(root, rw, bio, mirror_num);
  335. }
  336. int btrfs_readpage_io_hook(struct page *page, u64 start, u64 end)
  337. {
  338. int ret = 0;
  339. struct inode *inode = page->mapping->host;
  340. struct btrfs_root *root = BTRFS_I(inode)->root;
  341. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  342. struct btrfs_csum_item *item;
  343. struct btrfs_path *path = NULL;
  344. u32 csum;
  345. if (btrfs_test_opt(root, NODATASUM) ||
  346. btrfs_test_flag(inode, NODATASUM))
  347. return 0;
  348. mutex_lock(&root->fs_info->fs_mutex);
  349. path = btrfs_alloc_path();
  350. item = btrfs_lookup_csum(NULL, root, path, inode->i_ino, start, 0);
  351. if (IS_ERR(item)) {
  352. ret = PTR_ERR(item);
  353. /* a csum that isn't present is a preallocated region. */
  354. if (ret == -ENOENT || ret == -EFBIG)
  355. ret = 0;
  356. csum = 0;
  357. printk("no csum found for inode %lu start %Lu\n", inode->i_ino, start);
  358. goto out;
  359. }
  360. read_extent_buffer(path->nodes[0], &csum, (unsigned long)item,
  361. BTRFS_CRC32_SIZE);
  362. set_state_private(io_tree, start, csum);
  363. out:
  364. if (path)
  365. btrfs_free_path(path);
  366. mutex_unlock(&root->fs_info->fs_mutex);
  367. return ret;
  368. }
  369. struct io_failure_record {
  370. struct page *page;
  371. u64 start;
  372. u64 len;
  373. u64 logical;
  374. int last_mirror;
  375. };
  376. int btrfs_readpage_io_failed_hook(struct bio *failed_bio,
  377. struct page *page, u64 start, u64 end,
  378. struct extent_state *state)
  379. {
  380. struct io_failure_record *failrec = NULL;
  381. u64 private;
  382. struct extent_map *em;
  383. struct inode *inode = page->mapping->host;
  384. struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
  385. struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
  386. struct bio *bio;
  387. int num_copies;
  388. int ret;
  389. u64 logical;
  390. ret = get_state_private(failure_tree, start, &private);
  391. if (ret) {
  392. failrec = kmalloc(sizeof(*failrec), GFP_NOFS);
  393. if (!failrec)
  394. return -ENOMEM;
  395. failrec->start = start;
  396. failrec->len = end - start + 1;
  397. failrec->last_mirror = 0;
  398. spin_lock(&em_tree->lock);
  399. em = lookup_extent_mapping(em_tree, start, failrec->len);
  400. if (em->start > start || em->start + em->len < start) {
  401. free_extent_map(em);
  402. em = NULL;
  403. }
  404. spin_unlock(&em_tree->lock);
  405. if (!em || IS_ERR(em)) {
  406. kfree(failrec);
  407. return -EIO;
  408. }
  409. logical = start - em->start;
  410. logical = em->block_start + logical;
  411. failrec->logical = logical;
  412. free_extent_map(em);
  413. set_extent_bits(failure_tree, start, end, EXTENT_LOCKED |
  414. EXTENT_DIRTY, GFP_NOFS);
  415. set_state_private(failure_tree, start,
  416. (u64)(unsigned long)failrec);
  417. } else {
  418. failrec = (struct io_failure_record *)(unsigned long)private;
  419. }
  420. num_copies = btrfs_num_copies(
  421. &BTRFS_I(inode)->root->fs_info->mapping_tree,
  422. failrec->logical, failrec->len);
  423. failrec->last_mirror++;
  424. if (!state) {
  425. spin_lock_irq(&BTRFS_I(inode)->io_tree.lock);
  426. state = find_first_extent_bit_state(&BTRFS_I(inode)->io_tree,
  427. failrec->start,
  428. EXTENT_LOCKED);
  429. if (state && state->start != failrec->start)
  430. state = NULL;
  431. spin_unlock_irq(&BTRFS_I(inode)->io_tree.lock);
  432. }
  433. if (!state || failrec->last_mirror > num_copies) {
  434. set_state_private(failure_tree, failrec->start, 0);
  435. clear_extent_bits(failure_tree, failrec->start,
  436. failrec->start + failrec->len - 1,
  437. EXTENT_LOCKED | EXTENT_DIRTY, GFP_NOFS);
  438. kfree(failrec);
  439. return -EIO;
  440. }
  441. bio = bio_alloc(GFP_NOFS, 1);
  442. bio->bi_private = state;
  443. bio->bi_end_io = failed_bio->bi_end_io;
  444. bio->bi_sector = failrec->logical >> 9;
  445. bio->bi_bdev = failed_bio->bi_bdev;
  446. bio->bi_size = 0;
  447. bio_add_page(bio, page, failrec->len, start - page_offset(page));
  448. btrfs_submit_bio_hook(inode, READ, bio, failrec->last_mirror);
  449. return 0;
  450. }
  451. int btrfs_readpage_end_io_hook(struct page *page, u64 start, u64 end,
  452. struct extent_state *state)
  453. {
  454. size_t offset = start - ((u64)page->index << PAGE_CACHE_SHIFT);
  455. struct inode *inode = page->mapping->host;
  456. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  457. char *kaddr;
  458. u64 private = ~(u32)0;
  459. int ret;
  460. struct btrfs_root *root = BTRFS_I(inode)->root;
  461. u32 csum = ~(u32)0;
  462. unsigned long flags;
  463. if (btrfs_test_opt(root, NODATASUM) ||
  464. btrfs_test_flag(inode, NODATASUM))
  465. return 0;
  466. if (state && state->start == start) {
  467. private = state->private;
  468. ret = 0;
  469. } else {
  470. ret = get_state_private(io_tree, start, &private);
  471. }
  472. local_irq_save(flags);
  473. kaddr = kmap_atomic(page, KM_IRQ0);
  474. if (ret) {
  475. goto zeroit;
  476. }
  477. csum = btrfs_csum_data(root, kaddr + offset, csum, end - start + 1);
  478. btrfs_csum_final(csum, (char *)&csum);
  479. if (csum != private) {
  480. goto zeroit;
  481. }
  482. kunmap_atomic(kaddr, KM_IRQ0);
  483. local_irq_restore(flags);
  484. /* if the io failure tree for this inode is non-empty,
  485. * check to see if we've recovered from a failed IO
  486. */
  487. private = 0;
  488. if (count_range_bits(&BTRFS_I(inode)->io_failure_tree, &private,
  489. (u64)-1, 1, EXTENT_DIRTY)) {
  490. u64 private_failure;
  491. struct io_failure_record *failure;
  492. ret = get_state_private(&BTRFS_I(inode)->io_failure_tree,
  493. start, &private_failure);
  494. if (ret == 0) {
  495. failure = (struct io_failure_record *)(unsigned long)
  496. private_failure;
  497. set_state_private(&BTRFS_I(inode)->io_failure_tree,
  498. failure->start, 0);
  499. clear_extent_bits(&BTRFS_I(inode)->io_failure_tree,
  500. failure->start,
  501. failure->start + failure->len - 1,
  502. EXTENT_DIRTY | EXTENT_LOCKED,
  503. GFP_NOFS);
  504. kfree(failure);
  505. }
  506. }
  507. return 0;
  508. zeroit:
  509. printk("btrfs csum failed ino %lu off %llu csum %u private %Lu\n",
  510. page->mapping->host->i_ino, (unsigned long long)start, csum,
  511. private);
  512. memset(kaddr + offset, 1, end - start + 1);
  513. flush_dcache_page(page);
  514. kunmap_atomic(kaddr, KM_IRQ0);
  515. local_irq_restore(flags);
  516. if (private == 0)
  517. return 0;
  518. return -EIO;
  519. }
  520. void btrfs_read_locked_inode(struct inode *inode)
  521. {
  522. struct btrfs_path *path;
  523. struct extent_buffer *leaf;
  524. struct btrfs_inode_item *inode_item;
  525. struct btrfs_timespec *tspec;
  526. struct btrfs_root *root = BTRFS_I(inode)->root;
  527. struct btrfs_key location;
  528. u64 alloc_group_block;
  529. u32 rdev;
  530. int ret;
  531. path = btrfs_alloc_path();
  532. BUG_ON(!path);
  533. mutex_lock(&root->fs_info->fs_mutex);
  534. memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
  535. ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
  536. if (ret)
  537. goto make_bad;
  538. leaf = path->nodes[0];
  539. inode_item = btrfs_item_ptr(leaf, path->slots[0],
  540. struct btrfs_inode_item);
  541. inode->i_mode = btrfs_inode_mode(leaf, inode_item);
  542. inode->i_nlink = btrfs_inode_nlink(leaf, inode_item);
  543. inode->i_uid = btrfs_inode_uid(leaf, inode_item);
  544. inode->i_gid = btrfs_inode_gid(leaf, inode_item);
  545. inode->i_size = btrfs_inode_size(leaf, inode_item);
  546. tspec = btrfs_inode_atime(inode_item);
  547. inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, tspec);
  548. inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
  549. tspec = btrfs_inode_mtime(inode_item);
  550. inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, tspec);
  551. inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
  552. tspec = btrfs_inode_ctime(inode_item);
  553. inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, tspec);
  554. inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
  555. inode->i_blocks = btrfs_inode_nblocks(leaf, inode_item);
  556. inode->i_generation = btrfs_inode_generation(leaf, inode_item);
  557. inode->i_rdev = 0;
  558. rdev = btrfs_inode_rdev(leaf, inode_item);
  559. alloc_group_block = btrfs_inode_block_group(leaf, inode_item);
  560. BTRFS_I(inode)->block_group = btrfs_lookup_block_group(root->fs_info,
  561. alloc_group_block);
  562. BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item);
  563. if (!BTRFS_I(inode)->block_group) {
  564. BTRFS_I(inode)->block_group = btrfs_find_block_group(root,
  565. NULL, 0,
  566. BTRFS_BLOCK_GROUP_METADATA, 0);
  567. }
  568. btrfs_free_path(path);
  569. inode_item = NULL;
  570. mutex_unlock(&root->fs_info->fs_mutex);
  571. switch (inode->i_mode & S_IFMT) {
  572. case S_IFREG:
  573. inode->i_mapping->a_ops = &btrfs_aops;
  574. inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
  575. BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
  576. inode->i_fop = &btrfs_file_operations;
  577. inode->i_op = &btrfs_file_inode_operations;
  578. break;
  579. case S_IFDIR:
  580. inode->i_fop = &btrfs_dir_file_operations;
  581. if (root == root->fs_info->tree_root)
  582. inode->i_op = &btrfs_dir_ro_inode_operations;
  583. else
  584. inode->i_op = &btrfs_dir_inode_operations;
  585. break;
  586. case S_IFLNK:
  587. inode->i_op = &btrfs_symlink_inode_operations;
  588. inode->i_mapping->a_ops = &btrfs_symlink_aops;
  589. inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
  590. break;
  591. default:
  592. init_special_inode(inode, inode->i_mode, rdev);
  593. break;
  594. }
  595. return;
  596. make_bad:
  597. btrfs_release_path(root, path);
  598. btrfs_free_path(path);
  599. mutex_unlock(&root->fs_info->fs_mutex);
  600. make_bad_inode(inode);
  601. }
  602. static void fill_inode_item(struct extent_buffer *leaf,
  603. struct btrfs_inode_item *item,
  604. struct inode *inode)
  605. {
  606. btrfs_set_inode_uid(leaf, item, inode->i_uid);
  607. btrfs_set_inode_gid(leaf, item, inode->i_gid);
  608. btrfs_set_inode_size(leaf, item, inode->i_size);
  609. btrfs_set_inode_mode(leaf, item, inode->i_mode);
  610. btrfs_set_inode_nlink(leaf, item, inode->i_nlink);
  611. btrfs_set_timespec_sec(leaf, btrfs_inode_atime(item),
  612. inode->i_atime.tv_sec);
  613. btrfs_set_timespec_nsec(leaf, btrfs_inode_atime(item),
  614. inode->i_atime.tv_nsec);
  615. btrfs_set_timespec_sec(leaf, btrfs_inode_mtime(item),
  616. inode->i_mtime.tv_sec);
  617. btrfs_set_timespec_nsec(leaf, btrfs_inode_mtime(item),
  618. inode->i_mtime.tv_nsec);
  619. btrfs_set_timespec_sec(leaf, btrfs_inode_ctime(item),
  620. inode->i_ctime.tv_sec);
  621. btrfs_set_timespec_nsec(leaf, btrfs_inode_ctime(item),
  622. inode->i_ctime.tv_nsec);
  623. btrfs_set_inode_nblocks(leaf, item, inode->i_blocks);
  624. btrfs_set_inode_generation(leaf, item, inode->i_generation);
  625. btrfs_set_inode_rdev(leaf, item, inode->i_rdev);
  626. btrfs_set_inode_flags(leaf, item, BTRFS_I(inode)->flags);
  627. btrfs_set_inode_block_group(leaf, item,
  628. BTRFS_I(inode)->block_group->key.objectid);
  629. }
  630. int btrfs_update_inode(struct btrfs_trans_handle *trans,
  631. struct btrfs_root *root,
  632. struct inode *inode)
  633. {
  634. struct btrfs_inode_item *inode_item;
  635. struct btrfs_path *path;
  636. struct extent_buffer *leaf;
  637. int ret;
  638. path = btrfs_alloc_path();
  639. BUG_ON(!path);
  640. ret = btrfs_lookup_inode(trans, root, path,
  641. &BTRFS_I(inode)->location, 1);
  642. if (ret) {
  643. if (ret > 0)
  644. ret = -ENOENT;
  645. goto failed;
  646. }
  647. leaf = path->nodes[0];
  648. inode_item = btrfs_item_ptr(leaf, path->slots[0],
  649. struct btrfs_inode_item);
  650. fill_inode_item(leaf, inode_item, inode);
  651. btrfs_mark_buffer_dirty(leaf);
  652. btrfs_set_inode_last_trans(trans, inode);
  653. ret = 0;
  654. failed:
  655. btrfs_release_path(root, path);
  656. btrfs_free_path(path);
  657. return ret;
  658. }
  659. static int btrfs_unlink_trans(struct btrfs_trans_handle *trans,
  660. struct btrfs_root *root,
  661. struct inode *dir,
  662. struct dentry *dentry)
  663. {
  664. struct btrfs_path *path;
  665. const char *name = dentry->d_name.name;
  666. int name_len = dentry->d_name.len;
  667. int ret = 0;
  668. struct extent_buffer *leaf;
  669. struct btrfs_dir_item *di;
  670. struct btrfs_key key;
  671. path = btrfs_alloc_path();
  672. if (!path) {
  673. ret = -ENOMEM;
  674. goto err;
  675. }
  676. di = btrfs_lookup_dir_item(trans, root, path, dir->i_ino,
  677. name, name_len, -1);
  678. if (IS_ERR(di)) {
  679. ret = PTR_ERR(di);
  680. goto err;
  681. }
  682. if (!di) {
  683. ret = -ENOENT;
  684. goto err;
  685. }
  686. leaf = path->nodes[0];
  687. btrfs_dir_item_key_to_cpu(leaf, di, &key);
  688. ret = btrfs_delete_one_dir_name(trans, root, path, di);
  689. if (ret)
  690. goto err;
  691. btrfs_release_path(root, path);
  692. di = btrfs_lookup_dir_index_item(trans, root, path, dir->i_ino,
  693. key.objectid, name, name_len, -1);
  694. if (IS_ERR(di)) {
  695. ret = PTR_ERR(di);
  696. goto err;
  697. }
  698. if (!di) {
  699. ret = -ENOENT;
  700. goto err;
  701. }
  702. ret = btrfs_delete_one_dir_name(trans, root, path, di);
  703. dentry->d_inode->i_ctime = dir->i_ctime;
  704. ret = btrfs_del_inode_ref(trans, root, name, name_len,
  705. dentry->d_inode->i_ino,
  706. dentry->d_parent->d_inode->i_ino);
  707. if (ret) {
  708. printk("failed to delete reference to %.*s, "
  709. "inode %lu parent %lu\n", name_len, name,
  710. dentry->d_inode->i_ino,
  711. dentry->d_parent->d_inode->i_ino);
  712. }
  713. err:
  714. btrfs_free_path(path);
  715. if (!ret) {
  716. dir->i_size -= name_len * 2;
  717. dir->i_mtime = dir->i_ctime = CURRENT_TIME;
  718. btrfs_update_inode(trans, root, dir);
  719. #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
  720. dentry->d_inode->i_nlink--;
  721. #else
  722. drop_nlink(dentry->d_inode);
  723. #endif
  724. ret = btrfs_update_inode(trans, root, dentry->d_inode);
  725. dir->i_sb->s_dirt = 1;
  726. }
  727. return ret;
  728. }
  729. static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
  730. {
  731. struct btrfs_root *root;
  732. struct btrfs_trans_handle *trans;
  733. struct inode *inode = dentry->d_inode;
  734. int ret;
  735. unsigned long nr = 0;
  736. root = BTRFS_I(dir)->root;
  737. mutex_lock(&root->fs_info->fs_mutex);
  738. ret = btrfs_check_free_space(root, 1, 1);
  739. if (ret)
  740. goto fail;
  741. trans = btrfs_start_transaction(root, 1);
  742. btrfs_set_trans_block_group(trans, dir);
  743. ret = btrfs_unlink_trans(trans, root, dir, dentry);
  744. nr = trans->blocks_used;
  745. if (inode->i_nlink == 0) {
  746. int found;
  747. /* if the inode isn't linked anywhere,
  748. * we don't need to worry about
  749. * data=ordered
  750. */
  751. found = btrfs_del_ordered_inode(inode);
  752. if (found == 1) {
  753. atomic_dec(&inode->i_count);
  754. }
  755. }
  756. btrfs_end_transaction(trans, root);
  757. fail:
  758. mutex_unlock(&root->fs_info->fs_mutex);
  759. btrfs_btree_balance_dirty(root, nr);
  760. btrfs_throttle(root);
  761. return ret;
  762. }
  763. static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
  764. {
  765. struct inode *inode = dentry->d_inode;
  766. int err = 0;
  767. int ret;
  768. struct btrfs_root *root = BTRFS_I(dir)->root;
  769. struct btrfs_trans_handle *trans;
  770. unsigned long nr = 0;
  771. if (inode->i_size > BTRFS_EMPTY_DIR_SIZE)
  772. return -ENOTEMPTY;
  773. mutex_lock(&root->fs_info->fs_mutex);
  774. ret = btrfs_check_free_space(root, 1, 1);
  775. if (ret)
  776. goto fail;
  777. trans = btrfs_start_transaction(root, 1);
  778. btrfs_set_trans_block_group(trans, dir);
  779. /* now the directory is empty */
  780. err = btrfs_unlink_trans(trans, root, dir, dentry);
  781. if (!err) {
  782. inode->i_size = 0;
  783. }
  784. nr = trans->blocks_used;
  785. ret = btrfs_end_transaction(trans, root);
  786. fail:
  787. mutex_unlock(&root->fs_info->fs_mutex);
  788. btrfs_btree_balance_dirty(root, nr);
  789. btrfs_throttle(root);
  790. if (ret && !err)
  791. err = ret;
  792. return err;
  793. }
  794. /*
  795. * this can truncate away extent items, csum items and directory items.
  796. * It starts at a high offset and removes keys until it can't find
  797. * any higher than i_size.
  798. *
  799. * csum items that cross the new i_size are truncated to the new size
  800. * as well.
  801. */
  802. static int btrfs_truncate_in_trans(struct btrfs_trans_handle *trans,
  803. struct btrfs_root *root,
  804. struct inode *inode,
  805. u32 min_type)
  806. {
  807. int ret;
  808. struct btrfs_path *path;
  809. struct btrfs_key key;
  810. struct btrfs_key found_key;
  811. u32 found_type;
  812. struct extent_buffer *leaf;
  813. struct btrfs_file_extent_item *fi;
  814. u64 extent_start = 0;
  815. u64 extent_num_bytes = 0;
  816. u64 item_end = 0;
  817. u64 root_gen = 0;
  818. u64 root_owner = 0;
  819. int found_extent;
  820. int del_item;
  821. int pending_del_nr = 0;
  822. int pending_del_slot = 0;
  823. int extent_type = -1;
  824. u64 mask = root->sectorsize - 1;
  825. btrfs_drop_extent_cache(inode, inode->i_size & (~mask), (u64)-1);
  826. path = btrfs_alloc_path();
  827. path->reada = -1;
  828. BUG_ON(!path);
  829. /* FIXME, add redo link to tree so we don't leak on crash */
  830. key.objectid = inode->i_ino;
  831. key.offset = (u64)-1;
  832. key.type = (u8)-1;
  833. btrfs_init_path(path);
  834. search_again:
  835. ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
  836. if (ret < 0) {
  837. goto error;
  838. }
  839. if (ret > 0) {
  840. BUG_ON(path->slots[0] == 0);
  841. path->slots[0]--;
  842. }
  843. while(1) {
  844. fi = NULL;
  845. leaf = path->nodes[0];
  846. btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
  847. found_type = btrfs_key_type(&found_key);
  848. if (found_key.objectid != inode->i_ino)
  849. break;
  850. if (found_type < min_type)
  851. break;
  852. item_end = found_key.offset;
  853. if (found_type == BTRFS_EXTENT_DATA_KEY) {
  854. fi = btrfs_item_ptr(leaf, path->slots[0],
  855. struct btrfs_file_extent_item);
  856. extent_type = btrfs_file_extent_type(leaf, fi);
  857. if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
  858. item_end +=
  859. btrfs_file_extent_num_bytes(leaf, fi);
  860. } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
  861. struct btrfs_item *item = btrfs_item_nr(leaf,
  862. path->slots[0]);
  863. item_end += btrfs_file_extent_inline_len(leaf,
  864. item);
  865. }
  866. item_end--;
  867. }
  868. if (found_type == BTRFS_CSUM_ITEM_KEY) {
  869. ret = btrfs_csum_truncate(trans, root, path,
  870. inode->i_size);
  871. BUG_ON(ret);
  872. }
  873. if (item_end < inode->i_size) {
  874. if (found_type == BTRFS_DIR_ITEM_KEY) {
  875. found_type = BTRFS_INODE_ITEM_KEY;
  876. } else if (found_type == BTRFS_EXTENT_ITEM_KEY) {
  877. found_type = BTRFS_CSUM_ITEM_KEY;
  878. } else if (found_type == BTRFS_EXTENT_DATA_KEY) {
  879. found_type = BTRFS_XATTR_ITEM_KEY;
  880. } else if (found_type == BTRFS_XATTR_ITEM_KEY) {
  881. found_type = BTRFS_INODE_REF_KEY;
  882. } else if (found_type) {
  883. found_type--;
  884. } else {
  885. break;
  886. }
  887. btrfs_set_key_type(&key, found_type);
  888. goto next;
  889. }
  890. if (found_key.offset >= inode->i_size)
  891. del_item = 1;
  892. else
  893. del_item = 0;
  894. found_extent = 0;
  895. /* FIXME, shrink the extent if the ref count is only 1 */
  896. if (found_type != BTRFS_EXTENT_DATA_KEY)
  897. goto delete;
  898. if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
  899. u64 num_dec;
  900. extent_start = btrfs_file_extent_disk_bytenr(leaf, fi);
  901. if (!del_item) {
  902. u64 orig_num_bytes =
  903. btrfs_file_extent_num_bytes(leaf, fi);
  904. extent_num_bytes = inode->i_size -
  905. found_key.offset + root->sectorsize - 1;
  906. extent_num_bytes = extent_num_bytes &
  907. ~((u64)root->sectorsize - 1);
  908. btrfs_set_file_extent_num_bytes(leaf, fi,
  909. extent_num_bytes);
  910. num_dec = (orig_num_bytes -
  911. extent_num_bytes);
  912. if (extent_start != 0)
  913. dec_i_blocks(inode, num_dec);
  914. btrfs_mark_buffer_dirty(leaf);
  915. } else {
  916. extent_num_bytes =
  917. btrfs_file_extent_disk_num_bytes(leaf,
  918. fi);
  919. /* FIXME blocksize != 4096 */
  920. num_dec = btrfs_file_extent_num_bytes(leaf, fi);
  921. if (extent_start != 0) {
  922. found_extent = 1;
  923. dec_i_blocks(inode, num_dec);
  924. }
  925. root_gen = btrfs_header_generation(leaf);
  926. root_owner = btrfs_header_owner(leaf);
  927. }
  928. } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
  929. if (!del_item) {
  930. u32 newsize = inode->i_size - found_key.offset;
  931. dec_i_blocks(inode, item_end + 1 -
  932. found_key.offset - newsize);
  933. newsize =
  934. btrfs_file_extent_calc_inline_size(newsize);
  935. ret = btrfs_truncate_item(trans, root, path,
  936. newsize, 1);
  937. BUG_ON(ret);
  938. } else {
  939. dec_i_blocks(inode, item_end + 1 -
  940. found_key.offset);
  941. }
  942. }
  943. delete:
  944. if (del_item) {
  945. if (!pending_del_nr) {
  946. /* no pending yet, add ourselves */
  947. pending_del_slot = path->slots[0];
  948. pending_del_nr = 1;
  949. } else if (pending_del_nr &&
  950. path->slots[0] + 1 == pending_del_slot) {
  951. /* hop on the pending chunk */
  952. pending_del_nr++;
  953. pending_del_slot = path->slots[0];
  954. } else {
  955. printk("bad pending slot %d pending_del_nr %d pending_del_slot %d\n", path->slots[0], pending_del_nr, pending_del_slot);
  956. }
  957. } else {
  958. break;
  959. }
  960. if (found_extent) {
  961. ret = btrfs_free_extent(trans, root, extent_start,
  962. extent_num_bytes,
  963. root_owner,
  964. root_gen, inode->i_ino,
  965. found_key.offset, 0);
  966. BUG_ON(ret);
  967. }
  968. next:
  969. if (path->slots[0] == 0) {
  970. if (pending_del_nr)
  971. goto del_pending;
  972. btrfs_release_path(root, path);
  973. goto search_again;
  974. }
  975. path->slots[0]--;
  976. if (pending_del_nr &&
  977. path->slots[0] + 1 != pending_del_slot) {
  978. struct btrfs_key debug;
  979. del_pending:
  980. btrfs_item_key_to_cpu(path->nodes[0], &debug,
  981. pending_del_slot);
  982. ret = btrfs_del_items(trans, root, path,
  983. pending_del_slot,
  984. pending_del_nr);
  985. BUG_ON(ret);
  986. pending_del_nr = 0;
  987. btrfs_release_path(root, path);
  988. goto search_again;
  989. }
  990. }
  991. ret = 0;
  992. error:
  993. if (pending_del_nr) {
  994. ret = btrfs_del_items(trans, root, path, pending_del_slot,
  995. pending_del_nr);
  996. }
  997. btrfs_release_path(root, path);
  998. btrfs_free_path(path);
  999. inode->i_sb->s_dirt = 1;
  1000. return ret;
  1001. }
  1002. static int btrfs_cow_one_page(struct inode *inode, struct page *page,
  1003. size_t zero_start)
  1004. {
  1005. char *kaddr;
  1006. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  1007. u64 page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  1008. u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
  1009. int ret = 0;
  1010. WARN_ON(!PageLocked(page));
  1011. set_page_extent_mapped(page);
  1012. lock_extent(io_tree, page_start, page_end, GFP_NOFS);
  1013. set_extent_delalloc(&BTRFS_I(inode)->io_tree, page_start,
  1014. page_end, GFP_NOFS);
  1015. if (zero_start != PAGE_CACHE_SIZE) {
  1016. kaddr = kmap(page);
  1017. memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start);
  1018. flush_dcache_page(page);
  1019. kunmap(page);
  1020. }
  1021. set_page_dirty(page);
  1022. unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
  1023. return ret;
  1024. }
  1025. /*
  1026. * taken from block_truncate_page, but does cow as it zeros out
  1027. * any bytes left in the last page in the file.
  1028. */
  1029. static int btrfs_truncate_page(struct address_space *mapping, loff_t from)
  1030. {
  1031. struct inode *inode = mapping->host;
  1032. struct btrfs_root *root = BTRFS_I(inode)->root;
  1033. u32 blocksize = root->sectorsize;
  1034. pgoff_t index = from >> PAGE_CACHE_SHIFT;
  1035. unsigned offset = from & (PAGE_CACHE_SIZE-1);
  1036. struct page *page;
  1037. int ret = 0;
  1038. u64 page_start;
  1039. if ((offset & (blocksize - 1)) == 0)
  1040. goto out;
  1041. ret = -ENOMEM;
  1042. page = grab_cache_page(mapping, index);
  1043. if (!page)
  1044. goto out;
  1045. if (!PageUptodate(page)) {
  1046. ret = btrfs_readpage(NULL, page);
  1047. lock_page(page);
  1048. if (!PageUptodate(page)) {
  1049. ret = -EIO;
  1050. goto out;
  1051. }
  1052. }
  1053. page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  1054. ret = btrfs_cow_one_page(inode, page, offset);
  1055. unlock_page(page);
  1056. page_cache_release(page);
  1057. out:
  1058. return ret;
  1059. }
  1060. static int btrfs_setattr(struct dentry *dentry, struct iattr *attr)
  1061. {
  1062. struct inode *inode = dentry->d_inode;
  1063. int err;
  1064. err = inode_change_ok(inode, attr);
  1065. if (err)
  1066. return err;
  1067. if (S_ISREG(inode->i_mode) &&
  1068. attr->ia_valid & ATTR_SIZE && attr->ia_size > inode->i_size) {
  1069. struct btrfs_trans_handle *trans;
  1070. struct btrfs_root *root = BTRFS_I(inode)->root;
  1071. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  1072. u64 mask = root->sectorsize - 1;
  1073. u64 hole_start = (inode->i_size + mask) & ~mask;
  1074. u64 block_end = (attr->ia_size + mask) & ~mask;
  1075. u64 hole_size;
  1076. u64 alloc_hint = 0;
  1077. if (attr->ia_size <= hole_start)
  1078. goto out;
  1079. mutex_lock(&root->fs_info->fs_mutex);
  1080. err = btrfs_check_free_space(root, 1, 0);
  1081. mutex_unlock(&root->fs_info->fs_mutex);
  1082. if (err)
  1083. goto fail;
  1084. btrfs_truncate_page(inode->i_mapping, inode->i_size);
  1085. lock_extent(io_tree, hole_start, block_end - 1, GFP_NOFS);
  1086. hole_size = block_end - hole_start;
  1087. mutex_lock(&root->fs_info->fs_mutex);
  1088. trans = btrfs_start_transaction(root, 1);
  1089. btrfs_set_trans_block_group(trans, inode);
  1090. err = btrfs_drop_extents(trans, root, inode,
  1091. hole_start, block_end, hole_start,
  1092. &alloc_hint);
  1093. if (alloc_hint != EXTENT_MAP_INLINE) {
  1094. err = btrfs_insert_file_extent(trans, root,
  1095. inode->i_ino,
  1096. hole_start, 0, 0,
  1097. hole_size);
  1098. btrfs_drop_extent_cache(inode, hole_start,
  1099. (u64)-1);
  1100. btrfs_check_file(root, inode);
  1101. }
  1102. btrfs_end_transaction(trans, root);
  1103. mutex_unlock(&root->fs_info->fs_mutex);
  1104. unlock_extent(io_tree, hole_start, block_end - 1, GFP_NOFS);
  1105. if (err)
  1106. return err;
  1107. }
  1108. out:
  1109. err = inode_setattr(inode, attr);
  1110. fail:
  1111. return err;
  1112. }
  1113. void btrfs_put_inode(struct inode *inode)
  1114. {
  1115. int ret;
  1116. if (!BTRFS_I(inode)->ordered_trans) {
  1117. return;
  1118. }
  1119. if (mapping_tagged(inode->i_mapping, PAGECACHE_TAG_DIRTY) ||
  1120. mapping_tagged(inode->i_mapping, PAGECACHE_TAG_WRITEBACK))
  1121. return;
  1122. ret = btrfs_del_ordered_inode(inode);
  1123. if (ret == 1) {
  1124. atomic_dec(&inode->i_count);
  1125. }
  1126. }
  1127. void btrfs_delete_inode(struct inode *inode)
  1128. {
  1129. struct btrfs_trans_handle *trans;
  1130. struct btrfs_root *root = BTRFS_I(inode)->root;
  1131. unsigned long nr;
  1132. int ret;
  1133. truncate_inode_pages(&inode->i_data, 0);
  1134. if (is_bad_inode(inode)) {
  1135. goto no_delete;
  1136. }
  1137. inode->i_size = 0;
  1138. mutex_lock(&root->fs_info->fs_mutex);
  1139. trans = btrfs_start_transaction(root, 1);
  1140. btrfs_set_trans_block_group(trans, inode);
  1141. ret = btrfs_truncate_in_trans(trans, root, inode, 0);
  1142. if (ret)
  1143. goto no_delete_lock;
  1144. nr = trans->blocks_used;
  1145. clear_inode(inode);
  1146. btrfs_end_transaction(trans, root);
  1147. mutex_unlock(&root->fs_info->fs_mutex);
  1148. btrfs_btree_balance_dirty(root, nr);
  1149. btrfs_throttle(root);
  1150. return;
  1151. no_delete_lock:
  1152. nr = trans->blocks_used;
  1153. btrfs_end_transaction(trans, root);
  1154. mutex_unlock(&root->fs_info->fs_mutex);
  1155. btrfs_btree_balance_dirty(root, nr);
  1156. btrfs_throttle(root);
  1157. no_delete:
  1158. clear_inode(inode);
  1159. }
  1160. /*
  1161. * this returns the key found in the dir entry in the location pointer.
  1162. * If no dir entries were found, location->objectid is 0.
  1163. */
  1164. static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
  1165. struct btrfs_key *location)
  1166. {
  1167. const char *name = dentry->d_name.name;
  1168. int namelen = dentry->d_name.len;
  1169. struct btrfs_dir_item *di;
  1170. struct btrfs_path *path;
  1171. struct btrfs_root *root = BTRFS_I(dir)->root;
  1172. int ret = 0;
  1173. if (namelen == 1 && strcmp(name, ".") == 0) {
  1174. location->objectid = dir->i_ino;
  1175. location->type = BTRFS_INODE_ITEM_KEY;
  1176. location->offset = 0;
  1177. return 0;
  1178. }
  1179. path = btrfs_alloc_path();
  1180. BUG_ON(!path);
  1181. if (namelen == 2 && strcmp(name, "..") == 0) {
  1182. struct btrfs_key key;
  1183. struct extent_buffer *leaf;
  1184. u32 nritems;
  1185. int slot;
  1186. key.objectid = dir->i_ino;
  1187. btrfs_set_key_type(&key, BTRFS_INODE_REF_KEY);
  1188. key.offset = 0;
  1189. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  1190. BUG_ON(ret == 0);
  1191. ret = 0;
  1192. leaf = path->nodes[0];
  1193. slot = path->slots[0];
  1194. nritems = btrfs_header_nritems(leaf);
  1195. if (slot >= nritems)
  1196. goto out_err;
  1197. btrfs_item_key_to_cpu(leaf, &key, slot);
  1198. if (key.objectid != dir->i_ino ||
  1199. key.type != BTRFS_INODE_REF_KEY) {
  1200. goto out_err;
  1201. }
  1202. location->objectid = key.offset;
  1203. location->type = BTRFS_INODE_ITEM_KEY;
  1204. location->offset = 0;
  1205. goto out;
  1206. }
  1207. di = btrfs_lookup_dir_item(NULL, root, path, dir->i_ino, name,
  1208. namelen, 0);
  1209. if (IS_ERR(di))
  1210. ret = PTR_ERR(di);
  1211. if (!di || IS_ERR(di)) {
  1212. goto out_err;
  1213. }
  1214. btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
  1215. out:
  1216. btrfs_free_path(path);
  1217. return ret;
  1218. out_err:
  1219. location->objectid = 0;
  1220. goto out;
  1221. }
  1222. /*
  1223. * when we hit a tree root in a directory, the btrfs part of the inode
  1224. * needs to be changed to reflect the root directory of the tree root. This
  1225. * is kind of like crossing a mount point.
  1226. */
  1227. static int fixup_tree_root_location(struct btrfs_root *root,
  1228. struct btrfs_key *location,
  1229. struct btrfs_root **sub_root,
  1230. struct dentry *dentry)
  1231. {
  1232. struct btrfs_path *path;
  1233. struct btrfs_root_item *ri;
  1234. if (btrfs_key_type(location) != BTRFS_ROOT_ITEM_KEY)
  1235. return 0;
  1236. if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
  1237. return 0;
  1238. path = btrfs_alloc_path();
  1239. BUG_ON(!path);
  1240. mutex_lock(&root->fs_info->fs_mutex);
  1241. *sub_root = btrfs_read_fs_root(root->fs_info, location,
  1242. dentry->d_name.name,
  1243. dentry->d_name.len);
  1244. if (IS_ERR(*sub_root))
  1245. return PTR_ERR(*sub_root);
  1246. ri = &(*sub_root)->root_item;
  1247. location->objectid = btrfs_root_dirid(ri);
  1248. btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY);
  1249. location->offset = 0;
  1250. btrfs_free_path(path);
  1251. mutex_unlock(&root->fs_info->fs_mutex);
  1252. return 0;
  1253. }
  1254. static int btrfs_init_locked_inode(struct inode *inode, void *p)
  1255. {
  1256. struct btrfs_iget_args *args = p;
  1257. inode->i_ino = args->ino;
  1258. BTRFS_I(inode)->root = args->root;
  1259. BTRFS_I(inode)->delalloc_bytes = 0;
  1260. extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS);
  1261. extent_io_tree_init(&BTRFS_I(inode)->io_tree,
  1262. inode->i_mapping, GFP_NOFS);
  1263. extent_io_tree_init(&BTRFS_I(inode)->io_failure_tree,
  1264. inode->i_mapping, GFP_NOFS);
  1265. atomic_set(&BTRFS_I(inode)->ordered_writeback, 0);
  1266. return 0;
  1267. }
  1268. static int btrfs_find_actor(struct inode *inode, void *opaque)
  1269. {
  1270. struct btrfs_iget_args *args = opaque;
  1271. return (args->ino == inode->i_ino &&
  1272. args->root == BTRFS_I(inode)->root);
  1273. }
  1274. struct inode *btrfs_ilookup(struct super_block *s, u64 objectid,
  1275. u64 root_objectid)
  1276. {
  1277. struct btrfs_iget_args args;
  1278. args.ino = objectid;
  1279. args.root = btrfs_lookup_fs_root(btrfs_sb(s)->fs_info, root_objectid);
  1280. if (!args.root)
  1281. return NULL;
  1282. return ilookup5(s, objectid, btrfs_find_actor, (void *)&args);
  1283. }
  1284. struct inode *btrfs_iget_locked(struct super_block *s, u64 objectid,
  1285. struct btrfs_root *root)
  1286. {
  1287. struct inode *inode;
  1288. struct btrfs_iget_args args;
  1289. args.ino = objectid;
  1290. args.root = root;
  1291. inode = iget5_locked(s, objectid, btrfs_find_actor,
  1292. btrfs_init_locked_inode,
  1293. (void *)&args);
  1294. return inode;
  1295. }
  1296. static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
  1297. struct nameidata *nd)
  1298. {
  1299. struct inode * inode;
  1300. struct btrfs_inode *bi = BTRFS_I(dir);
  1301. struct btrfs_root *root = bi->root;
  1302. struct btrfs_root *sub_root = root;
  1303. struct btrfs_key location;
  1304. int ret;
  1305. if (dentry->d_name.len > BTRFS_NAME_LEN)
  1306. return ERR_PTR(-ENAMETOOLONG);
  1307. mutex_lock(&root->fs_info->fs_mutex);
  1308. ret = btrfs_inode_by_name(dir, dentry, &location);
  1309. mutex_unlock(&root->fs_info->fs_mutex);
  1310. if (ret < 0)
  1311. return ERR_PTR(ret);
  1312. inode = NULL;
  1313. if (location.objectid) {
  1314. ret = fixup_tree_root_location(root, &location, &sub_root,
  1315. dentry);
  1316. if (ret < 0)
  1317. return ERR_PTR(ret);
  1318. if (ret > 0)
  1319. return ERR_PTR(-ENOENT);
  1320. inode = btrfs_iget_locked(dir->i_sb, location.objectid,
  1321. sub_root);
  1322. if (!inode)
  1323. return ERR_PTR(-EACCES);
  1324. if (inode->i_state & I_NEW) {
  1325. /* the inode and parent dir are two different roots */
  1326. if (sub_root != root) {
  1327. igrab(inode);
  1328. sub_root->inode = inode;
  1329. }
  1330. BTRFS_I(inode)->root = sub_root;
  1331. memcpy(&BTRFS_I(inode)->location, &location,
  1332. sizeof(location));
  1333. btrfs_read_locked_inode(inode);
  1334. unlock_new_inode(inode);
  1335. }
  1336. }
  1337. return d_splice_alias(inode, dentry);
  1338. }
  1339. static unsigned char btrfs_filetype_table[] = {
  1340. DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK
  1341. };
  1342. static int btrfs_readdir(struct file *filp, void *dirent, filldir_t filldir)
  1343. {
  1344. struct inode *inode = filp->f_dentry->d_inode;
  1345. struct btrfs_root *root = BTRFS_I(inode)->root;
  1346. struct btrfs_item *item;
  1347. struct btrfs_dir_item *di;
  1348. struct btrfs_key key;
  1349. struct btrfs_key found_key;
  1350. struct btrfs_path *path;
  1351. int ret;
  1352. u32 nritems;
  1353. struct extent_buffer *leaf;
  1354. int slot;
  1355. int advance;
  1356. unsigned char d_type;
  1357. int over = 0;
  1358. u32 di_cur;
  1359. u32 di_total;
  1360. u32 di_len;
  1361. int key_type = BTRFS_DIR_INDEX_KEY;
  1362. char tmp_name[32];
  1363. char *name_ptr;
  1364. int name_len;
  1365. /* FIXME, use a real flag for deciding about the key type */
  1366. if (root->fs_info->tree_root == root)
  1367. key_type = BTRFS_DIR_ITEM_KEY;
  1368. /* special case for "." */
  1369. if (filp->f_pos == 0) {
  1370. over = filldir(dirent, ".", 1,
  1371. 1, inode->i_ino,
  1372. DT_DIR);
  1373. if (over)
  1374. return 0;
  1375. filp->f_pos = 1;
  1376. }
  1377. mutex_lock(&root->fs_info->fs_mutex);
  1378. key.objectid = inode->i_ino;
  1379. path = btrfs_alloc_path();
  1380. path->reada = 2;
  1381. /* special case for .., just use the back ref */
  1382. if (filp->f_pos == 1) {
  1383. btrfs_set_key_type(&key, BTRFS_INODE_REF_KEY);
  1384. key.offset = 0;
  1385. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  1386. BUG_ON(ret == 0);
  1387. leaf = path->nodes[0];
  1388. slot = path->slots[0];
  1389. nritems = btrfs_header_nritems(leaf);
  1390. if (slot >= nritems) {
  1391. btrfs_release_path(root, path);
  1392. goto read_dir_items;
  1393. }
  1394. btrfs_item_key_to_cpu(leaf, &found_key, slot);
  1395. btrfs_release_path(root, path);
  1396. if (found_key.objectid != key.objectid ||
  1397. found_key.type != BTRFS_INODE_REF_KEY)
  1398. goto read_dir_items;
  1399. over = filldir(dirent, "..", 2,
  1400. 2, found_key.offset, DT_DIR);
  1401. if (over)
  1402. goto nopos;
  1403. filp->f_pos = 2;
  1404. }
  1405. read_dir_items:
  1406. btrfs_set_key_type(&key, key_type);
  1407. key.offset = filp->f_pos;
  1408. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  1409. if (ret < 0)
  1410. goto err;
  1411. advance = 0;
  1412. while(1) {
  1413. leaf = path->nodes[0];
  1414. nritems = btrfs_header_nritems(leaf);
  1415. slot = path->slots[0];
  1416. if (advance || slot >= nritems) {
  1417. if (slot >= nritems -1) {
  1418. ret = btrfs_next_leaf(root, path);
  1419. if (ret)
  1420. break;
  1421. leaf = path->nodes[0];
  1422. nritems = btrfs_header_nritems(leaf);
  1423. slot = path->slots[0];
  1424. } else {
  1425. slot++;
  1426. path->slots[0]++;
  1427. }
  1428. }
  1429. advance = 1;
  1430. item = btrfs_item_nr(leaf, slot);
  1431. btrfs_item_key_to_cpu(leaf, &found_key, slot);
  1432. if (found_key.objectid != key.objectid)
  1433. break;
  1434. if (btrfs_key_type(&found_key) != key_type)
  1435. break;
  1436. if (found_key.offset < filp->f_pos)
  1437. continue;
  1438. filp->f_pos = found_key.offset;
  1439. advance = 1;
  1440. di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
  1441. di_cur = 0;
  1442. di_total = btrfs_item_size(leaf, item);
  1443. while(di_cur < di_total) {
  1444. struct btrfs_key location;
  1445. name_len = btrfs_dir_name_len(leaf, di);
  1446. if (name_len < 32) {
  1447. name_ptr = tmp_name;
  1448. } else {
  1449. name_ptr = kmalloc(name_len, GFP_NOFS);
  1450. BUG_ON(!name_ptr);
  1451. }
  1452. read_extent_buffer(leaf, name_ptr,
  1453. (unsigned long)(di + 1), name_len);
  1454. d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)];
  1455. btrfs_dir_item_key_to_cpu(leaf, di, &location);
  1456. over = filldir(dirent, name_ptr, name_len,
  1457. found_key.offset,
  1458. location.objectid,
  1459. d_type);
  1460. if (name_ptr != tmp_name)
  1461. kfree(name_ptr);
  1462. if (over)
  1463. goto nopos;
  1464. di_len = btrfs_dir_name_len(leaf, di) +
  1465. btrfs_dir_data_len(leaf, di) +sizeof(*di);
  1466. di_cur += di_len;
  1467. di = (struct btrfs_dir_item *)((char *)di + di_len);
  1468. }
  1469. }
  1470. if (key_type == BTRFS_DIR_INDEX_KEY)
  1471. filp->f_pos = INT_LIMIT(typeof(filp->f_pos));
  1472. else
  1473. filp->f_pos++;
  1474. nopos:
  1475. ret = 0;
  1476. err:
  1477. btrfs_release_path(root, path);
  1478. btrfs_free_path(path);
  1479. mutex_unlock(&root->fs_info->fs_mutex);
  1480. return ret;
  1481. }
  1482. int btrfs_write_inode(struct inode *inode, int wait)
  1483. {
  1484. struct btrfs_root *root = BTRFS_I(inode)->root;
  1485. struct btrfs_trans_handle *trans;
  1486. int ret = 0;
  1487. if (wait) {
  1488. mutex_lock(&root->fs_info->fs_mutex);
  1489. trans = btrfs_start_transaction(root, 1);
  1490. btrfs_set_trans_block_group(trans, inode);
  1491. ret = btrfs_commit_transaction(trans, root);
  1492. mutex_unlock(&root->fs_info->fs_mutex);
  1493. }
  1494. return ret;
  1495. }
  1496. /*
  1497. * This is somewhat expensive, updating the tree every time the
  1498. * inode changes. But, it is most likely to find the inode in cache.
  1499. * FIXME, needs more benchmarking...there are no reasons other than performance
  1500. * to keep or drop this code.
  1501. */
  1502. void btrfs_dirty_inode(struct inode *inode)
  1503. {
  1504. struct btrfs_root *root = BTRFS_I(inode)->root;
  1505. struct btrfs_trans_handle *trans;
  1506. mutex_lock(&root->fs_info->fs_mutex);
  1507. trans = btrfs_start_transaction(root, 1);
  1508. btrfs_set_trans_block_group(trans, inode);
  1509. btrfs_update_inode(trans, root, inode);
  1510. btrfs_end_transaction(trans, root);
  1511. mutex_unlock(&root->fs_info->fs_mutex);
  1512. }
  1513. static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
  1514. struct btrfs_root *root,
  1515. const char *name, int name_len,
  1516. u64 ref_objectid,
  1517. u64 objectid,
  1518. struct btrfs_block_group_cache *group,
  1519. int mode)
  1520. {
  1521. struct inode *inode;
  1522. struct btrfs_inode_item *inode_item;
  1523. struct btrfs_block_group_cache *new_inode_group;
  1524. struct btrfs_key *location;
  1525. struct btrfs_path *path;
  1526. struct btrfs_inode_ref *ref;
  1527. struct btrfs_key key[2];
  1528. u32 sizes[2];
  1529. unsigned long ptr;
  1530. int ret;
  1531. int owner;
  1532. path = btrfs_alloc_path();
  1533. BUG_ON(!path);
  1534. inode = new_inode(root->fs_info->sb);
  1535. if (!inode)
  1536. return ERR_PTR(-ENOMEM);
  1537. extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS);
  1538. extent_io_tree_init(&BTRFS_I(inode)->io_tree,
  1539. inode->i_mapping, GFP_NOFS);
  1540. extent_io_tree_init(&BTRFS_I(inode)->io_failure_tree,
  1541. inode->i_mapping, GFP_NOFS);
  1542. atomic_set(&BTRFS_I(inode)->ordered_writeback, 0);
  1543. BTRFS_I(inode)->delalloc_bytes = 0;
  1544. BTRFS_I(inode)->root = root;
  1545. if (mode & S_IFDIR)
  1546. owner = 0;
  1547. else
  1548. owner = 1;
  1549. new_inode_group = btrfs_find_block_group(root, group, 0,
  1550. BTRFS_BLOCK_GROUP_METADATA, owner);
  1551. if (!new_inode_group) {
  1552. printk("find_block group failed\n");
  1553. new_inode_group = group;
  1554. }
  1555. BTRFS_I(inode)->block_group = new_inode_group;
  1556. BTRFS_I(inode)->flags = 0;
  1557. key[0].objectid = objectid;
  1558. btrfs_set_key_type(&key[0], BTRFS_INODE_ITEM_KEY);
  1559. key[0].offset = 0;
  1560. key[1].objectid = objectid;
  1561. btrfs_set_key_type(&key[1], BTRFS_INODE_REF_KEY);
  1562. key[1].offset = ref_objectid;
  1563. sizes[0] = sizeof(struct btrfs_inode_item);
  1564. sizes[1] = name_len + sizeof(*ref);
  1565. ret = btrfs_insert_empty_items(trans, root, path, key, sizes, 2);
  1566. if (ret != 0)
  1567. goto fail;
  1568. if (objectid > root->highest_inode)
  1569. root->highest_inode = objectid;
  1570. inode->i_uid = current->fsuid;
  1571. inode->i_gid = current->fsgid;
  1572. inode->i_mode = mode;
  1573. inode->i_ino = objectid;
  1574. inode->i_blocks = 0;
  1575. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  1576. inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
  1577. struct btrfs_inode_item);
  1578. fill_inode_item(path->nodes[0], inode_item, inode);
  1579. ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
  1580. struct btrfs_inode_ref);
  1581. btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
  1582. ptr = (unsigned long)(ref + 1);
  1583. write_extent_buffer(path->nodes[0], name, ptr, name_len);
  1584. btrfs_mark_buffer_dirty(path->nodes[0]);
  1585. btrfs_free_path(path);
  1586. location = &BTRFS_I(inode)->location;
  1587. location->objectid = objectid;
  1588. location->offset = 0;
  1589. btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY);
  1590. insert_inode_hash(inode);
  1591. return inode;
  1592. fail:
  1593. btrfs_free_path(path);
  1594. return ERR_PTR(ret);
  1595. }
  1596. static inline u8 btrfs_inode_type(struct inode *inode)
  1597. {
  1598. return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT];
  1599. }
  1600. static int btrfs_add_link(struct btrfs_trans_handle *trans,
  1601. struct dentry *dentry, struct inode *inode,
  1602. int add_backref)
  1603. {
  1604. int ret;
  1605. struct btrfs_key key;
  1606. struct btrfs_root *root = BTRFS_I(dentry->d_parent->d_inode)->root;
  1607. struct inode *parent_inode;
  1608. key.objectid = inode->i_ino;
  1609. btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
  1610. key.offset = 0;
  1611. ret = btrfs_insert_dir_item(trans, root,
  1612. dentry->d_name.name, dentry->d_name.len,
  1613. dentry->d_parent->d_inode->i_ino,
  1614. &key, btrfs_inode_type(inode));
  1615. if (ret == 0) {
  1616. if (add_backref) {
  1617. ret = btrfs_insert_inode_ref(trans, root,
  1618. dentry->d_name.name,
  1619. dentry->d_name.len,
  1620. inode->i_ino,
  1621. dentry->d_parent->d_inode->i_ino);
  1622. }
  1623. parent_inode = dentry->d_parent->d_inode;
  1624. parent_inode->i_size += dentry->d_name.len * 2;
  1625. parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME;
  1626. ret = btrfs_update_inode(trans, root,
  1627. dentry->d_parent->d_inode);
  1628. }
  1629. return ret;
  1630. }
  1631. static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
  1632. struct dentry *dentry, struct inode *inode,
  1633. int backref)
  1634. {
  1635. int err = btrfs_add_link(trans, dentry, inode, backref);
  1636. if (!err) {
  1637. d_instantiate(dentry, inode);
  1638. return 0;
  1639. }
  1640. if (err > 0)
  1641. err = -EEXIST;
  1642. return err;
  1643. }
  1644. static int btrfs_mknod(struct inode *dir, struct dentry *dentry,
  1645. int mode, dev_t rdev)
  1646. {
  1647. struct btrfs_trans_handle *trans;
  1648. struct btrfs_root *root = BTRFS_I(dir)->root;
  1649. struct inode *inode = NULL;
  1650. int err;
  1651. int drop_inode = 0;
  1652. u64 objectid;
  1653. unsigned long nr = 0;
  1654. if (!new_valid_dev(rdev))
  1655. return -EINVAL;
  1656. mutex_lock(&root->fs_info->fs_mutex);
  1657. err = btrfs_check_free_space(root, 1, 0);
  1658. if (err)
  1659. goto fail;
  1660. trans = btrfs_start_transaction(root, 1);
  1661. btrfs_set_trans_block_group(trans, dir);
  1662. err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid);
  1663. if (err) {
  1664. err = -ENOSPC;
  1665. goto out_unlock;
  1666. }
  1667. inode = btrfs_new_inode(trans, root, dentry->d_name.name,
  1668. dentry->d_name.len,
  1669. dentry->d_parent->d_inode->i_ino, objectid,
  1670. BTRFS_I(dir)->block_group, mode);
  1671. err = PTR_ERR(inode);
  1672. if (IS_ERR(inode))
  1673. goto out_unlock;
  1674. btrfs_set_trans_block_group(trans, inode);
  1675. err = btrfs_add_nondir(trans, dentry, inode, 0);
  1676. if (err)
  1677. drop_inode = 1;
  1678. else {
  1679. inode->i_op = &btrfs_special_inode_operations;
  1680. init_special_inode(inode, inode->i_mode, rdev);
  1681. btrfs_update_inode(trans, root, inode);
  1682. }
  1683. dir->i_sb->s_dirt = 1;
  1684. btrfs_update_inode_block_group(trans, inode);
  1685. btrfs_update_inode_block_group(trans, dir);
  1686. out_unlock:
  1687. nr = trans->blocks_used;
  1688. btrfs_end_transaction(trans, root);
  1689. fail:
  1690. mutex_unlock(&root->fs_info->fs_mutex);
  1691. if (drop_inode) {
  1692. inode_dec_link_count(inode);
  1693. iput(inode);
  1694. }
  1695. btrfs_btree_balance_dirty(root, nr);
  1696. btrfs_throttle(root);
  1697. return err;
  1698. }
  1699. static int btrfs_create(struct inode *dir, struct dentry *dentry,
  1700. int mode, struct nameidata *nd)
  1701. {
  1702. struct btrfs_trans_handle *trans;
  1703. struct btrfs_root *root = BTRFS_I(dir)->root;
  1704. struct inode *inode = NULL;
  1705. int err;
  1706. int drop_inode = 0;
  1707. unsigned long nr = 0;
  1708. u64 objectid;
  1709. mutex_lock(&root->fs_info->fs_mutex);
  1710. err = btrfs_check_free_space(root, 1, 0);
  1711. if (err)
  1712. goto fail;
  1713. trans = btrfs_start_transaction(root, 1);
  1714. btrfs_set_trans_block_group(trans, dir);
  1715. err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid);
  1716. if (err) {
  1717. err = -ENOSPC;
  1718. goto out_unlock;
  1719. }
  1720. inode = btrfs_new_inode(trans, root, dentry->d_name.name,
  1721. dentry->d_name.len,
  1722. dentry->d_parent->d_inode->i_ino,
  1723. objectid, BTRFS_I(dir)->block_group, mode);
  1724. err = PTR_ERR(inode);
  1725. if (IS_ERR(inode))
  1726. goto out_unlock;
  1727. btrfs_set_trans_block_group(trans, inode);
  1728. err = btrfs_add_nondir(trans, dentry, inode, 0);
  1729. if (err)
  1730. drop_inode = 1;
  1731. else {
  1732. inode->i_mapping->a_ops = &btrfs_aops;
  1733. inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
  1734. inode->i_fop = &btrfs_file_operations;
  1735. inode->i_op = &btrfs_file_inode_operations;
  1736. extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS);
  1737. extent_io_tree_init(&BTRFS_I(inode)->io_tree,
  1738. inode->i_mapping, GFP_NOFS);
  1739. extent_io_tree_init(&BTRFS_I(inode)->io_failure_tree,
  1740. inode->i_mapping, GFP_NOFS);
  1741. BTRFS_I(inode)->delalloc_bytes = 0;
  1742. atomic_set(&BTRFS_I(inode)->ordered_writeback, 0);
  1743. BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
  1744. }
  1745. dir->i_sb->s_dirt = 1;
  1746. btrfs_update_inode_block_group(trans, inode);
  1747. btrfs_update_inode_block_group(trans, dir);
  1748. out_unlock:
  1749. nr = trans->blocks_used;
  1750. btrfs_end_transaction(trans, root);
  1751. fail:
  1752. mutex_unlock(&root->fs_info->fs_mutex);
  1753. if (drop_inode) {
  1754. inode_dec_link_count(inode);
  1755. iput(inode);
  1756. }
  1757. btrfs_btree_balance_dirty(root, nr);
  1758. btrfs_throttle(root);
  1759. return err;
  1760. }
  1761. static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
  1762. struct dentry *dentry)
  1763. {
  1764. struct btrfs_trans_handle *trans;
  1765. struct btrfs_root *root = BTRFS_I(dir)->root;
  1766. struct inode *inode = old_dentry->d_inode;
  1767. unsigned long nr = 0;
  1768. int err;
  1769. int drop_inode = 0;
  1770. if (inode->i_nlink == 0)
  1771. return -ENOENT;
  1772. #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
  1773. inode->i_nlink++;
  1774. #else
  1775. inc_nlink(inode);
  1776. #endif
  1777. mutex_lock(&root->fs_info->fs_mutex);
  1778. err = btrfs_check_free_space(root, 1, 0);
  1779. if (err)
  1780. goto fail;
  1781. trans = btrfs_start_transaction(root, 1);
  1782. btrfs_set_trans_block_group(trans, dir);
  1783. atomic_inc(&inode->i_count);
  1784. err = btrfs_add_nondir(trans, dentry, inode, 1);
  1785. if (err)
  1786. drop_inode = 1;
  1787. dir->i_sb->s_dirt = 1;
  1788. btrfs_update_inode_block_group(trans, dir);
  1789. err = btrfs_update_inode(trans, root, inode);
  1790. if (err)
  1791. drop_inode = 1;
  1792. nr = trans->blocks_used;
  1793. btrfs_end_transaction(trans, root);
  1794. fail:
  1795. mutex_unlock(&root->fs_info->fs_mutex);
  1796. if (drop_inode) {
  1797. inode_dec_link_count(inode);
  1798. iput(inode);
  1799. }
  1800. btrfs_btree_balance_dirty(root, nr);
  1801. btrfs_throttle(root);
  1802. return err;
  1803. }
  1804. static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  1805. {
  1806. struct inode *inode;
  1807. struct btrfs_trans_handle *trans;
  1808. struct btrfs_root *root = BTRFS_I(dir)->root;
  1809. int err = 0;
  1810. int drop_on_err = 0;
  1811. u64 objectid;
  1812. unsigned long nr = 1;
  1813. mutex_lock(&root->fs_info->fs_mutex);
  1814. err = btrfs_check_free_space(root, 1, 0);
  1815. if (err)
  1816. goto out_unlock;
  1817. trans = btrfs_start_transaction(root, 1);
  1818. btrfs_set_trans_block_group(trans, dir);
  1819. if (IS_ERR(trans)) {
  1820. err = PTR_ERR(trans);
  1821. goto out_unlock;
  1822. }
  1823. err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid);
  1824. if (err) {
  1825. err = -ENOSPC;
  1826. goto out_unlock;
  1827. }
  1828. inode = btrfs_new_inode(trans, root, dentry->d_name.name,
  1829. dentry->d_name.len,
  1830. dentry->d_parent->d_inode->i_ino, objectid,
  1831. BTRFS_I(dir)->block_group, S_IFDIR | mode);
  1832. if (IS_ERR(inode)) {
  1833. err = PTR_ERR(inode);
  1834. goto out_fail;
  1835. }
  1836. drop_on_err = 1;
  1837. inode->i_op = &btrfs_dir_inode_operations;
  1838. inode->i_fop = &btrfs_dir_file_operations;
  1839. btrfs_set_trans_block_group(trans, inode);
  1840. inode->i_size = 0;
  1841. err = btrfs_update_inode(trans, root, inode);
  1842. if (err)
  1843. goto out_fail;
  1844. err = btrfs_add_link(trans, dentry, inode, 0);
  1845. if (err)
  1846. goto out_fail;
  1847. d_instantiate(dentry, inode);
  1848. drop_on_err = 0;
  1849. dir->i_sb->s_dirt = 1;
  1850. btrfs_update_inode_block_group(trans, inode);
  1851. btrfs_update_inode_block_group(trans, dir);
  1852. out_fail:
  1853. nr = trans->blocks_used;
  1854. btrfs_end_transaction(trans, root);
  1855. out_unlock:
  1856. mutex_unlock(&root->fs_info->fs_mutex);
  1857. if (drop_on_err)
  1858. iput(inode);
  1859. btrfs_btree_balance_dirty(root, nr);
  1860. btrfs_throttle(root);
  1861. return err;
  1862. }
  1863. static int merge_extent_mapping(struct extent_map_tree *em_tree,
  1864. struct extent_map *existing,
  1865. struct extent_map *em)
  1866. {
  1867. u64 start_diff;
  1868. u64 new_end;
  1869. int ret = 0;
  1870. int real_blocks = existing->block_start < EXTENT_MAP_LAST_BYTE;
  1871. if (real_blocks && em->block_start >= EXTENT_MAP_LAST_BYTE)
  1872. goto invalid;
  1873. if (!real_blocks && em->block_start != existing->block_start)
  1874. goto invalid;
  1875. new_end = max(existing->start + existing->len, em->start + em->len);
  1876. if (existing->start >= em->start) {
  1877. if (em->start + em->len < existing->start)
  1878. goto invalid;
  1879. start_diff = existing->start - em->start;
  1880. if (real_blocks && em->block_start + start_diff !=
  1881. existing->block_start)
  1882. goto invalid;
  1883. em->len = new_end - em->start;
  1884. remove_extent_mapping(em_tree, existing);
  1885. /* free for the tree */
  1886. free_extent_map(existing);
  1887. ret = add_extent_mapping(em_tree, em);
  1888. } else if (em->start > existing->start) {
  1889. if (existing->start + existing->len < em->start)
  1890. goto invalid;
  1891. start_diff = em->start - existing->start;
  1892. if (real_blocks && existing->block_start + start_diff !=
  1893. em->block_start)
  1894. goto invalid;
  1895. remove_extent_mapping(em_tree, existing);
  1896. em->block_start = existing->block_start;
  1897. em->start = existing->start;
  1898. em->len = new_end - existing->start;
  1899. free_extent_map(existing);
  1900. ret = add_extent_mapping(em_tree, em);
  1901. } else {
  1902. goto invalid;
  1903. }
  1904. return ret;
  1905. invalid:
  1906. printk("invalid extent map merge [%Lu %Lu %Lu] [%Lu %Lu %Lu]\n",
  1907. existing->start, existing->len, existing->block_start,
  1908. em->start, em->len, em->block_start);
  1909. return -EIO;
  1910. }
  1911. struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page,
  1912. size_t pg_offset, u64 start, u64 len,
  1913. int create)
  1914. {
  1915. int ret;
  1916. int err = 0;
  1917. u64 bytenr;
  1918. u64 extent_start = 0;
  1919. u64 extent_end = 0;
  1920. u64 objectid = inode->i_ino;
  1921. u32 found_type;
  1922. struct btrfs_path *path;
  1923. struct btrfs_root *root = BTRFS_I(inode)->root;
  1924. struct btrfs_file_extent_item *item;
  1925. struct extent_buffer *leaf;
  1926. struct btrfs_key found_key;
  1927. struct extent_map *em = NULL;
  1928. struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
  1929. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  1930. struct btrfs_trans_handle *trans = NULL;
  1931. path = btrfs_alloc_path();
  1932. BUG_ON(!path);
  1933. mutex_lock(&root->fs_info->fs_mutex);
  1934. again:
  1935. spin_lock(&em_tree->lock);
  1936. em = lookup_extent_mapping(em_tree, start, len);
  1937. spin_unlock(&em_tree->lock);
  1938. if (em) {
  1939. if (em->start > start || em->start + em->len <= start)
  1940. free_extent_map(em);
  1941. else if (em->block_start == EXTENT_MAP_INLINE && page)
  1942. free_extent_map(em);
  1943. else
  1944. goto out;
  1945. }
  1946. em = alloc_extent_map(GFP_NOFS);
  1947. if (!em) {
  1948. err = -ENOMEM;
  1949. goto out;
  1950. }
  1951. em->start = EXTENT_MAP_HOLE;
  1952. em->len = (u64)-1;
  1953. em->bdev = inode->i_sb->s_bdev;
  1954. ret = btrfs_lookup_file_extent(trans, root, path,
  1955. objectid, start, trans != NULL);
  1956. if (ret < 0) {
  1957. err = ret;
  1958. goto out;
  1959. }
  1960. if (ret != 0) {
  1961. if (path->slots[0] == 0)
  1962. goto not_found;
  1963. path->slots[0]--;
  1964. }
  1965. leaf = path->nodes[0];
  1966. item = btrfs_item_ptr(leaf, path->slots[0],
  1967. struct btrfs_file_extent_item);
  1968. /* are we inside the extent that was found? */
  1969. btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
  1970. found_type = btrfs_key_type(&found_key);
  1971. if (found_key.objectid != objectid ||
  1972. found_type != BTRFS_EXTENT_DATA_KEY) {
  1973. goto not_found;
  1974. }
  1975. found_type = btrfs_file_extent_type(leaf, item);
  1976. extent_start = found_key.offset;
  1977. if (found_type == BTRFS_FILE_EXTENT_REG) {
  1978. extent_end = extent_start +
  1979. btrfs_file_extent_num_bytes(leaf, item);
  1980. err = 0;
  1981. if (start < extent_start || start >= extent_end) {
  1982. em->start = start;
  1983. if (start < extent_start) {
  1984. if (start + len <= extent_start)
  1985. goto not_found;
  1986. em->len = extent_end - extent_start;
  1987. } else {
  1988. em->len = len;
  1989. }
  1990. goto not_found_em;
  1991. }
  1992. bytenr = btrfs_file_extent_disk_bytenr(leaf, item);
  1993. if (bytenr == 0) {
  1994. em->start = extent_start;
  1995. em->len = extent_end - extent_start;
  1996. em->block_start = EXTENT_MAP_HOLE;
  1997. goto insert;
  1998. }
  1999. bytenr += btrfs_file_extent_offset(leaf, item);
  2000. em->block_start = bytenr;
  2001. em->start = extent_start;
  2002. em->len = extent_end - extent_start;
  2003. goto insert;
  2004. } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
  2005. u64 page_start;
  2006. unsigned long ptr;
  2007. char *map;
  2008. size_t size;
  2009. size_t extent_offset;
  2010. size_t copy_size;
  2011. size = btrfs_file_extent_inline_len(leaf, btrfs_item_nr(leaf,
  2012. path->slots[0]));
  2013. extent_end = (extent_start + size + root->sectorsize - 1) &
  2014. ~((u64)root->sectorsize - 1);
  2015. if (start < extent_start || start >= extent_end) {
  2016. em->start = start;
  2017. if (start < extent_start) {
  2018. if (start + len <= extent_start)
  2019. goto not_found;
  2020. em->len = extent_end - extent_start;
  2021. } else {
  2022. em->len = len;
  2023. }
  2024. goto not_found_em;
  2025. }
  2026. em->block_start = EXTENT_MAP_INLINE;
  2027. if (!page) {
  2028. em->start = extent_start;
  2029. em->len = size;
  2030. goto out;
  2031. }
  2032. page_start = page_offset(page) + pg_offset;
  2033. extent_offset = page_start - extent_start;
  2034. copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset,
  2035. size - extent_offset);
  2036. em->start = extent_start + extent_offset;
  2037. em->len = (copy_size + root->sectorsize - 1) &
  2038. ~((u64)root->sectorsize - 1);
  2039. map = kmap(page);
  2040. ptr = btrfs_file_extent_inline_start(item) + extent_offset;
  2041. if (create == 0 && !PageUptodate(page)) {
  2042. read_extent_buffer(leaf, map + pg_offset, ptr,
  2043. copy_size);
  2044. flush_dcache_page(page);
  2045. } else if (create && PageUptodate(page)) {
  2046. if (!trans) {
  2047. kunmap(page);
  2048. free_extent_map(em);
  2049. em = NULL;
  2050. btrfs_release_path(root, path);
  2051. trans = btrfs_start_transaction(root, 1);
  2052. goto again;
  2053. }
  2054. write_extent_buffer(leaf, map + pg_offset, ptr,
  2055. copy_size);
  2056. btrfs_mark_buffer_dirty(leaf);
  2057. }
  2058. kunmap(page);
  2059. set_extent_uptodate(io_tree, em->start,
  2060. extent_map_end(em) - 1, GFP_NOFS);
  2061. goto insert;
  2062. } else {
  2063. printk("unkknown found_type %d\n", found_type);
  2064. WARN_ON(1);
  2065. }
  2066. not_found:
  2067. em->start = start;
  2068. em->len = len;
  2069. not_found_em:
  2070. em->block_start = EXTENT_MAP_HOLE;
  2071. insert:
  2072. btrfs_release_path(root, path);
  2073. if (em->start > start || extent_map_end(em) <= start) {
  2074. printk("bad extent! em: [%Lu %Lu] passed [%Lu %Lu]\n", em->start, em->len, start, len);
  2075. err = -EIO;
  2076. goto out;
  2077. }
  2078. err = 0;
  2079. spin_lock(&em_tree->lock);
  2080. ret = add_extent_mapping(em_tree, em);
  2081. /* it is possible that someone inserted the extent into the tree
  2082. * while we had the lock dropped. It is also possible that
  2083. * an overlapping map exists in the tree
  2084. */
  2085. if (ret == -EEXIST) {
  2086. struct extent_map *existing;
  2087. existing = lookup_extent_mapping(em_tree, start, len);
  2088. if (existing && (existing->start > start ||
  2089. existing->start + existing->len <= start)) {
  2090. free_extent_map(existing);
  2091. existing = NULL;
  2092. }
  2093. if (!existing) {
  2094. existing = lookup_extent_mapping(em_tree, em->start,
  2095. em->len);
  2096. if (existing) {
  2097. err = merge_extent_mapping(em_tree, existing,
  2098. em);
  2099. free_extent_map(existing);
  2100. if (err) {
  2101. free_extent_map(em);
  2102. em = NULL;
  2103. }
  2104. } else {
  2105. err = -EIO;
  2106. printk("failing to insert %Lu %Lu\n",
  2107. start, len);
  2108. free_extent_map(em);
  2109. em = NULL;
  2110. }
  2111. } else {
  2112. free_extent_map(em);
  2113. em = existing;
  2114. }
  2115. }
  2116. spin_unlock(&em_tree->lock);
  2117. out:
  2118. btrfs_free_path(path);
  2119. if (trans) {
  2120. ret = btrfs_end_transaction(trans, root);
  2121. if (!err)
  2122. err = ret;
  2123. }
  2124. mutex_unlock(&root->fs_info->fs_mutex);
  2125. if (err) {
  2126. free_extent_map(em);
  2127. WARN_ON(1);
  2128. return ERR_PTR(err);
  2129. }
  2130. return em;
  2131. }
  2132. #if 0 /* waiting for O_DIRECT reads */
  2133. static int btrfs_get_block(struct inode *inode, sector_t iblock,
  2134. struct buffer_head *bh_result, int create)
  2135. {
  2136. struct extent_map *em;
  2137. u64 start = (u64)iblock << inode->i_blkbits;
  2138. struct btrfs_multi_bio *multi = NULL;
  2139. struct btrfs_root *root = BTRFS_I(inode)->root;
  2140. u64 len;
  2141. u64 logical;
  2142. u64 map_length;
  2143. int ret = 0;
  2144. em = btrfs_get_extent(inode, NULL, 0, start, bh_result->b_size, 0);
  2145. if (!em || IS_ERR(em))
  2146. goto out;
  2147. if (em->start > start || em->start + em->len <= start) {
  2148. goto out;
  2149. }
  2150. if (em->block_start == EXTENT_MAP_INLINE) {
  2151. ret = -EINVAL;
  2152. goto out;
  2153. }
  2154. len = em->start + em->len - start;
  2155. len = min_t(u64, len, INT_LIMIT(typeof(bh_result->b_size)));
  2156. if (em->block_start == EXTENT_MAP_HOLE ||
  2157. em->block_start == EXTENT_MAP_DELALLOC) {
  2158. bh_result->b_size = len;
  2159. goto out;
  2160. }
  2161. logical = start - em->start;
  2162. logical = em->block_start + logical;
  2163. map_length = len;
  2164. ret = btrfs_map_block(&root->fs_info->mapping_tree, READ,
  2165. logical, &map_length, &multi, 0);
  2166. BUG_ON(ret);
  2167. bh_result->b_blocknr = multi->stripes[0].physical >> inode->i_blkbits;
  2168. bh_result->b_size = min(map_length, len);
  2169. bh_result->b_bdev = multi->stripes[0].dev->bdev;
  2170. set_buffer_mapped(bh_result);
  2171. kfree(multi);
  2172. out:
  2173. free_extent_map(em);
  2174. return ret;
  2175. }
  2176. #endif
  2177. static ssize_t btrfs_direct_IO(int rw, struct kiocb *iocb,
  2178. const struct iovec *iov, loff_t offset,
  2179. unsigned long nr_segs)
  2180. {
  2181. return -EINVAL;
  2182. #if 0
  2183. struct file *file = iocb->ki_filp;
  2184. struct inode *inode = file->f_mapping->host;
  2185. if (rw == WRITE)
  2186. return -EINVAL;
  2187. return blockdev_direct_IO(rw, iocb, inode, inode->i_sb->s_bdev, iov,
  2188. offset, nr_segs, btrfs_get_block, NULL);
  2189. #endif
  2190. }
  2191. static sector_t btrfs_bmap(struct address_space *mapping, sector_t iblock)
  2192. {
  2193. return extent_bmap(mapping, iblock, btrfs_get_extent);
  2194. }
  2195. int btrfs_readpage(struct file *file, struct page *page)
  2196. {
  2197. struct extent_io_tree *tree;
  2198. tree = &BTRFS_I(page->mapping->host)->io_tree;
  2199. return extent_read_full_page(tree, page, btrfs_get_extent);
  2200. }
  2201. static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
  2202. {
  2203. struct extent_io_tree *tree;
  2204. if (current->flags & PF_MEMALLOC) {
  2205. redirty_page_for_writepage(wbc, page);
  2206. unlock_page(page);
  2207. return 0;
  2208. }
  2209. tree = &BTRFS_I(page->mapping->host)->io_tree;
  2210. return extent_write_full_page(tree, page, btrfs_get_extent, wbc);
  2211. }
  2212. static int btrfs_writepages(struct address_space *mapping,
  2213. struct writeback_control *wbc)
  2214. {
  2215. struct extent_io_tree *tree;
  2216. tree = &BTRFS_I(mapping->host)->io_tree;
  2217. return extent_writepages(tree, mapping, btrfs_get_extent, wbc);
  2218. }
  2219. static int
  2220. btrfs_readpages(struct file *file, struct address_space *mapping,
  2221. struct list_head *pages, unsigned nr_pages)
  2222. {
  2223. struct extent_io_tree *tree;
  2224. tree = &BTRFS_I(mapping->host)->io_tree;
  2225. return extent_readpages(tree, mapping, pages, nr_pages,
  2226. btrfs_get_extent);
  2227. }
  2228. static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
  2229. {
  2230. struct extent_io_tree *tree;
  2231. struct extent_map_tree *map;
  2232. int ret;
  2233. tree = &BTRFS_I(page->mapping->host)->io_tree;
  2234. map = &BTRFS_I(page->mapping->host)->extent_tree;
  2235. ret = try_release_extent_mapping(map, tree, page, gfp_flags);
  2236. if (ret == 1) {
  2237. invalidate_extent_lru(tree, page_offset(page), PAGE_CACHE_SIZE);
  2238. ClearPagePrivate(page);
  2239. set_page_private(page, 0);
  2240. page_cache_release(page);
  2241. }
  2242. return ret;
  2243. }
  2244. static void btrfs_invalidatepage(struct page *page, unsigned long offset)
  2245. {
  2246. struct extent_io_tree *tree;
  2247. tree = &BTRFS_I(page->mapping->host)->io_tree;
  2248. extent_invalidatepage(tree, page, offset);
  2249. btrfs_releasepage(page, GFP_NOFS);
  2250. if (PagePrivate(page)) {
  2251. invalidate_extent_lru(tree, page_offset(page), PAGE_CACHE_SIZE);
  2252. ClearPagePrivate(page);
  2253. set_page_private(page, 0);
  2254. page_cache_release(page);
  2255. }
  2256. }
  2257. /*
  2258. * btrfs_page_mkwrite() is not allowed to change the file size as it gets
  2259. * called from a page fault handler when a page is first dirtied. Hence we must
  2260. * be careful to check for EOF conditions here. We set the page up correctly
  2261. * for a written page which means we get ENOSPC checking when writing into
  2262. * holes and correct delalloc and unwritten extent mapping on filesystems that
  2263. * support these features.
  2264. *
  2265. * We are not allowed to take the i_mutex here so we have to play games to
  2266. * protect against truncate races as the page could now be beyond EOF. Because
  2267. * vmtruncate() writes the inode size before removing pages, once we have the
  2268. * page lock we can determine safely if the page is beyond EOF. If it is not
  2269. * beyond EOF, then the page is guaranteed safe against truncation until we
  2270. * unlock the page.
  2271. */
  2272. int btrfs_page_mkwrite(struct vm_area_struct *vma, struct page *page)
  2273. {
  2274. struct inode *inode = fdentry(vma->vm_file)->d_inode;
  2275. struct btrfs_root *root = BTRFS_I(inode)->root;
  2276. unsigned long end;
  2277. loff_t size;
  2278. int ret;
  2279. u64 page_start;
  2280. mutex_lock(&root->fs_info->fs_mutex);
  2281. ret = btrfs_check_free_space(root, PAGE_CACHE_SIZE, 0);
  2282. mutex_unlock(&root->fs_info->fs_mutex);
  2283. if (ret)
  2284. goto out;
  2285. ret = -EINVAL;
  2286. lock_page(page);
  2287. wait_on_page_writeback(page);
  2288. size = i_size_read(inode);
  2289. page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  2290. if ((page->mapping != inode->i_mapping) ||
  2291. (page_start > size)) {
  2292. /* page got truncated out from underneath us */
  2293. goto out_unlock;
  2294. }
  2295. /* page is wholly or partially inside EOF */
  2296. if (page_start + PAGE_CACHE_SIZE > size)
  2297. end = size & ~PAGE_CACHE_MASK;
  2298. else
  2299. end = PAGE_CACHE_SIZE;
  2300. ret = btrfs_cow_one_page(inode, page, end);
  2301. out_unlock:
  2302. unlock_page(page);
  2303. out:
  2304. return ret;
  2305. }
  2306. static void btrfs_truncate(struct inode *inode)
  2307. {
  2308. struct btrfs_root *root = BTRFS_I(inode)->root;
  2309. int ret;
  2310. struct btrfs_trans_handle *trans;
  2311. unsigned long nr;
  2312. if (!S_ISREG(inode->i_mode))
  2313. return;
  2314. if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
  2315. return;
  2316. btrfs_truncate_page(inode->i_mapping, inode->i_size);
  2317. mutex_lock(&root->fs_info->fs_mutex);
  2318. trans = btrfs_start_transaction(root, 1);
  2319. btrfs_set_trans_block_group(trans, inode);
  2320. /* FIXME, add redo link to tree so we don't leak on crash */
  2321. ret = btrfs_truncate_in_trans(trans, root, inode,
  2322. BTRFS_EXTENT_DATA_KEY);
  2323. btrfs_update_inode(trans, root, inode);
  2324. nr = trans->blocks_used;
  2325. ret = btrfs_end_transaction(trans, root);
  2326. BUG_ON(ret);
  2327. mutex_unlock(&root->fs_info->fs_mutex);
  2328. btrfs_btree_balance_dirty(root, nr);
  2329. btrfs_throttle(root);
  2330. }
  2331. static int noinline create_subvol(struct btrfs_root *root, char *name,
  2332. int namelen)
  2333. {
  2334. struct btrfs_trans_handle *trans;
  2335. struct btrfs_key key;
  2336. struct btrfs_root_item root_item;
  2337. struct btrfs_inode_item *inode_item;
  2338. struct extent_buffer *leaf;
  2339. struct btrfs_root *new_root = root;
  2340. struct inode *inode;
  2341. struct inode *dir;
  2342. int ret;
  2343. int err;
  2344. u64 objectid;
  2345. u64 new_dirid = BTRFS_FIRST_FREE_OBJECTID;
  2346. unsigned long nr = 1;
  2347. mutex_lock(&root->fs_info->fs_mutex);
  2348. ret = btrfs_check_free_space(root, 1, 0);
  2349. if (ret)
  2350. goto fail_commit;
  2351. trans = btrfs_start_transaction(root, 1);
  2352. BUG_ON(!trans);
  2353. ret = btrfs_find_free_objectid(trans, root->fs_info->tree_root,
  2354. 0, &objectid);
  2355. if (ret)
  2356. goto fail;
  2357. leaf = __btrfs_alloc_free_block(trans, root, root->leafsize,
  2358. objectid, trans->transid, 0, 0,
  2359. 0, 0);
  2360. if (IS_ERR(leaf))
  2361. return PTR_ERR(leaf);
  2362. btrfs_set_header_nritems(leaf, 0);
  2363. btrfs_set_header_level(leaf, 0);
  2364. btrfs_set_header_bytenr(leaf, leaf->start);
  2365. btrfs_set_header_generation(leaf, trans->transid);
  2366. btrfs_set_header_owner(leaf, objectid);
  2367. write_extent_buffer(leaf, root->fs_info->fsid,
  2368. (unsigned long)btrfs_header_fsid(leaf),
  2369. BTRFS_FSID_SIZE);
  2370. btrfs_mark_buffer_dirty(leaf);
  2371. inode_item = &root_item.inode;
  2372. memset(inode_item, 0, sizeof(*inode_item));
  2373. inode_item->generation = cpu_to_le64(1);
  2374. inode_item->size = cpu_to_le64(3);
  2375. inode_item->nlink = cpu_to_le32(1);
  2376. inode_item->nblocks = cpu_to_le64(1);
  2377. inode_item->mode = cpu_to_le32(S_IFDIR | 0755);
  2378. btrfs_set_root_bytenr(&root_item, leaf->start);
  2379. btrfs_set_root_level(&root_item, 0);
  2380. btrfs_set_root_refs(&root_item, 1);
  2381. btrfs_set_root_used(&root_item, 0);
  2382. memset(&root_item.drop_progress, 0, sizeof(root_item.drop_progress));
  2383. root_item.drop_level = 0;
  2384. free_extent_buffer(leaf);
  2385. leaf = NULL;
  2386. btrfs_set_root_dirid(&root_item, new_dirid);
  2387. key.objectid = objectid;
  2388. key.offset = 1;
  2389. btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
  2390. ret = btrfs_insert_root(trans, root->fs_info->tree_root, &key,
  2391. &root_item);
  2392. if (ret)
  2393. goto fail;
  2394. /*
  2395. * insert the directory item
  2396. */
  2397. key.offset = (u64)-1;
  2398. dir = root->fs_info->sb->s_root->d_inode;
  2399. ret = btrfs_insert_dir_item(trans, root->fs_info->tree_root,
  2400. name, namelen, dir->i_ino, &key,
  2401. BTRFS_FT_DIR);
  2402. if (ret)
  2403. goto fail;
  2404. ret = btrfs_insert_inode_ref(trans, root->fs_info->tree_root,
  2405. name, namelen, objectid,
  2406. root->fs_info->sb->s_root->d_inode->i_ino);
  2407. if (ret)
  2408. goto fail;
  2409. ret = btrfs_commit_transaction(trans, root);
  2410. if (ret)
  2411. goto fail_commit;
  2412. new_root = btrfs_read_fs_root(root->fs_info, &key, name, namelen);
  2413. BUG_ON(!new_root);
  2414. trans = btrfs_start_transaction(new_root, 1);
  2415. BUG_ON(!trans);
  2416. inode = btrfs_new_inode(trans, new_root, "..", 2, new_dirid,
  2417. new_dirid,
  2418. BTRFS_I(dir)->block_group, S_IFDIR | 0700);
  2419. if (IS_ERR(inode))
  2420. goto fail;
  2421. inode->i_op = &btrfs_dir_inode_operations;
  2422. inode->i_fop = &btrfs_dir_file_operations;
  2423. new_root->inode = inode;
  2424. ret = btrfs_insert_inode_ref(trans, new_root, "..", 2, new_dirid,
  2425. new_dirid);
  2426. inode->i_nlink = 1;
  2427. inode->i_size = 0;
  2428. ret = btrfs_update_inode(trans, new_root, inode);
  2429. if (ret)
  2430. goto fail;
  2431. fail:
  2432. nr = trans->blocks_used;
  2433. err = btrfs_commit_transaction(trans, new_root);
  2434. if (err && !ret)
  2435. ret = err;
  2436. fail_commit:
  2437. mutex_unlock(&root->fs_info->fs_mutex);
  2438. btrfs_btree_balance_dirty(root, nr);
  2439. btrfs_throttle(root);
  2440. return ret;
  2441. }
  2442. static int create_snapshot(struct btrfs_root *root, char *name, int namelen)
  2443. {
  2444. struct btrfs_pending_snapshot *pending_snapshot;
  2445. struct btrfs_trans_handle *trans;
  2446. int ret;
  2447. int err;
  2448. unsigned long nr = 0;
  2449. if (!root->ref_cows)
  2450. return -EINVAL;
  2451. mutex_lock(&root->fs_info->fs_mutex);
  2452. ret = btrfs_check_free_space(root, 1, 0);
  2453. if (ret)
  2454. goto fail_unlock;
  2455. pending_snapshot = kmalloc(sizeof(*pending_snapshot), GFP_NOFS);
  2456. if (!pending_snapshot) {
  2457. ret = -ENOMEM;
  2458. goto fail_unlock;
  2459. }
  2460. pending_snapshot->name = kmalloc(namelen + 1, GFP_NOFS);
  2461. if (!pending_snapshot->name) {
  2462. ret = -ENOMEM;
  2463. kfree(pending_snapshot);
  2464. goto fail_unlock;
  2465. }
  2466. memcpy(pending_snapshot->name, name, namelen);
  2467. pending_snapshot->name[namelen] = '\0';
  2468. trans = btrfs_start_transaction(root, 1);
  2469. BUG_ON(!trans);
  2470. pending_snapshot->root = root;
  2471. list_add(&pending_snapshot->list,
  2472. &trans->transaction->pending_snapshots);
  2473. ret = btrfs_update_inode(trans, root, root->inode);
  2474. err = btrfs_commit_transaction(trans, root);
  2475. fail_unlock:
  2476. mutex_unlock(&root->fs_info->fs_mutex);
  2477. btrfs_btree_balance_dirty(root, nr);
  2478. btrfs_throttle(root);
  2479. return ret;
  2480. }
  2481. unsigned long btrfs_force_ra(struct address_space *mapping,
  2482. struct file_ra_state *ra, struct file *file,
  2483. pgoff_t offset, pgoff_t last_index)
  2484. {
  2485. pgoff_t req_size = last_index - offset + 1;
  2486. #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,23)
  2487. offset = page_cache_readahead(mapping, ra, file, offset, req_size);
  2488. return offset;
  2489. #else
  2490. page_cache_sync_readahead(mapping, ra, file, offset, req_size);
  2491. return offset + req_size;
  2492. #endif
  2493. }
  2494. int btrfs_defrag_file(struct file *file) {
  2495. struct inode *inode = fdentry(file)->d_inode;
  2496. struct btrfs_root *root = BTRFS_I(inode)->root;
  2497. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  2498. struct page *page;
  2499. unsigned long last_index;
  2500. unsigned long ra_pages = root->fs_info->bdi.ra_pages;
  2501. unsigned long total_read = 0;
  2502. u64 page_start;
  2503. u64 page_end;
  2504. unsigned long i;
  2505. int ret;
  2506. mutex_lock(&root->fs_info->fs_mutex);
  2507. ret = btrfs_check_free_space(root, inode->i_size, 0);
  2508. mutex_unlock(&root->fs_info->fs_mutex);
  2509. if (ret)
  2510. return -ENOSPC;
  2511. mutex_lock(&inode->i_mutex);
  2512. last_index = inode->i_size >> PAGE_CACHE_SHIFT;
  2513. for (i = 0; i <= last_index; i++) {
  2514. if (total_read % ra_pages == 0) {
  2515. btrfs_force_ra(inode->i_mapping, &file->f_ra, file, i,
  2516. min(last_index, i + ra_pages - 1));
  2517. }
  2518. total_read++;
  2519. page = grab_cache_page(inode->i_mapping, i);
  2520. if (!page)
  2521. goto out_unlock;
  2522. if (!PageUptodate(page)) {
  2523. btrfs_readpage(NULL, page);
  2524. lock_page(page);
  2525. if (!PageUptodate(page)) {
  2526. unlock_page(page);
  2527. page_cache_release(page);
  2528. goto out_unlock;
  2529. }
  2530. }
  2531. page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  2532. page_end = page_start + PAGE_CACHE_SIZE - 1;
  2533. lock_extent(io_tree, page_start, page_end, GFP_NOFS);
  2534. set_extent_delalloc(io_tree, page_start,
  2535. page_end, GFP_NOFS);
  2536. unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
  2537. set_page_dirty(page);
  2538. unlock_page(page);
  2539. page_cache_release(page);
  2540. balance_dirty_pages_ratelimited_nr(inode->i_mapping, 1);
  2541. }
  2542. out_unlock:
  2543. mutex_unlock(&inode->i_mutex);
  2544. return 0;
  2545. }
  2546. static int btrfs_ioctl_resize(struct btrfs_root *root, void __user *arg)
  2547. {
  2548. u64 new_size;
  2549. u64 old_size;
  2550. u64 devid = 1;
  2551. struct btrfs_ioctl_vol_args *vol_args;
  2552. struct btrfs_trans_handle *trans;
  2553. struct btrfs_device *device = NULL;
  2554. char *sizestr;
  2555. char *devstr = NULL;
  2556. int ret = 0;
  2557. int namelen;
  2558. int mod = 0;
  2559. vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
  2560. if (!vol_args)
  2561. return -ENOMEM;
  2562. if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
  2563. ret = -EFAULT;
  2564. goto out;
  2565. }
  2566. namelen = strlen(vol_args->name);
  2567. if (namelen > BTRFS_VOL_NAME_MAX) {
  2568. ret = -EINVAL;
  2569. goto out;
  2570. }
  2571. mutex_lock(&root->fs_info->fs_mutex);
  2572. sizestr = vol_args->name;
  2573. devstr = strchr(sizestr, ':');
  2574. if (devstr) {
  2575. char *end;
  2576. sizestr = devstr + 1;
  2577. *devstr = '\0';
  2578. devstr = vol_args->name;
  2579. devid = simple_strtoull(devstr, &end, 10);
  2580. printk("resizing devid %Lu\n", devid);
  2581. }
  2582. device = btrfs_find_device(root, devid, NULL);
  2583. if (!device) {
  2584. printk("resizer unable to find device %Lu\n", devid);
  2585. ret = -EINVAL;
  2586. goto out_unlock;
  2587. }
  2588. if (!strcmp(sizestr, "max"))
  2589. new_size = device->bdev->bd_inode->i_size;
  2590. else {
  2591. if (sizestr[0] == '-') {
  2592. mod = -1;
  2593. sizestr++;
  2594. } else if (sizestr[0] == '+') {
  2595. mod = 1;
  2596. sizestr++;
  2597. }
  2598. new_size = btrfs_parse_size(sizestr);
  2599. if (new_size == 0) {
  2600. ret = -EINVAL;
  2601. goto out_unlock;
  2602. }
  2603. }
  2604. old_size = device->total_bytes;
  2605. if (mod < 0) {
  2606. if (new_size > old_size) {
  2607. ret = -EINVAL;
  2608. goto out_unlock;
  2609. }
  2610. new_size = old_size - new_size;
  2611. } else if (mod > 0) {
  2612. new_size = old_size + new_size;
  2613. }
  2614. if (new_size < 256 * 1024 * 1024) {
  2615. ret = -EINVAL;
  2616. goto out_unlock;
  2617. }
  2618. if (new_size > device->bdev->bd_inode->i_size) {
  2619. ret = -EFBIG;
  2620. goto out_unlock;
  2621. }
  2622. do_div(new_size, root->sectorsize);
  2623. new_size *= root->sectorsize;
  2624. printk("new size for %s is %llu\n", device->name, (unsigned long long)new_size);
  2625. if (new_size > old_size) {
  2626. trans = btrfs_start_transaction(root, 1);
  2627. ret = btrfs_grow_device(trans, device, new_size);
  2628. btrfs_commit_transaction(trans, root);
  2629. } else {
  2630. ret = btrfs_shrink_device(device, new_size);
  2631. }
  2632. out_unlock:
  2633. mutex_unlock(&root->fs_info->fs_mutex);
  2634. out:
  2635. kfree(vol_args);
  2636. return ret;
  2637. }
  2638. static int noinline btrfs_ioctl_snap_create(struct btrfs_root *root,
  2639. void __user *arg)
  2640. {
  2641. struct btrfs_ioctl_vol_args *vol_args;
  2642. struct btrfs_dir_item *di;
  2643. struct btrfs_path *path;
  2644. u64 root_dirid;
  2645. int namelen;
  2646. int ret;
  2647. vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
  2648. if (!vol_args)
  2649. return -ENOMEM;
  2650. if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
  2651. ret = -EFAULT;
  2652. goto out;
  2653. }
  2654. namelen = strlen(vol_args->name);
  2655. if (namelen > BTRFS_VOL_NAME_MAX) {
  2656. ret = -EINVAL;
  2657. goto out;
  2658. }
  2659. if (strchr(vol_args->name, '/')) {
  2660. ret = -EINVAL;
  2661. goto out;
  2662. }
  2663. path = btrfs_alloc_path();
  2664. if (!path) {
  2665. ret = -ENOMEM;
  2666. goto out;
  2667. }
  2668. root_dirid = root->fs_info->sb->s_root->d_inode->i_ino,
  2669. mutex_lock(&root->fs_info->fs_mutex);
  2670. di = btrfs_lookup_dir_item(NULL, root->fs_info->tree_root,
  2671. path, root_dirid,
  2672. vol_args->name, namelen, 0);
  2673. mutex_unlock(&root->fs_info->fs_mutex);
  2674. btrfs_free_path(path);
  2675. if (di && !IS_ERR(di)) {
  2676. ret = -EEXIST;
  2677. goto out;
  2678. }
  2679. if (IS_ERR(di)) {
  2680. ret = PTR_ERR(di);
  2681. goto out;
  2682. }
  2683. if (root == root->fs_info->tree_root)
  2684. ret = create_subvol(root, vol_args->name, namelen);
  2685. else
  2686. ret = create_snapshot(root, vol_args->name, namelen);
  2687. out:
  2688. kfree(vol_args);
  2689. return ret;
  2690. }
  2691. static int btrfs_ioctl_defrag(struct file *file)
  2692. {
  2693. struct inode *inode = fdentry(file)->d_inode;
  2694. struct btrfs_root *root = BTRFS_I(inode)->root;
  2695. switch (inode->i_mode & S_IFMT) {
  2696. case S_IFDIR:
  2697. mutex_lock(&root->fs_info->fs_mutex);
  2698. btrfs_defrag_root(root, 0);
  2699. btrfs_defrag_root(root->fs_info->extent_root, 0);
  2700. mutex_unlock(&root->fs_info->fs_mutex);
  2701. break;
  2702. case S_IFREG:
  2703. btrfs_defrag_file(file);
  2704. break;
  2705. }
  2706. return 0;
  2707. }
  2708. long btrfs_ioctl(struct file *file, unsigned int
  2709. cmd, unsigned long arg)
  2710. {
  2711. struct btrfs_root *root = BTRFS_I(fdentry(file)->d_inode)->root;
  2712. switch (cmd) {
  2713. case BTRFS_IOC_SNAP_CREATE:
  2714. return btrfs_ioctl_snap_create(root, (void __user *)arg);
  2715. case BTRFS_IOC_DEFRAG:
  2716. return btrfs_ioctl_defrag(file);
  2717. case BTRFS_IOC_RESIZE:
  2718. return btrfs_ioctl_resize(root, (void __user *)arg);
  2719. }
  2720. return -ENOTTY;
  2721. }
  2722. /*
  2723. * Called inside transaction, so use GFP_NOFS
  2724. */
  2725. struct inode *btrfs_alloc_inode(struct super_block *sb)
  2726. {
  2727. struct btrfs_inode *ei;
  2728. ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS);
  2729. if (!ei)
  2730. return NULL;
  2731. ei->last_trans = 0;
  2732. ei->ordered_trans = 0;
  2733. return &ei->vfs_inode;
  2734. }
  2735. void btrfs_destroy_inode(struct inode *inode)
  2736. {
  2737. WARN_ON(!list_empty(&inode->i_dentry));
  2738. WARN_ON(inode->i_data.nrpages);
  2739. btrfs_drop_extent_cache(inode, 0, (u64)-1);
  2740. kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
  2741. }
  2742. #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
  2743. static void init_once(struct kmem_cache * cachep, void *foo)
  2744. #else
  2745. static void init_once(void * foo, struct kmem_cache * cachep,
  2746. unsigned long flags)
  2747. #endif
  2748. {
  2749. struct btrfs_inode *ei = (struct btrfs_inode *) foo;
  2750. inode_init_once(&ei->vfs_inode);
  2751. }
  2752. void btrfs_destroy_cachep(void)
  2753. {
  2754. if (btrfs_inode_cachep)
  2755. kmem_cache_destroy(btrfs_inode_cachep);
  2756. if (btrfs_trans_handle_cachep)
  2757. kmem_cache_destroy(btrfs_trans_handle_cachep);
  2758. if (btrfs_transaction_cachep)
  2759. kmem_cache_destroy(btrfs_transaction_cachep);
  2760. if (btrfs_bit_radix_cachep)
  2761. kmem_cache_destroy(btrfs_bit_radix_cachep);
  2762. if (btrfs_path_cachep)
  2763. kmem_cache_destroy(btrfs_path_cachep);
  2764. }
  2765. struct kmem_cache *btrfs_cache_create(const char *name, size_t size,
  2766. unsigned long extra_flags,
  2767. #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
  2768. void (*ctor)(struct kmem_cache *, void *)
  2769. #else
  2770. void (*ctor)(void *, struct kmem_cache *,
  2771. unsigned long)
  2772. #endif
  2773. )
  2774. {
  2775. return kmem_cache_create(name, size, 0, (SLAB_RECLAIM_ACCOUNT |
  2776. SLAB_MEM_SPREAD | extra_flags), ctor
  2777. #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,23)
  2778. ,NULL
  2779. #endif
  2780. );
  2781. }
  2782. int btrfs_init_cachep(void)
  2783. {
  2784. btrfs_inode_cachep = btrfs_cache_create("btrfs_inode_cache",
  2785. sizeof(struct btrfs_inode),
  2786. 0, init_once);
  2787. if (!btrfs_inode_cachep)
  2788. goto fail;
  2789. btrfs_trans_handle_cachep =
  2790. btrfs_cache_create("btrfs_trans_handle_cache",
  2791. sizeof(struct btrfs_trans_handle),
  2792. 0, NULL);
  2793. if (!btrfs_trans_handle_cachep)
  2794. goto fail;
  2795. btrfs_transaction_cachep = btrfs_cache_create("btrfs_transaction_cache",
  2796. sizeof(struct btrfs_transaction),
  2797. 0, NULL);
  2798. if (!btrfs_transaction_cachep)
  2799. goto fail;
  2800. btrfs_path_cachep = btrfs_cache_create("btrfs_path_cache",
  2801. sizeof(struct btrfs_path),
  2802. 0, NULL);
  2803. if (!btrfs_path_cachep)
  2804. goto fail;
  2805. btrfs_bit_radix_cachep = btrfs_cache_create("btrfs_radix", 256,
  2806. SLAB_DESTROY_BY_RCU, NULL);
  2807. if (!btrfs_bit_radix_cachep)
  2808. goto fail;
  2809. return 0;
  2810. fail:
  2811. btrfs_destroy_cachep();
  2812. return -ENOMEM;
  2813. }
  2814. static int btrfs_getattr(struct vfsmount *mnt,
  2815. struct dentry *dentry, struct kstat *stat)
  2816. {
  2817. struct inode *inode = dentry->d_inode;
  2818. generic_fillattr(inode, stat);
  2819. stat->blksize = PAGE_CACHE_SIZE;
  2820. stat->blocks = inode->i_blocks + (BTRFS_I(inode)->delalloc_bytes >> 9);
  2821. return 0;
  2822. }
  2823. static int btrfs_rename(struct inode * old_dir, struct dentry *old_dentry,
  2824. struct inode * new_dir,struct dentry *new_dentry)
  2825. {
  2826. struct btrfs_trans_handle *trans;
  2827. struct btrfs_root *root = BTRFS_I(old_dir)->root;
  2828. struct inode *new_inode = new_dentry->d_inode;
  2829. struct inode *old_inode = old_dentry->d_inode;
  2830. struct timespec ctime = CURRENT_TIME;
  2831. struct btrfs_path *path;
  2832. int ret;
  2833. if (S_ISDIR(old_inode->i_mode) && new_inode &&
  2834. new_inode->i_size > BTRFS_EMPTY_DIR_SIZE) {
  2835. return -ENOTEMPTY;
  2836. }
  2837. mutex_lock(&root->fs_info->fs_mutex);
  2838. ret = btrfs_check_free_space(root, 1, 0);
  2839. if (ret)
  2840. goto out_unlock;
  2841. trans = btrfs_start_transaction(root, 1);
  2842. btrfs_set_trans_block_group(trans, new_dir);
  2843. path = btrfs_alloc_path();
  2844. if (!path) {
  2845. ret = -ENOMEM;
  2846. goto out_fail;
  2847. }
  2848. old_dentry->d_inode->i_nlink++;
  2849. old_dir->i_ctime = old_dir->i_mtime = ctime;
  2850. new_dir->i_ctime = new_dir->i_mtime = ctime;
  2851. old_inode->i_ctime = ctime;
  2852. ret = btrfs_unlink_trans(trans, root, old_dir, old_dentry);
  2853. if (ret)
  2854. goto out_fail;
  2855. if (new_inode) {
  2856. new_inode->i_ctime = CURRENT_TIME;
  2857. ret = btrfs_unlink_trans(trans, root, new_dir, new_dentry);
  2858. if (ret)
  2859. goto out_fail;
  2860. }
  2861. ret = btrfs_add_link(trans, new_dentry, old_inode, 1);
  2862. if (ret)
  2863. goto out_fail;
  2864. out_fail:
  2865. btrfs_free_path(path);
  2866. btrfs_end_transaction(trans, root);
  2867. out_unlock:
  2868. mutex_unlock(&root->fs_info->fs_mutex);
  2869. return ret;
  2870. }
  2871. static int btrfs_symlink(struct inode *dir, struct dentry *dentry,
  2872. const char *symname)
  2873. {
  2874. struct btrfs_trans_handle *trans;
  2875. struct btrfs_root *root = BTRFS_I(dir)->root;
  2876. struct btrfs_path *path;
  2877. struct btrfs_key key;
  2878. struct inode *inode = NULL;
  2879. int err;
  2880. int drop_inode = 0;
  2881. u64 objectid;
  2882. int name_len;
  2883. int datasize;
  2884. unsigned long ptr;
  2885. struct btrfs_file_extent_item *ei;
  2886. struct extent_buffer *leaf;
  2887. unsigned long nr = 0;
  2888. name_len = strlen(symname) + 1;
  2889. if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root))
  2890. return -ENAMETOOLONG;
  2891. mutex_lock(&root->fs_info->fs_mutex);
  2892. err = btrfs_check_free_space(root, 1, 0);
  2893. if (err)
  2894. goto out_fail;
  2895. trans = btrfs_start_transaction(root, 1);
  2896. btrfs_set_trans_block_group(trans, dir);
  2897. err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid);
  2898. if (err) {
  2899. err = -ENOSPC;
  2900. goto out_unlock;
  2901. }
  2902. inode = btrfs_new_inode(trans, root, dentry->d_name.name,
  2903. dentry->d_name.len,
  2904. dentry->d_parent->d_inode->i_ino, objectid,
  2905. BTRFS_I(dir)->block_group, S_IFLNK|S_IRWXUGO);
  2906. err = PTR_ERR(inode);
  2907. if (IS_ERR(inode))
  2908. goto out_unlock;
  2909. btrfs_set_trans_block_group(trans, inode);
  2910. err = btrfs_add_nondir(trans, dentry, inode, 0);
  2911. if (err)
  2912. drop_inode = 1;
  2913. else {
  2914. inode->i_mapping->a_ops = &btrfs_aops;
  2915. inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
  2916. inode->i_fop = &btrfs_file_operations;
  2917. inode->i_op = &btrfs_file_inode_operations;
  2918. extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS);
  2919. extent_io_tree_init(&BTRFS_I(inode)->io_tree,
  2920. inode->i_mapping, GFP_NOFS);
  2921. extent_io_tree_init(&BTRFS_I(inode)->io_failure_tree,
  2922. inode->i_mapping, GFP_NOFS);
  2923. BTRFS_I(inode)->delalloc_bytes = 0;
  2924. atomic_set(&BTRFS_I(inode)->ordered_writeback, 0);
  2925. BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
  2926. }
  2927. dir->i_sb->s_dirt = 1;
  2928. btrfs_update_inode_block_group(trans, inode);
  2929. btrfs_update_inode_block_group(trans, dir);
  2930. if (drop_inode)
  2931. goto out_unlock;
  2932. path = btrfs_alloc_path();
  2933. BUG_ON(!path);
  2934. key.objectid = inode->i_ino;
  2935. key.offset = 0;
  2936. btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
  2937. datasize = btrfs_file_extent_calc_inline_size(name_len);
  2938. err = btrfs_insert_empty_item(trans, root, path, &key,
  2939. datasize);
  2940. if (err) {
  2941. drop_inode = 1;
  2942. goto out_unlock;
  2943. }
  2944. leaf = path->nodes[0];
  2945. ei = btrfs_item_ptr(leaf, path->slots[0],
  2946. struct btrfs_file_extent_item);
  2947. btrfs_set_file_extent_generation(leaf, ei, trans->transid);
  2948. btrfs_set_file_extent_type(leaf, ei,
  2949. BTRFS_FILE_EXTENT_INLINE);
  2950. ptr = btrfs_file_extent_inline_start(ei);
  2951. write_extent_buffer(leaf, symname, ptr, name_len);
  2952. btrfs_mark_buffer_dirty(leaf);
  2953. btrfs_free_path(path);
  2954. inode->i_op = &btrfs_symlink_inode_operations;
  2955. inode->i_mapping->a_ops = &btrfs_symlink_aops;
  2956. inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
  2957. inode->i_size = name_len - 1;
  2958. err = btrfs_update_inode(trans, root, inode);
  2959. if (err)
  2960. drop_inode = 1;
  2961. out_unlock:
  2962. nr = trans->blocks_used;
  2963. btrfs_end_transaction(trans, root);
  2964. out_fail:
  2965. mutex_unlock(&root->fs_info->fs_mutex);
  2966. if (drop_inode) {
  2967. inode_dec_link_count(inode);
  2968. iput(inode);
  2969. }
  2970. btrfs_btree_balance_dirty(root, nr);
  2971. btrfs_throttle(root);
  2972. return err;
  2973. }
  2974. static int btrfs_permission(struct inode *inode, int mask,
  2975. struct nameidata *nd)
  2976. {
  2977. if (btrfs_test_flag(inode, READONLY) && (mask & MAY_WRITE))
  2978. return -EACCES;
  2979. return generic_permission(inode, mask, NULL);
  2980. }
  2981. static struct inode_operations btrfs_dir_inode_operations = {
  2982. .lookup = btrfs_lookup,
  2983. .create = btrfs_create,
  2984. .unlink = btrfs_unlink,
  2985. .link = btrfs_link,
  2986. .mkdir = btrfs_mkdir,
  2987. .rmdir = btrfs_rmdir,
  2988. .rename = btrfs_rename,
  2989. .symlink = btrfs_symlink,
  2990. .setattr = btrfs_setattr,
  2991. .mknod = btrfs_mknod,
  2992. .setxattr = generic_setxattr,
  2993. .getxattr = generic_getxattr,
  2994. .listxattr = btrfs_listxattr,
  2995. .removexattr = generic_removexattr,
  2996. .permission = btrfs_permission,
  2997. };
  2998. static struct inode_operations btrfs_dir_ro_inode_operations = {
  2999. .lookup = btrfs_lookup,
  3000. .permission = btrfs_permission,
  3001. };
  3002. static struct file_operations btrfs_dir_file_operations = {
  3003. .llseek = generic_file_llseek,
  3004. .read = generic_read_dir,
  3005. .readdir = btrfs_readdir,
  3006. .unlocked_ioctl = btrfs_ioctl,
  3007. #ifdef CONFIG_COMPAT
  3008. .compat_ioctl = btrfs_ioctl,
  3009. #endif
  3010. };
  3011. static struct extent_io_ops btrfs_extent_io_ops = {
  3012. .fill_delalloc = run_delalloc_range,
  3013. .submit_bio_hook = btrfs_submit_bio_hook,
  3014. .merge_bio_hook = btrfs_merge_bio_hook,
  3015. .readpage_io_hook = btrfs_readpage_io_hook,
  3016. .readpage_end_io_hook = btrfs_readpage_end_io_hook,
  3017. .readpage_io_failed_hook = btrfs_readpage_io_failed_hook,
  3018. .set_bit_hook = btrfs_set_bit_hook,
  3019. .clear_bit_hook = btrfs_clear_bit_hook,
  3020. };
  3021. static struct address_space_operations btrfs_aops = {
  3022. .readpage = btrfs_readpage,
  3023. .writepage = btrfs_writepage,
  3024. .writepages = btrfs_writepages,
  3025. .readpages = btrfs_readpages,
  3026. .sync_page = block_sync_page,
  3027. .bmap = btrfs_bmap,
  3028. .direct_IO = btrfs_direct_IO,
  3029. .invalidatepage = btrfs_invalidatepage,
  3030. .releasepage = btrfs_releasepage,
  3031. .set_page_dirty = __set_page_dirty_nobuffers,
  3032. };
  3033. static struct address_space_operations btrfs_symlink_aops = {
  3034. .readpage = btrfs_readpage,
  3035. .writepage = btrfs_writepage,
  3036. .invalidatepage = btrfs_invalidatepage,
  3037. .releasepage = btrfs_releasepage,
  3038. };
  3039. static struct inode_operations btrfs_file_inode_operations = {
  3040. .truncate = btrfs_truncate,
  3041. .getattr = btrfs_getattr,
  3042. .setattr = btrfs_setattr,
  3043. .setxattr = generic_setxattr,
  3044. .getxattr = generic_getxattr,
  3045. .listxattr = btrfs_listxattr,
  3046. .removexattr = generic_removexattr,
  3047. .permission = btrfs_permission,
  3048. };
  3049. static struct inode_operations btrfs_special_inode_operations = {
  3050. .getattr = btrfs_getattr,
  3051. .setattr = btrfs_setattr,
  3052. .permission = btrfs_permission,
  3053. };
  3054. static struct inode_operations btrfs_symlink_inode_operations = {
  3055. .readlink = generic_readlink,
  3056. .follow_link = page_follow_link_light,
  3057. .put_link = page_put_link,
  3058. .permission = btrfs_permission,
  3059. };