file.c 65 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * file.c
  5. *
  6. * File open, close, extend, truncate
  7. *
  8. * Copyright (C) 2002, 2004 Oracle. All rights reserved.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2 of the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public
  21. * License along with this program; if not, write to the
  22. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  23. * Boston, MA 021110-1307, USA.
  24. */
  25. #include <linux/capability.h>
  26. #include <linux/fs.h>
  27. #include <linux/types.h>
  28. #include <linux/slab.h>
  29. #include <linux/highmem.h>
  30. #include <linux/pagemap.h>
  31. #include <linux/uio.h>
  32. #include <linux/sched.h>
  33. #include <linux/splice.h>
  34. #include <linux/mount.h>
  35. #include <linux/writeback.h>
  36. #include <linux/falloc.h>
  37. #include <linux/quotaops.h>
  38. #include <linux/blkdev.h>
  39. #define MLOG_MASK_PREFIX ML_INODE
  40. #include <cluster/masklog.h>
  41. #include "ocfs2.h"
  42. #include "alloc.h"
  43. #include "aops.h"
  44. #include "dir.h"
  45. #include "dlmglue.h"
  46. #include "extent_map.h"
  47. #include "file.h"
  48. #include "sysfile.h"
  49. #include "inode.h"
  50. #include "ioctl.h"
  51. #include "journal.h"
  52. #include "locks.h"
  53. #include "mmap.h"
  54. #include "suballoc.h"
  55. #include "super.h"
  56. #include "xattr.h"
  57. #include "acl.h"
  58. #include "quota.h"
  59. #include "refcounttree.h"
  60. #include "buffer_head_io.h"
  61. static int ocfs2_init_file_private(struct inode *inode, struct file *file)
  62. {
  63. struct ocfs2_file_private *fp;
  64. fp = kzalloc(sizeof(struct ocfs2_file_private), GFP_KERNEL);
  65. if (!fp)
  66. return -ENOMEM;
  67. fp->fp_file = file;
  68. mutex_init(&fp->fp_mutex);
  69. ocfs2_file_lock_res_init(&fp->fp_flock, fp);
  70. file->private_data = fp;
  71. return 0;
  72. }
  73. static void ocfs2_free_file_private(struct inode *inode, struct file *file)
  74. {
  75. struct ocfs2_file_private *fp = file->private_data;
  76. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  77. if (fp) {
  78. ocfs2_simple_drop_lockres(osb, &fp->fp_flock);
  79. ocfs2_lock_res_free(&fp->fp_flock);
  80. kfree(fp);
  81. file->private_data = NULL;
  82. }
  83. }
  84. static int ocfs2_file_open(struct inode *inode, struct file *file)
  85. {
  86. int status;
  87. int mode = file->f_flags;
  88. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  89. mlog_entry("(0x%p, 0x%p, '%.*s')\n", inode, file,
  90. file->f_path.dentry->d_name.len, file->f_path.dentry->d_name.name);
  91. if (file->f_mode & FMODE_WRITE)
  92. dquot_initialize(inode);
  93. spin_lock(&oi->ip_lock);
  94. /* Check that the inode hasn't been wiped from disk by another
  95. * node. If it hasn't then we're safe as long as we hold the
  96. * spin lock until our increment of open count. */
  97. if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_DELETED) {
  98. spin_unlock(&oi->ip_lock);
  99. status = -ENOENT;
  100. goto leave;
  101. }
  102. if (mode & O_DIRECT)
  103. oi->ip_flags |= OCFS2_INODE_OPEN_DIRECT;
  104. oi->ip_open_count++;
  105. spin_unlock(&oi->ip_lock);
  106. status = ocfs2_init_file_private(inode, file);
  107. if (status) {
  108. /*
  109. * We want to set open count back if we're failing the
  110. * open.
  111. */
  112. spin_lock(&oi->ip_lock);
  113. oi->ip_open_count--;
  114. spin_unlock(&oi->ip_lock);
  115. }
  116. leave:
  117. mlog_exit(status);
  118. return status;
  119. }
  120. static int ocfs2_file_release(struct inode *inode, struct file *file)
  121. {
  122. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  123. mlog_entry("(0x%p, 0x%p, '%.*s')\n", inode, file,
  124. file->f_path.dentry->d_name.len,
  125. file->f_path.dentry->d_name.name);
  126. spin_lock(&oi->ip_lock);
  127. if (!--oi->ip_open_count)
  128. oi->ip_flags &= ~OCFS2_INODE_OPEN_DIRECT;
  129. spin_unlock(&oi->ip_lock);
  130. ocfs2_free_file_private(inode, file);
  131. mlog_exit(0);
  132. return 0;
  133. }
  134. static int ocfs2_dir_open(struct inode *inode, struct file *file)
  135. {
  136. return ocfs2_init_file_private(inode, file);
  137. }
  138. static int ocfs2_dir_release(struct inode *inode, struct file *file)
  139. {
  140. ocfs2_free_file_private(inode, file);
  141. return 0;
  142. }
  143. static int ocfs2_sync_file(struct file *file, int datasync)
  144. {
  145. int err = 0;
  146. journal_t *journal;
  147. struct inode *inode = file->f_mapping->host;
  148. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  149. mlog_entry("(0x%p, %d, 0x%p, '%.*s')\n", file, datasync,
  150. file->f_path.dentry, file->f_path.dentry->d_name.len,
  151. file->f_path.dentry->d_name.name);
  152. if (datasync && !(inode->i_state & I_DIRTY_DATASYNC)) {
  153. /*
  154. * We still have to flush drive's caches to get data to the
  155. * platter
  156. */
  157. if (osb->s_mount_opt & OCFS2_MOUNT_BARRIER)
  158. blkdev_issue_flush(inode->i_sb->s_bdev, GFP_KERNEL, NULL);
  159. goto bail;
  160. }
  161. journal = osb->journal->j_journal;
  162. err = jbd2_journal_force_commit(journal);
  163. bail:
  164. mlog_exit(err);
  165. return (err < 0) ? -EIO : 0;
  166. }
  167. int ocfs2_should_update_atime(struct inode *inode,
  168. struct vfsmount *vfsmnt)
  169. {
  170. struct timespec now;
  171. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  172. if (ocfs2_is_hard_readonly(osb) || ocfs2_is_soft_readonly(osb))
  173. return 0;
  174. if ((inode->i_flags & S_NOATIME) ||
  175. ((inode->i_sb->s_flags & MS_NODIRATIME) && S_ISDIR(inode->i_mode)))
  176. return 0;
  177. /*
  178. * We can be called with no vfsmnt structure - NFSD will
  179. * sometimes do this.
  180. *
  181. * Note that our action here is different than touch_atime() -
  182. * if we can't tell whether this is a noatime mount, then we
  183. * don't know whether to trust the value of s_atime_quantum.
  184. */
  185. if (vfsmnt == NULL)
  186. return 0;
  187. if ((vfsmnt->mnt_flags & MNT_NOATIME) ||
  188. ((vfsmnt->mnt_flags & MNT_NODIRATIME) && S_ISDIR(inode->i_mode)))
  189. return 0;
  190. if (vfsmnt->mnt_flags & MNT_RELATIME) {
  191. if ((timespec_compare(&inode->i_atime, &inode->i_mtime) <= 0) ||
  192. (timespec_compare(&inode->i_atime, &inode->i_ctime) <= 0))
  193. return 1;
  194. return 0;
  195. }
  196. now = CURRENT_TIME;
  197. if ((now.tv_sec - inode->i_atime.tv_sec <= osb->s_atime_quantum))
  198. return 0;
  199. else
  200. return 1;
  201. }
  202. int ocfs2_update_inode_atime(struct inode *inode,
  203. struct buffer_head *bh)
  204. {
  205. int ret;
  206. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  207. handle_t *handle;
  208. struct ocfs2_dinode *di = (struct ocfs2_dinode *) bh->b_data;
  209. mlog_entry_void();
  210. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  211. if (IS_ERR(handle)) {
  212. ret = PTR_ERR(handle);
  213. mlog_errno(ret);
  214. goto out;
  215. }
  216. ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), bh,
  217. OCFS2_JOURNAL_ACCESS_WRITE);
  218. if (ret) {
  219. mlog_errno(ret);
  220. goto out_commit;
  221. }
  222. /*
  223. * Don't use ocfs2_mark_inode_dirty() here as we don't always
  224. * have i_mutex to guard against concurrent changes to other
  225. * inode fields.
  226. */
  227. inode->i_atime = CURRENT_TIME;
  228. di->i_atime = cpu_to_le64(inode->i_atime.tv_sec);
  229. di->i_atime_nsec = cpu_to_le32(inode->i_atime.tv_nsec);
  230. ocfs2_journal_dirty(handle, bh);
  231. out_commit:
  232. ocfs2_commit_trans(OCFS2_SB(inode->i_sb), handle);
  233. out:
  234. mlog_exit(ret);
  235. return ret;
  236. }
  237. static int ocfs2_set_inode_size(handle_t *handle,
  238. struct inode *inode,
  239. struct buffer_head *fe_bh,
  240. u64 new_i_size)
  241. {
  242. int status;
  243. mlog_entry_void();
  244. i_size_write(inode, new_i_size);
  245. inode->i_blocks = ocfs2_inode_sector_count(inode);
  246. inode->i_ctime = inode->i_mtime = CURRENT_TIME;
  247. status = ocfs2_mark_inode_dirty(handle, inode, fe_bh);
  248. if (status < 0) {
  249. mlog_errno(status);
  250. goto bail;
  251. }
  252. bail:
  253. mlog_exit(status);
  254. return status;
  255. }
  256. int ocfs2_simple_size_update(struct inode *inode,
  257. struct buffer_head *di_bh,
  258. u64 new_i_size)
  259. {
  260. int ret;
  261. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  262. handle_t *handle = NULL;
  263. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  264. if (IS_ERR(handle)) {
  265. ret = PTR_ERR(handle);
  266. mlog_errno(ret);
  267. goto out;
  268. }
  269. ret = ocfs2_set_inode_size(handle, inode, di_bh,
  270. new_i_size);
  271. if (ret < 0)
  272. mlog_errno(ret);
  273. ocfs2_commit_trans(osb, handle);
  274. out:
  275. return ret;
  276. }
  277. static int ocfs2_cow_file_pos(struct inode *inode,
  278. struct buffer_head *fe_bh,
  279. u64 offset)
  280. {
  281. int status;
  282. u32 phys, cpos = offset >> OCFS2_SB(inode->i_sb)->s_clustersize_bits;
  283. unsigned int num_clusters = 0;
  284. unsigned int ext_flags = 0;
  285. /*
  286. * If the new offset is aligned to the range of the cluster, there is
  287. * no space for ocfs2_zero_range_for_truncate to fill, so no need to
  288. * CoW either.
  289. */
  290. if ((offset & (OCFS2_SB(inode->i_sb)->s_clustersize - 1)) == 0)
  291. return 0;
  292. status = ocfs2_get_clusters(inode, cpos, &phys,
  293. &num_clusters, &ext_flags);
  294. if (status) {
  295. mlog_errno(status);
  296. goto out;
  297. }
  298. if (!(ext_flags & OCFS2_EXT_REFCOUNTED))
  299. goto out;
  300. return ocfs2_refcount_cow(inode, NULL, fe_bh, cpos, 1, cpos+1);
  301. out:
  302. return status;
  303. }
  304. static int ocfs2_orphan_for_truncate(struct ocfs2_super *osb,
  305. struct inode *inode,
  306. struct buffer_head *fe_bh,
  307. u64 new_i_size)
  308. {
  309. int status;
  310. handle_t *handle;
  311. struct ocfs2_dinode *di;
  312. u64 cluster_bytes;
  313. mlog_entry_void();
  314. /*
  315. * We need to CoW the cluster contains the offset if it is reflinked
  316. * since we will call ocfs2_zero_range_for_truncate later which will
  317. * write "0" from offset to the end of the cluster.
  318. */
  319. status = ocfs2_cow_file_pos(inode, fe_bh, new_i_size);
  320. if (status) {
  321. mlog_errno(status);
  322. return status;
  323. }
  324. /* TODO: This needs to actually orphan the inode in this
  325. * transaction. */
  326. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  327. if (IS_ERR(handle)) {
  328. status = PTR_ERR(handle);
  329. mlog_errno(status);
  330. goto out;
  331. }
  332. status = ocfs2_journal_access_di(handle, INODE_CACHE(inode), fe_bh,
  333. OCFS2_JOURNAL_ACCESS_WRITE);
  334. if (status < 0) {
  335. mlog_errno(status);
  336. goto out_commit;
  337. }
  338. /*
  339. * Do this before setting i_size.
  340. */
  341. cluster_bytes = ocfs2_align_bytes_to_clusters(inode->i_sb, new_i_size);
  342. status = ocfs2_zero_range_for_truncate(inode, handle, new_i_size,
  343. cluster_bytes);
  344. if (status) {
  345. mlog_errno(status);
  346. goto out_commit;
  347. }
  348. i_size_write(inode, new_i_size);
  349. inode->i_ctime = inode->i_mtime = CURRENT_TIME;
  350. di = (struct ocfs2_dinode *) fe_bh->b_data;
  351. di->i_size = cpu_to_le64(new_i_size);
  352. di->i_ctime = di->i_mtime = cpu_to_le64(inode->i_ctime.tv_sec);
  353. di->i_ctime_nsec = di->i_mtime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
  354. ocfs2_journal_dirty(handle, fe_bh);
  355. out_commit:
  356. ocfs2_commit_trans(osb, handle);
  357. out:
  358. mlog_exit(status);
  359. return status;
  360. }
  361. static int ocfs2_truncate_file(struct inode *inode,
  362. struct buffer_head *di_bh,
  363. u64 new_i_size)
  364. {
  365. int status = 0;
  366. struct ocfs2_dinode *fe = NULL;
  367. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  368. mlog_entry("(inode = %llu, new_i_size = %llu\n",
  369. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  370. (unsigned long long)new_i_size);
  371. /* We trust di_bh because it comes from ocfs2_inode_lock(), which
  372. * already validated it */
  373. fe = (struct ocfs2_dinode *) di_bh->b_data;
  374. mlog_bug_on_msg(le64_to_cpu(fe->i_size) != i_size_read(inode),
  375. "Inode %llu, inode i_size = %lld != di "
  376. "i_size = %llu, i_flags = 0x%x\n",
  377. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  378. i_size_read(inode),
  379. (unsigned long long)le64_to_cpu(fe->i_size),
  380. le32_to_cpu(fe->i_flags));
  381. if (new_i_size > le64_to_cpu(fe->i_size)) {
  382. mlog(0, "asked to truncate file with size (%llu) to size (%llu)!\n",
  383. (unsigned long long)le64_to_cpu(fe->i_size),
  384. (unsigned long long)new_i_size);
  385. status = -EINVAL;
  386. mlog_errno(status);
  387. goto bail;
  388. }
  389. mlog(0, "inode %llu, i_size = %llu, new_i_size = %llu\n",
  390. (unsigned long long)le64_to_cpu(fe->i_blkno),
  391. (unsigned long long)le64_to_cpu(fe->i_size),
  392. (unsigned long long)new_i_size);
  393. /* lets handle the simple truncate cases before doing any more
  394. * cluster locking. */
  395. if (new_i_size == le64_to_cpu(fe->i_size))
  396. goto bail;
  397. down_write(&OCFS2_I(inode)->ip_alloc_sem);
  398. ocfs2_resv_discard(&osb->osb_la_resmap,
  399. &OCFS2_I(inode)->ip_la_data_resv);
  400. /*
  401. * The inode lock forced other nodes to sync and drop their
  402. * pages, which (correctly) happens even if we have a truncate
  403. * without allocation change - ocfs2 cluster sizes can be much
  404. * greater than page size, so we have to truncate them
  405. * anyway.
  406. */
  407. unmap_mapping_range(inode->i_mapping, new_i_size + PAGE_SIZE - 1, 0, 1);
  408. truncate_inode_pages(inode->i_mapping, new_i_size);
  409. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  410. status = ocfs2_truncate_inline(inode, di_bh, new_i_size,
  411. i_size_read(inode), 1);
  412. if (status)
  413. mlog_errno(status);
  414. goto bail_unlock_sem;
  415. }
  416. /* alright, we're going to need to do a full blown alloc size
  417. * change. Orphan the inode so that recovery can complete the
  418. * truncate if necessary. This does the task of marking
  419. * i_size. */
  420. status = ocfs2_orphan_for_truncate(osb, inode, di_bh, new_i_size);
  421. if (status < 0) {
  422. mlog_errno(status);
  423. goto bail_unlock_sem;
  424. }
  425. status = ocfs2_commit_truncate(osb, inode, di_bh);
  426. if (status < 0) {
  427. mlog_errno(status);
  428. goto bail_unlock_sem;
  429. }
  430. /* TODO: orphan dir cleanup here. */
  431. bail_unlock_sem:
  432. up_write(&OCFS2_I(inode)->ip_alloc_sem);
  433. bail:
  434. if (!status && OCFS2_I(inode)->ip_clusters == 0)
  435. status = ocfs2_try_remove_refcount_tree(inode, di_bh);
  436. mlog_exit(status);
  437. return status;
  438. }
  439. /*
  440. * extend file allocation only here.
  441. * we'll update all the disk stuff, and oip->alloc_size
  442. *
  443. * expect stuff to be locked, a transaction started and enough data /
  444. * metadata reservations in the contexts.
  445. *
  446. * Will return -EAGAIN, and a reason if a restart is needed.
  447. * If passed in, *reason will always be set, even in error.
  448. */
  449. int ocfs2_add_inode_data(struct ocfs2_super *osb,
  450. struct inode *inode,
  451. u32 *logical_offset,
  452. u32 clusters_to_add,
  453. int mark_unwritten,
  454. struct buffer_head *fe_bh,
  455. handle_t *handle,
  456. struct ocfs2_alloc_context *data_ac,
  457. struct ocfs2_alloc_context *meta_ac,
  458. enum ocfs2_alloc_restarted *reason_ret)
  459. {
  460. int ret;
  461. struct ocfs2_extent_tree et;
  462. ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), fe_bh);
  463. ret = ocfs2_add_clusters_in_btree(handle, &et, logical_offset,
  464. clusters_to_add, mark_unwritten,
  465. data_ac, meta_ac, reason_ret);
  466. return ret;
  467. }
  468. static int __ocfs2_extend_allocation(struct inode *inode, u32 logical_start,
  469. u32 clusters_to_add, int mark_unwritten)
  470. {
  471. int status = 0;
  472. int restart_func = 0;
  473. int credits;
  474. u32 prev_clusters;
  475. struct buffer_head *bh = NULL;
  476. struct ocfs2_dinode *fe = NULL;
  477. handle_t *handle = NULL;
  478. struct ocfs2_alloc_context *data_ac = NULL;
  479. struct ocfs2_alloc_context *meta_ac = NULL;
  480. enum ocfs2_alloc_restarted why;
  481. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  482. struct ocfs2_extent_tree et;
  483. int did_quota = 0;
  484. mlog_entry("(clusters_to_add = %u)\n", clusters_to_add);
  485. /*
  486. * This function only exists for file systems which don't
  487. * support holes.
  488. */
  489. BUG_ON(mark_unwritten && !ocfs2_sparse_alloc(osb));
  490. status = ocfs2_read_inode_block(inode, &bh);
  491. if (status < 0) {
  492. mlog_errno(status);
  493. goto leave;
  494. }
  495. fe = (struct ocfs2_dinode *) bh->b_data;
  496. restart_all:
  497. BUG_ON(le32_to_cpu(fe->i_clusters) != OCFS2_I(inode)->ip_clusters);
  498. mlog(0, "extend inode %llu, i_size = %lld, di->i_clusters = %u, "
  499. "clusters_to_add = %u\n",
  500. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  501. (long long)i_size_read(inode), le32_to_cpu(fe->i_clusters),
  502. clusters_to_add);
  503. ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), bh);
  504. status = ocfs2_lock_allocators(inode, &et, clusters_to_add, 0,
  505. &data_ac, &meta_ac);
  506. if (status) {
  507. mlog_errno(status);
  508. goto leave;
  509. }
  510. credits = ocfs2_calc_extend_credits(osb->sb, &fe->id2.i_list,
  511. clusters_to_add);
  512. handle = ocfs2_start_trans(osb, credits);
  513. if (IS_ERR(handle)) {
  514. status = PTR_ERR(handle);
  515. handle = NULL;
  516. mlog_errno(status);
  517. goto leave;
  518. }
  519. restarted_transaction:
  520. status = dquot_alloc_space_nodirty(inode,
  521. ocfs2_clusters_to_bytes(osb->sb, clusters_to_add));
  522. if (status)
  523. goto leave;
  524. did_quota = 1;
  525. /* reserve a write to the file entry early on - that we if we
  526. * run out of credits in the allocation path, we can still
  527. * update i_size. */
  528. status = ocfs2_journal_access_di(handle, INODE_CACHE(inode), bh,
  529. OCFS2_JOURNAL_ACCESS_WRITE);
  530. if (status < 0) {
  531. mlog_errno(status);
  532. goto leave;
  533. }
  534. prev_clusters = OCFS2_I(inode)->ip_clusters;
  535. status = ocfs2_add_inode_data(osb,
  536. inode,
  537. &logical_start,
  538. clusters_to_add,
  539. mark_unwritten,
  540. bh,
  541. handle,
  542. data_ac,
  543. meta_ac,
  544. &why);
  545. if ((status < 0) && (status != -EAGAIN)) {
  546. if (status != -ENOSPC)
  547. mlog_errno(status);
  548. goto leave;
  549. }
  550. ocfs2_journal_dirty(handle, bh);
  551. spin_lock(&OCFS2_I(inode)->ip_lock);
  552. clusters_to_add -= (OCFS2_I(inode)->ip_clusters - prev_clusters);
  553. spin_unlock(&OCFS2_I(inode)->ip_lock);
  554. /* Release unused quota reservation */
  555. dquot_free_space(inode,
  556. ocfs2_clusters_to_bytes(osb->sb, clusters_to_add));
  557. did_quota = 0;
  558. if (why != RESTART_NONE && clusters_to_add) {
  559. if (why == RESTART_META) {
  560. mlog(0, "restarting function.\n");
  561. restart_func = 1;
  562. status = 0;
  563. } else {
  564. BUG_ON(why != RESTART_TRANS);
  565. mlog(0, "restarting transaction.\n");
  566. /* TODO: This can be more intelligent. */
  567. credits = ocfs2_calc_extend_credits(osb->sb,
  568. &fe->id2.i_list,
  569. clusters_to_add);
  570. status = ocfs2_extend_trans(handle, credits);
  571. if (status < 0) {
  572. /* handle still has to be committed at
  573. * this point. */
  574. status = -ENOMEM;
  575. mlog_errno(status);
  576. goto leave;
  577. }
  578. goto restarted_transaction;
  579. }
  580. }
  581. mlog(0, "fe: i_clusters = %u, i_size=%llu\n",
  582. le32_to_cpu(fe->i_clusters),
  583. (unsigned long long)le64_to_cpu(fe->i_size));
  584. mlog(0, "inode: ip_clusters=%u, i_size=%lld\n",
  585. OCFS2_I(inode)->ip_clusters, (long long)i_size_read(inode));
  586. leave:
  587. if (status < 0 && did_quota)
  588. dquot_free_space(inode,
  589. ocfs2_clusters_to_bytes(osb->sb, clusters_to_add));
  590. if (handle) {
  591. ocfs2_commit_trans(osb, handle);
  592. handle = NULL;
  593. }
  594. if (data_ac) {
  595. ocfs2_free_alloc_context(data_ac);
  596. data_ac = NULL;
  597. }
  598. if (meta_ac) {
  599. ocfs2_free_alloc_context(meta_ac);
  600. meta_ac = NULL;
  601. }
  602. if ((!status) && restart_func) {
  603. restart_func = 0;
  604. goto restart_all;
  605. }
  606. brelse(bh);
  607. bh = NULL;
  608. mlog_exit(status);
  609. return status;
  610. }
  611. /*
  612. * While a write will already be ordering the data, a truncate will not.
  613. * Thus, we need to explicitly order the zeroed pages.
  614. */
  615. static handle_t *ocfs2_zero_start_ordered_transaction(struct inode *inode)
  616. {
  617. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  618. handle_t *handle = NULL;
  619. int ret = 0;
  620. if (!ocfs2_should_order_data(inode))
  621. goto out;
  622. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  623. if (IS_ERR(handle)) {
  624. ret = -ENOMEM;
  625. mlog_errno(ret);
  626. goto out;
  627. }
  628. ret = ocfs2_jbd2_file_inode(handle, inode);
  629. if (ret < 0)
  630. mlog_errno(ret);
  631. out:
  632. if (ret) {
  633. if (!IS_ERR(handle))
  634. ocfs2_commit_trans(osb, handle);
  635. handle = ERR_PTR(ret);
  636. }
  637. return handle;
  638. }
  639. /* Some parts of this taken from generic_cont_expand, which turned out
  640. * to be too fragile to do exactly what we need without us having to
  641. * worry about recursive locking in ->write_begin() and ->write_end(). */
  642. static int ocfs2_write_zero_page(struct inode *inode, u64 abs_from,
  643. u64 abs_to)
  644. {
  645. struct address_space *mapping = inode->i_mapping;
  646. struct page *page;
  647. unsigned long index = abs_from >> PAGE_CACHE_SHIFT;
  648. handle_t *handle = NULL;
  649. int ret = 0;
  650. unsigned zero_from, zero_to, block_start, block_end;
  651. BUG_ON(abs_from >= abs_to);
  652. BUG_ON(abs_to > (((u64)index + 1) << PAGE_CACHE_SHIFT));
  653. BUG_ON(abs_from & (inode->i_blkbits - 1));
  654. page = find_or_create_page(mapping, index, GFP_NOFS);
  655. if (!page) {
  656. ret = -ENOMEM;
  657. mlog_errno(ret);
  658. goto out;
  659. }
  660. /* Get the offsets within the page that we want to zero */
  661. zero_from = abs_from & (PAGE_CACHE_SIZE - 1);
  662. zero_to = abs_to & (PAGE_CACHE_SIZE - 1);
  663. if (!zero_to)
  664. zero_to = PAGE_CACHE_SIZE;
  665. mlog(0,
  666. "abs_from = %llu, abs_to = %llu, index = %lu, zero_from = %u, zero_to = %u\n",
  667. (unsigned long long)abs_from, (unsigned long long)abs_to,
  668. index, zero_from, zero_to);
  669. /* We know that zero_from is block aligned */
  670. for (block_start = zero_from; block_start < zero_to;
  671. block_start = block_end) {
  672. block_end = block_start + (1 << inode->i_blkbits);
  673. /*
  674. * block_start is block-aligned. Bump it by one to force
  675. * __block_write_begin and block_commit_write to zero the
  676. * whole block.
  677. */
  678. ret = __block_write_begin(page, block_start + 1, 0,
  679. ocfs2_get_block);
  680. if (ret < 0) {
  681. mlog_errno(ret);
  682. goto out_unlock;
  683. }
  684. if (!handle) {
  685. handle = ocfs2_zero_start_ordered_transaction(inode);
  686. if (IS_ERR(handle)) {
  687. ret = PTR_ERR(handle);
  688. handle = NULL;
  689. break;
  690. }
  691. }
  692. /* must not update i_size! */
  693. ret = block_commit_write(page, block_start + 1,
  694. block_start + 1);
  695. if (ret < 0)
  696. mlog_errno(ret);
  697. else
  698. ret = 0;
  699. }
  700. if (handle)
  701. ocfs2_commit_trans(OCFS2_SB(inode->i_sb), handle);
  702. out_unlock:
  703. unlock_page(page);
  704. page_cache_release(page);
  705. out:
  706. return ret;
  707. }
  708. /*
  709. * Find the next range to zero. We do this in terms of bytes because
  710. * that's what ocfs2_zero_extend() wants, and it is dealing with the
  711. * pagecache. We may return multiple extents.
  712. *
  713. * zero_start and zero_end are ocfs2_zero_extend()s current idea of what
  714. * needs to be zeroed. range_start and range_end return the next zeroing
  715. * range. A subsequent call should pass the previous range_end as its
  716. * zero_start. If range_end is 0, there's nothing to do.
  717. *
  718. * Unwritten extents are skipped over. Refcounted extents are CoWd.
  719. */
  720. static int ocfs2_zero_extend_get_range(struct inode *inode,
  721. struct buffer_head *di_bh,
  722. u64 zero_start, u64 zero_end,
  723. u64 *range_start, u64 *range_end)
  724. {
  725. int rc = 0, needs_cow = 0;
  726. u32 p_cpos, zero_clusters = 0;
  727. u32 zero_cpos =
  728. zero_start >> OCFS2_SB(inode->i_sb)->s_clustersize_bits;
  729. u32 last_cpos = ocfs2_clusters_for_bytes(inode->i_sb, zero_end);
  730. unsigned int num_clusters = 0;
  731. unsigned int ext_flags = 0;
  732. while (zero_cpos < last_cpos) {
  733. rc = ocfs2_get_clusters(inode, zero_cpos, &p_cpos,
  734. &num_clusters, &ext_flags);
  735. if (rc) {
  736. mlog_errno(rc);
  737. goto out;
  738. }
  739. if (p_cpos && !(ext_flags & OCFS2_EXT_UNWRITTEN)) {
  740. zero_clusters = num_clusters;
  741. if (ext_flags & OCFS2_EXT_REFCOUNTED)
  742. needs_cow = 1;
  743. break;
  744. }
  745. zero_cpos += num_clusters;
  746. }
  747. if (!zero_clusters) {
  748. *range_end = 0;
  749. goto out;
  750. }
  751. while ((zero_cpos + zero_clusters) < last_cpos) {
  752. rc = ocfs2_get_clusters(inode, zero_cpos + zero_clusters,
  753. &p_cpos, &num_clusters,
  754. &ext_flags);
  755. if (rc) {
  756. mlog_errno(rc);
  757. goto out;
  758. }
  759. if (!p_cpos || (ext_flags & OCFS2_EXT_UNWRITTEN))
  760. break;
  761. if (ext_flags & OCFS2_EXT_REFCOUNTED)
  762. needs_cow = 1;
  763. zero_clusters += num_clusters;
  764. }
  765. if ((zero_cpos + zero_clusters) > last_cpos)
  766. zero_clusters = last_cpos - zero_cpos;
  767. if (needs_cow) {
  768. rc = ocfs2_refcount_cow(inode, NULL, di_bh, zero_cpos,
  769. zero_clusters, UINT_MAX);
  770. if (rc) {
  771. mlog_errno(rc);
  772. goto out;
  773. }
  774. }
  775. *range_start = ocfs2_clusters_to_bytes(inode->i_sb, zero_cpos);
  776. *range_end = ocfs2_clusters_to_bytes(inode->i_sb,
  777. zero_cpos + zero_clusters);
  778. out:
  779. return rc;
  780. }
  781. /*
  782. * Zero one range returned from ocfs2_zero_extend_get_range(). The caller
  783. * has made sure that the entire range needs zeroing.
  784. */
  785. static int ocfs2_zero_extend_range(struct inode *inode, u64 range_start,
  786. u64 range_end)
  787. {
  788. int rc = 0;
  789. u64 next_pos;
  790. u64 zero_pos = range_start;
  791. mlog(0, "range_start = %llu, range_end = %llu\n",
  792. (unsigned long long)range_start,
  793. (unsigned long long)range_end);
  794. BUG_ON(range_start >= range_end);
  795. while (zero_pos < range_end) {
  796. next_pos = (zero_pos & PAGE_CACHE_MASK) + PAGE_CACHE_SIZE;
  797. if (next_pos > range_end)
  798. next_pos = range_end;
  799. rc = ocfs2_write_zero_page(inode, zero_pos, next_pos);
  800. if (rc < 0) {
  801. mlog_errno(rc);
  802. break;
  803. }
  804. zero_pos = next_pos;
  805. /*
  806. * Very large extends have the potential to lock up
  807. * the cpu for extended periods of time.
  808. */
  809. cond_resched();
  810. }
  811. return rc;
  812. }
  813. int ocfs2_zero_extend(struct inode *inode, struct buffer_head *di_bh,
  814. loff_t zero_to_size)
  815. {
  816. int ret = 0;
  817. u64 zero_start, range_start = 0, range_end = 0;
  818. struct super_block *sb = inode->i_sb;
  819. zero_start = ocfs2_align_bytes_to_blocks(sb, i_size_read(inode));
  820. mlog(0, "zero_start %llu for i_size %llu\n",
  821. (unsigned long long)zero_start,
  822. (unsigned long long)i_size_read(inode));
  823. while (zero_start < zero_to_size) {
  824. ret = ocfs2_zero_extend_get_range(inode, di_bh, zero_start,
  825. zero_to_size,
  826. &range_start,
  827. &range_end);
  828. if (ret) {
  829. mlog_errno(ret);
  830. break;
  831. }
  832. if (!range_end)
  833. break;
  834. /* Trim the ends */
  835. if (range_start < zero_start)
  836. range_start = zero_start;
  837. if (range_end > zero_to_size)
  838. range_end = zero_to_size;
  839. ret = ocfs2_zero_extend_range(inode, range_start,
  840. range_end);
  841. if (ret) {
  842. mlog_errno(ret);
  843. break;
  844. }
  845. zero_start = range_end;
  846. }
  847. return ret;
  848. }
  849. int ocfs2_extend_no_holes(struct inode *inode, struct buffer_head *di_bh,
  850. u64 new_i_size, u64 zero_to)
  851. {
  852. int ret;
  853. u32 clusters_to_add;
  854. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  855. /*
  856. * Only quota files call this without a bh, and they can't be
  857. * refcounted.
  858. */
  859. BUG_ON(!di_bh && (oi->ip_dyn_features & OCFS2_HAS_REFCOUNT_FL));
  860. BUG_ON(!di_bh && !(oi->ip_flags & OCFS2_INODE_SYSTEM_FILE));
  861. clusters_to_add = ocfs2_clusters_for_bytes(inode->i_sb, new_i_size);
  862. if (clusters_to_add < oi->ip_clusters)
  863. clusters_to_add = 0;
  864. else
  865. clusters_to_add -= oi->ip_clusters;
  866. if (clusters_to_add) {
  867. ret = __ocfs2_extend_allocation(inode, oi->ip_clusters,
  868. clusters_to_add, 0);
  869. if (ret) {
  870. mlog_errno(ret);
  871. goto out;
  872. }
  873. }
  874. /*
  875. * Call this even if we don't add any clusters to the tree. We
  876. * still need to zero the area between the old i_size and the
  877. * new i_size.
  878. */
  879. ret = ocfs2_zero_extend(inode, di_bh, zero_to);
  880. if (ret < 0)
  881. mlog_errno(ret);
  882. out:
  883. return ret;
  884. }
  885. static int ocfs2_extend_file(struct inode *inode,
  886. struct buffer_head *di_bh,
  887. u64 new_i_size)
  888. {
  889. int ret = 0;
  890. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  891. BUG_ON(!di_bh);
  892. /* setattr sometimes calls us like this. */
  893. if (new_i_size == 0)
  894. goto out;
  895. if (i_size_read(inode) == new_i_size)
  896. goto out;
  897. BUG_ON(new_i_size < i_size_read(inode));
  898. /*
  899. * The alloc sem blocks people in read/write from reading our
  900. * allocation until we're done changing it. We depend on
  901. * i_mutex to block other extend/truncate calls while we're
  902. * here. We even have to hold it for sparse files because there
  903. * might be some tail zeroing.
  904. */
  905. down_write(&oi->ip_alloc_sem);
  906. if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  907. /*
  908. * We can optimize small extends by keeping the inodes
  909. * inline data.
  910. */
  911. if (ocfs2_size_fits_inline_data(di_bh, new_i_size)) {
  912. up_write(&oi->ip_alloc_sem);
  913. goto out_update_size;
  914. }
  915. ret = ocfs2_convert_inline_data_to_extents(inode, di_bh);
  916. if (ret) {
  917. up_write(&oi->ip_alloc_sem);
  918. mlog_errno(ret);
  919. goto out;
  920. }
  921. }
  922. if (ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb)))
  923. ret = ocfs2_zero_extend(inode, di_bh, new_i_size);
  924. else
  925. ret = ocfs2_extend_no_holes(inode, di_bh, new_i_size,
  926. new_i_size);
  927. up_write(&oi->ip_alloc_sem);
  928. if (ret < 0) {
  929. mlog_errno(ret);
  930. goto out;
  931. }
  932. out_update_size:
  933. ret = ocfs2_simple_size_update(inode, di_bh, new_i_size);
  934. if (ret < 0)
  935. mlog_errno(ret);
  936. out:
  937. return ret;
  938. }
  939. int ocfs2_setattr(struct dentry *dentry, struct iattr *attr)
  940. {
  941. int status = 0, size_change;
  942. struct inode *inode = dentry->d_inode;
  943. struct super_block *sb = inode->i_sb;
  944. struct ocfs2_super *osb = OCFS2_SB(sb);
  945. struct buffer_head *bh = NULL;
  946. handle_t *handle = NULL;
  947. struct dquot *transfer_to[MAXQUOTAS] = { };
  948. int qtype;
  949. mlog_entry("(0x%p, '%.*s')\n", dentry,
  950. dentry->d_name.len, dentry->d_name.name);
  951. /* ensuring we don't even attempt to truncate a symlink */
  952. if (S_ISLNK(inode->i_mode))
  953. attr->ia_valid &= ~ATTR_SIZE;
  954. if (attr->ia_valid & ATTR_MODE)
  955. mlog(0, "mode change: %d\n", attr->ia_mode);
  956. if (attr->ia_valid & ATTR_UID)
  957. mlog(0, "uid change: %d\n", attr->ia_uid);
  958. if (attr->ia_valid & ATTR_GID)
  959. mlog(0, "gid change: %d\n", attr->ia_gid);
  960. if (attr->ia_valid & ATTR_SIZE)
  961. mlog(0, "size change...\n");
  962. if (attr->ia_valid & (ATTR_ATIME | ATTR_MTIME | ATTR_CTIME))
  963. mlog(0, "time change...\n");
  964. #define OCFS2_VALID_ATTRS (ATTR_ATIME | ATTR_MTIME | ATTR_CTIME | ATTR_SIZE \
  965. | ATTR_GID | ATTR_UID | ATTR_MODE)
  966. if (!(attr->ia_valid & OCFS2_VALID_ATTRS)) {
  967. mlog(0, "can't handle attrs: 0x%x\n", attr->ia_valid);
  968. return 0;
  969. }
  970. status = inode_change_ok(inode, attr);
  971. if (status)
  972. return status;
  973. if (is_quota_modification(inode, attr))
  974. dquot_initialize(inode);
  975. size_change = S_ISREG(inode->i_mode) && attr->ia_valid & ATTR_SIZE;
  976. if (size_change) {
  977. status = ocfs2_rw_lock(inode, 1);
  978. if (status < 0) {
  979. mlog_errno(status);
  980. goto bail;
  981. }
  982. }
  983. status = ocfs2_inode_lock(inode, &bh, 1);
  984. if (status < 0) {
  985. if (status != -ENOENT)
  986. mlog_errno(status);
  987. goto bail_unlock_rw;
  988. }
  989. if (size_change && attr->ia_size != i_size_read(inode)) {
  990. status = inode_newsize_ok(inode, attr->ia_size);
  991. if (status)
  992. goto bail_unlock;
  993. if (i_size_read(inode) > attr->ia_size) {
  994. if (ocfs2_should_order_data(inode)) {
  995. status = ocfs2_begin_ordered_truncate(inode,
  996. attr->ia_size);
  997. if (status)
  998. goto bail_unlock;
  999. }
  1000. status = ocfs2_truncate_file(inode, bh, attr->ia_size);
  1001. } else
  1002. status = ocfs2_extend_file(inode, bh, attr->ia_size);
  1003. if (status < 0) {
  1004. if (status != -ENOSPC)
  1005. mlog_errno(status);
  1006. status = -ENOSPC;
  1007. goto bail_unlock;
  1008. }
  1009. }
  1010. if ((attr->ia_valid & ATTR_UID && attr->ia_uid != inode->i_uid) ||
  1011. (attr->ia_valid & ATTR_GID && attr->ia_gid != inode->i_gid)) {
  1012. /*
  1013. * Gather pointers to quota structures so that allocation /
  1014. * freeing of quota structures happens here and not inside
  1015. * dquot_transfer() where we have problems with lock ordering
  1016. */
  1017. if (attr->ia_valid & ATTR_UID && attr->ia_uid != inode->i_uid
  1018. && OCFS2_HAS_RO_COMPAT_FEATURE(sb,
  1019. OCFS2_FEATURE_RO_COMPAT_USRQUOTA)) {
  1020. transfer_to[USRQUOTA] = dqget(sb, attr->ia_uid,
  1021. USRQUOTA);
  1022. if (!transfer_to[USRQUOTA]) {
  1023. status = -ESRCH;
  1024. goto bail_unlock;
  1025. }
  1026. }
  1027. if (attr->ia_valid & ATTR_GID && attr->ia_gid != inode->i_gid
  1028. && OCFS2_HAS_RO_COMPAT_FEATURE(sb,
  1029. OCFS2_FEATURE_RO_COMPAT_GRPQUOTA)) {
  1030. transfer_to[GRPQUOTA] = dqget(sb, attr->ia_gid,
  1031. GRPQUOTA);
  1032. if (!transfer_to[GRPQUOTA]) {
  1033. status = -ESRCH;
  1034. goto bail_unlock;
  1035. }
  1036. }
  1037. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS +
  1038. 2 * ocfs2_quota_trans_credits(sb));
  1039. if (IS_ERR(handle)) {
  1040. status = PTR_ERR(handle);
  1041. mlog_errno(status);
  1042. goto bail_unlock;
  1043. }
  1044. status = __dquot_transfer(inode, transfer_to);
  1045. if (status < 0)
  1046. goto bail_commit;
  1047. } else {
  1048. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  1049. if (IS_ERR(handle)) {
  1050. status = PTR_ERR(handle);
  1051. mlog_errno(status);
  1052. goto bail_unlock;
  1053. }
  1054. }
  1055. /*
  1056. * This will intentionally not wind up calling truncate_setsize(),
  1057. * since all the work for a size change has been done above.
  1058. * Otherwise, we could get into problems with truncate as
  1059. * ip_alloc_sem is used there to protect against i_size
  1060. * changes.
  1061. *
  1062. * XXX: this means the conditional below can probably be removed.
  1063. */
  1064. if ((attr->ia_valid & ATTR_SIZE) &&
  1065. attr->ia_size != i_size_read(inode)) {
  1066. status = vmtruncate(inode, attr->ia_size);
  1067. if (status) {
  1068. mlog_errno(status);
  1069. goto bail_commit;
  1070. }
  1071. }
  1072. setattr_copy(inode, attr);
  1073. mark_inode_dirty(inode);
  1074. status = ocfs2_mark_inode_dirty(handle, inode, bh);
  1075. if (status < 0)
  1076. mlog_errno(status);
  1077. bail_commit:
  1078. ocfs2_commit_trans(osb, handle);
  1079. bail_unlock:
  1080. ocfs2_inode_unlock(inode, 1);
  1081. bail_unlock_rw:
  1082. if (size_change)
  1083. ocfs2_rw_unlock(inode, 1);
  1084. bail:
  1085. brelse(bh);
  1086. /* Release quota pointers in case we acquired them */
  1087. for (qtype = 0; qtype < MAXQUOTAS; qtype++)
  1088. dqput(transfer_to[qtype]);
  1089. if (!status && attr->ia_valid & ATTR_MODE) {
  1090. status = ocfs2_acl_chmod(inode);
  1091. if (status < 0)
  1092. mlog_errno(status);
  1093. }
  1094. mlog_exit(status);
  1095. return status;
  1096. }
  1097. int ocfs2_getattr(struct vfsmount *mnt,
  1098. struct dentry *dentry,
  1099. struct kstat *stat)
  1100. {
  1101. struct inode *inode = dentry->d_inode;
  1102. struct super_block *sb = dentry->d_inode->i_sb;
  1103. struct ocfs2_super *osb = sb->s_fs_info;
  1104. int err;
  1105. mlog_entry_void();
  1106. err = ocfs2_inode_revalidate(dentry);
  1107. if (err) {
  1108. if (err != -ENOENT)
  1109. mlog_errno(err);
  1110. goto bail;
  1111. }
  1112. generic_fillattr(inode, stat);
  1113. /* We set the blksize from the cluster size for performance */
  1114. stat->blksize = osb->s_clustersize;
  1115. bail:
  1116. mlog_exit(err);
  1117. return err;
  1118. }
  1119. int ocfs2_permission(struct inode *inode, int mask)
  1120. {
  1121. int ret;
  1122. mlog_entry_void();
  1123. ret = ocfs2_inode_lock(inode, NULL, 0);
  1124. if (ret) {
  1125. if (ret != -ENOENT)
  1126. mlog_errno(ret);
  1127. goto out;
  1128. }
  1129. ret = generic_permission(inode, mask, ocfs2_check_acl);
  1130. ocfs2_inode_unlock(inode, 0);
  1131. out:
  1132. mlog_exit(ret);
  1133. return ret;
  1134. }
  1135. static int __ocfs2_write_remove_suid(struct inode *inode,
  1136. struct buffer_head *bh)
  1137. {
  1138. int ret;
  1139. handle_t *handle;
  1140. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1141. struct ocfs2_dinode *di;
  1142. mlog_entry("(Inode %llu, mode 0%o)\n",
  1143. (unsigned long long)OCFS2_I(inode)->ip_blkno, inode->i_mode);
  1144. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  1145. if (IS_ERR(handle)) {
  1146. ret = PTR_ERR(handle);
  1147. mlog_errno(ret);
  1148. goto out;
  1149. }
  1150. ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), bh,
  1151. OCFS2_JOURNAL_ACCESS_WRITE);
  1152. if (ret < 0) {
  1153. mlog_errno(ret);
  1154. goto out_trans;
  1155. }
  1156. inode->i_mode &= ~S_ISUID;
  1157. if ((inode->i_mode & S_ISGID) && (inode->i_mode & S_IXGRP))
  1158. inode->i_mode &= ~S_ISGID;
  1159. di = (struct ocfs2_dinode *) bh->b_data;
  1160. di->i_mode = cpu_to_le16(inode->i_mode);
  1161. ocfs2_journal_dirty(handle, bh);
  1162. out_trans:
  1163. ocfs2_commit_trans(osb, handle);
  1164. out:
  1165. mlog_exit(ret);
  1166. return ret;
  1167. }
  1168. /*
  1169. * Will look for holes and unwritten extents in the range starting at
  1170. * pos for count bytes (inclusive).
  1171. */
  1172. static int ocfs2_check_range_for_holes(struct inode *inode, loff_t pos,
  1173. size_t count)
  1174. {
  1175. int ret = 0;
  1176. unsigned int extent_flags;
  1177. u32 cpos, clusters, extent_len, phys_cpos;
  1178. struct super_block *sb = inode->i_sb;
  1179. cpos = pos >> OCFS2_SB(sb)->s_clustersize_bits;
  1180. clusters = ocfs2_clusters_for_bytes(sb, pos + count) - cpos;
  1181. while (clusters) {
  1182. ret = ocfs2_get_clusters(inode, cpos, &phys_cpos, &extent_len,
  1183. &extent_flags);
  1184. if (ret < 0) {
  1185. mlog_errno(ret);
  1186. goto out;
  1187. }
  1188. if (phys_cpos == 0 || (extent_flags & OCFS2_EXT_UNWRITTEN)) {
  1189. ret = 1;
  1190. break;
  1191. }
  1192. if (extent_len > clusters)
  1193. extent_len = clusters;
  1194. clusters -= extent_len;
  1195. cpos += extent_len;
  1196. }
  1197. out:
  1198. return ret;
  1199. }
  1200. static int ocfs2_write_remove_suid(struct inode *inode)
  1201. {
  1202. int ret;
  1203. struct buffer_head *bh = NULL;
  1204. ret = ocfs2_read_inode_block(inode, &bh);
  1205. if (ret < 0) {
  1206. mlog_errno(ret);
  1207. goto out;
  1208. }
  1209. ret = __ocfs2_write_remove_suid(inode, bh);
  1210. out:
  1211. brelse(bh);
  1212. return ret;
  1213. }
  1214. /*
  1215. * Allocate enough extents to cover the region starting at byte offset
  1216. * start for len bytes. Existing extents are skipped, any extents
  1217. * added are marked as "unwritten".
  1218. */
  1219. static int ocfs2_allocate_unwritten_extents(struct inode *inode,
  1220. u64 start, u64 len)
  1221. {
  1222. int ret;
  1223. u32 cpos, phys_cpos, clusters, alloc_size;
  1224. u64 end = start + len;
  1225. struct buffer_head *di_bh = NULL;
  1226. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  1227. ret = ocfs2_read_inode_block(inode, &di_bh);
  1228. if (ret) {
  1229. mlog_errno(ret);
  1230. goto out;
  1231. }
  1232. /*
  1233. * Nothing to do if the requested reservation range
  1234. * fits within the inode.
  1235. */
  1236. if (ocfs2_size_fits_inline_data(di_bh, end))
  1237. goto out;
  1238. ret = ocfs2_convert_inline_data_to_extents(inode, di_bh);
  1239. if (ret) {
  1240. mlog_errno(ret);
  1241. goto out;
  1242. }
  1243. }
  1244. /*
  1245. * We consider both start and len to be inclusive.
  1246. */
  1247. cpos = start >> OCFS2_SB(inode->i_sb)->s_clustersize_bits;
  1248. clusters = ocfs2_clusters_for_bytes(inode->i_sb, start + len);
  1249. clusters -= cpos;
  1250. while (clusters) {
  1251. ret = ocfs2_get_clusters(inode, cpos, &phys_cpos,
  1252. &alloc_size, NULL);
  1253. if (ret) {
  1254. mlog_errno(ret);
  1255. goto out;
  1256. }
  1257. /*
  1258. * Hole or existing extent len can be arbitrary, so
  1259. * cap it to our own allocation request.
  1260. */
  1261. if (alloc_size > clusters)
  1262. alloc_size = clusters;
  1263. if (phys_cpos) {
  1264. /*
  1265. * We already have an allocation at this
  1266. * region so we can safely skip it.
  1267. */
  1268. goto next;
  1269. }
  1270. ret = __ocfs2_extend_allocation(inode, cpos, alloc_size, 1);
  1271. if (ret) {
  1272. if (ret != -ENOSPC)
  1273. mlog_errno(ret);
  1274. goto out;
  1275. }
  1276. next:
  1277. cpos += alloc_size;
  1278. clusters -= alloc_size;
  1279. }
  1280. ret = 0;
  1281. out:
  1282. brelse(di_bh);
  1283. return ret;
  1284. }
  1285. /*
  1286. * Truncate a byte range, avoiding pages within partial clusters. This
  1287. * preserves those pages for the zeroing code to write to.
  1288. */
  1289. static void ocfs2_truncate_cluster_pages(struct inode *inode, u64 byte_start,
  1290. u64 byte_len)
  1291. {
  1292. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1293. loff_t start, end;
  1294. struct address_space *mapping = inode->i_mapping;
  1295. start = (loff_t)ocfs2_align_bytes_to_clusters(inode->i_sb, byte_start);
  1296. end = byte_start + byte_len;
  1297. end = end & ~(osb->s_clustersize - 1);
  1298. if (start < end) {
  1299. unmap_mapping_range(mapping, start, end - start, 0);
  1300. truncate_inode_pages_range(mapping, start, end - 1);
  1301. }
  1302. }
  1303. static int ocfs2_zero_partial_clusters(struct inode *inode,
  1304. u64 start, u64 len)
  1305. {
  1306. int ret = 0;
  1307. u64 tmpend, end = start + len;
  1308. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1309. unsigned int csize = osb->s_clustersize;
  1310. handle_t *handle;
  1311. /*
  1312. * The "start" and "end" values are NOT necessarily part of
  1313. * the range whose allocation is being deleted. Rather, this
  1314. * is what the user passed in with the request. We must zero
  1315. * partial clusters here. There's no need to worry about
  1316. * physical allocation - the zeroing code knows to skip holes.
  1317. */
  1318. mlog(0, "byte start: %llu, end: %llu\n",
  1319. (unsigned long long)start, (unsigned long long)end);
  1320. /*
  1321. * If both edges are on a cluster boundary then there's no
  1322. * zeroing required as the region is part of the allocation to
  1323. * be truncated.
  1324. */
  1325. if ((start & (csize - 1)) == 0 && (end & (csize - 1)) == 0)
  1326. goto out;
  1327. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  1328. if (IS_ERR(handle)) {
  1329. ret = PTR_ERR(handle);
  1330. mlog_errno(ret);
  1331. goto out;
  1332. }
  1333. /*
  1334. * We want to get the byte offset of the end of the 1st cluster.
  1335. */
  1336. tmpend = (u64)osb->s_clustersize + (start & ~(osb->s_clustersize - 1));
  1337. if (tmpend > end)
  1338. tmpend = end;
  1339. mlog(0, "1st range: start: %llu, tmpend: %llu\n",
  1340. (unsigned long long)start, (unsigned long long)tmpend);
  1341. ret = ocfs2_zero_range_for_truncate(inode, handle, start, tmpend);
  1342. if (ret)
  1343. mlog_errno(ret);
  1344. if (tmpend < end) {
  1345. /*
  1346. * This may make start and end equal, but the zeroing
  1347. * code will skip any work in that case so there's no
  1348. * need to catch it up here.
  1349. */
  1350. start = end & ~(osb->s_clustersize - 1);
  1351. mlog(0, "2nd range: start: %llu, end: %llu\n",
  1352. (unsigned long long)start, (unsigned long long)end);
  1353. ret = ocfs2_zero_range_for_truncate(inode, handle, start, end);
  1354. if (ret)
  1355. mlog_errno(ret);
  1356. }
  1357. ocfs2_commit_trans(osb, handle);
  1358. out:
  1359. return ret;
  1360. }
  1361. static int ocfs2_find_rec(struct ocfs2_extent_list *el, u32 pos)
  1362. {
  1363. int i;
  1364. struct ocfs2_extent_rec *rec = NULL;
  1365. for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) {
  1366. rec = &el->l_recs[i];
  1367. if (le32_to_cpu(rec->e_cpos) < pos)
  1368. break;
  1369. }
  1370. return i;
  1371. }
  1372. /*
  1373. * Helper to calculate the punching pos and length in one run, we handle the
  1374. * following three cases in order:
  1375. *
  1376. * - remove the entire record
  1377. * - remove a partial record
  1378. * - no record needs to be removed (hole-punching completed)
  1379. */
  1380. static void ocfs2_calc_trunc_pos(struct inode *inode,
  1381. struct ocfs2_extent_list *el,
  1382. struct ocfs2_extent_rec *rec,
  1383. u32 trunc_start, u32 *trunc_cpos,
  1384. u32 *trunc_len, u32 *trunc_end,
  1385. u64 *blkno, int *done)
  1386. {
  1387. int ret = 0;
  1388. u32 coff, range;
  1389. range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec);
  1390. if (le32_to_cpu(rec->e_cpos) >= trunc_start) {
  1391. *trunc_cpos = le32_to_cpu(rec->e_cpos);
  1392. /*
  1393. * Skip holes if any.
  1394. */
  1395. if (range < *trunc_end)
  1396. *trunc_end = range;
  1397. *trunc_len = *trunc_end - le32_to_cpu(rec->e_cpos);
  1398. *blkno = le64_to_cpu(rec->e_blkno);
  1399. *trunc_end = le32_to_cpu(rec->e_cpos);
  1400. } else if (range > trunc_start) {
  1401. *trunc_cpos = trunc_start;
  1402. *trunc_len = *trunc_end - trunc_start;
  1403. coff = trunc_start - le32_to_cpu(rec->e_cpos);
  1404. *blkno = le64_to_cpu(rec->e_blkno) +
  1405. ocfs2_clusters_to_blocks(inode->i_sb, coff);
  1406. *trunc_end = trunc_start;
  1407. } else {
  1408. /*
  1409. * It may have two following possibilities:
  1410. *
  1411. * - last record has been removed
  1412. * - trunc_start was within a hole
  1413. *
  1414. * both two cases mean the completion of hole punching.
  1415. */
  1416. ret = 1;
  1417. }
  1418. *done = ret;
  1419. }
  1420. static int ocfs2_remove_inode_range(struct inode *inode,
  1421. struct buffer_head *di_bh, u64 byte_start,
  1422. u64 byte_len)
  1423. {
  1424. int ret = 0, flags = 0, done = 0, i;
  1425. u32 trunc_start, trunc_len, trunc_end, trunc_cpos, phys_cpos;
  1426. u32 cluster_in_el;
  1427. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1428. struct ocfs2_cached_dealloc_ctxt dealloc;
  1429. struct address_space *mapping = inode->i_mapping;
  1430. struct ocfs2_extent_tree et;
  1431. struct ocfs2_path *path = NULL;
  1432. struct ocfs2_extent_list *el = NULL;
  1433. struct ocfs2_extent_rec *rec = NULL;
  1434. struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
  1435. u64 blkno, refcount_loc = le64_to_cpu(di->i_refcount_loc);
  1436. ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh);
  1437. ocfs2_init_dealloc_ctxt(&dealloc);
  1438. if (byte_len == 0)
  1439. return 0;
  1440. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  1441. ret = ocfs2_truncate_inline(inode, di_bh, byte_start,
  1442. byte_start + byte_len, 0);
  1443. if (ret) {
  1444. mlog_errno(ret);
  1445. goto out;
  1446. }
  1447. /*
  1448. * There's no need to get fancy with the page cache
  1449. * truncate of an inline-data inode. We're talking
  1450. * about less than a page here, which will be cached
  1451. * in the dinode buffer anyway.
  1452. */
  1453. unmap_mapping_range(mapping, 0, 0, 0);
  1454. truncate_inode_pages(mapping, 0);
  1455. goto out;
  1456. }
  1457. /*
  1458. * For reflinks, we may need to CoW 2 clusters which might be
  1459. * partially zero'd later, if hole's start and end offset were
  1460. * within one cluster(means is not exactly aligned to clustersize).
  1461. */
  1462. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_HAS_REFCOUNT_FL) {
  1463. ret = ocfs2_cow_file_pos(inode, di_bh, byte_start);
  1464. if (ret) {
  1465. mlog_errno(ret);
  1466. goto out;
  1467. }
  1468. ret = ocfs2_cow_file_pos(inode, di_bh, byte_start + byte_len);
  1469. if (ret) {
  1470. mlog_errno(ret);
  1471. goto out;
  1472. }
  1473. }
  1474. trunc_start = ocfs2_clusters_for_bytes(osb->sb, byte_start);
  1475. trunc_end = (byte_start + byte_len) >> osb->s_clustersize_bits;
  1476. cluster_in_el = trunc_end;
  1477. mlog(0, "Inode: %llu, start: %llu, len: %llu, cstart: %u, cend: %u\n",
  1478. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  1479. (unsigned long long)byte_start,
  1480. (unsigned long long)byte_len, trunc_start, trunc_end);
  1481. ret = ocfs2_zero_partial_clusters(inode, byte_start, byte_len);
  1482. if (ret) {
  1483. mlog_errno(ret);
  1484. goto out;
  1485. }
  1486. path = ocfs2_new_path_from_et(&et);
  1487. if (!path) {
  1488. ret = -ENOMEM;
  1489. mlog_errno(ret);
  1490. goto out;
  1491. }
  1492. while (trunc_end > trunc_start) {
  1493. ret = ocfs2_find_path(INODE_CACHE(inode), path,
  1494. cluster_in_el);
  1495. if (ret) {
  1496. mlog_errno(ret);
  1497. goto out;
  1498. }
  1499. el = path_leaf_el(path);
  1500. i = ocfs2_find_rec(el, trunc_end);
  1501. /*
  1502. * Need to go to previous extent block.
  1503. */
  1504. if (i < 0) {
  1505. if (path->p_tree_depth == 0)
  1506. break;
  1507. ret = ocfs2_find_cpos_for_left_leaf(inode->i_sb,
  1508. path,
  1509. &cluster_in_el);
  1510. if (ret) {
  1511. mlog_errno(ret);
  1512. goto out;
  1513. }
  1514. /*
  1515. * We've reached the leftmost extent block,
  1516. * it's safe to leave.
  1517. */
  1518. if (cluster_in_el == 0)
  1519. break;
  1520. /*
  1521. * The 'pos' searched for previous extent block is
  1522. * always one cluster less than actual trunc_end.
  1523. */
  1524. trunc_end = cluster_in_el + 1;
  1525. ocfs2_reinit_path(path, 1);
  1526. continue;
  1527. } else
  1528. rec = &el->l_recs[i];
  1529. ocfs2_calc_trunc_pos(inode, el, rec, trunc_start, &trunc_cpos,
  1530. &trunc_len, &trunc_end, &blkno, &done);
  1531. if (done)
  1532. break;
  1533. flags = rec->e_flags;
  1534. phys_cpos = ocfs2_blocks_to_clusters(inode->i_sb, blkno);
  1535. ret = ocfs2_remove_btree_range(inode, &et, trunc_cpos,
  1536. phys_cpos, trunc_len, flags,
  1537. &dealloc, refcount_loc);
  1538. if (ret < 0) {
  1539. mlog_errno(ret);
  1540. goto out;
  1541. }
  1542. cluster_in_el = trunc_end;
  1543. ocfs2_reinit_path(path, 1);
  1544. }
  1545. ocfs2_truncate_cluster_pages(inode, byte_start, byte_len);
  1546. out:
  1547. ocfs2_schedule_truncate_log_flush(osb, 1);
  1548. ocfs2_run_deallocs(osb, &dealloc);
  1549. return ret;
  1550. }
  1551. /*
  1552. * Parts of this function taken from xfs_change_file_space()
  1553. */
  1554. static int __ocfs2_change_file_space(struct file *file, struct inode *inode,
  1555. loff_t f_pos, unsigned int cmd,
  1556. struct ocfs2_space_resv *sr,
  1557. int change_size)
  1558. {
  1559. int ret;
  1560. s64 llen;
  1561. loff_t size;
  1562. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1563. struct buffer_head *di_bh = NULL;
  1564. handle_t *handle;
  1565. unsigned long long max_off = inode->i_sb->s_maxbytes;
  1566. if (ocfs2_is_hard_readonly(osb) || ocfs2_is_soft_readonly(osb))
  1567. return -EROFS;
  1568. mutex_lock(&inode->i_mutex);
  1569. /*
  1570. * This prevents concurrent writes on other nodes
  1571. */
  1572. ret = ocfs2_rw_lock(inode, 1);
  1573. if (ret) {
  1574. mlog_errno(ret);
  1575. goto out;
  1576. }
  1577. ret = ocfs2_inode_lock(inode, &di_bh, 1);
  1578. if (ret) {
  1579. mlog_errno(ret);
  1580. goto out_rw_unlock;
  1581. }
  1582. if (inode->i_flags & (S_IMMUTABLE|S_APPEND)) {
  1583. ret = -EPERM;
  1584. goto out_inode_unlock;
  1585. }
  1586. switch (sr->l_whence) {
  1587. case 0: /*SEEK_SET*/
  1588. break;
  1589. case 1: /*SEEK_CUR*/
  1590. sr->l_start += f_pos;
  1591. break;
  1592. case 2: /*SEEK_END*/
  1593. sr->l_start += i_size_read(inode);
  1594. break;
  1595. default:
  1596. ret = -EINVAL;
  1597. goto out_inode_unlock;
  1598. }
  1599. sr->l_whence = 0;
  1600. llen = sr->l_len > 0 ? sr->l_len - 1 : sr->l_len;
  1601. if (sr->l_start < 0
  1602. || sr->l_start > max_off
  1603. || (sr->l_start + llen) < 0
  1604. || (sr->l_start + llen) > max_off) {
  1605. ret = -EINVAL;
  1606. goto out_inode_unlock;
  1607. }
  1608. size = sr->l_start + sr->l_len;
  1609. if (cmd == OCFS2_IOC_RESVSP || cmd == OCFS2_IOC_RESVSP64) {
  1610. if (sr->l_len <= 0) {
  1611. ret = -EINVAL;
  1612. goto out_inode_unlock;
  1613. }
  1614. }
  1615. if (file && should_remove_suid(file->f_path.dentry)) {
  1616. ret = __ocfs2_write_remove_suid(inode, di_bh);
  1617. if (ret) {
  1618. mlog_errno(ret);
  1619. goto out_inode_unlock;
  1620. }
  1621. }
  1622. down_write(&OCFS2_I(inode)->ip_alloc_sem);
  1623. switch (cmd) {
  1624. case OCFS2_IOC_RESVSP:
  1625. case OCFS2_IOC_RESVSP64:
  1626. /*
  1627. * This takes unsigned offsets, but the signed ones we
  1628. * pass have been checked against overflow above.
  1629. */
  1630. ret = ocfs2_allocate_unwritten_extents(inode, sr->l_start,
  1631. sr->l_len);
  1632. break;
  1633. case OCFS2_IOC_UNRESVSP:
  1634. case OCFS2_IOC_UNRESVSP64:
  1635. ret = ocfs2_remove_inode_range(inode, di_bh, sr->l_start,
  1636. sr->l_len);
  1637. break;
  1638. default:
  1639. ret = -EINVAL;
  1640. }
  1641. up_write(&OCFS2_I(inode)->ip_alloc_sem);
  1642. if (ret) {
  1643. mlog_errno(ret);
  1644. goto out_inode_unlock;
  1645. }
  1646. /*
  1647. * We update c/mtime for these changes
  1648. */
  1649. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  1650. if (IS_ERR(handle)) {
  1651. ret = PTR_ERR(handle);
  1652. mlog_errno(ret);
  1653. goto out_inode_unlock;
  1654. }
  1655. if (change_size && i_size_read(inode) < size)
  1656. i_size_write(inode, size);
  1657. inode->i_ctime = inode->i_mtime = CURRENT_TIME;
  1658. ret = ocfs2_mark_inode_dirty(handle, inode, di_bh);
  1659. if (ret < 0)
  1660. mlog_errno(ret);
  1661. ocfs2_commit_trans(osb, handle);
  1662. out_inode_unlock:
  1663. brelse(di_bh);
  1664. ocfs2_inode_unlock(inode, 1);
  1665. out_rw_unlock:
  1666. ocfs2_rw_unlock(inode, 1);
  1667. out:
  1668. mutex_unlock(&inode->i_mutex);
  1669. return ret;
  1670. }
  1671. int ocfs2_change_file_space(struct file *file, unsigned int cmd,
  1672. struct ocfs2_space_resv *sr)
  1673. {
  1674. struct inode *inode = file->f_path.dentry->d_inode;
  1675. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1676. if ((cmd == OCFS2_IOC_RESVSP || cmd == OCFS2_IOC_RESVSP64) &&
  1677. !ocfs2_writes_unwritten_extents(osb))
  1678. return -ENOTTY;
  1679. else if ((cmd == OCFS2_IOC_UNRESVSP || cmd == OCFS2_IOC_UNRESVSP64) &&
  1680. !ocfs2_sparse_alloc(osb))
  1681. return -ENOTTY;
  1682. if (!S_ISREG(inode->i_mode))
  1683. return -EINVAL;
  1684. if (!(file->f_mode & FMODE_WRITE))
  1685. return -EBADF;
  1686. return __ocfs2_change_file_space(file, inode, file->f_pos, cmd, sr, 0);
  1687. }
  1688. static long ocfs2_fallocate(struct inode *inode, int mode, loff_t offset,
  1689. loff_t len)
  1690. {
  1691. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1692. struct ocfs2_space_resv sr;
  1693. int change_size = 1;
  1694. if (!ocfs2_writes_unwritten_extents(osb))
  1695. return -EOPNOTSUPP;
  1696. if (S_ISDIR(inode->i_mode))
  1697. return -ENODEV;
  1698. if (mode & FALLOC_FL_KEEP_SIZE)
  1699. change_size = 0;
  1700. sr.l_whence = 0;
  1701. sr.l_start = (s64)offset;
  1702. sr.l_len = (s64)len;
  1703. return __ocfs2_change_file_space(NULL, inode, offset,
  1704. OCFS2_IOC_RESVSP64, &sr, change_size);
  1705. }
  1706. int ocfs2_check_range_for_refcount(struct inode *inode, loff_t pos,
  1707. size_t count)
  1708. {
  1709. int ret = 0;
  1710. unsigned int extent_flags;
  1711. u32 cpos, clusters, extent_len, phys_cpos;
  1712. struct super_block *sb = inode->i_sb;
  1713. if (!ocfs2_refcount_tree(OCFS2_SB(inode->i_sb)) ||
  1714. !(OCFS2_I(inode)->ip_dyn_features & OCFS2_HAS_REFCOUNT_FL) ||
  1715. OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
  1716. return 0;
  1717. cpos = pos >> OCFS2_SB(sb)->s_clustersize_bits;
  1718. clusters = ocfs2_clusters_for_bytes(sb, pos + count) - cpos;
  1719. while (clusters) {
  1720. ret = ocfs2_get_clusters(inode, cpos, &phys_cpos, &extent_len,
  1721. &extent_flags);
  1722. if (ret < 0) {
  1723. mlog_errno(ret);
  1724. goto out;
  1725. }
  1726. if (phys_cpos && (extent_flags & OCFS2_EXT_REFCOUNTED)) {
  1727. ret = 1;
  1728. break;
  1729. }
  1730. if (extent_len > clusters)
  1731. extent_len = clusters;
  1732. clusters -= extent_len;
  1733. cpos += extent_len;
  1734. }
  1735. out:
  1736. return ret;
  1737. }
  1738. static int ocfs2_prepare_inode_for_refcount(struct inode *inode,
  1739. struct file *file,
  1740. loff_t pos, size_t count,
  1741. int *meta_level)
  1742. {
  1743. int ret;
  1744. struct buffer_head *di_bh = NULL;
  1745. u32 cpos = pos >> OCFS2_SB(inode->i_sb)->s_clustersize_bits;
  1746. u32 clusters =
  1747. ocfs2_clusters_for_bytes(inode->i_sb, pos + count) - cpos;
  1748. ret = ocfs2_inode_lock(inode, &di_bh, 1);
  1749. if (ret) {
  1750. mlog_errno(ret);
  1751. goto out;
  1752. }
  1753. *meta_level = 1;
  1754. ret = ocfs2_refcount_cow(inode, file, di_bh, cpos, clusters, UINT_MAX);
  1755. if (ret)
  1756. mlog_errno(ret);
  1757. out:
  1758. brelse(di_bh);
  1759. return ret;
  1760. }
  1761. static int ocfs2_prepare_inode_for_write(struct file *file,
  1762. loff_t *ppos,
  1763. size_t count,
  1764. int appending,
  1765. int *direct_io,
  1766. int *has_refcount)
  1767. {
  1768. int ret = 0, meta_level = 0;
  1769. struct dentry *dentry = file->f_path.dentry;
  1770. struct inode *inode = dentry->d_inode;
  1771. loff_t saved_pos, end;
  1772. /*
  1773. * We start with a read level meta lock and only jump to an ex
  1774. * if we need to make modifications here.
  1775. */
  1776. for(;;) {
  1777. ret = ocfs2_inode_lock(inode, NULL, meta_level);
  1778. if (ret < 0) {
  1779. meta_level = -1;
  1780. mlog_errno(ret);
  1781. goto out;
  1782. }
  1783. /* Clear suid / sgid if necessary. We do this here
  1784. * instead of later in the write path because
  1785. * remove_suid() calls ->setattr without any hint that
  1786. * we may have already done our cluster locking. Since
  1787. * ocfs2_setattr() *must* take cluster locks to
  1788. * proceeed, this will lead us to recursively lock the
  1789. * inode. There's also the dinode i_size state which
  1790. * can be lost via setattr during extending writes (we
  1791. * set inode->i_size at the end of a write. */
  1792. if (should_remove_suid(dentry)) {
  1793. if (meta_level == 0) {
  1794. ocfs2_inode_unlock(inode, meta_level);
  1795. meta_level = 1;
  1796. continue;
  1797. }
  1798. ret = ocfs2_write_remove_suid(inode);
  1799. if (ret < 0) {
  1800. mlog_errno(ret);
  1801. goto out_unlock;
  1802. }
  1803. }
  1804. /* work on a copy of ppos until we're sure that we won't have
  1805. * to recalculate it due to relocking. */
  1806. if (appending) {
  1807. saved_pos = i_size_read(inode);
  1808. mlog(0, "O_APPEND: inode->i_size=%llu\n", saved_pos);
  1809. } else {
  1810. saved_pos = *ppos;
  1811. }
  1812. end = saved_pos + count;
  1813. ret = ocfs2_check_range_for_refcount(inode, saved_pos, count);
  1814. if (ret == 1) {
  1815. ocfs2_inode_unlock(inode, meta_level);
  1816. meta_level = -1;
  1817. ret = ocfs2_prepare_inode_for_refcount(inode,
  1818. file,
  1819. saved_pos,
  1820. count,
  1821. &meta_level);
  1822. if (has_refcount)
  1823. *has_refcount = 1;
  1824. if (direct_io)
  1825. *direct_io = 0;
  1826. }
  1827. if (ret < 0) {
  1828. mlog_errno(ret);
  1829. goto out_unlock;
  1830. }
  1831. /*
  1832. * Skip the O_DIRECT checks if we don't need
  1833. * them.
  1834. */
  1835. if (!direct_io || !(*direct_io))
  1836. break;
  1837. /*
  1838. * There's no sane way to do direct writes to an inode
  1839. * with inline data.
  1840. */
  1841. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  1842. *direct_io = 0;
  1843. break;
  1844. }
  1845. /*
  1846. * Allowing concurrent direct writes means
  1847. * i_size changes wouldn't be synchronized, so
  1848. * one node could wind up truncating another
  1849. * nodes writes.
  1850. */
  1851. if (end > i_size_read(inode)) {
  1852. *direct_io = 0;
  1853. break;
  1854. }
  1855. /*
  1856. * We don't fill holes during direct io, so
  1857. * check for them here. If any are found, the
  1858. * caller will have to retake some cluster
  1859. * locks and initiate the io as buffered.
  1860. */
  1861. ret = ocfs2_check_range_for_holes(inode, saved_pos, count);
  1862. if (ret == 1) {
  1863. *direct_io = 0;
  1864. ret = 0;
  1865. } else if (ret < 0)
  1866. mlog_errno(ret);
  1867. break;
  1868. }
  1869. if (appending)
  1870. *ppos = saved_pos;
  1871. out_unlock:
  1872. if (meta_level >= 0)
  1873. ocfs2_inode_unlock(inode, meta_level);
  1874. out:
  1875. return ret;
  1876. }
  1877. static ssize_t ocfs2_file_aio_write(struct kiocb *iocb,
  1878. const struct iovec *iov,
  1879. unsigned long nr_segs,
  1880. loff_t pos)
  1881. {
  1882. int ret, direct_io, appending, rw_level, have_alloc_sem = 0;
  1883. int can_do_direct, has_refcount = 0;
  1884. ssize_t written = 0;
  1885. size_t ocount; /* original count */
  1886. size_t count; /* after file limit checks */
  1887. loff_t old_size, *ppos = &iocb->ki_pos;
  1888. u32 old_clusters;
  1889. struct file *file = iocb->ki_filp;
  1890. struct inode *inode = file->f_path.dentry->d_inode;
  1891. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1892. int full_coherency = !(osb->s_mount_opt &
  1893. OCFS2_MOUNT_COHERENCY_BUFFERED);
  1894. mlog_entry("(0x%p, %u, '%.*s')\n", file,
  1895. (unsigned int)nr_segs,
  1896. file->f_path.dentry->d_name.len,
  1897. file->f_path.dentry->d_name.name);
  1898. if (iocb->ki_left == 0)
  1899. return 0;
  1900. vfs_check_frozen(inode->i_sb, SB_FREEZE_WRITE);
  1901. appending = file->f_flags & O_APPEND ? 1 : 0;
  1902. direct_io = file->f_flags & O_DIRECT ? 1 : 0;
  1903. mutex_lock(&inode->i_mutex);
  1904. ocfs2_iocb_clear_sem_locked(iocb);
  1905. relock:
  1906. /* to match setattr's i_mutex -> i_alloc_sem -> rw_lock ordering */
  1907. if (direct_io) {
  1908. down_read(&inode->i_alloc_sem);
  1909. have_alloc_sem = 1;
  1910. /* communicate with ocfs2_dio_end_io */
  1911. ocfs2_iocb_set_sem_locked(iocb);
  1912. }
  1913. /*
  1914. * Concurrent O_DIRECT writes are allowed with
  1915. * mount_option "coherency=buffered".
  1916. */
  1917. rw_level = (!direct_io || full_coherency);
  1918. ret = ocfs2_rw_lock(inode, rw_level);
  1919. if (ret < 0) {
  1920. mlog_errno(ret);
  1921. goto out_sems;
  1922. }
  1923. /*
  1924. * O_DIRECT writes with "coherency=full" need to take EX cluster
  1925. * inode_lock to guarantee coherency.
  1926. */
  1927. if (direct_io && full_coherency) {
  1928. /*
  1929. * We need to take and drop the inode lock to force
  1930. * other nodes to drop their caches. Buffered I/O
  1931. * already does this in write_begin().
  1932. */
  1933. ret = ocfs2_inode_lock(inode, NULL, 1);
  1934. if (ret < 0) {
  1935. mlog_errno(ret);
  1936. goto out_sems;
  1937. }
  1938. ocfs2_inode_unlock(inode, 1);
  1939. }
  1940. can_do_direct = direct_io;
  1941. ret = ocfs2_prepare_inode_for_write(file, ppos,
  1942. iocb->ki_left, appending,
  1943. &can_do_direct, &has_refcount);
  1944. if (ret < 0) {
  1945. mlog_errno(ret);
  1946. goto out;
  1947. }
  1948. /*
  1949. * We can't complete the direct I/O as requested, fall back to
  1950. * buffered I/O.
  1951. */
  1952. if (direct_io && !can_do_direct) {
  1953. ocfs2_rw_unlock(inode, rw_level);
  1954. up_read(&inode->i_alloc_sem);
  1955. have_alloc_sem = 0;
  1956. rw_level = -1;
  1957. direct_io = 0;
  1958. goto relock;
  1959. }
  1960. /*
  1961. * To later detect whether a journal commit for sync writes is
  1962. * necessary, we sample i_size, and cluster count here.
  1963. */
  1964. old_size = i_size_read(inode);
  1965. old_clusters = OCFS2_I(inode)->ip_clusters;
  1966. /* communicate with ocfs2_dio_end_io */
  1967. ocfs2_iocb_set_rw_locked(iocb, rw_level);
  1968. ret = generic_segment_checks(iov, &nr_segs, &ocount,
  1969. VERIFY_READ);
  1970. if (ret)
  1971. goto out_dio;
  1972. count = ocount;
  1973. ret = generic_write_checks(file, ppos, &count,
  1974. S_ISBLK(inode->i_mode));
  1975. if (ret)
  1976. goto out_dio;
  1977. if (direct_io) {
  1978. written = generic_file_direct_write(iocb, iov, &nr_segs, *ppos,
  1979. ppos, count, ocount);
  1980. if (written < 0) {
  1981. ret = written;
  1982. goto out_dio;
  1983. }
  1984. } else {
  1985. current->backing_dev_info = file->f_mapping->backing_dev_info;
  1986. written = generic_file_buffered_write(iocb, iov, nr_segs, *ppos,
  1987. ppos, count, 0);
  1988. current->backing_dev_info = NULL;
  1989. }
  1990. out_dio:
  1991. /* buffered aio wouldn't have proper lock coverage today */
  1992. BUG_ON(ret == -EIOCBQUEUED && !(file->f_flags & O_DIRECT));
  1993. if (((file->f_flags & O_DSYNC) && !direct_io) || IS_SYNC(inode) ||
  1994. ((file->f_flags & O_DIRECT) && !direct_io)) {
  1995. ret = filemap_fdatawrite_range(file->f_mapping, pos,
  1996. pos + count - 1);
  1997. if (ret < 0)
  1998. written = ret;
  1999. if (!ret && ((old_size != i_size_read(inode)) ||
  2000. (old_clusters != OCFS2_I(inode)->ip_clusters) ||
  2001. has_refcount)) {
  2002. ret = jbd2_journal_force_commit(osb->journal->j_journal);
  2003. if (ret < 0)
  2004. written = ret;
  2005. }
  2006. if (!ret)
  2007. ret = filemap_fdatawait_range(file->f_mapping, pos,
  2008. pos + count - 1);
  2009. }
  2010. /*
  2011. * deep in g_f_a_w_n()->ocfs2_direct_IO we pass in a ocfs2_dio_end_io
  2012. * function pointer which is called when o_direct io completes so that
  2013. * it can unlock our rw lock. (it's the clustered equivalent of
  2014. * i_alloc_sem; protects truncate from racing with pending ios).
  2015. * Unfortunately there are error cases which call end_io and others
  2016. * that don't. so we don't have to unlock the rw_lock if either an
  2017. * async dio is going to do it in the future or an end_io after an
  2018. * error has already done it.
  2019. */
  2020. if ((ret == -EIOCBQUEUED) || (!ocfs2_iocb_is_rw_locked(iocb))) {
  2021. rw_level = -1;
  2022. have_alloc_sem = 0;
  2023. }
  2024. out:
  2025. if (rw_level != -1)
  2026. ocfs2_rw_unlock(inode, rw_level);
  2027. out_sems:
  2028. if (have_alloc_sem) {
  2029. up_read(&inode->i_alloc_sem);
  2030. ocfs2_iocb_clear_sem_locked(iocb);
  2031. }
  2032. mutex_unlock(&inode->i_mutex);
  2033. if (written)
  2034. ret = written;
  2035. mlog_exit(ret);
  2036. return ret;
  2037. }
  2038. static int ocfs2_splice_to_file(struct pipe_inode_info *pipe,
  2039. struct file *out,
  2040. struct splice_desc *sd)
  2041. {
  2042. int ret;
  2043. ret = ocfs2_prepare_inode_for_write(out, &sd->pos,
  2044. sd->total_len, 0, NULL, NULL);
  2045. if (ret < 0) {
  2046. mlog_errno(ret);
  2047. return ret;
  2048. }
  2049. return splice_from_pipe_feed(pipe, sd, pipe_to_file);
  2050. }
  2051. static ssize_t ocfs2_file_splice_write(struct pipe_inode_info *pipe,
  2052. struct file *out,
  2053. loff_t *ppos,
  2054. size_t len,
  2055. unsigned int flags)
  2056. {
  2057. int ret;
  2058. struct address_space *mapping = out->f_mapping;
  2059. struct inode *inode = mapping->host;
  2060. struct splice_desc sd = {
  2061. .total_len = len,
  2062. .flags = flags,
  2063. .pos = *ppos,
  2064. .u.file = out,
  2065. };
  2066. mlog_entry("(0x%p, 0x%p, %u, '%.*s')\n", out, pipe,
  2067. (unsigned int)len,
  2068. out->f_path.dentry->d_name.len,
  2069. out->f_path.dentry->d_name.name);
  2070. if (pipe->inode)
  2071. mutex_lock_nested(&pipe->inode->i_mutex, I_MUTEX_PARENT);
  2072. splice_from_pipe_begin(&sd);
  2073. do {
  2074. ret = splice_from_pipe_next(pipe, &sd);
  2075. if (ret <= 0)
  2076. break;
  2077. mutex_lock_nested(&inode->i_mutex, I_MUTEX_CHILD);
  2078. ret = ocfs2_rw_lock(inode, 1);
  2079. if (ret < 0)
  2080. mlog_errno(ret);
  2081. else {
  2082. ret = ocfs2_splice_to_file(pipe, out, &sd);
  2083. ocfs2_rw_unlock(inode, 1);
  2084. }
  2085. mutex_unlock(&inode->i_mutex);
  2086. } while (ret > 0);
  2087. splice_from_pipe_end(pipe, &sd);
  2088. if (pipe->inode)
  2089. mutex_unlock(&pipe->inode->i_mutex);
  2090. if (sd.num_spliced)
  2091. ret = sd.num_spliced;
  2092. if (ret > 0) {
  2093. unsigned long nr_pages;
  2094. int err;
  2095. nr_pages = (ret + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
  2096. err = generic_write_sync(out, *ppos, ret);
  2097. if (err)
  2098. ret = err;
  2099. else
  2100. *ppos += ret;
  2101. balance_dirty_pages_ratelimited_nr(mapping, nr_pages);
  2102. }
  2103. mlog_exit(ret);
  2104. return ret;
  2105. }
  2106. static ssize_t ocfs2_file_splice_read(struct file *in,
  2107. loff_t *ppos,
  2108. struct pipe_inode_info *pipe,
  2109. size_t len,
  2110. unsigned int flags)
  2111. {
  2112. int ret = 0, lock_level = 0;
  2113. struct inode *inode = in->f_path.dentry->d_inode;
  2114. mlog_entry("(0x%p, 0x%p, %u, '%.*s')\n", in, pipe,
  2115. (unsigned int)len,
  2116. in->f_path.dentry->d_name.len,
  2117. in->f_path.dentry->d_name.name);
  2118. /*
  2119. * See the comment in ocfs2_file_aio_read()
  2120. */
  2121. ret = ocfs2_inode_lock_atime(inode, in->f_vfsmnt, &lock_level);
  2122. if (ret < 0) {
  2123. mlog_errno(ret);
  2124. goto bail;
  2125. }
  2126. ocfs2_inode_unlock(inode, lock_level);
  2127. ret = generic_file_splice_read(in, ppos, pipe, len, flags);
  2128. bail:
  2129. mlog_exit(ret);
  2130. return ret;
  2131. }
  2132. static ssize_t ocfs2_file_aio_read(struct kiocb *iocb,
  2133. const struct iovec *iov,
  2134. unsigned long nr_segs,
  2135. loff_t pos)
  2136. {
  2137. int ret = 0, rw_level = -1, have_alloc_sem = 0, lock_level = 0;
  2138. struct file *filp = iocb->ki_filp;
  2139. struct inode *inode = filp->f_path.dentry->d_inode;
  2140. mlog_entry("(0x%p, %u, '%.*s')\n", filp,
  2141. (unsigned int)nr_segs,
  2142. filp->f_path.dentry->d_name.len,
  2143. filp->f_path.dentry->d_name.name);
  2144. if (!inode) {
  2145. ret = -EINVAL;
  2146. mlog_errno(ret);
  2147. goto bail;
  2148. }
  2149. ocfs2_iocb_clear_sem_locked(iocb);
  2150. /*
  2151. * buffered reads protect themselves in ->readpage(). O_DIRECT reads
  2152. * need locks to protect pending reads from racing with truncate.
  2153. */
  2154. if (filp->f_flags & O_DIRECT) {
  2155. down_read(&inode->i_alloc_sem);
  2156. have_alloc_sem = 1;
  2157. ocfs2_iocb_set_sem_locked(iocb);
  2158. ret = ocfs2_rw_lock(inode, 0);
  2159. if (ret < 0) {
  2160. mlog_errno(ret);
  2161. goto bail;
  2162. }
  2163. rw_level = 0;
  2164. /* communicate with ocfs2_dio_end_io */
  2165. ocfs2_iocb_set_rw_locked(iocb, rw_level);
  2166. }
  2167. /*
  2168. * We're fine letting folks race truncates and extending
  2169. * writes with read across the cluster, just like they can
  2170. * locally. Hence no rw_lock during read.
  2171. *
  2172. * Take and drop the meta data lock to update inode fields
  2173. * like i_size. This allows the checks down below
  2174. * generic_file_aio_read() a chance of actually working.
  2175. */
  2176. ret = ocfs2_inode_lock_atime(inode, filp->f_vfsmnt, &lock_level);
  2177. if (ret < 0) {
  2178. mlog_errno(ret);
  2179. goto bail;
  2180. }
  2181. ocfs2_inode_unlock(inode, lock_level);
  2182. ret = generic_file_aio_read(iocb, iov, nr_segs, iocb->ki_pos);
  2183. if (ret == -EINVAL)
  2184. mlog(0, "generic_file_aio_read returned -EINVAL\n");
  2185. /* buffered aio wouldn't have proper lock coverage today */
  2186. BUG_ON(ret == -EIOCBQUEUED && !(filp->f_flags & O_DIRECT));
  2187. /* see ocfs2_file_aio_write */
  2188. if (ret == -EIOCBQUEUED || !ocfs2_iocb_is_rw_locked(iocb)) {
  2189. rw_level = -1;
  2190. have_alloc_sem = 0;
  2191. }
  2192. bail:
  2193. if (have_alloc_sem) {
  2194. up_read(&inode->i_alloc_sem);
  2195. ocfs2_iocb_clear_sem_locked(iocb);
  2196. }
  2197. if (rw_level != -1)
  2198. ocfs2_rw_unlock(inode, rw_level);
  2199. mlog_exit(ret);
  2200. return ret;
  2201. }
  2202. const struct inode_operations ocfs2_file_iops = {
  2203. .setattr = ocfs2_setattr,
  2204. .getattr = ocfs2_getattr,
  2205. .permission = ocfs2_permission,
  2206. .setxattr = generic_setxattr,
  2207. .getxattr = generic_getxattr,
  2208. .listxattr = ocfs2_listxattr,
  2209. .removexattr = generic_removexattr,
  2210. .fallocate = ocfs2_fallocate,
  2211. .fiemap = ocfs2_fiemap,
  2212. };
  2213. const struct inode_operations ocfs2_special_file_iops = {
  2214. .setattr = ocfs2_setattr,
  2215. .getattr = ocfs2_getattr,
  2216. .permission = ocfs2_permission,
  2217. };
  2218. /*
  2219. * Other than ->lock, keep ocfs2_fops and ocfs2_dops in sync with
  2220. * ocfs2_fops_no_plocks and ocfs2_dops_no_plocks!
  2221. */
  2222. const struct file_operations ocfs2_fops = {
  2223. .llseek = generic_file_llseek,
  2224. .read = do_sync_read,
  2225. .write = do_sync_write,
  2226. .mmap = ocfs2_mmap,
  2227. .fsync = ocfs2_sync_file,
  2228. .release = ocfs2_file_release,
  2229. .open = ocfs2_file_open,
  2230. .aio_read = ocfs2_file_aio_read,
  2231. .aio_write = ocfs2_file_aio_write,
  2232. .unlocked_ioctl = ocfs2_ioctl,
  2233. #ifdef CONFIG_COMPAT
  2234. .compat_ioctl = ocfs2_compat_ioctl,
  2235. #endif
  2236. .lock = ocfs2_lock,
  2237. .flock = ocfs2_flock,
  2238. .splice_read = ocfs2_file_splice_read,
  2239. .splice_write = ocfs2_file_splice_write,
  2240. };
  2241. const struct file_operations ocfs2_dops = {
  2242. .llseek = generic_file_llseek,
  2243. .read = generic_read_dir,
  2244. .readdir = ocfs2_readdir,
  2245. .fsync = ocfs2_sync_file,
  2246. .release = ocfs2_dir_release,
  2247. .open = ocfs2_dir_open,
  2248. .unlocked_ioctl = ocfs2_ioctl,
  2249. #ifdef CONFIG_COMPAT
  2250. .compat_ioctl = ocfs2_compat_ioctl,
  2251. #endif
  2252. .lock = ocfs2_lock,
  2253. .flock = ocfs2_flock,
  2254. };
  2255. /*
  2256. * POSIX-lockless variants of our file_operations.
  2257. *
  2258. * These will be used if the underlying cluster stack does not support
  2259. * posix file locking, if the user passes the "localflocks" mount
  2260. * option, or if we have a local-only fs.
  2261. *
  2262. * ocfs2_flock is in here because all stacks handle UNIX file locks,
  2263. * so we still want it in the case of no stack support for
  2264. * plocks. Internally, it will do the right thing when asked to ignore
  2265. * the cluster.
  2266. */
  2267. const struct file_operations ocfs2_fops_no_plocks = {
  2268. .llseek = generic_file_llseek,
  2269. .read = do_sync_read,
  2270. .write = do_sync_write,
  2271. .mmap = ocfs2_mmap,
  2272. .fsync = ocfs2_sync_file,
  2273. .release = ocfs2_file_release,
  2274. .open = ocfs2_file_open,
  2275. .aio_read = ocfs2_file_aio_read,
  2276. .aio_write = ocfs2_file_aio_write,
  2277. .unlocked_ioctl = ocfs2_ioctl,
  2278. #ifdef CONFIG_COMPAT
  2279. .compat_ioctl = ocfs2_compat_ioctl,
  2280. #endif
  2281. .flock = ocfs2_flock,
  2282. .splice_read = ocfs2_file_splice_read,
  2283. .splice_write = ocfs2_file_splice_write,
  2284. };
  2285. const struct file_operations ocfs2_dops_no_plocks = {
  2286. .llseek = generic_file_llseek,
  2287. .read = generic_read_dir,
  2288. .readdir = ocfs2_readdir,
  2289. .fsync = ocfs2_sync_file,
  2290. .release = ocfs2_dir_release,
  2291. .open = ocfs2_dir_open,
  2292. .unlocked_ioctl = ocfs2_ioctl,
  2293. #ifdef CONFIG_COMPAT
  2294. .compat_ioctl = ocfs2_compat_ioctl,
  2295. #endif
  2296. .flock = ocfs2_flock,
  2297. };