inode.c 65 KB

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