inode.c 66 KB

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