inode.c 69 KB

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