inode.c 64 KB

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