inode.c 67 KB

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