inode.c 69 KB

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