inode.c 67 KB

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