dquot.c 72 KB

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