inode.c 74 KB

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