2 * Copyright (c) 2010 The FreeBSD Foundation
5 * This software was developed by Edward Tomasz Napierala under sponsorship
6 * from the FreeBSD Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
35 #include <sys/param.h>
37 #include <sys/malloc.h>
38 #include <sys/queue.h>
39 #include <sys/refcount.h>
41 #include <sys/kernel.h>
42 #include <sys/limits.h>
43 #include <sys/loginclass.h>
46 #include <sys/racct.h>
48 #include <sys/resourcevar.h>
50 #include <sys/sysent.h>
51 #include <sys/sysproto.h>
52 #include <sys/systm.h>
53 #include <sys/types.h>
54 #include <sys/eventhandler.h>
56 #include <sys/mutex.h>
57 #include <sys/rwlock.h>
59 #include <sys/taskqueue.h>
65 #error "The RCTL option requires the RACCT option"
68 FEATURE(rctl, "Resource Limits");
71 #define HRF_DONT_INHERIT 1
72 #define HRF_DONT_ACCUMULATE 2
74 #define RCTL_MAX_INBUFSIZE 4 * 1024
75 #define RCTL_MAX_OUTBUFSIZE 16 * 1024 * 1024
76 #define RCTL_LOG_BUFSIZE 128
78 #define RCTL_PCPU_SHIFT (10 * 1000000)
80 unsigned int rctl_maxbufsize = RCTL_MAX_OUTBUFSIZE;
82 SYSCTL_NODE(_kern_racct, OID_AUTO, rctl, CTLFLAG_RW, 0, "Resource Limits");
83 SYSCTL_UINT(_kern_racct_rctl, OID_AUTO, maxbufsize, CTLFLAG_RWTUN,
84 &rctl_maxbufsize, 0, "Maximum output buffer size");
87 * 'rctl_rule_link' connects a rule with every racct it's related to.
88 * For example, rule 'user:X:openfiles:deny=N/process' is linked
89 * with uidinfo for user X, and to each process of that user.
91 struct rctl_rule_link {
92 LIST_ENTRY(rctl_rule_link) rrl_next;
93 struct rctl_rule *rrl_rule;
102 static struct dict subjectnames[] = {
103 { "process", RCTL_SUBJECT_TYPE_PROCESS },
104 { "user", RCTL_SUBJECT_TYPE_USER },
105 { "loginclass", RCTL_SUBJECT_TYPE_LOGINCLASS },
106 { "jail", RCTL_SUBJECT_TYPE_JAIL },
109 static struct dict resourcenames[] = {
110 { "cputime", RACCT_CPU },
111 { "datasize", RACCT_DATA },
112 { "stacksize", RACCT_STACK },
113 { "coredumpsize", RACCT_CORE },
114 { "memoryuse", RACCT_RSS },
115 { "memorylocked", RACCT_MEMLOCK },
116 { "maxproc", RACCT_NPROC },
117 { "openfiles", RACCT_NOFILE },
118 { "vmemoryuse", RACCT_VMEM },
119 { "pseudoterminals", RACCT_NPTS },
120 { "swapuse", RACCT_SWAP },
121 { "nthr", RACCT_NTHR },
122 { "msgqqueued", RACCT_MSGQQUEUED },
123 { "msgqsize", RACCT_MSGQSIZE },
124 { "nmsgq", RACCT_NMSGQ },
125 { "nsem", RACCT_NSEM },
126 { "nsemop", RACCT_NSEMOP },
127 { "nshm", RACCT_NSHM },
128 { "shmsize", RACCT_SHMSIZE },
129 { "wallclock", RACCT_WALLCLOCK },
130 { "pcpu", RACCT_PCTCPU },
133 static struct dict actionnames[] = {
134 { "sighup", RCTL_ACTION_SIGHUP },
135 { "sigint", RCTL_ACTION_SIGINT },
136 { "sigquit", RCTL_ACTION_SIGQUIT },
137 { "sigill", RCTL_ACTION_SIGILL },
138 { "sigtrap", RCTL_ACTION_SIGTRAP },
139 { "sigabrt", RCTL_ACTION_SIGABRT },
140 { "sigemt", RCTL_ACTION_SIGEMT },
141 { "sigfpe", RCTL_ACTION_SIGFPE },
142 { "sigkill", RCTL_ACTION_SIGKILL },
143 { "sigbus", RCTL_ACTION_SIGBUS },
144 { "sigsegv", RCTL_ACTION_SIGSEGV },
145 { "sigsys", RCTL_ACTION_SIGSYS },
146 { "sigpipe", RCTL_ACTION_SIGPIPE },
147 { "sigalrm", RCTL_ACTION_SIGALRM },
148 { "sigterm", RCTL_ACTION_SIGTERM },
149 { "sigurg", RCTL_ACTION_SIGURG },
150 { "sigstop", RCTL_ACTION_SIGSTOP },
151 { "sigtstp", RCTL_ACTION_SIGTSTP },
152 { "sigchld", RCTL_ACTION_SIGCHLD },
153 { "sigttin", RCTL_ACTION_SIGTTIN },
154 { "sigttou", RCTL_ACTION_SIGTTOU },
155 { "sigio", RCTL_ACTION_SIGIO },
156 { "sigxcpu", RCTL_ACTION_SIGXCPU },
157 { "sigxfsz", RCTL_ACTION_SIGXFSZ },
158 { "sigvtalrm", RCTL_ACTION_SIGVTALRM },
159 { "sigprof", RCTL_ACTION_SIGPROF },
160 { "sigwinch", RCTL_ACTION_SIGWINCH },
161 { "siginfo", RCTL_ACTION_SIGINFO },
162 { "sigusr1", RCTL_ACTION_SIGUSR1 },
163 { "sigusr2", RCTL_ACTION_SIGUSR2 },
164 { "sigthr", RCTL_ACTION_SIGTHR },
165 { "deny", RCTL_ACTION_DENY },
166 { "log", RCTL_ACTION_LOG },
167 { "devctl", RCTL_ACTION_DEVCTL },
170 static void rctl_init(void);
171 SYSINIT(rctl, SI_SUB_RACCT, SI_ORDER_FIRST, rctl_init, NULL);
173 static uma_zone_t rctl_rule_link_zone;
174 static uma_zone_t rctl_rule_zone;
175 static struct rwlock rctl_lock;
176 RW_SYSINIT(rctl_lock, &rctl_lock, "RCTL lock");
178 static int rctl_rule_fully_specified(const struct rctl_rule *rule);
179 static void rctl_rule_to_sbuf(struct sbuf *sb, const struct rctl_rule *rule);
181 static MALLOC_DEFINE(M_RCTL, "rctl", "Resource Limits");
184 rctl_subject_type_name(int subject)
188 for (i = 0; subjectnames[i].d_name != NULL; i++) {
189 if (subjectnames[i].d_value == subject)
190 return (subjectnames[i].d_name);
193 panic("rctl_subject_type_name: unknown subject type %d", subject);
197 rctl_action_name(int action)
201 for (i = 0; actionnames[i].d_name != NULL; i++) {
202 if (actionnames[i].d_value == action)
203 return (actionnames[i].d_name);
206 panic("rctl_action_name: unknown action %d", action);
210 rctl_resource_name(int resource)
214 for (i = 0; resourcenames[i].d_name != NULL; i++) {
215 if (resourcenames[i].d_value == resource)
216 return (resourcenames[i].d_name);
219 panic("rctl_resource_name: unknown resource %d", resource);
223 * Return the amount of resource that can be allocated by 'p' before
227 rctl_available_resource(const struct proc *p, const struct rctl_rule *rule)
230 int64_t available = INT64_MAX;
231 struct ucred *cred = p->p_ucred;
233 ASSERT_RACCT_ENABLED();
234 rw_assert(&rctl_lock, RA_LOCKED);
236 resource = rule->rr_resource;
237 switch (rule->rr_per) {
238 case RCTL_SUBJECT_TYPE_PROCESS:
239 available = rule->rr_amount -
240 p->p_racct->r_resources[resource];
242 case RCTL_SUBJECT_TYPE_USER:
243 available = rule->rr_amount -
244 cred->cr_ruidinfo->ui_racct->r_resources[resource];
246 case RCTL_SUBJECT_TYPE_LOGINCLASS:
247 available = rule->rr_amount -
248 cred->cr_loginclass->lc_racct->r_resources[resource];
250 case RCTL_SUBJECT_TYPE_JAIL:
251 available = rule->rr_amount -
252 cred->cr_prison->pr_prison_racct->prr_racct->
253 r_resources[resource];
256 panic("rctl_compute_available: unknown per %d",
264 * Return non-zero if allocating 'amount' by proc 'p' would exceed
265 * resource limit specified by 'rule'.
268 rctl_would_exceed(const struct proc *p, const struct rctl_rule *rule,
273 ASSERT_RACCT_ENABLED();
275 rw_assert(&rctl_lock, RA_LOCKED);
277 available = rctl_available_resource(p, rule);
278 if (available >= amount)
285 * Special version of rctl_get_available() for the %CPU resource.
286 * We slightly cheat here and return less than we normally would.
289 rctl_pcpu_available(const struct proc *p) {
290 struct rctl_rule *rule;
291 struct rctl_rule_link *link;
292 int64_t available, minavailable, limit;
294 ASSERT_RACCT_ENABLED();
296 minavailable = INT64_MAX;
299 rw_rlock(&rctl_lock);
301 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
302 rule = link->rrl_rule;
303 if (rule->rr_resource != RACCT_PCTCPU)
305 if (rule->rr_action != RCTL_ACTION_DENY)
307 available = rctl_available_resource(p, rule);
308 if (available < minavailable) {
309 minavailable = available;
310 limit = rule->rr_amount;
314 rw_runlock(&rctl_lock);
317 * Return slightly less than actual value of the available
318 * %cpu resource. This makes %cpu throttling more agressive
319 * and lets us act sooner than the limits are already exceeded.
322 if (limit > 2 * RCTL_PCPU_SHIFT)
323 minavailable -= RCTL_PCPU_SHIFT;
325 minavailable -= (limit / 2);
328 return (minavailable);
332 * Check whether the proc 'p' can allocate 'amount' of 'resource' in addition
333 * to what it keeps allocated now. Returns non-zero if the allocation should
334 * be denied, 0 otherwise.
337 rctl_enforce(struct proc *p, int resource, uint64_t amount)
339 struct rctl_rule *rule;
340 struct rctl_rule_link *link;
344 static int curtime = 0;
345 static struct timeval lasttime;
347 ASSERT_RACCT_ENABLED();
349 rw_rlock(&rctl_lock);
352 * There may be more than one matching rule; go through all of them.
353 * Denial should be done last, after logging and sending signals.
355 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
356 rule = link->rrl_rule;
357 if (rule->rr_resource != resource)
359 if (!rctl_would_exceed(p, rule, amount)) {
360 link->rrl_exceeded = 0;
364 switch (rule->rr_action) {
365 case RCTL_ACTION_DENY:
368 case RCTL_ACTION_LOG:
370 * If rrl_exceeded != 0, it means we've already
371 * logged a warning for this process.
373 if (link->rrl_exceeded != 0)
377 * If the process state is not fully initialized yet,
378 * we can't access most of the required fields, e.g.
379 * p->p_comm. This happens when called from fork1().
380 * Ignore this rule for now; it will be processed just
381 * after fork, when called from racct_proc_fork_done().
383 if (p->p_state != PRS_NORMAL)
386 if (!ppsratecheck(&lasttime, &curtime, 10))
389 buf = malloc(RCTL_LOG_BUFSIZE, M_RCTL, M_NOWAIT);
391 printf("rctl_enforce: out of memory\n");
394 sbuf_new(&sb, buf, RCTL_LOG_BUFSIZE, SBUF_FIXEDLEN);
395 rctl_rule_to_sbuf(&sb, rule);
397 printf("rctl: rule \"%s\" matched by pid %d "
398 "(%s), uid %d, jail %s\n", sbuf_data(&sb),
399 p->p_pid, p->p_comm, p->p_ucred->cr_uid,
400 p->p_ucred->cr_prison->pr_prison_racct->prr_name);
403 link->rrl_exceeded = 1;
405 case RCTL_ACTION_DEVCTL:
406 if (link->rrl_exceeded != 0)
409 if (p->p_state != PRS_NORMAL)
412 buf = malloc(RCTL_LOG_BUFSIZE, M_RCTL, M_NOWAIT);
414 printf("rctl_enforce: out of memory\n");
417 sbuf_new(&sb, buf, RCTL_LOG_BUFSIZE, SBUF_FIXEDLEN);
418 sbuf_printf(&sb, "rule=");
419 rctl_rule_to_sbuf(&sb, rule);
420 sbuf_printf(&sb, " pid=%d ruid=%d jail=%s",
421 p->p_pid, p->p_ucred->cr_ruid,
422 p->p_ucred->cr_prison->pr_prison_racct->prr_name);
424 devctl_notify_f("RCTL", "rule", "matched",
425 sbuf_data(&sb), M_NOWAIT);
428 link->rrl_exceeded = 1;
431 if (link->rrl_exceeded != 0)
434 if (p->p_state != PRS_NORMAL)
437 KASSERT(rule->rr_action > 0 &&
438 rule->rr_action <= RCTL_ACTION_SIGNAL_MAX,
439 ("rctl_enforce: unknown action %d",
443 * We're using the fact that RCTL_ACTION_SIG* values
444 * are equal to their counterparts from sys/signal.h.
446 kern_psignal(p, rule->rr_action);
447 link->rrl_exceeded = 1;
452 rw_runlock(&rctl_lock);
456 * Return fake error code; the caller should change it
457 * into one proper for the situation - EFSIZ, ENOMEM etc.
466 rctl_get_limit(struct proc *p, int resource)
468 struct rctl_rule *rule;
469 struct rctl_rule_link *link;
470 uint64_t amount = UINT64_MAX;
472 ASSERT_RACCT_ENABLED();
474 rw_rlock(&rctl_lock);
477 * There may be more than one matching rule; go through all of them.
478 * Denial should be done last, after logging and sending signals.
480 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
481 rule = link->rrl_rule;
482 if (rule->rr_resource != resource)
484 if (rule->rr_action != RCTL_ACTION_DENY)
486 if (rule->rr_amount < amount)
487 amount = rule->rr_amount;
490 rw_runlock(&rctl_lock);
496 rctl_get_available(struct proc *p, int resource)
498 struct rctl_rule *rule;
499 struct rctl_rule_link *link;
500 int64_t available, minavailable, allocated;
502 minavailable = INT64_MAX;
504 ASSERT_RACCT_ENABLED();
506 rw_rlock(&rctl_lock);
509 * There may be more than one matching rule; go through all of them.
510 * Denial should be done last, after logging and sending signals.
512 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
513 rule = link->rrl_rule;
514 if (rule->rr_resource != resource)
516 if (rule->rr_action != RCTL_ACTION_DENY)
518 available = rctl_available_resource(p, rule);
519 if (available < minavailable)
520 minavailable = available;
523 rw_runlock(&rctl_lock);
526 * XXX: Think about this _hard_.
528 allocated = p->p_racct->r_resources[resource];
529 if (minavailable < INT64_MAX - allocated)
530 minavailable += allocated;
531 if (minavailable < 0)
533 return (minavailable);
537 rctl_rule_matches(const struct rctl_rule *rule, const struct rctl_rule *filter)
540 ASSERT_RACCT_ENABLED();
542 if (filter->rr_subject_type != RCTL_SUBJECT_TYPE_UNDEFINED) {
543 if (rule->rr_subject_type != filter->rr_subject_type)
546 switch (filter->rr_subject_type) {
547 case RCTL_SUBJECT_TYPE_PROCESS:
548 if (filter->rr_subject.rs_proc != NULL &&
549 rule->rr_subject.rs_proc !=
550 filter->rr_subject.rs_proc)
553 case RCTL_SUBJECT_TYPE_USER:
554 if (filter->rr_subject.rs_uip != NULL &&
555 rule->rr_subject.rs_uip !=
556 filter->rr_subject.rs_uip)
559 case RCTL_SUBJECT_TYPE_LOGINCLASS:
560 if (filter->rr_subject.rs_loginclass != NULL &&
561 rule->rr_subject.rs_loginclass !=
562 filter->rr_subject.rs_loginclass)
565 case RCTL_SUBJECT_TYPE_JAIL:
566 if (filter->rr_subject.rs_prison_racct != NULL &&
567 rule->rr_subject.rs_prison_racct !=
568 filter->rr_subject.rs_prison_racct)
572 panic("rctl_rule_matches: unknown subject type %d",
573 filter->rr_subject_type);
577 if (filter->rr_resource != RACCT_UNDEFINED) {
578 if (rule->rr_resource != filter->rr_resource)
582 if (filter->rr_action != RCTL_ACTION_UNDEFINED) {
583 if (rule->rr_action != filter->rr_action)
587 if (filter->rr_amount != RCTL_AMOUNT_UNDEFINED) {
588 if (rule->rr_amount != filter->rr_amount)
592 if (filter->rr_per != RCTL_SUBJECT_TYPE_UNDEFINED) {
593 if (rule->rr_per != filter->rr_per)
601 str2value(const char *str, int *value, struct dict *table)
608 for (i = 0; table[i].d_name != NULL; i++) {
609 if (strcasecmp(table[i].d_name, str) == 0) {
610 *value = table[i].d_value;
619 str2id(const char *str, id_t *value)
626 *value = strtoul(str, &end, 10);
627 if ((size_t)(end - str) != strlen(str))
634 str2int64(const char *str, int64_t *value)
641 *value = strtoul(str, &end, 10);
642 if ((size_t)(end - str) != strlen(str))
649 * Connect the rule to the racct, increasing refcount for the rule.
652 rctl_racct_add_rule(struct racct *racct, struct rctl_rule *rule)
654 struct rctl_rule_link *link;
656 ASSERT_RACCT_ENABLED();
657 KASSERT(rctl_rule_fully_specified(rule), ("rule not fully specified"));
659 rctl_rule_acquire(rule);
660 link = uma_zalloc(rctl_rule_link_zone, M_WAITOK);
661 link->rrl_rule = rule;
662 link->rrl_exceeded = 0;
664 rw_wlock(&rctl_lock);
665 LIST_INSERT_HEAD(&racct->r_rule_links, link, rrl_next);
666 rw_wunlock(&rctl_lock);
670 rctl_racct_add_rule_locked(struct racct *racct, struct rctl_rule *rule)
672 struct rctl_rule_link *link;
674 ASSERT_RACCT_ENABLED();
675 KASSERT(rctl_rule_fully_specified(rule), ("rule not fully specified"));
676 rw_assert(&rctl_lock, RA_WLOCKED);
678 link = uma_zalloc(rctl_rule_link_zone, M_NOWAIT);
681 rctl_rule_acquire(rule);
682 link->rrl_rule = rule;
683 link->rrl_exceeded = 0;
685 LIST_INSERT_HEAD(&racct->r_rule_links, link, rrl_next);
690 * Remove limits for a rules matching the filter and release
691 * the refcounts for the rules, possibly freeing them. Returns
692 * the number of limit structures removed.
695 rctl_racct_remove_rules(struct racct *racct,
696 const struct rctl_rule *filter)
699 struct rctl_rule_link *link, *linktmp;
701 ASSERT_RACCT_ENABLED();
702 rw_assert(&rctl_lock, RA_WLOCKED);
704 LIST_FOREACH_SAFE(link, &racct->r_rule_links, rrl_next, linktmp) {
705 if (!rctl_rule_matches(link->rrl_rule, filter))
708 LIST_REMOVE(link, rrl_next);
709 rctl_rule_release(link->rrl_rule);
710 uma_zfree(rctl_rule_link_zone, link);
717 rctl_rule_acquire_subject(struct rctl_rule *rule)
720 ASSERT_RACCT_ENABLED();
722 switch (rule->rr_subject_type) {
723 case RCTL_SUBJECT_TYPE_UNDEFINED:
724 case RCTL_SUBJECT_TYPE_PROCESS:
726 case RCTL_SUBJECT_TYPE_JAIL:
727 if (rule->rr_subject.rs_prison_racct != NULL)
728 prison_racct_hold(rule->rr_subject.rs_prison_racct);
730 case RCTL_SUBJECT_TYPE_USER:
731 if (rule->rr_subject.rs_uip != NULL)
732 uihold(rule->rr_subject.rs_uip);
734 case RCTL_SUBJECT_TYPE_LOGINCLASS:
735 if (rule->rr_subject.rs_loginclass != NULL)
736 loginclass_hold(rule->rr_subject.rs_loginclass);
739 panic("rctl_rule_acquire_subject: unknown subject type %d",
740 rule->rr_subject_type);
745 rctl_rule_release_subject(struct rctl_rule *rule)
748 ASSERT_RACCT_ENABLED();
750 switch (rule->rr_subject_type) {
751 case RCTL_SUBJECT_TYPE_UNDEFINED:
752 case RCTL_SUBJECT_TYPE_PROCESS:
754 case RCTL_SUBJECT_TYPE_JAIL:
755 if (rule->rr_subject.rs_prison_racct != NULL)
756 prison_racct_free(rule->rr_subject.rs_prison_racct);
758 case RCTL_SUBJECT_TYPE_USER:
759 if (rule->rr_subject.rs_uip != NULL)
760 uifree(rule->rr_subject.rs_uip);
762 case RCTL_SUBJECT_TYPE_LOGINCLASS:
763 if (rule->rr_subject.rs_loginclass != NULL)
764 loginclass_free(rule->rr_subject.rs_loginclass);
767 panic("rctl_rule_release_subject: unknown subject type %d",
768 rule->rr_subject_type);
773 rctl_rule_alloc(int flags)
775 struct rctl_rule *rule;
777 ASSERT_RACCT_ENABLED();
779 rule = uma_zalloc(rctl_rule_zone, flags);
782 rule->rr_subject_type = RCTL_SUBJECT_TYPE_UNDEFINED;
783 rule->rr_subject.rs_proc = NULL;
784 rule->rr_subject.rs_uip = NULL;
785 rule->rr_subject.rs_loginclass = NULL;
786 rule->rr_subject.rs_prison_racct = NULL;
787 rule->rr_per = RCTL_SUBJECT_TYPE_UNDEFINED;
788 rule->rr_resource = RACCT_UNDEFINED;
789 rule->rr_action = RCTL_ACTION_UNDEFINED;
790 rule->rr_amount = RCTL_AMOUNT_UNDEFINED;
791 refcount_init(&rule->rr_refcount, 1);
797 rctl_rule_duplicate(const struct rctl_rule *rule, int flags)
799 struct rctl_rule *copy;
801 ASSERT_RACCT_ENABLED();
803 copy = uma_zalloc(rctl_rule_zone, flags);
806 copy->rr_subject_type = rule->rr_subject_type;
807 copy->rr_subject.rs_proc = rule->rr_subject.rs_proc;
808 copy->rr_subject.rs_uip = rule->rr_subject.rs_uip;
809 copy->rr_subject.rs_loginclass = rule->rr_subject.rs_loginclass;
810 copy->rr_subject.rs_prison_racct = rule->rr_subject.rs_prison_racct;
811 copy->rr_per = rule->rr_per;
812 copy->rr_resource = rule->rr_resource;
813 copy->rr_action = rule->rr_action;
814 copy->rr_amount = rule->rr_amount;
815 refcount_init(©->rr_refcount, 1);
816 rctl_rule_acquire_subject(copy);
822 rctl_rule_acquire(struct rctl_rule *rule)
825 ASSERT_RACCT_ENABLED();
826 KASSERT(rule->rr_refcount > 0, ("rule->rr_refcount <= 0"));
828 refcount_acquire(&rule->rr_refcount);
832 rctl_rule_free(void *context, int pending)
834 struct rctl_rule *rule;
836 rule = (struct rctl_rule *)context;
838 ASSERT_RACCT_ENABLED();
839 KASSERT(rule->rr_refcount == 0, ("rule->rr_refcount != 0"));
842 * We don't need locking here; rule is guaranteed to be inaccessible.
845 rctl_rule_release_subject(rule);
846 uma_zfree(rctl_rule_zone, rule);
850 rctl_rule_release(struct rctl_rule *rule)
853 ASSERT_RACCT_ENABLED();
854 KASSERT(rule->rr_refcount > 0, ("rule->rr_refcount <= 0"));
856 if (refcount_release(&rule->rr_refcount)) {
858 * rctl_rule_release() is often called when iterating
859 * over all the uidinfo structures in the system,
860 * holding uihashtbl_lock. Since rctl_rule_free()
861 * might end up calling uifree(), this would lead
862 * to lock recursion. Use taskqueue to avoid this.
864 TASK_INIT(&rule->rr_task, 0, rctl_rule_free, rule);
865 taskqueue_enqueue(taskqueue_thread, &rule->rr_task);
870 rctl_rule_fully_specified(const struct rctl_rule *rule)
873 ASSERT_RACCT_ENABLED();
875 switch (rule->rr_subject_type) {
876 case RCTL_SUBJECT_TYPE_UNDEFINED:
878 case RCTL_SUBJECT_TYPE_PROCESS:
879 if (rule->rr_subject.rs_proc == NULL)
882 case RCTL_SUBJECT_TYPE_USER:
883 if (rule->rr_subject.rs_uip == NULL)
886 case RCTL_SUBJECT_TYPE_LOGINCLASS:
887 if (rule->rr_subject.rs_loginclass == NULL)
890 case RCTL_SUBJECT_TYPE_JAIL:
891 if (rule->rr_subject.rs_prison_racct == NULL)
895 panic("rctl_rule_fully_specified: unknown subject type %d",
896 rule->rr_subject_type);
898 if (rule->rr_resource == RACCT_UNDEFINED)
900 if (rule->rr_action == RCTL_ACTION_UNDEFINED)
902 if (rule->rr_amount == RCTL_AMOUNT_UNDEFINED)
904 if (rule->rr_per == RCTL_SUBJECT_TYPE_UNDEFINED)
911 rctl_string_to_rule(char *rulestr, struct rctl_rule **rulep)
914 char *subjectstr, *subject_idstr, *resourcestr, *actionstr,
916 struct rctl_rule *rule;
919 ASSERT_RACCT_ENABLED();
921 rule = rctl_rule_alloc(M_WAITOK);
923 subjectstr = strsep(&rulestr, ":");
924 subject_idstr = strsep(&rulestr, ":");
925 resourcestr = strsep(&rulestr, ":");
926 actionstr = strsep(&rulestr, "=/");
927 amountstr = strsep(&rulestr, "/");
930 if (subjectstr == NULL || subjectstr[0] == '\0')
931 rule->rr_subject_type = RCTL_SUBJECT_TYPE_UNDEFINED;
933 error = str2value(subjectstr, &rule->rr_subject_type, subjectnames);
938 if (subject_idstr == NULL || subject_idstr[0] == '\0') {
939 rule->rr_subject.rs_proc = NULL;
940 rule->rr_subject.rs_uip = NULL;
941 rule->rr_subject.rs_loginclass = NULL;
942 rule->rr_subject.rs_prison_racct = NULL;
944 switch (rule->rr_subject_type) {
945 case RCTL_SUBJECT_TYPE_UNDEFINED:
948 case RCTL_SUBJECT_TYPE_PROCESS:
949 error = str2id(subject_idstr, &id);
952 sx_assert(&allproc_lock, SA_LOCKED);
953 rule->rr_subject.rs_proc = pfind(id);
954 if (rule->rr_subject.rs_proc == NULL) {
958 PROC_UNLOCK(rule->rr_subject.rs_proc);
960 case RCTL_SUBJECT_TYPE_USER:
961 error = str2id(subject_idstr, &id);
964 rule->rr_subject.rs_uip = uifind(id);
966 case RCTL_SUBJECT_TYPE_LOGINCLASS:
967 rule->rr_subject.rs_loginclass =
968 loginclass_find(subject_idstr);
969 if (rule->rr_subject.rs_loginclass == NULL) {
970 error = ENAMETOOLONG;
974 case RCTL_SUBJECT_TYPE_JAIL:
975 rule->rr_subject.rs_prison_racct =
976 prison_racct_find(subject_idstr);
977 if (rule->rr_subject.rs_prison_racct == NULL) {
978 error = ENAMETOOLONG;
983 panic("rctl_string_to_rule: unknown subject type %d",
984 rule->rr_subject_type);
988 if (resourcestr == NULL || resourcestr[0] == '\0')
989 rule->rr_resource = RACCT_UNDEFINED;
991 error = str2value(resourcestr, &rule->rr_resource,
997 if (actionstr == NULL || actionstr[0] == '\0')
998 rule->rr_action = RCTL_ACTION_UNDEFINED;
1000 error = str2value(actionstr, &rule->rr_action, actionnames);
1005 if (amountstr == NULL || amountstr[0] == '\0')
1006 rule->rr_amount = RCTL_AMOUNT_UNDEFINED;
1008 error = str2int64(amountstr, &rule->rr_amount);
1011 if (RACCT_IS_IN_MILLIONS(rule->rr_resource))
1012 rule->rr_amount *= 1000000;
1015 if (perstr == NULL || perstr[0] == '\0')
1016 rule->rr_per = RCTL_SUBJECT_TYPE_UNDEFINED;
1018 error = str2value(perstr, &rule->rr_per, subjectnames);
1027 rctl_rule_release(rule);
1033 * Link a rule with all the subjects it applies to.
1036 rctl_rule_add(struct rctl_rule *rule)
1040 struct uidinfo *uip;
1042 struct prison_racct *prr;
1043 struct loginclass *lc;
1044 struct rctl_rule *rule2;
1047 ASSERT_RACCT_ENABLED();
1048 KASSERT(rctl_rule_fully_specified(rule), ("rule not fully specified"));
1051 * Some rules just don't make sense. Note that the one below
1052 * cannot be rewritten using RACCT_IS_DENIABLE(); the RACCT_PCTCPU,
1053 * for example, is not deniable in the racct sense, but the
1054 * limit is enforced in a different way, so "deny" rules for %CPU
1057 if (rule->rr_action == RCTL_ACTION_DENY &&
1058 (rule->rr_resource == RACCT_CPU ||
1059 rule->rr_resource == RACCT_WALLCLOCK))
1060 return (EOPNOTSUPP);
1062 if (rule->rr_per == RCTL_SUBJECT_TYPE_PROCESS &&
1063 RACCT_IS_SLOPPY(rule->rr_resource))
1064 return (EOPNOTSUPP);
1067 * Make sure there are no duplicated rules. Also, for the "deny"
1068 * rules, remove ones differing only by "amount".
1070 if (rule->rr_action == RCTL_ACTION_DENY) {
1071 rule2 = rctl_rule_duplicate(rule, M_WAITOK);
1072 rule2->rr_amount = RCTL_AMOUNT_UNDEFINED;
1073 rctl_rule_remove(rule2);
1074 rctl_rule_release(rule2);
1076 rctl_rule_remove(rule);
1078 switch (rule->rr_subject_type) {
1079 case RCTL_SUBJECT_TYPE_PROCESS:
1080 p = rule->rr_subject.rs_proc;
1081 KASSERT(p != NULL, ("rctl_rule_add: NULL proc"));
1083 rctl_racct_add_rule(p->p_racct, rule);
1085 * In case of per-process rule, we don't have anything more
1090 case RCTL_SUBJECT_TYPE_USER:
1091 uip = rule->rr_subject.rs_uip;
1092 KASSERT(uip != NULL, ("rctl_rule_add: NULL uip"));
1093 rctl_racct_add_rule(uip->ui_racct, rule);
1096 case RCTL_SUBJECT_TYPE_LOGINCLASS:
1097 lc = rule->rr_subject.rs_loginclass;
1098 KASSERT(lc != NULL, ("rctl_rule_add: NULL loginclass"));
1099 rctl_racct_add_rule(lc->lc_racct, rule);
1102 case RCTL_SUBJECT_TYPE_JAIL:
1103 prr = rule->rr_subject.rs_prison_racct;
1104 KASSERT(prr != NULL, ("rctl_rule_add: NULL pr"));
1105 rctl_racct_add_rule(prr->prr_racct, rule);
1109 panic("rctl_rule_add: unknown subject type %d",
1110 rule->rr_subject_type);
1114 * Now go through all the processes and add the new rule to the ones
1117 sx_assert(&allproc_lock, SA_LOCKED);
1118 FOREACH_PROC_IN_SYSTEM(p) {
1120 switch (rule->rr_subject_type) {
1121 case RCTL_SUBJECT_TYPE_USER:
1122 if (cred->cr_uidinfo == rule->rr_subject.rs_uip ||
1123 cred->cr_ruidinfo == rule->rr_subject.rs_uip)
1126 case RCTL_SUBJECT_TYPE_LOGINCLASS:
1127 if (cred->cr_loginclass == rule->rr_subject.rs_loginclass)
1130 case RCTL_SUBJECT_TYPE_JAIL:
1132 for (pr = cred->cr_prison; pr != NULL; pr = pr->pr_parent) {
1133 if (pr->pr_prison_racct == rule->rr_subject.rs_prison_racct) {
1142 panic("rctl_rule_add: unknown subject type %d",
1143 rule->rr_subject_type);
1146 rctl_racct_add_rule(p->p_racct, rule);
1153 rctl_rule_pre_callback(void)
1156 rw_wlock(&rctl_lock);
1160 rctl_rule_post_callback(void)
1163 rw_wunlock(&rctl_lock);
1167 rctl_rule_remove_callback(struct racct *racct, void *arg2, void *arg3)
1169 struct rctl_rule *filter = (struct rctl_rule *)arg2;
1172 ASSERT_RACCT_ENABLED();
1173 rw_assert(&rctl_lock, RA_WLOCKED);
1175 found += rctl_racct_remove_rules(racct, filter);
1177 *((int *)arg3) += found;
1181 * Remove all rules that match the filter.
1184 rctl_rule_remove(struct rctl_rule *filter)
1189 ASSERT_RACCT_ENABLED();
1191 if (filter->rr_subject_type == RCTL_SUBJECT_TYPE_PROCESS &&
1192 filter->rr_subject.rs_proc != NULL) {
1193 p = filter->rr_subject.rs_proc;
1194 rw_wlock(&rctl_lock);
1195 found = rctl_racct_remove_rules(p->p_racct, filter);
1196 rw_wunlock(&rctl_lock);
1202 loginclass_racct_foreach(rctl_rule_remove_callback,
1203 rctl_rule_pre_callback, rctl_rule_post_callback,
1204 filter, (void *)&found);
1205 ui_racct_foreach(rctl_rule_remove_callback,
1206 rctl_rule_pre_callback, rctl_rule_post_callback,
1207 filter, (void *)&found);
1208 prison_racct_foreach(rctl_rule_remove_callback,
1209 rctl_rule_pre_callback, rctl_rule_post_callback,
1210 filter, (void *)&found);
1212 sx_assert(&allproc_lock, SA_LOCKED);
1213 rw_wlock(&rctl_lock);
1214 FOREACH_PROC_IN_SYSTEM(p) {
1215 found += rctl_racct_remove_rules(p->p_racct, filter);
1217 rw_wunlock(&rctl_lock);
1225 * Appends a rule to the sbuf.
1228 rctl_rule_to_sbuf(struct sbuf *sb, const struct rctl_rule *rule)
1232 ASSERT_RACCT_ENABLED();
1234 sbuf_printf(sb, "%s:", rctl_subject_type_name(rule->rr_subject_type));
1236 switch (rule->rr_subject_type) {
1237 case RCTL_SUBJECT_TYPE_PROCESS:
1238 if (rule->rr_subject.rs_proc == NULL)
1239 sbuf_printf(sb, ":");
1241 sbuf_printf(sb, "%d:",
1242 rule->rr_subject.rs_proc->p_pid);
1244 case RCTL_SUBJECT_TYPE_USER:
1245 if (rule->rr_subject.rs_uip == NULL)
1246 sbuf_printf(sb, ":");
1248 sbuf_printf(sb, "%d:",
1249 rule->rr_subject.rs_uip->ui_uid);
1251 case RCTL_SUBJECT_TYPE_LOGINCLASS:
1252 if (rule->rr_subject.rs_loginclass == NULL)
1253 sbuf_printf(sb, ":");
1255 sbuf_printf(sb, "%s:",
1256 rule->rr_subject.rs_loginclass->lc_name);
1258 case RCTL_SUBJECT_TYPE_JAIL:
1259 if (rule->rr_subject.rs_prison_racct == NULL)
1260 sbuf_printf(sb, ":");
1262 sbuf_printf(sb, "%s:",
1263 rule->rr_subject.rs_prison_racct->prr_name);
1266 panic("rctl_rule_to_sbuf: unknown subject type %d",
1267 rule->rr_subject_type);
1270 amount = rule->rr_amount;
1271 if (amount != RCTL_AMOUNT_UNDEFINED &&
1272 RACCT_IS_IN_MILLIONS(rule->rr_resource))
1275 sbuf_printf(sb, "%s:%s=%jd",
1276 rctl_resource_name(rule->rr_resource),
1277 rctl_action_name(rule->rr_action),
1280 if (rule->rr_per != rule->rr_subject_type)
1281 sbuf_printf(sb, "/%s", rctl_subject_type_name(rule->rr_per));
1285 * Routine used by RCTL syscalls to read in input string.
1288 rctl_read_inbuf(char **inputstr, const char *inbufp, size_t inbuflen)
1293 ASSERT_RACCT_ENABLED();
1297 if (inbuflen > RCTL_MAX_INBUFSIZE)
1300 str = malloc(inbuflen + 1, M_RCTL, M_WAITOK);
1301 error = copyinstr(inbufp, str, inbuflen, NULL);
1313 * Routine used by RCTL syscalls to write out output string.
1316 rctl_write_outbuf(struct sbuf *outputsbuf, char *outbufp, size_t outbuflen)
1320 ASSERT_RACCT_ENABLED();
1322 if (outputsbuf == NULL)
1325 sbuf_finish(outputsbuf);
1326 if (outbuflen < sbuf_len(outputsbuf) + 1) {
1327 sbuf_delete(outputsbuf);
1330 error = copyout(sbuf_data(outputsbuf), outbufp,
1331 sbuf_len(outputsbuf) + 1);
1332 sbuf_delete(outputsbuf);
1336 static struct sbuf *
1337 rctl_racct_to_sbuf(struct racct *racct, int sloppy)
1343 ASSERT_RACCT_ENABLED();
1345 sb = sbuf_new_auto();
1346 for (i = 0; i <= RACCT_MAX; i++) {
1347 if (sloppy == 0 && RACCT_IS_SLOPPY(i))
1349 amount = racct->r_resources[i];
1350 if (RACCT_IS_IN_MILLIONS(i))
1352 sbuf_printf(sb, "%s=%jd,", rctl_resource_name(i), amount);
1354 sbuf_setpos(sb, sbuf_len(sb) - 1);
1359 sys_rctl_get_racct(struct thread *td, struct rctl_get_racct_args *uap)
1363 struct rctl_rule *filter;
1364 struct sbuf *outputsbuf = NULL;
1366 struct uidinfo *uip;
1367 struct loginclass *lc;
1368 struct prison_racct *prr;
1373 error = priv_check(td, PRIV_RCTL_GET_RACCT);
1377 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1381 sx_slock(&allproc_lock);
1382 error = rctl_string_to_rule(inputstr, &filter);
1383 free(inputstr, M_RCTL);
1385 sx_sunlock(&allproc_lock);
1389 switch (filter->rr_subject_type) {
1390 case RCTL_SUBJECT_TYPE_PROCESS:
1391 p = filter->rr_subject.rs_proc;
1396 outputsbuf = rctl_racct_to_sbuf(p->p_racct, 0);
1398 case RCTL_SUBJECT_TYPE_USER:
1399 uip = filter->rr_subject.rs_uip;
1404 outputsbuf = rctl_racct_to_sbuf(uip->ui_racct, 1);
1406 case RCTL_SUBJECT_TYPE_LOGINCLASS:
1407 lc = filter->rr_subject.rs_loginclass;
1412 outputsbuf = rctl_racct_to_sbuf(lc->lc_racct, 1);
1414 case RCTL_SUBJECT_TYPE_JAIL:
1415 prr = filter->rr_subject.rs_prison_racct;
1420 outputsbuf = rctl_racct_to_sbuf(prr->prr_racct, 1);
1426 rctl_rule_release(filter);
1427 sx_sunlock(&allproc_lock);
1431 error = rctl_write_outbuf(outputsbuf, uap->outbufp, uap->outbuflen);
1437 rctl_get_rules_callback(struct racct *racct, void *arg2, void *arg3)
1439 struct rctl_rule *filter = (struct rctl_rule *)arg2;
1440 struct rctl_rule_link *link;
1441 struct sbuf *sb = (struct sbuf *)arg3;
1443 ASSERT_RACCT_ENABLED();
1444 rw_assert(&rctl_lock, RA_LOCKED);
1446 LIST_FOREACH(link, &racct->r_rule_links, rrl_next) {
1447 if (!rctl_rule_matches(link->rrl_rule, filter))
1449 rctl_rule_to_sbuf(sb, link->rrl_rule);
1450 sbuf_printf(sb, ",");
1455 sys_rctl_get_rules(struct thread *td, struct rctl_get_rules_args *uap)
1459 char *inputstr, *buf;
1461 struct rctl_rule *filter;
1462 struct rctl_rule_link *link;
1468 error = priv_check(td, PRIV_RCTL_GET_RULES);
1472 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1476 sx_slock(&allproc_lock);
1477 error = rctl_string_to_rule(inputstr, &filter);
1478 free(inputstr, M_RCTL);
1480 sx_sunlock(&allproc_lock);
1484 bufsize = uap->outbuflen;
1485 if (bufsize > rctl_maxbufsize) {
1486 sx_sunlock(&allproc_lock);
1490 buf = malloc(bufsize, M_RCTL, M_WAITOK);
1491 sb = sbuf_new(NULL, buf, bufsize, SBUF_FIXEDLEN);
1492 KASSERT(sb != NULL, ("sbuf_new failed"));
1494 FOREACH_PROC_IN_SYSTEM(p) {
1495 rw_rlock(&rctl_lock);
1496 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
1498 * Non-process rules will be added to the buffer later.
1499 * Adding them here would result in duplicated output.
1501 if (link->rrl_rule->rr_subject_type !=
1502 RCTL_SUBJECT_TYPE_PROCESS)
1504 if (!rctl_rule_matches(link->rrl_rule, filter))
1506 rctl_rule_to_sbuf(sb, link->rrl_rule);
1507 sbuf_printf(sb, ",");
1509 rw_runlock(&rctl_lock);
1512 loginclass_racct_foreach(rctl_get_rules_callback,
1513 rctl_rule_pre_callback, rctl_rule_post_callback,
1515 ui_racct_foreach(rctl_get_rules_callback,
1516 rctl_rule_pre_callback, rctl_rule_post_callback,
1518 prison_racct_foreach(rctl_get_rules_callback,
1519 rctl_rule_pre_callback, rctl_rule_post_callback,
1521 if (sbuf_error(sb) == ENOMEM) {
1527 * Remove trailing ",".
1529 if (sbuf_len(sb) > 0)
1530 sbuf_setpos(sb, sbuf_len(sb) - 1);
1532 error = rctl_write_outbuf(sb, uap->outbufp, uap->outbuflen);
1534 rctl_rule_release(filter);
1535 sx_sunlock(&allproc_lock);
1541 sys_rctl_get_limits(struct thread *td, struct rctl_get_limits_args *uap)
1545 char *inputstr, *buf;
1547 struct rctl_rule *filter;
1548 struct rctl_rule_link *link;
1553 error = priv_check(td, PRIV_RCTL_GET_LIMITS);
1557 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1561 sx_slock(&allproc_lock);
1562 error = rctl_string_to_rule(inputstr, &filter);
1563 free(inputstr, M_RCTL);
1565 sx_sunlock(&allproc_lock);
1569 if (filter->rr_subject_type == RCTL_SUBJECT_TYPE_UNDEFINED) {
1570 rctl_rule_release(filter);
1571 sx_sunlock(&allproc_lock);
1574 if (filter->rr_subject_type != RCTL_SUBJECT_TYPE_PROCESS) {
1575 rctl_rule_release(filter);
1576 sx_sunlock(&allproc_lock);
1577 return (EOPNOTSUPP);
1579 if (filter->rr_subject.rs_proc == NULL) {
1580 rctl_rule_release(filter);
1581 sx_sunlock(&allproc_lock);
1585 bufsize = uap->outbuflen;
1586 if (bufsize > rctl_maxbufsize) {
1587 rctl_rule_release(filter);
1588 sx_sunlock(&allproc_lock);
1592 buf = malloc(bufsize, M_RCTL, M_WAITOK);
1593 sb = sbuf_new(NULL, buf, bufsize, SBUF_FIXEDLEN);
1594 KASSERT(sb != NULL, ("sbuf_new failed"));
1596 rw_rlock(&rctl_lock);
1597 LIST_FOREACH(link, &filter->rr_subject.rs_proc->p_racct->r_rule_links,
1599 rctl_rule_to_sbuf(sb, link->rrl_rule);
1600 sbuf_printf(sb, ",");
1602 rw_runlock(&rctl_lock);
1603 if (sbuf_error(sb) == ENOMEM) {
1609 * Remove trailing ",".
1611 if (sbuf_len(sb) > 0)
1612 sbuf_setpos(sb, sbuf_len(sb) - 1);
1614 error = rctl_write_outbuf(sb, uap->outbufp, uap->outbuflen);
1616 rctl_rule_release(filter);
1617 sx_sunlock(&allproc_lock);
1623 sys_rctl_add_rule(struct thread *td, struct rctl_add_rule_args *uap)
1626 struct rctl_rule *rule;
1632 error = priv_check(td, PRIV_RCTL_ADD_RULE);
1636 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1640 sx_slock(&allproc_lock);
1641 error = rctl_string_to_rule(inputstr, &rule);
1642 free(inputstr, M_RCTL);
1644 sx_sunlock(&allproc_lock);
1648 * The 'per' part of a rule is optional.
1650 if (rule->rr_per == RCTL_SUBJECT_TYPE_UNDEFINED &&
1651 rule->rr_subject_type != RCTL_SUBJECT_TYPE_UNDEFINED)
1652 rule->rr_per = rule->rr_subject_type;
1654 if (!rctl_rule_fully_specified(rule)) {
1659 error = rctl_rule_add(rule);
1662 rctl_rule_release(rule);
1663 sx_sunlock(&allproc_lock);
1668 sys_rctl_remove_rule(struct thread *td, struct rctl_remove_rule_args *uap)
1671 struct rctl_rule *filter;
1677 error = priv_check(td, PRIV_RCTL_REMOVE_RULE);
1681 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1685 sx_slock(&allproc_lock);
1686 error = rctl_string_to_rule(inputstr, &filter);
1687 free(inputstr, M_RCTL);
1689 sx_sunlock(&allproc_lock);
1693 error = rctl_rule_remove(filter);
1694 rctl_rule_release(filter);
1695 sx_sunlock(&allproc_lock);
1701 * Update RCTL rule list after credential change.
1704 rctl_proc_ucred_changed(struct proc *p, struct ucred *newcred)
1707 struct rctl_rule_link *link, *newlink;
1708 struct uidinfo *newuip;
1709 struct loginclass *newlc;
1710 struct prison_racct *newprr;
1711 LIST_HEAD(, rctl_rule_link) newrules;
1713 ASSERT_RACCT_ENABLED();
1715 newuip = newcred->cr_ruidinfo;
1716 newlc = newcred->cr_loginclass;
1717 newprr = newcred->cr_prison->pr_prison_racct;
1719 LIST_INIT(&newrules);
1723 * First, count the rules that apply to the process with new
1727 rw_rlock(&rctl_lock);
1728 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
1729 if (link->rrl_rule->rr_subject_type ==
1730 RCTL_SUBJECT_TYPE_PROCESS)
1733 LIST_FOREACH(link, &newuip->ui_racct->r_rule_links, rrl_next)
1735 LIST_FOREACH(link, &newlc->lc_racct->r_rule_links, rrl_next)
1737 LIST_FOREACH(link, &newprr->prr_racct->r_rule_links, rrl_next)
1739 rw_runlock(&rctl_lock);
1742 * Create temporary list. We've dropped the rctl_lock in order
1745 for (i = 0; i < rulecnt; i++) {
1746 newlink = uma_zalloc(rctl_rule_link_zone, M_WAITOK);
1747 newlink->rrl_rule = NULL;
1748 LIST_INSERT_HEAD(&newrules, newlink, rrl_next);
1751 newlink = LIST_FIRST(&newrules);
1754 * Assign rules to the newly allocated list entries.
1756 rw_wlock(&rctl_lock);
1757 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
1758 if (link->rrl_rule->rr_subject_type ==
1759 RCTL_SUBJECT_TYPE_PROCESS) {
1760 if (newlink == NULL)
1762 rctl_rule_acquire(link->rrl_rule);
1763 newlink->rrl_rule = link->rrl_rule;
1764 newlink = LIST_NEXT(newlink, rrl_next);
1769 LIST_FOREACH(link, &newuip->ui_racct->r_rule_links, rrl_next) {
1770 if (newlink == NULL)
1772 rctl_rule_acquire(link->rrl_rule);
1773 newlink->rrl_rule = link->rrl_rule;
1774 newlink = LIST_NEXT(newlink, rrl_next);
1778 LIST_FOREACH(link, &newlc->lc_racct->r_rule_links, rrl_next) {
1779 if (newlink == NULL)
1781 rctl_rule_acquire(link->rrl_rule);
1782 newlink->rrl_rule = link->rrl_rule;
1783 newlink = LIST_NEXT(newlink, rrl_next);
1787 LIST_FOREACH(link, &newprr->prr_racct->r_rule_links, rrl_next) {
1788 if (newlink == NULL)
1790 rctl_rule_acquire(link->rrl_rule);
1791 newlink->rrl_rule = link->rrl_rule;
1792 newlink = LIST_NEXT(newlink, rrl_next);
1798 * Free the old rule list.
1800 while (!LIST_EMPTY(&p->p_racct->r_rule_links)) {
1801 link = LIST_FIRST(&p->p_racct->r_rule_links);
1802 LIST_REMOVE(link, rrl_next);
1803 rctl_rule_release(link->rrl_rule);
1804 uma_zfree(rctl_rule_link_zone, link);
1808 * Replace lists and we're done.
1810 * XXX: Is there any way to switch list heads instead
1811 * of iterating here?
1813 while (!LIST_EMPTY(&newrules)) {
1814 newlink = LIST_FIRST(&newrules);
1815 LIST_REMOVE(newlink, rrl_next);
1816 LIST_INSERT_HEAD(&p->p_racct->r_rule_links,
1820 rw_wunlock(&rctl_lock);
1826 rw_wunlock(&rctl_lock);
1829 * Rule list changed while we were not holding the rctl_lock.
1830 * Free the new list and try again.
1832 while (!LIST_EMPTY(&newrules)) {
1833 newlink = LIST_FIRST(&newrules);
1834 LIST_REMOVE(newlink, rrl_next);
1835 if (newlink->rrl_rule != NULL)
1836 rctl_rule_release(newlink->rrl_rule);
1837 uma_zfree(rctl_rule_link_zone, newlink);
1844 * Assign RCTL rules to the newly created process.
1847 rctl_proc_fork(struct proc *parent, struct proc *child)
1850 struct rctl_rule_link *link;
1851 struct rctl_rule *rule;
1853 LIST_INIT(&child->p_racct->r_rule_links);
1855 ASSERT_RACCT_ENABLED();
1856 KASSERT(parent->p_racct != NULL, ("process without racct; p = %p", parent));
1858 rw_wlock(&rctl_lock);
1861 * Go through limits applicable to the parent and assign them
1862 * to the child. Rules with 'process' subject have to be duplicated
1863 * in order to make their rr_subject point to the new process.
1865 LIST_FOREACH(link, &parent->p_racct->r_rule_links, rrl_next) {
1866 if (link->rrl_rule->rr_subject_type ==
1867 RCTL_SUBJECT_TYPE_PROCESS) {
1868 rule = rctl_rule_duplicate(link->rrl_rule, M_NOWAIT);
1871 KASSERT(rule->rr_subject.rs_proc == parent,
1872 ("rule->rr_subject.rs_proc != parent"));
1873 rule->rr_subject.rs_proc = child;
1874 error = rctl_racct_add_rule_locked(child->p_racct,
1876 rctl_rule_release(rule);
1880 error = rctl_racct_add_rule_locked(child->p_racct,
1887 rw_wunlock(&rctl_lock);
1891 while (!LIST_EMPTY(&child->p_racct->r_rule_links)) {
1892 link = LIST_FIRST(&child->p_racct->r_rule_links);
1893 LIST_REMOVE(link, rrl_next);
1894 rctl_rule_release(link->rrl_rule);
1895 uma_zfree(rctl_rule_link_zone, link);
1897 rw_wunlock(&rctl_lock);
1902 * Release rules attached to the racct.
1905 rctl_racct_release(struct racct *racct)
1907 struct rctl_rule_link *link;
1909 ASSERT_RACCT_ENABLED();
1911 rw_wlock(&rctl_lock);
1912 while (!LIST_EMPTY(&racct->r_rule_links)) {
1913 link = LIST_FIRST(&racct->r_rule_links);
1914 LIST_REMOVE(link, rrl_next);
1915 rctl_rule_release(link->rrl_rule);
1916 uma_zfree(rctl_rule_link_zone, link);
1918 rw_wunlock(&rctl_lock);
1928 rctl_rule_link_zone = uma_zcreate("rctl_rule_link",
1929 sizeof(struct rctl_rule_link), NULL, NULL, NULL, NULL,
1930 UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
1931 rctl_rule_zone = uma_zcreate("rctl_rule", sizeof(struct rctl_rule),
1932 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
1938 sys_rctl_get_racct(struct thread *td, struct rctl_get_racct_args *uap)
1945 sys_rctl_get_rules(struct thread *td, struct rctl_get_rules_args *uap)
1952 sys_rctl_get_limits(struct thread *td, struct rctl_get_limits_args *uap)
1959 sys_rctl_add_rule(struct thread *td, struct rctl_add_rule_args *uap)
1966 sys_rctl_remove_rule(struct thread *td, struct rctl_remove_rule_args *uap)