inode.c 74 KB

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