dquot.c 73 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719
  1. /*
  2. * Implementation of the diskquota system for the LINUX operating system. QUOTA
  3. * is implemented using the BSD system call interface as the means of
  4. * communication with the user level. This file contains the generic routines
  5. * called by the different filesystems on allocation of an inode or block.
  6. * These routines take care of the administration needed to have a consistent
  7. * diskquota tracking system. The ideas of both user and group quotas are based
  8. * on the Melbourne quota system as used on BSD derived systems. The internal
  9. * implementation is based on one of the several variants of the LINUX
  10. * inode-subsystem with added complexity of the diskquota system.
  11. *
  12. * Author: Marco van Wieringen <mvw@planets.elm.net>
  13. *
  14. * Fixes: Dmitry Gorodchanin <pgmdsg@ibi.com>, 11 Feb 96
  15. *
  16. * Revised list management to avoid races
  17. * -- Bill Hawes, <whawes@star.net>, 9/98
  18. *
  19. * Fixed races in dquot_transfer(), dqget() and dquot_alloc_...().
  20. * As the consequence the locking was moved from dquot_decr_...(),
  21. * dquot_incr_...() to calling functions.
  22. * invalidate_dquots() now writes modified dquots.
  23. * Serialized quota_off() and quota_on() for mount point.
  24. * Fixed a few bugs in grow_dquots().
  25. * Fixed deadlock in write_dquot() - we no longer account quotas on
  26. * quota files
  27. * remove_dquot_ref() moved to inode.c - it now traverses through inodes
  28. * add_dquot_ref() restarts after blocking
  29. * Added check for bogus uid and fixed check for group in quotactl.
  30. * Jan Kara, <jack@suse.cz>, sponsored by SuSE CR, 10-11/99
  31. *
  32. * Used struct list_head instead of own list struct
  33. * Invalidation of referenced dquots is no longer possible
  34. * Improved free_dquots list management
  35. * Quota and i_blocks are now updated in one place to avoid races
  36. * Warnings are now delayed so we won't block in critical section
  37. * Write updated not to require dquot lock
  38. * Jan Kara, <jack@suse.cz>, 9/2000
  39. *
  40. * Added dynamic quota structure allocation
  41. * Jan Kara <jack@suse.cz> 12/2000
  42. *
  43. * Rewritten quota interface. Implemented new quota format and
  44. * formats registering.
  45. * Jan Kara, <jack@suse.cz>, 2001,2002
  46. *
  47. * New SMP locking.
  48. * Jan Kara, <jack@suse.cz>, 10/2002
  49. *
  50. * Added journalled quota support, fix lock inversion problems
  51. * Jan Kara, <jack@suse.cz>, 2003,2004
  52. *
  53. * (C) Copyright 1994 - 1997 Marco van Wieringen
  54. */
  55. #include <linux/errno.h>
  56. #include <linux/kernel.h>
  57. #include <linux/fs.h>
  58. #include <linux/mount.h>
  59. #include <linux/mm.h>
  60. #include <linux/time.h>
  61. #include <linux/types.h>
  62. #include <linux/string.h>
  63. #include <linux/fcntl.h>
  64. #include <linux/stat.h>
  65. #include <linux/tty.h>
  66. #include <linux/file.h>
  67. #include <linux/slab.h>
  68. #include <linux/sysctl.h>
  69. #include <linux/init.h>
  70. #include <linux/module.h>
  71. #include <linux/proc_fs.h>
  72. #include <linux/security.h>
  73. #include <linux/sched.h>
  74. #include <linux/kmod.h>
  75. #include <linux/namei.h>
  76. #include <linux/capability.h>
  77. #include <linux/quotaops.h>
  78. #include "../internal.h" /* ugh */
  79. #include <linux/uaccess.h>
  80. /*
  81. * There are three quota SMP locks. dq_list_lock protects all lists with quotas
  82. * and quota formats.
  83. * dq_data_lock protects data from dq_dqb and also mem_dqinfo structures and
  84. * also guards consistency of dquot->dq_dqb with inode->i_blocks, i_bytes.
  85. * i_blocks and i_bytes updates itself are guarded by i_lock acquired directly
  86. * in inode_add_bytes() and inode_sub_bytes(). dq_state_lock protects
  87. * modifications of quota state (on quotaon and quotaoff) and readers who care
  88. * about latest values take it as well.
  89. *
  90. * The spinlock ordering is hence: dq_data_lock > dq_list_lock > i_lock,
  91. * dq_list_lock > dq_state_lock
  92. *
  93. * Note that some things (eg. sb pointer, type, id) doesn't change during
  94. * the life of the dquot structure and so needn't to be protected by a lock
  95. *
  96. * Any operation working on dquots via inode pointers must hold dqptr_sem. If
  97. * operation is just reading pointers from inode (or not using them at all) the
  98. * read lock is enough. If pointers are altered function must hold write lock.
  99. * Special care needs to be taken about S_NOQUOTA inode flag (marking that
  100. * inode is a quota file). Functions adding pointers from inode to dquots have
  101. * to check this flag under dqptr_sem and then (if S_NOQUOTA is not set) they
  102. * have to do all pointer modifications before dropping dqptr_sem. This makes
  103. * sure they cannot race with quotaon which first sets S_NOQUOTA flag and
  104. * then drops all pointers to dquots from an inode.
  105. *
  106. * Each dquot has its dq_lock mutex. Locked dquots might not be referenced
  107. * from inodes (dquot_alloc_space() and such don't check the dq_lock).
  108. * Currently dquot is locked only when it is being read to memory (or space for
  109. * it is being allocated) on the first dqget() and when it is being released on
  110. * the last dqput(). The allocation and release oparations are serialized by
  111. * the dq_lock and by checking the use count in dquot_release(). Write
  112. * operations on dquots don't hold dq_lock as they copy data under dq_data_lock
  113. * spinlock to internal buffers before writing.
  114. *
  115. * Lock ordering (including related VFS locks) is the following:
  116. * dqonoff_mutex > i_mutex > journal_lock > dqptr_sem > dquot->dq_lock >
  117. * dqio_mutex
  118. * dqonoff_mutex > i_mutex comes from dquot_quota_sync, dquot_enable, etc.
  119. * The lock ordering of dqptr_sem imposed by quota code is only dqonoff_sem >
  120. * dqptr_sem. But filesystem has to count with the fact that functions such as
  121. * dquot_alloc_space() acquire dqptr_sem and they usually have to be called
  122. * from inside a transaction to keep filesystem consistency after a crash. Also
  123. * filesystems usually want to do some IO on dquot from ->mark_dirty which is
  124. * called with dqptr_sem held.
  125. */
  126. static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dq_list_lock);
  127. static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dq_state_lock);
  128. __cacheline_aligned_in_smp DEFINE_SPINLOCK(dq_data_lock);
  129. EXPORT_SYMBOL(dq_data_lock);
  130. void __quota_error(struct super_block *sb, const char *func,
  131. const char *fmt, ...)
  132. {
  133. if (printk_ratelimit()) {
  134. va_list args;
  135. struct va_format vaf;
  136. va_start(args, fmt);
  137. vaf.fmt = fmt;
  138. vaf.va = &args;
  139. printk(KERN_ERR "Quota error (device %s): %s: %pV\n",
  140. sb->s_id, func, &vaf);
  141. va_end(args);
  142. }
  143. }
  144. EXPORT_SYMBOL(__quota_error);
  145. #if defined(CONFIG_QUOTA_DEBUG) || defined(CONFIG_PRINT_QUOTA_WARNING)
  146. static char *quotatypes[] = INITQFNAMES;
  147. #endif
  148. static struct quota_format_type *quota_formats; /* List of registered formats */
  149. static struct quota_module_name module_names[] = INIT_QUOTA_MODULE_NAMES;
  150. /* SLAB cache for dquot structures */
  151. static struct kmem_cache *dquot_cachep;
  152. int register_quota_format(struct quota_format_type *fmt)
  153. {
  154. spin_lock(&dq_list_lock);
  155. fmt->qf_next = quota_formats;
  156. quota_formats = fmt;
  157. spin_unlock(&dq_list_lock);
  158. return 0;
  159. }
  160. EXPORT_SYMBOL(register_quota_format);
  161. void unregister_quota_format(struct quota_format_type *fmt)
  162. {
  163. struct quota_format_type **actqf;
  164. spin_lock(&dq_list_lock);
  165. for (actqf = &quota_formats; *actqf && *actqf != fmt;
  166. actqf = &(*actqf)->qf_next)
  167. ;
  168. if (*actqf)
  169. *actqf = (*actqf)->qf_next;
  170. spin_unlock(&dq_list_lock);
  171. }
  172. EXPORT_SYMBOL(unregister_quota_format);
  173. static struct quota_format_type *find_quota_format(int id)
  174. {
  175. struct quota_format_type *actqf;
  176. spin_lock(&dq_list_lock);
  177. for (actqf = quota_formats; actqf && actqf->qf_fmt_id != id;
  178. actqf = actqf->qf_next)
  179. ;
  180. if (!actqf || !try_module_get(actqf->qf_owner)) {
  181. int qm;
  182. spin_unlock(&dq_list_lock);
  183. for (qm = 0; module_names[qm].qm_fmt_id &&
  184. module_names[qm].qm_fmt_id != id; qm++)
  185. ;
  186. if (!module_names[qm].qm_fmt_id ||
  187. request_module(module_names[qm].qm_mod_name))
  188. return NULL;
  189. spin_lock(&dq_list_lock);
  190. for (actqf = quota_formats; actqf && actqf->qf_fmt_id != id;
  191. actqf = actqf->qf_next)
  192. ;
  193. if (actqf && !try_module_get(actqf->qf_owner))
  194. actqf = NULL;
  195. }
  196. spin_unlock(&dq_list_lock);
  197. return actqf;
  198. }
  199. static void put_quota_format(struct quota_format_type *fmt)
  200. {
  201. module_put(fmt->qf_owner);
  202. }
  203. /*
  204. * Dquot List Management:
  205. * The quota code uses three lists for dquot management: the inuse_list,
  206. * free_dquots, and dquot_hash[] array. A single dquot structure may be
  207. * on all three lists, depending on its current state.
  208. *
  209. * All dquots are placed to the end of inuse_list when first created, and this
  210. * list is used for invalidate operation, which must look at every dquot.
  211. *
  212. * Unused dquots (dq_count == 0) are added to the free_dquots list when freed,
  213. * and this list is searched whenever we need an available dquot. Dquots are
  214. * removed from the list as soon as they are used again, and
  215. * dqstats.free_dquots gives the number of dquots on the list. When
  216. * dquot is invalidated it's completely released from memory.
  217. *
  218. * Dquots with a specific identity (device, type and id) are placed on
  219. * one of the dquot_hash[] hash chains. The provides an efficient search
  220. * mechanism to locate a specific dquot.
  221. */
  222. static LIST_HEAD(inuse_list);
  223. static LIST_HEAD(free_dquots);
  224. static unsigned int dq_hash_bits, dq_hash_mask;
  225. static struct hlist_head *dquot_hash;
  226. struct dqstats dqstats;
  227. EXPORT_SYMBOL(dqstats);
  228. static qsize_t inode_get_rsv_space(struct inode *inode);
  229. static void __dquot_initialize(struct inode *inode, int type);
  230. static inline unsigned int
  231. hashfn(const struct super_block *sb, unsigned int id, int type)
  232. {
  233. unsigned long tmp;
  234. tmp = (((unsigned long)sb>>L1_CACHE_SHIFT) ^ id) * (MAXQUOTAS - type);
  235. return (tmp + (tmp >> dq_hash_bits)) & dq_hash_mask;
  236. }
  237. /*
  238. * Following list functions expect dq_list_lock to be held
  239. */
  240. static inline void insert_dquot_hash(struct dquot *dquot)
  241. {
  242. struct hlist_head *head;
  243. head = dquot_hash + hashfn(dquot->dq_sb, from_kqid(&init_user_ns, dquot->dq_id), dquot->dq_id.type);
  244. hlist_add_head(&dquot->dq_hash, head);
  245. }
  246. static inline void remove_dquot_hash(struct dquot *dquot)
  247. {
  248. hlist_del_init(&dquot->dq_hash);
  249. }
  250. static struct dquot *find_dquot(unsigned int hashent, struct super_block *sb,
  251. unsigned int id, int type)
  252. {
  253. struct kqid qid = make_kqid(&init_user_ns, type, id);
  254. struct hlist_node *node;
  255. struct dquot *dquot;
  256. hlist_for_each (node, dquot_hash+hashent) {
  257. dquot = hlist_entry(node, struct dquot, dq_hash);
  258. if (dquot->dq_sb == sb && qid_eq(dquot->dq_id, qid))
  259. return dquot;
  260. }
  261. return NULL;
  262. }
  263. /* Add a dquot to the tail of the free list */
  264. static inline void put_dquot_last(struct dquot *dquot)
  265. {
  266. list_add_tail(&dquot->dq_free, &free_dquots);
  267. dqstats_inc(DQST_FREE_DQUOTS);
  268. }
  269. static inline void remove_free_dquot(struct dquot *dquot)
  270. {
  271. if (list_empty(&dquot->dq_free))
  272. return;
  273. list_del_init(&dquot->dq_free);
  274. dqstats_dec(DQST_FREE_DQUOTS);
  275. }
  276. static inline void put_inuse(struct dquot *dquot)
  277. {
  278. /* We add to the back of inuse list so we don't have to restart
  279. * when traversing this list and we block */
  280. list_add_tail(&dquot->dq_inuse, &inuse_list);
  281. dqstats_inc(DQST_ALLOC_DQUOTS);
  282. }
  283. static inline void remove_inuse(struct dquot *dquot)
  284. {
  285. dqstats_dec(DQST_ALLOC_DQUOTS);
  286. list_del(&dquot->dq_inuse);
  287. }
  288. /*
  289. * End of list functions needing dq_list_lock
  290. */
  291. static void wait_on_dquot(struct dquot *dquot)
  292. {
  293. mutex_lock(&dquot->dq_lock);
  294. mutex_unlock(&dquot->dq_lock);
  295. }
  296. static inline int dquot_dirty(struct dquot *dquot)
  297. {
  298. return test_bit(DQ_MOD_B, &dquot->dq_flags);
  299. }
  300. static inline int mark_dquot_dirty(struct dquot *dquot)
  301. {
  302. return dquot->dq_sb->dq_op->mark_dirty(dquot);
  303. }
  304. /* Mark dquot dirty in atomic manner, and return it's old dirty flag state */
  305. int dquot_mark_dquot_dirty(struct dquot *dquot)
  306. {
  307. int ret = 1;
  308. /* If quota is dirty already, we don't have to acquire dq_list_lock */
  309. if (test_bit(DQ_MOD_B, &dquot->dq_flags))
  310. return 1;
  311. spin_lock(&dq_list_lock);
  312. if (!test_and_set_bit(DQ_MOD_B, &dquot->dq_flags)) {
  313. list_add(&dquot->dq_dirty, &sb_dqopt(dquot->dq_sb)->
  314. info[dquot->dq_id.type].dqi_dirty_list);
  315. ret = 0;
  316. }
  317. spin_unlock(&dq_list_lock);
  318. return ret;
  319. }
  320. EXPORT_SYMBOL(dquot_mark_dquot_dirty);
  321. /* Dirtify all the dquots - this can block when journalling */
  322. static inline int mark_all_dquot_dirty(struct dquot * const *dquot)
  323. {
  324. int ret, err, cnt;
  325. ret = err = 0;
  326. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  327. if (dquot[cnt])
  328. /* Even in case of error we have to continue */
  329. ret = mark_dquot_dirty(dquot[cnt]);
  330. if (!err)
  331. err = ret;
  332. }
  333. return err;
  334. }
  335. static inline void dqput_all(struct dquot **dquot)
  336. {
  337. unsigned int cnt;
  338. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  339. dqput(dquot[cnt]);
  340. }
  341. /* This function needs dq_list_lock */
  342. static inline int clear_dquot_dirty(struct dquot *dquot)
  343. {
  344. if (!test_and_clear_bit(DQ_MOD_B, &dquot->dq_flags))
  345. return 0;
  346. list_del_init(&dquot->dq_dirty);
  347. return 1;
  348. }
  349. void mark_info_dirty(struct super_block *sb, int type)
  350. {
  351. set_bit(DQF_INFO_DIRTY_B, &sb_dqopt(sb)->info[type].dqi_flags);
  352. }
  353. EXPORT_SYMBOL(mark_info_dirty);
  354. /*
  355. * Read dquot from disk and alloc space for it
  356. */
  357. int dquot_acquire(struct dquot *dquot)
  358. {
  359. int ret = 0, ret2 = 0;
  360. struct quota_info *dqopt = sb_dqopt(dquot->dq_sb);
  361. mutex_lock(&dquot->dq_lock);
  362. mutex_lock(&dqopt->dqio_mutex);
  363. if (!test_bit(DQ_READ_B, &dquot->dq_flags))
  364. ret = dqopt->ops[dquot->dq_id.type]->read_dqblk(dquot);
  365. if (ret < 0)
  366. goto out_iolock;
  367. set_bit(DQ_READ_B, &dquot->dq_flags);
  368. /* Instantiate dquot if needed */
  369. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags) && !dquot->dq_off) {
  370. ret = dqopt->ops[dquot->dq_id.type]->commit_dqblk(dquot);
  371. /* Write the info if needed */
  372. if (info_dirty(&dqopt->info[dquot->dq_id.type])) {
  373. ret2 = dqopt->ops[dquot->dq_id.type]->write_file_info(
  374. dquot->dq_sb, dquot->dq_id.type);
  375. }
  376. if (ret < 0)
  377. goto out_iolock;
  378. if (ret2 < 0) {
  379. ret = ret2;
  380. goto out_iolock;
  381. }
  382. }
  383. set_bit(DQ_ACTIVE_B, &dquot->dq_flags);
  384. out_iolock:
  385. mutex_unlock(&dqopt->dqio_mutex);
  386. mutex_unlock(&dquot->dq_lock);
  387. return ret;
  388. }
  389. EXPORT_SYMBOL(dquot_acquire);
  390. /*
  391. * Write dquot to disk
  392. */
  393. int dquot_commit(struct dquot *dquot)
  394. {
  395. int ret = 0;
  396. struct quota_info *dqopt = sb_dqopt(dquot->dq_sb);
  397. mutex_lock(&dqopt->dqio_mutex);
  398. spin_lock(&dq_list_lock);
  399. if (!clear_dquot_dirty(dquot)) {
  400. spin_unlock(&dq_list_lock);
  401. goto out_sem;
  402. }
  403. spin_unlock(&dq_list_lock);
  404. /* Inactive dquot can be only if there was error during read/init
  405. * => we have better not writing it */
  406. if (test_bit(DQ_ACTIVE_B, &dquot->dq_flags))
  407. ret = dqopt->ops[dquot->dq_id.type]->commit_dqblk(dquot);
  408. else
  409. ret = -EIO;
  410. out_sem:
  411. mutex_unlock(&dqopt->dqio_mutex);
  412. return ret;
  413. }
  414. EXPORT_SYMBOL(dquot_commit);
  415. /*
  416. * Release dquot
  417. */
  418. int dquot_release(struct dquot *dquot)
  419. {
  420. int ret = 0, ret2 = 0;
  421. struct quota_info *dqopt = sb_dqopt(dquot->dq_sb);
  422. mutex_lock(&dquot->dq_lock);
  423. /* Check whether we are not racing with some other dqget() */
  424. if (atomic_read(&dquot->dq_count) > 1)
  425. goto out_dqlock;
  426. mutex_lock(&dqopt->dqio_mutex);
  427. if (dqopt->ops[dquot->dq_id.type]->release_dqblk) {
  428. ret = dqopt->ops[dquot->dq_id.type]->release_dqblk(dquot);
  429. /* Write the info */
  430. if (info_dirty(&dqopt->info[dquot->dq_id.type])) {
  431. ret2 = dqopt->ops[dquot->dq_id.type]->write_file_info(
  432. dquot->dq_sb, dquot->dq_id.type);
  433. }
  434. if (ret >= 0)
  435. ret = ret2;
  436. }
  437. clear_bit(DQ_ACTIVE_B, &dquot->dq_flags);
  438. mutex_unlock(&dqopt->dqio_mutex);
  439. out_dqlock:
  440. mutex_unlock(&dquot->dq_lock);
  441. return ret;
  442. }
  443. EXPORT_SYMBOL(dquot_release);
  444. void dquot_destroy(struct dquot *dquot)
  445. {
  446. kmem_cache_free(dquot_cachep, dquot);
  447. }
  448. EXPORT_SYMBOL(dquot_destroy);
  449. static inline void do_destroy_dquot(struct dquot *dquot)
  450. {
  451. dquot->dq_sb->dq_op->destroy_dquot(dquot);
  452. }
  453. /* Invalidate all dquots on the list. Note that this function is called after
  454. * quota is disabled and pointers from inodes removed so there cannot be new
  455. * quota users. There can still be some users of quotas due to inodes being
  456. * just deleted or pruned by prune_icache() (those are not attached to any
  457. * list) or parallel quotactl call. We have to wait for such users.
  458. */
  459. static void invalidate_dquots(struct super_block *sb, int type)
  460. {
  461. struct dquot *dquot, *tmp;
  462. restart:
  463. spin_lock(&dq_list_lock);
  464. list_for_each_entry_safe(dquot, tmp, &inuse_list, dq_inuse) {
  465. if (dquot->dq_sb != sb)
  466. continue;
  467. if (dquot->dq_id.type != type)
  468. continue;
  469. /* Wait for dquot users */
  470. if (atomic_read(&dquot->dq_count)) {
  471. DEFINE_WAIT(wait);
  472. atomic_inc(&dquot->dq_count);
  473. prepare_to_wait(&dquot->dq_wait_unused, &wait,
  474. TASK_UNINTERRUPTIBLE);
  475. spin_unlock(&dq_list_lock);
  476. /* Once dqput() wakes us up, we know it's time to free
  477. * the dquot.
  478. * IMPORTANT: we rely on the fact that there is always
  479. * at most one process waiting for dquot to free.
  480. * Otherwise dq_count would be > 1 and we would never
  481. * wake up.
  482. */
  483. if (atomic_read(&dquot->dq_count) > 1)
  484. schedule();
  485. finish_wait(&dquot->dq_wait_unused, &wait);
  486. dqput(dquot);
  487. /* At this moment dquot() need not exist (it could be
  488. * reclaimed by prune_dqcache(). Hence we must
  489. * restart. */
  490. goto restart;
  491. }
  492. /*
  493. * Quota now has no users and it has been written on last
  494. * dqput()
  495. */
  496. remove_dquot_hash(dquot);
  497. remove_free_dquot(dquot);
  498. remove_inuse(dquot);
  499. do_destroy_dquot(dquot);
  500. }
  501. spin_unlock(&dq_list_lock);
  502. }
  503. /* Call callback for every active dquot on given filesystem */
  504. int dquot_scan_active(struct super_block *sb,
  505. int (*fn)(struct dquot *dquot, unsigned long priv),
  506. unsigned long priv)
  507. {
  508. struct dquot *dquot, *old_dquot = NULL;
  509. int ret = 0;
  510. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  511. spin_lock(&dq_list_lock);
  512. list_for_each_entry(dquot, &inuse_list, dq_inuse) {
  513. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags))
  514. continue;
  515. if (dquot->dq_sb != sb)
  516. continue;
  517. /* Now we have active dquot so we can just increase use count */
  518. atomic_inc(&dquot->dq_count);
  519. spin_unlock(&dq_list_lock);
  520. dqstats_inc(DQST_LOOKUPS);
  521. dqput(old_dquot);
  522. old_dquot = dquot;
  523. ret = fn(dquot, priv);
  524. if (ret < 0)
  525. goto out;
  526. spin_lock(&dq_list_lock);
  527. /* We are safe to continue now because our dquot could not
  528. * be moved out of the inuse list while we hold the reference */
  529. }
  530. spin_unlock(&dq_list_lock);
  531. out:
  532. dqput(old_dquot);
  533. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  534. return ret;
  535. }
  536. EXPORT_SYMBOL(dquot_scan_active);
  537. /* Write all dquot structures to quota files */
  538. int dquot_writeback_dquots(struct super_block *sb, int type)
  539. {
  540. struct list_head *dirty;
  541. struct dquot *dquot;
  542. struct quota_info *dqopt = sb_dqopt(sb);
  543. int cnt;
  544. int err, ret = 0;
  545. mutex_lock(&dqopt->dqonoff_mutex);
  546. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  547. if (type != -1 && cnt != type)
  548. continue;
  549. if (!sb_has_quota_active(sb, cnt))
  550. continue;
  551. spin_lock(&dq_list_lock);
  552. dirty = &dqopt->info[cnt].dqi_dirty_list;
  553. while (!list_empty(dirty)) {
  554. dquot = list_first_entry(dirty, struct dquot,
  555. dq_dirty);
  556. /* Dirty and inactive can be only bad dquot... */
  557. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags)) {
  558. clear_dquot_dirty(dquot);
  559. continue;
  560. }
  561. /* Now we have active dquot from which someone is
  562. * holding reference so we can safely just increase
  563. * use count */
  564. atomic_inc(&dquot->dq_count);
  565. spin_unlock(&dq_list_lock);
  566. dqstats_inc(DQST_LOOKUPS);
  567. err = sb->dq_op->write_dquot(dquot);
  568. if (!ret && err)
  569. err = ret;
  570. dqput(dquot);
  571. spin_lock(&dq_list_lock);
  572. }
  573. spin_unlock(&dq_list_lock);
  574. }
  575. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  576. if ((cnt == type || type == -1) && sb_has_quota_active(sb, cnt)
  577. && info_dirty(&dqopt->info[cnt]))
  578. sb->dq_op->write_info(sb, cnt);
  579. dqstats_inc(DQST_SYNCS);
  580. mutex_unlock(&dqopt->dqonoff_mutex);
  581. return ret;
  582. }
  583. EXPORT_SYMBOL(dquot_writeback_dquots);
  584. /* Write all dquot structures to disk and make them visible from userspace */
  585. int dquot_quota_sync(struct super_block *sb, int type)
  586. {
  587. struct quota_info *dqopt = sb_dqopt(sb);
  588. int cnt;
  589. int ret;
  590. ret = dquot_writeback_dquots(sb, type);
  591. if (ret)
  592. return ret;
  593. if (dqopt->flags & DQUOT_QUOTA_SYS_FILE)
  594. return 0;
  595. /* This is not very clever (and fast) but currently I don't know about
  596. * any other simple way of getting quota data to disk and we must get
  597. * them there for userspace to be visible... */
  598. if (sb->s_op->sync_fs)
  599. sb->s_op->sync_fs(sb, 1);
  600. sync_blockdev(sb->s_bdev);
  601. /*
  602. * Now when everything is written we can discard the pagecache so
  603. * that userspace sees the changes.
  604. */
  605. mutex_lock(&dqopt->dqonoff_mutex);
  606. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  607. if (type != -1 && cnt != type)
  608. continue;
  609. if (!sb_has_quota_active(sb, cnt))
  610. continue;
  611. mutex_lock(&dqopt->files[cnt]->i_mutex);
  612. truncate_inode_pages(&dqopt->files[cnt]->i_data, 0);
  613. mutex_unlock(&dqopt->files[cnt]->i_mutex);
  614. }
  615. mutex_unlock(&dqopt->dqonoff_mutex);
  616. return 0;
  617. }
  618. EXPORT_SYMBOL(dquot_quota_sync);
  619. /* Free unused dquots from cache */
  620. static void prune_dqcache(int count)
  621. {
  622. struct list_head *head;
  623. struct dquot *dquot;
  624. head = free_dquots.prev;
  625. while (head != &free_dquots && count) {
  626. dquot = list_entry(head, struct dquot, dq_free);
  627. remove_dquot_hash(dquot);
  628. remove_free_dquot(dquot);
  629. remove_inuse(dquot);
  630. do_destroy_dquot(dquot);
  631. count--;
  632. head = free_dquots.prev;
  633. }
  634. }
  635. /*
  636. * This is called from kswapd when we think we need some
  637. * more memory
  638. */
  639. static int shrink_dqcache_memory(struct shrinker *shrink,
  640. struct shrink_control *sc)
  641. {
  642. int nr = sc->nr_to_scan;
  643. if (nr) {
  644. spin_lock(&dq_list_lock);
  645. prune_dqcache(nr);
  646. spin_unlock(&dq_list_lock);
  647. }
  648. return ((unsigned)
  649. percpu_counter_read_positive(&dqstats.counter[DQST_FREE_DQUOTS])
  650. /100) * sysctl_vfs_cache_pressure;
  651. }
  652. static struct shrinker dqcache_shrinker = {
  653. .shrink = shrink_dqcache_memory,
  654. .seeks = DEFAULT_SEEKS,
  655. };
  656. /*
  657. * Put reference to dquot
  658. * NOTE: If you change this function please check whether dqput_blocks() works right...
  659. */
  660. void dqput(struct dquot *dquot)
  661. {
  662. int ret;
  663. if (!dquot)
  664. return;
  665. #ifdef CONFIG_QUOTA_DEBUG
  666. if (!atomic_read(&dquot->dq_count)) {
  667. quota_error(dquot->dq_sb, "trying to free free dquot of %s %d",
  668. quotatypes[dquot->dq_id.type],
  669. from_kqid(&init_user_ns, dquot->dq_id));
  670. BUG();
  671. }
  672. #endif
  673. dqstats_inc(DQST_DROPS);
  674. we_slept:
  675. spin_lock(&dq_list_lock);
  676. if (atomic_read(&dquot->dq_count) > 1) {
  677. /* We have more than one user... nothing to do */
  678. atomic_dec(&dquot->dq_count);
  679. /* Releasing dquot during quotaoff phase? */
  680. if (!sb_has_quota_active(dquot->dq_sb, dquot->dq_id.type) &&
  681. atomic_read(&dquot->dq_count) == 1)
  682. wake_up(&dquot->dq_wait_unused);
  683. spin_unlock(&dq_list_lock);
  684. return;
  685. }
  686. /* Need to release dquot? */
  687. if (test_bit(DQ_ACTIVE_B, &dquot->dq_flags) && dquot_dirty(dquot)) {
  688. spin_unlock(&dq_list_lock);
  689. /* Commit dquot before releasing */
  690. ret = dquot->dq_sb->dq_op->write_dquot(dquot);
  691. if (ret < 0) {
  692. quota_error(dquot->dq_sb, "Can't write quota structure"
  693. " (error %d). Quota may get out of sync!",
  694. ret);
  695. /*
  696. * We clear dirty bit anyway, so that we avoid
  697. * infinite loop here
  698. */
  699. spin_lock(&dq_list_lock);
  700. clear_dquot_dirty(dquot);
  701. spin_unlock(&dq_list_lock);
  702. }
  703. goto we_slept;
  704. }
  705. /* Clear flag in case dquot was inactive (something bad happened) */
  706. clear_dquot_dirty(dquot);
  707. if (test_bit(DQ_ACTIVE_B, &dquot->dq_flags)) {
  708. spin_unlock(&dq_list_lock);
  709. dquot->dq_sb->dq_op->release_dquot(dquot);
  710. goto we_slept;
  711. }
  712. atomic_dec(&dquot->dq_count);
  713. #ifdef CONFIG_QUOTA_DEBUG
  714. /* sanity check */
  715. BUG_ON(!list_empty(&dquot->dq_free));
  716. #endif
  717. put_dquot_last(dquot);
  718. spin_unlock(&dq_list_lock);
  719. }
  720. EXPORT_SYMBOL(dqput);
  721. struct dquot *dquot_alloc(struct super_block *sb, int type)
  722. {
  723. return kmem_cache_zalloc(dquot_cachep, GFP_NOFS);
  724. }
  725. EXPORT_SYMBOL(dquot_alloc);
  726. static struct dquot *get_empty_dquot(struct super_block *sb, int type)
  727. {
  728. struct dquot *dquot;
  729. dquot = sb->dq_op->alloc_dquot(sb, type);
  730. if(!dquot)
  731. return NULL;
  732. mutex_init(&dquot->dq_lock);
  733. INIT_LIST_HEAD(&dquot->dq_free);
  734. INIT_LIST_HEAD(&dquot->dq_inuse);
  735. INIT_HLIST_NODE(&dquot->dq_hash);
  736. INIT_LIST_HEAD(&dquot->dq_dirty);
  737. init_waitqueue_head(&dquot->dq_wait_unused);
  738. dquot->dq_sb = sb;
  739. dquot->dq_id.type = type;
  740. atomic_set(&dquot->dq_count, 1);
  741. return dquot;
  742. }
  743. /*
  744. * Get reference to dquot
  745. *
  746. * Locking is slightly tricky here. We are guarded from parallel quotaoff()
  747. * destroying our dquot by:
  748. * a) checking for quota flags under dq_list_lock and
  749. * b) getting a reference to dquot before we release dq_list_lock
  750. */
  751. struct dquot *dqget(struct super_block *sb, struct kqid qid)
  752. {
  753. unsigned int type = qid.type;
  754. unsigned int id = from_kqid(&init_user_ns, qid);
  755. unsigned int hashent = hashfn(sb, id, type);
  756. struct dquot *dquot = NULL, *empty = NULL;
  757. if (!sb_has_quota_active(sb, type))
  758. return NULL;
  759. we_slept:
  760. spin_lock(&dq_list_lock);
  761. spin_lock(&dq_state_lock);
  762. if (!sb_has_quota_active(sb, type)) {
  763. spin_unlock(&dq_state_lock);
  764. spin_unlock(&dq_list_lock);
  765. goto out;
  766. }
  767. spin_unlock(&dq_state_lock);
  768. dquot = find_dquot(hashent, sb, id, type);
  769. if (!dquot) {
  770. if (!empty) {
  771. spin_unlock(&dq_list_lock);
  772. empty = get_empty_dquot(sb, type);
  773. if (!empty)
  774. schedule(); /* Try to wait for a moment... */
  775. goto we_slept;
  776. }
  777. dquot = empty;
  778. empty = NULL;
  779. dquot->dq_id = qid;
  780. /* all dquots go on the inuse_list */
  781. put_inuse(dquot);
  782. /* hash it first so it can be found */
  783. insert_dquot_hash(dquot);
  784. spin_unlock(&dq_list_lock);
  785. dqstats_inc(DQST_LOOKUPS);
  786. } else {
  787. if (!atomic_read(&dquot->dq_count))
  788. remove_free_dquot(dquot);
  789. atomic_inc(&dquot->dq_count);
  790. spin_unlock(&dq_list_lock);
  791. dqstats_inc(DQST_CACHE_HITS);
  792. dqstats_inc(DQST_LOOKUPS);
  793. }
  794. /* Wait for dq_lock - after this we know that either dquot_release() is
  795. * already finished or it will be canceled due to dq_count > 1 test */
  796. wait_on_dquot(dquot);
  797. /* Read the dquot / allocate space in quota file */
  798. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags) &&
  799. sb->dq_op->acquire_dquot(dquot) < 0) {
  800. dqput(dquot);
  801. dquot = NULL;
  802. goto out;
  803. }
  804. #ifdef CONFIG_QUOTA_DEBUG
  805. BUG_ON(!dquot->dq_sb); /* Has somebody invalidated entry under us? */
  806. #endif
  807. out:
  808. if (empty)
  809. do_destroy_dquot(empty);
  810. return dquot;
  811. }
  812. EXPORT_SYMBOL(dqget);
  813. static int dqinit_needed(struct inode *inode, int type)
  814. {
  815. int cnt;
  816. if (IS_NOQUOTA(inode))
  817. return 0;
  818. if (type != -1)
  819. return !inode->i_dquot[type];
  820. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  821. if (!inode->i_dquot[cnt])
  822. return 1;
  823. return 0;
  824. }
  825. /* This routine is guarded by dqonoff_mutex mutex */
  826. static void add_dquot_ref(struct super_block *sb, int type)
  827. {
  828. struct inode *inode, *old_inode = NULL;
  829. #ifdef CONFIG_QUOTA_DEBUG
  830. int reserved = 0;
  831. #endif
  832. spin_lock(&inode_sb_list_lock);
  833. list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
  834. spin_lock(&inode->i_lock);
  835. if ((inode->i_state & (I_FREEING|I_WILL_FREE|I_NEW)) ||
  836. !atomic_read(&inode->i_writecount) ||
  837. !dqinit_needed(inode, type)) {
  838. spin_unlock(&inode->i_lock);
  839. continue;
  840. }
  841. __iget(inode);
  842. spin_unlock(&inode->i_lock);
  843. spin_unlock(&inode_sb_list_lock);
  844. #ifdef CONFIG_QUOTA_DEBUG
  845. if (unlikely(inode_get_rsv_space(inode) > 0))
  846. reserved = 1;
  847. #endif
  848. iput(old_inode);
  849. __dquot_initialize(inode, type);
  850. /*
  851. * We hold a reference to 'inode' so it couldn't have been
  852. * removed from s_inodes list while we dropped the
  853. * inode_sb_list_lock We cannot iput the inode now as we can be
  854. * holding the last reference and we cannot iput it under
  855. * inode_sb_list_lock. So we keep the reference and iput it
  856. * later.
  857. */
  858. old_inode = inode;
  859. spin_lock(&inode_sb_list_lock);
  860. }
  861. spin_unlock(&inode_sb_list_lock);
  862. iput(old_inode);
  863. #ifdef CONFIG_QUOTA_DEBUG
  864. if (reserved) {
  865. quota_error(sb, "Writes happened before quota was turned on "
  866. "thus quota information is probably inconsistent. "
  867. "Please run quotacheck(8)");
  868. }
  869. #endif
  870. }
  871. /*
  872. * Return 0 if dqput() won't block.
  873. * (note that 1 doesn't necessarily mean blocking)
  874. */
  875. static inline int dqput_blocks(struct dquot *dquot)
  876. {
  877. if (atomic_read(&dquot->dq_count) <= 1)
  878. return 1;
  879. return 0;
  880. }
  881. /*
  882. * Remove references to dquots from inode and add dquot to list for freeing
  883. * if we have the last reference to dquot
  884. * We can't race with anybody because we hold dqptr_sem for writing...
  885. */
  886. static int remove_inode_dquot_ref(struct inode *inode, int type,
  887. struct list_head *tofree_head)
  888. {
  889. struct dquot *dquot = inode->i_dquot[type];
  890. inode->i_dquot[type] = NULL;
  891. if (dquot) {
  892. if (dqput_blocks(dquot)) {
  893. #ifdef CONFIG_QUOTA_DEBUG
  894. if (atomic_read(&dquot->dq_count) != 1)
  895. quota_error(inode->i_sb, "Adding dquot with "
  896. "dq_count %d to dispose list",
  897. atomic_read(&dquot->dq_count));
  898. #endif
  899. spin_lock(&dq_list_lock);
  900. /* As dquot must have currently users it can't be on
  901. * the free list... */
  902. list_add(&dquot->dq_free, tofree_head);
  903. spin_unlock(&dq_list_lock);
  904. return 1;
  905. }
  906. else
  907. dqput(dquot); /* We have guaranteed we won't block */
  908. }
  909. return 0;
  910. }
  911. /*
  912. * Free list of dquots
  913. * Dquots are removed from inodes and no new references can be got so we are
  914. * the only ones holding reference
  915. */
  916. static void put_dquot_list(struct list_head *tofree_head)
  917. {
  918. struct list_head *act_head;
  919. struct dquot *dquot;
  920. act_head = tofree_head->next;
  921. while (act_head != tofree_head) {
  922. dquot = list_entry(act_head, struct dquot, dq_free);
  923. act_head = act_head->next;
  924. /* Remove dquot from the list so we won't have problems... */
  925. list_del_init(&dquot->dq_free);
  926. dqput(dquot);
  927. }
  928. }
  929. static void remove_dquot_ref(struct super_block *sb, int type,
  930. struct list_head *tofree_head)
  931. {
  932. struct inode *inode;
  933. int reserved = 0;
  934. spin_lock(&inode_sb_list_lock);
  935. list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
  936. /*
  937. * We have to scan also I_NEW inodes because they can already
  938. * have quota pointer initialized. Luckily, we need to touch
  939. * only quota pointers and these have separate locking
  940. * (dqptr_sem).
  941. */
  942. if (!IS_NOQUOTA(inode)) {
  943. if (unlikely(inode_get_rsv_space(inode) > 0))
  944. reserved = 1;
  945. remove_inode_dquot_ref(inode, type, tofree_head);
  946. }
  947. }
  948. spin_unlock(&inode_sb_list_lock);
  949. #ifdef CONFIG_QUOTA_DEBUG
  950. if (reserved) {
  951. printk(KERN_WARNING "VFS (%s): Writes happened after quota"
  952. " was disabled thus quota information is probably "
  953. "inconsistent. Please run quotacheck(8).\n", sb->s_id);
  954. }
  955. #endif
  956. }
  957. /* Gather all references from inodes and drop them */
  958. static void drop_dquot_ref(struct super_block *sb, int type)
  959. {
  960. LIST_HEAD(tofree_head);
  961. if (sb->dq_op) {
  962. down_write(&sb_dqopt(sb)->dqptr_sem);
  963. remove_dquot_ref(sb, type, &tofree_head);
  964. up_write(&sb_dqopt(sb)->dqptr_sem);
  965. put_dquot_list(&tofree_head);
  966. }
  967. }
  968. static inline void dquot_incr_inodes(struct dquot *dquot, qsize_t number)
  969. {
  970. dquot->dq_dqb.dqb_curinodes += number;
  971. }
  972. static inline void dquot_incr_space(struct dquot *dquot, qsize_t number)
  973. {
  974. dquot->dq_dqb.dqb_curspace += number;
  975. }
  976. static inline void dquot_resv_space(struct dquot *dquot, qsize_t number)
  977. {
  978. dquot->dq_dqb.dqb_rsvspace += number;
  979. }
  980. /*
  981. * Claim reserved quota space
  982. */
  983. static void dquot_claim_reserved_space(struct dquot *dquot, qsize_t number)
  984. {
  985. if (dquot->dq_dqb.dqb_rsvspace < number) {
  986. WARN_ON_ONCE(1);
  987. number = dquot->dq_dqb.dqb_rsvspace;
  988. }
  989. dquot->dq_dqb.dqb_curspace += number;
  990. dquot->dq_dqb.dqb_rsvspace -= number;
  991. }
  992. static inline
  993. void dquot_free_reserved_space(struct dquot *dquot, qsize_t number)
  994. {
  995. if (dquot->dq_dqb.dqb_rsvspace >= number)
  996. dquot->dq_dqb.dqb_rsvspace -= number;
  997. else {
  998. WARN_ON_ONCE(1);
  999. dquot->dq_dqb.dqb_rsvspace = 0;
  1000. }
  1001. }
  1002. static void dquot_decr_inodes(struct dquot *dquot, qsize_t number)
  1003. {
  1004. if (sb_dqopt(dquot->dq_sb)->flags & DQUOT_NEGATIVE_USAGE ||
  1005. dquot->dq_dqb.dqb_curinodes >= number)
  1006. dquot->dq_dqb.dqb_curinodes -= number;
  1007. else
  1008. dquot->dq_dqb.dqb_curinodes = 0;
  1009. if (dquot->dq_dqb.dqb_curinodes <= dquot->dq_dqb.dqb_isoftlimit)
  1010. dquot->dq_dqb.dqb_itime = (time_t) 0;
  1011. clear_bit(DQ_INODES_B, &dquot->dq_flags);
  1012. }
  1013. static void dquot_decr_space(struct dquot *dquot, qsize_t number)
  1014. {
  1015. if (sb_dqopt(dquot->dq_sb)->flags & DQUOT_NEGATIVE_USAGE ||
  1016. dquot->dq_dqb.dqb_curspace >= number)
  1017. dquot->dq_dqb.dqb_curspace -= number;
  1018. else
  1019. dquot->dq_dqb.dqb_curspace = 0;
  1020. if (dquot->dq_dqb.dqb_curspace <= dquot->dq_dqb.dqb_bsoftlimit)
  1021. dquot->dq_dqb.dqb_btime = (time_t) 0;
  1022. clear_bit(DQ_BLKS_B, &dquot->dq_flags);
  1023. }
  1024. struct dquot_warn {
  1025. struct super_block *w_sb;
  1026. qid_t w_dq_id;
  1027. short w_dq_type;
  1028. short w_type;
  1029. };
  1030. static int warning_issued(struct dquot *dquot, const int warntype)
  1031. {
  1032. int flag = (warntype == QUOTA_NL_BHARDWARN ||
  1033. warntype == QUOTA_NL_BSOFTLONGWARN) ? DQ_BLKS_B :
  1034. ((warntype == QUOTA_NL_IHARDWARN ||
  1035. warntype == QUOTA_NL_ISOFTLONGWARN) ? DQ_INODES_B : 0);
  1036. if (!flag)
  1037. return 0;
  1038. return test_and_set_bit(flag, &dquot->dq_flags);
  1039. }
  1040. #ifdef CONFIG_PRINT_QUOTA_WARNING
  1041. static int flag_print_warnings = 1;
  1042. static int need_print_warning(struct dquot_warn *warn)
  1043. {
  1044. if (!flag_print_warnings)
  1045. return 0;
  1046. switch (warn->w_dq_type) {
  1047. case USRQUOTA:
  1048. return current_fsuid() == warn->w_dq_id;
  1049. case GRPQUOTA:
  1050. return in_group_p(warn->w_dq_id);
  1051. }
  1052. return 0;
  1053. }
  1054. /* Print warning to user which exceeded quota */
  1055. static void print_warning(struct dquot_warn *warn)
  1056. {
  1057. char *msg = NULL;
  1058. struct tty_struct *tty;
  1059. int warntype = warn->w_type;
  1060. if (warntype == QUOTA_NL_IHARDBELOW ||
  1061. warntype == QUOTA_NL_ISOFTBELOW ||
  1062. warntype == QUOTA_NL_BHARDBELOW ||
  1063. warntype == QUOTA_NL_BSOFTBELOW || !need_print_warning(warn))
  1064. return;
  1065. tty = get_current_tty();
  1066. if (!tty)
  1067. return;
  1068. tty_write_message(tty, warn->w_sb->s_id);
  1069. if (warntype == QUOTA_NL_ISOFTWARN || warntype == QUOTA_NL_BSOFTWARN)
  1070. tty_write_message(tty, ": warning, ");
  1071. else
  1072. tty_write_message(tty, ": write failed, ");
  1073. tty_write_message(tty, quotatypes[warn->w_dq_type]);
  1074. switch (warntype) {
  1075. case QUOTA_NL_IHARDWARN:
  1076. msg = " file limit reached.\r\n";
  1077. break;
  1078. case QUOTA_NL_ISOFTLONGWARN:
  1079. msg = " file quota exceeded too long.\r\n";
  1080. break;
  1081. case QUOTA_NL_ISOFTWARN:
  1082. msg = " file quota exceeded.\r\n";
  1083. break;
  1084. case QUOTA_NL_BHARDWARN:
  1085. msg = " block limit reached.\r\n";
  1086. break;
  1087. case QUOTA_NL_BSOFTLONGWARN:
  1088. msg = " block quota exceeded too long.\r\n";
  1089. break;
  1090. case QUOTA_NL_BSOFTWARN:
  1091. msg = " block quota exceeded.\r\n";
  1092. break;
  1093. }
  1094. tty_write_message(tty, msg);
  1095. tty_kref_put(tty);
  1096. }
  1097. #endif
  1098. static void prepare_warning(struct dquot_warn *warn, struct dquot *dquot,
  1099. int warntype)
  1100. {
  1101. if (warning_issued(dquot, warntype))
  1102. return;
  1103. warn->w_type = warntype;
  1104. warn->w_sb = dquot->dq_sb;
  1105. warn->w_dq_id = from_kqid(&init_user_ns, dquot->dq_id);
  1106. warn->w_dq_type = dquot->dq_id.type;
  1107. }
  1108. /*
  1109. * Write warnings to the console and send warning messages over netlink.
  1110. *
  1111. * Note that this function can call into tty and networking code.
  1112. */
  1113. static void flush_warnings(struct dquot_warn *warn)
  1114. {
  1115. int i;
  1116. for (i = 0; i < MAXQUOTAS; i++) {
  1117. if (warn[i].w_type == QUOTA_NL_NOWARN)
  1118. continue;
  1119. #ifdef CONFIG_PRINT_QUOTA_WARNING
  1120. print_warning(&warn[i]);
  1121. #endif
  1122. quota_send_warning(make_kqid(&init_user_ns, warn[i].w_dq_type, warn[i].w_dq_id),
  1123. warn[i].w_sb->s_dev, warn[i].w_type);
  1124. }
  1125. }
  1126. static int ignore_hardlimit(struct dquot *dquot)
  1127. {
  1128. struct mem_dqinfo *info = &sb_dqopt(dquot->dq_sb)->info[dquot->dq_id.type];
  1129. return capable(CAP_SYS_RESOURCE) &&
  1130. (info->dqi_format->qf_fmt_id != QFMT_VFS_OLD ||
  1131. !(info->dqi_flags & V1_DQF_RSQUASH));
  1132. }
  1133. /* needs dq_data_lock */
  1134. static int check_idq(struct dquot *dquot, qsize_t inodes,
  1135. struct dquot_warn *warn)
  1136. {
  1137. qsize_t newinodes = dquot->dq_dqb.dqb_curinodes + inodes;
  1138. if (!sb_has_quota_limits_enabled(dquot->dq_sb, dquot->dq_id.type) ||
  1139. test_bit(DQ_FAKE_B, &dquot->dq_flags))
  1140. return 0;
  1141. if (dquot->dq_dqb.dqb_ihardlimit &&
  1142. newinodes > dquot->dq_dqb.dqb_ihardlimit &&
  1143. !ignore_hardlimit(dquot)) {
  1144. prepare_warning(warn, dquot, QUOTA_NL_IHARDWARN);
  1145. return -EDQUOT;
  1146. }
  1147. if (dquot->dq_dqb.dqb_isoftlimit &&
  1148. newinodes > dquot->dq_dqb.dqb_isoftlimit &&
  1149. dquot->dq_dqb.dqb_itime &&
  1150. get_seconds() >= dquot->dq_dqb.dqb_itime &&
  1151. !ignore_hardlimit(dquot)) {
  1152. prepare_warning(warn, dquot, QUOTA_NL_ISOFTLONGWARN);
  1153. return -EDQUOT;
  1154. }
  1155. if (dquot->dq_dqb.dqb_isoftlimit &&
  1156. newinodes > dquot->dq_dqb.dqb_isoftlimit &&
  1157. dquot->dq_dqb.dqb_itime == 0) {
  1158. prepare_warning(warn, dquot, QUOTA_NL_ISOFTWARN);
  1159. dquot->dq_dqb.dqb_itime = get_seconds() +
  1160. sb_dqopt(dquot->dq_sb)->info[dquot->dq_id.type].dqi_igrace;
  1161. }
  1162. return 0;
  1163. }
  1164. /* needs dq_data_lock */
  1165. static int check_bdq(struct dquot *dquot, qsize_t space, int prealloc,
  1166. struct dquot_warn *warn)
  1167. {
  1168. qsize_t tspace;
  1169. struct super_block *sb = dquot->dq_sb;
  1170. if (!sb_has_quota_limits_enabled(sb, dquot->dq_id.type) ||
  1171. test_bit(DQ_FAKE_B, &dquot->dq_flags))
  1172. return 0;
  1173. tspace = dquot->dq_dqb.dqb_curspace + dquot->dq_dqb.dqb_rsvspace
  1174. + space;
  1175. if (dquot->dq_dqb.dqb_bhardlimit &&
  1176. tspace > dquot->dq_dqb.dqb_bhardlimit &&
  1177. !ignore_hardlimit(dquot)) {
  1178. if (!prealloc)
  1179. prepare_warning(warn, dquot, QUOTA_NL_BHARDWARN);
  1180. return -EDQUOT;
  1181. }
  1182. if (dquot->dq_dqb.dqb_bsoftlimit &&
  1183. tspace > dquot->dq_dqb.dqb_bsoftlimit &&
  1184. dquot->dq_dqb.dqb_btime &&
  1185. get_seconds() >= dquot->dq_dqb.dqb_btime &&
  1186. !ignore_hardlimit(dquot)) {
  1187. if (!prealloc)
  1188. prepare_warning(warn, dquot, QUOTA_NL_BSOFTLONGWARN);
  1189. return -EDQUOT;
  1190. }
  1191. if (dquot->dq_dqb.dqb_bsoftlimit &&
  1192. tspace > dquot->dq_dqb.dqb_bsoftlimit &&
  1193. dquot->dq_dqb.dqb_btime == 0) {
  1194. if (!prealloc) {
  1195. prepare_warning(warn, dquot, QUOTA_NL_BSOFTWARN);
  1196. dquot->dq_dqb.dqb_btime = get_seconds() +
  1197. sb_dqopt(sb)->info[dquot->dq_id.type].dqi_bgrace;
  1198. }
  1199. else
  1200. /*
  1201. * We don't allow preallocation to exceed softlimit so exceeding will
  1202. * be always printed
  1203. */
  1204. return -EDQUOT;
  1205. }
  1206. return 0;
  1207. }
  1208. static int info_idq_free(struct dquot *dquot, qsize_t inodes)
  1209. {
  1210. qsize_t newinodes;
  1211. if (test_bit(DQ_FAKE_B, &dquot->dq_flags) ||
  1212. dquot->dq_dqb.dqb_curinodes <= dquot->dq_dqb.dqb_isoftlimit ||
  1213. !sb_has_quota_limits_enabled(dquot->dq_sb, dquot->dq_id.type))
  1214. return QUOTA_NL_NOWARN;
  1215. newinodes = dquot->dq_dqb.dqb_curinodes - inodes;
  1216. if (newinodes <= dquot->dq_dqb.dqb_isoftlimit)
  1217. return QUOTA_NL_ISOFTBELOW;
  1218. if (dquot->dq_dqb.dqb_curinodes >= dquot->dq_dqb.dqb_ihardlimit &&
  1219. newinodes < dquot->dq_dqb.dqb_ihardlimit)
  1220. return QUOTA_NL_IHARDBELOW;
  1221. return QUOTA_NL_NOWARN;
  1222. }
  1223. static int info_bdq_free(struct dquot *dquot, qsize_t space)
  1224. {
  1225. if (test_bit(DQ_FAKE_B, &dquot->dq_flags) ||
  1226. dquot->dq_dqb.dqb_curspace <= dquot->dq_dqb.dqb_bsoftlimit)
  1227. return QUOTA_NL_NOWARN;
  1228. if (dquot->dq_dqb.dqb_curspace - space <= dquot->dq_dqb.dqb_bsoftlimit)
  1229. return QUOTA_NL_BSOFTBELOW;
  1230. if (dquot->dq_dqb.dqb_curspace >= dquot->dq_dqb.dqb_bhardlimit &&
  1231. dquot->dq_dqb.dqb_curspace - space < dquot->dq_dqb.dqb_bhardlimit)
  1232. return QUOTA_NL_BHARDBELOW;
  1233. return QUOTA_NL_NOWARN;
  1234. }
  1235. static int dquot_active(const struct inode *inode)
  1236. {
  1237. struct super_block *sb = inode->i_sb;
  1238. if (IS_NOQUOTA(inode))
  1239. return 0;
  1240. return sb_any_quota_loaded(sb) & ~sb_any_quota_suspended(sb);
  1241. }
  1242. /*
  1243. * Initialize quota pointers in inode
  1244. *
  1245. * We do things in a bit complicated way but by that we avoid calling
  1246. * dqget() and thus filesystem callbacks under dqptr_sem.
  1247. *
  1248. * It is better to call this function outside of any transaction as it
  1249. * might need a lot of space in journal for dquot structure allocation.
  1250. */
  1251. static void __dquot_initialize(struct inode *inode, int type)
  1252. {
  1253. int cnt;
  1254. struct dquot *got[MAXQUOTAS];
  1255. struct super_block *sb = inode->i_sb;
  1256. qsize_t rsv;
  1257. /* First test before acquiring mutex - solves deadlocks when we
  1258. * re-enter the quota code and are already holding the mutex */
  1259. if (!dquot_active(inode))
  1260. return;
  1261. /* First get references to structures we might need. */
  1262. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1263. struct kqid qid;
  1264. got[cnt] = NULL;
  1265. if (type != -1 && cnt != type)
  1266. continue;
  1267. switch (cnt) {
  1268. case USRQUOTA:
  1269. qid = make_kqid_uid(inode->i_uid);
  1270. break;
  1271. case GRPQUOTA:
  1272. qid = make_kqid_gid(inode->i_gid);
  1273. break;
  1274. }
  1275. got[cnt] = dqget(sb, qid);
  1276. }
  1277. down_write(&sb_dqopt(sb)->dqptr_sem);
  1278. if (IS_NOQUOTA(inode))
  1279. goto out_err;
  1280. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1281. if (type != -1 && cnt != type)
  1282. continue;
  1283. /* Avoid races with quotaoff() */
  1284. if (!sb_has_quota_active(sb, cnt))
  1285. continue;
  1286. /* We could race with quotaon or dqget() could have failed */
  1287. if (!got[cnt])
  1288. continue;
  1289. if (!inode->i_dquot[cnt]) {
  1290. inode->i_dquot[cnt] = got[cnt];
  1291. got[cnt] = NULL;
  1292. /*
  1293. * Make quota reservation system happy if someone
  1294. * did a write before quota was turned on
  1295. */
  1296. rsv = inode_get_rsv_space(inode);
  1297. if (unlikely(rsv))
  1298. dquot_resv_space(inode->i_dquot[cnt], rsv);
  1299. }
  1300. }
  1301. out_err:
  1302. up_write(&sb_dqopt(sb)->dqptr_sem);
  1303. /* Drop unused references */
  1304. dqput_all(got);
  1305. }
  1306. void dquot_initialize(struct inode *inode)
  1307. {
  1308. __dquot_initialize(inode, -1);
  1309. }
  1310. EXPORT_SYMBOL(dquot_initialize);
  1311. /*
  1312. * Release all quotas referenced by inode
  1313. */
  1314. static void __dquot_drop(struct inode *inode)
  1315. {
  1316. int cnt;
  1317. struct dquot *put[MAXQUOTAS];
  1318. down_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1319. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1320. put[cnt] = inode->i_dquot[cnt];
  1321. inode->i_dquot[cnt] = NULL;
  1322. }
  1323. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1324. dqput_all(put);
  1325. }
  1326. void dquot_drop(struct inode *inode)
  1327. {
  1328. int cnt;
  1329. if (IS_NOQUOTA(inode))
  1330. return;
  1331. /*
  1332. * Test before calling to rule out calls from proc and such
  1333. * where we are not allowed to block. Note that this is
  1334. * actually reliable test even without the lock - the caller
  1335. * must assure that nobody can come after the DQUOT_DROP and
  1336. * add quota pointers back anyway.
  1337. */
  1338. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1339. if (inode->i_dquot[cnt])
  1340. break;
  1341. }
  1342. if (cnt < MAXQUOTAS)
  1343. __dquot_drop(inode);
  1344. }
  1345. EXPORT_SYMBOL(dquot_drop);
  1346. /*
  1347. * inode_reserved_space is managed internally by quota, and protected by
  1348. * i_lock similar to i_blocks+i_bytes.
  1349. */
  1350. static qsize_t *inode_reserved_space(struct inode * inode)
  1351. {
  1352. /* Filesystem must explicitly define it's own method in order to use
  1353. * quota reservation interface */
  1354. BUG_ON(!inode->i_sb->dq_op->get_reserved_space);
  1355. return inode->i_sb->dq_op->get_reserved_space(inode);
  1356. }
  1357. void inode_add_rsv_space(struct inode *inode, qsize_t number)
  1358. {
  1359. spin_lock(&inode->i_lock);
  1360. *inode_reserved_space(inode) += number;
  1361. spin_unlock(&inode->i_lock);
  1362. }
  1363. EXPORT_SYMBOL(inode_add_rsv_space);
  1364. void inode_claim_rsv_space(struct inode *inode, qsize_t number)
  1365. {
  1366. spin_lock(&inode->i_lock);
  1367. *inode_reserved_space(inode) -= number;
  1368. __inode_add_bytes(inode, number);
  1369. spin_unlock(&inode->i_lock);
  1370. }
  1371. EXPORT_SYMBOL(inode_claim_rsv_space);
  1372. void inode_sub_rsv_space(struct inode *inode, qsize_t number)
  1373. {
  1374. spin_lock(&inode->i_lock);
  1375. *inode_reserved_space(inode) -= number;
  1376. spin_unlock(&inode->i_lock);
  1377. }
  1378. EXPORT_SYMBOL(inode_sub_rsv_space);
  1379. static qsize_t inode_get_rsv_space(struct inode *inode)
  1380. {
  1381. qsize_t ret;
  1382. if (!inode->i_sb->dq_op->get_reserved_space)
  1383. return 0;
  1384. spin_lock(&inode->i_lock);
  1385. ret = *inode_reserved_space(inode);
  1386. spin_unlock(&inode->i_lock);
  1387. return ret;
  1388. }
  1389. static void inode_incr_space(struct inode *inode, qsize_t number,
  1390. int reserve)
  1391. {
  1392. if (reserve)
  1393. inode_add_rsv_space(inode, number);
  1394. else
  1395. inode_add_bytes(inode, number);
  1396. }
  1397. static void inode_decr_space(struct inode *inode, qsize_t number, int reserve)
  1398. {
  1399. if (reserve)
  1400. inode_sub_rsv_space(inode, number);
  1401. else
  1402. inode_sub_bytes(inode, number);
  1403. }
  1404. /*
  1405. * This functions updates i_blocks+i_bytes fields and quota information
  1406. * (together with appropriate checks).
  1407. *
  1408. * NOTE: We absolutely rely on the fact that caller dirties the inode
  1409. * (usually helpers in quotaops.h care about this) and holds a handle for
  1410. * the current transaction so that dquot write and inode write go into the
  1411. * same transaction.
  1412. */
  1413. /*
  1414. * This operation can block, but only after everything is updated
  1415. */
  1416. int __dquot_alloc_space(struct inode *inode, qsize_t number, int flags)
  1417. {
  1418. int cnt, ret = 0;
  1419. struct dquot_warn warn[MAXQUOTAS];
  1420. struct dquot **dquots = inode->i_dquot;
  1421. int reserve = flags & DQUOT_SPACE_RESERVE;
  1422. /*
  1423. * First test before acquiring mutex - solves deadlocks when we
  1424. * re-enter the quota code and are already holding the mutex
  1425. */
  1426. if (!dquot_active(inode)) {
  1427. inode_incr_space(inode, number, reserve);
  1428. goto out;
  1429. }
  1430. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1431. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1432. warn[cnt].w_type = QUOTA_NL_NOWARN;
  1433. spin_lock(&dq_data_lock);
  1434. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1435. if (!dquots[cnt])
  1436. continue;
  1437. ret = check_bdq(dquots[cnt], number,
  1438. !(flags & DQUOT_SPACE_WARN), &warn[cnt]);
  1439. if (ret && !(flags & DQUOT_SPACE_NOFAIL)) {
  1440. spin_unlock(&dq_data_lock);
  1441. goto out_flush_warn;
  1442. }
  1443. }
  1444. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1445. if (!dquots[cnt])
  1446. continue;
  1447. if (reserve)
  1448. dquot_resv_space(dquots[cnt], number);
  1449. else
  1450. dquot_incr_space(dquots[cnt], number);
  1451. }
  1452. inode_incr_space(inode, number, reserve);
  1453. spin_unlock(&dq_data_lock);
  1454. if (reserve)
  1455. goto out_flush_warn;
  1456. mark_all_dquot_dirty(dquots);
  1457. out_flush_warn:
  1458. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1459. flush_warnings(warn);
  1460. out:
  1461. return ret;
  1462. }
  1463. EXPORT_SYMBOL(__dquot_alloc_space);
  1464. /*
  1465. * This operation can block, but only after everything is updated
  1466. */
  1467. int dquot_alloc_inode(const struct inode *inode)
  1468. {
  1469. int cnt, ret = 0;
  1470. struct dquot_warn warn[MAXQUOTAS];
  1471. struct dquot * const *dquots = inode->i_dquot;
  1472. /* First test before acquiring mutex - solves deadlocks when we
  1473. * re-enter the quota code and are already holding the mutex */
  1474. if (!dquot_active(inode))
  1475. return 0;
  1476. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1477. warn[cnt].w_type = QUOTA_NL_NOWARN;
  1478. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1479. spin_lock(&dq_data_lock);
  1480. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1481. if (!dquots[cnt])
  1482. continue;
  1483. ret = check_idq(dquots[cnt], 1, &warn[cnt]);
  1484. if (ret)
  1485. goto warn_put_all;
  1486. }
  1487. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1488. if (!dquots[cnt])
  1489. continue;
  1490. dquot_incr_inodes(dquots[cnt], 1);
  1491. }
  1492. warn_put_all:
  1493. spin_unlock(&dq_data_lock);
  1494. if (ret == 0)
  1495. mark_all_dquot_dirty(dquots);
  1496. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1497. flush_warnings(warn);
  1498. return ret;
  1499. }
  1500. EXPORT_SYMBOL(dquot_alloc_inode);
  1501. /*
  1502. * Convert in-memory reserved quotas to real consumed quotas
  1503. */
  1504. int dquot_claim_space_nodirty(struct inode *inode, qsize_t number)
  1505. {
  1506. int cnt;
  1507. if (!dquot_active(inode)) {
  1508. inode_claim_rsv_space(inode, number);
  1509. return 0;
  1510. }
  1511. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1512. spin_lock(&dq_data_lock);
  1513. /* Claim reserved quotas to allocated quotas */
  1514. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1515. if (inode->i_dquot[cnt])
  1516. dquot_claim_reserved_space(inode->i_dquot[cnt],
  1517. number);
  1518. }
  1519. /* Update inode bytes */
  1520. inode_claim_rsv_space(inode, number);
  1521. spin_unlock(&dq_data_lock);
  1522. mark_all_dquot_dirty(inode->i_dquot);
  1523. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1524. return 0;
  1525. }
  1526. EXPORT_SYMBOL(dquot_claim_space_nodirty);
  1527. /*
  1528. * This operation can block, but only after everything is updated
  1529. */
  1530. void __dquot_free_space(struct inode *inode, qsize_t number, int flags)
  1531. {
  1532. unsigned int cnt;
  1533. struct dquot_warn warn[MAXQUOTAS];
  1534. struct dquot **dquots = inode->i_dquot;
  1535. int reserve = flags & DQUOT_SPACE_RESERVE;
  1536. /* First test before acquiring mutex - solves deadlocks when we
  1537. * re-enter the quota code and are already holding the mutex */
  1538. if (!dquot_active(inode)) {
  1539. inode_decr_space(inode, number, reserve);
  1540. return;
  1541. }
  1542. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1543. spin_lock(&dq_data_lock);
  1544. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1545. int wtype;
  1546. warn[cnt].w_type = QUOTA_NL_NOWARN;
  1547. if (!dquots[cnt])
  1548. continue;
  1549. wtype = info_bdq_free(dquots[cnt], number);
  1550. if (wtype != QUOTA_NL_NOWARN)
  1551. prepare_warning(&warn[cnt], dquots[cnt], wtype);
  1552. if (reserve)
  1553. dquot_free_reserved_space(dquots[cnt], number);
  1554. else
  1555. dquot_decr_space(dquots[cnt], number);
  1556. }
  1557. inode_decr_space(inode, number, reserve);
  1558. spin_unlock(&dq_data_lock);
  1559. if (reserve)
  1560. goto out_unlock;
  1561. mark_all_dquot_dirty(dquots);
  1562. out_unlock:
  1563. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1564. flush_warnings(warn);
  1565. }
  1566. EXPORT_SYMBOL(__dquot_free_space);
  1567. /*
  1568. * This operation can block, but only after everything is updated
  1569. */
  1570. void dquot_free_inode(const struct inode *inode)
  1571. {
  1572. unsigned int cnt;
  1573. struct dquot_warn warn[MAXQUOTAS];
  1574. struct dquot * const *dquots = inode->i_dquot;
  1575. /* First test before acquiring mutex - solves deadlocks when we
  1576. * re-enter the quota code and are already holding the mutex */
  1577. if (!dquot_active(inode))
  1578. return;
  1579. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1580. spin_lock(&dq_data_lock);
  1581. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1582. int wtype;
  1583. warn[cnt].w_type = QUOTA_NL_NOWARN;
  1584. if (!dquots[cnt])
  1585. continue;
  1586. wtype = info_idq_free(dquots[cnt], 1);
  1587. if (wtype != QUOTA_NL_NOWARN)
  1588. prepare_warning(&warn[cnt], dquots[cnt], wtype);
  1589. dquot_decr_inodes(dquots[cnt], 1);
  1590. }
  1591. spin_unlock(&dq_data_lock);
  1592. mark_all_dquot_dirty(dquots);
  1593. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1594. flush_warnings(warn);
  1595. }
  1596. EXPORT_SYMBOL(dquot_free_inode);
  1597. /*
  1598. * Transfer the number of inode and blocks from one diskquota to an other.
  1599. * On success, dquot references in transfer_to are consumed and references
  1600. * to original dquots that need to be released are placed there. On failure,
  1601. * references are kept untouched.
  1602. *
  1603. * This operation can block, but only after everything is updated
  1604. * A transaction must be started when entering this function.
  1605. *
  1606. */
  1607. int __dquot_transfer(struct inode *inode, struct dquot **transfer_to)
  1608. {
  1609. qsize_t space, cur_space;
  1610. qsize_t rsv_space = 0;
  1611. struct dquot *transfer_from[MAXQUOTAS] = {};
  1612. int cnt, ret = 0;
  1613. char is_valid[MAXQUOTAS] = {};
  1614. struct dquot_warn warn_to[MAXQUOTAS];
  1615. struct dquot_warn warn_from_inodes[MAXQUOTAS];
  1616. struct dquot_warn warn_from_space[MAXQUOTAS];
  1617. /* First test before acquiring mutex - solves deadlocks when we
  1618. * re-enter the quota code and are already holding the mutex */
  1619. if (IS_NOQUOTA(inode))
  1620. return 0;
  1621. /* Initialize the arrays */
  1622. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1623. warn_to[cnt].w_type = QUOTA_NL_NOWARN;
  1624. warn_from_inodes[cnt].w_type = QUOTA_NL_NOWARN;
  1625. warn_from_space[cnt].w_type = QUOTA_NL_NOWARN;
  1626. }
  1627. down_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1628. if (IS_NOQUOTA(inode)) { /* File without quota accounting? */
  1629. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1630. return 0;
  1631. }
  1632. spin_lock(&dq_data_lock);
  1633. cur_space = inode_get_bytes(inode);
  1634. rsv_space = inode_get_rsv_space(inode);
  1635. space = cur_space + rsv_space;
  1636. /* Build the transfer_from list and check the limits */
  1637. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1638. /*
  1639. * Skip changes for same uid or gid or for turned off quota-type.
  1640. */
  1641. if (!transfer_to[cnt])
  1642. continue;
  1643. /* Avoid races with quotaoff() */
  1644. if (!sb_has_quota_active(inode->i_sb, cnt))
  1645. continue;
  1646. is_valid[cnt] = 1;
  1647. transfer_from[cnt] = inode->i_dquot[cnt];
  1648. ret = check_idq(transfer_to[cnt], 1, &warn_to[cnt]);
  1649. if (ret)
  1650. goto over_quota;
  1651. ret = check_bdq(transfer_to[cnt], space, 0, &warn_to[cnt]);
  1652. if (ret)
  1653. goto over_quota;
  1654. }
  1655. /*
  1656. * Finally perform the needed transfer from transfer_from to transfer_to
  1657. */
  1658. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1659. if (!is_valid[cnt])
  1660. continue;
  1661. /* Due to IO error we might not have transfer_from[] structure */
  1662. if (transfer_from[cnt]) {
  1663. int wtype;
  1664. wtype = info_idq_free(transfer_from[cnt], 1);
  1665. if (wtype != QUOTA_NL_NOWARN)
  1666. prepare_warning(&warn_from_inodes[cnt],
  1667. transfer_from[cnt], wtype);
  1668. wtype = info_bdq_free(transfer_from[cnt], space);
  1669. if (wtype != QUOTA_NL_NOWARN)
  1670. prepare_warning(&warn_from_space[cnt],
  1671. transfer_from[cnt], wtype);
  1672. dquot_decr_inodes(transfer_from[cnt], 1);
  1673. dquot_decr_space(transfer_from[cnt], cur_space);
  1674. dquot_free_reserved_space(transfer_from[cnt],
  1675. rsv_space);
  1676. }
  1677. dquot_incr_inodes(transfer_to[cnt], 1);
  1678. dquot_incr_space(transfer_to[cnt], cur_space);
  1679. dquot_resv_space(transfer_to[cnt], rsv_space);
  1680. inode->i_dquot[cnt] = transfer_to[cnt];
  1681. }
  1682. spin_unlock(&dq_data_lock);
  1683. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1684. mark_all_dquot_dirty(transfer_from);
  1685. mark_all_dquot_dirty(transfer_to);
  1686. flush_warnings(warn_to);
  1687. flush_warnings(warn_from_inodes);
  1688. flush_warnings(warn_from_space);
  1689. /* Pass back references to put */
  1690. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1691. if (is_valid[cnt])
  1692. transfer_to[cnt] = transfer_from[cnt];
  1693. return 0;
  1694. over_quota:
  1695. spin_unlock(&dq_data_lock);
  1696. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1697. flush_warnings(warn_to);
  1698. return ret;
  1699. }
  1700. EXPORT_SYMBOL(__dquot_transfer);
  1701. /* Wrapper for transferring ownership of an inode for uid/gid only
  1702. * Called from FSXXX_setattr()
  1703. */
  1704. int dquot_transfer(struct inode *inode, struct iattr *iattr)
  1705. {
  1706. struct dquot *transfer_to[MAXQUOTAS] = {};
  1707. struct super_block *sb = inode->i_sb;
  1708. int ret;
  1709. if (!dquot_active(inode))
  1710. return 0;
  1711. if (iattr->ia_valid & ATTR_UID && iattr->ia_uid != inode->i_uid)
  1712. transfer_to[USRQUOTA] = dqget(sb, make_kqid_uid(iattr->ia_uid));
  1713. if (iattr->ia_valid & ATTR_GID && iattr->ia_gid != inode->i_gid)
  1714. transfer_to[GRPQUOTA] = dqget(sb, make_kqid_gid(iattr->ia_gid));
  1715. ret = __dquot_transfer(inode, transfer_to);
  1716. dqput_all(transfer_to);
  1717. return ret;
  1718. }
  1719. EXPORT_SYMBOL(dquot_transfer);
  1720. /*
  1721. * Write info of quota file to disk
  1722. */
  1723. int dquot_commit_info(struct super_block *sb, int type)
  1724. {
  1725. int ret;
  1726. struct quota_info *dqopt = sb_dqopt(sb);
  1727. mutex_lock(&dqopt->dqio_mutex);
  1728. ret = dqopt->ops[type]->write_file_info(sb, type);
  1729. mutex_unlock(&dqopt->dqio_mutex);
  1730. return ret;
  1731. }
  1732. EXPORT_SYMBOL(dquot_commit_info);
  1733. /*
  1734. * Definitions of diskquota operations.
  1735. */
  1736. const struct dquot_operations dquot_operations = {
  1737. .write_dquot = dquot_commit,
  1738. .acquire_dquot = dquot_acquire,
  1739. .release_dquot = dquot_release,
  1740. .mark_dirty = dquot_mark_dquot_dirty,
  1741. .write_info = dquot_commit_info,
  1742. .alloc_dquot = dquot_alloc,
  1743. .destroy_dquot = dquot_destroy,
  1744. };
  1745. EXPORT_SYMBOL(dquot_operations);
  1746. /*
  1747. * Generic helper for ->open on filesystems supporting disk quotas.
  1748. */
  1749. int dquot_file_open(struct inode *inode, struct file *file)
  1750. {
  1751. int error;
  1752. error = generic_file_open(inode, file);
  1753. if (!error && (file->f_mode & FMODE_WRITE))
  1754. dquot_initialize(inode);
  1755. return error;
  1756. }
  1757. EXPORT_SYMBOL(dquot_file_open);
  1758. /*
  1759. * Turn quota off on a device. type == -1 ==> quotaoff for all types (umount)
  1760. */
  1761. int dquot_disable(struct super_block *sb, int type, unsigned int flags)
  1762. {
  1763. int cnt, ret = 0;
  1764. struct quota_info *dqopt = sb_dqopt(sb);
  1765. struct inode *toputinode[MAXQUOTAS];
  1766. /* Cannot turn off usage accounting without turning off limits, or
  1767. * suspend quotas and simultaneously turn quotas off. */
  1768. if ((flags & DQUOT_USAGE_ENABLED && !(flags & DQUOT_LIMITS_ENABLED))
  1769. || (flags & DQUOT_SUSPENDED && flags & (DQUOT_LIMITS_ENABLED |
  1770. DQUOT_USAGE_ENABLED)))
  1771. return -EINVAL;
  1772. /* We need to serialize quota_off() for device */
  1773. mutex_lock(&dqopt->dqonoff_mutex);
  1774. /*
  1775. * Skip everything if there's nothing to do. We have to do this because
  1776. * sometimes we are called when fill_super() failed and calling
  1777. * sync_fs() in such cases does no good.
  1778. */
  1779. if (!sb_any_quota_loaded(sb)) {
  1780. mutex_unlock(&dqopt->dqonoff_mutex);
  1781. return 0;
  1782. }
  1783. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1784. toputinode[cnt] = NULL;
  1785. if (type != -1 && cnt != type)
  1786. continue;
  1787. if (!sb_has_quota_loaded(sb, cnt))
  1788. continue;
  1789. if (flags & DQUOT_SUSPENDED) {
  1790. spin_lock(&dq_state_lock);
  1791. dqopt->flags |=
  1792. dquot_state_flag(DQUOT_SUSPENDED, cnt);
  1793. spin_unlock(&dq_state_lock);
  1794. } else {
  1795. spin_lock(&dq_state_lock);
  1796. dqopt->flags &= ~dquot_state_flag(flags, cnt);
  1797. /* Turning off suspended quotas? */
  1798. if (!sb_has_quota_loaded(sb, cnt) &&
  1799. sb_has_quota_suspended(sb, cnt)) {
  1800. dqopt->flags &= ~dquot_state_flag(
  1801. DQUOT_SUSPENDED, cnt);
  1802. spin_unlock(&dq_state_lock);
  1803. iput(dqopt->files[cnt]);
  1804. dqopt->files[cnt] = NULL;
  1805. continue;
  1806. }
  1807. spin_unlock(&dq_state_lock);
  1808. }
  1809. /* We still have to keep quota loaded? */
  1810. if (sb_has_quota_loaded(sb, cnt) && !(flags & DQUOT_SUSPENDED))
  1811. continue;
  1812. /* Note: these are blocking operations */
  1813. drop_dquot_ref(sb, cnt);
  1814. invalidate_dquots(sb, cnt);
  1815. /*
  1816. * Now all dquots should be invalidated, all writes done so we
  1817. * should be only users of the info. No locks needed.
  1818. */
  1819. if (info_dirty(&dqopt->info[cnt]))
  1820. sb->dq_op->write_info(sb, cnt);
  1821. if (dqopt->ops[cnt]->free_file_info)
  1822. dqopt->ops[cnt]->free_file_info(sb, cnt);
  1823. put_quota_format(dqopt->info[cnt].dqi_format);
  1824. toputinode[cnt] = dqopt->files[cnt];
  1825. if (!sb_has_quota_loaded(sb, cnt))
  1826. dqopt->files[cnt] = NULL;
  1827. dqopt->info[cnt].dqi_flags = 0;
  1828. dqopt->info[cnt].dqi_igrace = 0;
  1829. dqopt->info[cnt].dqi_bgrace = 0;
  1830. dqopt->ops[cnt] = NULL;
  1831. }
  1832. mutex_unlock(&dqopt->dqonoff_mutex);
  1833. /* Skip syncing and setting flags if quota files are hidden */
  1834. if (dqopt->flags & DQUOT_QUOTA_SYS_FILE)
  1835. goto put_inodes;
  1836. /* Sync the superblock so that buffers with quota data are written to
  1837. * disk (and so userspace sees correct data afterwards). */
  1838. if (sb->s_op->sync_fs)
  1839. sb->s_op->sync_fs(sb, 1);
  1840. sync_blockdev(sb->s_bdev);
  1841. /* Now the quota files are just ordinary files and we can set the
  1842. * inode flags back. Moreover we discard the pagecache so that
  1843. * userspace sees the writes we did bypassing the pagecache. We
  1844. * must also discard the blockdev buffers so that we see the
  1845. * changes done by userspace on the next quotaon() */
  1846. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1847. if (toputinode[cnt]) {
  1848. mutex_lock(&dqopt->dqonoff_mutex);
  1849. /* If quota was reenabled in the meantime, we have
  1850. * nothing to do */
  1851. if (!sb_has_quota_loaded(sb, cnt)) {
  1852. mutex_lock(&toputinode[cnt]->i_mutex);
  1853. toputinode[cnt]->i_flags &= ~(S_IMMUTABLE |
  1854. S_NOATIME | S_NOQUOTA);
  1855. truncate_inode_pages(&toputinode[cnt]->i_data,
  1856. 0);
  1857. mutex_unlock(&toputinode[cnt]->i_mutex);
  1858. mark_inode_dirty_sync(toputinode[cnt]);
  1859. }
  1860. mutex_unlock(&dqopt->dqonoff_mutex);
  1861. }
  1862. if (sb->s_bdev)
  1863. invalidate_bdev(sb->s_bdev);
  1864. put_inodes:
  1865. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1866. if (toputinode[cnt]) {
  1867. /* On remount RO, we keep the inode pointer so that we
  1868. * can reenable quota on the subsequent remount RW. We
  1869. * have to check 'flags' variable and not use sb_has_
  1870. * function because another quotaon / quotaoff could
  1871. * change global state before we got here. We refuse
  1872. * to suspend quotas when there is pending delete on
  1873. * the quota file... */
  1874. if (!(flags & DQUOT_SUSPENDED))
  1875. iput(toputinode[cnt]);
  1876. else if (!toputinode[cnt]->i_nlink)
  1877. ret = -EBUSY;
  1878. }
  1879. return ret;
  1880. }
  1881. EXPORT_SYMBOL(dquot_disable);
  1882. int dquot_quota_off(struct super_block *sb, int type)
  1883. {
  1884. return dquot_disable(sb, type,
  1885. DQUOT_USAGE_ENABLED | DQUOT_LIMITS_ENABLED);
  1886. }
  1887. EXPORT_SYMBOL(dquot_quota_off);
  1888. /*
  1889. * Turn quotas on on a device
  1890. */
  1891. /*
  1892. * Helper function to turn quotas on when we already have the inode of
  1893. * quota file and no quota information is loaded.
  1894. */
  1895. static int vfs_load_quota_inode(struct inode *inode, int type, int format_id,
  1896. unsigned int flags)
  1897. {
  1898. struct quota_format_type *fmt = find_quota_format(format_id);
  1899. struct super_block *sb = inode->i_sb;
  1900. struct quota_info *dqopt = sb_dqopt(sb);
  1901. int error;
  1902. int oldflags = -1;
  1903. if (!fmt)
  1904. return -ESRCH;
  1905. if (!S_ISREG(inode->i_mode)) {
  1906. error = -EACCES;
  1907. goto out_fmt;
  1908. }
  1909. if (IS_RDONLY(inode)) {
  1910. error = -EROFS;
  1911. goto out_fmt;
  1912. }
  1913. if (!sb->s_op->quota_write || !sb->s_op->quota_read) {
  1914. error = -EINVAL;
  1915. goto out_fmt;
  1916. }
  1917. /* Usage always has to be set... */
  1918. if (!(flags & DQUOT_USAGE_ENABLED)) {
  1919. error = -EINVAL;
  1920. goto out_fmt;
  1921. }
  1922. if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) {
  1923. /* As we bypass the pagecache we must now flush all the
  1924. * dirty data and invalidate caches so that kernel sees
  1925. * changes from userspace. It is not enough to just flush
  1926. * the quota file since if blocksize < pagesize, invalidation
  1927. * of the cache could fail because of other unrelated dirty
  1928. * data */
  1929. sync_filesystem(sb);
  1930. invalidate_bdev(sb->s_bdev);
  1931. }
  1932. mutex_lock(&dqopt->dqonoff_mutex);
  1933. if (sb_has_quota_loaded(sb, type)) {
  1934. error = -EBUSY;
  1935. goto out_lock;
  1936. }
  1937. if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) {
  1938. /* We don't want quota and atime on quota files (deadlocks
  1939. * possible) Also nobody should write to the file - we use
  1940. * special IO operations which ignore the immutable bit. */
  1941. mutex_lock(&inode->i_mutex);
  1942. oldflags = inode->i_flags & (S_NOATIME | S_IMMUTABLE |
  1943. S_NOQUOTA);
  1944. inode->i_flags |= S_NOQUOTA | S_NOATIME | S_IMMUTABLE;
  1945. mutex_unlock(&inode->i_mutex);
  1946. /*
  1947. * When S_NOQUOTA is set, remove dquot references as no more
  1948. * references can be added
  1949. */
  1950. __dquot_drop(inode);
  1951. }
  1952. error = -EIO;
  1953. dqopt->files[type] = igrab(inode);
  1954. if (!dqopt->files[type])
  1955. goto out_lock;
  1956. error = -EINVAL;
  1957. if (!fmt->qf_ops->check_quota_file(sb, type))
  1958. goto out_file_init;
  1959. dqopt->ops[type] = fmt->qf_ops;
  1960. dqopt->info[type].dqi_format = fmt;
  1961. dqopt->info[type].dqi_fmt_id = format_id;
  1962. INIT_LIST_HEAD(&dqopt->info[type].dqi_dirty_list);
  1963. mutex_lock(&dqopt->dqio_mutex);
  1964. error = dqopt->ops[type]->read_file_info(sb, type);
  1965. if (error < 0) {
  1966. mutex_unlock(&dqopt->dqio_mutex);
  1967. goto out_file_init;
  1968. }
  1969. if (dqopt->flags & DQUOT_QUOTA_SYS_FILE)
  1970. dqopt->info[type].dqi_flags |= DQF_SYS_FILE;
  1971. mutex_unlock(&dqopt->dqio_mutex);
  1972. spin_lock(&dq_state_lock);
  1973. dqopt->flags |= dquot_state_flag(flags, type);
  1974. spin_unlock(&dq_state_lock);
  1975. add_dquot_ref(sb, type);
  1976. mutex_unlock(&dqopt->dqonoff_mutex);
  1977. return 0;
  1978. out_file_init:
  1979. dqopt->files[type] = NULL;
  1980. iput(inode);
  1981. out_lock:
  1982. if (oldflags != -1) {
  1983. mutex_lock(&inode->i_mutex);
  1984. /* Set the flags back (in the case of accidental quotaon()
  1985. * on a wrong file we don't want to mess up the flags) */
  1986. inode->i_flags &= ~(S_NOATIME | S_NOQUOTA | S_IMMUTABLE);
  1987. inode->i_flags |= oldflags;
  1988. mutex_unlock(&inode->i_mutex);
  1989. }
  1990. mutex_unlock(&dqopt->dqonoff_mutex);
  1991. out_fmt:
  1992. put_quota_format(fmt);
  1993. return error;
  1994. }
  1995. /* Reenable quotas on remount RW */
  1996. int dquot_resume(struct super_block *sb, int type)
  1997. {
  1998. struct quota_info *dqopt = sb_dqopt(sb);
  1999. struct inode *inode;
  2000. int ret = 0, cnt;
  2001. unsigned int flags;
  2002. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  2003. if (type != -1 && cnt != type)
  2004. continue;
  2005. mutex_lock(&dqopt->dqonoff_mutex);
  2006. if (!sb_has_quota_suspended(sb, cnt)) {
  2007. mutex_unlock(&dqopt->dqonoff_mutex);
  2008. continue;
  2009. }
  2010. inode = dqopt->files[cnt];
  2011. dqopt->files[cnt] = NULL;
  2012. spin_lock(&dq_state_lock);
  2013. flags = dqopt->flags & dquot_state_flag(DQUOT_USAGE_ENABLED |
  2014. DQUOT_LIMITS_ENABLED,
  2015. cnt);
  2016. dqopt->flags &= ~dquot_state_flag(DQUOT_STATE_FLAGS, cnt);
  2017. spin_unlock(&dq_state_lock);
  2018. mutex_unlock(&dqopt->dqonoff_mutex);
  2019. flags = dquot_generic_flag(flags, cnt);
  2020. ret = vfs_load_quota_inode(inode, cnt,
  2021. dqopt->info[cnt].dqi_fmt_id, flags);
  2022. iput(inode);
  2023. }
  2024. return ret;
  2025. }
  2026. EXPORT_SYMBOL(dquot_resume);
  2027. int dquot_quota_on(struct super_block *sb, int type, int format_id,
  2028. struct path *path)
  2029. {
  2030. int error = security_quota_on(path->dentry);
  2031. if (error)
  2032. return error;
  2033. /* Quota file not on the same filesystem? */
  2034. if (path->dentry->d_sb != sb)
  2035. error = -EXDEV;
  2036. else
  2037. error = vfs_load_quota_inode(path->dentry->d_inode, type,
  2038. format_id, DQUOT_USAGE_ENABLED |
  2039. DQUOT_LIMITS_ENABLED);
  2040. return error;
  2041. }
  2042. EXPORT_SYMBOL(dquot_quota_on);
  2043. /*
  2044. * More powerful function for turning on quotas allowing setting
  2045. * of individual quota flags
  2046. */
  2047. int dquot_enable(struct inode *inode, int type, int format_id,
  2048. unsigned int flags)
  2049. {
  2050. int ret = 0;
  2051. struct super_block *sb = inode->i_sb;
  2052. struct quota_info *dqopt = sb_dqopt(sb);
  2053. /* Just unsuspend quotas? */
  2054. BUG_ON(flags & DQUOT_SUSPENDED);
  2055. if (!flags)
  2056. return 0;
  2057. /* Just updating flags needed? */
  2058. if (sb_has_quota_loaded(sb, type)) {
  2059. mutex_lock(&dqopt->dqonoff_mutex);
  2060. /* Now do a reliable test... */
  2061. if (!sb_has_quota_loaded(sb, type)) {
  2062. mutex_unlock(&dqopt->dqonoff_mutex);
  2063. goto load_quota;
  2064. }
  2065. if (flags & DQUOT_USAGE_ENABLED &&
  2066. sb_has_quota_usage_enabled(sb, type)) {
  2067. ret = -EBUSY;
  2068. goto out_lock;
  2069. }
  2070. if (flags & DQUOT_LIMITS_ENABLED &&
  2071. sb_has_quota_limits_enabled(sb, type)) {
  2072. ret = -EBUSY;
  2073. goto out_lock;
  2074. }
  2075. spin_lock(&dq_state_lock);
  2076. sb_dqopt(sb)->flags |= dquot_state_flag(flags, type);
  2077. spin_unlock(&dq_state_lock);
  2078. out_lock:
  2079. mutex_unlock(&dqopt->dqonoff_mutex);
  2080. return ret;
  2081. }
  2082. load_quota:
  2083. return vfs_load_quota_inode(inode, type, format_id, flags);
  2084. }
  2085. EXPORT_SYMBOL(dquot_enable);
  2086. /*
  2087. * This function is used when filesystem needs to initialize quotas
  2088. * during mount time.
  2089. */
  2090. int dquot_quota_on_mount(struct super_block *sb, char *qf_name,
  2091. int format_id, int type)
  2092. {
  2093. struct dentry *dentry;
  2094. int error;
  2095. mutex_lock(&sb->s_root->d_inode->i_mutex);
  2096. dentry = lookup_one_len(qf_name, sb->s_root, strlen(qf_name));
  2097. mutex_unlock(&sb->s_root->d_inode->i_mutex);
  2098. if (IS_ERR(dentry))
  2099. return PTR_ERR(dentry);
  2100. if (!dentry->d_inode) {
  2101. error = -ENOENT;
  2102. goto out;
  2103. }
  2104. error = security_quota_on(dentry);
  2105. if (!error)
  2106. error = vfs_load_quota_inode(dentry->d_inode, type, format_id,
  2107. DQUOT_USAGE_ENABLED | DQUOT_LIMITS_ENABLED);
  2108. out:
  2109. dput(dentry);
  2110. return error;
  2111. }
  2112. EXPORT_SYMBOL(dquot_quota_on_mount);
  2113. static inline qsize_t qbtos(qsize_t blocks)
  2114. {
  2115. return blocks << QIF_DQBLKSIZE_BITS;
  2116. }
  2117. static inline qsize_t stoqb(qsize_t space)
  2118. {
  2119. return (space + QIF_DQBLKSIZE - 1) >> QIF_DQBLKSIZE_BITS;
  2120. }
  2121. /* Generic routine for getting common part of quota structure */
  2122. static void do_get_dqblk(struct dquot *dquot, struct fs_disk_quota *di)
  2123. {
  2124. struct mem_dqblk *dm = &dquot->dq_dqb;
  2125. memset(di, 0, sizeof(*di));
  2126. di->d_version = FS_DQUOT_VERSION;
  2127. di->d_flags = dquot->dq_id.type == USRQUOTA ?
  2128. FS_USER_QUOTA : FS_GROUP_QUOTA;
  2129. di->d_id = from_kqid_munged(current_user_ns(), dquot->dq_id);
  2130. spin_lock(&dq_data_lock);
  2131. di->d_blk_hardlimit = stoqb(dm->dqb_bhardlimit);
  2132. di->d_blk_softlimit = stoqb(dm->dqb_bsoftlimit);
  2133. di->d_ino_hardlimit = dm->dqb_ihardlimit;
  2134. di->d_ino_softlimit = dm->dqb_isoftlimit;
  2135. di->d_bcount = dm->dqb_curspace + dm->dqb_rsvspace;
  2136. di->d_icount = dm->dqb_curinodes;
  2137. di->d_btimer = dm->dqb_btime;
  2138. di->d_itimer = dm->dqb_itime;
  2139. spin_unlock(&dq_data_lock);
  2140. }
  2141. int dquot_get_dqblk(struct super_block *sb, struct kqid qid,
  2142. struct fs_disk_quota *di)
  2143. {
  2144. struct dquot *dquot;
  2145. dquot = dqget(sb, qid);
  2146. if (!dquot)
  2147. return -ESRCH;
  2148. do_get_dqblk(dquot, di);
  2149. dqput(dquot);
  2150. return 0;
  2151. }
  2152. EXPORT_SYMBOL(dquot_get_dqblk);
  2153. #define VFS_FS_DQ_MASK \
  2154. (FS_DQ_BCOUNT | FS_DQ_BSOFT | FS_DQ_BHARD | \
  2155. FS_DQ_ICOUNT | FS_DQ_ISOFT | FS_DQ_IHARD | \
  2156. FS_DQ_BTIMER | FS_DQ_ITIMER)
  2157. /* Generic routine for setting common part of quota structure */
  2158. static int do_set_dqblk(struct dquot *dquot, struct fs_disk_quota *di)
  2159. {
  2160. struct mem_dqblk *dm = &dquot->dq_dqb;
  2161. int check_blim = 0, check_ilim = 0;
  2162. struct mem_dqinfo *dqi = &sb_dqopt(dquot->dq_sb)->info[dquot->dq_id.type];
  2163. if (di->d_fieldmask & ~VFS_FS_DQ_MASK)
  2164. return -EINVAL;
  2165. if (((di->d_fieldmask & FS_DQ_BSOFT) &&
  2166. (di->d_blk_softlimit > dqi->dqi_maxblimit)) ||
  2167. ((di->d_fieldmask & FS_DQ_BHARD) &&
  2168. (di->d_blk_hardlimit > dqi->dqi_maxblimit)) ||
  2169. ((di->d_fieldmask & FS_DQ_ISOFT) &&
  2170. (di->d_ino_softlimit > dqi->dqi_maxilimit)) ||
  2171. ((di->d_fieldmask & FS_DQ_IHARD) &&
  2172. (di->d_ino_hardlimit > dqi->dqi_maxilimit)))
  2173. return -ERANGE;
  2174. spin_lock(&dq_data_lock);
  2175. if (di->d_fieldmask & FS_DQ_BCOUNT) {
  2176. dm->dqb_curspace = di->d_bcount - dm->dqb_rsvspace;
  2177. check_blim = 1;
  2178. set_bit(DQ_LASTSET_B + QIF_SPACE_B, &dquot->dq_flags);
  2179. }
  2180. if (di->d_fieldmask & FS_DQ_BSOFT)
  2181. dm->dqb_bsoftlimit = qbtos(di->d_blk_softlimit);
  2182. if (di->d_fieldmask & FS_DQ_BHARD)
  2183. dm->dqb_bhardlimit = qbtos(di->d_blk_hardlimit);
  2184. if (di->d_fieldmask & (FS_DQ_BSOFT | FS_DQ_BHARD)) {
  2185. check_blim = 1;
  2186. set_bit(DQ_LASTSET_B + QIF_BLIMITS_B, &dquot->dq_flags);
  2187. }
  2188. if (di->d_fieldmask & FS_DQ_ICOUNT) {
  2189. dm->dqb_curinodes = di->d_icount;
  2190. check_ilim = 1;
  2191. set_bit(DQ_LASTSET_B + QIF_INODES_B, &dquot->dq_flags);
  2192. }
  2193. if (di->d_fieldmask & FS_DQ_ISOFT)
  2194. dm->dqb_isoftlimit = di->d_ino_softlimit;
  2195. if (di->d_fieldmask & FS_DQ_IHARD)
  2196. dm->dqb_ihardlimit = di->d_ino_hardlimit;
  2197. if (di->d_fieldmask & (FS_DQ_ISOFT | FS_DQ_IHARD)) {
  2198. check_ilim = 1;
  2199. set_bit(DQ_LASTSET_B + QIF_ILIMITS_B, &dquot->dq_flags);
  2200. }
  2201. if (di->d_fieldmask & FS_DQ_BTIMER) {
  2202. dm->dqb_btime = di->d_btimer;
  2203. check_blim = 1;
  2204. set_bit(DQ_LASTSET_B + QIF_BTIME_B, &dquot->dq_flags);
  2205. }
  2206. if (di->d_fieldmask & FS_DQ_ITIMER) {
  2207. dm->dqb_itime = di->d_itimer;
  2208. check_ilim = 1;
  2209. set_bit(DQ_LASTSET_B + QIF_ITIME_B, &dquot->dq_flags);
  2210. }
  2211. if (check_blim) {
  2212. if (!dm->dqb_bsoftlimit ||
  2213. dm->dqb_curspace < dm->dqb_bsoftlimit) {
  2214. dm->dqb_btime = 0;
  2215. clear_bit(DQ_BLKS_B, &dquot->dq_flags);
  2216. } else if (!(di->d_fieldmask & FS_DQ_BTIMER))
  2217. /* Set grace only if user hasn't provided his own... */
  2218. dm->dqb_btime = get_seconds() + dqi->dqi_bgrace;
  2219. }
  2220. if (check_ilim) {
  2221. if (!dm->dqb_isoftlimit ||
  2222. dm->dqb_curinodes < dm->dqb_isoftlimit) {
  2223. dm->dqb_itime = 0;
  2224. clear_bit(DQ_INODES_B, &dquot->dq_flags);
  2225. } else if (!(di->d_fieldmask & FS_DQ_ITIMER))
  2226. /* Set grace only if user hasn't provided his own... */
  2227. dm->dqb_itime = get_seconds() + dqi->dqi_igrace;
  2228. }
  2229. if (dm->dqb_bhardlimit || dm->dqb_bsoftlimit || dm->dqb_ihardlimit ||
  2230. dm->dqb_isoftlimit)
  2231. clear_bit(DQ_FAKE_B, &dquot->dq_flags);
  2232. else
  2233. set_bit(DQ_FAKE_B, &dquot->dq_flags);
  2234. spin_unlock(&dq_data_lock);
  2235. mark_dquot_dirty(dquot);
  2236. return 0;
  2237. }
  2238. int dquot_set_dqblk(struct super_block *sb, struct kqid qid,
  2239. struct fs_disk_quota *di)
  2240. {
  2241. struct dquot *dquot;
  2242. int rc;
  2243. dquot = dqget(sb, qid);
  2244. if (!dquot) {
  2245. rc = -ESRCH;
  2246. goto out;
  2247. }
  2248. rc = do_set_dqblk(dquot, di);
  2249. dqput(dquot);
  2250. out:
  2251. return rc;
  2252. }
  2253. EXPORT_SYMBOL(dquot_set_dqblk);
  2254. /* Generic routine for getting common part of quota file information */
  2255. int dquot_get_dqinfo(struct super_block *sb, int type, struct if_dqinfo *ii)
  2256. {
  2257. struct mem_dqinfo *mi;
  2258. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  2259. if (!sb_has_quota_active(sb, type)) {
  2260. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  2261. return -ESRCH;
  2262. }
  2263. mi = sb_dqopt(sb)->info + type;
  2264. spin_lock(&dq_data_lock);
  2265. ii->dqi_bgrace = mi->dqi_bgrace;
  2266. ii->dqi_igrace = mi->dqi_igrace;
  2267. ii->dqi_flags = mi->dqi_flags & DQF_GETINFO_MASK;
  2268. ii->dqi_valid = IIF_ALL;
  2269. spin_unlock(&dq_data_lock);
  2270. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  2271. return 0;
  2272. }
  2273. EXPORT_SYMBOL(dquot_get_dqinfo);
  2274. /* Generic routine for setting common part of quota file information */
  2275. int dquot_set_dqinfo(struct super_block *sb, int type, struct if_dqinfo *ii)
  2276. {
  2277. struct mem_dqinfo *mi;
  2278. int err = 0;
  2279. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  2280. if (!sb_has_quota_active(sb, type)) {
  2281. err = -ESRCH;
  2282. goto out;
  2283. }
  2284. mi = sb_dqopt(sb)->info + type;
  2285. spin_lock(&dq_data_lock);
  2286. if (ii->dqi_valid & IIF_BGRACE)
  2287. mi->dqi_bgrace = ii->dqi_bgrace;
  2288. if (ii->dqi_valid & IIF_IGRACE)
  2289. mi->dqi_igrace = ii->dqi_igrace;
  2290. if (ii->dqi_valid & IIF_FLAGS)
  2291. mi->dqi_flags = (mi->dqi_flags & ~DQF_SETINFO_MASK) |
  2292. (ii->dqi_flags & DQF_SETINFO_MASK);
  2293. spin_unlock(&dq_data_lock);
  2294. mark_info_dirty(sb, type);
  2295. /* Force write to disk */
  2296. sb->dq_op->write_info(sb, type);
  2297. out:
  2298. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  2299. return err;
  2300. }
  2301. EXPORT_SYMBOL(dquot_set_dqinfo);
  2302. const struct quotactl_ops dquot_quotactl_ops = {
  2303. .quota_on = dquot_quota_on,
  2304. .quota_off = dquot_quota_off,
  2305. .quota_sync = dquot_quota_sync,
  2306. .get_info = dquot_get_dqinfo,
  2307. .set_info = dquot_set_dqinfo,
  2308. .get_dqblk = dquot_get_dqblk,
  2309. .set_dqblk = dquot_set_dqblk
  2310. };
  2311. EXPORT_SYMBOL(dquot_quotactl_ops);
  2312. static int do_proc_dqstats(struct ctl_table *table, int write,
  2313. void __user *buffer, size_t *lenp, loff_t *ppos)
  2314. {
  2315. unsigned int type = (int *)table->data - dqstats.stat;
  2316. /* Update global table */
  2317. dqstats.stat[type] =
  2318. percpu_counter_sum_positive(&dqstats.counter[type]);
  2319. return proc_dointvec(table, write, buffer, lenp, ppos);
  2320. }
  2321. static ctl_table fs_dqstats_table[] = {
  2322. {
  2323. .procname = "lookups",
  2324. .data = &dqstats.stat[DQST_LOOKUPS],
  2325. .maxlen = sizeof(int),
  2326. .mode = 0444,
  2327. .proc_handler = do_proc_dqstats,
  2328. },
  2329. {
  2330. .procname = "drops",
  2331. .data = &dqstats.stat[DQST_DROPS],
  2332. .maxlen = sizeof(int),
  2333. .mode = 0444,
  2334. .proc_handler = do_proc_dqstats,
  2335. },
  2336. {
  2337. .procname = "reads",
  2338. .data = &dqstats.stat[DQST_READS],
  2339. .maxlen = sizeof(int),
  2340. .mode = 0444,
  2341. .proc_handler = do_proc_dqstats,
  2342. },
  2343. {
  2344. .procname = "writes",
  2345. .data = &dqstats.stat[DQST_WRITES],
  2346. .maxlen = sizeof(int),
  2347. .mode = 0444,
  2348. .proc_handler = do_proc_dqstats,
  2349. },
  2350. {
  2351. .procname = "cache_hits",
  2352. .data = &dqstats.stat[DQST_CACHE_HITS],
  2353. .maxlen = sizeof(int),
  2354. .mode = 0444,
  2355. .proc_handler = do_proc_dqstats,
  2356. },
  2357. {
  2358. .procname = "allocated_dquots",
  2359. .data = &dqstats.stat[DQST_ALLOC_DQUOTS],
  2360. .maxlen = sizeof(int),
  2361. .mode = 0444,
  2362. .proc_handler = do_proc_dqstats,
  2363. },
  2364. {
  2365. .procname = "free_dquots",
  2366. .data = &dqstats.stat[DQST_FREE_DQUOTS],
  2367. .maxlen = sizeof(int),
  2368. .mode = 0444,
  2369. .proc_handler = do_proc_dqstats,
  2370. },
  2371. {
  2372. .procname = "syncs",
  2373. .data = &dqstats.stat[DQST_SYNCS],
  2374. .maxlen = sizeof(int),
  2375. .mode = 0444,
  2376. .proc_handler = do_proc_dqstats,
  2377. },
  2378. #ifdef CONFIG_PRINT_QUOTA_WARNING
  2379. {
  2380. .procname = "warnings",
  2381. .data = &flag_print_warnings,
  2382. .maxlen = sizeof(int),
  2383. .mode = 0644,
  2384. .proc_handler = proc_dointvec,
  2385. },
  2386. #endif
  2387. { },
  2388. };
  2389. static ctl_table fs_table[] = {
  2390. {
  2391. .procname = "quota",
  2392. .mode = 0555,
  2393. .child = fs_dqstats_table,
  2394. },
  2395. { },
  2396. };
  2397. static ctl_table sys_table[] = {
  2398. {
  2399. .procname = "fs",
  2400. .mode = 0555,
  2401. .child = fs_table,
  2402. },
  2403. { },
  2404. };
  2405. static int __init dquot_init(void)
  2406. {
  2407. int i, ret;
  2408. unsigned long nr_hash, order;
  2409. printk(KERN_NOTICE "VFS: Disk quotas %s\n", __DQUOT_VERSION__);
  2410. register_sysctl_table(sys_table);
  2411. dquot_cachep = kmem_cache_create("dquot",
  2412. sizeof(struct dquot), sizeof(unsigned long) * 4,
  2413. (SLAB_HWCACHE_ALIGN|SLAB_RECLAIM_ACCOUNT|
  2414. SLAB_MEM_SPREAD|SLAB_PANIC),
  2415. NULL);
  2416. order = 0;
  2417. dquot_hash = (struct hlist_head *)__get_free_pages(GFP_ATOMIC, order);
  2418. if (!dquot_hash)
  2419. panic("Cannot create dquot hash table");
  2420. for (i = 0; i < _DQST_DQSTAT_LAST; i++) {
  2421. ret = percpu_counter_init(&dqstats.counter[i], 0);
  2422. if (ret)
  2423. panic("Cannot create dquot stat counters");
  2424. }
  2425. /* Find power-of-two hlist_heads which can fit into allocation */
  2426. nr_hash = (1UL << order) * PAGE_SIZE / sizeof(struct hlist_head);
  2427. dq_hash_bits = 0;
  2428. do {
  2429. dq_hash_bits++;
  2430. } while (nr_hash >> dq_hash_bits);
  2431. dq_hash_bits--;
  2432. nr_hash = 1UL << dq_hash_bits;
  2433. dq_hash_mask = nr_hash - 1;
  2434. for (i = 0; i < nr_hash; i++)
  2435. INIT_HLIST_HEAD(dquot_hash + i);
  2436. printk("Dquot-cache hash table entries: %ld (order %ld, %ld bytes)\n",
  2437. nr_hash, order, (PAGE_SIZE << order));
  2438. register_shrinker(&dqcache_shrinker);
  2439. return 0;
  2440. }
  2441. module_init(dquot_init);