dquot.c 73 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698
  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 <asm/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, dquot->dq_id, dquot->dq_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 hlist_node *node;
  254. struct dquot *dquot;
  255. hlist_for_each (node, dquot_hash+hashent) {
  256. dquot = hlist_entry(node, struct dquot, dq_hash);
  257. if (dquot->dq_sb == sb && dquot->dq_id == id &&
  258. dquot->dq_type == type)
  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_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_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_type]->commit_dqblk(dquot);
  371. /* Write the info if needed */
  372. if (info_dirty(&dqopt->info[dquot->dq_type])) {
  373. ret2 = dqopt->ops[dquot->dq_type]->write_file_info(
  374. dquot->dq_sb, dquot->dq_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_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_type]->release_dqblk) {
  428. ret = dqopt->ops[dquot->dq_type]->release_dqblk(dquot);
  429. /* Write the info */
  430. if (info_dirty(&dqopt->info[dquot->dq_type])) {
  431. ret2 = dqopt->ops[dquot->dq_type]->write_file_info(
  432. dquot->dq_sb, dquot->dq_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_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. int dquot_quota_sync(struct super_block *sb, int type, int wait)
  538. {
  539. struct list_head *dirty;
  540. struct dquot *dquot;
  541. struct quota_info *dqopt = sb_dqopt(sb);
  542. int cnt;
  543. mutex_lock(&dqopt->dqonoff_mutex);
  544. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  545. if (type != -1 && cnt != type)
  546. continue;
  547. if (!sb_has_quota_active(sb, cnt))
  548. continue;
  549. spin_lock(&dq_list_lock);
  550. dirty = &dqopt->info[cnt].dqi_dirty_list;
  551. while (!list_empty(dirty)) {
  552. dquot = list_first_entry(dirty, struct dquot,
  553. dq_dirty);
  554. /* Dirty and inactive can be only bad dquot... */
  555. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags)) {
  556. clear_dquot_dirty(dquot);
  557. continue;
  558. }
  559. /* Now we have active dquot from which someone is
  560. * holding reference so we can safely just increase
  561. * use count */
  562. atomic_inc(&dquot->dq_count);
  563. spin_unlock(&dq_list_lock);
  564. dqstats_inc(DQST_LOOKUPS);
  565. sb->dq_op->write_dquot(dquot);
  566. dqput(dquot);
  567. spin_lock(&dq_list_lock);
  568. }
  569. spin_unlock(&dq_list_lock);
  570. }
  571. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  572. if ((cnt == type || type == -1) && sb_has_quota_active(sb, cnt)
  573. && info_dirty(&dqopt->info[cnt]))
  574. sb->dq_op->write_info(sb, cnt);
  575. dqstats_inc(DQST_SYNCS);
  576. mutex_unlock(&dqopt->dqonoff_mutex);
  577. if (!wait || (dqopt->flags & DQUOT_QUOTA_SYS_FILE))
  578. return 0;
  579. /* This is not very clever (and fast) but currently I don't know about
  580. * any other simple way of getting quota data to disk and we must get
  581. * them there for userspace to be visible... */
  582. if (sb->s_op->sync_fs)
  583. sb->s_op->sync_fs(sb, 1);
  584. sync_blockdev(sb->s_bdev);
  585. /*
  586. * Now when everything is written we can discard the pagecache so
  587. * that userspace sees the changes.
  588. */
  589. mutex_lock(&dqopt->dqonoff_mutex);
  590. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  591. if (type != -1 && cnt != type)
  592. continue;
  593. if (!sb_has_quota_active(sb, cnt))
  594. continue;
  595. mutex_lock(&dqopt->files[cnt]->i_mutex);
  596. truncate_inode_pages(&dqopt->files[cnt]->i_data, 0);
  597. mutex_unlock(&dqopt->files[cnt]->i_mutex);
  598. }
  599. mutex_unlock(&dqopt->dqonoff_mutex);
  600. return 0;
  601. }
  602. EXPORT_SYMBOL(dquot_quota_sync);
  603. /* Free unused dquots from cache */
  604. static void prune_dqcache(int count)
  605. {
  606. struct list_head *head;
  607. struct dquot *dquot;
  608. head = free_dquots.prev;
  609. while (head != &free_dquots && count) {
  610. dquot = list_entry(head, struct dquot, dq_free);
  611. remove_dquot_hash(dquot);
  612. remove_free_dquot(dquot);
  613. remove_inuse(dquot);
  614. do_destroy_dquot(dquot);
  615. count--;
  616. head = free_dquots.prev;
  617. }
  618. }
  619. /*
  620. * This is called from kswapd when we think we need some
  621. * more memory
  622. */
  623. static int shrink_dqcache_memory(struct shrinker *shrink,
  624. struct shrink_control *sc)
  625. {
  626. int nr = sc->nr_to_scan;
  627. if (nr) {
  628. spin_lock(&dq_list_lock);
  629. prune_dqcache(nr);
  630. spin_unlock(&dq_list_lock);
  631. }
  632. return ((unsigned)
  633. percpu_counter_read_positive(&dqstats.counter[DQST_FREE_DQUOTS])
  634. /100) * sysctl_vfs_cache_pressure;
  635. }
  636. static struct shrinker dqcache_shrinker = {
  637. .shrink = shrink_dqcache_memory,
  638. .seeks = DEFAULT_SEEKS,
  639. };
  640. /*
  641. * Put reference to dquot
  642. * NOTE: If you change this function please check whether dqput_blocks() works right...
  643. */
  644. void dqput(struct dquot *dquot)
  645. {
  646. int ret;
  647. if (!dquot)
  648. return;
  649. #ifdef CONFIG_QUOTA_DEBUG
  650. if (!atomic_read(&dquot->dq_count)) {
  651. quota_error(dquot->dq_sb, "trying to free free dquot of %s %d",
  652. quotatypes[dquot->dq_type], dquot->dq_id);
  653. BUG();
  654. }
  655. #endif
  656. dqstats_inc(DQST_DROPS);
  657. we_slept:
  658. spin_lock(&dq_list_lock);
  659. if (atomic_read(&dquot->dq_count) > 1) {
  660. /* We have more than one user... nothing to do */
  661. atomic_dec(&dquot->dq_count);
  662. /* Releasing dquot during quotaoff phase? */
  663. if (!sb_has_quota_active(dquot->dq_sb, dquot->dq_type) &&
  664. atomic_read(&dquot->dq_count) == 1)
  665. wake_up(&dquot->dq_wait_unused);
  666. spin_unlock(&dq_list_lock);
  667. return;
  668. }
  669. /* Need to release dquot? */
  670. if (test_bit(DQ_ACTIVE_B, &dquot->dq_flags) && dquot_dirty(dquot)) {
  671. spin_unlock(&dq_list_lock);
  672. /* Commit dquot before releasing */
  673. ret = dquot->dq_sb->dq_op->write_dquot(dquot);
  674. if (ret < 0) {
  675. quota_error(dquot->dq_sb, "Can't write quota structure"
  676. " (error %d). Quota may get out of sync!",
  677. ret);
  678. /*
  679. * We clear dirty bit anyway, so that we avoid
  680. * infinite loop here
  681. */
  682. spin_lock(&dq_list_lock);
  683. clear_dquot_dirty(dquot);
  684. spin_unlock(&dq_list_lock);
  685. }
  686. goto we_slept;
  687. }
  688. /* Clear flag in case dquot was inactive (something bad happened) */
  689. clear_dquot_dirty(dquot);
  690. if (test_bit(DQ_ACTIVE_B, &dquot->dq_flags)) {
  691. spin_unlock(&dq_list_lock);
  692. dquot->dq_sb->dq_op->release_dquot(dquot);
  693. goto we_slept;
  694. }
  695. atomic_dec(&dquot->dq_count);
  696. #ifdef CONFIG_QUOTA_DEBUG
  697. /* sanity check */
  698. BUG_ON(!list_empty(&dquot->dq_free));
  699. #endif
  700. put_dquot_last(dquot);
  701. spin_unlock(&dq_list_lock);
  702. }
  703. EXPORT_SYMBOL(dqput);
  704. struct dquot *dquot_alloc(struct super_block *sb, int type)
  705. {
  706. return kmem_cache_zalloc(dquot_cachep, GFP_NOFS);
  707. }
  708. EXPORT_SYMBOL(dquot_alloc);
  709. static struct dquot *get_empty_dquot(struct super_block *sb, int type)
  710. {
  711. struct dquot *dquot;
  712. dquot = sb->dq_op->alloc_dquot(sb, type);
  713. if(!dquot)
  714. return NULL;
  715. mutex_init(&dquot->dq_lock);
  716. INIT_LIST_HEAD(&dquot->dq_free);
  717. INIT_LIST_HEAD(&dquot->dq_inuse);
  718. INIT_HLIST_NODE(&dquot->dq_hash);
  719. INIT_LIST_HEAD(&dquot->dq_dirty);
  720. init_waitqueue_head(&dquot->dq_wait_unused);
  721. dquot->dq_sb = sb;
  722. dquot->dq_type = type;
  723. atomic_set(&dquot->dq_count, 1);
  724. return dquot;
  725. }
  726. /*
  727. * Get reference to dquot
  728. *
  729. * Locking is slightly tricky here. We are guarded from parallel quotaoff()
  730. * destroying our dquot by:
  731. * a) checking for quota flags under dq_list_lock and
  732. * b) getting a reference to dquot before we release dq_list_lock
  733. */
  734. struct dquot *dqget(struct super_block *sb, unsigned int id, int type)
  735. {
  736. unsigned int hashent = hashfn(sb, id, type);
  737. struct dquot *dquot = NULL, *empty = NULL;
  738. if (!sb_has_quota_active(sb, type))
  739. return NULL;
  740. we_slept:
  741. spin_lock(&dq_list_lock);
  742. spin_lock(&dq_state_lock);
  743. if (!sb_has_quota_active(sb, type)) {
  744. spin_unlock(&dq_state_lock);
  745. spin_unlock(&dq_list_lock);
  746. goto out;
  747. }
  748. spin_unlock(&dq_state_lock);
  749. dquot = find_dquot(hashent, sb, id, type);
  750. if (!dquot) {
  751. if (!empty) {
  752. spin_unlock(&dq_list_lock);
  753. empty = get_empty_dquot(sb, type);
  754. if (!empty)
  755. schedule(); /* Try to wait for a moment... */
  756. goto we_slept;
  757. }
  758. dquot = empty;
  759. empty = NULL;
  760. dquot->dq_id = id;
  761. /* all dquots go on the inuse_list */
  762. put_inuse(dquot);
  763. /* hash it first so it can be found */
  764. insert_dquot_hash(dquot);
  765. spin_unlock(&dq_list_lock);
  766. dqstats_inc(DQST_LOOKUPS);
  767. } else {
  768. if (!atomic_read(&dquot->dq_count))
  769. remove_free_dquot(dquot);
  770. atomic_inc(&dquot->dq_count);
  771. spin_unlock(&dq_list_lock);
  772. dqstats_inc(DQST_CACHE_HITS);
  773. dqstats_inc(DQST_LOOKUPS);
  774. }
  775. /* Wait for dq_lock - after this we know that either dquot_release() is
  776. * already finished or it will be canceled due to dq_count > 1 test */
  777. wait_on_dquot(dquot);
  778. /* Read the dquot / allocate space in quota file */
  779. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags) &&
  780. sb->dq_op->acquire_dquot(dquot) < 0) {
  781. dqput(dquot);
  782. dquot = NULL;
  783. goto out;
  784. }
  785. #ifdef CONFIG_QUOTA_DEBUG
  786. BUG_ON(!dquot->dq_sb); /* Has somebody invalidated entry under us? */
  787. #endif
  788. out:
  789. if (empty)
  790. do_destroy_dquot(empty);
  791. return dquot;
  792. }
  793. EXPORT_SYMBOL(dqget);
  794. static int dqinit_needed(struct inode *inode, int type)
  795. {
  796. int cnt;
  797. if (IS_NOQUOTA(inode))
  798. return 0;
  799. if (type != -1)
  800. return !inode->i_dquot[type];
  801. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  802. if (!inode->i_dquot[cnt])
  803. return 1;
  804. return 0;
  805. }
  806. /* This routine is guarded by dqonoff_mutex mutex */
  807. static void add_dquot_ref(struct super_block *sb, int type)
  808. {
  809. struct inode *inode, *old_inode = NULL;
  810. #ifdef CONFIG_QUOTA_DEBUG
  811. int reserved = 0;
  812. #endif
  813. spin_lock(&inode_sb_list_lock);
  814. list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
  815. spin_lock(&inode->i_lock);
  816. if ((inode->i_state & (I_FREEING|I_WILL_FREE|I_NEW)) ||
  817. !atomic_read(&inode->i_writecount) ||
  818. !dqinit_needed(inode, type)) {
  819. spin_unlock(&inode->i_lock);
  820. continue;
  821. }
  822. __iget(inode);
  823. spin_unlock(&inode->i_lock);
  824. spin_unlock(&inode_sb_list_lock);
  825. #ifdef CONFIG_QUOTA_DEBUG
  826. if (unlikely(inode_get_rsv_space(inode) > 0))
  827. reserved = 1;
  828. #endif
  829. iput(old_inode);
  830. __dquot_initialize(inode, type);
  831. /*
  832. * We hold a reference to 'inode' so it couldn't have been
  833. * removed from s_inodes list while we dropped the
  834. * inode_sb_list_lock We cannot iput the inode now as we can be
  835. * holding the last reference and we cannot iput it under
  836. * inode_sb_list_lock. So we keep the reference and iput it
  837. * later.
  838. */
  839. old_inode = inode;
  840. spin_lock(&inode_sb_list_lock);
  841. }
  842. spin_unlock(&inode_sb_list_lock);
  843. iput(old_inode);
  844. #ifdef CONFIG_QUOTA_DEBUG
  845. if (reserved) {
  846. quota_error(sb, "Writes happened before quota was turned on "
  847. "thus quota information is probably inconsistent. "
  848. "Please run quotacheck(8)");
  849. }
  850. #endif
  851. }
  852. /*
  853. * Return 0 if dqput() won't block.
  854. * (note that 1 doesn't necessarily mean blocking)
  855. */
  856. static inline int dqput_blocks(struct dquot *dquot)
  857. {
  858. if (atomic_read(&dquot->dq_count) <= 1)
  859. return 1;
  860. return 0;
  861. }
  862. /*
  863. * Remove references to dquots from inode and add dquot to list for freeing
  864. * if we have the last reference to dquot
  865. * We can't race with anybody because we hold dqptr_sem for writing...
  866. */
  867. static int remove_inode_dquot_ref(struct inode *inode, int type,
  868. struct list_head *tofree_head)
  869. {
  870. struct dquot *dquot = inode->i_dquot[type];
  871. inode->i_dquot[type] = NULL;
  872. if (dquot) {
  873. if (dqput_blocks(dquot)) {
  874. #ifdef CONFIG_QUOTA_DEBUG
  875. if (atomic_read(&dquot->dq_count) != 1)
  876. quota_error(inode->i_sb, "Adding dquot with "
  877. "dq_count %d to dispose list",
  878. atomic_read(&dquot->dq_count));
  879. #endif
  880. spin_lock(&dq_list_lock);
  881. /* As dquot must have currently users it can't be on
  882. * the free list... */
  883. list_add(&dquot->dq_free, tofree_head);
  884. spin_unlock(&dq_list_lock);
  885. return 1;
  886. }
  887. else
  888. dqput(dquot); /* We have guaranteed we won't block */
  889. }
  890. return 0;
  891. }
  892. /*
  893. * Free list of dquots
  894. * Dquots are removed from inodes and no new references can be got so we are
  895. * the only ones holding reference
  896. */
  897. static void put_dquot_list(struct list_head *tofree_head)
  898. {
  899. struct list_head *act_head;
  900. struct dquot *dquot;
  901. act_head = tofree_head->next;
  902. while (act_head != tofree_head) {
  903. dquot = list_entry(act_head, struct dquot, dq_free);
  904. act_head = act_head->next;
  905. /* Remove dquot from the list so we won't have problems... */
  906. list_del_init(&dquot->dq_free);
  907. dqput(dquot);
  908. }
  909. }
  910. static void remove_dquot_ref(struct super_block *sb, int type,
  911. struct list_head *tofree_head)
  912. {
  913. struct inode *inode;
  914. int reserved = 0;
  915. spin_lock(&inode_sb_list_lock);
  916. list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
  917. /*
  918. * We have to scan also I_NEW inodes because they can already
  919. * have quota pointer initialized. Luckily, we need to touch
  920. * only quota pointers and these have separate locking
  921. * (dqptr_sem).
  922. */
  923. if (!IS_NOQUOTA(inode)) {
  924. if (unlikely(inode_get_rsv_space(inode) > 0))
  925. reserved = 1;
  926. remove_inode_dquot_ref(inode, type, tofree_head);
  927. }
  928. }
  929. spin_unlock(&inode_sb_list_lock);
  930. #ifdef CONFIG_QUOTA_DEBUG
  931. if (reserved) {
  932. printk(KERN_WARNING "VFS (%s): Writes happened after quota"
  933. " was disabled thus quota information is probably "
  934. "inconsistent. Please run quotacheck(8).\n", sb->s_id);
  935. }
  936. #endif
  937. }
  938. /* Gather all references from inodes and drop them */
  939. static void drop_dquot_ref(struct super_block *sb, int type)
  940. {
  941. LIST_HEAD(tofree_head);
  942. if (sb->dq_op) {
  943. down_write(&sb_dqopt(sb)->dqptr_sem);
  944. remove_dquot_ref(sb, type, &tofree_head);
  945. up_write(&sb_dqopt(sb)->dqptr_sem);
  946. put_dquot_list(&tofree_head);
  947. }
  948. }
  949. static inline void dquot_incr_inodes(struct dquot *dquot, qsize_t number)
  950. {
  951. dquot->dq_dqb.dqb_curinodes += number;
  952. }
  953. static inline void dquot_incr_space(struct dquot *dquot, qsize_t number)
  954. {
  955. dquot->dq_dqb.dqb_curspace += number;
  956. }
  957. static inline void dquot_resv_space(struct dquot *dquot, qsize_t number)
  958. {
  959. dquot->dq_dqb.dqb_rsvspace += number;
  960. }
  961. /*
  962. * Claim reserved quota space
  963. */
  964. static void dquot_claim_reserved_space(struct dquot *dquot, qsize_t number)
  965. {
  966. if (dquot->dq_dqb.dqb_rsvspace < number) {
  967. WARN_ON_ONCE(1);
  968. number = dquot->dq_dqb.dqb_rsvspace;
  969. }
  970. dquot->dq_dqb.dqb_curspace += number;
  971. dquot->dq_dqb.dqb_rsvspace -= number;
  972. }
  973. static inline
  974. void dquot_free_reserved_space(struct dquot *dquot, qsize_t number)
  975. {
  976. if (dquot->dq_dqb.dqb_rsvspace >= number)
  977. dquot->dq_dqb.dqb_rsvspace -= number;
  978. else {
  979. WARN_ON_ONCE(1);
  980. dquot->dq_dqb.dqb_rsvspace = 0;
  981. }
  982. }
  983. static void dquot_decr_inodes(struct dquot *dquot, qsize_t number)
  984. {
  985. if (sb_dqopt(dquot->dq_sb)->flags & DQUOT_NEGATIVE_USAGE ||
  986. dquot->dq_dqb.dqb_curinodes >= number)
  987. dquot->dq_dqb.dqb_curinodes -= number;
  988. else
  989. dquot->dq_dqb.dqb_curinodes = 0;
  990. if (dquot->dq_dqb.dqb_curinodes <= dquot->dq_dqb.dqb_isoftlimit)
  991. dquot->dq_dqb.dqb_itime = (time_t) 0;
  992. clear_bit(DQ_INODES_B, &dquot->dq_flags);
  993. }
  994. static void dquot_decr_space(struct dquot *dquot, qsize_t number)
  995. {
  996. if (sb_dqopt(dquot->dq_sb)->flags & DQUOT_NEGATIVE_USAGE ||
  997. dquot->dq_dqb.dqb_curspace >= number)
  998. dquot->dq_dqb.dqb_curspace -= number;
  999. else
  1000. dquot->dq_dqb.dqb_curspace = 0;
  1001. if (dquot->dq_dqb.dqb_curspace <= dquot->dq_dqb.dqb_bsoftlimit)
  1002. dquot->dq_dqb.dqb_btime = (time_t) 0;
  1003. clear_bit(DQ_BLKS_B, &dquot->dq_flags);
  1004. }
  1005. struct dquot_warn {
  1006. struct super_block *w_sb;
  1007. qid_t w_dq_id;
  1008. short w_dq_type;
  1009. short w_type;
  1010. };
  1011. static int warning_issued(struct dquot *dquot, const int warntype)
  1012. {
  1013. int flag = (warntype == QUOTA_NL_BHARDWARN ||
  1014. warntype == QUOTA_NL_BSOFTLONGWARN) ? DQ_BLKS_B :
  1015. ((warntype == QUOTA_NL_IHARDWARN ||
  1016. warntype == QUOTA_NL_ISOFTLONGWARN) ? DQ_INODES_B : 0);
  1017. if (!flag)
  1018. return 0;
  1019. return test_and_set_bit(flag, &dquot->dq_flags);
  1020. }
  1021. #ifdef CONFIG_PRINT_QUOTA_WARNING
  1022. static int flag_print_warnings = 1;
  1023. static int need_print_warning(struct dquot_warn *warn)
  1024. {
  1025. if (!flag_print_warnings)
  1026. return 0;
  1027. switch (warn->w_dq_type) {
  1028. case USRQUOTA:
  1029. return current_fsuid() == warn->w_dq_id;
  1030. case GRPQUOTA:
  1031. return in_group_p(warn->w_dq_id);
  1032. }
  1033. return 0;
  1034. }
  1035. /* Print warning to user which exceeded quota */
  1036. static void print_warning(struct dquot_warn *warn)
  1037. {
  1038. char *msg = NULL;
  1039. struct tty_struct *tty;
  1040. int warntype = warn->w_type;
  1041. if (warntype == QUOTA_NL_IHARDBELOW ||
  1042. warntype == QUOTA_NL_ISOFTBELOW ||
  1043. warntype == QUOTA_NL_BHARDBELOW ||
  1044. warntype == QUOTA_NL_BSOFTBELOW || !need_print_warning(warn))
  1045. return;
  1046. tty = get_current_tty();
  1047. if (!tty)
  1048. return;
  1049. tty_write_message(tty, warn->w_sb->s_id);
  1050. if (warntype == QUOTA_NL_ISOFTWARN || warntype == QUOTA_NL_BSOFTWARN)
  1051. tty_write_message(tty, ": warning, ");
  1052. else
  1053. tty_write_message(tty, ": write failed, ");
  1054. tty_write_message(tty, quotatypes[warn->w_dq_type]);
  1055. switch (warntype) {
  1056. case QUOTA_NL_IHARDWARN:
  1057. msg = " file limit reached.\r\n";
  1058. break;
  1059. case QUOTA_NL_ISOFTLONGWARN:
  1060. msg = " file quota exceeded too long.\r\n";
  1061. break;
  1062. case QUOTA_NL_ISOFTWARN:
  1063. msg = " file quota exceeded.\r\n";
  1064. break;
  1065. case QUOTA_NL_BHARDWARN:
  1066. msg = " block limit reached.\r\n";
  1067. break;
  1068. case QUOTA_NL_BSOFTLONGWARN:
  1069. msg = " block quota exceeded too long.\r\n";
  1070. break;
  1071. case QUOTA_NL_BSOFTWARN:
  1072. msg = " block quota exceeded.\r\n";
  1073. break;
  1074. }
  1075. tty_write_message(tty, msg);
  1076. tty_kref_put(tty);
  1077. }
  1078. #endif
  1079. static void prepare_warning(struct dquot_warn *warn, struct dquot *dquot,
  1080. int warntype)
  1081. {
  1082. if (warning_issued(dquot, warntype))
  1083. return;
  1084. warn->w_type = warntype;
  1085. warn->w_sb = dquot->dq_sb;
  1086. warn->w_dq_id = dquot->dq_id;
  1087. warn->w_dq_type = dquot->dq_type;
  1088. }
  1089. /*
  1090. * Write warnings to the console and send warning messages over netlink.
  1091. *
  1092. * Note that this function can call into tty and networking code.
  1093. */
  1094. static void flush_warnings(struct dquot_warn *warn)
  1095. {
  1096. int i;
  1097. for (i = 0; i < MAXQUOTAS; i++) {
  1098. if (warn[i].w_type == QUOTA_NL_NOWARN)
  1099. continue;
  1100. #ifdef CONFIG_PRINT_QUOTA_WARNING
  1101. print_warning(&warn[i]);
  1102. #endif
  1103. quota_send_warning(warn[i].w_dq_type, warn[i].w_dq_id,
  1104. warn[i].w_sb->s_dev, warn[i].w_type);
  1105. }
  1106. }
  1107. static int ignore_hardlimit(struct dquot *dquot)
  1108. {
  1109. struct mem_dqinfo *info = &sb_dqopt(dquot->dq_sb)->info[dquot->dq_type];
  1110. return capable(CAP_SYS_RESOURCE) &&
  1111. (info->dqi_format->qf_fmt_id != QFMT_VFS_OLD ||
  1112. !(info->dqi_flags & V1_DQF_RSQUASH));
  1113. }
  1114. /* needs dq_data_lock */
  1115. static int check_idq(struct dquot *dquot, qsize_t inodes,
  1116. struct dquot_warn *warn)
  1117. {
  1118. qsize_t newinodes = dquot->dq_dqb.dqb_curinodes + inodes;
  1119. if (!sb_has_quota_limits_enabled(dquot->dq_sb, dquot->dq_type) ||
  1120. test_bit(DQ_FAKE_B, &dquot->dq_flags))
  1121. return 0;
  1122. if (dquot->dq_dqb.dqb_ihardlimit &&
  1123. newinodes > dquot->dq_dqb.dqb_ihardlimit &&
  1124. !ignore_hardlimit(dquot)) {
  1125. prepare_warning(warn, dquot, QUOTA_NL_IHARDWARN);
  1126. return -EDQUOT;
  1127. }
  1128. if (dquot->dq_dqb.dqb_isoftlimit &&
  1129. newinodes > dquot->dq_dqb.dqb_isoftlimit &&
  1130. dquot->dq_dqb.dqb_itime &&
  1131. get_seconds() >= dquot->dq_dqb.dqb_itime &&
  1132. !ignore_hardlimit(dquot)) {
  1133. prepare_warning(warn, dquot, QUOTA_NL_ISOFTLONGWARN);
  1134. return -EDQUOT;
  1135. }
  1136. if (dquot->dq_dqb.dqb_isoftlimit &&
  1137. newinodes > dquot->dq_dqb.dqb_isoftlimit &&
  1138. dquot->dq_dqb.dqb_itime == 0) {
  1139. prepare_warning(warn, dquot, QUOTA_NL_ISOFTWARN);
  1140. dquot->dq_dqb.dqb_itime = get_seconds() +
  1141. sb_dqopt(dquot->dq_sb)->info[dquot->dq_type].dqi_igrace;
  1142. }
  1143. return 0;
  1144. }
  1145. /* needs dq_data_lock */
  1146. static int check_bdq(struct dquot *dquot, qsize_t space, int prealloc,
  1147. struct dquot_warn *warn)
  1148. {
  1149. qsize_t tspace;
  1150. struct super_block *sb = dquot->dq_sb;
  1151. if (!sb_has_quota_limits_enabled(sb, dquot->dq_type) ||
  1152. test_bit(DQ_FAKE_B, &dquot->dq_flags))
  1153. return 0;
  1154. tspace = dquot->dq_dqb.dqb_curspace + dquot->dq_dqb.dqb_rsvspace
  1155. + space;
  1156. if (dquot->dq_dqb.dqb_bhardlimit &&
  1157. tspace > dquot->dq_dqb.dqb_bhardlimit &&
  1158. !ignore_hardlimit(dquot)) {
  1159. if (!prealloc)
  1160. prepare_warning(warn, dquot, QUOTA_NL_BHARDWARN);
  1161. return -EDQUOT;
  1162. }
  1163. if (dquot->dq_dqb.dqb_bsoftlimit &&
  1164. tspace > dquot->dq_dqb.dqb_bsoftlimit &&
  1165. dquot->dq_dqb.dqb_btime &&
  1166. get_seconds() >= dquot->dq_dqb.dqb_btime &&
  1167. !ignore_hardlimit(dquot)) {
  1168. if (!prealloc)
  1169. prepare_warning(warn, dquot, QUOTA_NL_BSOFTLONGWARN);
  1170. return -EDQUOT;
  1171. }
  1172. if (dquot->dq_dqb.dqb_bsoftlimit &&
  1173. tspace > dquot->dq_dqb.dqb_bsoftlimit &&
  1174. dquot->dq_dqb.dqb_btime == 0) {
  1175. if (!prealloc) {
  1176. prepare_warning(warn, dquot, QUOTA_NL_BSOFTWARN);
  1177. dquot->dq_dqb.dqb_btime = get_seconds() +
  1178. sb_dqopt(sb)->info[dquot->dq_type].dqi_bgrace;
  1179. }
  1180. else
  1181. /*
  1182. * We don't allow preallocation to exceed softlimit so exceeding will
  1183. * be always printed
  1184. */
  1185. return -EDQUOT;
  1186. }
  1187. return 0;
  1188. }
  1189. static int info_idq_free(struct dquot *dquot, qsize_t inodes)
  1190. {
  1191. qsize_t newinodes;
  1192. if (test_bit(DQ_FAKE_B, &dquot->dq_flags) ||
  1193. dquot->dq_dqb.dqb_curinodes <= dquot->dq_dqb.dqb_isoftlimit ||
  1194. !sb_has_quota_limits_enabled(dquot->dq_sb, dquot->dq_type))
  1195. return QUOTA_NL_NOWARN;
  1196. newinodes = dquot->dq_dqb.dqb_curinodes - inodes;
  1197. if (newinodes <= dquot->dq_dqb.dqb_isoftlimit)
  1198. return QUOTA_NL_ISOFTBELOW;
  1199. if (dquot->dq_dqb.dqb_curinodes >= dquot->dq_dqb.dqb_ihardlimit &&
  1200. newinodes < dquot->dq_dqb.dqb_ihardlimit)
  1201. return QUOTA_NL_IHARDBELOW;
  1202. return QUOTA_NL_NOWARN;
  1203. }
  1204. static int info_bdq_free(struct dquot *dquot, qsize_t space)
  1205. {
  1206. if (test_bit(DQ_FAKE_B, &dquot->dq_flags) ||
  1207. dquot->dq_dqb.dqb_curspace <= dquot->dq_dqb.dqb_bsoftlimit)
  1208. return QUOTA_NL_NOWARN;
  1209. if (dquot->dq_dqb.dqb_curspace - space <= dquot->dq_dqb.dqb_bsoftlimit)
  1210. return QUOTA_NL_BSOFTBELOW;
  1211. if (dquot->dq_dqb.dqb_curspace >= dquot->dq_dqb.dqb_bhardlimit &&
  1212. dquot->dq_dqb.dqb_curspace - space < dquot->dq_dqb.dqb_bhardlimit)
  1213. return QUOTA_NL_BHARDBELOW;
  1214. return QUOTA_NL_NOWARN;
  1215. }
  1216. static int dquot_active(const struct inode *inode)
  1217. {
  1218. struct super_block *sb = inode->i_sb;
  1219. if (IS_NOQUOTA(inode))
  1220. return 0;
  1221. return sb_any_quota_loaded(sb) & ~sb_any_quota_suspended(sb);
  1222. }
  1223. /*
  1224. * Initialize quota pointers in inode
  1225. *
  1226. * We do things in a bit complicated way but by that we avoid calling
  1227. * dqget() and thus filesystem callbacks under dqptr_sem.
  1228. *
  1229. * It is better to call this function outside of any transaction as it
  1230. * might need a lot of space in journal for dquot structure allocation.
  1231. */
  1232. static void __dquot_initialize(struct inode *inode, int type)
  1233. {
  1234. unsigned int id = 0;
  1235. int cnt;
  1236. struct dquot *got[MAXQUOTAS];
  1237. struct super_block *sb = inode->i_sb;
  1238. qsize_t rsv;
  1239. /* First test before acquiring mutex - solves deadlocks when we
  1240. * re-enter the quota code and are already holding the mutex */
  1241. if (!dquot_active(inode))
  1242. return;
  1243. /* First get references to structures we might need. */
  1244. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1245. got[cnt] = NULL;
  1246. if (type != -1 && cnt != type)
  1247. continue;
  1248. switch (cnt) {
  1249. case USRQUOTA:
  1250. id = inode->i_uid;
  1251. break;
  1252. case GRPQUOTA:
  1253. id = inode->i_gid;
  1254. break;
  1255. }
  1256. got[cnt] = dqget(sb, id, cnt);
  1257. }
  1258. down_write(&sb_dqopt(sb)->dqptr_sem);
  1259. if (IS_NOQUOTA(inode))
  1260. goto out_err;
  1261. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1262. if (type != -1 && cnt != type)
  1263. continue;
  1264. /* Avoid races with quotaoff() */
  1265. if (!sb_has_quota_active(sb, cnt))
  1266. continue;
  1267. /* We could race with quotaon or dqget() could have failed */
  1268. if (!got[cnt])
  1269. continue;
  1270. if (!inode->i_dquot[cnt]) {
  1271. inode->i_dquot[cnt] = got[cnt];
  1272. got[cnt] = NULL;
  1273. /*
  1274. * Make quota reservation system happy if someone
  1275. * did a write before quota was turned on
  1276. */
  1277. rsv = inode_get_rsv_space(inode);
  1278. if (unlikely(rsv))
  1279. dquot_resv_space(inode->i_dquot[cnt], rsv);
  1280. }
  1281. }
  1282. out_err:
  1283. up_write(&sb_dqopt(sb)->dqptr_sem);
  1284. /* Drop unused references */
  1285. dqput_all(got);
  1286. }
  1287. void dquot_initialize(struct inode *inode)
  1288. {
  1289. __dquot_initialize(inode, -1);
  1290. }
  1291. EXPORT_SYMBOL(dquot_initialize);
  1292. /*
  1293. * Release all quotas referenced by inode
  1294. */
  1295. static void __dquot_drop(struct inode *inode)
  1296. {
  1297. int cnt;
  1298. struct dquot *put[MAXQUOTAS];
  1299. down_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1300. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1301. put[cnt] = inode->i_dquot[cnt];
  1302. inode->i_dquot[cnt] = NULL;
  1303. }
  1304. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1305. dqput_all(put);
  1306. }
  1307. void dquot_drop(struct inode *inode)
  1308. {
  1309. int cnt;
  1310. if (IS_NOQUOTA(inode))
  1311. return;
  1312. /*
  1313. * Test before calling to rule out calls from proc and such
  1314. * where we are not allowed to block. Note that this is
  1315. * actually reliable test even without the lock - the caller
  1316. * must assure that nobody can come after the DQUOT_DROP and
  1317. * add quota pointers back anyway.
  1318. */
  1319. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1320. if (inode->i_dquot[cnt])
  1321. break;
  1322. }
  1323. if (cnt < MAXQUOTAS)
  1324. __dquot_drop(inode);
  1325. }
  1326. EXPORT_SYMBOL(dquot_drop);
  1327. /*
  1328. * inode_reserved_space is managed internally by quota, and protected by
  1329. * i_lock similar to i_blocks+i_bytes.
  1330. */
  1331. static qsize_t *inode_reserved_space(struct inode * inode)
  1332. {
  1333. /* Filesystem must explicitly define it's own method in order to use
  1334. * quota reservation interface */
  1335. BUG_ON(!inode->i_sb->dq_op->get_reserved_space);
  1336. return inode->i_sb->dq_op->get_reserved_space(inode);
  1337. }
  1338. void inode_add_rsv_space(struct inode *inode, qsize_t number)
  1339. {
  1340. spin_lock(&inode->i_lock);
  1341. *inode_reserved_space(inode) += number;
  1342. spin_unlock(&inode->i_lock);
  1343. }
  1344. EXPORT_SYMBOL(inode_add_rsv_space);
  1345. void inode_claim_rsv_space(struct inode *inode, qsize_t number)
  1346. {
  1347. spin_lock(&inode->i_lock);
  1348. *inode_reserved_space(inode) -= number;
  1349. __inode_add_bytes(inode, number);
  1350. spin_unlock(&inode->i_lock);
  1351. }
  1352. EXPORT_SYMBOL(inode_claim_rsv_space);
  1353. void inode_sub_rsv_space(struct inode *inode, qsize_t number)
  1354. {
  1355. spin_lock(&inode->i_lock);
  1356. *inode_reserved_space(inode) -= number;
  1357. spin_unlock(&inode->i_lock);
  1358. }
  1359. EXPORT_SYMBOL(inode_sub_rsv_space);
  1360. static qsize_t inode_get_rsv_space(struct inode *inode)
  1361. {
  1362. qsize_t ret;
  1363. if (!inode->i_sb->dq_op->get_reserved_space)
  1364. return 0;
  1365. spin_lock(&inode->i_lock);
  1366. ret = *inode_reserved_space(inode);
  1367. spin_unlock(&inode->i_lock);
  1368. return ret;
  1369. }
  1370. static void inode_incr_space(struct inode *inode, qsize_t number,
  1371. int reserve)
  1372. {
  1373. if (reserve)
  1374. inode_add_rsv_space(inode, number);
  1375. else
  1376. inode_add_bytes(inode, number);
  1377. }
  1378. static void inode_decr_space(struct inode *inode, qsize_t number, int reserve)
  1379. {
  1380. if (reserve)
  1381. inode_sub_rsv_space(inode, number);
  1382. else
  1383. inode_sub_bytes(inode, number);
  1384. }
  1385. /*
  1386. * This functions updates i_blocks+i_bytes fields and quota information
  1387. * (together with appropriate checks).
  1388. *
  1389. * NOTE: We absolutely rely on the fact that caller dirties the inode
  1390. * (usually helpers in quotaops.h care about this) and holds a handle for
  1391. * the current transaction so that dquot write and inode write go into the
  1392. * same transaction.
  1393. */
  1394. /*
  1395. * This operation can block, but only after everything is updated
  1396. */
  1397. int __dquot_alloc_space(struct inode *inode, qsize_t number, int flags)
  1398. {
  1399. int cnt, ret = 0;
  1400. struct dquot_warn warn[MAXQUOTAS];
  1401. struct dquot **dquots = inode->i_dquot;
  1402. int reserve = flags & DQUOT_SPACE_RESERVE;
  1403. /*
  1404. * First test before acquiring mutex - solves deadlocks when we
  1405. * re-enter the quota code and are already holding the mutex
  1406. */
  1407. if (!dquot_active(inode)) {
  1408. inode_incr_space(inode, number, reserve);
  1409. goto out;
  1410. }
  1411. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1412. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1413. warn[cnt].w_type = QUOTA_NL_NOWARN;
  1414. spin_lock(&dq_data_lock);
  1415. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1416. if (!dquots[cnt])
  1417. continue;
  1418. ret = check_bdq(dquots[cnt], number,
  1419. !(flags & DQUOT_SPACE_WARN), &warn[cnt]);
  1420. if (ret && !(flags & DQUOT_SPACE_NOFAIL)) {
  1421. spin_unlock(&dq_data_lock);
  1422. goto out_flush_warn;
  1423. }
  1424. }
  1425. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1426. if (!dquots[cnt])
  1427. continue;
  1428. if (reserve)
  1429. dquot_resv_space(dquots[cnt], number);
  1430. else
  1431. dquot_incr_space(dquots[cnt], number);
  1432. }
  1433. inode_incr_space(inode, number, reserve);
  1434. spin_unlock(&dq_data_lock);
  1435. if (reserve)
  1436. goto out_flush_warn;
  1437. mark_all_dquot_dirty(dquots);
  1438. out_flush_warn:
  1439. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1440. flush_warnings(warn);
  1441. out:
  1442. return ret;
  1443. }
  1444. EXPORT_SYMBOL(__dquot_alloc_space);
  1445. /*
  1446. * This operation can block, but only after everything is updated
  1447. */
  1448. int dquot_alloc_inode(const struct inode *inode)
  1449. {
  1450. int cnt, ret = 0;
  1451. struct dquot_warn warn[MAXQUOTAS];
  1452. struct dquot * const *dquots = inode->i_dquot;
  1453. /* First test before acquiring mutex - solves deadlocks when we
  1454. * re-enter the quota code and are already holding the mutex */
  1455. if (!dquot_active(inode))
  1456. return 0;
  1457. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1458. warn[cnt].w_type = QUOTA_NL_NOWARN;
  1459. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1460. spin_lock(&dq_data_lock);
  1461. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1462. if (!dquots[cnt])
  1463. continue;
  1464. ret = check_idq(dquots[cnt], 1, &warn[cnt]);
  1465. if (ret)
  1466. goto warn_put_all;
  1467. }
  1468. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1469. if (!dquots[cnt])
  1470. continue;
  1471. dquot_incr_inodes(dquots[cnt], 1);
  1472. }
  1473. warn_put_all:
  1474. spin_unlock(&dq_data_lock);
  1475. if (ret == 0)
  1476. mark_all_dquot_dirty(dquots);
  1477. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1478. flush_warnings(warn);
  1479. return ret;
  1480. }
  1481. EXPORT_SYMBOL(dquot_alloc_inode);
  1482. /*
  1483. * Convert in-memory reserved quotas to real consumed quotas
  1484. */
  1485. int dquot_claim_space_nodirty(struct inode *inode, qsize_t number)
  1486. {
  1487. int cnt;
  1488. if (!dquot_active(inode)) {
  1489. inode_claim_rsv_space(inode, number);
  1490. return 0;
  1491. }
  1492. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1493. spin_lock(&dq_data_lock);
  1494. /* Claim reserved quotas to allocated quotas */
  1495. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1496. if (inode->i_dquot[cnt])
  1497. dquot_claim_reserved_space(inode->i_dquot[cnt],
  1498. number);
  1499. }
  1500. /* Update inode bytes */
  1501. inode_claim_rsv_space(inode, number);
  1502. spin_unlock(&dq_data_lock);
  1503. mark_all_dquot_dirty(inode->i_dquot);
  1504. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1505. return 0;
  1506. }
  1507. EXPORT_SYMBOL(dquot_claim_space_nodirty);
  1508. /*
  1509. * This operation can block, but only after everything is updated
  1510. */
  1511. void __dquot_free_space(struct inode *inode, qsize_t number, int flags)
  1512. {
  1513. unsigned int cnt;
  1514. struct dquot_warn warn[MAXQUOTAS];
  1515. struct dquot **dquots = inode->i_dquot;
  1516. int reserve = flags & DQUOT_SPACE_RESERVE;
  1517. /* First test before acquiring mutex - solves deadlocks when we
  1518. * re-enter the quota code and are already holding the mutex */
  1519. if (!dquot_active(inode)) {
  1520. inode_decr_space(inode, number, reserve);
  1521. return;
  1522. }
  1523. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1524. spin_lock(&dq_data_lock);
  1525. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1526. int wtype;
  1527. warn[cnt].w_type = QUOTA_NL_NOWARN;
  1528. if (!dquots[cnt])
  1529. continue;
  1530. wtype = info_bdq_free(dquots[cnt], number);
  1531. if (wtype != QUOTA_NL_NOWARN)
  1532. prepare_warning(&warn[cnt], dquots[cnt], wtype);
  1533. if (reserve)
  1534. dquot_free_reserved_space(dquots[cnt], number);
  1535. else
  1536. dquot_decr_space(dquots[cnt], number);
  1537. }
  1538. inode_decr_space(inode, number, reserve);
  1539. spin_unlock(&dq_data_lock);
  1540. if (reserve)
  1541. goto out_unlock;
  1542. mark_all_dquot_dirty(dquots);
  1543. out_unlock:
  1544. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1545. flush_warnings(warn);
  1546. }
  1547. EXPORT_SYMBOL(__dquot_free_space);
  1548. /*
  1549. * This operation can block, but only after everything is updated
  1550. */
  1551. void dquot_free_inode(const struct inode *inode)
  1552. {
  1553. unsigned int cnt;
  1554. struct dquot_warn warn[MAXQUOTAS];
  1555. struct dquot * const *dquots = inode->i_dquot;
  1556. /* First test before acquiring mutex - solves deadlocks when we
  1557. * re-enter the quota code and are already holding the mutex */
  1558. if (!dquot_active(inode))
  1559. return;
  1560. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1561. spin_lock(&dq_data_lock);
  1562. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1563. int wtype;
  1564. warn[cnt].w_type = QUOTA_NL_NOWARN;
  1565. if (!dquots[cnt])
  1566. continue;
  1567. wtype = info_idq_free(dquots[cnt], 1);
  1568. if (wtype != QUOTA_NL_NOWARN)
  1569. prepare_warning(&warn[cnt], dquots[cnt], wtype);
  1570. dquot_decr_inodes(dquots[cnt], 1);
  1571. }
  1572. spin_unlock(&dq_data_lock);
  1573. mark_all_dquot_dirty(dquots);
  1574. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1575. flush_warnings(warn);
  1576. }
  1577. EXPORT_SYMBOL(dquot_free_inode);
  1578. /*
  1579. * Transfer the number of inode and blocks from one diskquota to an other.
  1580. * On success, dquot references in transfer_to are consumed and references
  1581. * to original dquots that need to be released are placed there. On failure,
  1582. * references are kept untouched.
  1583. *
  1584. * This operation can block, but only after everything is updated
  1585. * A transaction must be started when entering this function.
  1586. *
  1587. */
  1588. int __dquot_transfer(struct inode *inode, struct dquot **transfer_to)
  1589. {
  1590. qsize_t space, cur_space;
  1591. qsize_t rsv_space = 0;
  1592. struct dquot *transfer_from[MAXQUOTAS] = {};
  1593. int cnt, ret = 0;
  1594. char is_valid[MAXQUOTAS] = {};
  1595. struct dquot_warn warn_to[MAXQUOTAS];
  1596. struct dquot_warn warn_from_inodes[MAXQUOTAS];
  1597. struct dquot_warn warn_from_space[MAXQUOTAS];
  1598. /* First test before acquiring mutex - solves deadlocks when we
  1599. * re-enter the quota code and are already holding the mutex */
  1600. if (IS_NOQUOTA(inode))
  1601. return 0;
  1602. /* Initialize the arrays */
  1603. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1604. warn_to[cnt].w_type = QUOTA_NL_NOWARN;
  1605. warn_from_inodes[cnt].w_type = QUOTA_NL_NOWARN;
  1606. warn_from_space[cnt].w_type = QUOTA_NL_NOWARN;
  1607. }
  1608. down_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1609. if (IS_NOQUOTA(inode)) { /* File without quota accounting? */
  1610. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1611. return 0;
  1612. }
  1613. spin_lock(&dq_data_lock);
  1614. cur_space = inode_get_bytes(inode);
  1615. rsv_space = inode_get_rsv_space(inode);
  1616. space = cur_space + rsv_space;
  1617. /* Build the transfer_from list and check the limits */
  1618. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1619. /*
  1620. * Skip changes for same uid or gid or for turned off quota-type.
  1621. */
  1622. if (!transfer_to[cnt])
  1623. continue;
  1624. /* Avoid races with quotaoff() */
  1625. if (!sb_has_quota_active(inode->i_sb, cnt))
  1626. continue;
  1627. is_valid[cnt] = 1;
  1628. transfer_from[cnt] = inode->i_dquot[cnt];
  1629. ret = check_idq(transfer_to[cnt], 1, &warn_to[cnt]);
  1630. if (ret)
  1631. goto over_quota;
  1632. ret = check_bdq(transfer_to[cnt], space, 0, &warn_to[cnt]);
  1633. if (ret)
  1634. goto over_quota;
  1635. }
  1636. /*
  1637. * Finally perform the needed transfer from transfer_from to transfer_to
  1638. */
  1639. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1640. if (!is_valid[cnt])
  1641. continue;
  1642. /* Due to IO error we might not have transfer_from[] structure */
  1643. if (transfer_from[cnt]) {
  1644. int wtype;
  1645. wtype = info_idq_free(transfer_from[cnt], 1);
  1646. if (wtype != QUOTA_NL_NOWARN)
  1647. prepare_warning(&warn_from_inodes[cnt],
  1648. transfer_from[cnt], wtype);
  1649. wtype = info_bdq_free(transfer_from[cnt], space);
  1650. if (wtype != QUOTA_NL_NOWARN)
  1651. prepare_warning(&warn_from_space[cnt],
  1652. transfer_from[cnt], wtype);
  1653. dquot_decr_inodes(transfer_from[cnt], 1);
  1654. dquot_decr_space(transfer_from[cnt], cur_space);
  1655. dquot_free_reserved_space(transfer_from[cnt],
  1656. rsv_space);
  1657. }
  1658. dquot_incr_inodes(transfer_to[cnt], 1);
  1659. dquot_incr_space(transfer_to[cnt], cur_space);
  1660. dquot_resv_space(transfer_to[cnt], rsv_space);
  1661. inode->i_dquot[cnt] = transfer_to[cnt];
  1662. }
  1663. spin_unlock(&dq_data_lock);
  1664. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1665. mark_all_dquot_dirty(transfer_from);
  1666. mark_all_dquot_dirty(transfer_to);
  1667. flush_warnings(warn_to);
  1668. flush_warnings(warn_from_inodes);
  1669. flush_warnings(warn_from_space);
  1670. /* Pass back references to put */
  1671. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1672. if (is_valid[cnt])
  1673. transfer_to[cnt] = transfer_from[cnt];
  1674. return 0;
  1675. over_quota:
  1676. spin_unlock(&dq_data_lock);
  1677. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1678. flush_warnings(warn_to);
  1679. return ret;
  1680. }
  1681. EXPORT_SYMBOL(__dquot_transfer);
  1682. /* Wrapper for transferring ownership of an inode for uid/gid only
  1683. * Called from FSXXX_setattr()
  1684. */
  1685. int dquot_transfer(struct inode *inode, struct iattr *iattr)
  1686. {
  1687. struct dquot *transfer_to[MAXQUOTAS] = {};
  1688. struct super_block *sb = inode->i_sb;
  1689. int ret;
  1690. if (!dquot_active(inode))
  1691. return 0;
  1692. if (iattr->ia_valid & ATTR_UID && iattr->ia_uid != inode->i_uid)
  1693. transfer_to[USRQUOTA] = dqget(sb, iattr->ia_uid, USRQUOTA);
  1694. if (iattr->ia_valid & ATTR_GID && iattr->ia_gid != inode->i_gid)
  1695. transfer_to[GRPQUOTA] = dqget(sb, iattr->ia_gid, GRPQUOTA);
  1696. ret = __dquot_transfer(inode, transfer_to);
  1697. dqput_all(transfer_to);
  1698. return ret;
  1699. }
  1700. EXPORT_SYMBOL(dquot_transfer);
  1701. /*
  1702. * Write info of quota file to disk
  1703. */
  1704. int dquot_commit_info(struct super_block *sb, int type)
  1705. {
  1706. int ret;
  1707. struct quota_info *dqopt = sb_dqopt(sb);
  1708. mutex_lock(&dqopt->dqio_mutex);
  1709. ret = dqopt->ops[type]->write_file_info(sb, type);
  1710. mutex_unlock(&dqopt->dqio_mutex);
  1711. return ret;
  1712. }
  1713. EXPORT_SYMBOL(dquot_commit_info);
  1714. /*
  1715. * Definitions of diskquota operations.
  1716. */
  1717. const struct dquot_operations dquot_operations = {
  1718. .write_dquot = dquot_commit,
  1719. .acquire_dquot = dquot_acquire,
  1720. .release_dquot = dquot_release,
  1721. .mark_dirty = dquot_mark_dquot_dirty,
  1722. .write_info = dquot_commit_info,
  1723. .alloc_dquot = dquot_alloc,
  1724. .destroy_dquot = dquot_destroy,
  1725. };
  1726. EXPORT_SYMBOL(dquot_operations);
  1727. /*
  1728. * Generic helper for ->open on filesystems supporting disk quotas.
  1729. */
  1730. int dquot_file_open(struct inode *inode, struct file *file)
  1731. {
  1732. int error;
  1733. error = generic_file_open(inode, file);
  1734. if (!error && (file->f_mode & FMODE_WRITE))
  1735. dquot_initialize(inode);
  1736. return error;
  1737. }
  1738. EXPORT_SYMBOL(dquot_file_open);
  1739. /*
  1740. * Turn quota off on a device. type == -1 ==> quotaoff for all types (umount)
  1741. */
  1742. int dquot_disable(struct super_block *sb, int type, unsigned int flags)
  1743. {
  1744. int cnt, ret = 0;
  1745. struct quota_info *dqopt = sb_dqopt(sb);
  1746. struct inode *toputinode[MAXQUOTAS];
  1747. /* Cannot turn off usage accounting without turning off limits, or
  1748. * suspend quotas and simultaneously turn quotas off. */
  1749. if ((flags & DQUOT_USAGE_ENABLED && !(flags & DQUOT_LIMITS_ENABLED))
  1750. || (flags & DQUOT_SUSPENDED && flags & (DQUOT_LIMITS_ENABLED |
  1751. DQUOT_USAGE_ENABLED)))
  1752. return -EINVAL;
  1753. /* We need to serialize quota_off() for device */
  1754. mutex_lock(&dqopt->dqonoff_mutex);
  1755. /*
  1756. * Skip everything if there's nothing to do. We have to do this because
  1757. * sometimes we are called when fill_super() failed and calling
  1758. * sync_fs() in such cases does no good.
  1759. */
  1760. if (!sb_any_quota_loaded(sb)) {
  1761. mutex_unlock(&dqopt->dqonoff_mutex);
  1762. return 0;
  1763. }
  1764. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1765. toputinode[cnt] = NULL;
  1766. if (type != -1 && cnt != type)
  1767. continue;
  1768. if (!sb_has_quota_loaded(sb, cnt))
  1769. continue;
  1770. if (flags & DQUOT_SUSPENDED) {
  1771. spin_lock(&dq_state_lock);
  1772. dqopt->flags |=
  1773. dquot_state_flag(DQUOT_SUSPENDED, cnt);
  1774. spin_unlock(&dq_state_lock);
  1775. } else {
  1776. spin_lock(&dq_state_lock);
  1777. dqopt->flags &= ~dquot_state_flag(flags, cnt);
  1778. /* Turning off suspended quotas? */
  1779. if (!sb_has_quota_loaded(sb, cnt) &&
  1780. sb_has_quota_suspended(sb, cnt)) {
  1781. dqopt->flags &= ~dquot_state_flag(
  1782. DQUOT_SUSPENDED, cnt);
  1783. spin_unlock(&dq_state_lock);
  1784. iput(dqopt->files[cnt]);
  1785. dqopt->files[cnt] = NULL;
  1786. continue;
  1787. }
  1788. spin_unlock(&dq_state_lock);
  1789. }
  1790. /* We still have to keep quota loaded? */
  1791. if (sb_has_quota_loaded(sb, cnt) && !(flags & DQUOT_SUSPENDED))
  1792. continue;
  1793. /* Note: these are blocking operations */
  1794. drop_dquot_ref(sb, cnt);
  1795. invalidate_dquots(sb, cnt);
  1796. /*
  1797. * Now all dquots should be invalidated, all writes done so we
  1798. * should be only users of the info. No locks needed.
  1799. */
  1800. if (info_dirty(&dqopt->info[cnt]))
  1801. sb->dq_op->write_info(sb, cnt);
  1802. if (dqopt->ops[cnt]->free_file_info)
  1803. dqopt->ops[cnt]->free_file_info(sb, cnt);
  1804. put_quota_format(dqopt->info[cnt].dqi_format);
  1805. toputinode[cnt] = dqopt->files[cnt];
  1806. if (!sb_has_quota_loaded(sb, cnt))
  1807. dqopt->files[cnt] = NULL;
  1808. dqopt->info[cnt].dqi_flags = 0;
  1809. dqopt->info[cnt].dqi_igrace = 0;
  1810. dqopt->info[cnt].dqi_bgrace = 0;
  1811. dqopt->ops[cnt] = NULL;
  1812. }
  1813. mutex_unlock(&dqopt->dqonoff_mutex);
  1814. /* Skip syncing and setting flags if quota files are hidden */
  1815. if (dqopt->flags & DQUOT_QUOTA_SYS_FILE)
  1816. goto put_inodes;
  1817. /* Sync the superblock so that buffers with quota data are written to
  1818. * disk (and so userspace sees correct data afterwards). */
  1819. if (sb->s_op->sync_fs)
  1820. sb->s_op->sync_fs(sb, 1);
  1821. sync_blockdev(sb->s_bdev);
  1822. /* Now the quota files are just ordinary files and we can set the
  1823. * inode flags back. Moreover we discard the pagecache so that
  1824. * userspace sees the writes we did bypassing the pagecache. We
  1825. * must also discard the blockdev buffers so that we see the
  1826. * changes done by userspace on the next quotaon() */
  1827. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1828. if (toputinode[cnt]) {
  1829. mutex_lock(&dqopt->dqonoff_mutex);
  1830. /* If quota was reenabled in the meantime, we have
  1831. * nothing to do */
  1832. if (!sb_has_quota_loaded(sb, cnt)) {
  1833. mutex_lock(&toputinode[cnt]->i_mutex);
  1834. toputinode[cnt]->i_flags &= ~(S_IMMUTABLE |
  1835. S_NOATIME | S_NOQUOTA);
  1836. truncate_inode_pages(&toputinode[cnt]->i_data,
  1837. 0);
  1838. mutex_unlock(&toputinode[cnt]->i_mutex);
  1839. mark_inode_dirty_sync(toputinode[cnt]);
  1840. }
  1841. mutex_unlock(&dqopt->dqonoff_mutex);
  1842. }
  1843. if (sb->s_bdev)
  1844. invalidate_bdev(sb->s_bdev);
  1845. put_inodes:
  1846. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1847. if (toputinode[cnt]) {
  1848. /* On remount RO, we keep the inode pointer so that we
  1849. * can reenable quota on the subsequent remount RW. We
  1850. * have to check 'flags' variable and not use sb_has_
  1851. * function because another quotaon / quotaoff could
  1852. * change global state before we got here. We refuse
  1853. * to suspend quotas when there is pending delete on
  1854. * the quota file... */
  1855. if (!(flags & DQUOT_SUSPENDED))
  1856. iput(toputinode[cnt]);
  1857. else if (!toputinode[cnt]->i_nlink)
  1858. ret = -EBUSY;
  1859. }
  1860. return ret;
  1861. }
  1862. EXPORT_SYMBOL(dquot_disable);
  1863. int dquot_quota_off(struct super_block *sb, int type)
  1864. {
  1865. return dquot_disable(sb, type,
  1866. DQUOT_USAGE_ENABLED | DQUOT_LIMITS_ENABLED);
  1867. }
  1868. EXPORT_SYMBOL(dquot_quota_off);
  1869. /*
  1870. * Turn quotas on on a device
  1871. */
  1872. /*
  1873. * Helper function to turn quotas on when we already have the inode of
  1874. * quota file and no quota information is loaded.
  1875. */
  1876. static int vfs_load_quota_inode(struct inode *inode, int type, int format_id,
  1877. unsigned int flags)
  1878. {
  1879. struct quota_format_type *fmt = find_quota_format(format_id);
  1880. struct super_block *sb = inode->i_sb;
  1881. struct quota_info *dqopt = sb_dqopt(sb);
  1882. int error;
  1883. int oldflags = -1;
  1884. if (!fmt)
  1885. return -ESRCH;
  1886. if (!S_ISREG(inode->i_mode)) {
  1887. error = -EACCES;
  1888. goto out_fmt;
  1889. }
  1890. if (IS_RDONLY(inode)) {
  1891. error = -EROFS;
  1892. goto out_fmt;
  1893. }
  1894. if (!sb->s_op->quota_write || !sb->s_op->quota_read) {
  1895. error = -EINVAL;
  1896. goto out_fmt;
  1897. }
  1898. /* Usage always has to be set... */
  1899. if (!(flags & DQUOT_USAGE_ENABLED)) {
  1900. error = -EINVAL;
  1901. goto out_fmt;
  1902. }
  1903. if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) {
  1904. /* As we bypass the pagecache we must now flush all the
  1905. * dirty data and invalidate caches so that kernel sees
  1906. * changes from userspace. It is not enough to just flush
  1907. * the quota file since if blocksize < pagesize, invalidation
  1908. * of the cache could fail because of other unrelated dirty
  1909. * data */
  1910. sync_filesystem(sb);
  1911. invalidate_bdev(sb->s_bdev);
  1912. }
  1913. mutex_lock(&dqopt->dqonoff_mutex);
  1914. if (sb_has_quota_loaded(sb, type)) {
  1915. error = -EBUSY;
  1916. goto out_lock;
  1917. }
  1918. if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) {
  1919. /* We don't want quota and atime on quota files (deadlocks
  1920. * possible) Also nobody should write to the file - we use
  1921. * special IO operations which ignore the immutable bit. */
  1922. mutex_lock(&inode->i_mutex);
  1923. oldflags = inode->i_flags & (S_NOATIME | S_IMMUTABLE |
  1924. S_NOQUOTA);
  1925. inode->i_flags |= S_NOQUOTA | S_NOATIME | S_IMMUTABLE;
  1926. mutex_unlock(&inode->i_mutex);
  1927. /*
  1928. * When S_NOQUOTA is set, remove dquot references as no more
  1929. * references can be added
  1930. */
  1931. __dquot_drop(inode);
  1932. }
  1933. error = -EIO;
  1934. dqopt->files[type] = igrab(inode);
  1935. if (!dqopt->files[type])
  1936. goto out_lock;
  1937. error = -EINVAL;
  1938. if (!fmt->qf_ops->check_quota_file(sb, type))
  1939. goto out_file_init;
  1940. dqopt->ops[type] = fmt->qf_ops;
  1941. dqopt->info[type].dqi_format = fmt;
  1942. dqopt->info[type].dqi_fmt_id = format_id;
  1943. INIT_LIST_HEAD(&dqopt->info[type].dqi_dirty_list);
  1944. mutex_lock(&dqopt->dqio_mutex);
  1945. error = dqopt->ops[type]->read_file_info(sb, type);
  1946. if (error < 0) {
  1947. mutex_unlock(&dqopt->dqio_mutex);
  1948. goto out_file_init;
  1949. }
  1950. if (dqopt->flags & DQUOT_QUOTA_SYS_FILE)
  1951. dqopt->info[type].dqi_flags |= DQF_SYS_FILE;
  1952. mutex_unlock(&dqopt->dqio_mutex);
  1953. spin_lock(&dq_state_lock);
  1954. dqopt->flags |= dquot_state_flag(flags, type);
  1955. spin_unlock(&dq_state_lock);
  1956. add_dquot_ref(sb, type);
  1957. mutex_unlock(&dqopt->dqonoff_mutex);
  1958. return 0;
  1959. out_file_init:
  1960. dqopt->files[type] = NULL;
  1961. iput(inode);
  1962. out_lock:
  1963. if (oldflags != -1) {
  1964. mutex_lock(&inode->i_mutex);
  1965. /* Set the flags back (in the case of accidental quotaon()
  1966. * on a wrong file we don't want to mess up the flags) */
  1967. inode->i_flags &= ~(S_NOATIME | S_NOQUOTA | S_IMMUTABLE);
  1968. inode->i_flags |= oldflags;
  1969. mutex_unlock(&inode->i_mutex);
  1970. }
  1971. mutex_unlock(&dqopt->dqonoff_mutex);
  1972. out_fmt:
  1973. put_quota_format(fmt);
  1974. return error;
  1975. }
  1976. /* Reenable quotas on remount RW */
  1977. int dquot_resume(struct super_block *sb, int type)
  1978. {
  1979. struct quota_info *dqopt = sb_dqopt(sb);
  1980. struct inode *inode;
  1981. int ret = 0, cnt;
  1982. unsigned int flags;
  1983. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1984. if (type != -1 && cnt != type)
  1985. continue;
  1986. mutex_lock(&dqopt->dqonoff_mutex);
  1987. if (!sb_has_quota_suspended(sb, cnt)) {
  1988. mutex_unlock(&dqopt->dqonoff_mutex);
  1989. continue;
  1990. }
  1991. inode = dqopt->files[cnt];
  1992. dqopt->files[cnt] = NULL;
  1993. spin_lock(&dq_state_lock);
  1994. flags = dqopt->flags & dquot_state_flag(DQUOT_USAGE_ENABLED |
  1995. DQUOT_LIMITS_ENABLED,
  1996. cnt);
  1997. dqopt->flags &= ~dquot_state_flag(DQUOT_STATE_FLAGS, cnt);
  1998. spin_unlock(&dq_state_lock);
  1999. mutex_unlock(&dqopt->dqonoff_mutex);
  2000. flags = dquot_generic_flag(flags, cnt);
  2001. ret = vfs_load_quota_inode(inode, cnt,
  2002. dqopt->info[cnt].dqi_fmt_id, flags);
  2003. iput(inode);
  2004. }
  2005. return ret;
  2006. }
  2007. EXPORT_SYMBOL(dquot_resume);
  2008. int dquot_quota_on(struct super_block *sb, int type, int format_id,
  2009. struct path *path)
  2010. {
  2011. int error = security_quota_on(path->dentry);
  2012. if (error)
  2013. return error;
  2014. /* Quota file not on the same filesystem? */
  2015. if (path->dentry->d_sb != sb)
  2016. error = -EXDEV;
  2017. else
  2018. error = vfs_load_quota_inode(path->dentry->d_inode, type,
  2019. format_id, DQUOT_USAGE_ENABLED |
  2020. DQUOT_LIMITS_ENABLED);
  2021. return error;
  2022. }
  2023. EXPORT_SYMBOL(dquot_quota_on);
  2024. /*
  2025. * More powerful function for turning on quotas allowing setting
  2026. * of individual quota flags
  2027. */
  2028. int dquot_enable(struct inode *inode, int type, int format_id,
  2029. unsigned int flags)
  2030. {
  2031. int ret = 0;
  2032. struct super_block *sb = inode->i_sb;
  2033. struct quota_info *dqopt = sb_dqopt(sb);
  2034. /* Just unsuspend quotas? */
  2035. BUG_ON(flags & DQUOT_SUSPENDED);
  2036. if (!flags)
  2037. return 0;
  2038. /* Just updating flags needed? */
  2039. if (sb_has_quota_loaded(sb, type)) {
  2040. mutex_lock(&dqopt->dqonoff_mutex);
  2041. /* Now do a reliable test... */
  2042. if (!sb_has_quota_loaded(sb, type)) {
  2043. mutex_unlock(&dqopt->dqonoff_mutex);
  2044. goto load_quota;
  2045. }
  2046. if (flags & DQUOT_USAGE_ENABLED &&
  2047. sb_has_quota_usage_enabled(sb, type)) {
  2048. ret = -EBUSY;
  2049. goto out_lock;
  2050. }
  2051. if (flags & DQUOT_LIMITS_ENABLED &&
  2052. sb_has_quota_limits_enabled(sb, type)) {
  2053. ret = -EBUSY;
  2054. goto out_lock;
  2055. }
  2056. spin_lock(&dq_state_lock);
  2057. sb_dqopt(sb)->flags |= dquot_state_flag(flags, type);
  2058. spin_unlock(&dq_state_lock);
  2059. out_lock:
  2060. mutex_unlock(&dqopt->dqonoff_mutex);
  2061. return ret;
  2062. }
  2063. load_quota:
  2064. return vfs_load_quota_inode(inode, type, format_id, flags);
  2065. }
  2066. EXPORT_SYMBOL(dquot_enable);
  2067. /*
  2068. * This function is used when filesystem needs to initialize quotas
  2069. * during mount time.
  2070. */
  2071. int dquot_quota_on_mount(struct super_block *sb, char *qf_name,
  2072. int format_id, int type)
  2073. {
  2074. struct dentry *dentry;
  2075. int error;
  2076. mutex_lock(&sb->s_root->d_inode->i_mutex);
  2077. dentry = lookup_one_len(qf_name, sb->s_root, strlen(qf_name));
  2078. mutex_unlock(&sb->s_root->d_inode->i_mutex);
  2079. if (IS_ERR(dentry))
  2080. return PTR_ERR(dentry);
  2081. if (!dentry->d_inode) {
  2082. error = -ENOENT;
  2083. goto out;
  2084. }
  2085. error = security_quota_on(dentry);
  2086. if (!error)
  2087. error = vfs_load_quota_inode(dentry->d_inode, type, format_id,
  2088. DQUOT_USAGE_ENABLED | DQUOT_LIMITS_ENABLED);
  2089. out:
  2090. dput(dentry);
  2091. return error;
  2092. }
  2093. EXPORT_SYMBOL(dquot_quota_on_mount);
  2094. static inline qsize_t qbtos(qsize_t blocks)
  2095. {
  2096. return blocks << QIF_DQBLKSIZE_BITS;
  2097. }
  2098. static inline qsize_t stoqb(qsize_t space)
  2099. {
  2100. return (space + QIF_DQBLKSIZE - 1) >> QIF_DQBLKSIZE_BITS;
  2101. }
  2102. /* Generic routine for getting common part of quota structure */
  2103. static void do_get_dqblk(struct dquot *dquot, struct fs_disk_quota *di)
  2104. {
  2105. struct mem_dqblk *dm = &dquot->dq_dqb;
  2106. memset(di, 0, sizeof(*di));
  2107. di->d_version = FS_DQUOT_VERSION;
  2108. di->d_flags = dquot->dq_type == USRQUOTA ?
  2109. FS_USER_QUOTA : FS_GROUP_QUOTA;
  2110. di->d_id = dquot->dq_id;
  2111. spin_lock(&dq_data_lock);
  2112. di->d_blk_hardlimit = stoqb(dm->dqb_bhardlimit);
  2113. di->d_blk_softlimit = stoqb(dm->dqb_bsoftlimit);
  2114. di->d_ino_hardlimit = dm->dqb_ihardlimit;
  2115. di->d_ino_softlimit = dm->dqb_isoftlimit;
  2116. di->d_bcount = dm->dqb_curspace + dm->dqb_rsvspace;
  2117. di->d_icount = dm->dqb_curinodes;
  2118. di->d_btimer = dm->dqb_btime;
  2119. di->d_itimer = dm->dqb_itime;
  2120. spin_unlock(&dq_data_lock);
  2121. }
  2122. int dquot_get_dqblk(struct super_block *sb, int type, qid_t id,
  2123. struct fs_disk_quota *di)
  2124. {
  2125. struct dquot *dquot;
  2126. dquot = dqget(sb, id, type);
  2127. if (!dquot)
  2128. return -ESRCH;
  2129. do_get_dqblk(dquot, di);
  2130. dqput(dquot);
  2131. return 0;
  2132. }
  2133. EXPORT_SYMBOL(dquot_get_dqblk);
  2134. #define VFS_FS_DQ_MASK \
  2135. (FS_DQ_BCOUNT | FS_DQ_BSOFT | FS_DQ_BHARD | \
  2136. FS_DQ_ICOUNT | FS_DQ_ISOFT | FS_DQ_IHARD | \
  2137. FS_DQ_BTIMER | FS_DQ_ITIMER)
  2138. /* Generic routine for setting common part of quota structure */
  2139. static int do_set_dqblk(struct dquot *dquot, struct fs_disk_quota *di)
  2140. {
  2141. struct mem_dqblk *dm = &dquot->dq_dqb;
  2142. int check_blim = 0, check_ilim = 0;
  2143. struct mem_dqinfo *dqi = &sb_dqopt(dquot->dq_sb)->info[dquot->dq_type];
  2144. if (di->d_fieldmask & ~VFS_FS_DQ_MASK)
  2145. return -EINVAL;
  2146. if (((di->d_fieldmask & FS_DQ_BSOFT) &&
  2147. (di->d_blk_softlimit > dqi->dqi_maxblimit)) ||
  2148. ((di->d_fieldmask & FS_DQ_BHARD) &&
  2149. (di->d_blk_hardlimit > dqi->dqi_maxblimit)) ||
  2150. ((di->d_fieldmask & FS_DQ_ISOFT) &&
  2151. (di->d_ino_softlimit > dqi->dqi_maxilimit)) ||
  2152. ((di->d_fieldmask & FS_DQ_IHARD) &&
  2153. (di->d_ino_hardlimit > dqi->dqi_maxilimit)))
  2154. return -ERANGE;
  2155. spin_lock(&dq_data_lock);
  2156. if (di->d_fieldmask & FS_DQ_BCOUNT) {
  2157. dm->dqb_curspace = di->d_bcount - dm->dqb_rsvspace;
  2158. check_blim = 1;
  2159. set_bit(DQ_LASTSET_B + QIF_SPACE_B, &dquot->dq_flags);
  2160. }
  2161. if (di->d_fieldmask & FS_DQ_BSOFT)
  2162. dm->dqb_bsoftlimit = qbtos(di->d_blk_softlimit);
  2163. if (di->d_fieldmask & FS_DQ_BHARD)
  2164. dm->dqb_bhardlimit = qbtos(di->d_blk_hardlimit);
  2165. if (di->d_fieldmask & (FS_DQ_BSOFT | FS_DQ_BHARD)) {
  2166. check_blim = 1;
  2167. set_bit(DQ_LASTSET_B + QIF_BLIMITS_B, &dquot->dq_flags);
  2168. }
  2169. if (di->d_fieldmask & FS_DQ_ICOUNT) {
  2170. dm->dqb_curinodes = di->d_icount;
  2171. check_ilim = 1;
  2172. set_bit(DQ_LASTSET_B + QIF_INODES_B, &dquot->dq_flags);
  2173. }
  2174. if (di->d_fieldmask & FS_DQ_ISOFT)
  2175. dm->dqb_isoftlimit = di->d_ino_softlimit;
  2176. if (di->d_fieldmask & FS_DQ_IHARD)
  2177. dm->dqb_ihardlimit = di->d_ino_hardlimit;
  2178. if (di->d_fieldmask & (FS_DQ_ISOFT | FS_DQ_IHARD)) {
  2179. check_ilim = 1;
  2180. set_bit(DQ_LASTSET_B + QIF_ILIMITS_B, &dquot->dq_flags);
  2181. }
  2182. if (di->d_fieldmask & FS_DQ_BTIMER) {
  2183. dm->dqb_btime = di->d_btimer;
  2184. check_blim = 1;
  2185. set_bit(DQ_LASTSET_B + QIF_BTIME_B, &dquot->dq_flags);
  2186. }
  2187. if (di->d_fieldmask & FS_DQ_ITIMER) {
  2188. dm->dqb_itime = di->d_itimer;
  2189. check_ilim = 1;
  2190. set_bit(DQ_LASTSET_B + QIF_ITIME_B, &dquot->dq_flags);
  2191. }
  2192. if (check_blim) {
  2193. if (!dm->dqb_bsoftlimit ||
  2194. dm->dqb_curspace < dm->dqb_bsoftlimit) {
  2195. dm->dqb_btime = 0;
  2196. clear_bit(DQ_BLKS_B, &dquot->dq_flags);
  2197. } else if (!(di->d_fieldmask & FS_DQ_BTIMER))
  2198. /* Set grace only if user hasn't provided his own... */
  2199. dm->dqb_btime = get_seconds() + dqi->dqi_bgrace;
  2200. }
  2201. if (check_ilim) {
  2202. if (!dm->dqb_isoftlimit ||
  2203. dm->dqb_curinodes < dm->dqb_isoftlimit) {
  2204. dm->dqb_itime = 0;
  2205. clear_bit(DQ_INODES_B, &dquot->dq_flags);
  2206. } else if (!(di->d_fieldmask & FS_DQ_ITIMER))
  2207. /* Set grace only if user hasn't provided his own... */
  2208. dm->dqb_itime = get_seconds() + dqi->dqi_igrace;
  2209. }
  2210. if (dm->dqb_bhardlimit || dm->dqb_bsoftlimit || dm->dqb_ihardlimit ||
  2211. dm->dqb_isoftlimit)
  2212. clear_bit(DQ_FAKE_B, &dquot->dq_flags);
  2213. else
  2214. set_bit(DQ_FAKE_B, &dquot->dq_flags);
  2215. spin_unlock(&dq_data_lock);
  2216. mark_dquot_dirty(dquot);
  2217. return 0;
  2218. }
  2219. int dquot_set_dqblk(struct super_block *sb, int type, qid_t id,
  2220. struct fs_disk_quota *di)
  2221. {
  2222. struct dquot *dquot;
  2223. int rc;
  2224. dquot = dqget(sb, id, type);
  2225. if (!dquot) {
  2226. rc = -ESRCH;
  2227. goto out;
  2228. }
  2229. rc = do_set_dqblk(dquot, di);
  2230. dqput(dquot);
  2231. out:
  2232. return rc;
  2233. }
  2234. EXPORT_SYMBOL(dquot_set_dqblk);
  2235. /* Generic routine for getting common part of quota file information */
  2236. int dquot_get_dqinfo(struct super_block *sb, int type, struct if_dqinfo *ii)
  2237. {
  2238. struct mem_dqinfo *mi;
  2239. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  2240. if (!sb_has_quota_active(sb, type)) {
  2241. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  2242. return -ESRCH;
  2243. }
  2244. mi = sb_dqopt(sb)->info + type;
  2245. spin_lock(&dq_data_lock);
  2246. ii->dqi_bgrace = mi->dqi_bgrace;
  2247. ii->dqi_igrace = mi->dqi_igrace;
  2248. ii->dqi_flags = mi->dqi_flags & DQF_GETINFO_MASK;
  2249. ii->dqi_valid = IIF_ALL;
  2250. spin_unlock(&dq_data_lock);
  2251. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  2252. return 0;
  2253. }
  2254. EXPORT_SYMBOL(dquot_get_dqinfo);
  2255. /* Generic routine for setting common part of quota file information */
  2256. int dquot_set_dqinfo(struct super_block *sb, int type, struct if_dqinfo *ii)
  2257. {
  2258. struct mem_dqinfo *mi;
  2259. int err = 0;
  2260. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  2261. if (!sb_has_quota_active(sb, type)) {
  2262. err = -ESRCH;
  2263. goto out;
  2264. }
  2265. mi = sb_dqopt(sb)->info + type;
  2266. spin_lock(&dq_data_lock);
  2267. if (ii->dqi_valid & IIF_BGRACE)
  2268. mi->dqi_bgrace = ii->dqi_bgrace;
  2269. if (ii->dqi_valid & IIF_IGRACE)
  2270. mi->dqi_igrace = ii->dqi_igrace;
  2271. if (ii->dqi_valid & IIF_FLAGS)
  2272. mi->dqi_flags = (mi->dqi_flags & ~DQF_SETINFO_MASK) |
  2273. (ii->dqi_flags & DQF_SETINFO_MASK);
  2274. spin_unlock(&dq_data_lock);
  2275. mark_info_dirty(sb, type);
  2276. /* Force write to disk */
  2277. sb->dq_op->write_info(sb, type);
  2278. out:
  2279. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  2280. return err;
  2281. }
  2282. EXPORT_SYMBOL(dquot_set_dqinfo);
  2283. const struct quotactl_ops dquot_quotactl_ops = {
  2284. .quota_on = dquot_quota_on,
  2285. .quota_off = dquot_quota_off,
  2286. .quota_sync = dquot_quota_sync,
  2287. .get_info = dquot_get_dqinfo,
  2288. .set_info = dquot_set_dqinfo,
  2289. .get_dqblk = dquot_get_dqblk,
  2290. .set_dqblk = dquot_set_dqblk
  2291. };
  2292. EXPORT_SYMBOL(dquot_quotactl_ops);
  2293. static int do_proc_dqstats(struct ctl_table *table, int write,
  2294. void __user *buffer, size_t *lenp, loff_t *ppos)
  2295. {
  2296. unsigned int type = (int *)table->data - dqstats.stat;
  2297. /* Update global table */
  2298. dqstats.stat[type] =
  2299. percpu_counter_sum_positive(&dqstats.counter[type]);
  2300. return proc_dointvec(table, write, buffer, lenp, ppos);
  2301. }
  2302. static ctl_table fs_dqstats_table[] = {
  2303. {
  2304. .procname = "lookups",
  2305. .data = &dqstats.stat[DQST_LOOKUPS],
  2306. .maxlen = sizeof(int),
  2307. .mode = 0444,
  2308. .proc_handler = do_proc_dqstats,
  2309. },
  2310. {
  2311. .procname = "drops",
  2312. .data = &dqstats.stat[DQST_DROPS],
  2313. .maxlen = sizeof(int),
  2314. .mode = 0444,
  2315. .proc_handler = do_proc_dqstats,
  2316. },
  2317. {
  2318. .procname = "reads",
  2319. .data = &dqstats.stat[DQST_READS],
  2320. .maxlen = sizeof(int),
  2321. .mode = 0444,
  2322. .proc_handler = do_proc_dqstats,
  2323. },
  2324. {
  2325. .procname = "writes",
  2326. .data = &dqstats.stat[DQST_WRITES],
  2327. .maxlen = sizeof(int),
  2328. .mode = 0444,
  2329. .proc_handler = do_proc_dqstats,
  2330. },
  2331. {
  2332. .procname = "cache_hits",
  2333. .data = &dqstats.stat[DQST_CACHE_HITS],
  2334. .maxlen = sizeof(int),
  2335. .mode = 0444,
  2336. .proc_handler = do_proc_dqstats,
  2337. },
  2338. {
  2339. .procname = "allocated_dquots",
  2340. .data = &dqstats.stat[DQST_ALLOC_DQUOTS],
  2341. .maxlen = sizeof(int),
  2342. .mode = 0444,
  2343. .proc_handler = do_proc_dqstats,
  2344. },
  2345. {
  2346. .procname = "free_dquots",
  2347. .data = &dqstats.stat[DQST_FREE_DQUOTS],
  2348. .maxlen = sizeof(int),
  2349. .mode = 0444,
  2350. .proc_handler = do_proc_dqstats,
  2351. },
  2352. {
  2353. .procname = "syncs",
  2354. .data = &dqstats.stat[DQST_SYNCS],
  2355. .maxlen = sizeof(int),
  2356. .mode = 0444,
  2357. .proc_handler = do_proc_dqstats,
  2358. },
  2359. #ifdef CONFIG_PRINT_QUOTA_WARNING
  2360. {
  2361. .procname = "warnings",
  2362. .data = &flag_print_warnings,
  2363. .maxlen = sizeof(int),
  2364. .mode = 0644,
  2365. .proc_handler = proc_dointvec,
  2366. },
  2367. #endif
  2368. { },
  2369. };
  2370. static ctl_table fs_table[] = {
  2371. {
  2372. .procname = "quota",
  2373. .mode = 0555,
  2374. .child = fs_dqstats_table,
  2375. },
  2376. { },
  2377. };
  2378. static ctl_table sys_table[] = {
  2379. {
  2380. .procname = "fs",
  2381. .mode = 0555,
  2382. .child = fs_table,
  2383. },
  2384. { },
  2385. };
  2386. static int __init dquot_init(void)
  2387. {
  2388. int i, ret;
  2389. unsigned long nr_hash, order;
  2390. printk(KERN_NOTICE "VFS: Disk quotas %s\n", __DQUOT_VERSION__);
  2391. register_sysctl_table(sys_table);
  2392. dquot_cachep = kmem_cache_create("dquot",
  2393. sizeof(struct dquot), sizeof(unsigned long) * 4,
  2394. (SLAB_HWCACHE_ALIGN|SLAB_RECLAIM_ACCOUNT|
  2395. SLAB_MEM_SPREAD|SLAB_PANIC),
  2396. NULL);
  2397. order = 0;
  2398. dquot_hash = (struct hlist_head *)__get_free_pages(GFP_ATOMIC, order);
  2399. if (!dquot_hash)
  2400. panic("Cannot create dquot hash table");
  2401. for (i = 0; i < _DQST_DQSTAT_LAST; i++) {
  2402. ret = percpu_counter_init(&dqstats.counter[i], 0);
  2403. if (ret)
  2404. panic("Cannot create dquot stat counters");
  2405. }
  2406. /* Find power-of-two hlist_heads which can fit into allocation */
  2407. nr_hash = (1UL << order) * PAGE_SIZE / sizeof(struct hlist_head);
  2408. dq_hash_bits = 0;
  2409. do {
  2410. dq_hash_bits++;
  2411. } while (nr_hash >> dq_hash_bits);
  2412. dq_hash_bits--;
  2413. nr_hash = 1UL << dq_hash_bits;
  2414. dq_hash_mask = nr_hash - 1;
  2415. for (i = 0; i < nr_hash; i++)
  2416. INIT_HLIST_HEAD(dquot_hash + i);
  2417. printk("Dquot-cache hash table entries: %ld (order %ld, %ld bytes)\n",
  2418. nr_hash, order, (PAGE_SIZE << order));
  2419. register_shrinker(&dqcache_shrinker);
  2420. return 0;
  2421. }
  2422. module_init(dquot_init);