inode.c 77 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050
  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. btrfs_set_file_extent_num_bytes(leaf, fi,
  737. extent_num_bytes);
  738. num_dec = (orig_num_bytes -
  739. extent_num_bytes) >> 9;
  740. if (extent_start != 0) {
  741. inode->i_blocks -= num_dec;
  742. }
  743. btrfs_mark_buffer_dirty(leaf);
  744. } else {
  745. extent_num_bytes =
  746. btrfs_file_extent_disk_num_bytes(leaf,
  747. fi);
  748. /* FIXME blocksize != 4096 */
  749. num_dec = btrfs_file_extent_num_bytes(leaf,
  750. fi) >> 9;
  751. if (extent_start != 0) {
  752. found_extent = 1;
  753. inode->i_blocks -= num_dec;
  754. }
  755. root_gen = btrfs_header_generation(leaf);
  756. root_owner = btrfs_header_owner(leaf);
  757. }
  758. } else if (extent_type == BTRFS_FILE_EXTENT_INLINE &&
  759. !del_item) {
  760. u32 newsize = inode->i_size - found_key.offset;
  761. newsize = btrfs_file_extent_calc_inline_size(newsize);
  762. ret = btrfs_truncate_item(trans, root, path,
  763. newsize, 1);
  764. BUG_ON(ret);
  765. }
  766. delete:
  767. if (del_item) {
  768. if (!pending_del_nr) {
  769. /* no pending yet, add ourselves */
  770. pending_del_slot = path->slots[0];
  771. pending_del_nr = 1;
  772. } else if (pending_del_nr &&
  773. path->slots[0] + 1 == pending_del_slot) {
  774. /* hop on the pending chunk */
  775. pending_del_nr++;
  776. pending_del_slot = path->slots[0];
  777. } else {
  778. printk("bad pending slot %d pending_del_nr %d pending_del_slot %d\n", path->slots[0], pending_del_nr, pending_del_slot);
  779. }
  780. } else {
  781. break;
  782. }
  783. if (found_extent) {
  784. ret = btrfs_free_extent(trans, root, extent_start,
  785. extent_num_bytes,
  786. root_owner,
  787. root_gen, inode->i_ino,
  788. found_key.offset, 0);
  789. BUG_ON(ret);
  790. }
  791. next:
  792. if (path->slots[0] == 0) {
  793. if (pending_del_nr)
  794. goto del_pending;
  795. btrfs_release_path(root, path);
  796. goto search_again;
  797. }
  798. path->slots[0]--;
  799. if (pending_del_nr &&
  800. path->slots[0] + 1 != pending_del_slot) {
  801. struct btrfs_key debug;
  802. del_pending:
  803. btrfs_item_key_to_cpu(path->nodes[0], &debug,
  804. pending_del_slot);
  805. ret = btrfs_del_items(trans, root, path,
  806. pending_del_slot,
  807. pending_del_nr);
  808. BUG_ON(ret);
  809. pending_del_nr = 0;
  810. btrfs_release_path(root, path);
  811. goto search_again;
  812. }
  813. }
  814. ret = 0;
  815. error:
  816. if (pending_del_nr) {
  817. ret = btrfs_del_items(trans, root, path, pending_del_slot,
  818. pending_del_nr);
  819. }
  820. btrfs_release_path(root, path);
  821. btrfs_free_path(path);
  822. inode->i_sb->s_dirt = 1;
  823. return ret;
  824. }
  825. static int btrfs_cow_one_page(struct inode *inode, struct page *page,
  826. size_t zero_start)
  827. {
  828. char *kaddr;
  829. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  830. u64 page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  831. u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
  832. int ret = 0;
  833. WARN_ON(!PageLocked(page));
  834. set_page_extent_mapped(page);
  835. lock_extent(io_tree, page_start, page_end, GFP_NOFS);
  836. set_extent_delalloc(&BTRFS_I(inode)->io_tree, page_start,
  837. page_end, GFP_NOFS);
  838. if (zero_start != PAGE_CACHE_SIZE) {
  839. kaddr = kmap(page);
  840. memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start);
  841. flush_dcache_page(page);
  842. kunmap(page);
  843. }
  844. set_page_dirty(page);
  845. unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
  846. return ret;
  847. }
  848. /*
  849. * taken from block_truncate_page, but does cow as it zeros out
  850. * any bytes left in the last page in the file.
  851. */
  852. static int btrfs_truncate_page(struct address_space *mapping, loff_t from)
  853. {
  854. struct inode *inode = mapping->host;
  855. struct btrfs_root *root = BTRFS_I(inode)->root;
  856. u32 blocksize = root->sectorsize;
  857. pgoff_t index = from >> PAGE_CACHE_SHIFT;
  858. unsigned offset = from & (PAGE_CACHE_SIZE-1);
  859. struct page *page;
  860. int ret = 0;
  861. u64 page_start;
  862. if ((offset & (blocksize - 1)) == 0)
  863. goto out;
  864. ret = -ENOMEM;
  865. page = grab_cache_page(mapping, index);
  866. if (!page)
  867. goto out;
  868. if (!PageUptodate(page)) {
  869. ret = btrfs_readpage(NULL, page);
  870. lock_page(page);
  871. if (!PageUptodate(page)) {
  872. ret = -EIO;
  873. goto out;
  874. }
  875. }
  876. page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  877. ret = btrfs_cow_one_page(inode, page, offset);
  878. unlock_page(page);
  879. page_cache_release(page);
  880. out:
  881. return ret;
  882. }
  883. static int btrfs_setattr(struct dentry *dentry, struct iattr *attr)
  884. {
  885. struct inode *inode = dentry->d_inode;
  886. int err;
  887. err = inode_change_ok(inode, attr);
  888. if (err)
  889. return err;
  890. if (S_ISREG(inode->i_mode) &&
  891. attr->ia_valid & ATTR_SIZE && attr->ia_size > inode->i_size) {
  892. struct btrfs_trans_handle *trans;
  893. struct btrfs_root *root = BTRFS_I(inode)->root;
  894. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  895. u64 mask = root->sectorsize - 1;
  896. u64 pos = (inode->i_size + mask) & ~mask;
  897. u64 block_end = attr->ia_size | mask;
  898. u64 hole_start;
  899. u64 hole_size;
  900. u64 alloc_hint = 0;
  901. if (attr->ia_size <= pos)
  902. goto out;
  903. if (pos != inode->i_size)
  904. hole_start = pos + root->sectorsize;
  905. else
  906. hole_start = pos;
  907. mutex_lock(&root->fs_info->fs_mutex);
  908. err = btrfs_check_free_space(root, 1, 0);
  909. mutex_unlock(&root->fs_info->fs_mutex);
  910. if (err)
  911. goto fail;
  912. btrfs_truncate_page(inode->i_mapping, inode->i_size);
  913. lock_extent(io_tree, pos, block_end, GFP_NOFS);
  914. hole_size = block_end - hole_start;
  915. mutex_lock(&root->fs_info->fs_mutex);
  916. trans = btrfs_start_transaction(root, 1);
  917. btrfs_set_trans_block_group(trans, inode);
  918. err = btrfs_drop_extents(trans, root, inode,
  919. pos, block_end, pos,
  920. &alloc_hint);
  921. if (alloc_hint != EXTENT_MAP_INLINE) {
  922. err = btrfs_insert_file_extent(trans, root,
  923. inode->i_ino,
  924. hole_start, 0, 0,
  925. hole_size);
  926. btrfs_drop_extent_cache(inode, hole_start,
  927. hole_size - 1);
  928. btrfs_check_file(root, inode);
  929. }
  930. btrfs_end_transaction(trans, root);
  931. mutex_unlock(&root->fs_info->fs_mutex);
  932. unlock_extent(io_tree, pos, block_end, GFP_NOFS);
  933. if (err)
  934. return err;
  935. }
  936. out:
  937. err = inode_setattr(inode, attr);
  938. fail:
  939. return err;
  940. }
  941. void btrfs_put_inode(struct inode *inode)
  942. {
  943. int ret;
  944. if (!BTRFS_I(inode)->ordered_trans) {
  945. return;
  946. }
  947. if (mapping_tagged(inode->i_mapping, PAGECACHE_TAG_DIRTY) ||
  948. mapping_tagged(inode->i_mapping, PAGECACHE_TAG_WRITEBACK))
  949. return;
  950. ret = btrfs_del_ordered_inode(inode);
  951. if (ret == 1) {
  952. atomic_dec(&inode->i_count);
  953. }
  954. }
  955. void btrfs_delete_inode(struct inode *inode)
  956. {
  957. struct btrfs_trans_handle *trans;
  958. struct btrfs_root *root = BTRFS_I(inode)->root;
  959. unsigned long nr;
  960. int ret;
  961. truncate_inode_pages(&inode->i_data, 0);
  962. if (is_bad_inode(inode)) {
  963. goto no_delete;
  964. }
  965. inode->i_size = 0;
  966. mutex_lock(&root->fs_info->fs_mutex);
  967. trans = btrfs_start_transaction(root, 1);
  968. btrfs_set_trans_block_group(trans, inode);
  969. ret = btrfs_truncate_in_trans(trans, root, inode, 0);
  970. if (ret)
  971. goto no_delete_lock;
  972. nr = trans->blocks_used;
  973. clear_inode(inode);
  974. btrfs_end_transaction(trans, root);
  975. mutex_unlock(&root->fs_info->fs_mutex);
  976. btrfs_btree_balance_dirty(root, nr);
  977. btrfs_throttle(root);
  978. return;
  979. no_delete_lock:
  980. nr = trans->blocks_used;
  981. btrfs_end_transaction(trans, root);
  982. mutex_unlock(&root->fs_info->fs_mutex);
  983. btrfs_btree_balance_dirty(root, nr);
  984. btrfs_throttle(root);
  985. no_delete:
  986. clear_inode(inode);
  987. }
  988. /*
  989. * this returns the key found in the dir entry in the location pointer.
  990. * If no dir entries were found, location->objectid is 0.
  991. */
  992. static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
  993. struct btrfs_key *location)
  994. {
  995. const char *name = dentry->d_name.name;
  996. int namelen = dentry->d_name.len;
  997. struct btrfs_dir_item *di;
  998. struct btrfs_path *path;
  999. struct btrfs_root *root = BTRFS_I(dir)->root;
  1000. int ret = 0;
  1001. if (namelen == 1 && strcmp(name, ".") == 0) {
  1002. location->objectid = dir->i_ino;
  1003. location->type = BTRFS_INODE_ITEM_KEY;
  1004. location->offset = 0;
  1005. return 0;
  1006. }
  1007. path = btrfs_alloc_path();
  1008. BUG_ON(!path);
  1009. if (namelen == 2 && strcmp(name, "..") == 0) {
  1010. struct btrfs_key key;
  1011. struct extent_buffer *leaf;
  1012. u32 nritems;
  1013. int slot;
  1014. key.objectid = dir->i_ino;
  1015. btrfs_set_key_type(&key, BTRFS_INODE_REF_KEY);
  1016. key.offset = 0;
  1017. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  1018. BUG_ON(ret == 0);
  1019. ret = 0;
  1020. leaf = path->nodes[0];
  1021. slot = path->slots[0];
  1022. nritems = btrfs_header_nritems(leaf);
  1023. if (slot >= nritems)
  1024. goto out_err;
  1025. btrfs_item_key_to_cpu(leaf, &key, slot);
  1026. if (key.objectid != dir->i_ino ||
  1027. key.type != BTRFS_INODE_REF_KEY) {
  1028. goto out_err;
  1029. }
  1030. location->objectid = key.offset;
  1031. location->type = BTRFS_INODE_ITEM_KEY;
  1032. location->offset = 0;
  1033. goto out;
  1034. }
  1035. di = btrfs_lookup_dir_item(NULL, root, path, dir->i_ino, name,
  1036. namelen, 0);
  1037. if (IS_ERR(di))
  1038. ret = PTR_ERR(di);
  1039. if (!di || IS_ERR(di)) {
  1040. goto out_err;
  1041. }
  1042. btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
  1043. out:
  1044. btrfs_free_path(path);
  1045. return ret;
  1046. out_err:
  1047. location->objectid = 0;
  1048. goto out;
  1049. }
  1050. /*
  1051. * when we hit a tree root in a directory, the btrfs part of the inode
  1052. * needs to be changed to reflect the root directory of the tree root. This
  1053. * is kind of like crossing a mount point.
  1054. */
  1055. static int fixup_tree_root_location(struct btrfs_root *root,
  1056. struct btrfs_key *location,
  1057. struct btrfs_root **sub_root,
  1058. struct dentry *dentry)
  1059. {
  1060. struct btrfs_path *path;
  1061. struct btrfs_root_item *ri;
  1062. if (btrfs_key_type(location) != BTRFS_ROOT_ITEM_KEY)
  1063. return 0;
  1064. if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
  1065. return 0;
  1066. path = btrfs_alloc_path();
  1067. BUG_ON(!path);
  1068. mutex_lock(&root->fs_info->fs_mutex);
  1069. *sub_root = btrfs_read_fs_root(root->fs_info, location,
  1070. dentry->d_name.name,
  1071. dentry->d_name.len);
  1072. if (IS_ERR(*sub_root))
  1073. return PTR_ERR(*sub_root);
  1074. ri = &(*sub_root)->root_item;
  1075. location->objectid = btrfs_root_dirid(ri);
  1076. btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY);
  1077. location->offset = 0;
  1078. btrfs_free_path(path);
  1079. mutex_unlock(&root->fs_info->fs_mutex);
  1080. return 0;
  1081. }
  1082. static int btrfs_init_locked_inode(struct inode *inode, void *p)
  1083. {
  1084. struct btrfs_iget_args *args = p;
  1085. inode->i_ino = args->ino;
  1086. BTRFS_I(inode)->root = args->root;
  1087. extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS);
  1088. extent_io_tree_init(&BTRFS_I(inode)->io_tree,
  1089. inode->i_mapping, GFP_NOFS);
  1090. return 0;
  1091. }
  1092. static int btrfs_find_actor(struct inode *inode, void *opaque)
  1093. {
  1094. struct btrfs_iget_args *args = opaque;
  1095. return (args->ino == inode->i_ino &&
  1096. args->root == BTRFS_I(inode)->root);
  1097. }
  1098. struct inode *btrfs_ilookup(struct super_block *s, u64 objectid,
  1099. u64 root_objectid)
  1100. {
  1101. struct btrfs_iget_args args;
  1102. args.ino = objectid;
  1103. args.root = btrfs_lookup_fs_root(btrfs_sb(s)->fs_info, root_objectid);
  1104. if (!args.root)
  1105. return NULL;
  1106. return ilookup5(s, objectid, btrfs_find_actor, (void *)&args);
  1107. }
  1108. struct inode *btrfs_iget_locked(struct super_block *s, u64 objectid,
  1109. struct btrfs_root *root)
  1110. {
  1111. struct inode *inode;
  1112. struct btrfs_iget_args args;
  1113. args.ino = objectid;
  1114. args.root = root;
  1115. inode = iget5_locked(s, objectid, btrfs_find_actor,
  1116. btrfs_init_locked_inode,
  1117. (void *)&args);
  1118. return inode;
  1119. }
  1120. static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
  1121. struct nameidata *nd)
  1122. {
  1123. struct inode * inode;
  1124. struct btrfs_inode *bi = BTRFS_I(dir);
  1125. struct btrfs_root *root = bi->root;
  1126. struct btrfs_root *sub_root = root;
  1127. struct btrfs_key location;
  1128. int ret;
  1129. if (dentry->d_name.len > BTRFS_NAME_LEN)
  1130. return ERR_PTR(-ENAMETOOLONG);
  1131. mutex_lock(&root->fs_info->fs_mutex);
  1132. ret = btrfs_inode_by_name(dir, dentry, &location);
  1133. mutex_unlock(&root->fs_info->fs_mutex);
  1134. if (ret < 0)
  1135. return ERR_PTR(ret);
  1136. inode = NULL;
  1137. if (location.objectid) {
  1138. ret = fixup_tree_root_location(root, &location, &sub_root,
  1139. dentry);
  1140. if (ret < 0)
  1141. return ERR_PTR(ret);
  1142. if (ret > 0)
  1143. return ERR_PTR(-ENOENT);
  1144. inode = btrfs_iget_locked(dir->i_sb, location.objectid,
  1145. sub_root);
  1146. if (!inode)
  1147. return ERR_PTR(-EACCES);
  1148. if (inode->i_state & I_NEW) {
  1149. /* the inode and parent dir are two different roots */
  1150. if (sub_root != root) {
  1151. igrab(inode);
  1152. sub_root->inode = inode;
  1153. }
  1154. BTRFS_I(inode)->root = sub_root;
  1155. memcpy(&BTRFS_I(inode)->location, &location,
  1156. sizeof(location));
  1157. btrfs_read_locked_inode(inode);
  1158. unlock_new_inode(inode);
  1159. }
  1160. }
  1161. return d_splice_alias(inode, dentry);
  1162. }
  1163. static unsigned char btrfs_filetype_table[] = {
  1164. DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK
  1165. };
  1166. static int btrfs_readdir(struct file *filp, void *dirent, filldir_t filldir)
  1167. {
  1168. struct inode *inode = filp->f_dentry->d_inode;
  1169. struct btrfs_root *root = BTRFS_I(inode)->root;
  1170. struct btrfs_item *item;
  1171. struct btrfs_dir_item *di;
  1172. struct btrfs_key key;
  1173. struct btrfs_key found_key;
  1174. struct btrfs_path *path;
  1175. int ret;
  1176. u32 nritems;
  1177. struct extent_buffer *leaf;
  1178. int slot;
  1179. int advance;
  1180. unsigned char d_type;
  1181. int over = 0;
  1182. u32 di_cur;
  1183. u32 di_total;
  1184. u32 di_len;
  1185. int key_type = BTRFS_DIR_INDEX_KEY;
  1186. char tmp_name[32];
  1187. char *name_ptr;
  1188. int name_len;
  1189. /* FIXME, use a real flag for deciding about the key type */
  1190. if (root->fs_info->tree_root == root)
  1191. key_type = BTRFS_DIR_ITEM_KEY;
  1192. /* special case for "." */
  1193. if (filp->f_pos == 0) {
  1194. over = filldir(dirent, ".", 1,
  1195. 1, inode->i_ino,
  1196. DT_DIR);
  1197. if (over)
  1198. return 0;
  1199. filp->f_pos = 1;
  1200. }
  1201. mutex_lock(&root->fs_info->fs_mutex);
  1202. key.objectid = inode->i_ino;
  1203. path = btrfs_alloc_path();
  1204. path->reada = 2;
  1205. /* special case for .., just use the back ref */
  1206. if (filp->f_pos == 1) {
  1207. btrfs_set_key_type(&key, BTRFS_INODE_REF_KEY);
  1208. key.offset = 0;
  1209. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  1210. BUG_ON(ret == 0);
  1211. leaf = path->nodes[0];
  1212. slot = path->slots[0];
  1213. nritems = btrfs_header_nritems(leaf);
  1214. if (slot >= nritems) {
  1215. btrfs_release_path(root, path);
  1216. goto read_dir_items;
  1217. }
  1218. btrfs_item_key_to_cpu(leaf, &found_key, slot);
  1219. btrfs_release_path(root, path);
  1220. if (found_key.objectid != key.objectid ||
  1221. found_key.type != BTRFS_INODE_REF_KEY)
  1222. goto read_dir_items;
  1223. over = filldir(dirent, "..", 2,
  1224. 2, found_key.offset, DT_DIR);
  1225. if (over)
  1226. goto nopos;
  1227. filp->f_pos = 2;
  1228. }
  1229. read_dir_items:
  1230. btrfs_set_key_type(&key, key_type);
  1231. key.offset = filp->f_pos;
  1232. ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
  1233. if (ret < 0)
  1234. goto err;
  1235. advance = 0;
  1236. while(1) {
  1237. leaf = path->nodes[0];
  1238. nritems = btrfs_header_nritems(leaf);
  1239. slot = path->slots[0];
  1240. if (advance || slot >= nritems) {
  1241. if (slot >= nritems -1) {
  1242. ret = btrfs_next_leaf(root, path);
  1243. if (ret)
  1244. break;
  1245. leaf = path->nodes[0];
  1246. nritems = btrfs_header_nritems(leaf);
  1247. slot = path->slots[0];
  1248. } else {
  1249. slot++;
  1250. path->slots[0]++;
  1251. }
  1252. }
  1253. advance = 1;
  1254. item = btrfs_item_nr(leaf, slot);
  1255. btrfs_item_key_to_cpu(leaf, &found_key, slot);
  1256. if (found_key.objectid != key.objectid)
  1257. break;
  1258. if (btrfs_key_type(&found_key) != key_type)
  1259. break;
  1260. if (found_key.offset < filp->f_pos)
  1261. continue;
  1262. filp->f_pos = found_key.offset;
  1263. advance = 1;
  1264. di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
  1265. di_cur = 0;
  1266. di_total = btrfs_item_size(leaf, item);
  1267. while(di_cur < di_total) {
  1268. struct btrfs_key location;
  1269. name_len = btrfs_dir_name_len(leaf, di);
  1270. if (name_len < 32) {
  1271. name_ptr = tmp_name;
  1272. } else {
  1273. name_ptr = kmalloc(name_len, GFP_NOFS);
  1274. BUG_ON(!name_ptr);
  1275. }
  1276. read_extent_buffer(leaf, name_ptr,
  1277. (unsigned long)(di + 1), name_len);
  1278. d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)];
  1279. btrfs_dir_item_key_to_cpu(leaf, di, &location);
  1280. over = filldir(dirent, name_ptr, name_len,
  1281. found_key.offset,
  1282. location.objectid,
  1283. d_type);
  1284. if (name_ptr != tmp_name)
  1285. kfree(name_ptr);
  1286. if (over)
  1287. goto nopos;
  1288. di_len = btrfs_dir_name_len(leaf, di) +
  1289. btrfs_dir_data_len(leaf, di) +sizeof(*di);
  1290. di_cur += di_len;
  1291. di = (struct btrfs_dir_item *)((char *)di + di_len);
  1292. }
  1293. }
  1294. filp->f_pos = INT_LIMIT(typeof(filp->f_pos));
  1295. nopos:
  1296. ret = 0;
  1297. err:
  1298. btrfs_release_path(root, path);
  1299. btrfs_free_path(path);
  1300. mutex_unlock(&root->fs_info->fs_mutex);
  1301. return ret;
  1302. }
  1303. int btrfs_write_inode(struct inode *inode, int wait)
  1304. {
  1305. struct btrfs_root *root = BTRFS_I(inode)->root;
  1306. struct btrfs_trans_handle *trans;
  1307. int ret = 0;
  1308. if (wait) {
  1309. mutex_lock(&root->fs_info->fs_mutex);
  1310. trans = btrfs_start_transaction(root, 1);
  1311. btrfs_set_trans_block_group(trans, inode);
  1312. ret = btrfs_commit_transaction(trans, root);
  1313. mutex_unlock(&root->fs_info->fs_mutex);
  1314. }
  1315. return ret;
  1316. }
  1317. /*
  1318. * This is somewhat expensive, updating the tree every time the
  1319. * inode changes. But, it is most likely to find the inode in cache.
  1320. * FIXME, needs more benchmarking...there are no reasons other than performance
  1321. * to keep or drop this code.
  1322. */
  1323. void btrfs_dirty_inode(struct inode *inode)
  1324. {
  1325. struct btrfs_root *root = BTRFS_I(inode)->root;
  1326. struct btrfs_trans_handle *trans;
  1327. mutex_lock(&root->fs_info->fs_mutex);
  1328. trans = btrfs_start_transaction(root, 1);
  1329. btrfs_set_trans_block_group(trans, inode);
  1330. btrfs_update_inode(trans, root, inode);
  1331. btrfs_end_transaction(trans, root);
  1332. mutex_unlock(&root->fs_info->fs_mutex);
  1333. }
  1334. static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
  1335. struct btrfs_root *root,
  1336. const char *name, int name_len,
  1337. u64 ref_objectid,
  1338. u64 objectid,
  1339. struct btrfs_block_group_cache *group,
  1340. int mode)
  1341. {
  1342. struct inode *inode;
  1343. struct btrfs_inode_item *inode_item;
  1344. struct btrfs_key *location;
  1345. struct btrfs_path *path;
  1346. struct btrfs_inode_ref *ref;
  1347. struct btrfs_key key[2];
  1348. u32 sizes[2];
  1349. unsigned long ptr;
  1350. int ret;
  1351. int owner;
  1352. path = btrfs_alloc_path();
  1353. BUG_ON(!path);
  1354. inode = new_inode(root->fs_info->sb);
  1355. if (!inode)
  1356. return ERR_PTR(-ENOMEM);
  1357. extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS);
  1358. extent_io_tree_init(&BTRFS_I(inode)->io_tree,
  1359. inode->i_mapping, GFP_NOFS);
  1360. BTRFS_I(inode)->root = root;
  1361. if (mode & S_IFDIR)
  1362. owner = 0;
  1363. else
  1364. owner = 1;
  1365. group = btrfs_find_block_group(root, group, 0, 0, owner);
  1366. BTRFS_I(inode)->block_group = group;
  1367. BTRFS_I(inode)->flags = 0;
  1368. key[0].objectid = objectid;
  1369. btrfs_set_key_type(&key[0], BTRFS_INODE_ITEM_KEY);
  1370. key[0].offset = 0;
  1371. key[1].objectid = objectid;
  1372. btrfs_set_key_type(&key[1], BTRFS_INODE_REF_KEY);
  1373. key[1].offset = ref_objectid;
  1374. sizes[0] = sizeof(struct btrfs_inode_item);
  1375. sizes[1] = name_len + sizeof(*ref);
  1376. ret = btrfs_insert_empty_items(trans, root, path, key, sizes, 2);
  1377. if (ret != 0)
  1378. goto fail;
  1379. if (objectid > root->highest_inode)
  1380. root->highest_inode = objectid;
  1381. inode->i_uid = current->fsuid;
  1382. inode->i_gid = current->fsgid;
  1383. inode->i_mode = mode;
  1384. inode->i_ino = objectid;
  1385. inode->i_blocks = 0;
  1386. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  1387. inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
  1388. struct btrfs_inode_item);
  1389. fill_inode_item(path->nodes[0], inode_item, inode);
  1390. ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
  1391. struct btrfs_inode_ref);
  1392. btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
  1393. ptr = (unsigned long)(ref + 1);
  1394. write_extent_buffer(path->nodes[0], name, ptr, name_len);
  1395. btrfs_mark_buffer_dirty(path->nodes[0]);
  1396. btrfs_free_path(path);
  1397. location = &BTRFS_I(inode)->location;
  1398. location->objectid = objectid;
  1399. location->offset = 0;
  1400. btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY);
  1401. insert_inode_hash(inode);
  1402. return inode;
  1403. fail:
  1404. btrfs_free_path(path);
  1405. return ERR_PTR(ret);
  1406. }
  1407. static inline u8 btrfs_inode_type(struct inode *inode)
  1408. {
  1409. return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT];
  1410. }
  1411. static int btrfs_add_link(struct btrfs_trans_handle *trans,
  1412. struct dentry *dentry, struct inode *inode,
  1413. int add_backref)
  1414. {
  1415. int ret;
  1416. struct btrfs_key key;
  1417. struct btrfs_root *root = BTRFS_I(dentry->d_parent->d_inode)->root;
  1418. struct inode *parent_inode;
  1419. key.objectid = inode->i_ino;
  1420. btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
  1421. key.offset = 0;
  1422. ret = btrfs_insert_dir_item(trans, root,
  1423. dentry->d_name.name, dentry->d_name.len,
  1424. dentry->d_parent->d_inode->i_ino,
  1425. &key, btrfs_inode_type(inode));
  1426. if (ret == 0) {
  1427. if (add_backref) {
  1428. ret = btrfs_insert_inode_ref(trans, root,
  1429. dentry->d_name.name,
  1430. dentry->d_name.len,
  1431. inode->i_ino,
  1432. dentry->d_parent->d_inode->i_ino);
  1433. }
  1434. parent_inode = dentry->d_parent->d_inode;
  1435. parent_inode->i_size += dentry->d_name.len * 2;
  1436. parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME;
  1437. ret = btrfs_update_inode(trans, root,
  1438. dentry->d_parent->d_inode);
  1439. }
  1440. return ret;
  1441. }
  1442. static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
  1443. struct dentry *dentry, struct inode *inode,
  1444. int backref)
  1445. {
  1446. int err = btrfs_add_link(trans, dentry, inode, backref);
  1447. if (!err) {
  1448. d_instantiate(dentry, inode);
  1449. return 0;
  1450. }
  1451. if (err > 0)
  1452. err = -EEXIST;
  1453. return err;
  1454. }
  1455. static int btrfs_mknod(struct inode *dir, struct dentry *dentry,
  1456. int mode, dev_t rdev)
  1457. {
  1458. struct btrfs_trans_handle *trans;
  1459. struct btrfs_root *root = BTRFS_I(dir)->root;
  1460. struct inode *inode = NULL;
  1461. int err;
  1462. int drop_inode = 0;
  1463. u64 objectid;
  1464. unsigned long nr = 0;
  1465. if (!new_valid_dev(rdev))
  1466. return -EINVAL;
  1467. mutex_lock(&root->fs_info->fs_mutex);
  1468. err = btrfs_check_free_space(root, 1, 0);
  1469. if (err)
  1470. goto fail;
  1471. trans = btrfs_start_transaction(root, 1);
  1472. btrfs_set_trans_block_group(trans, dir);
  1473. err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid);
  1474. if (err) {
  1475. err = -ENOSPC;
  1476. goto out_unlock;
  1477. }
  1478. inode = btrfs_new_inode(trans, root, dentry->d_name.name,
  1479. dentry->d_name.len,
  1480. dentry->d_parent->d_inode->i_ino, objectid,
  1481. BTRFS_I(dir)->block_group, mode);
  1482. err = PTR_ERR(inode);
  1483. if (IS_ERR(inode))
  1484. goto out_unlock;
  1485. btrfs_set_trans_block_group(trans, inode);
  1486. err = btrfs_add_nondir(trans, dentry, inode, 0);
  1487. if (err)
  1488. drop_inode = 1;
  1489. else {
  1490. inode->i_op = &btrfs_special_inode_operations;
  1491. init_special_inode(inode, inode->i_mode, rdev);
  1492. btrfs_update_inode(trans, root, inode);
  1493. }
  1494. dir->i_sb->s_dirt = 1;
  1495. btrfs_update_inode_block_group(trans, inode);
  1496. btrfs_update_inode_block_group(trans, dir);
  1497. out_unlock:
  1498. nr = trans->blocks_used;
  1499. btrfs_end_transaction(trans, root);
  1500. fail:
  1501. mutex_unlock(&root->fs_info->fs_mutex);
  1502. if (drop_inode) {
  1503. inode_dec_link_count(inode);
  1504. iput(inode);
  1505. }
  1506. btrfs_btree_balance_dirty(root, nr);
  1507. btrfs_throttle(root);
  1508. return err;
  1509. }
  1510. static int btrfs_create(struct inode *dir, struct dentry *dentry,
  1511. int mode, struct nameidata *nd)
  1512. {
  1513. struct btrfs_trans_handle *trans;
  1514. struct btrfs_root *root = BTRFS_I(dir)->root;
  1515. struct inode *inode = NULL;
  1516. int err;
  1517. int drop_inode = 0;
  1518. unsigned long nr = 0;
  1519. u64 objectid;
  1520. mutex_lock(&root->fs_info->fs_mutex);
  1521. err = btrfs_check_free_space(root, 1, 0);
  1522. if (err)
  1523. goto fail;
  1524. trans = btrfs_start_transaction(root, 1);
  1525. btrfs_set_trans_block_group(trans, dir);
  1526. err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid);
  1527. if (err) {
  1528. err = -ENOSPC;
  1529. goto out_unlock;
  1530. }
  1531. inode = btrfs_new_inode(trans, root, dentry->d_name.name,
  1532. dentry->d_name.len,
  1533. dentry->d_parent->d_inode->i_ino,
  1534. objectid, BTRFS_I(dir)->block_group, mode);
  1535. err = PTR_ERR(inode);
  1536. if (IS_ERR(inode))
  1537. goto out_unlock;
  1538. btrfs_set_trans_block_group(trans, inode);
  1539. err = btrfs_add_nondir(trans, dentry, inode, 0);
  1540. if (err)
  1541. drop_inode = 1;
  1542. else {
  1543. inode->i_mapping->a_ops = &btrfs_aops;
  1544. inode->i_fop = &btrfs_file_operations;
  1545. inode->i_op = &btrfs_file_inode_operations;
  1546. extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS);
  1547. extent_io_tree_init(&BTRFS_I(inode)->io_tree,
  1548. inode->i_mapping, GFP_NOFS);
  1549. BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
  1550. }
  1551. dir->i_sb->s_dirt = 1;
  1552. btrfs_update_inode_block_group(trans, inode);
  1553. btrfs_update_inode_block_group(trans, dir);
  1554. out_unlock:
  1555. nr = trans->blocks_used;
  1556. btrfs_end_transaction(trans, root);
  1557. fail:
  1558. mutex_unlock(&root->fs_info->fs_mutex);
  1559. if (drop_inode) {
  1560. inode_dec_link_count(inode);
  1561. iput(inode);
  1562. }
  1563. btrfs_btree_balance_dirty(root, nr);
  1564. btrfs_throttle(root);
  1565. return err;
  1566. }
  1567. static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
  1568. struct dentry *dentry)
  1569. {
  1570. struct btrfs_trans_handle *trans;
  1571. struct btrfs_root *root = BTRFS_I(dir)->root;
  1572. struct inode *inode = old_dentry->d_inode;
  1573. unsigned long nr = 0;
  1574. int err;
  1575. int drop_inode = 0;
  1576. if (inode->i_nlink == 0)
  1577. return -ENOENT;
  1578. #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
  1579. inode->i_nlink++;
  1580. #else
  1581. inc_nlink(inode);
  1582. #endif
  1583. mutex_lock(&root->fs_info->fs_mutex);
  1584. err = btrfs_check_free_space(root, 1, 0);
  1585. if (err)
  1586. goto fail;
  1587. trans = btrfs_start_transaction(root, 1);
  1588. btrfs_set_trans_block_group(trans, dir);
  1589. atomic_inc(&inode->i_count);
  1590. err = btrfs_add_nondir(trans, dentry, inode, 1);
  1591. if (err)
  1592. drop_inode = 1;
  1593. dir->i_sb->s_dirt = 1;
  1594. btrfs_update_inode_block_group(trans, dir);
  1595. err = btrfs_update_inode(trans, root, inode);
  1596. if (err)
  1597. drop_inode = 1;
  1598. nr = trans->blocks_used;
  1599. btrfs_end_transaction(trans, root);
  1600. fail:
  1601. mutex_unlock(&root->fs_info->fs_mutex);
  1602. if (drop_inode) {
  1603. inode_dec_link_count(inode);
  1604. iput(inode);
  1605. }
  1606. btrfs_btree_balance_dirty(root, nr);
  1607. btrfs_throttle(root);
  1608. return err;
  1609. }
  1610. static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  1611. {
  1612. struct inode *inode;
  1613. struct btrfs_trans_handle *trans;
  1614. struct btrfs_root *root = BTRFS_I(dir)->root;
  1615. int err = 0;
  1616. int drop_on_err = 0;
  1617. u64 objectid;
  1618. unsigned long nr = 1;
  1619. mutex_lock(&root->fs_info->fs_mutex);
  1620. err = btrfs_check_free_space(root, 1, 0);
  1621. if (err)
  1622. goto out_unlock;
  1623. trans = btrfs_start_transaction(root, 1);
  1624. btrfs_set_trans_block_group(trans, dir);
  1625. if (IS_ERR(trans)) {
  1626. err = PTR_ERR(trans);
  1627. goto out_unlock;
  1628. }
  1629. err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid);
  1630. if (err) {
  1631. err = -ENOSPC;
  1632. goto out_unlock;
  1633. }
  1634. inode = btrfs_new_inode(trans, root, dentry->d_name.name,
  1635. dentry->d_name.len,
  1636. dentry->d_parent->d_inode->i_ino, objectid,
  1637. BTRFS_I(dir)->block_group, S_IFDIR | mode);
  1638. if (IS_ERR(inode)) {
  1639. err = PTR_ERR(inode);
  1640. goto out_fail;
  1641. }
  1642. drop_on_err = 1;
  1643. inode->i_op = &btrfs_dir_inode_operations;
  1644. inode->i_fop = &btrfs_dir_file_operations;
  1645. btrfs_set_trans_block_group(trans, inode);
  1646. inode->i_size = 0;
  1647. err = btrfs_update_inode(trans, root, inode);
  1648. if (err)
  1649. goto out_fail;
  1650. err = btrfs_add_link(trans, dentry, inode, 0);
  1651. if (err)
  1652. goto out_fail;
  1653. d_instantiate(dentry, inode);
  1654. drop_on_err = 0;
  1655. dir->i_sb->s_dirt = 1;
  1656. btrfs_update_inode_block_group(trans, inode);
  1657. btrfs_update_inode_block_group(trans, dir);
  1658. out_fail:
  1659. nr = trans->blocks_used;
  1660. btrfs_end_transaction(trans, root);
  1661. out_unlock:
  1662. mutex_unlock(&root->fs_info->fs_mutex);
  1663. if (drop_on_err)
  1664. iput(inode);
  1665. btrfs_btree_balance_dirty(root, nr);
  1666. btrfs_throttle(root);
  1667. return err;
  1668. }
  1669. struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page,
  1670. size_t pg_offset, u64 start, u64 len,
  1671. int create)
  1672. {
  1673. int ret;
  1674. int err = 0;
  1675. u64 bytenr;
  1676. u64 extent_start = 0;
  1677. u64 extent_end = 0;
  1678. u64 objectid = inode->i_ino;
  1679. u32 found_type;
  1680. struct btrfs_path *path;
  1681. struct btrfs_root *root = BTRFS_I(inode)->root;
  1682. struct btrfs_file_extent_item *item;
  1683. struct extent_buffer *leaf;
  1684. struct btrfs_key found_key;
  1685. struct extent_map *em = NULL;
  1686. struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
  1687. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  1688. struct btrfs_trans_handle *trans = NULL;
  1689. path = btrfs_alloc_path();
  1690. BUG_ON(!path);
  1691. mutex_lock(&root->fs_info->fs_mutex);
  1692. again:
  1693. spin_lock(&em_tree->lock);
  1694. em = lookup_extent_mapping(em_tree, start, len);
  1695. spin_unlock(&em_tree->lock);
  1696. if (em) {
  1697. if (em->start > start) {
  1698. printk("get_extent lookup [%Lu %Lu] em [%Lu %Lu]\n",
  1699. start, len, em->start, em->len);
  1700. WARN_ON(1);
  1701. }
  1702. if (em->block_start == EXTENT_MAP_INLINE && page)
  1703. free_extent_map(em);
  1704. else
  1705. goto out;
  1706. }
  1707. em = alloc_extent_map(GFP_NOFS);
  1708. if (!em) {
  1709. err = -ENOMEM;
  1710. goto out;
  1711. }
  1712. em->start = EXTENT_MAP_HOLE;
  1713. em->len = (u64)-1;
  1714. em->bdev = inode->i_sb->s_bdev;
  1715. ret = btrfs_lookup_file_extent(trans, root, path,
  1716. objectid, start, trans != NULL);
  1717. if (ret < 0) {
  1718. err = ret;
  1719. goto out;
  1720. }
  1721. if (ret != 0) {
  1722. if (path->slots[0] == 0)
  1723. goto not_found;
  1724. path->slots[0]--;
  1725. }
  1726. leaf = path->nodes[0];
  1727. item = btrfs_item_ptr(leaf, path->slots[0],
  1728. struct btrfs_file_extent_item);
  1729. /* are we inside the extent that was found? */
  1730. btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
  1731. found_type = btrfs_key_type(&found_key);
  1732. if (found_key.objectid != objectid ||
  1733. found_type != BTRFS_EXTENT_DATA_KEY) {
  1734. goto not_found;
  1735. }
  1736. found_type = btrfs_file_extent_type(leaf, item);
  1737. extent_start = found_key.offset;
  1738. if (found_type == BTRFS_FILE_EXTENT_REG) {
  1739. extent_end = extent_start +
  1740. btrfs_file_extent_num_bytes(leaf, item);
  1741. err = 0;
  1742. if (start < extent_start || start >= extent_end) {
  1743. em->start = start;
  1744. if (start < extent_start) {
  1745. if (start + len <= extent_start)
  1746. goto not_found;
  1747. em->len = extent_end - extent_start;
  1748. } else {
  1749. em->len = len;
  1750. }
  1751. goto not_found_em;
  1752. }
  1753. bytenr = btrfs_file_extent_disk_bytenr(leaf, item);
  1754. if (bytenr == 0) {
  1755. em->start = extent_start;
  1756. em->len = extent_end - extent_start;
  1757. em->block_start = EXTENT_MAP_HOLE;
  1758. goto insert;
  1759. }
  1760. bytenr += btrfs_file_extent_offset(leaf, item);
  1761. em->block_start = bytenr;
  1762. em->start = extent_start;
  1763. em->len = extent_end - extent_start;
  1764. goto insert;
  1765. } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
  1766. u64 page_start;
  1767. unsigned long ptr;
  1768. char *map;
  1769. size_t size;
  1770. size_t extent_offset;
  1771. size_t copy_size;
  1772. size = btrfs_file_extent_inline_len(leaf, btrfs_item_nr(leaf,
  1773. path->slots[0]));
  1774. extent_end = (extent_start + size + root->sectorsize - 1) &
  1775. ~((u64)root->sectorsize - 1);
  1776. if (start < extent_start || start >= extent_end) {
  1777. em->start = start;
  1778. if (start < extent_start) {
  1779. if (start + len <= extent_start)
  1780. goto not_found;
  1781. em->len = extent_end - extent_start;
  1782. } else {
  1783. em->len = len;
  1784. }
  1785. goto not_found_em;
  1786. }
  1787. em->block_start = EXTENT_MAP_INLINE;
  1788. if (!page) {
  1789. em->start = extent_start;
  1790. em->len = size;
  1791. goto out;
  1792. }
  1793. page_start = page_offset(page) + pg_offset;
  1794. extent_offset = page_start - extent_start;
  1795. copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset,
  1796. size - extent_offset);
  1797. em->start = extent_start + extent_offset;
  1798. em->len = (copy_size + root->sectorsize - 1) &
  1799. ~((u64)root->sectorsize - 1);
  1800. map = kmap(page);
  1801. ptr = btrfs_file_extent_inline_start(item) + extent_offset;
  1802. if (create == 0 && !PageUptodate(page)) {
  1803. read_extent_buffer(leaf, map + pg_offset, ptr,
  1804. copy_size);
  1805. flush_dcache_page(page);
  1806. } else if (create && PageUptodate(page)) {
  1807. if (!trans) {
  1808. kunmap(page);
  1809. free_extent_map(em);
  1810. em = NULL;
  1811. btrfs_release_path(root, path);
  1812. trans = btrfs_start_transaction(root, 1);
  1813. goto again;
  1814. }
  1815. write_extent_buffer(leaf, map + pg_offset, ptr,
  1816. copy_size);
  1817. btrfs_mark_buffer_dirty(leaf);
  1818. }
  1819. kunmap(page);
  1820. set_extent_uptodate(io_tree, em->start,
  1821. extent_map_end(em) - 1, GFP_NOFS);
  1822. goto insert;
  1823. } else {
  1824. printk("unkknown found_type %d\n", found_type);
  1825. WARN_ON(1);
  1826. }
  1827. not_found:
  1828. em->start = start;
  1829. em->len = len;
  1830. not_found_em:
  1831. em->block_start = EXTENT_MAP_HOLE;
  1832. insert:
  1833. btrfs_release_path(root, path);
  1834. if (em->start > start || extent_map_end(em) <= start) {
  1835. printk("bad extent! em: [%Lu %Lu] passed [%Lu %Lu]\n", em->start, em->len, start, len);
  1836. err = -EIO;
  1837. goto out;
  1838. }
  1839. err = 0;
  1840. spin_lock(&em_tree->lock);
  1841. ret = add_extent_mapping(em_tree, em);
  1842. if (ret == -EEXIST) {
  1843. free_extent_map(em);
  1844. em = lookup_extent_mapping(em_tree, start, len);
  1845. if (!em) {
  1846. err = -EIO;
  1847. printk("failing to insert %Lu %Lu\n", start, len);
  1848. }
  1849. }
  1850. spin_unlock(&em_tree->lock);
  1851. out:
  1852. btrfs_free_path(path);
  1853. if (trans) {
  1854. ret = btrfs_end_transaction(trans, root);
  1855. if (!err)
  1856. err = ret;
  1857. }
  1858. mutex_unlock(&root->fs_info->fs_mutex);
  1859. if (err) {
  1860. free_extent_map(em);
  1861. WARN_ON(1);
  1862. return ERR_PTR(err);
  1863. }
  1864. return em;
  1865. }
  1866. static sector_t btrfs_bmap(struct address_space *mapping, sector_t iblock)
  1867. {
  1868. return extent_bmap(mapping, iblock, btrfs_get_extent);
  1869. }
  1870. int btrfs_readpage(struct file *file, struct page *page)
  1871. {
  1872. struct extent_io_tree *tree;
  1873. tree = &BTRFS_I(page->mapping->host)->io_tree;
  1874. return extent_read_full_page(tree, page, btrfs_get_extent);
  1875. }
  1876. static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
  1877. {
  1878. struct extent_io_tree *tree;
  1879. if (current->flags & PF_MEMALLOC) {
  1880. redirty_page_for_writepage(wbc, page);
  1881. unlock_page(page);
  1882. return 0;
  1883. }
  1884. tree = &BTRFS_I(page->mapping->host)->io_tree;
  1885. return extent_write_full_page(tree, page, btrfs_get_extent, wbc);
  1886. }
  1887. static int btrfs_writepages(struct address_space *mapping,
  1888. struct writeback_control *wbc)
  1889. {
  1890. struct extent_io_tree *tree;
  1891. tree = &BTRFS_I(mapping->host)->io_tree;
  1892. return extent_writepages(tree, mapping, btrfs_get_extent, wbc);
  1893. }
  1894. static int
  1895. btrfs_readpages(struct file *file, struct address_space *mapping,
  1896. struct list_head *pages, unsigned nr_pages)
  1897. {
  1898. struct extent_io_tree *tree;
  1899. tree = &BTRFS_I(mapping->host)->io_tree;
  1900. return extent_readpages(tree, mapping, pages, nr_pages,
  1901. btrfs_get_extent);
  1902. }
  1903. static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
  1904. {
  1905. struct extent_io_tree *tree;
  1906. struct extent_map_tree *map;
  1907. int ret;
  1908. tree = &BTRFS_I(page->mapping->host)->io_tree;
  1909. map = &BTRFS_I(page->mapping->host)->extent_tree;
  1910. ret = try_release_extent_mapping(map, tree, page, gfp_flags);
  1911. if (ret == 1) {
  1912. ClearPagePrivate(page);
  1913. set_page_private(page, 0);
  1914. page_cache_release(page);
  1915. }
  1916. return ret;
  1917. }
  1918. static void btrfs_invalidatepage(struct page *page, unsigned long offset)
  1919. {
  1920. struct extent_io_tree *tree;
  1921. tree = &BTRFS_I(page->mapping->host)->io_tree;
  1922. extent_invalidatepage(tree, page, offset);
  1923. btrfs_releasepage(page, GFP_NOFS);
  1924. }
  1925. /*
  1926. * btrfs_page_mkwrite() is not allowed to change the file size as it gets
  1927. * called from a page fault handler when a page is first dirtied. Hence we must
  1928. * be careful to check for EOF conditions here. We set the page up correctly
  1929. * for a written page which means we get ENOSPC checking when writing into
  1930. * holes and correct delalloc and unwritten extent mapping on filesystems that
  1931. * support these features.
  1932. *
  1933. * We are not allowed to take the i_mutex here so we have to play games to
  1934. * protect against truncate races as the page could now be beyond EOF. Because
  1935. * vmtruncate() writes the inode size before removing pages, once we have the
  1936. * page lock we can determine safely if the page is beyond EOF. If it is not
  1937. * beyond EOF, then the page is guaranteed safe against truncation until we
  1938. * unlock the page.
  1939. */
  1940. int btrfs_page_mkwrite(struct vm_area_struct *vma, struct page *page)
  1941. {
  1942. struct inode *inode = fdentry(vma->vm_file)->d_inode;
  1943. struct btrfs_root *root = BTRFS_I(inode)->root;
  1944. unsigned long end;
  1945. loff_t size;
  1946. int ret;
  1947. u64 page_start;
  1948. mutex_lock(&root->fs_info->fs_mutex);
  1949. ret = btrfs_check_free_space(root, PAGE_CACHE_SIZE, 0);
  1950. mutex_unlock(&root->fs_info->fs_mutex);
  1951. if (ret)
  1952. goto out;
  1953. ret = -EINVAL;
  1954. lock_page(page);
  1955. wait_on_page_writeback(page);
  1956. size = i_size_read(inode);
  1957. page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  1958. if ((page->mapping != inode->i_mapping) ||
  1959. (page_start > size)) {
  1960. /* page got truncated out from underneath us */
  1961. goto out_unlock;
  1962. }
  1963. /* page is wholly or partially inside EOF */
  1964. if (page_start + PAGE_CACHE_SIZE > size)
  1965. end = size & ~PAGE_CACHE_MASK;
  1966. else
  1967. end = PAGE_CACHE_SIZE;
  1968. ret = btrfs_cow_one_page(inode, page, end);
  1969. out_unlock:
  1970. unlock_page(page);
  1971. out:
  1972. return ret;
  1973. }
  1974. static void btrfs_truncate(struct inode *inode)
  1975. {
  1976. struct btrfs_root *root = BTRFS_I(inode)->root;
  1977. int ret;
  1978. struct btrfs_trans_handle *trans;
  1979. unsigned long nr;
  1980. if (!S_ISREG(inode->i_mode))
  1981. return;
  1982. if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
  1983. return;
  1984. btrfs_truncate_page(inode->i_mapping, inode->i_size);
  1985. mutex_lock(&root->fs_info->fs_mutex);
  1986. trans = btrfs_start_transaction(root, 1);
  1987. btrfs_set_trans_block_group(trans, inode);
  1988. /* FIXME, add redo link to tree so we don't leak on crash */
  1989. ret = btrfs_truncate_in_trans(trans, root, inode,
  1990. BTRFS_EXTENT_DATA_KEY);
  1991. btrfs_update_inode(trans, root, inode);
  1992. nr = trans->blocks_used;
  1993. ret = btrfs_end_transaction(trans, root);
  1994. BUG_ON(ret);
  1995. mutex_unlock(&root->fs_info->fs_mutex);
  1996. btrfs_btree_balance_dirty(root, nr);
  1997. btrfs_throttle(root);
  1998. }
  1999. static int noinline create_subvol(struct btrfs_root *root, char *name,
  2000. int namelen)
  2001. {
  2002. struct btrfs_trans_handle *trans;
  2003. struct btrfs_key key;
  2004. struct btrfs_root_item root_item;
  2005. struct btrfs_inode_item *inode_item;
  2006. struct extent_buffer *leaf;
  2007. struct btrfs_root *new_root = root;
  2008. struct inode *inode;
  2009. struct inode *dir;
  2010. int ret;
  2011. int err;
  2012. u64 objectid;
  2013. u64 new_dirid = BTRFS_FIRST_FREE_OBJECTID;
  2014. unsigned long nr = 1;
  2015. mutex_lock(&root->fs_info->fs_mutex);
  2016. ret = btrfs_check_free_space(root, 1, 0);
  2017. if (ret)
  2018. goto fail_commit;
  2019. trans = btrfs_start_transaction(root, 1);
  2020. BUG_ON(!trans);
  2021. ret = btrfs_find_free_objectid(trans, root->fs_info->tree_root,
  2022. 0, &objectid);
  2023. if (ret)
  2024. goto fail;
  2025. leaf = __btrfs_alloc_free_block(trans, root, root->leafsize,
  2026. objectid, trans->transid, 0, 0,
  2027. 0, 0);
  2028. if (IS_ERR(leaf))
  2029. return PTR_ERR(leaf);
  2030. btrfs_set_header_nritems(leaf, 0);
  2031. btrfs_set_header_level(leaf, 0);
  2032. btrfs_set_header_bytenr(leaf, leaf->start);
  2033. btrfs_set_header_generation(leaf, trans->transid);
  2034. btrfs_set_header_owner(leaf, objectid);
  2035. write_extent_buffer(leaf, root->fs_info->fsid,
  2036. (unsigned long)btrfs_header_fsid(leaf),
  2037. BTRFS_FSID_SIZE);
  2038. btrfs_mark_buffer_dirty(leaf);
  2039. inode_item = &root_item.inode;
  2040. memset(inode_item, 0, sizeof(*inode_item));
  2041. inode_item->generation = cpu_to_le64(1);
  2042. inode_item->size = cpu_to_le64(3);
  2043. inode_item->nlink = cpu_to_le32(1);
  2044. inode_item->nblocks = cpu_to_le64(1);
  2045. inode_item->mode = cpu_to_le32(S_IFDIR | 0755);
  2046. btrfs_set_root_bytenr(&root_item, leaf->start);
  2047. btrfs_set_root_level(&root_item, 0);
  2048. btrfs_set_root_refs(&root_item, 1);
  2049. btrfs_set_root_used(&root_item, 0);
  2050. memset(&root_item.drop_progress, 0, sizeof(root_item.drop_progress));
  2051. root_item.drop_level = 0;
  2052. free_extent_buffer(leaf);
  2053. leaf = NULL;
  2054. btrfs_set_root_dirid(&root_item, new_dirid);
  2055. key.objectid = objectid;
  2056. key.offset = 1;
  2057. btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
  2058. ret = btrfs_insert_root(trans, root->fs_info->tree_root, &key,
  2059. &root_item);
  2060. if (ret)
  2061. goto fail;
  2062. /*
  2063. * insert the directory item
  2064. */
  2065. key.offset = (u64)-1;
  2066. dir = root->fs_info->sb->s_root->d_inode;
  2067. ret = btrfs_insert_dir_item(trans, root->fs_info->tree_root,
  2068. name, namelen, dir->i_ino, &key,
  2069. BTRFS_FT_DIR);
  2070. if (ret)
  2071. goto fail;
  2072. ret = btrfs_insert_inode_ref(trans, root->fs_info->tree_root,
  2073. name, namelen, objectid,
  2074. root->fs_info->sb->s_root->d_inode->i_ino);
  2075. if (ret)
  2076. goto fail;
  2077. ret = btrfs_commit_transaction(trans, root);
  2078. if (ret)
  2079. goto fail_commit;
  2080. new_root = btrfs_read_fs_root(root->fs_info, &key, name, namelen);
  2081. BUG_ON(!new_root);
  2082. trans = btrfs_start_transaction(new_root, 1);
  2083. BUG_ON(!trans);
  2084. inode = btrfs_new_inode(trans, new_root, "..", 2, new_dirid,
  2085. new_dirid,
  2086. BTRFS_I(dir)->block_group, S_IFDIR | 0700);
  2087. if (IS_ERR(inode))
  2088. goto fail;
  2089. inode->i_op = &btrfs_dir_inode_operations;
  2090. inode->i_fop = &btrfs_dir_file_operations;
  2091. new_root->inode = inode;
  2092. ret = btrfs_insert_inode_ref(trans, new_root, "..", 2, new_dirid,
  2093. new_dirid);
  2094. inode->i_nlink = 1;
  2095. inode->i_size = 0;
  2096. ret = btrfs_update_inode(trans, new_root, inode);
  2097. if (ret)
  2098. goto fail;
  2099. fail:
  2100. nr = trans->blocks_used;
  2101. err = btrfs_commit_transaction(trans, new_root);
  2102. if (err && !ret)
  2103. ret = err;
  2104. fail_commit:
  2105. mutex_unlock(&root->fs_info->fs_mutex);
  2106. btrfs_btree_balance_dirty(root, nr);
  2107. btrfs_throttle(root);
  2108. return ret;
  2109. }
  2110. static int create_snapshot(struct btrfs_root *root, char *name, int namelen)
  2111. {
  2112. struct btrfs_pending_snapshot *pending_snapshot;
  2113. struct btrfs_trans_handle *trans;
  2114. int ret;
  2115. int err;
  2116. unsigned long nr = 0;
  2117. if (!root->ref_cows)
  2118. return -EINVAL;
  2119. mutex_lock(&root->fs_info->fs_mutex);
  2120. ret = btrfs_check_free_space(root, 1, 0);
  2121. if (ret)
  2122. goto fail_unlock;
  2123. pending_snapshot = kmalloc(sizeof(*pending_snapshot), GFP_NOFS);
  2124. if (!pending_snapshot) {
  2125. ret = -ENOMEM;
  2126. goto fail_unlock;
  2127. }
  2128. pending_snapshot->name = kmalloc(namelen + 1, GFP_NOFS);
  2129. if (!pending_snapshot->name) {
  2130. ret = -ENOMEM;
  2131. kfree(pending_snapshot);
  2132. goto fail_unlock;
  2133. }
  2134. memcpy(pending_snapshot->name, name, namelen);
  2135. pending_snapshot->name[namelen] = '\0';
  2136. trans = btrfs_start_transaction(root, 1);
  2137. BUG_ON(!trans);
  2138. pending_snapshot->root = root;
  2139. list_add(&pending_snapshot->list,
  2140. &trans->transaction->pending_snapshots);
  2141. ret = btrfs_update_inode(trans, root, root->inode);
  2142. err = btrfs_commit_transaction(trans, root);
  2143. fail_unlock:
  2144. mutex_unlock(&root->fs_info->fs_mutex);
  2145. btrfs_btree_balance_dirty(root, nr);
  2146. btrfs_throttle(root);
  2147. return ret;
  2148. }
  2149. unsigned long btrfs_force_ra(struct address_space *mapping,
  2150. struct file_ra_state *ra, struct file *file,
  2151. pgoff_t offset, pgoff_t last_index)
  2152. {
  2153. pgoff_t req_size;
  2154. #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,23)
  2155. req_size = last_index - offset + 1;
  2156. offset = page_cache_readahead(mapping, ra, file, offset, req_size);
  2157. return offset;
  2158. #else
  2159. req_size = min(last_index - offset + 1, (pgoff_t)128);
  2160. page_cache_sync_readahead(mapping, ra, file, offset, req_size);
  2161. return offset + req_size;
  2162. #endif
  2163. }
  2164. int btrfs_defrag_file(struct file *file) {
  2165. struct inode *inode = fdentry(file)->d_inode;
  2166. struct btrfs_root *root = BTRFS_I(inode)->root;
  2167. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  2168. struct page *page;
  2169. unsigned long last_index;
  2170. unsigned long ra_index = 0;
  2171. u64 page_start;
  2172. u64 page_end;
  2173. unsigned long i;
  2174. int ret;
  2175. mutex_lock(&root->fs_info->fs_mutex);
  2176. ret = btrfs_check_free_space(root, inode->i_size, 0);
  2177. mutex_unlock(&root->fs_info->fs_mutex);
  2178. if (ret)
  2179. return -ENOSPC;
  2180. mutex_lock(&inode->i_mutex);
  2181. last_index = inode->i_size >> PAGE_CACHE_SHIFT;
  2182. for (i = 0; i <= last_index; i++) {
  2183. if (i == ra_index) {
  2184. ra_index = btrfs_force_ra(inode->i_mapping,
  2185. &file->f_ra,
  2186. file, ra_index, last_index);
  2187. }
  2188. page = grab_cache_page(inode->i_mapping, i);
  2189. if (!page)
  2190. goto out_unlock;
  2191. if (!PageUptodate(page)) {
  2192. btrfs_readpage(NULL, page);
  2193. lock_page(page);
  2194. if (!PageUptodate(page)) {
  2195. unlock_page(page);
  2196. page_cache_release(page);
  2197. goto out_unlock;
  2198. }
  2199. }
  2200. page_start = (u64)page->index << PAGE_CACHE_SHIFT;
  2201. page_end = page_start + PAGE_CACHE_SIZE - 1;
  2202. lock_extent(io_tree, page_start, page_end, GFP_NOFS);
  2203. set_extent_delalloc(io_tree, page_start,
  2204. page_end, GFP_NOFS);
  2205. unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
  2206. set_page_dirty(page);
  2207. unlock_page(page);
  2208. page_cache_release(page);
  2209. balance_dirty_pages_ratelimited_nr(inode->i_mapping, 1);
  2210. }
  2211. out_unlock:
  2212. mutex_unlock(&inode->i_mutex);
  2213. return 0;
  2214. }
  2215. static int btrfs_ioctl_resize(struct btrfs_root *root, void __user *arg)
  2216. {
  2217. u64 new_size;
  2218. u64 old_size;
  2219. struct btrfs_ioctl_vol_args *vol_args;
  2220. struct btrfs_trans_handle *trans;
  2221. char *sizestr;
  2222. int ret = 0;
  2223. int namelen;
  2224. int mod = 0;
  2225. vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
  2226. if (!vol_args)
  2227. return -ENOMEM;
  2228. if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
  2229. ret = -EFAULT;
  2230. goto out;
  2231. }
  2232. namelen = strlen(vol_args->name);
  2233. if (namelen > BTRFS_VOL_NAME_MAX) {
  2234. ret = -EINVAL;
  2235. goto out;
  2236. }
  2237. sizestr = vol_args->name;
  2238. if (!strcmp(sizestr, "max"))
  2239. new_size = root->fs_info->sb->s_bdev->bd_inode->i_size;
  2240. else {
  2241. if (sizestr[0] == '-') {
  2242. mod = -1;
  2243. sizestr++;
  2244. } else if (sizestr[0] == '+') {
  2245. mod = 1;
  2246. sizestr++;
  2247. }
  2248. new_size = btrfs_parse_size(sizestr);
  2249. if (new_size == 0) {
  2250. ret = -EINVAL;
  2251. goto out;
  2252. }
  2253. }
  2254. mutex_lock(&root->fs_info->fs_mutex);
  2255. old_size = btrfs_super_total_bytes(&root->fs_info->super_copy);
  2256. if (mod < 0) {
  2257. if (new_size > old_size) {
  2258. ret = -EINVAL;
  2259. goto out_unlock;
  2260. }
  2261. new_size = old_size - new_size;
  2262. } else if (mod > 0) {
  2263. new_size = old_size + new_size;
  2264. }
  2265. if (new_size < 256 * 1024 * 1024) {
  2266. ret = -EINVAL;
  2267. goto out_unlock;
  2268. }
  2269. if (new_size > root->fs_info->sb->s_bdev->bd_inode->i_size) {
  2270. ret = -EFBIG;
  2271. goto out_unlock;
  2272. }
  2273. do_div(new_size, root->sectorsize);
  2274. new_size *= root->sectorsize;
  2275. printk("new size is %Lu\n", new_size);
  2276. if (new_size > old_size) {
  2277. trans = btrfs_start_transaction(root, 1);
  2278. ret = btrfs_grow_extent_tree(trans, root, new_size);
  2279. btrfs_commit_transaction(trans, root);
  2280. } else {
  2281. ret = btrfs_shrink_extent_tree(root, new_size);
  2282. }
  2283. out_unlock:
  2284. mutex_unlock(&root->fs_info->fs_mutex);
  2285. out:
  2286. kfree(vol_args);
  2287. return ret;
  2288. }
  2289. static int noinline btrfs_ioctl_snap_create(struct btrfs_root *root,
  2290. void __user *arg)
  2291. {
  2292. struct btrfs_ioctl_vol_args *vol_args;
  2293. struct btrfs_dir_item *di;
  2294. struct btrfs_path *path;
  2295. u64 root_dirid;
  2296. int namelen;
  2297. int ret;
  2298. vol_args = kmalloc(sizeof(*vol_args), GFP_NOFS);
  2299. if (!vol_args)
  2300. return -ENOMEM;
  2301. if (copy_from_user(vol_args, arg, sizeof(*vol_args))) {
  2302. ret = -EFAULT;
  2303. goto out;
  2304. }
  2305. namelen = strlen(vol_args->name);
  2306. if (namelen > BTRFS_VOL_NAME_MAX) {
  2307. ret = -EINVAL;
  2308. goto out;
  2309. }
  2310. if (strchr(vol_args->name, '/')) {
  2311. ret = -EINVAL;
  2312. goto out;
  2313. }
  2314. path = btrfs_alloc_path();
  2315. if (!path) {
  2316. ret = -ENOMEM;
  2317. goto out;
  2318. }
  2319. root_dirid = root->fs_info->sb->s_root->d_inode->i_ino,
  2320. mutex_lock(&root->fs_info->fs_mutex);
  2321. di = btrfs_lookup_dir_item(NULL, root->fs_info->tree_root,
  2322. path, root_dirid,
  2323. vol_args->name, namelen, 0);
  2324. mutex_unlock(&root->fs_info->fs_mutex);
  2325. btrfs_free_path(path);
  2326. if (di && !IS_ERR(di)) {
  2327. ret = -EEXIST;
  2328. goto out;
  2329. }
  2330. if (IS_ERR(di)) {
  2331. ret = PTR_ERR(di);
  2332. goto out;
  2333. }
  2334. if (root == root->fs_info->tree_root)
  2335. ret = create_subvol(root, vol_args->name, namelen);
  2336. else
  2337. ret = create_snapshot(root, vol_args->name, namelen);
  2338. out:
  2339. kfree(vol_args);
  2340. return ret;
  2341. }
  2342. static int btrfs_ioctl_defrag(struct file *file)
  2343. {
  2344. struct inode *inode = fdentry(file)->d_inode;
  2345. struct btrfs_root *root = BTRFS_I(inode)->root;
  2346. switch (inode->i_mode & S_IFMT) {
  2347. case S_IFDIR:
  2348. mutex_lock(&root->fs_info->fs_mutex);
  2349. btrfs_defrag_root(root, 0);
  2350. btrfs_defrag_root(root->fs_info->extent_root, 0);
  2351. mutex_unlock(&root->fs_info->fs_mutex);
  2352. break;
  2353. case S_IFREG:
  2354. btrfs_defrag_file(file);
  2355. break;
  2356. }
  2357. return 0;
  2358. }
  2359. long btrfs_ioctl(struct file *file, unsigned int
  2360. cmd, unsigned long arg)
  2361. {
  2362. struct btrfs_root *root = BTRFS_I(fdentry(file)->d_inode)->root;
  2363. switch (cmd) {
  2364. case BTRFS_IOC_SNAP_CREATE:
  2365. return btrfs_ioctl_snap_create(root, (void __user *)arg);
  2366. case BTRFS_IOC_DEFRAG:
  2367. return btrfs_ioctl_defrag(file);
  2368. case BTRFS_IOC_RESIZE:
  2369. return btrfs_ioctl_resize(root, (void __user *)arg);
  2370. }
  2371. return -ENOTTY;
  2372. }
  2373. /*
  2374. * Called inside transaction, so use GFP_NOFS
  2375. */
  2376. struct inode *btrfs_alloc_inode(struct super_block *sb)
  2377. {
  2378. struct btrfs_inode *ei;
  2379. ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS);
  2380. if (!ei)
  2381. return NULL;
  2382. ei->last_trans = 0;
  2383. ei->ordered_trans = 0;
  2384. return &ei->vfs_inode;
  2385. }
  2386. void btrfs_destroy_inode(struct inode *inode)
  2387. {
  2388. WARN_ON(!list_empty(&inode->i_dentry));
  2389. WARN_ON(inode->i_data.nrpages);
  2390. btrfs_drop_extent_cache(inode, 0, (u64)-1);
  2391. kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
  2392. }
  2393. #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
  2394. static void init_once(struct kmem_cache * cachep, void *foo)
  2395. #else
  2396. static void init_once(void * foo, struct kmem_cache * cachep,
  2397. unsigned long flags)
  2398. #endif
  2399. {
  2400. struct btrfs_inode *ei = (struct btrfs_inode *) foo;
  2401. inode_init_once(&ei->vfs_inode);
  2402. }
  2403. void btrfs_destroy_cachep(void)
  2404. {
  2405. if (btrfs_inode_cachep)
  2406. kmem_cache_destroy(btrfs_inode_cachep);
  2407. if (btrfs_trans_handle_cachep)
  2408. kmem_cache_destroy(btrfs_trans_handle_cachep);
  2409. if (btrfs_transaction_cachep)
  2410. kmem_cache_destroy(btrfs_transaction_cachep);
  2411. if (btrfs_bit_radix_cachep)
  2412. kmem_cache_destroy(btrfs_bit_radix_cachep);
  2413. if (btrfs_path_cachep)
  2414. kmem_cache_destroy(btrfs_path_cachep);
  2415. }
  2416. struct kmem_cache *btrfs_cache_create(const char *name, size_t size,
  2417. unsigned long extra_flags,
  2418. #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
  2419. void (*ctor)(struct kmem_cache *, void *)
  2420. #else
  2421. void (*ctor)(void *, struct kmem_cache *,
  2422. unsigned long)
  2423. #endif
  2424. )
  2425. {
  2426. return kmem_cache_create(name, size, 0, (SLAB_RECLAIM_ACCOUNT |
  2427. SLAB_MEM_SPREAD | extra_flags), ctor
  2428. #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,23)
  2429. ,NULL
  2430. #endif
  2431. );
  2432. }
  2433. int btrfs_init_cachep(void)
  2434. {
  2435. btrfs_inode_cachep = btrfs_cache_create("btrfs_inode_cache",
  2436. sizeof(struct btrfs_inode),
  2437. 0, init_once);
  2438. if (!btrfs_inode_cachep)
  2439. goto fail;
  2440. btrfs_trans_handle_cachep =
  2441. btrfs_cache_create("btrfs_trans_handle_cache",
  2442. sizeof(struct btrfs_trans_handle),
  2443. 0, NULL);
  2444. if (!btrfs_trans_handle_cachep)
  2445. goto fail;
  2446. btrfs_transaction_cachep = btrfs_cache_create("btrfs_transaction_cache",
  2447. sizeof(struct btrfs_transaction),
  2448. 0, NULL);
  2449. if (!btrfs_transaction_cachep)
  2450. goto fail;
  2451. btrfs_path_cachep = btrfs_cache_create("btrfs_path_cache",
  2452. sizeof(struct btrfs_path),
  2453. 0, NULL);
  2454. if (!btrfs_path_cachep)
  2455. goto fail;
  2456. btrfs_bit_radix_cachep = btrfs_cache_create("btrfs_radix", 256,
  2457. SLAB_DESTROY_BY_RCU, NULL);
  2458. if (!btrfs_bit_radix_cachep)
  2459. goto fail;
  2460. return 0;
  2461. fail:
  2462. btrfs_destroy_cachep();
  2463. return -ENOMEM;
  2464. }
  2465. static int btrfs_getattr(struct vfsmount *mnt,
  2466. struct dentry *dentry, struct kstat *stat)
  2467. {
  2468. struct inode *inode = dentry->d_inode;
  2469. generic_fillattr(inode, stat);
  2470. stat->blksize = PAGE_CACHE_SIZE;
  2471. return 0;
  2472. }
  2473. static int btrfs_rename(struct inode * old_dir, struct dentry *old_dentry,
  2474. struct inode * new_dir,struct dentry *new_dentry)
  2475. {
  2476. struct btrfs_trans_handle *trans;
  2477. struct btrfs_root *root = BTRFS_I(old_dir)->root;
  2478. struct inode *new_inode = new_dentry->d_inode;
  2479. struct inode *old_inode = old_dentry->d_inode;
  2480. struct timespec ctime = CURRENT_TIME;
  2481. struct btrfs_path *path;
  2482. int ret;
  2483. if (S_ISDIR(old_inode->i_mode) && new_inode &&
  2484. new_inode->i_size > BTRFS_EMPTY_DIR_SIZE) {
  2485. return -ENOTEMPTY;
  2486. }
  2487. mutex_lock(&root->fs_info->fs_mutex);
  2488. ret = btrfs_check_free_space(root, 1, 0);
  2489. if (ret)
  2490. goto out_unlock;
  2491. trans = btrfs_start_transaction(root, 1);
  2492. btrfs_set_trans_block_group(trans, new_dir);
  2493. path = btrfs_alloc_path();
  2494. if (!path) {
  2495. ret = -ENOMEM;
  2496. goto out_fail;
  2497. }
  2498. old_dentry->d_inode->i_nlink++;
  2499. old_dir->i_ctime = old_dir->i_mtime = ctime;
  2500. new_dir->i_ctime = new_dir->i_mtime = ctime;
  2501. old_inode->i_ctime = ctime;
  2502. ret = btrfs_unlink_trans(trans, root, old_dir, old_dentry);
  2503. if (ret)
  2504. goto out_fail;
  2505. if (new_inode) {
  2506. new_inode->i_ctime = CURRENT_TIME;
  2507. ret = btrfs_unlink_trans(trans, root, new_dir, new_dentry);
  2508. if (ret)
  2509. goto out_fail;
  2510. }
  2511. ret = btrfs_add_link(trans, new_dentry, old_inode, 1);
  2512. if (ret)
  2513. goto out_fail;
  2514. out_fail:
  2515. btrfs_free_path(path);
  2516. btrfs_end_transaction(trans, root);
  2517. out_unlock:
  2518. mutex_unlock(&root->fs_info->fs_mutex);
  2519. return ret;
  2520. }
  2521. static int btrfs_symlink(struct inode *dir, struct dentry *dentry,
  2522. const char *symname)
  2523. {
  2524. struct btrfs_trans_handle *trans;
  2525. struct btrfs_root *root = BTRFS_I(dir)->root;
  2526. struct btrfs_path *path;
  2527. struct btrfs_key key;
  2528. struct inode *inode = NULL;
  2529. int err;
  2530. int drop_inode = 0;
  2531. u64 objectid;
  2532. int name_len;
  2533. int datasize;
  2534. unsigned long ptr;
  2535. struct btrfs_file_extent_item *ei;
  2536. struct extent_buffer *leaf;
  2537. unsigned long nr = 0;
  2538. name_len = strlen(symname) + 1;
  2539. if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root))
  2540. return -ENAMETOOLONG;
  2541. mutex_lock(&root->fs_info->fs_mutex);
  2542. err = btrfs_check_free_space(root, 1, 0);
  2543. if (err)
  2544. goto out_fail;
  2545. trans = btrfs_start_transaction(root, 1);
  2546. btrfs_set_trans_block_group(trans, dir);
  2547. err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid);
  2548. if (err) {
  2549. err = -ENOSPC;
  2550. goto out_unlock;
  2551. }
  2552. inode = btrfs_new_inode(trans, root, dentry->d_name.name,
  2553. dentry->d_name.len,
  2554. dentry->d_parent->d_inode->i_ino, objectid,
  2555. BTRFS_I(dir)->block_group, S_IFLNK|S_IRWXUGO);
  2556. err = PTR_ERR(inode);
  2557. if (IS_ERR(inode))
  2558. goto out_unlock;
  2559. btrfs_set_trans_block_group(trans, inode);
  2560. err = btrfs_add_nondir(trans, dentry, inode, 0);
  2561. if (err)
  2562. drop_inode = 1;
  2563. else {
  2564. inode->i_mapping->a_ops = &btrfs_aops;
  2565. inode->i_fop = &btrfs_file_operations;
  2566. inode->i_op = &btrfs_file_inode_operations;
  2567. extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS);
  2568. extent_io_tree_init(&BTRFS_I(inode)->io_tree,
  2569. inode->i_mapping, GFP_NOFS);
  2570. BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
  2571. }
  2572. dir->i_sb->s_dirt = 1;
  2573. btrfs_update_inode_block_group(trans, inode);
  2574. btrfs_update_inode_block_group(trans, dir);
  2575. if (drop_inode)
  2576. goto out_unlock;
  2577. path = btrfs_alloc_path();
  2578. BUG_ON(!path);
  2579. key.objectid = inode->i_ino;
  2580. key.offset = 0;
  2581. btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
  2582. datasize = btrfs_file_extent_calc_inline_size(name_len);
  2583. err = btrfs_insert_empty_item(trans, root, path, &key,
  2584. datasize);
  2585. if (err) {
  2586. drop_inode = 1;
  2587. goto out_unlock;
  2588. }
  2589. leaf = path->nodes[0];
  2590. ei = btrfs_item_ptr(leaf, path->slots[0],
  2591. struct btrfs_file_extent_item);
  2592. btrfs_set_file_extent_generation(leaf, ei, trans->transid);
  2593. btrfs_set_file_extent_type(leaf, ei,
  2594. BTRFS_FILE_EXTENT_INLINE);
  2595. ptr = btrfs_file_extent_inline_start(ei);
  2596. write_extent_buffer(leaf, symname, ptr, name_len);
  2597. btrfs_mark_buffer_dirty(leaf);
  2598. btrfs_free_path(path);
  2599. inode->i_op = &btrfs_symlink_inode_operations;
  2600. inode->i_mapping->a_ops = &btrfs_symlink_aops;
  2601. inode->i_size = name_len - 1;
  2602. err = btrfs_update_inode(trans, root, inode);
  2603. if (err)
  2604. drop_inode = 1;
  2605. out_unlock:
  2606. nr = trans->blocks_used;
  2607. btrfs_end_transaction(trans, root);
  2608. out_fail:
  2609. mutex_unlock(&root->fs_info->fs_mutex);
  2610. if (drop_inode) {
  2611. inode_dec_link_count(inode);
  2612. iput(inode);
  2613. }
  2614. btrfs_btree_balance_dirty(root, nr);
  2615. btrfs_throttle(root);
  2616. return err;
  2617. }
  2618. static int btrfs_permission(struct inode *inode, int mask,
  2619. struct nameidata *nd)
  2620. {
  2621. if (btrfs_test_flag(inode, READONLY) && (mask & MAY_WRITE))
  2622. return -EACCES;
  2623. return generic_permission(inode, mask, NULL);
  2624. }
  2625. static struct inode_operations btrfs_dir_inode_operations = {
  2626. .lookup = btrfs_lookup,
  2627. .create = btrfs_create,
  2628. .unlink = btrfs_unlink,
  2629. .link = btrfs_link,
  2630. .mkdir = btrfs_mkdir,
  2631. .rmdir = btrfs_rmdir,
  2632. .rename = btrfs_rename,
  2633. .symlink = btrfs_symlink,
  2634. .setattr = btrfs_setattr,
  2635. .mknod = btrfs_mknod,
  2636. .setxattr = generic_setxattr,
  2637. .getxattr = generic_getxattr,
  2638. .listxattr = btrfs_listxattr,
  2639. .removexattr = generic_removexattr,
  2640. .permission = btrfs_permission,
  2641. };
  2642. static struct inode_operations btrfs_dir_ro_inode_operations = {
  2643. .lookup = btrfs_lookup,
  2644. .permission = btrfs_permission,
  2645. };
  2646. static struct file_operations btrfs_dir_file_operations = {
  2647. .llseek = generic_file_llseek,
  2648. .read = generic_read_dir,
  2649. .readdir = btrfs_readdir,
  2650. .unlocked_ioctl = btrfs_ioctl,
  2651. #ifdef CONFIG_COMPAT
  2652. .compat_ioctl = btrfs_ioctl,
  2653. #endif
  2654. };
  2655. static struct extent_io_ops btrfs_extent_io_ops = {
  2656. .fill_delalloc = run_delalloc_range,
  2657. .writepage_io_hook = btrfs_writepage_io_hook,
  2658. .readpage_io_hook = btrfs_readpage_io_hook,
  2659. .readpage_end_io_hook = btrfs_readpage_end_io_hook,
  2660. };
  2661. static struct address_space_operations btrfs_aops = {
  2662. .readpage = btrfs_readpage,
  2663. .writepage = btrfs_writepage,
  2664. .writepages = btrfs_writepages,
  2665. .readpages = btrfs_readpages,
  2666. .sync_page = block_sync_page,
  2667. .bmap = btrfs_bmap,
  2668. .invalidatepage = btrfs_invalidatepage,
  2669. .releasepage = btrfs_releasepage,
  2670. .set_page_dirty = __set_page_dirty_nobuffers,
  2671. };
  2672. static struct address_space_operations btrfs_symlink_aops = {
  2673. .readpage = btrfs_readpage,
  2674. .writepage = btrfs_writepage,
  2675. .invalidatepage = btrfs_invalidatepage,
  2676. .releasepage = btrfs_releasepage,
  2677. };
  2678. static struct inode_operations btrfs_file_inode_operations = {
  2679. .truncate = btrfs_truncate,
  2680. .getattr = btrfs_getattr,
  2681. .setattr = btrfs_setattr,
  2682. .setxattr = generic_setxattr,
  2683. .getxattr = generic_getxattr,
  2684. .listxattr = btrfs_listxattr,
  2685. .removexattr = generic_removexattr,
  2686. .permission = btrfs_permission,
  2687. };
  2688. static struct inode_operations btrfs_special_inode_operations = {
  2689. .getattr = btrfs_getattr,
  2690. .setattr = btrfs_setattr,
  2691. .permission = btrfs_permission,
  2692. };
  2693. static struct inode_operations btrfs_symlink_inode_operations = {
  2694. .readlink = generic_readlink,
  2695. .follow_link = page_follow_link_light,
  2696. .put_link = page_put_link,
  2697. .permission = btrfs_permission,
  2698. };