inode.c 64 KB

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