dquot.c 58 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084
  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. * Version: $Id: dquot.c,v 6.3 1996/11/17 18:35:34 mvw Exp mvw $
  13. *
  14. * Author: Marco van Wieringen <mvw@planets.elm.net>
  15. *
  16. * Fixes: Dmitry Gorodchanin <pgmdsg@ibi.com>, 11 Feb 96
  17. *
  18. * Revised list management to avoid races
  19. * -- Bill Hawes, <whawes@star.net>, 9/98
  20. *
  21. * Fixed races in dquot_transfer(), dqget() and dquot_alloc_...().
  22. * As the consequence the locking was moved from dquot_decr_...(),
  23. * dquot_incr_...() to calling functions.
  24. * invalidate_dquots() now writes modified dquots.
  25. * Serialized quota_off() and quota_on() for mount point.
  26. * Fixed a few bugs in grow_dquots().
  27. * Fixed deadlock in write_dquot() - we no longer account quotas on
  28. * quota files
  29. * remove_dquot_ref() moved to inode.c - it now traverses through inodes
  30. * add_dquot_ref() restarts after blocking
  31. * Added check for bogus uid and fixed check for group in quotactl.
  32. * Jan Kara, <jack@suse.cz>, sponsored by SuSE CR, 10-11/99
  33. *
  34. * Used struct list_head instead of own list struct
  35. * Invalidation of referenced dquots is no longer possible
  36. * Improved free_dquots list management
  37. * Quota and i_blocks are now updated in one place to avoid races
  38. * Warnings are now delayed so we won't block in critical section
  39. * Write updated not to require dquot lock
  40. * Jan Kara, <jack@suse.cz>, 9/2000
  41. *
  42. * Added dynamic quota structure allocation
  43. * Jan Kara <jack@suse.cz> 12/2000
  44. *
  45. * Rewritten quota interface. Implemented new quota format and
  46. * formats registering.
  47. * Jan Kara, <jack@suse.cz>, 2001,2002
  48. *
  49. * New SMP locking.
  50. * Jan Kara, <jack@suse.cz>, 10/2002
  51. *
  52. * Added journalled quota support, fix lock inversion problems
  53. * Jan Kara, <jack@suse.cz>, 2003,2004
  54. *
  55. * (C) Copyright 1994 - 1997 Marco van Wieringen
  56. */
  57. #include <linux/errno.h>
  58. #include <linux/kernel.h>
  59. #include <linux/fs.h>
  60. #include <linux/mount.h>
  61. #include <linux/mm.h>
  62. #include <linux/time.h>
  63. #include <linux/types.h>
  64. #include <linux/string.h>
  65. #include <linux/fcntl.h>
  66. #include <linux/stat.h>
  67. #include <linux/tty.h>
  68. #include <linux/file.h>
  69. #include <linux/slab.h>
  70. #include <linux/sysctl.h>
  71. #include <linux/init.h>
  72. #include <linux/module.h>
  73. #include <linux/proc_fs.h>
  74. #include <linux/security.h>
  75. #include <linux/kmod.h>
  76. #include <linux/namei.h>
  77. #include <linux/buffer_head.h>
  78. #include <linux/capability.h>
  79. #include <linux/quotaops.h>
  80. #include <linux/writeback.h> /* for inode_lock, oddly enough.. */
  81. #ifdef CONFIG_QUOTA_NETLINK_INTERFACE
  82. #include <net/netlink.h>
  83. #include <net/genetlink.h>
  84. #endif
  85. #include <asm/uaccess.h>
  86. #define __DQUOT_PARANOIA
  87. /*
  88. * There are two quota SMP locks. dq_list_lock protects all lists with quotas
  89. * and quota formats and also dqstats structure containing statistics about the
  90. * lists. dq_data_lock protects data from dq_dqb and also mem_dqinfo structures
  91. * and also guards consistency of dquot->dq_dqb with inode->i_blocks, i_bytes.
  92. * i_blocks and i_bytes updates itself are guarded by i_lock acquired directly
  93. * in inode_add_bytes() and inode_sub_bytes().
  94. *
  95. * The spinlock ordering is hence: dq_data_lock > dq_list_lock > i_lock
  96. *
  97. * Note that some things (eg. sb pointer, type, id) doesn't change during
  98. * the life of the dquot structure and so needn't to be protected by a lock
  99. *
  100. * Any operation working on dquots via inode pointers must hold dqptr_sem. If
  101. * operation is just reading pointers from inode (or not using them at all) the
  102. * read lock is enough. If pointers are altered function must hold write lock
  103. * (these locking rules also apply for S_NOQUOTA flag in the inode - note that
  104. * for altering the flag i_mutex is also needed). If operation is holding
  105. * reference to dquot in other way (e.g. quotactl ops) it must be guarded by
  106. * dqonoff_mutex.
  107. * This locking assures that:
  108. * a) update/access to dquot pointers in inode is serialized
  109. * b) everyone is guarded against invalidate_dquots()
  110. *
  111. * Each dquot has its dq_lock mutex. Locked dquots might not be referenced
  112. * from inodes (dquot_alloc_space() and such don't check the dq_lock).
  113. * Currently dquot is locked only when it is being read to memory (or space for
  114. * it is being allocated) on the first dqget() and when it is being released on
  115. * the last dqput(). The allocation and release oparations are serialized by
  116. * the dq_lock and by checking the use count in dquot_release(). Write
  117. * operations on dquots don't hold dq_lock as they copy data under dq_data_lock
  118. * spinlock to internal buffers before writing.
  119. *
  120. * Lock ordering (including related VFS locks) is the following:
  121. * i_mutex > dqonoff_sem > journal_lock > dqptr_sem > dquot->dq_lock >
  122. * dqio_mutex
  123. * i_mutex on quota files is special (it's below dqio_mutex)
  124. */
  125. static DEFINE_SPINLOCK(dq_list_lock);
  126. DEFINE_SPINLOCK(dq_data_lock);
  127. static char *quotatypes[] = INITQFNAMES;
  128. static struct quota_format_type *quota_formats; /* List of registered formats */
  129. static struct quota_module_name module_names[] = INIT_QUOTA_MODULE_NAMES;
  130. /* SLAB cache for dquot structures */
  131. static struct kmem_cache *dquot_cachep;
  132. int register_quota_format(struct quota_format_type *fmt)
  133. {
  134. spin_lock(&dq_list_lock);
  135. fmt->qf_next = quota_formats;
  136. quota_formats = fmt;
  137. spin_unlock(&dq_list_lock);
  138. return 0;
  139. }
  140. void unregister_quota_format(struct quota_format_type *fmt)
  141. {
  142. struct quota_format_type **actqf;
  143. spin_lock(&dq_list_lock);
  144. for (actqf = &quota_formats; *actqf && *actqf != fmt; actqf = &(*actqf)->qf_next);
  145. if (*actqf)
  146. *actqf = (*actqf)->qf_next;
  147. spin_unlock(&dq_list_lock);
  148. }
  149. static struct quota_format_type *find_quota_format(int id)
  150. {
  151. struct quota_format_type *actqf;
  152. spin_lock(&dq_list_lock);
  153. for (actqf = quota_formats; actqf && actqf->qf_fmt_id != id; actqf = actqf->qf_next);
  154. if (!actqf || !try_module_get(actqf->qf_owner)) {
  155. int qm;
  156. spin_unlock(&dq_list_lock);
  157. for (qm = 0; module_names[qm].qm_fmt_id && module_names[qm].qm_fmt_id != id; qm++);
  158. if (!module_names[qm].qm_fmt_id || request_module(module_names[qm].qm_mod_name))
  159. return NULL;
  160. spin_lock(&dq_list_lock);
  161. for (actqf = quota_formats; actqf && actqf->qf_fmt_id != id; actqf = actqf->qf_next);
  162. if (actqf && !try_module_get(actqf->qf_owner))
  163. actqf = NULL;
  164. }
  165. spin_unlock(&dq_list_lock);
  166. return actqf;
  167. }
  168. static void put_quota_format(struct quota_format_type *fmt)
  169. {
  170. module_put(fmt->qf_owner);
  171. }
  172. /*
  173. * Dquot List Management:
  174. * The quota code uses three lists for dquot management: the inuse_list,
  175. * free_dquots, and dquot_hash[] array. A single dquot structure may be
  176. * on all three lists, depending on its current state.
  177. *
  178. * All dquots are placed to the end of inuse_list when first created, and this
  179. * list is used for invalidate operation, which must look at every dquot.
  180. *
  181. * Unused dquots (dq_count == 0) are added to the free_dquots list when freed,
  182. * and this list is searched whenever we need an available dquot. Dquots are
  183. * removed from the list as soon as they are used again, and
  184. * dqstats.free_dquots gives the number of dquots on the list. When
  185. * dquot is invalidated it's completely released from memory.
  186. *
  187. * Dquots with a specific identity (device, type and id) are placed on
  188. * one of the dquot_hash[] hash chains. The provides an efficient search
  189. * mechanism to locate a specific dquot.
  190. */
  191. static LIST_HEAD(inuse_list);
  192. static LIST_HEAD(free_dquots);
  193. static unsigned int dq_hash_bits, dq_hash_mask;
  194. static struct hlist_head *dquot_hash;
  195. struct dqstats dqstats;
  196. static void dqput(struct dquot *dquot);
  197. static inline unsigned int
  198. hashfn(const struct super_block *sb, unsigned int id, int type)
  199. {
  200. unsigned long tmp;
  201. tmp = (((unsigned long)sb>>L1_CACHE_SHIFT) ^ id) * (MAXQUOTAS - type);
  202. return (tmp + (tmp >> dq_hash_bits)) & dq_hash_mask;
  203. }
  204. /*
  205. * Following list functions expect dq_list_lock to be held
  206. */
  207. static inline void insert_dquot_hash(struct dquot *dquot)
  208. {
  209. struct hlist_head *head = dquot_hash + hashfn(dquot->dq_sb, dquot->dq_id, dquot->dq_type);
  210. hlist_add_head(&dquot->dq_hash, head);
  211. }
  212. static inline void remove_dquot_hash(struct dquot *dquot)
  213. {
  214. hlist_del_init(&dquot->dq_hash);
  215. }
  216. static inline struct dquot *find_dquot(unsigned int hashent, struct super_block *sb, unsigned int id, int type)
  217. {
  218. struct hlist_node *node;
  219. struct dquot *dquot;
  220. hlist_for_each (node, dquot_hash+hashent) {
  221. dquot = hlist_entry(node, struct dquot, dq_hash);
  222. if (dquot->dq_sb == sb && dquot->dq_id == id && dquot->dq_type == type)
  223. return dquot;
  224. }
  225. return NODQUOT;
  226. }
  227. /* Add a dquot to the tail of the free list */
  228. static inline void put_dquot_last(struct dquot *dquot)
  229. {
  230. list_add_tail(&dquot->dq_free, &free_dquots);
  231. dqstats.free_dquots++;
  232. }
  233. static inline void remove_free_dquot(struct dquot *dquot)
  234. {
  235. if (list_empty(&dquot->dq_free))
  236. return;
  237. list_del_init(&dquot->dq_free);
  238. dqstats.free_dquots--;
  239. }
  240. static inline void put_inuse(struct dquot *dquot)
  241. {
  242. /* We add to the back of inuse list so we don't have to restart
  243. * when traversing this list and we block */
  244. list_add_tail(&dquot->dq_inuse, &inuse_list);
  245. dqstats.allocated_dquots++;
  246. }
  247. static inline void remove_inuse(struct dquot *dquot)
  248. {
  249. dqstats.allocated_dquots--;
  250. list_del(&dquot->dq_inuse);
  251. }
  252. /*
  253. * End of list functions needing dq_list_lock
  254. */
  255. static void wait_on_dquot(struct dquot *dquot)
  256. {
  257. mutex_lock(&dquot->dq_lock);
  258. mutex_unlock(&dquot->dq_lock);
  259. }
  260. static inline int dquot_dirty(struct dquot *dquot)
  261. {
  262. return test_bit(DQ_MOD_B, &dquot->dq_flags);
  263. }
  264. static inline int mark_dquot_dirty(struct dquot *dquot)
  265. {
  266. return dquot->dq_sb->dq_op->mark_dirty(dquot);
  267. }
  268. int dquot_mark_dquot_dirty(struct dquot *dquot)
  269. {
  270. spin_lock(&dq_list_lock);
  271. if (!test_and_set_bit(DQ_MOD_B, &dquot->dq_flags))
  272. list_add(&dquot->dq_dirty, &sb_dqopt(dquot->dq_sb)->
  273. info[dquot->dq_type].dqi_dirty_list);
  274. spin_unlock(&dq_list_lock);
  275. return 0;
  276. }
  277. /* This function needs dq_list_lock */
  278. static inline int clear_dquot_dirty(struct dquot *dquot)
  279. {
  280. if (!test_and_clear_bit(DQ_MOD_B, &dquot->dq_flags))
  281. return 0;
  282. list_del_init(&dquot->dq_dirty);
  283. return 1;
  284. }
  285. void mark_info_dirty(struct super_block *sb, int type)
  286. {
  287. set_bit(DQF_INFO_DIRTY_B, &sb_dqopt(sb)->info[type].dqi_flags);
  288. }
  289. EXPORT_SYMBOL(mark_info_dirty);
  290. /*
  291. * Read dquot from disk and alloc space for it
  292. */
  293. int dquot_acquire(struct dquot *dquot)
  294. {
  295. int ret = 0, ret2 = 0;
  296. struct quota_info *dqopt = sb_dqopt(dquot->dq_sb);
  297. mutex_lock(&dquot->dq_lock);
  298. mutex_lock(&dqopt->dqio_mutex);
  299. if (!test_bit(DQ_READ_B, &dquot->dq_flags))
  300. ret = dqopt->ops[dquot->dq_type]->read_dqblk(dquot);
  301. if (ret < 0)
  302. goto out_iolock;
  303. set_bit(DQ_READ_B, &dquot->dq_flags);
  304. /* Instantiate dquot if needed */
  305. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags) && !dquot->dq_off) {
  306. ret = dqopt->ops[dquot->dq_type]->commit_dqblk(dquot);
  307. /* Write the info if needed */
  308. if (info_dirty(&dqopt->info[dquot->dq_type]))
  309. ret2 = dqopt->ops[dquot->dq_type]->write_file_info(dquot->dq_sb, dquot->dq_type);
  310. if (ret < 0)
  311. goto out_iolock;
  312. if (ret2 < 0) {
  313. ret = ret2;
  314. goto out_iolock;
  315. }
  316. }
  317. set_bit(DQ_ACTIVE_B, &dquot->dq_flags);
  318. out_iolock:
  319. mutex_unlock(&dqopt->dqio_mutex);
  320. mutex_unlock(&dquot->dq_lock);
  321. return ret;
  322. }
  323. /*
  324. * Write dquot to disk
  325. */
  326. int dquot_commit(struct dquot *dquot)
  327. {
  328. int ret = 0, ret2 = 0;
  329. struct quota_info *dqopt = sb_dqopt(dquot->dq_sb);
  330. mutex_lock(&dqopt->dqio_mutex);
  331. spin_lock(&dq_list_lock);
  332. if (!clear_dquot_dirty(dquot)) {
  333. spin_unlock(&dq_list_lock);
  334. goto out_sem;
  335. }
  336. spin_unlock(&dq_list_lock);
  337. /* Inactive dquot can be only if there was error during read/init
  338. * => we have better not writing it */
  339. if (test_bit(DQ_ACTIVE_B, &dquot->dq_flags)) {
  340. ret = dqopt->ops[dquot->dq_type]->commit_dqblk(dquot);
  341. if (info_dirty(&dqopt->info[dquot->dq_type]))
  342. ret2 = dqopt->ops[dquot->dq_type]->write_file_info(dquot->dq_sb, dquot->dq_type);
  343. if (ret >= 0)
  344. ret = ret2;
  345. }
  346. out_sem:
  347. mutex_unlock(&dqopt->dqio_mutex);
  348. return ret;
  349. }
  350. /*
  351. * Release dquot
  352. */
  353. int dquot_release(struct dquot *dquot)
  354. {
  355. int ret = 0, ret2 = 0;
  356. struct quota_info *dqopt = sb_dqopt(dquot->dq_sb);
  357. mutex_lock(&dquot->dq_lock);
  358. /* Check whether we are not racing with some other dqget() */
  359. if (atomic_read(&dquot->dq_count) > 1)
  360. goto out_dqlock;
  361. mutex_lock(&dqopt->dqio_mutex);
  362. if (dqopt->ops[dquot->dq_type]->release_dqblk) {
  363. ret = dqopt->ops[dquot->dq_type]->release_dqblk(dquot);
  364. /* Write the info */
  365. if (info_dirty(&dqopt->info[dquot->dq_type]))
  366. ret2 = dqopt->ops[dquot->dq_type]->write_file_info(dquot->dq_sb, dquot->dq_type);
  367. if (ret >= 0)
  368. ret = ret2;
  369. }
  370. clear_bit(DQ_ACTIVE_B, &dquot->dq_flags);
  371. mutex_unlock(&dqopt->dqio_mutex);
  372. out_dqlock:
  373. mutex_unlock(&dquot->dq_lock);
  374. return ret;
  375. }
  376. /* Invalidate all dquots on the list. Note that this function is called after
  377. * quota is disabled and pointers from inodes removed so there cannot be new
  378. * quota users. There can still be some users of quotas due to inodes being
  379. * just deleted or pruned by prune_icache() (those are not attached to any
  380. * list). We have to wait for such users.
  381. */
  382. static void invalidate_dquots(struct super_block *sb, int type)
  383. {
  384. struct dquot *dquot, *tmp;
  385. restart:
  386. spin_lock(&dq_list_lock);
  387. list_for_each_entry_safe(dquot, tmp, &inuse_list, dq_inuse) {
  388. if (dquot->dq_sb != sb)
  389. continue;
  390. if (dquot->dq_type != type)
  391. continue;
  392. /* Wait for dquot users */
  393. if (atomic_read(&dquot->dq_count)) {
  394. DEFINE_WAIT(wait);
  395. atomic_inc(&dquot->dq_count);
  396. prepare_to_wait(&dquot->dq_wait_unused, &wait,
  397. TASK_UNINTERRUPTIBLE);
  398. spin_unlock(&dq_list_lock);
  399. /* Once dqput() wakes us up, we know it's time to free
  400. * the dquot.
  401. * IMPORTANT: we rely on the fact that there is always
  402. * at most one process waiting for dquot to free.
  403. * Otherwise dq_count would be > 1 and we would never
  404. * wake up.
  405. */
  406. if (atomic_read(&dquot->dq_count) > 1)
  407. schedule();
  408. finish_wait(&dquot->dq_wait_unused, &wait);
  409. dqput(dquot);
  410. /* At this moment dquot() need not exist (it could be
  411. * reclaimed by prune_dqcache(). Hence we must
  412. * restart. */
  413. goto restart;
  414. }
  415. /*
  416. * Quota now has no users and it has been written on last
  417. * dqput()
  418. */
  419. remove_dquot_hash(dquot);
  420. remove_free_dquot(dquot);
  421. remove_inuse(dquot);
  422. kmem_cache_free(dquot_cachep, dquot);
  423. }
  424. spin_unlock(&dq_list_lock);
  425. }
  426. int vfs_quota_sync(struct super_block *sb, int type)
  427. {
  428. struct list_head *dirty;
  429. struct dquot *dquot;
  430. struct quota_info *dqopt = sb_dqopt(sb);
  431. int cnt;
  432. mutex_lock(&dqopt->dqonoff_mutex);
  433. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  434. if (type != -1 && cnt != type)
  435. continue;
  436. if (!sb_has_quota_enabled(sb, cnt))
  437. continue;
  438. spin_lock(&dq_list_lock);
  439. dirty = &dqopt->info[cnt].dqi_dirty_list;
  440. while (!list_empty(dirty)) {
  441. dquot = list_first_entry(dirty, struct dquot, dq_dirty);
  442. /* Dirty and inactive can be only bad dquot... */
  443. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags)) {
  444. clear_dquot_dirty(dquot);
  445. continue;
  446. }
  447. /* Now we have active dquot from which someone is
  448. * holding reference so we can safely just increase
  449. * use count */
  450. atomic_inc(&dquot->dq_count);
  451. dqstats.lookups++;
  452. spin_unlock(&dq_list_lock);
  453. sb->dq_op->write_dquot(dquot);
  454. dqput(dquot);
  455. spin_lock(&dq_list_lock);
  456. }
  457. spin_unlock(&dq_list_lock);
  458. }
  459. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  460. if ((cnt == type || type == -1) && sb_has_quota_enabled(sb, cnt)
  461. && info_dirty(&dqopt->info[cnt]))
  462. sb->dq_op->write_info(sb, cnt);
  463. spin_lock(&dq_list_lock);
  464. dqstats.syncs++;
  465. spin_unlock(&dq_list_lock);
  466. mutex_unlock(&dqopt->dqonoff_mutex);
  467. return 0;
  468. }
  469. /* Free unused dquots from cache */
  470. static void prune_dqcache(int count)
  471. {
  472. struct list_head *head;
  473. struct dquot *dquot;
  474. head = free_dquots.prev;
  475. while (head != &free_dquots && count) {
  476. dquot = list_entry(head, struct dquot, dq_free);
  477. remove_dquot_hash(dquot);
  478. remove_free_dquot(dquot);
  479. remove_inuse(dquot);
  480. kmem_cache_free(dquot_cachep, dquot);
  481. count--;
  482. head = free_dquots.prev;
  483. }
  484. }
  485. /*
  486. * This is called from kswapd when we think we need some
  487. * more memory
  488. */
  489. static int shrink_dqcache_memory(int nr, gfp_t gfp_mask)
  490. {
  491. if (nr) {
  492. spin_lock(&dq_list_lock);
  493. prune_dqcache(nr);
  494. spin_unlock(&dq_list_lock);
  495. }
  496. return (dqstats.free_dquots / 100) * sysctl_vfs_cache_pressure;
  497. }
  498. static struct shrinker dqcache_shrinker = {
  499. .shrink = shrink_dqcache_memory,
  500. .seeks = DEFAULT_SEEKS,
  501. };
  502. /*
  503. * Put reference to dquot
  504. * NOTE: If you change this function please check whether dqput_blocks() works right...
  505. * MUST be called with either dqptr_sem or dqonoff_mutex held
  506. */
  507. static void dqput(struct dquot *dquot)
  508. {
  509. if (!dquot)
  510. return;
  511. #ifdef __DQUOT_PARANOIA
  512. if (!atomic_read(&dquot->dq_count)) {
  513. printk("VFS: dqput: trying to free free dquot\n");
  514. printk("VFS: device %s, dquot of %s %d\n",
  515. dquot->dq_sb->s_id,
  516. quotatypes[dquot->dq_type],
  517. dquot->dq_id);
  518. BUG();
  519. }
  520. #endif
  521. spin_lock(&dq_list_lock);
  522. dqstats.drops++;
  523. spin_unlock(&dq_list_lock);
  524. we_slept:
  525. spin_lock(&dq_list_lock);
  526. if (atomic_read(&dquot->dq_count) > 1) {
  527. /* We have more than one user... nothing to do */
  528. atomic_dec(&dquot->dq_count);
  529. /* Releasing dquot during quotaoff phase? */
  530. if (!sb_has_quota_enabled(dquot->dq_sb, dquot->dq_type) &&
  531. atomic_read(&dquot->dq_count) == 1)
  532. wake_up(&dquot->dq_wait_unused);
  533. spin_unlock(&dq_list_lock);
  534. return;
  535. }
  536. /* Need to release dquot? */
  537. if (test_bit(DQ_ACTIVE_B, &dquot->dq_flags) && dquot_dirty(dquot)) {
  538. spin_unlock(&dq_list_lock);
  539. /* Commit dquot before releasing */
  540. dquot->dq_sb->dq_op->write_dquot(dquot);
  541. goto we_slept;
  542. }
  543. /* Clear flag in case dquot was inactive (something bad happened) */
  544. clear_dquot_dirty(dquot);
  545. if (test_bit(DQ_ACTIVE_B, &dquot->dq_flags)) {
  546. spin_unlock(&dq_list_lock);
  547. dquot->dq_sb->dq_op->release_dquot(dquot);
  548. goto we_slept;
  549. }
  550. atomic_dec(&dquot->dq_count);
  551. #ifdef __DQUOT_PARANOIA
  552. /* sanity check */
  553. BUG_ON(!list_empty(&dquot->dq_free));
  554. #endif
  555. put_dquot_last(dquot);
  556. spin_unlock(&dq_list_lock);
  557. }
  558. static struct dquot *get_empty_dquot(struct super_block *sb, int type)
  559. {
  560. struct dquot *dquot;
  561. dquot = kmem_cache_zalloc(dquot_cachep, GFP_NOFS);
  562. if(!dquot)
  563. return NODQUOT;
  564. mutex_init(&dquot->dq_lock);
  565. INIT_LIST_HEAD(&dquot->dq_free);
  566. INIT_LIST_HEAD(&dquot->dq_inuse);
  567. INIT_HLIST_NODE(&dquot->dq_hash);
  568. INIT_LIST_HEAD(&dquot->dq_dirty);
  569. init_waitqueue_head(&dquot->dq_wait_unused);
  570. dquot->dq_sb = sb;
  571. dquot->dq_type = type;
  572. atomic_set(&dquot->dq_count, 1);
  573. return dquot;
  574. }
  575. /*
  576. * Get reference to dquot
  577. * MUST be called with either dqptr_sem or dqonoff_mutex held
  578. */
  579. static struct dquot *dqget(struct super_block *sb, unsigned int id, int type)
  580. {
  581. unsigned int hashent = hashfn(sb, id, type);
  582. struct dquot *dquot, *empty = NODQUOT;
  583. if (!sb_has_quota_enabled(sb, type))
  584. return NODQUOT;
  585. we_slept:
  586. spin_lock(&dq_list_lock);
  587. if ((dquot = find_dquot(hashent, sb, id, type)) == NODQUOT) {
  588. if (empty == NODQUOT) {
  589. spin_unlock(&dq_list_lock);
  590. if ((empty = get_empty_dquot(sb, type)) == NODQUOT)
  591. schedule(); /* Try to wait for a moment... */
  592. goto we_slept;
  593. }
  594. dquot = empty;
  595. dquot->dq_id = id;
  596. /* all dquots go on the inuse_list */
  597. put_inuse(dquot);
  598. /* hash it first so it can be found */
  599. insert_dquot_hash(dquot);
  600. dqstats.lookups++;
  601. spin_unlock(&dq_list_lock);
  602. } else {
  603. if (!atomic_read(&dquot->dq_count))
  604. remove_free_dquot(dquot);
  605. atomic_inc(&dquot->dq_count);
  606. dqstats.cache_hits++;
  607. dqstats.lookups++;
  608. spin_unlock(&dq_list_lock);
  609. if (empty)
  610. kmem_cache_free(dquot_cachep, empty);
  611. }
  612. /* Wait for dq_lock - after this we know that either dquot_release() is already
  613. * finished or it will be canceled due to dq_count > 1 test */
  614. wait_on_dquot(dquot);
  615. /* Read the dquot and instantiate it (everything done only if needed) */
  616. if (!test_bit(DQ_ACTIVE_B, &dquot->dq_flags) && sb->dq_op->acquire_dquot(dquot) < 0) {
  617. dqput(dquot);
  618. return NODQUOT;
  619. }
  620. #ifdef __DQUOT_PARANOIA
  621. BUG_ON(!dquot->dq_sb); /* Has somebody invalidated entry under us? */
  622. #endif
  623. return dquot;
  624. }
  625. static int dqinit_needed(struct inode *inode, int type)
  626. {
  627. int cnt;
  628. if (IS_NOQUOTA(inode))
  629. return 0;
  630. if (type != -1)
  631. return inode->i_dquot[type] == NODQUOT;
  632. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  633. if (inode->i_dquot[cnt] == NODQUOT)
  634. return 1;
  635. return 0;
  636. }
  637. /* This routine is guarded by dqonoff_mutex mutex */
  638. static void add_dquot_ref(struct super_block *sb, int type)
  639. {
  640. struct inode *inode, *old_inode = NULL;
  641. spin_lock(&inode_lock);
  642. list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
  643. if (!atomic_read(&inode->i_writecount))
  644. continue;
  645. if (!dqinit_needed(inode, type))
  646. continue;
  647. if (inode->i_state & (I_FREEING|I_WILL_FREE))
  648. continue;
  649. __iget(inode);
  650. spin_unlock(&inode_lock);
  651. iput(old_inode);
  652. sb->dq_op->initialize(inode, type);
  653. /* We hold a reference to 'inode' so it couldn't have been
  654. * removed from s_inodes list while we dropped the inode_lock.
  655. * We cannot iput the inode now as we can be holding the last
  656. * reference and we cannot iput it under inode_lock. So we
  657. * keep the reference and iput it later. */
  658. old_inode = inode;
  659. spin_lock(&inode_lock);
  660. }
  661. spin_unlock(&inode_lock);
  662. iput(old_inode);
  663. }
  664. /* Return 0 if dqput() won't block (note that 1 doesn't necessarily mean blocking) */
  665. static inline int dqput_blocks(struct dquot *dquot)
  666. {
  667. if (atomic_read(&dquot->dq_count) <= 1)
  668. return 1;
  669. return 0;
  670. }
  671. /* Remove references to dquots from inode - add dquot to list for freeing if needed */
  672. /* We can't race with anybody because we hold dqptr_sem for writing... */
  673. static int remove_inode_dquot_ref(struct inode *inode, int type,
  674. struct list_head *tofree_head)
  675. {
  676. struct dquot *dquot = inode->i_dquot[type];
  677. inode->i_dquot[type] = NODQUOT;
  678. if (dquot != NODQUOT) {
  679. if (dqput_blocks(dquot)) {
  680. #ifdef __DQUOT_PARANOIA
  681. if (atomic_read(&dquot->dq_count) != 1)
  682. printk(KERN_WARNING "VFS: Adding dquot with dq_count %d to dispose list.\n", atomic_read(&dquot->dq_count));
  683. #endif
  684. spin_lock(&dq_list_lock);
  685. list_add(&dquot->dq_free, tofree_head); /* As dquot must have currently users it can't be on the free list... */
  686. spin_unlock(&dq_list_lock);
  687. return 1;
  688. }
  689. else
  690. dqput(dquot); /* We have guaranteed we won't block */
  691. }
  692. return 0;
  693. }
  694. /* Free list of dquots - called from inode.c */
  695. /* dquots are removed from inodes, no new references can be got so we are the only ones holding reference */
  696. static void put_dquot_list(struct list_head *tofree_head)
  697. {
  698. struct list_head *act_head;
  699. struct dquot *dquot;
  700. act_head = tofree_head->next;
  701. /* So now we have dquots on the list... Just free them */
  702. while (act_head != tofree_head) {
  703. dquot = list_entry(act_head, struct dquot, dq_free);
  704. act_head = act_head->next;
  705. list_del_init(&dquot->dq_free); /* Remove dquot from the list so we won't have problems... */
  706. dqput(dquot);
  707. }
  708. }
  709. static void remove_dquot_ref(struct super_block *sb, int type,
  710. struct list_head *tofree_head)
  711. {
  712. struct inode *inode;
  713. spin_lock(&inode_lock);
  714. list_for_each_entry(inode, &sb->s_inodes, i_sb_list) {
  715. if (!IS_NOQUOTA(inode))
  716. remove_inode_dquot_ref(inode, type, tofree_head);
  717. }
  718. spin_unlock(&inode_lock);
  719. }
  720. /* Gather all references from inodes and drop them */
  721. static void drop_dquot_ref(struct super_block *sb, int type)
  722. {
  723. LIST_HEAD(tofree_head);
  724. if (sb->dq_op) {
  725. down_write(&sb_dqopt(sb)->dqptr_sem);
  726. remove_dquot_ref(sb, type, &tofree_head);
  727. up_write(&sb_dqopt(sb)->dqptr_sem);
  728. put_dquot_list(&tofree_head);
  729. }
  730. }
  731. static inline void dquot_incr_inodes(struct dquot *dquot, unsigned long number)
  732. {
  733. dquot->dq_dqb.dqb_curinodes += number;
  734. }
  735. static inline void dquot_incr_space(struct dquot *dquot, qsize_t number)
  736. {
  737. dquot->dq_dqb.dqb_curspace += number;
  738. }
  739. static inline void dquot_decr_inodes(struct dquot *dquot, unsigned long number)
  740. {
  741. if (dquot->dq_dqb.dqb_curinodes > number)
  742. dquot->dq_dqb.dqb_curinodes -= number;
  743. else
  744. dquot->dq_dqb.dqb_curinodes = 0;
  745. if (dquot->dq_dqb.dqb_curinodes <= dquot->dq_dqb.dqb_isoftlimit)
  746. dquot->dq_dqb.dqb_itime = (time_t) 0;
  747. clear_bit(DQ_INODES_B, &dquot->dq_flags);
  748. }
  749. static inline void dquot_decr_space(struct dquot *dquot, qsize_t number)
  750. {
  751. if (dquot->dq_dqb.dqb_curspace > number)
  752. dquot->dq_dqb.dqb_curspace -= number;
  753. else
  754. dquot->dq_dqb.dqb_curspace = 0;
  755. if (toqb(dquot->dq_dqb.dqb_curspace) <= dquot->dq_dqb.dqb_bsoftlimit)
  756. dquot->dq_dqb.dqb_btime = (time_t) 0;
  757. clear_bit(DQ_BLKS_B, &dquot->dq_flags);
  758. }
  759. static int warning_issued(struct dquot *dquot, const int warntype)
  760. {
  761. int flag = (warntype == QUOTA_NL_BHARDWARN ||
  762. warntype == QUOTA_NL_BSOFTLONGWARN) ? DQ_BLKS_B :
  763. ((warntype == QUOTA_NL_IHARDWARN ||
  764. warntype == QUOTA_NL_ISOFTLONGWARN) ? DQ_INODES_B : 0);
  765. if (!flag)
  766. return 0;
  767. return test_and_set_bit(flag, &dquot->dq_flags);
  768. }
  769. #ifdef CONFIG_PRINT_QUOTA_WARNING
  770. static int flag_print_warnings = 1;
  771. static inline int need_print_warning(struct dquot *dquot)
  772. {
  773. if (!flag_print_warnings)
  774. return 0;
  775. switch (dquot->dq_type) {
  776. case USRQUOTA:
  777. return current->fsuid == dquot->dq_id;
  778. case GRPQUOTA:
  779. return in_group_p(dquot->dq_id);
  780. }
  781. return 0;
  782. }
  783. /* Print warning to user which exceeded quota */
  784. static void print_warning(struct dquot *dquot, const int warntype)
  785. {
  786. char *msg = NULL;
  787. struct tty_struct *tty;
  788. if (!need_print_warning(dquot))
  789. return;
  790. mutex_lock(&tty_mutex);
  791. tty = get_current_tty();
  792. if (!tty)
  793. goto out_lock;
  794. tty_write_message(tty, dquot->dq_sb->s_id);
  795. if (warntype == QUOTA_NL_ISOFTWARN || warntype == QUOTA_NL_BSOFTWARN)
  796. tty_write_message(tty, ": warning, ");
  797. else
  798. tty_write_message(tty, ": write failed, ");
  799. tty_write_message(tty, quotatypes[dquot->dq_type]);
  800. switch (warntype) {
  801. case QUOTA_NL_IHARDWARN:
  802. msg = " file limit reached.\r\n";
  803. break;
  804. case QUOTA_NL_ISOFTLONGWARN:
  805. msg = " file quota exceeded too long.\r\n";
  806. break;
  807. case QUOTA_NL_ISOFTWARN:
  808. msg = " file quota exceeded.\r\n";
  809. break;
  810. case QUOTA_NL_BHARDWARN:
  811. msg = " block limit reached.\r\n";
  812. break;
  813. case QUOTA_NL_BSOFTLONGWARN:
  814. msg = " block quota exceeded too long.\r\n";
  815. break;
  816. case QUOTA_NL_BSOFTWARN:
  817. msg = " block quota exceeded.\r\n";
  818. break;
  819. }
  820. tty_write_message(tty, msg);
  821. out_lock:
  822. mutex_unlock(&tty_mutex);
  823. }
  824. #endif
  825. #ifdef CONFIG_QUOTA_NETLINK_INTERFACE
  826. /* Netlink family structure for quota */
  827. static struct genl_family quota_genl_family = {
  828. .id = GENL_ID_GENERATE,
  829. .hdrsize = 0,
  830. .name = "VFS_DQUOT",
  831. .version = 1,
  832. .maxattr = QUOTA_NL_A_MAX,
  833. };
  834. /* Send warning to userspace about user which exceeded quota */
  835. static void send_warning(const struct dquot *dquot, const char warntype)
  836. {
  837. static atomic_t seq;
  838. struct sk_buff *skb;
  839. void *msg_head;
  840. int ret;
  841. int msg_size = 4 * nla_total_size(sizeof(u32)) +
  842. 2 * nla_total_size(sizeof(u64));
  843. /* We have to allocate using GFP_NOFS as we are called from a
  844. * filesystem performing write and thus further recursion into
  845. * the fs to free some data could cause deadlocks. */
  846. skb = genlmsg_new(msg_size, GFP_NOFS);
  847. if (!skb) {
  848. printk(KERN_ERR
  849. "VFS: Not enough memory to send quota warning.\n");
  850. return;
  851. }
  852. msg_head = genlmsg_put(skb, 0, atomic_add_return(1, &seq),
  853. &quota_genl_family, 0, QUOTA_NL_C_WARNING);
  854. if (!msg_head) {
  855. printk(KERN_ERR
  856. "VFS: Cannot store netlink header in quota warning.\n");
  857. goto err_out;
  858. }
  859. ret = nla_put_u32(skb, QUOTA_NL_A_QTYPE, dquot->dq_type);
  860. if (ret)
  861. goto attr_err_out;
  862. ret = nla_put_u64(skb, QUOTA_NL_A_EXCESS_ID, dquot->dq_id);
  863. if (ret)
  864. goto attr_err_out;
  865. ret = nla_put_u32(skb, QUOTA_NL_A_WARNING, warntype);
  866. if (ret)
  867. goto attr_err_out;
  868. ret = nla_put_u32(skb, QUOTA_NL_A_DEV_MAJOR,
  869. MAJOR(dquot->dq_sb->s_dev));
  870. if (ret)
  871. goto attr_err_out;
  872. ret = nla_put_u32(skb, QUOTA_NL_A_DEV_MINOR,
  873. MINOR(dquot->dq_sb->s_dev));
  874. if (ret)
  875. goto attr_err_out;
  876. ret = nla_put_u64(skb, QUOTA_NL_A_CAUSED_ID, current->user->uid);
  877. if (ret)
  878. goto attr_err_out;
  879. genlmsg_end(skb, msg_head);
  880. ret = genlmsg_multicast(skb, 0, quota_genl_family.id, GFP_NOFS);
  881. if (ret < 0 && ret != -ESRCH)
  882. printk(KERN_ERR
  883. "VFS: Failed to send notification message: %d\n", ret);
  884. return;
  885. attr_err_out:
  886. printk(KERN_ERR "VFS: Not enough space to compose quota message!\n");
  887. err_out:
  888. kfree_skb(skb);
  889. }
  890. #endif
  891. static inline void flush_warnings(struct dquot * const *dquots, char *warntype)
  892. {
  893. int i;
  894. for (i = 0; i < MAXQUOTAS; i++)
  895. if (dquots[i] != NODQUOT && warntype[i] != QUOTA_NL_NOWARN &&
  896. !warning_issued(dquots[i], warntype[i])) {
  897. #ifdef CONFIG_PRINT_QUOTA_WARNING
  898. print_warning(dquots[i], warntype[i]);
  899. #endif
  900. #ifdef CONFIG_QUOTA_NETLINK_INTERFACE
  901. send_warning(dquots[i], warntype[i]);
  902. #endif
  903. }
  904. }
  905. static inline char ignore_hardlimit(struct dquot *dquot)
  906. {
  907. struct mem_dqinfo *info = &sb_dqopt(dquot->dq_sb)->info[dquot->dq_type];
  908. return capable(CAP_SYS_RESOURCE) &&
  909. (info->dqi_format->qf_fmt_id != QFMT_VFS_OLD || !(info->dqi_flags & V1_DQF_RSQUASH));
  910. }
  911. /* needs dq_data_lock */
  912. static int check_idq(struct dquot *dquot, ulong inodes, char *warntype)
  913. {
  914. *warntype = QUOTA_NL_NOWARN;
  915. if (inodes <= 0 || test_bit(DQ_FAKE_B, &dquot->dq_flags))
  916. return QUOTA_OK;
  917. if (dquot->dq_dqb.dqb_ihardlimit &&
  918. (dquot->dq_dqb.dqb_curinodes + inodes) > dquot->dq_dqb.dqb_ihardlimit &&
  919. !ignore_hardlimit(dquot)) {
  920. *warntype = QUOTA_NL_IHARDWARN;
  921. return NO_QUOTA;
  922. }
  923. if (dquot->dq_dqb.dqb_isoftlimit &&
  924. (dquot->dq_dqb.dqb_curinodes + inodes) > dquot->dq_dqb.dqb_isoftlimit &&
  925. dquot->dq_dqb.dqb_itime && get_seconds() >= dquot->dq_dqb.dqb_itime &&
  926. !ignore_hardlimit(dquot)) {
  927. *warntype = QUOTA_NL_ISOFTLONGWARN;
  928. return NO_QUOTA;
  929. }
  930. if (dquot->dq_dqb.dqb_isoftlimit &&
  931. (dquot->dq_dqb.dqb_curinodes + inodes) > dquot->dq_dqb.dqb_isoftlimit &&
  932. dquot->dq_dqb.dqb_itime == 0) {
  933. *warntype = QUOTA_NL_ISOFTWARN;
  934. dquot->dq_dqb.dqb_itime = get_seconds() + sb_dqopt(dquot->dq_sb)->info[dquot->dq_type].dqi_igrace;
  935. }
  936. return QUOTA_OK;
  937. }
  938. /* needs dq_data_lock */
  939. static int check_bdq(struct dquot *dquot, qsize_t space, int prealloc, char *warntype)
  940. {
  941. *warntype = QUOTA_NL_NOWARN;
  942. if (space <= 0 || test_bit(DQ_FAKE_B, &dquot->dq_flags))
  943. return QUOTA_OK;
  944. if (dquot->dq_dqb.dqb_bhardlimit &&
  945. toqb(dquot->dq_dqb.dqb_curspace + space) > dquot->dq_dqb.dqb_bhardlimit &&
  946. !ignore_hardlimit(dquot)) {
  947. if (!prealloc)
  948. *warntype = QUOTA_NL_BHARDWARN;
  949. return NO_QUOTA;
  950. }
  951. if (dquot->dq_dqb.dqb_bsoftlimit &&
  952. toqb(dquot->dq_dqb.dqb_curspace + space) > dquot->dq_dqb.dqb_bsoftlimit &&
  953. dquot->dq_dqb.dqb_btime && get_seconds() >= dquot->dq_dqb.dqb_btime &&
  954. !ignore_hardlimit(dquot)) {
  955. if (!prealloc)
  956. *warntype = QUOTA_NL_BSOFTLONGWARN;
  957. return NO_QUOTA;
  958. }
  959. if (dquot->dq_dqb.dqb_bsoftlimit &&
  960. toqb(dquot->dq_dqb.dqb_curspace + space) > dquot->dq_dqb.dqb_bsoftlimit &&
  961. dquot->dq_dqb.dqb_btime == 0) {
  962. if (!prealloc) {
  963. *warntype = QUOTA_NL_BSOFTWARN;
  964. dquot->dq_dqb.dqb_btime = get_seconds() + sb_dqopt(dquot->dq_sb)->info[dquot->dq_type].dqi_bgrace;
  965. }
  966. else
  967. /*
  968. * We don't allow preallocation to exceed softlimit so exceeding will
  969. * be always printed
  970. */
  971. return NO_QUOTA;
  972. }
  973. return QUOTA_OK;
  974. }
  975. /*
  976. * Initialize quota pointers in inode
  977. * Transaction must be started at entry
  978. */
  979. int dquot_initialize(struct inode *inode, int type)
  980. {
  981. unsigned int id = 0;
  982. int cnt, ret = 0;
  983. /* First test before acquiring mutex - solves deadlocks when we
  984. * re-enter the quota code and are already holding the mutex */
  985. if (IS_NOQUOTA(inode))
  986. return 0;
  987. down_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  988. /* Having dqptr_sem we know NOQUOTA flags can't be altered... */
  989. if (IS_NOQUOTA(inode))
  990. goto out_err;
  991. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  992. if (type != -1 && cnt != type)
  993. continue;
  994. if (inode->i_dquot[cnt] == NODQUOT) {
  995. switch (cnt) {
  996. case USRQUOTA:
  997. id = inode->i_uid;
  998. break;
  999. case GRPQUOTA:
  1000. id = inode->i_gid;
  1001. break;
  1002. }
  1003. inode->i_dquot[cnt] = dqget(inode->i_sb, id, cnt);
  1004. }
  1005. }
  1006. out_err:
  1007. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1008. return ret;
  1009. }
  1010. /*
  1011. * Release all quotas referenced by inode
  1012. * Transaction must be started at an entry
  1013. */
  1014. int dquot_drop(struct inode *inode)
  1015. {
  1016. int cnt;
  1017. down_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1018. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1019. if (inode->i_dquot[cnt] != NODQUOT) {
  1020. dqput(inode->i_dquot[cnt]);
  1021. inode->i_dquot[cnt] = NODQUOT;
  1022. }
  1023. }
  1024. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1025. return 0;
  1026. }
  1027. /*
  1028. * Following four functions update i_blocks+i_bytes fields and
  1029. * quota information (together with appropriate checks)
  1030. * NOTE: We absolutely rely on the fact that caller dirties
  1031. * the inode (usually macros in quotaops.h care about this) and
  1032. * holds a handle for the current transaction so that dquot write and
  1033. * inode write go into the same transaction.
  1034. */
  1035. /*
  1036. * This operation can block, but only after everything is updated
  1037. */
  1038. int dquot_alloc_space(struct inode *inode, qsize_t number, int warn)
  1039. {
  1040. int cnt, ret = NO_QUOTA;
  1041. char warntype[MAXQUOTAS];
  1042. /* First test before acquiring mutex - solves deadlocks when we
  1043. * re-enter the quota code and are already holding the mutex */
  1044. if (IS_NOQUOTA(inode)) {
  1045. out_add:
  1046. inode_add_bytes(inode, number);
  1047. return QUOTA_OK;
  1048. }
  1049. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1050. warntype[cnt] = QUOTA_NL_NOWARN;
  1051. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1052. if (IS_NOQUOTA(inode)) { /* Now we can do reliable test... */
  1053. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1054. goto out_add;
  1055. }
  1056. spin_lock(&dq_data_lock);
  1057. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1058. if (inode->i_dquot[cnt] == NODQUOT)
  1059. continue;
  1060. if (check_bdq(inode->i_dquot[cnt], number, warn, warntype+cnt) == NO_QUOTA)
  1061. goto warn_put_all;
  1062. }
  1063. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1064. if (inode->i_dquot[cnt] == NODQUOT)
  1065. continue;
  1066. dquot_incr_space(inode->i_dquot[cnt], number);
  1067. }
  1068. inode_add_bytes(inode, number);
  1069. ret = QUOTA_OK;
  1070. warn_put_all:
  1071. spin_unlock(&dq_data_lock);
  1072. if (ret == QUOTA_OK)
  1073. /* Dirtify all the dquots - this can block when journalling */
  1074. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1075. if (inode->i_dquot[cnt])
  1076. mark_dquot_dirty(inode->i_dquot[cnt]);
  1077. flush_warnings(inode->i_dquot, warntype);
  1078. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1079. return ret;
  1080. }
  1081. /*
  1082. * This operation can block, but only after everything is updated
  1083. */
  1084. int dquot_alloc_inode(const struct inode *inode, unsigned long number)
  1085. {
  1086. int cnt, ret = NO_QUOTA;
  1087. char warntype[MAXQUOTAS];
  1088. /* First test before acquiring mutex - solves deadlocks when we
  1089. * re-enter the quota code and are already holding the mutex */
  1090. if (IS_NOQUOTA(inode))
  1091. return QUOTA_OK;
  1092. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1093. warntype[cnt] = QUOTA_NL_NOWARN;
  1094. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1095. if (IS_NOQUOTA(inode)) {
  1096. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1097. return QUOTA_OK;
  1098. }
  1099. spin_lock(&dq_data_lock);
  1100. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1101. if (inode->i_dquot[cnt] == NODQUOT)
  1102. continue;
  1103. if (check_idq(inode->i_dquot[cnt], number, warntype+cnt) == NO_QUOTA)
  1104. goto warn_put_all;
  1105. }
  1106. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1107. if (inode->i_dquot[cnt] == NODQUOT)
  1108. continue;
  1109. dquot_incr_inodes(inode->i_dquot[cnt], number);
  1110. }
  1111. ret = QUOTA_OK;
  1112. warn_put_all:
  1113. spin_unlock(&dq_data_lock);
  1114. if (ret == QUOTA_OK)
  1115. /* Dirtify all the dquots - this can block when journalling */
  1116. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1117. if (inode->i_dquot[cnt])
  1118. mark_dquot_dirty(inode->i_dquot[cnt]);
  1119. flush_warnings(inode->i_dquot, warntype);
  1120. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1121. return ret;
  1122. }
  1123. /*
  1124. * This operation can block, but only after everything is updated
  1125. */
  1126. int dquot_free_space(struct inode *inode, qsize_t number)
  1127. {
  1128. unsigned int cnt;
  1129. /* First test before acquiring mutex - solves deadlocks when we
  1130. * re-enter the quota code and are already holding the mutex */
  1131. if (IS_NOQUOTA(inode)) {
  1132. out_sub:
  1133. inode_sub_bytes(inode, number);
  1134. return QUOTA_OK;
  1135. }
  1136. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1137. /* Now recheck reliably when holding dqptr_sem */
  1138. if (IS_NOQUOTA(inode)) {
  1139. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1140. goto out_sub;
  1141. }
  1142. spin_lock(&dq_data_lock);
  1143. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1144. if (inode->i_dquot[cnt] == NODQUOT)
  1145. continue;
  1146. dquot_decr_space(inode->i_dquot[cnt], number);
  1147. }
  1148. inode_sub_bytes(inode, number);
  1149. spin_unlock(&dq_data_lock);
  1150. /* Dirtify all the dquots - this can block when journalling */
  1151. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1152. if (inode->i_dquot[cnt])
  1153. mark_dquot_dirty(inode->i_dquot[cnt]);
  1154. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1155. return QUOTA_OK;
  1156. }
  1157. /*
  1158. * This operation can block, but only after everything is updated
  1159. */
  1160. int dquot_free_inode(const struct inode *inode, unsigned long number)
  1161. {
  1162. unsigned int cnt;
  1163. /* First test before acquiring mutex - solves deadlocks when we
  1164. * re-enter the quota code and are already holding the mutex */
  1165. if (IS_NOQUOTA(inode))
  1166. return QUOTA_OK;
  1167. down_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1168. /* Now recheck reliably when holding dqptr_sem */
  1169. if (IS_NOQUOTA(inode)) {
  1170. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1171. return QUOTA_OK;
  1172. }
  1173. spin_lock(&dq_data_lock);
  1174. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1175. if (inode->i_dquot[cnt] == NODQUOT)
  1176. continue;
  1177. dquot_decr_inodes(inode->i_dquot[cnt], number);
  1178. }
  1179. spin_unlock(&dq_data_lock);
  1180. /* Dirtify all the dquots - this can block when journalling */
  1181. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1182. if (inode->i_dquot[cnt])
  1183. mark_dquot_dirty(inode->i_dquot[cnt]);
  1184. up_read(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1185. return QUOTA_OK;
  1186. }
  1187. /*
  1188. * Transfer the number of inode and blocks from one diskquota to an other.
  1189. *
  1190. * This operation can block, but only after everything is updated
  1191. * A transaction must be started when entering this function.
  1192. */
  1193. int dquot_transfer(struct inode *inode, struct iattr *iattr)
  1194. {
  1195. qsize_t space;
  1196. struct dquot *transfer_from[MAXQUOTAS];
  1197. struct dquot *transfer_to[MAXQUOTAS];
  1198. int cnt, ret = NO_QUOTA, chuid = (iattr->ia_valid & ATTR_UID) && inode->i_uid != iattr->ia_uid,
  1199. chgid = (iattr->ia_valid & ATTR_GID) && inode->i_gid != iattr->ia_gid;
  1200. char warntype[MAXQUOTAS];
  1201. /* First test before acquiring mutex - solves deadlocks when we
  1202. * re-enter the quota code and are already holding the mutex */
  1203. if (IS_NOQUOTA(inode))
  1204. return QUOTA_OK;
  1205. /* Clear the arrays */
  1206. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1207. transfer_to[cnt] = transfer_from[cnt] = NODQUOT;
  1208. warntype[cnt] = QUOTA_NL_NOWARN;
  1209. }
  1210. down_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1211. /* Now recheck reliably when holding dqptr_sem */
  1212. if (IS_NOQUOTA(inode)) { /* File without quota accounting? */
  1213. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1214. return QUOTA_OK;
  1215. }
  1216. /* First build the transfer_to list - here we can block on
  1217. * reading/instantiating of dquots. We know that the transaction for
  1218. * us was already started so we don't violate lock ranking here */
  1219. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1220. switch (cnt) {
  1221. case USRQUOTA:
  1222. if (!chuid)
  1223. continue;
  1224. transfer_to[cnt] = dqget(inode->i_sb, iattr->ia_uid, cnt);
  1225. break;
  1226. case GRPQUOTA:
  1227. if (!chgid)
  1228. continue;
  1229. transfer_to[cnt] = dqget(inode->i_sb, iattr->ia_gid, cnt);
  1230. break;
  1231. }
  1232. }
  1233. spin_lock(&dq_data_lock);
  1234. space = inode_get_bytes(inode);
  1235. /* Build the transfer_from list and check the limits */
  1236. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1237. if (transfer_to[cnt] == NODQUOT)
  1238. continue;
  1239. transfer_from[cnt] = inode->i_dquot[cnt];
  1240. if (check_idq(transfer_to[cnt], 1, warntype+cnt) == NO_QUOTA ||
  1241. check_bdq(transfer_to[cnt], space, 0, warntype+cnt) == NO_QUOTA)
  1242. goto warn_put_all;
  1243. }
  1244. /*
  1245. * Finally perform the needed transfer from transfer_from to transfer_to
  1246. */
  1247. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1248. /*
  1249. * Skip changes for same uid or gid or for turned off quota-type.
  1250. */
  1251. if (transfer_to[cnt] == NODQUOT)
  1252. continue;
  1253. /* Due to IO error we might not have transfer_from[] structure */
  1254. if (transfer_from[cnt]) {
  1255. dquot_decr_inodes(transfer_from[cnt], 1);
  1256. dquot_decr_space(transfer_from[cnt], space);
  1257. }
  1258. dquot_incr_inodes(transfer_to[cnt], 1);
  1259. dquot_incr_space(transfer_to[cnt], space);
  1260. inode->i_dquot[cnt] = transfer_to[cnt];
  1261. }
  1262. ret = QUOTA_OK;
  1263. warn_put_all:
  1264. spin_unlock(&dq_data_lock);
  1265. /* Dirtify all the dquots - this can block when journalling */
  1266. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1267. if (transfer_from[cnt])
  1268. mark_dquot_dirty(transfer_from[cnt]);
  1269. if (transfer_to[cnt])
  1270. mark_dquot_dirty(transfer_to[cnt]);
  1271. }
  1272. flush_warnings(transfer_to, warntype);
  1273. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1274. if (ret == QUOTA_OK && transfer_from[cnt] != NODQUOT)
  1275. dqput(transfer_from[cnt]);
  1276. if (ret == NO_QUOTA && transfer_to[cnt] != NODQUOT)
  1277. dqput(transfer_to[cnt]);
  1278. }
  1279. up_write(&sb_dqopt(inode->i_sb)->dqptr_sem);
  1280. return ret;
  1281. }
  1282. /*
  1283. * Write info of quota file to disk
  1284. */
  1285. int dquot_commit_info(struct super_block *sb, int type)
  1286. {
  1287. int ret;
  1288. struct quota_info *dqopt = sb_dqopt(sb);
  1289. mutex_lock(&dqopt->dqio_mutex);
  1290. ret = dqopt->ops[type]->write_file_info(sb, type);
  1291. mutex_unlock(&dqopt->dqio_mutex);
  1292. return ret;
  1293. }
  1294. /*
  1295. * Definitions of diskquota operations.
  1296. */
  1297. struct dquot_operations dquot_operations = {
  1298. .initialize = dquot_initialize,
  1299. .drop = dquot_drop,
  1300. .alloc_space = dquot_alloc_space,
  1301. .alloc_inode = dquot_alloc_inode,
  1302. .free_space = dquot_free_space,
  1303. .free_inode = dquot_free_inode,
  1304. .transfer = dquot_transfer,
  1305. .write_dquot = dquot_commit,
  1306. .acquire_dquot = dquot_acquire,
  1307. .release_dquot = dquot_release,
  1308. .mark_dirty = dquot_mark_dquot_dirty,
  1309. .write_info = dquot_commit_info
  1310. };
  1311. static inline void set_enable_flags(struct quota_info *dqopt, int type)
  1312. {
  1313. switch (type) {
  1314. case USRQUOTA:
  1315. dqopt->flags |= DQUOT_USR_ENABLED;
  1316. dqopt->flags &= ~DQUOT_USR_SUSPENDED;
  1317. break;
  1318. case GRPQUOTA:
  1319. dqopt->flags |= DQUOT_GRP_ENABLED;
  1320. dqopt->flags &= ~DQUOT_GRP_SUSPENDED;
  1321. break;
  1322. }
  1323. }
  1324. static inline void reset_enable_flags(struct quota_info *dqopt, int type,
  1325. int remount)
  1326. {
  1327. switch (type) {
  1328. case USRQUOTA:
  1329. dqopt->flags &= ~DQUOT_USR_ENABLED;
  1330. if (remount)
  1331. dqopt->flags |= DQUOT_USR_SUSPENDED;
  1332. else
  1333. dqopt->flags &= ~DQUOT_USR_SUSPENDED;
  1334. break;
  1335. case GRPQUOTA:
  1336. dqopt->flags &= ~DQUOT_GRP_ENABLED;
  1337. if (remount)
  1338. dqopt->flags |= DQUOT_GRP_SUSPENDED;
  1339. else
  1340. dqopt->flags &= ~DQUOT_GRP_SUSPENDED;
  1341. break;
  1342. }
  1343. }
  1344. /*
  1345. * Turn quota off on a device. type == -1 ==> quotaoff for all types (umount)
  1346. */
  1347. int vfs_quota_off(struct super_block *sb, int type, int remount)
  1348. {
  1349. int cnt, ret = 0;
  1350. struct quota_info *dqopt = sb_dqopt(sb);
  1351. struct inode *toputinode[MAXQUOTAS];
  1352. /* We need to serialize quota_off() for device */
  1353. mutex_lock(&dqopt->dqonoff_mutex);
  1354. for (cnt = 0; cnt < MAXQUOTAS; cnt++) {
  1355. toputinode[cnt] = NULL;
  1356. if (type != -1 && cnt != type)
  1357. continue;
  1358. /* If we keep inodes of quota files after remount and quotaoff
  1359. * is called, drop kept inodes. */
  1360. if (!remount && sb_has_quota_suspended(sb, cnt)) {
  1361. iput(dqopt->files[cnt]);
  1362. dqopt->files[cnt] = NULL;
  1363. reset_enable_flags(dqopt, cnt, 0);
  1364. continue;
  1365. }
  1366. if (!sb_has_quota_enabled(sb, cnt))
  1367. continue;
  1368. reset_enable_flags(dqopt, cnt, remount);
  1369. /* Note: these are blocking operations */
  1370. drop_dquot_ref(sb, cnt);
  1371. invalidate_dquots(sb, cnt);
  1372. /*
  1373. * Now all dquots should be invalidated, all writes done so we should be only
  1374. * users of the info. No locks needed.
  1375. */
  1376. if (info_dirty(&dqopt->info[cnt]))
  1377. sb->dq_op->write_info(sb, cnt);
  1378. if (dqopt->ops[cnt]->free_file_info)
  1379. dqopt->ops[cnt]->free_file_info(sb, cnt);
  1380. put_quota_format(dqopt->info[cnt].dqi_format);
  1381. toputinode[cnt] = dqopt->files[cnt];
  1382. if (!remount)
  1383. dqopt->files[cnt] = NULL;
  1384. dqopt->info[cnt].dqi_flags = 0;
  1385. dqopt->info[cnt].dqi_igrace = 0;
  1386. dqopt->info[cnt].dqi_bgrace = 0;
  1387. dqopt->ops[cnt] = NULL;
  1388. }
  1389. mutex_unlock(&dqopt->dqonoff_mutex);
  1390. /* Sync the superblock so that buffers with quota data are written to
  1391. * disk (and so userspace sees correct data afterwards). */
  1392. if (sb->s_op->sync_fs)
  1393. sb->s_op->sync_fs(sb, 1);
  1394. sync_blockdev(sb->s_bdev);
  1395. /* Now the quota files are just ordinary files and we can set the
  1396. * inode flags back. Moreover we discard the pagecache so that
  1397. * userspace sees the writes we did bypassing the pagecache. We
  1398. * must also discard the blockdev buffers so that we see the
  1399. * changes done by userspace on the next quotaon() */
  1400. for (cnt = 0; cnt < MAXQUOTAS; cnt++)
  1401. if (toputinode[cnt]) {
  1402. mutex_lock(&dqopt->dqonoff_mutex);
  1403. /* If quota was reenabled in the meantime, we have
  1404. * nothing to do */
  1405. if (!sb_has_quota_enabled(sb, cnt)) {
  1406. mutex_lock_nested(&toputinode[cnt]->i_mutex, I_MUTEX_QUOTA);
  1407. toputinode[cnt]->i_flags &= ~(S_IMMUTABLE |
  1408. S_NOATIME | S_NOQUOTA);
  1409. truncate_inode_pages(&toputinode[cnt]->i_data, 0);
  1410. mutex_unlock(&toputinode[cnt]->i_mutex);
  1411. mark_inode_dirty(toputinode[cnt]);
  1412. }
  1413. mutex_unlock(&dqopt->dqonoff_mutex);
  1414. /* On remount RO, we keep the inode pointer so that we
  1415. * can reenable quota on the subsequent remount RW.
  1416. * But we have better not keep inode pointer when there
  1417. * is pending delete on the quota file... */
  1418. if (!remount)
  1419. iput(toputinode[cnt]);
  1420. else if (!toputinode[cnt]->i_nlink)
  1421. ret = -EBUSY;
  1422. }
  1423. if (sb->s_bdev)
  1424. invalidate_bdev(sb->s_bdev);
  1425. return ret;
  1426. }
  1427. /*
  1428. * Turn quotas on on a device
  1429. */
  1430. /* Helper function when we already have the inode */
  1431. static int vfs_quota_on_inode(struct inode *inode, int type, int format_id)
  1432. {
  1433. struct quota_format_type *fmt = find_quota_format(format_id);
  1434. struct super_block *sb = inode->i_sb;
  1435. struct quota_info *dqopt = sb_dqopt(sb);
  1436. int error;
  1437. int oldflags = -1;
  1438. if (!fmt)
  1439. return -ESRCH;
  1440. if (!S_ISREG(inode->i_mode)) {
  1441. error = -EACCES;
  1442. goto out_fmt;
  1443. }
  1444. if (IS_RDONLY(inode)) {
  1445. error = -EROFS;
  1446. goto out_fmt;
  1447. }
  1448. if (!sb->s_op->quota_write || !sb->s_op->quota_read) {
  1449. error = -EINVAL;
  1450. goto out_fmt;
  1451. }
  1452. /* As we bypass the pagecache we must now flush the inode so that
  1453. * we see all the changes from userspace... */
  1454. write_inode_now(inode, 1);
  1455. /* And now flush the block cache so that kernel sees the changes */
  1456. invalidate_bdev(sb->s_bdev);
  1457. mutex_lock(&inode->i_mutex);
  1458. mutex_lock(&dqopt->dqonoff_mutex);
  1459. if (sb_has_quota_enabled(sb, type) ||
  1460. sb_has_quota_suspended(sb, type)) {
  1461. error = -EBUSY;
  1462. goto out_lock;
  1463. }
  1464. /* We don't want quota and atime on quota files (deadlocks possible)
  1465. * Also nobody should write to the file - we use special IO operations
  1466. * which ignore the immutable bit. */
  1467. down_write(&dqopt->dqptr_sem);
  1468. oldflags = inode->i_flags & (S_NOATIME | S_IMMUTABLE | S_NOQUOTA);
  1469. inode->i_flags |= S_NOQUOTA | S_NOATIME | S_IMMUTABLE;
  1470. up_write(&dqopt->dqptr_sem);
  1471. sb->dq_op->drop(inode);
  1472. error = -EIO;
  1473. dqopt->files[type] = igrab(inode);
  1474. if (!dqopt->files[type])
  1475. goto out_lock;
  1476. error = -EINVAL;
  1477. if (!fmt->qf_ops->check_quota_file(sb, type))
  1478. goto out_file_init;
  1479. dqopt->ops[type] = fmt->qf_ops;
  1480. dqopt->info[type].dqi_format = fmt;
  1481. dqopt->info[type].dqi_fmt_id = format_id;
  1482. INIT_LIST_HEAD(&dqopt->info[type].dqi_dirty_list);
  1483. mutex_lock(&dqopt->dqio_mutex);
  1484. if ((error = dqopt->ops[type]->read_file_info(sb, type)) < 0) {
  1485. mutex_unlock(&dqopt->dqio_mutex);
  1486. goto out_file_init;
  1487. }
  1488. mutex_unlock(&dqopt->dqio_mutex);
  1489. mutex_unlock(&inode->i_mutex);
  1490. set_enable_flags(dqopt, type);
  1491. add_dquot_ref(sb, type);
  1492. mutex_unlock(&dqopt->dqonoff_mutex);
  1493. return 0;
  1494. out_file_init:
  1495. dqopt->files[type] = NULL;
  1496. iput(inode);
  1497. out_lock:
  1498. mutex_unlock(&dqopt->dqonoff_mutex);
  1499. if (oldflags != -1) {
  1500. down_write(&dqopt->dqptr_sem);
  1501. /* Set the flags back (in the case of accidental quotaon()
  1502. * on a wrong file we don't want to mess up the flags) */
  1503. inode->i_flags &= ~(S_NOATIME | S_NOQUOTA | S_IMMUTABLE);
  1504. inode->i_flags |= oldflags;
  1505. up_write(&dqopt->dqptr_sem);
  1506. }
  1507. mutex_unlock(&inode->i_mutex);
  1508. out_fmt:
  1509. put_quota_format(fmt);
  1510. return error;
  1511. }
  1512. /* Reenable quotas on remount RW */
  1513. static int vfs_quota_on_remount(struct super_block *sb, int type)
  1514. {
  1515. struct quota_info *dqopt = sb_dqopt(sb);
  1516. struct inode *inode;
  1517. int ret;
  1518. mutex_lock(&dqopt->dqonoff_mutex);
  1519. if (!sb_has_quota_suspended(sb, type)) {
  1520. mutex_unlock(&dqopt->dqonoff_mutex);
  1521. return 0;
  1522. }
  1523. BUG_ON(sb_has_quota_enabled(sb, type));
  1524. inode = dqopt->files[type];
  1525. dqopt->files[type] = NULL;
  1526. reset_enable_flags(dqopt, type, 0);
  1527. mutex_unlock(&dqopt->dqonoff_mutex);
  1528. ret = vfs_quota_on_inode(inode, type, dqopt->info[type].dqi_fmt_id);
  1529. iput(inode);
  1530. return ret;
  1531. }
  1532. /* Actual function called from quotactl() */
  1533. int vfs_quota_on(struct super_block *sb, int type, int format_id, char *path,
  1534. int remount)
  1535. {
  1536. struct nameidata nd;
  1537. int error;
  1538. if (remount)
  1539. return vfs_quota_on_remount(sb, type);
  1540. error = path_lookup(path, LOOKUP_FOLLOW, &nd);
  1541. if (error < 0)
  1542. return error;
  1543. error = security_quota_on(nd.path.dentry);
  1544. if (error)
  1545. goto out_path;
  1546. /* Quota file not on the same filesystem? */
  1547. if (nd.path.mnt->mnt_sb != sb)
  1548. error = -EXDEV;
  1549. else
  1550. error = vfs_quota_on_inode(nd.path.dentry->d_inode, type,
  1551. format_id);
  1552. out_path:
  1553. path_put(&nd.path);
  1554. return error;
  1555. }
  1556. /*
  1557. * This function is used when filesystem needs to initialize quotas
  1558. * during mount time.
  1559. */
  1560. int vfs_quota_on_mount(struct super_block *sb, char *qf_name,
  1561. int format_id, int type)
  1562. {
  1563. struct dentry *dentry;
  1564. int error;
  1565. dentry = lookup_one_len(qf_name, sb->s_root, strlen(qf_name));
  1566. if (IS_ERR(dentry))
  1567. return PTR_ERR(dentry);
  1568. if (!dentry->d_inode) {
  1569. error = -ENOENT;
  1570. goto out;
  1571. }
  1572. error = security_quota_on(dentry);
  1573. if (!error)
  1574. error = vfs_quota_on_inode(dentry->d_inode, type, format_id);
  1575. out:
  1576. dput(dentry);
  1577. return error;
  1578. }
  1579. /* Generic routine for getting common part of quota structure */
  1580. static void do_get_dqblk(struct dquot *dquot, struct if_dqblk *di)
  1581. {
  1582. struct mem_dqblk *dm = &dquot->dq_dqb;
  1583. spin_lock(&dq_data_lock);
  1584. di->dqb_bhardlimit = dm->dqb_bhardlimit;
  1585. di->dqb_bsoftlimit = dm->dqb_bsoftlimit;
  1586. di->dqb_curspace = dm->dqb_curspace;
  1587. di->dqb_ihardlimit = dm->dqb_ihardlimit;
  1588. di->dqb_isoftlimit = dm->dqb_isoftlimit;
  1589. di->dqb_curinodes = dm->dqb_curinodes;
  1590. di->dqb_btime = dm->dqb_btime;
  1591. di->dqb_itime = dm->dqb_itime;
  1592. di->dqb_valid = QIF_ALL;
  1593. spin_unlock(&dq_data_lock);
  1594. }
  1595. int vfs_get_dqblk(struct super_block *sb, int type, qid_t id, struct if_dqblk *di)
  1596. {
  1597. struct dquot *dquot;
  1598. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  1599. if (!(dquot = dqget(sb, id, type))) {
  1600. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  1601. return -ESRCH;
  1602. }
  1603. do_get_dqblk(dquot, di);
  1604. dqput(dquot);
  1605. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  1606. return 0;
  1607. }
  1608. /* Generic routine for setting common part of quota structure */
  1609. static int do_set_dqblk(struct dquot *dquot, struct if_dqblk *di)
  1610. {
  1611. struct mem_dqblk *dm = &dquot->dq_dqb;
  1612. int check_blim = 0, check_ilim = 0;
  1613. struct mem_dqinfo *dqi = &sb_dqopt(dquot->dq_sb)->info[dquot->dq_type];
  1614. if ((di->dqb_valid & QIF_BLIMITS &&
  1615. (di->dqb_bhardlimit > dqi->dqi_maxblimit ||
  1616. di->dqb_bsoftlimit > dqi->dqi_maxblimit)) ||
  1617. (di->dqb_valid & QIF_ILIMITS &&
  1618. (di->dqb_ihardlimit > dqi->dqi_maxilimit ||
  1619. di->dqb_isoftlimit > dqi->dqi_maxilimit)))
  1620. return -ERANGE;
  1621. spin_lock(&dq_data_lock);
  1622. if (di->dqb_valid & QIF_SPACE) {
  1623. dm->dqb_curspace = di->dqb_curspace;
  1624. check_blim = 1;
  1625. }
  1626. if (di->dqb_valid & QIF_BLIMITS) {
  1627. dm->dqb_bsoftlimit = di->dqb_bsoftlimit;
  1628. dm->dqb_bhardlimit = di->dqb_bhardlimit;
  1629. check_blim = 1;
  1630. }
  1631. if (di->dqb_valid & QIF_INODES) {
  1632. dm->dqb_curinodes = di->dqb_curinodes;
  1633. check_ilim = 1;
  1634. }
  1635. if (di->dqb_valid & QIF_ILIMITS) {
  1636. dm->dqb_isoftlimit = di->dqb_isoftlimit;
  1637. dm->dqb_ihardlimit = di->dqb_ihardlimit;
  1638. check_ilim = 1;
  1639. }
  1640. if (di->dqb_valid & QIF_BTIME)
  1641. dm->dqb_btime = di->dqb_btime;
  1642. if (di->dqb_valid & QIF_ITIME)
  1643. dm->dqb_itime = di->dqb_itime;
  1644. if (check_blim) {
  1645. if (!dm->dqb_bsoftlimit || toqb(dm->dqb_curspace) < dm->dqb_bsoftlimit) {
  1646. dm->dqb_btime = 0;
  1647. clear_bit(DQ_BLKS_B, &dquot->dq_flags);
  1648. }
  1649. else if (!(di->dqb_valid & QIF_BTIME)) /* Set grace only if user hasn't provided his own... */
  1650. dm->dqb_btime = get_seconds() + dqi->dqi_bgrace;
  1651. }
  1652. if (check_ilim) {
  1653. if (!dm->dqb_isoftlimit || dm->dqb_curinodes < dm->dqb_isoftlimit) {
  1654. dm->dqb_itime = 0;
  1655. clear_bit(DQ_INODES_B, &dquot->dq_flags);
  1656. }
  1657. else if (!(di->dqb_valid & QIF_ITIME)) /* Set grace only if user hasn't provided his own... */
  1658. dm->dqb_itime = get_seconds() + dqi->dqi_igrace;
  1659. }
  1660. if (dm->dqb_bhardlimit || dm->dqb_bsoftlimit || dm->dqb_ihardlimit || dm->dqb_isoftlimit)
  1661. clear_bit(DQ_FAKE_B, &dquot->dq_flags);
  1662. else
  1663. set_bit(DQ_FAKE_B, &dquot->dq_flags);
  1664. spin_unlock(&dq_data_lock);
  1665. mark_dquot_dirty(dquot);
  1666. return 0;
  1667. }
  1668. int vfs_set_dqblk(struct super_block *sb, int type, qid_t id, struct if_dqblk *di)
  1669. {
  1670. struct dquot *dquot;
  1671. int rc;
  1672. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  1673. if (!(dquot = dqget(sb, id, type))) {
  1674. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  1675. return -ESRCH;
  1676. }
  1677. rc = do_set_dqblk(dquot, di);
  1678. dqput(dquot);
  1679. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  1680. return rc;
  1681. }
  1682. /* Generic routine for getting common part of quota file information */
  1683. int vfs_get_dqinfo(struct super_block *sb, int type, struct if_dqinfo *ii)
  1684. {
  1685. struct mem_dqinfo *mi;
  1686. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  1687. if (!sb_has_quota_enabled(sb, type)) {
  1688. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  1689. return -ESRCH;
  1690. }
  1691. mi = sb_dqopt(sb)->info + type;
  1692. spin_lock(&dq_data_lock);
  1693. ii->dqi_bgrace = mi->dqi_bgrace;
  1694. ii->dqi_igrace = mi->dqi_igrace;
  1695. ii->dqi_flags = mi->dqi_flags & DQF_MASK;
  1696. ii->dqi_valid = IIF_ALL;
  1697. spin_unlock(&dq_data_lock);
  1698. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  1699. return 0;
  1700. }
  1701. /* Generic routine for setting common part of quota file information */
  1702. int vfs_set_dqinfo(struct super_block *sb, int type, struct if_dqinfo *ii)
  1703. {
  1704. struct mem_dqinfo *mi;
  1705. mutex_lock(&sb_dqopt(sb)->dqonoff_mutex);
  1706. if (!sb_has_quota_enabled(sb, type)) {
  1707. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  1708. return -ESRCH;
  1709. }
  1710. mi = sb_dqopt(sb)->info + type;
  1711. spin_lock(&dq_data_lock);
  1712. if (ii->dqi_valid & IIF_BGRACE)
  1713. mi->dqi_bgrace = ii->dqi_bgrace;
  1714. if (ii->dqi_valid & IIF_IGRACE)
  1715. mi->dqi_igrace = ii->dqi_igrace;
  1716. if (ii->dqi_valid & IIF_FLAGS)
  1717. mi->dqi_flags = (mi->dqi_flags & ~DQF_MASK) | (ii->dqi_flags & DQF_MASK);
  1718. spin_unlock(&dq_data_lock);
  1719. mark_info_dirty(sb, type);
  1720. /* Force write to disk */
  1721. sb->dq_op->write_info(sb, type);
  1722. mutex_unlock(&sb_dqopt(sb)->dqonoff_mutex);
  1723. return 0;
  1724. }
  1725. struct quotactl_ops vfs_quotactl_ops = {
  1726. .quota_on = vfs_quota_on,
  1727. .quota_off = vfs_quota_off,
  1728. .quota_sync = vfs_quota_sync,
  1729. .get_info = vfs_get_dqinfo,
  1730. .set_info = vfs_set_dqinfo,
  1731. .get_dqblk = vfs_get_dqblk,
  1732. .set_dqblk = vfs_set_dqblk
  1733. };
  1734. static ctl_table fs_dqstats_table[] = {
  1735. {
  1736. .ctl_name = FS_DQ_LOOKUPS,
  1737. .procname = "lookups",
  1738. .data = &dqstats.lookups,
  1739. .maxlen = sizeof(int),
  1740. .mode = 0444,
  1741. .proc_handler = &proc_dointvec,
  1742. },
  1743. {
  1744. .ctl_name = FS_DQ_DROPS,
  1745. .procname = "drops",
  1746. .data = &dqstats.drops,
  1747. .maxlen = sizeof(int),
  1748. .mode = 0444,
  1749. .proc_handler = &proc_dointvec,
  1750. },
  1751. {
  1752. .ctl_name = FS_DQ_READS,
  1753. .procname = "reads",
  1754. .data = &dqstats.reads,
  1755. .maxlen = sizeof(int),
  1756. .mode = 0444,
  1757. .proc_handler = &proc_dointvec,
  1758. },
  1759. {
  1760. .ctl_name = FS_DQ_WRITES,
  1761. .procname = "writes",
  1762. .data = &dqstats.writes,
  1763. .maxlen = sizeof(int),
  1764. .mode = 0444,
  1765. .proc_handler = &proc_dointvec,
  1766. },
  1767. {
  1768. .ctl_name = FS_DQ_CACHE_HITS,
  1769. .procname = "cache_hits",
  1770. .data = &dqstats.cache_hits,
  1771. .maxlen = sizeof(int),
  1772. .mode = 0444,
  1773. .proc_handler = &proc_dointvec,
  1774. },
  1775. {
  1776. .ctl_name = FS_DQ_ALLOCATED,
  1777. .procname = "allocated_dquots",
  1778. .data = &dqstats.allocated_dquots,
  1779. .maxlen = sizeof(int),
  1780. .mode = 0444,
  1781. .proc_handler = &proc_dointvec,
  1782. },
  1783. {
  1784. .ctl_name = FS_DQ_FREE,
  1785. .procname = "free_dquots",
  1786. .data = &dqstats.free_dquots,
  1787. .maxlen = sizeof(int),
  1788. .mode = 0444,
  1789. .proc_handler = &proc_dointvec,
  1790. },
  1791. {
  1792. .ctl_name = FS_DQ_SYNCS,
  1793. .procname = "syncs",
  1794. .data = &dqstats.syncs,
  1795. .maxlen = sizeof(int),
  1796. .mode = 0444,
  1797. .proc_handler = &proc_dointvec,
  1798. },
  1799. #ifdef CONFIG_PRINT_QUOTA_WARNING
  1800. {
  1801. .ctl_name = FS_DQ_WARNINGS,
  1802. .procname = "warnings",
  1803. .data = &flag_print_warnings,
  1804. .maxlen = sizeof(int),
  1805. .mode = 0644,
  1806. .proc_handler = &proc_dointvec,
  1807. },
  1808. #endif
  1809. { .ctl_name = 0 },
  1810. };
  1811. static ctl_table fs_table[] = {
  1812. {
  1813. .ctl_name = FS_DQSTATS,
  1814. .procname = "quota",
  1815. .mode = 0555,
  1816. .child = fs_dqstats_table,
  1817. },
  1818. { .ctl_name = 0 },
  1819. };
  1820. static ctl_table sys_table[] = {
  1821. {
  1822. .ctl_name = CTL_FS,
  1823. .procname = "fs",
  1824. .mode = 0555,
  1825. .child = fs_table,
  1826. },
  1827. { .ctl_name = 0 },
  1828. };
  1829. static int __init dquot_init(void)
  1830. {
  1831. int i;
  1832. unsigned long nr_hash, order;
  1833. printk(KERN_NOTICE "VFS: Disk quotas %s\n", __DQUOT_VERSION__);
  1834. register_sysctl_table(sys_table);
  1835. dquot_cachep = kmem_cache_create("dquot",
  1836. sizeof(struct dquot), sizeof(unsigned long) * 4,
  1837. (SLAB_HWCACHE_ALIGN|SLAB_RECLAIM_ACCOUNT|
  1838. SLAB_MEM_SPREAD|SLAB_PANIC),
  1839. NULL);
  1840. order = 0;
  1841. dquot_hash = (struct hlist_head *)__get_free_pages(GFP_ATOMIC, order);
  1842. if (!dquot_hash)
  1843. panic("Cannot create dquot hash table");
  1844. /* Find power-of-two hlist_heads which can fit into allocation */
  1845. nr_hash = (1UL << order) * PAGE_SIZE / sizeof(struct hlist_head);
  1846. dq_hash_bits = 0;
  1847. do {
  1848. dq_hash_bits++;
  1849. } while (nr_hash >> dq_hash_bits);
  1850. dq_hash_bits--;
  1851. nr_hash = 1UL << dq_hash_bits;
  1852. dq_hash_mask = nr_hash - 1;
  1853. for (i = 0; i < nr_hash; i++)
  1854. INIT_HLIST_HEAD(dquot_hash + i);
  1855. printk("Dquot-cache hash table entries: %ld (order %ld, %ld bytes)\n",
  1856. nr_hash, order, (PAGE_SIZE << order));
  1857. register_shrinker(&dqcache_shrinker);
  1858. #ifdef CONFIG_QUOTA_NETLINK_INTERFACE
  1859. if (genl_register_family(&quota_genl_family) != 0)
  1860. printk(KERN_ERR "VFS: Failed to create quota netlink interface.\n");
  1861. #endif
  1862. return 0;
  1863. }
  1864. module_init(dquot_init);
  1865. EXPORT_SYMBOL(register_quota_format);
  1866. EXPORT_SYMBOL(unregister_quota_format);
  1867. EXPORT_SYMBOL(dqstats);
  1868. EXPORT_SYMBOL(dq_data_lock);
  1869. EXPORT_SYMBOL(vfs_quota_on);
  1870. EXPORT_SYMBOL(vfs_quota_on_mount);
  1871. EXPORT_SYMBOL(vfs_quota_off);
  1872. EXPORT_SYMBOL(vfs_quota_sync);
  1873. EXPORT_SYMBOL(vfs_get_dqinfo);
  1874. EXPORT_SYMBOL(vfs_set_dqinfo);
  1875. EXPORT_SYMBOL(vfs_get_dqblk);
  1876. EXPORT_SYMBOL(vfs_set_dqblk);
  1877. EXPORT_SYMBOL(dquot_commit);
  1878. EXPORT_SYMBOL(dquot_commit_info);
  1879. EXPORT_SYMBOL(dquot_acquire);
  1880. EXPORT_SYMBOL(dquot_release);
  1881. EXPORT_SYMBOL(dquot_mark_dquot_dirty);
  1882. EXPORT_SYMBOL(dquot_initialize);
  1883. EXPORT_SYMBOL(dquot_drop);
  1884. EXPORT_SYMBOL(dquot_alloc_space);
  1885. EXPORT_SYMBOL(dquot_alloc_inode);
  1886. EXPORT_SYMBOL(dquot_free_space);
  1887. EXPORT_SYMBOL(dquot_free_inode);
  1888. EXPORT_SYMBOL(dquot_transfer);