aops.c 53 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * Copyright (C) 2002, 2004 Oracle. All rights reserved.
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2 of the License, or (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public
  17. * License along with this program; if not, write to the
  18. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  19. * Boston, MA 021110-1307, USA.
  20. */
  21. #include <linux/fs.h>
  22. #include <linux/slab.h>
  23. #include <linux/highmem.h>
  24. #include <linux/pagemap.h>
  25. #include <asm/byteorder.h>
  26. #include <linux/swap.h>
  27. #include <linux/pipe_fs_i.h>
  28. #include <linux/mpage.h>
  29. #include <linux/quotaops.h>
  30. #include <cluster/masklog.h>
  31. #include "ocfs2.h"
  32. #include "alloc.h"
  33. #include "aops.h"
  34. #include "dlmglue.h"
  35. #include "extent_map.h"
  36. #include "file.h"
  37. #include "inode.h"
  38. #include "journal.h"
  39. #include "suballoc.h"
  40. #include "super.h"
  41. #include "symlink.h"
  42. #include "refcounttree.h"
  43. #include "ocfs2_trace.h"
  44. #include "buffer_head_io.h"
  45. static int ocfs2_symlink_get_block(struct inode *inode, sector_t iblock,
  46. struct buffer_head *bh_result, int create)
  47. {
  48. int err = -EIO;
  49. int status;
  50. struct ocfs2_dinode *fe = NULL;
  51. struct buffer_head *bh = NULL;
  52. struct buffer_head *buffer_cache_bh = NULL;
  53. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  54. void *kaddr;
  55. trace_ocfs2_symlink_get_block(
  56. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  57. (unsigned long long)iblock, bh_result, create);
  58. BUG_ON(ocfs2_inode_is_fast_symlink(inode));
  59. if ((iblock << inode->i_sb->s_blocksize_bits) > PATH_MAX + 1) {
  60. mlog(ML_ERROR, "block offset > PATH_MAX: %llu",
  61. (unsigned long long)iblock);
  62. goto bail;
  63. }
  64. status = ocfs2_read_inode_block(inode, &bh);
  65. if (status < 0) {
  66. mlog_errno(status);
  67. goto bail;
  68. }
  69. fe = (struct ocfs2_dinode *) bh->b_data;
  70. if ((u64)iblock >= ocfs2_clusters_to_blocks(inode->i_sb,
  71. le32_to_cpu(fe->i_clusters))) {
  72. mlog(ML_ERROR, "block offset is outside the allocated size: "
  73. "%llu\n", (unsigned long long)iblock);
  74. goto bail;
  75. }
  76. /* We don't use the page cache to create symlink data, so if
  77. * need be, copy it over from the buffer cache. */
  78. if (!buffer_uptodate(bh_result) && ocfs2_inode_is_new(inode)) {
  79. u64 blkno = le64_to_cpu(fe->id2.i_list.l_recs[0].e_blkno) +
  80. iblock;
  81. buffer_cache_bh = sb_getblk(osb->sb, blkno);
  82. if (!buffer_cache_bh) {
  83. mlog(ML_ERROR, "couldn't getblock for symlink!\n");
  84. goto bail;
  85. }
  86. /* we haven't locked out transactions, so a commit
  87. * could've happened. Since we've got a reference on
  88. * the bh, even if it commits while we're doing the
  89. * copy, the data is still good. */
  90. if (buffer_jbd(buffer_cache_bh)
  91. && ocfs2_inode_is_new(inode)) {
  92. kaddr = kmap_atomic(bh_result->b_page);
  93. if (!kaddr) {
  94. mlog(ML_ERROR, "couldn't kmap!\n");
  95. goto bail;
  96. }
  97. memcpy(kaddr + (bh_result->b_size * iblock),
  98. buffer_cache_bh->b_data,
  99. bh_result->b_size);
  100. kunmap_atomic(kaddr);
  101. set_buffer_uptodate(bh_result);
  102. }
  103. brelse(buffer_cache_bh);
  104. }
  105. map_bh(bh_result, inode->i_sb,
  106. le64_to_cpu(fe->id2.i_list.l_recs[0].e_blkno) + iblock);
  107. err = 0;
  108. bail:
  109. brelse(bh);
  110. return err;
  111. }
  112. int ocfs2_get_block(struct inode *inode, sector_t iblock,
  113. struct buffer_head *bh_result, int create)
  114. {
  115. int err = 0;
  116. unsigned int ext_flags;
  117. u64 max_blocks = bh_result->b_size >> inode->i_blkbits;
  118. u64 p_blkno, count, past_eof;
  119. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  120. trace_ocfs2_get_block((unsigned long long)OCFS2_I(inode)->ip_blkno,
  121. (unsigned long long)iblock, bh_result, create);
  122. if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_SYSTEM_FILE)
  123. mlog(ML_NOTICE, "get_block on system inode 0x%p (%lu)\n",
  124. inode, inode->i_ino);
  125. if (S_ISLNK(inode->i_mode)) {
  126. /* this always does I/O for some reason. */
  127. err = ocfs2_symlink_get_block(inode, iblock, bh_result, create);
  128. goto bail;
  129. }
  130. err = ocfs2_extent_map_get_blocks(inode, iblock, &p_blkno, &count,
  131. &ext_flags);
  132. if (err) {
  133. mlog(ML_ERROR, "Error %d from get_blocks(0x%p, %llu, 1, "
  134. "%llu, NULL)\n", err, inode, (unsigned long long)iblock,
  135. (unsigned long long)p_blkno);
  136. goto bail;
  137. }
  138. if (max_blocks < count)
  139. count = max_blocks;
  140. /*
  141. * ocfs2 never allocates in this function - the only time we
  142. * need to use BH_New is when we're extending i_size on a file
  143. * system which doesn't support holes, in which case BH_New
  144. * allows __block_write_begin() to zero.
  145. *
  146. * If we see this on a sparse file system, then a truncate has
  147. * raced us and removed the cluster. In this case, we clear
  148. * the buffers dirty and uptodate bits and let the buffer code
  149. * ignore it as a hole.
  150. */
  151. if (create && p_blkno == 0 && ocfs2_sparse_alloc(osb)) {
  152. clear_buffer_dirty(bh_result);
  153. clear_buffer_uptodate(bh_result);
  154. goto bail;
  155. }
  156. /* Treat the unwritten extent as a hole for zeroing purposes. */
  157. if (p_blkno && !(ext_flags & OCFS2_EXT_UNWRITTEN))
  158. map_bh(bh_result, inode->i_sb, p_blkno);
  159. bh_result->b_size = count << inode->i_blkbits;
  160. if (!ocfs2_sparse_alloc(osb)) {
  161. if (p_blkno == 0) {
  162. err = -EIO;
  163. mlog(ML_ERROR,
  164. "iblock = %llu p_blkno = %llu blkno=(%llu)\n",
  165. (unsigned long long)iblock,
  166. (unsigned long long)p_blkno,
  167. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  168. mlog(ML_ERROR, "Size %llu, clusters %u\n", (unsigned long long)i_size_read(inode), OCFS2_I(inode)->ip_clusters);
  169. dump_stack();
  170. goto bail;
  171. }
  172. }
  173. past_eof = ocfs2_blocks_for_bytes(inode->i_sb, i_size_read(inode));
  174. trace_ocfs2_get_block_end((unsigned long long)OCFS2_I(inode)->ip_blkno,
  175. (unsigned long long)past_eof);
  176. if (create && (iblock >= past_eof))
  177. set_buffer_new(bh_result);
  178. bail:
  179. if (err < 0)
  180. err = -EIO;
  181. return err;
  182. }
  183. int ocfs2_read_inline_data(struct inode *inode, struct page *page,
  184. struct buffer_head *di_bh)
  185. {
  186. void *kaddr;
  187. loff_t size;
  188. struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
  189. if (!(le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_DATA_FL)) {
  190. ocfs2_error(inode->i_sb, "Inode %llu lost inline data flag",
  191. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  192. return -EROFS;
  193. }
  194. size = i_size_read(inode);
  195. if (size > PAGE_CACHE_SIZE ||
  196. size > ocfs2_max_inline_data_with_xattr(inode->i_sb, di)) {
  197. ocfs2_error(inode->i_sb,
  198. "Inode %llu has with inline data has bad size: %Lu",
  199. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  200. (unsigned long long)size);
  201. return -EROFS;
  202. }
  203. kaddr = kmap_atomic(page);
  204. if (size)
  205. memcpy(kaddr, di->id2.i_data.id_data, size);
  206. /* Clear the remaining part of the page */
  207. memset(kaddr + size, 0, PAGE_CACHE_SIZE - size);
  208. flush_dcache_page(page);
  209. kunmap_atomic(kaddr);
  210. SetPageUptodate(page);
  211. return 0;
  212. }
  213. static int ocfs2_readpage_inline(struct inode *inode, struct page *page)
  214. {
  215. int ret;
  216. struct buffer_head *di_bh = NULL;
  217. BUG_ON(!PageLocked(page));
  218. BUG_ON(!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL));
  219. ret = ocfs2_read_inode_block(inode, &di_bh);
  220. if (ret) {
  221. mlog_errno(ret);
  222. goto out;
  223. }
  224. ret = ocfs2_read_inline_data(inode, page, di_bh);
  225. out:
  226. unlock_page(page);
  227. brelse(di_bh);
  228. return ret;
  229. }
  230. static int ocfs2_readpage(struct file *file, struct page *page)
  231. {
  232. struct inode *inode = page->mapping->host;
  233. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  234. loff_t start = (loff_t)page->index << PAGE_CACHE_SHIFT;
  235. int ret, unlock = 1;
  236. trace_ocfs2_readpage((unsigned long long)oi->ip_blkno,
  237. (page ? page->index : 0));
  238. ret = ocfs2_inode_lock_with_page(inode, NULL, 0, page);
  239. if (ret != 0) {
  240. if (ret == AOP_TRUNCATED_PAGE)
  241. unlock = 0;
  242. mlog_errno(ret);
  243. goto out;
  244. }
  245. if (down_read_trylock(&oi->ip_alloc_sem) == 0) {
  246. /*
  247. * Unlock the page and cycle ip_alloc_sem so that we don't
  248. * busyloop waiting for ip_alloc_sem to unlock
  249. */
  250. ret = AOP_TRUNCATED_PAGE;
  251. unlock_page(page);
  252. unlock = 0;
  253. down_read(&oi->ip_alloc_sem);
  254. up_read(&oi->ip_alloc_sem);
  255. goto out_inode_unlock;
  256. }
  257. /*
  258. * i_size might have just been updated as we grabed the meta lock. We
  259. * might now be discovering a truncate that hit on another node.
  260. * block_read_full_page->get_block freaks out if it is asked to read
  261. * beyond the end of a file, so we check here. Callers
  262. * (generic_file_read, vm_ops->fault) are clever enough to check i_size
  263. * and notice that the page they just read isn't needed.
  264. *
  265. * XXX sys_readahead() seems to get that wrong?
  266. */
  267. if (start >= i_size_read(inode)) {
  268. zero_user(page, 0, PAGE_SIZE);
  269. SetPageUptodate(page);
  270. ret = 0;
  271. goto out_alloc;
  272. }
  273. if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL)
  274. ret = ocfs2_readpage_inline(inode, page);
  275. else
  276. ret = block_read_full_page(page, ocfs2_get_block);
  277. unlock = 0;
  278. out_alloc:
  279. up_read(&OCFS2_I(inode)->ip_alloc_sem);
  280. out_inode_unlock:
  281. ocfs2_inode_unlock(inode, 0);
  282. out:
  283. if (unlock)
  284. unlock_page(page);
  285. return ret;
  286. }
  287. /*
  288. * This is used only for read-ahead. Failures or difficult to handle
  289. * situations are safe to ignore.
  290. *
  291. * Right now, we don't bother with BH_Boundary - in-inode extent lists
  292. * are quite large (243 extents on 4k blocks), so most inodes don't
  293. * grow out to a tree. If need be, detecting boundary extents could
  294. * trivially be added in a future version of ocfs2_get_block().
  295. */
  296. static int ocfs2_readpages(struct file *filp, struct address_space *mapping,
  297. struct list_head *pages, unsigned nr_pages)
  298. {
  299. int ret, err = -EIO;
  300. struct inode *inode = mapping->host;
  301. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  302. loff_t start;
  303. struct page *last;
  304. /*
  305. * Use the nonblocking flag for the dlm code to avoid page
  306. * lock inversion, but don't bother with retrying.
  307. */
  308. ret = ocfs2_inode_lock_full(inode, NULL, 0, OCFS2_LOCK_NONBLOCK);
  309. if (ret)
  310. return err;
  311. if (down_read_trylock(&oi->ip_alloc_sem) == 0) {
  312. ocfs2_inode_unlock(inode, 0);
  313. return err;
  314. }
  315. /*
  316. * Don't bother with inline-data. There isn't anything
  317. * to read-ahead in that case anyway...
  318. */
  319. if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL)
  320. goto out_unlock;
  321. /*
  322. * Check whether a remote node truncated this file - we just
  323. * drop out in that case as it's not worth handling here.
  324. */
  325. last = list_entry(pages->prev, struct page, lru);
  326. start = (loff_t)last->index << PAGE_CACHE_SHIFT;
  327. if (start >= i_size_read(inode))
  328. goto out_unlock;
  329. err = mpage_readpages(mapping, pages, nr_pages, ocfs2_get_block);
  330. out_unlock:
  331. up_read(&oi->ip_alloc_sem);
  332. ocfs2_inode_unlock(inode, 0);
  333. return err;
  334. }
  335. /* Note: Because we don't support holes, our allocation has
  336. * already happened (allocation writes zeros to the file data)
  337. * so we don't have to worry about ordered writes in
  338. * ocfs2_writepage.
  339. *
  340. * ->writepage is called during the process of invalidating the page cache
  341. * during blocked lock processing. It can't block on any cluster locks
  342. * to during block mapping. It's relying on the fact that the block
  343. * mapping can't have disappeared under the dirty pages that it is
  344. * being asked to write back.
  345. */
  346. static int ocfs2_writepage(struct page *page, struct writeback_control *wbc)
  347. {
  348. trace_ocfs2_writepage(
  349. (unsigned long long)OCFS2_I(page->mapping->host)->ip_blkno,
  350. page->index);
  351. return block_write_full_page(page, ocfs2_get_block, wbc);
  352. }
  353. /* Taken from ext3. We don't necessarily need the full blown
  354. * functionality yet, but IMHO it's better to cut and paste the whole
  355. * thing so we can avoid introducing our own bugs (and easily pick up
  356. * their fixes when they happen) --Mark */
  357. int walk_page_buffers( handle_t *handle,
  358. struct buffer_head *head,
  359. unsigned from,
  360. unsigned to,
  361. int *partial,
  362. int (*fn)( handle_t *handle,
  363. struct buffer_head *bh))
  364. {
  365. struct buffer_head *bh;
  366. unsigned block_start, block_end;
  367. unsigned blocksize = head->b_size;
  368. int err, ret = 0;
  369. struct buffer_head *next;
  370. for ( bh = head, block_start = 0;
  371. ret == 0 && (bh != head || !block_start);
  372. block_start = block_end, bh = next)
  373. {
  374. next = bh->b_this_page;
  375. block_end = block_start + blocksize;
  376. if (block_end <= from || block_start >= to) {
  377. if (partial && !buffer_uptodate(bh))
  378. *partial = 1;
  379. continue;
  380. }
  381. err = (*fn)(handle, bh);
  382. if (!ret)
  383. ret = err;
  384. }
  385. return ret;
  386. }
  387. static sector_t ocfs2_bmap(struct address_space *mapping, sector_t block)
  388. {
  389. sector_t status;
  390. u64 p_blkno = 0;
  391. int err = 0;
  392. struct inode *inode = mapping->host;
  393. trace_ocfs2_bmap((unsigned long long)OCFS2_I(inode)->ip_blkno,
  394. (unsigned long long)block);
  395. /* We don't need to lock journal system files, since they aren't
  396. * accessed concurrently from multiple nodes.
  397. */
  398. if (!INODE_JOURNAL(inode)) {
  399. err = ocfs2_inode_lock(inode, NULL, 0);
  400. if (err) {
  401. if (err != -ENOENT)
  402. mlog_errno(err);
  403. goto bail;
  404. }
  405. down_read(&OCFS2_I(inode)->ip_alloc_sem);
  406. }
  407. if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL))
  408. err = ocfs2_extent_map_get_blocks(inode, block, &p_blkno, NULL,
  409. NULL);
  410. if (!INODE_JOURNAL(inode)) {
  411. up_read(&OCFS2_I(inode)->ip_alloc_sem);
  412. ocfs2_inode_unlock(inode, 0);
  413. }
  414. if (err) {
  415. mlog(ML_ERROR, "get_blocks() failed, block = %llu\n",
  416. (unsigned long long)block);
  417. mlog_errno(err);
  418. goto bail;
  419. }
  420. bail:
  421. status = err ? 0 : p_blkno;
  422. return status;
  423. }
  424. /*
  425. * TODO: Make this into a generic get_blocks function.
  426. *
  427. * From do_direct_io in direct-io.c:
  428. * "So what we do is to permit the ->get_blocks function to populate
  429. * bh.b_size with the size of IO which is permitted at this offset and
  430. * this i_blkbits."
  431. *
  432. * This function is called directly from get_more_blocks in direct-io.c.
  433. *
  434. * called like this: dio->get_blocks(dio->inode, fs_startblk,
  435. * fs_count, map_bh, dio->rw == WRITE);
  436. *
  437. * Note that we never bother to allocate blocks here, and thus ignore the
  438. * create argument.
  439. */
  440. static int ocfs2_direct_IO_get_blocks(struct inode *inode, sector_t iblock,
  441. struct buffer_head *bh_result, int create)
  442. {
  443. int ret;
  444. u64 p_blkno, inode_blocks, contig_blocks;
  445. unsigned int ext_flags;
  446. unsigned char blocksize_bits = inode->i_sb->s_blocksize_bits;
  447. unsigned long max_blocks = bh_result->b_size >> inode->i_blkbits;
  448. /* This function won't even be called if the request isn't all
  449. * nicely aligned and of the right size, so there's no need
  450. * for us to check any of that. */
  451. inode_blocks = ocfs2_blocks_for_bytes(inode->i_sb, i_size_read(inode));
  452. /* This figures out the size of the next contiguous block, and
  453. * our logical offset */
  454. ret = ocfs2_extent_map_get_blocks(inode, iblock, &p_blkno,
  455. &contig_blocks, &ext_flags);
  456. if (ret) {
  457. mlog(ML_ERROR, "get_blocks() failed iblock=%llu\n",
  458. (unsigned long long)iblock);
  459. ret = -EIO;
  460. goto bail;
  461. }
  462. /* We should already CoW the refcounted extent in case of create. */
  463. BUG_ON(create && (ext_flags & OCFS2_EXT_REFCOUNTED));
  464. /*
  465. * get_more_blocks() expects us to describe a hole by clearing
  466. * the mapped bit on bh_result().
  467. *
  468. * Consider an unwritten extent as a hole.
  469. */
  470. if (p_blkno && !(ext_flags & OCFS2_EXT_UNWRITTEN))
  471. map_bh(bh_result, inode->i_sb, p_blkno);
  472. else
  473. clear_buffer_mapped(bh_result);
  474. /* make sure we don't map more than max_blocks blocks here as
  475. that's all the kernel will handle at this point. */
  476. if (max_blocks < contig_blocks)
  477. contig_blocks = max_blocks;
  478. bh_result->b_size = contig_blocks << blocksize_bits;
  479. bail:
  480. return ret;
  481. }
  482. /*
  483. * ocfs2_dio_end_io is called by the dio core when a dio is finished. We're
  484. * particularly interested in the aio/dio case. We use the rw_lock DLM lock
  485. * to protect io on one node from truncation on another.
  486. */
  487. static void ocfs2_dio_end_io(struct kiocb *iocb,
  488. loff_t offset,
  489. ssize_t bytes,
  490. void *private,
  491. int ret,
  492. bool is_async)
  493. {
  494. struct inode *inode = iocb->ki_filp->f_path.dentry->d_inode;
  495. int level;
  496. wait_queue_head_t *wq = ocfs2_ioend_wq(inode);
  497. /* this io's submitter should not have unlocked this before we could */
  498. BUG_ON(!ocfs2_iocb_is_rw_locked(iocb));
  499. if (ocfs2_iocb_is_sem_locked(iocb))
  500. ocfs2_iocb_clear_sem_locked(iocb);
  501. if (ocfs2_iocb_is_unaligned_aio(iocb)) {
  502. ocfs2_iocb_clear_unaligned_aio(iocb);
  503. if (atomic_dec_and_test(&OCFS2_I(inode)->ip_unaligned_aio) &&
  504. waitqueue_active(wq)) {
  505. wake_up_all(wq);
  506. }
  507. }
  508. ocfs2_iocb_clear_rw_locked(iocb);
  509. level = ocfs2_iocb_rw_locked_level(iocb);
  510. ocfs2_rw_unlock(inode, level);
  511. if (is_async)
  512. aio_complete(iocb, ret, 0);
  513. inode_dio_done(inode);
  514. }
  515. /*
  516. * ocfs2_invalidatepage() and ocfs2_releasepage() are shamelessly stolen
  517. * from ext3. PageChecked() bits have been removed as OCFS2 does not
  518. * do journalled data.
  519. */
  520. static void ocfs2_invalidatepage(struct page *page, unsigned long offset)
  521. {
  522. journal_t *journal = OCFS2_SB(page->mapping->host->i_sb)->journal->j_journal;
  523. jbd2_journal_invalidatepage(journal, page, offset);
  524. }
  525. static int ocfs2_releasepage(struct page *page, gfp_t wait)
  526. {
  527. journal_t *journal = OCFS2_SB(page->mapping->host->i_sb)->journal->j_journal;
  528. if (!page_has_buffers(page))
  529. return 0;
  530. return jbd2_journal_try_to_free_buffers(journal, page, wait);
  531. }
  532. static ssize_t ocfs2_direct_IO(int rw,
  533. struct kiocb *iocb,
  534. const struct iovec *iov,
  535. loff_t offset,
  536. unsigned long nr_segs)
  537. {
  538. struct file *file = iocb->ki_filp;
  539. struct inode *inode = file->f_path.dentry->d_inode->i_mapping->host;
  540. /*
  541. * Fallback to buffered I/O if we see an inode without
  542. * extents.
  543. */
  544. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
  545. return 0;
  546. /* Fallback to buffered I/O if we are appending. */
  547. if (i_size_read(inode) <= offset)
  548. return 0;
  549. return __blockdev_direct_IO(rw, iocb, inode, inode->i_sb->s_bdev,
  550. iov, offset, nr_segs,
  551. ocfs2_direct_IO_get_blocks,
  552. ocfs2_dio_end_io, NULL, 0);
  553. }
  554. static void ocfs2_figure_cluster_boundaries(struct ocfs2_super *osb,
  555. u32 cpos,
  556. unsigned int *start,
  557. unsigned int *end)
  558. {
  559. unsigned int cluster_start = 0, cluster_end = PAGE_CACHE_SIZE;
  560. if (unlikely(PAGE_CACHE_SHIFT > osb->s_clustersize_bits)) {
  561. unsigned int cpp;
  562. cpp = 1 << (PAGE_CACHE_SHIFT - osb->s_clustersize_bits);
  563. cluster_start = cpos % cpp;
  564. cluster_start = cluster_start << osb->s_clustersize_bits;
  565. cluster_end = cluster_start + osb->s_clustersize;
  566. }
  567. BUG_ON(cluster_start > PAGE_SIZE);
  568. BUG_ON(cluster_end > PAGE_SIZE);
  569. if (start)
  570. *start = cluster_start;
  571. if (end)
  572. *end = cluster_end;
  573. }
  574. /*
  575. * 'from' and 'to' are the region in the page to avoid zeroing.
  576. *
  577. * If pagesize > clustersize, this function will avoid zeroing outside
  578. * of the cluster boundary.
  579. *
  580. * from == to == 0 is code for "zero the entire cluster region"
  581. */
  582. static void ocfs2_clear_page_regions(struct page *page,
  583. struct ocfs2_super *osb, u32 cpos,
  584. unsigned from, unsigned to)
  585. {
  586. void *kaddr;
  587. unsigned int cluster_start, cluster_end;
  588. ocfs2_figure_cluster_boundaries(osb, cpos, &cluster_start, &cluster_end);
  589. kaddr = kmap_atomic(page);
  590. if (from || to) {
  591. if (from > cluster_start)
  592. memset(kaddr + cluster_start, 0, from - cluster_start);
  593. if (to < cluster_end)
  594. memset(kaddr + to, 0, cluster_end - to);
  595. } else {
  596. memset(kaddr + cluster_start, 0, cluster_end - cluster_start);
  597. }
  598. kunmap_atomic(kaddr);
  599. }
  600. /*
  601. * Nonsparse file systems fully allocate before we get to the write
  602. * code. This prevents ocfs2_write() from tagging the write as an
  603. * allocating one, which means ocfs2_map_page_blocks() might try to
  604. * read-in the blocks at the tail of our file. Avoid reading them by
  605. * testing i_size against each block offset.
  606. */
  607. static int ocfs2_should_read_blk(struct inode *inode, struct page *page,
  608. unsigned int block_start)
  609. {
  610. u64 offset = page_offset(page) + block_start;
  611. if (ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb)))
  612. return 1;
  613. if (i_size_read(inode) > offset)
  614. return 1;
  615. return 0;
  616. }
  617. /*
  618. * Some of this taken from __block_write_begin(). We already have our
  619. * mapping by now though, and the entire write will be allocating or
  620. * it won't, so not much need to use BH_New.
  621. *
  622. * This will also skip zeroing, which is handled externally.
  623. */
  624. int ocfs2_map_page_blocks(struct page *page, u64 *p_blkno,
  625. struct inode *inode, unsigned int from,
  626. unsigned int to, int new)
  627. {
  628. int ret = 0;
  629. struct buffer_head *head, *bh, *wait[2], **wait_bh = wait;
  630. unsigned int block_end, block_start;
  631. unsigned int bsize = 1 << inode->i_blkbits;
  632. if (!page_has_buffers(page))
  633. create_empty_buffers(page, bsize, 0);
  634. head = page_buffers(page);
  635. for (bh = head, block_start = 0; bh != head || !block_start;
  636. bh = bh->b_this_page, block_start += bsize) {
  637. block_end = block_start + bsize;
  638. clear_buffer_new(bh);
  639. /*
  640. * Ignore blocks outside of our i/o range -
  641. * they may belong to unallocated clusters.
  642. */
  643. if (block_start >= to || block_end <= from) {
  644. if (PageUptodate(page))
  645. set_buffer_uptodate(bh);
  646. continue;
  647. }
  648. /*
  649. * For an allocating write with cluster size >= page
  650. * size, we always write the entire page.
  651. */
  652. if (new)
  653. set_buffer_new(bh);
  654. if (!buffer_mapped(bh)) {
  655. map_bh(bh, inode->i_sb, *p_blkno);
  656. unmap_underlying_metadata(bh->b_bdev, bh->b_blocknr);
  657. }
  658. if (PageUptodate(page)) {
  659. if (!buffer_uptodate(bh))
  660. set_buffer_uptodate(bh);
  661. } else if (!buffer_uptodate(bh) && !buffer_delay(bh) &&
  662. !buffer_new(bh) &&
  663. ocfs2_should_read_blk(inode, page, block_start) &&
  664. (block_start < from || block_end > to)) {
  665. ll_rw_block(READ, 1, &bh);
  666. *wait_bh++=bh;
  667. }
  668. *p_blkno = *p_blkno + 1;
  669. }
  670. /*
  671. * If we issued read requests - let them complete.
  672. */
  673. while(wait_bh > wait) {
  674. wait_on_buffer(*--wait_bh);
  675. if (!buffer_uptodate(*wait_bh))
  676. ret = -EIO;
  677. }
  678. if (ret == 0 || !new)
  679. return ret;
  680. /*
  681. * If we get -EIO above, zero out any newly allocated blocks
  682. * to avoid exposing stale data.
  683. */
  684. bh = head;
  685. block_start = 0;
  686. do {
  687. block_end = block_start + bsize;
  688. if (block_end <= from)
  689. goto next_bh;
  690. if (block_start >= to)
  691. break;
  692. zero_user(page, block_start, bh->b_size);
  693. set_buffer_uptodate(bh);
  694. mark_buffer_dirty(bh);
  695. next_bh:
  696. block_start = block_end;
  697. bh = bh->b_this_page;
  698. } while (bh != head);
  699. return ret;
  700. }
  701. #if (PAGE_CACHE_SIZE >= OCFS2_MAX_CLUSTERSIZE)
  702. #define OCFS2_MAX_CTXT_PAGES 1
  703. #else
  704. #define OCFS2_MAX_CTXT_PAGES (OCFS2_MAX_CLUSTERSIZE / PAGE_CACHE_SIZE)
  705. #endif
  706. #define OCFS2_MAX_CLUSTERS_PER_PAGE (PAGE_CACHE_SIZE / OCFS2_MIN_CLUSTERSIZE)
  707. /*
  708. * Describe the state of a single cluster to be written to.
  709. */
  710. struct ocfs2_write_cluster_desc {
  711. u32 c_cpos;
  712. u32 c_phys;
  713. /*
  714. * Give this a unique field because c_phys eventually gets
  715. * filled.
  716. */
  717. unsigned c_new;
  718. unsigned c_unwritten;
  719. unsigned c_needs_zero;
  720. };
  721. struct ocfs2_write_ctxt {
  722. /* Logical cluster position / len of write */
  723. u32 w_cpos;
  724. u32 w_clen;
  725. /* First cluster allocated in a nonsparse extend */
  726. u32 w_first_new_cpos;
  727. struct ocfs2_write_cluster_desc w_desc[OCFS2_MAX_CLUSTERS_PER_PAGE];
  728. /*
  729. * This is true if page_size > cluster_size.
  730. *
  731. * It triggers a set of special cases during write which might
  732. * have to deal with allocating writes to partial pages.
  733. */
  734. unsigned int w_large_pages;
  735. /*
  736. * Pages involved in this write.
  737. *
  738. * w_target_page is the page being written to by the user.
  739. *
  740. * w_pages is an array of pages which always contains
  741. * w_target_page, and in the case of an allocating write with
  742. * page_size < cluster size, it will contain zero'd and mapped
  743. * pages adjacent to w_target_page which need to be written
  744. * out in so that future reads from that region will get
  745. * zero's.
  746. */
  747. unsigned int w_num_pages;
  748. struct page *w_pages[OCFS2_MAX_CTXT_PAGES];
  749. struct page *w_target_page;
  750. /*
  751. * w_target_locked is used for page_mkwrite path indicating no unlocking
  752. * against w_target_page in ocfs2_write_end_nolock.
  753. */
  754. unsigned int w_target_locked:1;
  755. /*
  756. * ocfs2_write_end() uses this to know what the real range to
  757. * write in the target should be.
  758. */
  759. unsigned int w_target_from;
  760. unsigned int w_target_to;
  761. /*
  762. * We could use journal_current_handle() but this is cleaner,
  763. * IMHO -Mark
  764. */
  765. handle_t *w_handle;
  766. struct buffer_head *w_di_bh;
  767. struct ocfs2_cached_dealloc_ctxt w_dealloc;
  768. };
  769. void ocfs2_unlock_and_free_pages(struct page **pages, int num_pages)
  770. {
  771. int i;
  772. for(i = 0; i < num_pages; i++) {
  773. if (pages[i]) {
  774. unlock_page(pages[i]);
  775. mark_page_accessed(pages[i]);
  776. page_cache_release(pages[i]);
  777. }
  778. }
  779. }
  780. static void ocfs2_free_write_ctxt(struct ocfs2_write_ctxt *wc)
  781. {
  782. int i;
  783. /*
  784. * w_target_locked is only set to true in the page_mkwrite() case.
  785. * The intent is to allow us to lock the target page from write_begin()
  786. * to write_end(). The caller must hold a ref on w_target_page.
  787. */
  788. if (wc->w_target_locked) {
  789. BUG_ON(!wc->w_target_page);
  790. for (i = 0; i < wc->w_num_pages; i++) {
  791. if (wc->w_target_page == wc->w_pages[i]) {
  792. wc->w_pages[i] = NULL;
  793. break;
  794. }
  795. }
  796. mark_page_accessed(wc->w_target_page);
  797. page_cache_release(wc->w_target_page);
  798. }
  799. ocfs2_unlock_and_free_pages(wc->w_pages, wc->w_num_pages);
  800. brelse(wc->w_di_bh);
  801. kfree(wc);
  802. }
  803. static int ocfs2_alloc_write_ctxt(struct ocfs2_write_ctxt **wcp,
  804. struct ocfs2_super *osb, loff_t pos,
  805. unsigned len, struct buffer_head *di_bh)
  806. {
  807. u32 cend;
  808. struct ocfs2_write_ctxt *wc;
  809. wc = kzalloc(sizeof(struct ocfs2_write_ctxt), GFP_NOFS);
  810. if (!wc)
  811. return -ENOMEM;
  812. wc->w_cpos = pos >> osb->s_clustersize_bits;
  813. wc->w_first_new_cpos = UINT_MAX;
  814. cend = (pos + len - 1) >> osb->s_clustersize_bits;
  815. wc->w_clen = cend - wc->w_cpos + 1;
  816. get_bh(di_bh);
  817. wc->w_di_bh = di_bh;
  818. if (unlikely(PAGE_CACHE_SHIFT > osb->s_clustersize_bits))
  819. wc->w_large_pages = 1;
  820. else
  821. wc->w_large_pages = 0;
  822. ocfs2_init_dealloc_ctxt(&wc->w_dealloc);
  823. *wcp = wc;
  824. return 0;
  825. }
  826. /*
  827. * If a page has any new buffers, zero them out here, and mark them uptodate
  828. * and dirty so they'll be written out (in order to prevent uninitialised
  829. * block data from leaking). And clear the new bit.
  830. */
  831. static void ocfs2_zero_new_buffers(struct page *page, unsigned from, unsigned to)
  832. {
  833. unsigned int block_start, block_end;
  834. struct buffer_head *head, *bh;
  835. BUG_ON(!PageLocked(page));
  836. if (!page_has_buffers(page))
  837. return;
  838. bh = head = page_buffers(page);
  839. block_start = 0;
  840. do {
  841. block_end = block_start + bh->b_size;
  842. if (buffer_new(bh)) {
  843. if (block_end > from && block_start < to) {
  844. if (!PageUptodate(page)) {
  845. unsigned start, end;
  846. start = max(from, block_start);
  847. end = min(to, block_end);
  848. zero_user_segment(page, start, end);
  849. set_buffer_uptodate(bh);
  850. }
  851. clear_buffer_new(bh);
  852. mark_buffer_dirty(bh);
  853. }
  854. }
  855. block_start = block_end;
  856. bh = bh->b_this_page;
  857. } while (bh != head);
  858. }
  859. /*
  860. * Only called when we have a failure during allocating write to write
  861. * zero's to the newly allocated region.
  862. */
  863. static void ocfs2_write_failure(struct inode *inode,
  864. struct ocfs2_write_ctxt *wc,
  865. loff_t user_pos, unsigned user_len)
  866. {
  867. int i;
  868. unsigned from = user_pos & (PAGE_CACHE_SIZE - 1),
  869. to = user_pos + user_len;
  870. struct page *tmppage;
  871. ocfs2_zero_new_buffers(wc->w_target_page, from, to);
  872. for(i = 0; i < wc->w_num_pages; i++) {
  873. tmppage = wc->w_pages[i];
  874. if (page_has_buffers(tmppage)) {
  875. if (ocfs2_should_order_data(inode))
  876. ocfs2_jbd2_file_inode(wc->w_handle, inode);
  877. block_commit_write(tmppage, from, to);
  878. }
  879. }
  880. }
  881. static int ocfs2_prepare_page_for_write(struct inode *inode, u64 *p_blkno,
  882. struct ocfs2_write_ctxt *wc,
  883. struct page *page, u32 cpos,
  884. loff_t user_pos, unsigned user_len,
  885. int new)
  886. {
  887. int ret;
  888. unsigned int map_from = 0, map_to = 0;
  889. unsigned int cluster_start, cluster_end;
  890. unsigned int user_data_from = 0, user_data_to = 0;
  891. ocfs2_figure_cluster_boundaries(OCFS2_SB(inode->i_sb), cpos,
  892. &cluster_start, &cluster_end);
  893. /* treat the write as new if the a hole/lseek spanned across
  894. * the page boundary.
  895. */
  896. new = new | ((i_size_read(inode) <= page_offset(page)) &&
  897. (page_offset(page) <= user_pos));
  898. if (page == wc->w_target_page) {
  899. map_from = user_pos & (PAGE_CACHE_SIZE - 1);
  900. map_to = map_from + user_len;
  901. if (new)
  902. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  903. cluster_start, cluster_end,
  904. new);
  905. else
  906. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  907. map_from, map_to, new);
  908. if (ret) {
  909. mlog_errno(ret);
  910. goto out;
  911. }
  912. user_data_from = map_from;
  913. user_data_to = map_to;
  914. if (new) {
  915. map_from = cluster_start;
  916. map_to = cluster_end;
  917. }
  918. } else {
  919. /*
  920. * If we haven't allocated the new page yet, we
  921. * shouldn't be writing it out without copying user
  922. * data. This is likely a math error from the caller.
  923. */
  924. BUG_ON(!new);
  925. map_from = cluster_start;
  926. map_to = cluster_end;
  927. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  928. cluster_start, cluster_end, new);
  929. if (ret) {
  930. mlog_errno(ret);
  931. goto out;
  932. }
  933. }
  934. /*
  935. * Parts of newly allocated pages need to be zero'd.
  936. *
  937. * Above, we have also rewritten 'to' and 'from' - as far as
  938. * the rest of the function is concerned, the entire cluster
  939. * range inside of a page needs to be written.
  940. *
  941. * We can skip this if the page is up to date - it's already
  942. * been zero'd from being read in as a hole.
  943. */
  944. if (new && !PageUptodate(page))
  945. ocfs2_clear_page_regions(page, OCFS2_SB(inode->i_sb),
  946. cpos, user_data_from, user_data_to);
  947. flush_dcache_page(page);
  948. out:
  949. return ret;
  950. }
  951. /*
  952. * This function will only grab one clusters worth of pages.
  953. */
  954. static int ocfs2_grab_pages_for_write(struct address_space *mapping,
  955. struct ocfs2_write_ctxt *wc,
  956. u32 cpos, loff_t user_pos,
  957. unsigned user_len, int new,
  958. struct page *mmap_page)
  959. {
  960. int ret = 0, i;
  961. unsigned long start, target_index, end_index, index;
  962. struct inode *inode = mapping->host;
  963. loff_t last_byte;
  964. target_index = user_pos >> PAGE_CACHE_SHIFT;
  965. /*
  966. * Figure out how many pages we'll be manipulating here. For
  967. * non allocating write, we just change the one
  968. * page. Otherwise, we'll need a whole clusters worth. If we're
  969. * writing past i_size, we only need enough pages to cover the
  970. * last page of the write.
  971. */
  972. if (new) {
  973. wc->w_num_pages = ocfs2_pages_per_cluster(inode->i_sb);
  974. start = ocfs2_align_clusters_to_page_index(inode->i_sb, cpos);
  975. /*
  976. * We need the index *past* the last page we could possibly
  977. * touch. This is the page past the end of the write or
  978. * i_size, whichever is greater.
  979. */
  980. last_byte = max(user_pos + user_len, i_size_read(inode));
  981. BUG_ON(last_byte < 1);
  982. end_index = ((last_byte - 1) >> PAGE_CACHE_SHIFT) + 1;
  983. if ((start + wc->w_num_pages) > end_index)
  984. wc->w_num_pages = end_index - start;
  985. } else {
  986. wc->w_num_pages = 1;
  987. start = target_index;
  988. }
  989. for(i = 0; i < wc->w_num_pages; i++) {
  990. index = start + i;
  991. if (index == target_index && mmap_page) {
  992. /*
  993. * ocfs2_pagemkwrite() is a little different
  994. * and wants us to directly use the page
  995. * passed in.
  996. */
  997. lock_page(mmap_page);
  998. /* Exit and let the caller retry */
  999. if (mmap_page->mapping != mapping) {
  1000. WARN_ON(mmap_page->mapping);
  1001. unlock_page(mmap_page);
  1002. ret = -EAGAIN;
  1003. goto out;
  1004. }
  1005. page_cache_get(mmap_page);
  1006. wc->w_pages[i] = mmap_page;
  1007. wc->w_target_locked = true;
  1008. } else {
  1009. wc->w_pages[i] = find_or_create_page(mapping, index,
  1010. GFP_NOFS);
  1011. if (!wc->w_pages[i]) {
  1012. ret = -ENOMEM;
  1013. mlog_errno(ret);
  1014. goto out;
  1015. }
  1016. }
  1017. if (index == target_index)
  1018. wc->w_target_page = wc->w_pages[i];
  1019. }
  1020. out:
  1021. if (ret)
  1022. wc->w_target_locked = false;
  1023. return ret;
  1024. }
  1025. /*
  1026. * Prepare a single cluster for write one cluster into the file.
  1027. */
  1028. static int ocfs2_write_cluster(struct address_space *mapping,
  1029. u32 phys, unsigned int unwritten,
  1030. unsigned int should_zero,
  1031. struct ocfs2_alloc_context *data_ac,
  1032. struct ocfs2_alloc_context *meta_ac,
  1033. struct ocfs2_write_ctxt *wc, u32 cpos,
  1034. loff_t user_pos, unsigned user_len)
  1035. {
  1036. int ret, i, new;
  1037. u64 v_blkno, p_blkno;
  1038. struct inode *inode = mapping->host;
  1039. struct ocfs2_extent_tree et;
  1040. new = phys == 0 ? 1 : 0;
  1041. if (new) {
  1042. u32 tmp_pos;
  1043. /*
  1044. * This is safe to call with the page locks - it won't take
  1045. * any additional semaphores or cluster locks.
  1046. */
  1047. tmp_pos = cpos;
  1048. ret = ocfs2_add_inode_data(OCFS2_SB(inode->i_sb), inode,
  1049. &tmp_pos, 1, 0, wc->w_di_bh,
  1050. wc->w_handle, data_ac,
  1051. meta_ac, NULL);
  1052. /*
  1053. * This shouldn't happen because we must have already
  1054. * calculated the correct meta data allocation required. The
  1055. * internal tree allocation code should know how to increase
  1056. * transaction credits itself.
  1057. *
  1058. * If need be, we could handle -EAGAIN for a
  1059. * RESTART_TRANS here.
  1060. */
  1061. mlog_bug_on_msg(ret == -EAGAIN,
  1062. "Inode %llu: EAGAIN return during allocation.\n",
  1063. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  1064. if (ret < 0) {
  1065. mlog_errno(ret);
  1066. goto out;
  1067. }
  1068. } else if (unwritten) {
  1069. ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode),
  1070. wc->w_di_bh);
  1071. ret = ocfs2_mark_extent_written(inode, &et,
  1072. wc->w_handle, cpos, 1, phys,
  1073. meta_ac, &wc->w_dealloc);
  1074. if (ret < 0) {
  1075. mlog_errno(ret);
  1076. goto out;
  1077. }
  1078. }
  1079. if (should_zero)
  1080. v_blkno = ocfs2_clusters_to_blocks(inode->i_sb, cpos);
  1081. else
  1082. v_blkno = user_pos >> inode->i_sb->s_blocksize_bits;
  1083. /*
  1084. * The only reason this should fail is due to an inability to
  1085. * find the extent added.
  1086. */
  1087. ret = ocfs2_extent_map_get_blocks(inode, v_blkno, &p_blkno, NULL,
  1088. NULL);
  1089. if (ret < 0) {
  1090. ocfs2_error(inode->i_sb, "Corrupting extend for inode %llu, "
  1091. "at logical block %llu",
  1092. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  1093. (unsigned long long)v_blkno);
  1094. goto out;
  1095. }
  1096. BUG_ON(p_blkno == 0);
  1097. for(i = 0; i < wc->w_num_pages; i++) {
  1098. int tmpret;
  1099. tmpret = ocfs2_prepare_page_for_write(inode, &p_blkno, wc,
  1100. wc->w_pages[i], cpos,
  1101. user_pos, user_len,
  1102. should_zero);
  1103. if (tmpret) {
  1104. mlog_errno(tmpret);
  1105. if (ret == 0)
  1106. ret = tmpret;
  1107. }
  1108. }
  1109. /*
  1110. * We only have cleanup to do in case of allocating write.
  1111. */
  1112. if (ret && new)
  1113. ocfs2_write_failure(inode, wc, user_pos, user_len);
  1114. out:
  1115. return ret;
  1116. }
  1117. static int ocfs2_write_cluster_by_desc(struct address_space *mapping,
  1118. struct ocfs2_alloc_context *data_ac,
  1119. struct ocfs2_alloc_context *meta_ac,
  1120. struct ocfs2_write_ctxt *wc,
  1121. loff_t pos, unsigned len)
  1122. {
  1123. int ret, i;
  1124. loff_t cluster_off;
  1125. unsigned int local_len = len;
  1126. struct ocfs2_write_cluster_desc *desc;
  1127. struct ocfs2_super *osb = OCFS2_SB(mapping->host->i_sb);
  1128. for (i = 0; i < wc->w_clen; i++) {
  1129. desc = &wc->w_desc[i];
  1130. /*
  1131. * We have to make sure that the total write passed in
  1132. * doesn't extend past a single cluster.
  1133. */
  1134. local_len = len;
  1135. cluster_off = pos & (osb->s_clustersize - 1);
  1136. if ((cluster_off + local_len) > osb->s_clustersize)
  1137. local_len = osb->s_clustersize - cluster_off;
  1138. ret = ocfs2_write_cluster(mapping, desc->c_phys,
  1139. desc->c_unwritten,
  1140. desc->c_needs_zero,
  1141. data_ac, meta_ac,
  1142. wc, desc->c_cpos, pos, local_len);
  1143. if (ret) {
  1144. mlog_errno(ret);
  1145. goto out;
  1146. }
  1147. len -= local_len;
  1148. pos += local_len;
  1149. }
  1150. ret = 0;
  1151. out:
  1152. return ret;
  1153. }
  1154. /*
  1155. * ocfs2_write_end() wants to know which parts of the target page it
  1156. * should complete the write on. It's easiest to compute them ahead of
  1157. * time when a more complete view of the write is available.
  1158. */
  1159. static void ocfs2_set_target_boundaries(struct ocfs2_super *osb,
  1160. struct ocfs2_write_ctxt *wc,
  1161. loff_t pos, unsigned len, int alloc)
  1162. {
  1163. struct ocfs2_write_cluster_desc *desc;
  1164. wc->w_target_from = pos & (PAGE_CACHE_SIZE - 1);
  1165. wc->w_target_to = wc->w_target_from + len;
  1166. if (alloc == 0)
  1167. return;
  1168. /*
  1169. * Allocating write - we may have different boundaries based
  1170. * on page size and cluster size.
  1171. *
  1172. * NOTE: We can no longer compute one value from the other as
  1173. * the actual write length and user provided length may be
  1174. * different.
  1175. */
  1176. if (wc->w_large_pages) {
  1177. /*
  1178. * We only care about the 1st and last cluster within
  1179. * our range and whether they should be zero'd or not. Either
  1180. * value may be extended out to the start/end of a
  1181. * newly allocated cluster.
  1182. */
  1183. desc = &wc->w_desc[0];
  1184. if (desc->c_needs_zero)
  1185. ocfs2_figure_cluster_boundaries(osb,
  1186. desc->c_cpos,
  1187. &wc->w_target_from,
  1188. NULL);
  1189. desc = &wc->w_desc[wc->w_clen - 1];
  1190. if (desc->c_needs_zero)
  1191. ocfs2_figure_cluster_boundaries(osb,
  1192. desc->c_cpos,
  1193. NULL,
  1194. &wc->w_target_to);
  1195. } else {
  1196. wc->w_target_from = 0;
  1197. wc->w_target_to = PAGE_CACHE_SIZE;
  1198. }
  1199. }
  1200. /*
  1201. * Populate each single-cluster write descriptor in the write context
  1202. * with information about the i/o to be done.
  1203. *
  1204. * Returns the number of clusters that will have to be allocated, as
  1205. * well as a worst case estimate of the number of extent records that
  1206. * would have to be created during a write to an unwritten region.
  1207. */
  1208. static int ocfs2_populate_write_desc(struct inode *inode,
  1209. struct ocfs2_write_ctxt *wc,
  1210. unsigned int *clusters_to_alloc,
  1211. unsigned int *extents_to_split)
  1212. {
  1213. int ret;
  1214. struct ocfs2_write_cluster_desc *desc;
  1215. unsigned int num_clusters = 0;
  1216. unsigned int ext_flags = 0;
  1217. u32 phys = 0;
  1218. int i;
  1219. *clusters_to_alloc = 0;
  1220. *extents_to_split = 0;
  1221. for (i = 0; i < wc->w_clen; i++) {
  1222. desc = &wc->w_desc[i];
  1223. desc->c_cpos = wc->w_cpos + i;
  1224. if (num_clusters == 0) {
  1225. /*
  1226. * Need to look up the next extent record.
  1227. */
  1228. ret = ocfs2_get_clusters(inode, desc->c_cpos, &phys,
  1229. &num_clusters, &ext_flags);
  1230. if (ret) {
  1231. mlog_errno(ret);
  1232. goto out;
  1233. }
  1234. /* We should already CoW the refcountd extent. */
  1235. BUG_ON(ext_flags & OCFS2_EXT_REFCOUNTED);
  1236. /*
  1237. * Assume worst case - that we're writing in
  1238. * the middle of the extent.
  1239. *
  1240. * We can assume that the write proceeds from
  1241. * left to right, in which case the extent
  1242. * insert code is smart enough to coalesce the
  1243. * next splits into the previous records created.
  1244. */
  1245. if (ext_flags & OCFS2_EXT_UNWRITTEN)
  1246. *extents_to_split = *extents_to_split + 2;
  1247. } else if (phys) {
  1248. /*
  1249. * Only increment phys if it doesn't describe
  1250. * a hole.
  1251. */
  1252. phys++;
  1253. }
  1254. /*
  1255. * If w_first_new_cpos is < UINT_MAX, we have a non-sparse
  1256. * file that got extended. w_first_new_cpos tells us
  1257. * where the newly allocated clusters are so we can
  1258. * zero them.
  1259. */
  1260. if (desc->c_cpos >= wc->w_first_new_cpos) {
  1261. BUG_ON(phys == 0);
  1262. desc->c_needs_zero = 1;
  1263. }
  1264. desc->c_phys = phys;
  1265. if (phys == 0) {
  1266. desc->c_new = 1;
  1267. desc->c_needs_zero = 1;
  1268. *clusters_to_alloc = *clusters_to_alloc + 1;
  1269. }
  1270. if (ext_flags & OCFS2_EXT_UNWRITTEN) {
  1271. desc->c_unwritten = 1;
  1272. desc->c_needs_zero = 1;
  1273. }
  1274. num_clusters--;
  1275. }
  1276. ret = 0;
  1277. out:
  1278. return ret;
  1279. }
  1280. static int ocfs2_write_begin_inline(struct address_space *mapping,
  1281. struct inode *inode,
  1282. struct ocfs2_write_ctxt *wc)
  1283. {
  1284. int ret;
  1285. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1286. struct page *page;
  1287. handle_t *handle;
  1288. struct ocfs2_dinode *di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1289. page = find_or_create_page(mapping, 0, GFP_NOFS);
  1290. if (!page) {
  1291. ret = -ENOMEM;
  1292. mlog_errno(ret);
  1293. goto out;
  1294. }
  1295. /*
  1296. * If we don't set w_num_pages then this page won't get unlocked
  1297. * and freed on cleanup of the write context.
  1298. */
  1299. wc->w_pages[0] = wc->w_target_page = page;
  1300. wc->w_num_pages = 1;
  1301. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  1302. if (IS_ERR(handle)) {
  1303. ret = PTR_ERR(handle);
  1304. mlog_errno(ret);
  1305. goto out;
  1306. }
  1307. ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), wc->w_di_bh,
  1308. OCFS2_JOURNAL_ACCESS_WRITE);
  1309. if (ret) {
  1310. ocfs2_commit_trans(osb, handle);
  1311. mlog_errno(ret);
  1312. goto out;
  1313. }
  1314. if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL))
  1315. ocfs2_set_inode_data_inline(inode, di);
  1316. if (!PageUptodate(page)) {
  1317. ret = ocfs2_read_inline_data(inode, page, wc->w_di_bh);
  1318. if (ret) {
  1319. ocfs2_commit_trans(osb, handle);
  1320. goto out;
  1321. }
  1322. }
  1323. wc->w_handle = handle;
  1324. out:
  1325. return ret;
  1326. }
  1327. int ocfs2_size_fits_inline_data(struct buffer_head *di_bh, u64 new_size)
  1328. {
  1329. struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
  1330. if (new_size <= le16_to_cpu(di->id2.i_data.id_count))
  1331. return 1;
  1332. return 0;
  1333. }
  1334. static int ocfs2_try_to_write_inline_data(struct address_space *mapping,
  1335. struct inode *inode, loff_t pos,
  1336. unsigned len, struct page *mmap_page,
  1337. struct ocfs2_write_ctxt *wc)
  1338. {
  1339. int ret, written = 0;
  1340. loff_t end = pos + len;
  1341. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  1342. struct ocfs2_dinode *di = NULL;
  1343. trace_ocfs2_try_to_write_inline_data((unsigned long long)oi->ip_blkno,
  1344. len, (unsigned long long)pos,
  1345. oi->ip_dyn_features);
  1346. /*
  1347. * Handle inodes which already have inline data 1st.
  1348. */
  1349. if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  1350. if (mmap_page == NULL &&
  1351. ocfs2_size_fits_inline_data(wc->w_di_bh, end))
  1352. goto do_inline_write;
  1353. /*
  1354. * The write won't fit - we have to give this inode an
  1355. * inline extent list now.
  1356. */
  1357. ret = ocfs2_convert_inline_data_to_extents(inode, wc->w_di_bh);
  1358. if (ret)
  1359. mlog_errno(ret);
  1360. goto out;
  1361. }
  1362. /*
  1363. * Check whether the inode can accept inline data.
  1364. */
  1365. if (oi->ip_clusters != 0 || i_size_read(inode) != 0)
  1366. return 0;
  1367. /*
  1368. * Check whether the write can fit.
  1369. */
  1370. di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1371. if (mmap_page ||
  1372. end > ocfs2_max_inline_data_with_xattr(inode->i_sb, di))
  1373. return 0;
  1374. do_inline_write:
  1375. ret = ocfs2_write_begin_inline(mapping, inode, wc);
  1376. if (ret) {
  1377. mlog_errno(ret);
  1378. goto out;
  1379. }
  1380. /*
  1381. * This signals to the caller that the data can be written
  1382. * inline.
  1383. */
  1384. written = 1;
  1385. out:
  1386. return written ? written : ret;
  1387. }
  1388. /*
  1389. * This function only does anything for file systems which can't
  1390. * handle sparse files.
  1391. *
  1392. * What we want to do here is fill in any hole between the current end
  1393. * of allocation and the end of our write. That way the rest of the
  1394. * write path can treat it as an non-allocating write, which has no
  1395. * special case code for sparse/nonsparse files.
  1396. */
  1397. static int ocfs2_expand_nonsparse_inode(struct inode *inode,
  1398. struct buffer_head *di_bh,
  1399. loff_t pos, unsigned len,
  1400. struct ocfs2_write_ctxt *wc)
  1401. {
  1402. int ret;
  1403. loff_t newsize = pos + len;
  1404. BUG_ON(ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb)));
  1405. if (newsize <= i_size_read(inode))
  1406. return 0;
  1407. ret = ocfs2_extend_no_holes(inode, di_bh, newsize, pos);
  1408. if (ret)
  1409. mlog_errno(ret);
  1410. wc->w_first_new_cpos =
  1411. ocfs2_clusters_for_bytes(inode->i_sb, i_size_read(inode));
  1412. return ret;
  1413. }
  1414. static int ocfs2_zero_tail(struct inode *inode, struct buffer_head *di_bh,
  1415. loff_t pos)
  1416. {
  1417. int ret = 0;
  1418. BUG_ON(!ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb)));
  1419. if (pos > i_size_read(inode))
  1420. ret = ocfs2_zero_extend(inode, di_bh, pos);
  1421. return ret;
  1422. }
  1423. /*
  1424. * Try to flush truncate logs if we can free enough clusters from it.
  1425. * As for return value, "< 0" means error, "0" no space and "1" means
  1426. * we have freed enough spaces and let the caller try to allocate again.
  1427. */
  1428. static int ocfs2_try_to_free_truncate_log(struct ocfs2_super *osb,
  1429. unsigned int needed)
  1430. {
  1431. tid_t target;
  1432. int ret = 0;
  1433. unsigned int truncated_clusters;
  1434. mutex_lock(&osb->osb_tl_inode->i_mutex);
  1435. truncated_clusters = osb->truncated_clusters;
  1436. mutex_unlock(&osb->osb_tl_inode->i_mutex);
  1437. /*
  1438. * Check whether we can succeed in allocating if we free
  1439. * the truncate log.
  1440. */
  1441. if (truncated_clusters < needed)
  1442. goto out;
  1443. ret = ocfs2_flush_truncate_log(osb);
  1444. if (ret) {
  1445. mlog_errno(ret);
  1446. goto out;
  1447. }
  1448. if (jbd2_journal_start_commit(osb->journal->j_journal, &target)) {
  1449. jbd2_log_wait_commit(osb->journal->j_journal, target);
  1450. ret = 1;
  1451. }
  1452. out:
  1453. return ret;
  1454. }
  1455. int ocfs2_write_begin_nolock(struct file *filp,
  1456. struct address_space *mapping,
  1457. loff_t pos, unsigned len, unsigned flags,
  1458. struct page **pagep, void **fsdata,
  1459. struct buffer_head *di_bh, struct page *mmap_page)
  1460. {
  1461. int ret, cluster_of_pages, credits = OCFS2_INODE_UPDATE_CREDITS;
  1462. unsigned int clusters_to_alloc, extents_to_split, clusters_need = 0;
  1463. struct ocfs2_write_ctxt *wc;
  1464. struct inode *inode = mapping->host;
  1465. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1466. struct ocfs2_dinode *di;
  1467. struct ocfs2_alloc_context *data_ac = NULL;
  1468. struct ocfs2_alloc_context *meta_ac = NULL;
  1469. handle_t *handle;
  1470. struct ocfs2_extent_tree et;
  1471. int try_free = 1, ret1;
  1472. try_again:
  1473. ret = ocfs2_alloc_write_ctxt(&wc, osb, pos, len, di_bh);
  1474. if (ret) {
  1475. mlog_errno(ret);
  1476. return ret;
  1477. }
  1478. if (ocfs2_supports_inline_data(osb)) {
  1479. ret = ocfs2_try_to_write_inline_data(mapping, inode, pos, len,
  1480. mmap_page, wc);
  1481. if (ret == 1) {
  1482. ret = 0;
  1483. goto success;
  1484. }
  1485. if (ret < 0) {
  1486. mlog_errno(ret);
  1487. goto out;
  1488. }
  1489. }
  1490. if (ocfs2_sparse_alloc(osb))
  1491. ret = ocfs2_zero_tail(inode, di_bh, pos);
  1492. else
  1493. ret = ocfs2_expand_nonsparse_inode(inode, di_bh, pos, len,
  1494. wc);
  1495. if (ret) {
  1496. mlog_errno(ret);
  1497. goto out;
  1498. }
  1499. ret = ocfs2_check_range_for_refcount(inode, pos, len);
  1500. if (ret < 0) {
  1501. mlog_errno(ret);
  1502. goto out;
  1503. } else if (ret == 1) {
  1504. clusters_need = wc->w_clen;
  1505. ret = ocfs2_refcount_cow(inode, filp, di_bh,
  1506. wc->w_cpos, wc->w_clen, UINT_MAX);
  1507. if (ret) {
  1508. mlog_errno(ret);
  1509. goto out;
  1510. }
  1511. }
  1512. ret = ocfs2_populate_write_desc(inode, wc, &clusters_to_alloc,
  1513. &extents_to_split);
  1514. if (ret) {
  1515. mlog_errno(ret);
  1516. goto out;
  1517. }
  1518. clusters_need += clusters_to_alloc;
  1519. di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1520. trace_ocfs2_write_begin_nolock(
  1521. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  1522. (long long)i_size_read(inode),
  1523. le32_to_cpu(di->i_clusters),
  1524. pos, len, flags, mmap_page,
  1525. clusters_to_alloc, extents_to_split);
  1526. /*
  1527. * We set w_target_from, w_target_to here so that
  1528. * ocfs2_write_end() knows which range in the target page to
  1529. * write out. An allocation requires that we write the entire
  1530. * cluster range.
  1531. */
  1532. if (clusters_to_alloc || extents_to_split) {
  1533. /*
  1534. * XXX: We are stretching the limits of
  1535. * ocfs2_lock_allocators(). It greatly over-estimates
  1536. * the work to be done.
  1537. */
  1538. ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode),
  1539. wc->w_di_bh);
  1540. ret = ocfs2_lock_allocators(inode, &et,
  1541. clusters_to_alloc, extents_to_split,
  1542. &data_ac, &meta_ac);
  1543. if (ret) {
  1544. mlog_errno(ret);
  1545. goto out;
  1546. }
  1547. if (data_ac)
  1548. data_ac->ac_resv = &OCFS2_I(inode)->ip_la_data_resv;
  1549. credits = ocfs2_calc_extend_credits(inode->i_sb,
  1550. &di->id2.i_list,
  1551. clusters_to_alloc);
  1552. }
  1553. /*
  1554. * We have to zero sparse allocated clusters, unwritten extent clusters,
  1555. * and non-sparse clusters we just extended. For non-sparse writes,
  1556. * we know zeros will only be needed in the first and/or last cluster.
  1557. */
  1558. if (clusters_to_alloc || extents_to_split ||
  1559. (wc->w_clen && (wc->w_desc[0].c_needs_zero ||
  1560. wc->w_desc[wc->w_clen - 1].c_needs_zero)))
  1561. cluster_of_pages = 1;
  1562. else
  1563. cluster_of_pages = 0;
  1564. ocfs2_set_target_boundaries(osb, wc, pos, len, cluster_of_pages);
  1565. handle = ocfs2_start_trans(osb, credits);
  1566. if (IS_ERR(handle)) {
  1567. ret = PTR_ERR(handle);
  1568. mlog_errno(ret);
  1569. goto out;
  1570. }
  1571. wc->w_handle = handle;
  1572. if (clusters_to_alloc) {
  1573. ret = dquot_alloc_space_nodirty(inode,
  1574. ocfs2_clusters_to_bytes(osb->sb, clusters_to_alloc));
  1575. if (ret)
  1576. goto out_commit;
  1577. }
  1578. /*
  1579. * We don't want this to fail in ocfs2_write_end(), so do it
  1580. * here.
  1581. */
  1582. ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), wc->w_di_bh,
  1583. OCFS2_JOURNAL_ACCESS_WRITE);
  1584. if (ret) {
  1585. mlog_errno(ret);
  1586. goto out_quota;
  1587. }
  1588. /*
  1589. * Fill our page array first. That way we've grabbed enough so
  1590. * that we can zero and flush if we error after adding the
  1591. * extent.
  1592. */
  1593. ret = ocfs2_grab_pages_for_write(mapping, wc, wc->w_cpos, pos, len,
  1594. cluster_of_pages, mmap_page);
  1595. if (ret && ret != -EAGAIN) {
  1596. mlog_errno(ret);
  1597. goto out_quota;
  1598. }
  1599. /*
  1600. * ocfs2_grab_pages_for_write() returns -EAGAIN if it could not lock
  1601. * the target page. In this case, we exit with no error and no target
  1602. * page. This will trigger the caller, page_mkwrite(), to re-try
  1603. * the operation.
  1604. */
  1605. if (ret == -EAGAIN) {
  1606. BUG_ON(wc->w_target_page);
  1607. ret = 0;
  1608. goto out_quota;
  1609. }
  1610. ret = ocfs2_write_cluster_by_desc(mapping, data_ac, meta_ac, wc, pos,
  1611. len);
  1612. if (ret) {
  1613. mlog_errno(ret);
  1614. goto out_quota;
  1615. }
  1616. if (data_ac)
  1617. ocfs2_free_alloc_context(data_ac);
  1618. if (meta_ac)
  1619. ocfs2_free_alloc_context(meta_ac);
  1620. success:
  1621. *pagep = wc->w_target_page;
  1622. *fsdata = wc;
  1623. return 0;
  1624. out_quota:
  1625. if (clusters_to_alloc)
  1626. dquot_free_space(inode,
  1627. ocfs2_clusters_to_bytes(osb->sb, clusters_to_alloc));
  1628. out_commit:
  1629. ocfs2_commit_trans(osb, handle);
  1630. out:
  1631. ocfs2_free_write_ctxt(wc);
  1632. if (data_ac)
  1633. ocfs2_free_alloc_context(data_ac);
  1634. if (meta_ac)
  1635. ocfs2_free_alloc_context(meta_ac);
  1636. if (ret == -ENOSPC && try_free) {
  1637. /*
  1638. * Try to free some truncate log so that we can have enough
  1639. * clusters to allocate.
  1640. */
  1641. try_free = 0;
  1642. ret1 = ocfs2_try_to_free_truncate_log(osb, clusters_need);
  1643. if (ret1 == 1)
  1644. goto try_again;
  1645. if (ret1 < 0)
  1646. mlog_errno(ret1);
  1647. }
  1648. return ret;
  1649. }
  1650. static int ocfs2_write_begin(struct file *file, struct address_space *mapping,
  1651. loff_t pos, unsigned len, unsigned flags,
  1652. struct page **pagep, void **fsdata)
  1653. {
  1654. int ret;
  1655. struct buffer_head *di_bh = NULL;
  1656. struct inode *inode = mapping->host;
  1657. ret = ocfs2_inode_lock(inode, &di_bh, 1);
  1658. if (ret) {
  1659. mlog_errno(ret);
  1660. return ret;
  1661. }
  1662. /*
  1663. * Take alloc sem here to prevent concurrent lookups. That way
  1664. * the mapping, zeroing and tree manipulation within
  1665. * ocfs2_write() will be safe against ->readpage(). This
  1666. * should also serve to lock out allocation from a shared
  1667. * writeable region.
  1668. */
  1669. down_write(&OCFS2_I(inode)->ip_alloc_sem);
  1670. ret = ocfs2_write_begin_nolock(file, mapping, pos, len, flags, pagep,
  1671. fsdata, di_bh, NULL);
  1672. if (ret) {
  1673. mlog_errno(ret);
  1674. goto out_fail;
  1675. }
  1676. brelse(di_bh);
  1677. return 0;
  1678. out_fail:
  1679. up_write(&OCFS2_I(inode)->ip_alloc_sem);
  1680. brelse(di_bh);
  1681. ocfs2_inode_unlock(inode, 1);
  1682. return ret;
  1683. }
  1684. static void ocfs2_write_end_inline(struct inode *inode, loff_t pos,
  1685. unsigned len, unsigned *copied,
  1686. struct ocfs2_dinode *di,
  1687. struct ocfs2_write_ctxt *wc)
  1688. {
  1689. void *kaddr;
  1690. if (unlikely(*copied < len)) {
  1691. if (!PageUptodate(wc->w_target_page)) {
  1692. *copied = 0;
  1693. return;
  1694. }
  1695. }
  1696. kaddr = kmap_atomic(wc->w_target_page);
  1697. memcpy(di->id2.i_data.id_data + pos, kaddr + pos, *copied);
  1698. kunmap_atomic(kaddr);
  1699. trace_ocfs2_write_end_inline(
  1700. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  1701. (unsigned long long)pos, *copied,
  1702. le16_to_cpu(di->id2.i_data.id_count),
  1703. le16_to_cpu(di->i_dyn_features));
  1704. }
  1705. int ocfs2_write_end_nolock(struct address_space *mapping,
  1706. loff_t pos, unsigned len, unsigned copied,
  1707. struct page *page, void *fsdata)
  1708. {
  1709. int i;
  1710. unsigned from, to, start = pos & (PAGE_CACHE_SIZE - 1);
  1711. struct inode *inode = mapping->host;
  1712. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1713. struct ocfs2_write_ctxt *wc = fsdata;
  1714. struct ocfs2_dinode *di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1715. handle_t *handle = wc->w_handle;
  1716. struct page *tmppage;
  1717. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  1718. ocfs2_write_end_inline(inode, pos, len, &copied, di, wc);
  1719. goto out_write_size;
  1720. }
  1721. if (unlikely(copied < len)) {
  1722. if (!PageUptodate(wc->w_target_page))
  1723. copied = 0;
  1724. ocfs2_zero_new_buffers(wc->w_target_page, start+copied,
  1725. start+len);
  1726. }
  1727. flush_dcache_page(wc->w_target_page);
  1728. for(i = 0; i < wc->w_num_pages; i++) {
  1729. tmppage = wc->w_pages[i];
  1730. if (tmppage == wc->w_target_page) {
  1731. from = wc->w_target_from;
  1732. to = wc->w_target_to;
  1733. BUG_ON(from > PAGE_CACHE_SIZE ||
  1734. to > PAGE_CACHE_SIZE ||
  1735. to < from);
  1736. } else {
  1737. /*
  1738. * Pages adjacent to the target (if any) imply
  1739. * a hole-filling write in which case we want
  1740. * to flush their entire range.
  1741. */
  1742. from = 0;
  1743. to = PAGE_CACHE_SIZE;
  1744. }
  1745. if (page_has_buffers(tmppage)) {
  1746. if (ocfs2_should_order_data(inode))
  1747. ocfs2_jbd2_file_inode(wc->w_handle, inode);
  1748. block_commit_write(tmppage, from, to);
  1749. }
  1750. }
  1751. out_write_size:
  1752. pos += copied;
  1753. if (pos > inode->i_size) {
  1754. i_size_write(inode, pos);
  1755. mark_inode_dirty(inode);
  1756. }
  1757. inode->i_blocks = ocfs2_inode_sector_count(inode);
  1758. di->i_size = cpu_to_le64((u64)i_size_read(inode));
  1759. inode->i_mtime = inode->i_ctime = CURRENT_TIME;
  1760. di->i_mtime = di->i_ctime = cpu_to_le64(inode->i_mtime.tv_sec);
  1761. di->i_mtime_nsec = di->i_ctime_nsec = cpu_to_le32(inode->i_mtime.tv_nsec);
  1762. ocfs2_journal_dirty(handle, wc->w_di_bh);
  1763. ocfs2_commit_trans(osb, handle);
  1764. ocfs2_run_deallocs(osb, &wc->w_dealloc);
  1765. ocfs2_free_write_ctxt(wc);
  1766. return copied;
  1767. }
  1768. static int ocfs2_write_end(struct file *file, struct address_space *mapping,
  1769. loff_t pos, unsigned len, unsigned copied,
  1770. struct page *page, void *fsdata)
  1771. {
  1772. int ret;
  1773. struct inode *inode = mapping->host;
  1774. ret = ocfs2_write_end_nolock(mapping, pos, len, copied, page, fsdata);
  1775. up_write(&OCFS2_I(inode)->ip_alloc_sem);
  1776. ocfs2_inode_unlock(inode, 1);
  1777. return ret;
  1778. }
  1779. const struct address_space_operations ocfs2_aops = {
  1780. .readpage = ocfs2_readpage,
  1781. .readpages = ocfs2_readpages,
  1782. .writepage = ocfs2_writepage,
  1783. .write_begin = ocfs2_write_begin,
  1784. .write_end = ocfs2_write_end,
  1785. .bmap = ocfs2_bmap,
  1786. .direct_IO = ocfs2_direct_IO,
  1787. .invalidatepage = ocfs2_invalidatepage,
  1788. .releasepage = ocfs2_releasepage,
  1789. .migratepage = buffer_migrate_page,
  1790. .is_partially_uptodate = block_is_partially_uptodate,
  1791. .error_remove_page = generic_error_remove_page,
  1792. };