inode.c 66 KB

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