inode.c 75 KB

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