inode.c 77 KB

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