inode.c 66 KB

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