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 /* Default buffer size for rctl_get_rules(2). */
75 #define RCTL_DEFAULT_BUFSIZE 4096
76 #define RCTL_LOG_BUFSIZE 128
79 * 'rctl_rule_link' connects a rule with every racct it's related to.
80 * For example, rule 'user:X:openfiles:deny=N/process' is linked
81 * with uidinfo for user X, and to each process of that user.
83 struct rctl_rule_link {
84 LIST_ENTRY(rctl_rule_link) rrl_next;
85 struct rctl_rule *rrl_rule;
94 static struct dict subjectnames[] = {
95 { "process", RCTL_SUBJECT_TYPE_PROCESS },
96 { "user", RCTL_SUBJECT_TYPE_USER },
97 { "loginclass", RCTL_SUBJECT_TYPE_LOGINCLASS },
98 { "jail", RCTL_SUBJECT_TYPE_JAIL },
101 static struct dict resourcenames[] = {
102 { "cpu", RACCT_CPU },
103 { "data", RACCT_DATA },
104 { "stack", RACCT_STACK },
105 { "core", RACCT_CORE },
106 { "rss", RACCT_RSS },
107 { "memlock", RACCT_MEMLOCK },
108 { "nproc", RACCT_NPROC },
109 { "nofile", RACCT_NOFILE },
110 { "vmem", RACCT_VMEM },
111 { "npts", RACCT_NPTS },
112 { "swap", RACCT_SWAP },
113 { "nthr", RACCT_NTHR },
114 { "msgqqueued", RACCT_MSGQQUEUED },
115 { "msgqsize", RACCT_MSGQSIZE },
116 { "nmsgq", RACCT_NMSGQ },
117 { "nsem", RACCT_NSEM },
118 { "nsemop", RACCT_NSEMOP },
119 { "nshm", RACCT_NSHM },
120 { "shmsize", RACCT_SHMSIZE },
121 { "wallclock", RACCT_WALLCLOCK },
124 static struct dict actionnames[] = {
125 { "sighup", RCTL_ACTION_SIGHUP },
126 { "sigint", RCTL_ACTION_SIGINT },
127 { "sigquit", RCTL_ACTION_SIGQUIT },
128 { "sigill", RCTL_ACTION_SIGILL },
129 { "sigtrap", RCTL_ACTION_SIGTRAP },
130 { "sigabrt", RCTL_ACTION_SIGABRT },
131 { "sigemt", RCTL_ACTION_SIGEMT },
132 { "sigfpe", RCTL_ACTION_SIGFPE },
133 { "sigkill", RCTL_ACTION_SIGKILL },
134 { "sigbus", RCTL_ACTION_SIGBUS },
135 { "sigsegv", RCTL_ACTION_SIGSEGV },
136 { "sigsys", RCTL_ACTION_SIGSYS },
137 { "sigpipe", RCTL_ACTION_SIGPIPE },
138 { "sigalrm", RCTL_ACTION_SIGALRM },
139 { "sigterm", RCTL_ACTION_SIGTERM },
140 { "sigurg", RCTL_ACTION_SIGURG },
141 { "sigstop", RCTL_ACTION_SIGSTOP },
142 { "sigtstp", RCTL_ACTION_SIGTSTP },
143 { "sigchld", RCTL_ACTION_SIGCHLD },
144 { "sigttin", RCTL_ACTION_SIGTTIN },
145 { "sigttou", RCTL_ACTION_SIGTTOU },
146 { "sigio", RCTL_ACTION_SIGIO },
147 { "sigxcpu", RCTL_ACTION_SIGXCPU },
148 { "sigxfsz", RCTL_ACTION_SIGXFSZ },
149 { "sigvtalrm", RCTL_ACTION_SIGVTALRM },
150 { "sigprof", RCTL_ACTION_SIGPROF },
151 { "sigwinch", RCTL_ACTION_SIGWINCH },
152 { "siginfo", RCTL_ACTION_SIGINFO },
153 { "sigusr1", RCTL_ACTION_SIGUSR1 },
154 { "sigusr2", RCTL_ACTION_SIGUSR2 },
155 { "sigthr", RCTL_ACTION_SIGTHR },
156 { "deny", RCTL_ACTION_DENY },
157 { "log", RCTL_ACTION_LOG },
158 { "devctl", RCTL_ACTION_DEVCTL },
161 static void rctl_init(void);
162 SYSINIT(rctl, SI_SUB_RACCT, SI_ORDER_FIRST, rctl_init, NULL);
164 static uma_zone_t rctl_rule_link_zone;
165 static uma_zone_t rctl_rule_zone;
166 static struct rwlock rctl_lock;
167 RW_SYSINIT(rctl_lock, &rctl_lock, "RCTL lock");
169 static int rctl_rule_fully_specified(const struct rctl_rule *rule);
170 static void rctl_rule_to_sbuf(struct sbuf *sb, const struct rctl_rule *rule);
172 MALLOC_DEFINE(M_RCTL, "rctl", "Resource Limits");
175 rctl_subject_type_name(int subject)
179 for (i = 0; subjectnames[i].d_name != NULL; i++) {
180 if (subjectnames[i].d_value == subject)
181 return (subjectnames[i].d_name);
184 panic("rctl_subject_type_name: unknown subject type %d", subject);
188 rctl_action_name(int action)
192 for (i = 0; actionnames[i].d_name != NULL; i++) {
193 if (actionnames[i].d_value == action)
194 return (actionnames[i].d_name);
197 panic("rctl_action_name: unknown action %d", action);
201 rctl_resource_name(int resource)
205 for (i = 0; resourcenames[i].d_name != NULL; i++) {
206 if (resourcenames[i].d_value == resource)
207 return (resourcenames[i].d_name);
210 panic("rctl_resource_name: unknown resource %d", resource);
214 * Return the amount of resource that can be allocated by 'p' before
218 rctl_available_resource(const struct proc *p, const struct rctl_rule *rule)
221 int64_t available = INT64_MAX;
222 struct ucred *cred = p->p_ucred;
224 rw_assert(&rctl_lock, RA_LOCKED);
226 resource = rule->rr_resource;
227 switch (rule->rr_per) {
228 case RCTL_SUBJECT_TYPE_PROCESS:
229 available = rule->rr_amount -
230 p->p_racct->r_resources[resource];
232 case RCTL_SUBJECT_TYPE_USER:
233 available = rule->rr_amount -
234 cred->cr_ruidinfo->ui_racct->r_resources[resource];
236 case RCTL_SUBJECT_TYPE_LOGINCLASS:
237 available = rule->rr_amount -
238 cred->cr_loginclass->lc_racct->r_resources[resource];
240 case RCTL_SUBJECT_TYPE_JAIL:
241 available = rule->rr_amount -
242 cred->cr_prison->pr_prison_racct->prr_racct->
243 r_resources[resource];
246 panic("rctl_compute_available: unknown per %d",
254 * Return non-zero if allocating 'amount' by proc 'p' would exceed
255 * resource limit specified by 'rule'.
258 rctl_would_exceed(const struct proc *p, const struct rctl_rule *rule,
263 rw_assert(&rctl_lock, RA_LOCKED);
265 available = rctl_available_resource(p, rule);
266 if (available >= amount)
273 * Check whether the proc 'p' can allocate 'amount' of 'resource' in addition
274 * to what it keeps allocated now. Returns non-zero if the allocation should
275 * be denied, 0 otherwise.
278 rctl_enforce(struct proc *p, int resource, uint64_t amount)
280 struct rctl_rule *rule;
281 struct rctl_rule_link *link;
285 static int curtime = 0;
286 static struct timeval lasttime;
288 rw_rlock(&rctl_lock);
291 * There may be more than one matching rule; go through all of them.
292 * Denial should be done last, after logging and sending signals.
294 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
295 rule = link->rrl_rule;
296 if (rule->rr_resource != resource)
298 if (!rctl_would_exceed(p, rule, amount)) {
299 link->rrl_exceeded = 0;
303 switch (rule->rr_action) {
304 case RCTL_ACTION_DENY:
307 case RCTL_ACTION_LOG:
309 * If rrl_exceeded != 0, it means we've already
310 * logged a warning for this process.
312 if (link->rrl_exceeded != 0)
315 if (!ppsratecheck(&lasttime, &curtime, 10))
318 buf = malloc(RCTL_LOG_BUFSIZE, M_RCTL, M_NOWAIT);
320 printf("rctl_enforce: out of memory\n");
323 sbuf_new(&sb, buf, RCTL_LOG_BUFSIZE, SBUF_FIXEDLEN);
324 rctl_rule_to_sbuf(&sb, rule);
326 printf("rctl: rule \"%s\" matched by pid %d "
327 "(%s), uid %d, jail %s\n", sbuf_data(&sb),
328 p->p_pid, p->p_comm, p->p_ucred->cr_uid,
329 p->p_ucred->cr_prison->pr_prison_racct->prr_name);
332 link->rrl_exceeded = 1;
334 case RCTL_ACTION_DEVCTL:
335 if (link->rrl_exceeded != 0)
338 buf = malloc(RCTL_LOG_BUFSIZE, M_RCTL, M_NOWAIT);
340 printf("rctl_enforce: out of memory\n");
343 sbuf_new(&sb, buf, RCTL_LOG_BUFSIZE, SBUF_FIXEDLEN);
344 sbuf_printf(&sb, "rule=");
345 rctl_rule_to_sbuf(&sb, rule);
346 sbuf_printf(&sb, " pid=%d ruid=%d jail=%s",
347 p->p_pid, p->p_ucred->cr_ruid,
348 p->p_ucred->cr_prison->pr_prison_racct->prr_name);
350 devctl_notify_f("RCTL", "rule", "matched",
351 sbuf_data(&sb), M_NOWAIT);
354 link->rrl_exceeded = 1;
357 if (link->rrl_exceeded != 0)
360 KASSERT(rule->rr_action > 0 &&
361 rule->rr_action <= RCTL_ACTION_SIGNAL_MAX,
362 ("rctl_enforce: unknown action %d",
366 * We're using the fact that RCTL_ACTION_SIG* values
367 * are equal to their counterparts from sys/signal.h.
369 psignal(p, rule->rr_action);
370 link->rrl_exceeded = 1;
375 rw_runlock(&rctl_lock);
379 * Return fake error code; the caller should change it
380 * into one proper for the situation - EFSIZ, ENOMEM etc.
389 rctl_get_limit(struct proc *p, int resource)
391 struct rctl_rule *rule;
392 struct rctl_rule_link *link;
393 uint64_t amount = UINT64_MAX;
395 rw_rlock(&rctl_lock);
398 * There may be more than one matching rule; go through all of them.
399 * Denial should be done last, after logging and sending signals.
401 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
402 rule = link->rrl_rule;
403 if (rule->rr_resource != resource)
405 if (rule->rr_action != RCTL_ACTION_DENY)
407 if (rule->rr_amount < amount)
408 amount = rule->rr_amount;
411 rw_runlock(&rctl_lock);
417 rctl_get_available(struct proc *p, int resource)
419 struct rctl_rule *rule;
420 struct rctl_rule_link *link;
421 int64_t available, minavailable, allocated;
423 minavailable = INT64_MAX;
425 rw_rlock(&rctl_lock);
428 * There may be more than one matching rule; go through all of them.
429 * Denial should be done last, after logging and sending signals.
431 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
432 rule = link->rrl_rule;
433 if (rule->rr_resource != resource)
435 if (rule->rr_action != RCTL_ACTION_DENY)
437 available = rctl_available_resource(p, rule);
438 if (available < minavailable)
439 minavailable = available;
442 rw_runlock(&rctl_lock);
445 * XXX: Think about this _hard_.
447 allocated = p->p_racct->r_resources[resource];
448 if (minavailable < INT64_MAX - allocated)
449 minavailable += allocated;
450 if (minavailable < 0)
452 return (minavailable);
456 rctl_rule_matches(const struct rctl_rule *rule, const struct rctl_rule *filter)
459 if (filter->rr_subject_type != RCTL_SUBJECT_TYPE_UNDEFINED) {
460 if (rule->rr_subject_type != filter->rr_subject_type)
463 switch (filter->rr_subject_type) {
464 case RCTL_SUBJECT_TYPE_PROCESS:
465 if (filter->rr_subject.rs_proc != NULL &&
466 rule->rr_subject.rs_proc !=
467 filter->rr_subject.rs_proc)
470 case RCTL_SUBJECT_TYPE_USER:
471 if (filter->rr_subject.rs_uip != NULL &&
472 rule->rr_subject.rs_uip !=
473 filter->rr_subject.rs_uip)
476 case RCTL_SUBJECT_TYPE_LOGINCLASS:
477 if (filter->rr_subject.rs_loginclass != NULL &&
478 rule->rr_subject.rs_loginclass !=
479 filter->rr_subject.rs_loginclass)
482 case RCTL_SUBJECT_TYPE_JAIL:
483 if (filter->rr_subject.rs_prison_racct != NULL &&
484 rule->rr_subject.rs_prison_racct !=
485 filter->rr_subject.rs_prison_racct)
489 panic("rctl_rule_matches: unknown subject type %d",
490 filter->rr_subject_type);
494 if (filter->rr_resource != RACCT_UNDEFINED) {
495 if (rule->rr_resource != filter->rr_resource)
499 if (filter->rr_action != RCTL_ACTION_UNDEFINED) {
500 if (rule->rr_action != filter->rr_action)
504 if (filter->rr_amount != RCTL_AMOUNT_UNDEFINED) {
505 if (rule->rr_amount != filter->rr_amount)
509 if (filter->rr_per != RCTL_SUBJECT_TYPE_UNDEFINED) {
510 if (rule->rr_per != filter->rr_per)
518 str2value(const char *str, int *value, struct dict *table)
525 for (i = 0; table[i].d_name != NULL; i++) {
526 if (strcasecmp(table[i].d_name, str) == 0) {
527 *value = table[i].d_value;
536 str2id(const char *str, id_t *value)
543 *value = strtoul(str, &end, 10);
544 if ((size_t)(end - str) != strlen(str))
551 str2int64(const char *str, int64_t *value)
558 *value = strtoul(str, &end, 10);
559 if ((size_t)(end - str) != strlen(str))
566 * Connect the rule to the racct, increasing refcount for the rule.
569 rctl_racct_add_rule(struct racct *racct, struct rctl_rule *rule)
571 struct rctl_rule_link *link;
573 KASSERT(rctl_rule_fully_specified(rule), ("rule not fully specified"));
575 rctl_rule_acquire(rule);
576 link = uma_zalloc(rctl_rule_link_zone, M_WAITOK);
577 link->rrl_rule = rule;
578 link->rrl_exceeded = 0;
580 rw_wlock(&rctl_lock);
581 LIST_INSERT_HEAD(&racct->r_rule_links, link, rrl_next);
582 rw_wunlock(&rctl_lock);
586 rctl_racct_add_rule_locked(struct racct *racct, struct rctl_rule *rule)
588 struct rctl_rule_link *link;
590 KASSERT(rctl_rule_fully_specified(rule), ("rule not fully specified"));
591 rw_assert(&rctl_lock, RA_WLOCKED);
593 link = uma_zalloc(rctl_rule_link_zone, M_NOWAIT);
596 rctl_rule_acquire(rule);
597 link->rrl_rule = rule;
598 link->rrl_exceeded = 0;
600 LIST_INSERT_HEAD(&racct->r_rule_links, link, rrl_next);
605 * Remove limits for a rules matching the filter and release
606 * the refcounts for the rules, possibly freeing them. Returns
607 * the number of limit structures removed.
610 rctl_racct_remove_rules(struct racct *racct,
611 const struct rctl_rule *filter)
614 struct rctl_rule_link *link, *linktmp;
616 rw_assert(&rctl_lock, RA_WLOCKED);
618 LIST_FOREACH_SAFE(link, &racct->r_rule_links, rrl_next, linktmp) {
619 if (!rctl_rule_matches(link->rrl_rule, filter))
622 LIST_REMOVE(link, rrl_next);
623 rctl_rule_release(link->rrl_rule);
624 uma_zfree(rctl_rule_link_zone, link);
631 rctl_rule_acquire_subject(struct rctl_rule *rule)
634 switch (rule->rr_subject_type) {
635 case RCTL_SUBJECT_TYPE_UNDEFINED:
636 case RCTL_SUBJECT_TYPE_PROCESS:
638 case RCTL_SUBJECT_TYPE_JAIL:
639 if (rule->rr_subject.rs_prison_racct != NULL)
640 prison_racct_hold(rule->rr_subject.rs_prison_racct);
642 case RCTL_SUBJECT_TYPE_USER:
643 if (rule->rr_subject.rs_uip != NULL)
644 uihold(rule->rr_subject.rs_uip);
646 case RCTL_SUBJECT_TYPE_LOGINCLASS:
647 if (rule->rr_subject.rs_loginclass != NULL)
648 loginclass_hold(rule->rr_subject.rs_loginclass);
651 panic("rctl_rule_acquire_subject: unknown subject type %d",
652 rule->rr_subject_type);
657 rctl_rule_release_subject(struct rctl_rule *rule)
660 switch (rule->rr_subject_type) {
661 case RCTL_SUBJECT_TYPE_UNDEFINED:
662 case RCTL_SUBJECT_TYPE_PROCESS:
664 case RCTL_SUBJECT_TYPE_JAIL:
665 if (rule->rr_subject.rs_prison_racct != NULL)
666 prison_racct_free(rule->rr_subject.rs_prison_racct);
668 case RCTL_SUBJECT_TYPE_USER:
669 if (rule->rr_subject.rs_uip != NULL)
670 uifree(rule->rr_subject.rs_uip);
672 case RCTL_SUBJECT_TYPE_LOGINCLASS:
673 if (rule->rr_subject.rs_loginclass != NULL)
674 loginclass_free(rule->rr_subject.rs_loginclass);
677 panic("rctl_rule_release_subject: unknown subject type %d",
678 rule->rr_subject_type);
683 rctl_rule_alloc(int flags)
685 struct rctl_rule *rule;
687 rule = uma_zalloc(rctl_rule_zone, flags);
690 rule->rr_subject_type = RCTL_SUBJECT_TYPE_UNDEFINED;
691 rule->rr_subject.rs_proc = NULL;
692 rule->rr_subject.rs_uip = NULL;
693 rule->rr_subject.rs_loginclass = NULL;
694 rule->rr_subject.rs_prison_racct = NULL;
695 rule->rr_per = RCTL_SUBJECT_TYPE_UNDEFINED;
696 rule->rr_resource = RACCT_UNDEFINED;
697 rule->rr_action = RCTL_ACTION_UNDEFINED;
698 rule->rr_amount = RCTL_AMOUNT_UNDEFINED;
699 refcount_init(&rule->rr_refcount, 1);
705 rctl_rule_duplicate(const struct rctl_rule *rule, int flags)
707 struct rctl_rule *copy;
709 copy = uma_zalloc(rctl_rule_zone, flags);
712 copy->rr_subject_type = rule->rr_subject_type;
713 copy->rr_subject.rs_proc = rule->rr_subject.rs_proc;
714 copy->rr_subject.rs_uip = rule->rr_subject.rs_uip;
715 copy->rr_subject.rs_loginclass = rule->rr_subject.rs_loginclass;
716 copy->rr_subject.rs_prison_racct = rule->rr_subject.rs_prison_racct;
717 copy->rr_per = rule->rr_per;
718 copy->rr_resource = rule->rr_resource;
719 copy->rr_action = rule->rr_action;
720 copy->rr_amount = rule->rr_amount;
721 refcount_init(©->rr_refcount, 1);
722 rctl_rule_acquire_subject(copy);
728 rctl_rule_acquire(struct rctl_rule *rule)
731 KASSERT(rule->rr_refcount > 0, ("rule->rr_refcount <= 0"));
733 refcount_acquire(&rule->rr_refcount);
737 rctl_rule_free(void *context, int pending)
739 struct rctl_rule *rule;
741 rule = (struct rctl_rule *)context;
743 KASSERT(rule->rr_refcount == 0, ("rule->rr_refcount != 0"));
746 * We don't need locking here; rule is guaranteed to be inaccessible.
749 rctl_rule_release_subject(rule);
750 uma_zfree(rctl_rule_zone, rule);
754 rctl_rule_release(struct rctl_rule *rule)
757 KASSERT(rule->rr_refcount > 0, ("rule->rr_refcount <= 0"));
759 if (refcount_release(&rule->rr_refcount)) {
761 * rctl_rule_release() is often called when iterating
762 * over all the uidinfo structures in the system,
763 * holding uihashtbl_lock. Since rctl_rule_free()
764 * might end up calling uifree(), this would lead
765 * to lock recursion. Use taskqueue to avoid this.
767 TASK_INIT(&rule->rr_task, 0, rctl_rule_free, rule);
768 taskqueue_enqueue(taskqueue_thread, &rule->rr_task);
773 rctl_rule_fully_specified(const struct rctl_rule *rule)
776 switch (rule->rr_subject_type) {
777 case RCTL_SUBJECT_TYPE_UNDEFINED:
779 case RCTL_SUBJECT_TYPE_PROCESS:
780 if (rule->rr_subject.rs_proc == NULL)
783 case RCTL_SUBJECT_TYPE_USER:
784 if (rule->rr_subject.rs_uip == NULL)
787 case RCTL_SUBJECT_TYPE_LOGINCLASS:
788 if (rule->rr_subject.rs_loginclass == NULL)
791 case RCTL_SUBJECT_TYPE_JAIL:
792 if (rule->rr_subject.rs_prison_racct == NULL)
796 panic("rctl_rule_fully_specified: unknown subject type %d",
797 rule->rr_subject_type);
799 if (rule->rr_resource == RACCT_UNDEFINED)
801 if (rule->rr_action == RCTL_ACTION_UNDEFINED)
803 if (rule->rr_amount == RCTL_AMOUNT_UNDEFINED)
805 if (rule->rr_per == RCTL_SUBJECT_TYPE_UNDEFINED)
812 rctl_string_to_rule(char *rulestr, struct rctl_rule **rulep)
815 char *subjectstr, *subject_idstr, *resourcestr, *actionstr,
817 struct rctl_rule *rule;
820 rule = rctl_rule_alloc(M_WAITOK);
822 subjectstr = strsep(&rulestr, ":");
823 subject_idstr = strsep(&rulestr, ":");
824 resourcestr = strsep(&rulestr, ":");
825 actionstr = strsep(&rulestr, "=/");
826 amountstr = strsep(&rulestr, "/");
829 if (subjectstr == NULL || subjectstr[0] == '\0')
830 rule->rr_subject_type = RCTL_SUBJECT_TYPE_UNDEFINED;
832 error = str2value(subjectstr, &rule->rr_subject_type, subjectnames);
837 if (subject_idstr == NULL || subject_idstr[0] == '\0') {
838 rule->rr_subject.rs_proc = NULL;
839 rule->rr_subject.rs_uip = NULL;
840 rule->rr_subject.rs_loginclass = NULL;
841 rule->rr_subject.rs_prison_racct = NULL;
843 switch (rule->rr_subject_type) {
844 case RCTL_SUBJECT_TYPE_UNDEFINED:
847 case RCTL_SUBJECT_TYPE_PROCESS:
848 error = str2id(subject_idstr, &id);
851 sx_assert(&allproc_lock, SA_LOCKED);
852 rule->rr_subject.rs_proc = pfind(id);
853 if (rule->rr_subject.rs_proc == NULL) {
857 PROC_UNLOCK(rule->rr_subject.rs_proc);
859 case RCTL_SUBJECT_TYPE_USER:
860 error = str2id(subject_idstr, &id);
863 rule->rr_subject.rs_uip = uifind(id);
865 case RCTL_SUBJECT_TYPE_LOGINCLASS:
866 rule->rr_subject.rs_loginclass =
867 loginclass_find(subject_idstr);
868 if (rule->rr_subject.rs_loginclass == NULL) {
869 error = ENAMETOOLONG;
873 case RCTL_SUBJECT_TYPE_JAIL:
874 rule->rr_subject.rs_prison_racct =
875 prison_racct_find(subject_idstr);
876 if (rule->rr_subject.rs_prison_racct == NULL) {
877 error = ENAMETOOLONG;
882 panic("rctl_string_to_rule: unknown subject type %d",
883 rule->rr_subject_type);
887 if (resourcestr == NULL || resourcestr[0] == '\0')
888 rule->rr_resource = RACCT_UNDEFINED;
890 error = str2value(resourcestr, &rule->rr_resource,
896 if (actionstr == NULL || actionstr[0] == '\0')
897 rule->rr_action = RCTL_ACTION_UNDEFINED;
899 error = str2value(actionstr, &rule->rr_action, actionnames);
904 if (amountstr == NULL || amountstr[0] == '\0')
905 rule->rr_amount = RCTL_AMOUNT_UNDEFINED;
907 error = str2int64(amountstr, &rule->rr_amount);
910 if (racct_is_in_thousands(rule->rr_resource))
911 rule->rr_amount *= 1000;
914 if (perstr == NULL || perstr[0] == '\0')
915 rule->rr_per = RCTL_SUBJECT_TYPE_UNDEFINED;
917 error = str2value(perstr, &rule->rr_per, subjectnames);
926 rctl_rule_release(rule);
932 * Link a rule with all the subjects it applies to.
935 rctl_rule_add(struct rctl_rule *rule)
941 struct prison_racct *prr;
942 struct loginclass *lc;
943 struct rctl_rule *rule2;
946 KASSERT(rctl_rule_fully_specified(rule), ("rule not fully specified"));
949 * Some rules just don't make sense. Note that the one below
950 * cannot be rewritten using racct_is_deniable(); the RACCT_PCTCPU,
951 * for example, is not deniable in the racct sense, but the
952 * limit is enforced in a different way, so "deny" rules for %CPU
955 if (rule->rr_action == RCTL_ACTION_DENY &&
956 (rule->rr_resource == RACCT_CPU ||
957 rule->rr_resource == RACCT_WALLCLOCK))
960 if (rule->rr_per == RCTL_SUBJECT_TYPE_PROCESS &&
961 racct_is_sloppy(rule->rr_resource))
965 * Make sure there are no duplicated rules. Also, for the "deny"
966 * rules, remove ones differing only by "amount".
968 if (rule->rr_action == RCTL_ACTION_DENY) {
969 rule2 = rctl_rule_duplicate(rule, M_WAITOK);
970 rule2->rr_amount = RCTL_AMOUNT_UNDEFINED;
971 rctl_rule_remove(rule2);
972 rctl_rule_release(rule2);
974 rctl_rule_remove(rule);
976 switch (rule->rr_subject_type) {
977 case RCTL_SUBJECT_TYPE_PROCESS:
978 p = rule->rr_subject.rs_proc;
979 KASSERT(p != NULL, ("rctl_rule_add: NULL proc"));
981 * No resource limits for system processes.
983 if (p->p_flag & P_SYSTEM)
986 rctl_racct_add_rule(p->p_racct, rule);
988 * In case of per-process rule, we don't have anything more
993 case RCTL_SUBJECT_TYPE_USER:
994 uip = rule->rr_subject.rs_uip;
995 KASSERT(uip != NULL, ("rctl_rule_add: NULL uip"));
996 rctl_racct_add_rule(uip->ui_racct, rule);
999 case RCTL_SUBJECT_TYPE_LOGINCLASS:
1000 lc = rule->rr_subject.rs_loginclass;
1001 KASSERT(lc != NULL, ("rctl_rule_add: NULL loginclass"));
1002 rctl_racct_add_rule(lc->lc_racct, rule);
1005 case RCTL_SUBJECT_TYPE_JAIL:
1006 prr = rule->rr_subject.rs_prison_racct;
1007 KASSERT(prr != NULL, ("rctl_rule_add: NULL pr"));
1008 rctl_racct_add_rule(prr->prr_racct, rule);
1012 panic("rctl_rule_add: unknown subject type %d",
1013 rule->rr_subject_type);
1017 * Now go through all the processes and add the new rule to the ones
1020 sx_assert(&allproc_lock, SA_LOCKED);
1021 FOREACH_PROC_IN_SYSTEM(p) {
1022 if (p->p_flag & P_SYSTEM)
1025 switch (rule->rr_subject_type) {
1026 case RCTL_SUBJECT_TYPE_USER:
1027 if (cred->cr_uidinfo == rule->rr_subject.rs_uip ||
1028 cred->cr_ruidinfo == rule->rr_subject.rs_uip)
1031 case RCTL_SUBJECT_TYPE_LOGINCLASS:
1032 if (cred->cr_loginclass == rule->rr_subject.rs_loginclass)
1035 case RCTL_SUBJECT_TYPE_JAIL:
1037 for (pr = cred->cr_prison; pr != NULL; pr = pr->pr_parent) {
1038 if (pr->pr_prison_racct == rule->rr_subject.rs_prison_racct) {
1047 panic("rctl_rule_add: unknown subject type %d",
1048 rule->rr_subject_type);
1051 rctl_racct_add_rule(p->p_racct, rule);
1058 rctl_rule_remove_callback(struct racct *racct, void *arg2, void *arg3)
1060 struct rctl_rule *filter = (struct rctl_rule *)arg2;
1063 rw_wlock(&rctl_lock);
1064 found += rctl_racct_remove_rules(racct, filter);
1065 rw_wunlock(&rctl_lock);
1067 *((int *)arg3) += found;
1071 * Remove all rules that match the filter.
1074 rctl_rule_remove(struct rctl_rule *filter)
1079 if (filter->rr_subject_type == RCTL_SUBJECT_TYPE_PROCESS &&
1080 filter->rr_subject.rs_proc != NULL) {
1081 p = filter->rr_subject.rs_proc;
1082 rw_wlock(&rctl_lock);
1083 found = rctl_racct_remove_rules(p->p_racct, filter);
1084 rw_wunlock(&rctl_lock);
1090 loginclass_racct_foreach(rctl_rule_remove_callback, filter,
1092 ui_racct_foreach(rctl_rule_remove_callback, filter,
1094 prison_racct_foreach(rctl_rule_remove_callback, filter,
1097 sx_assert(&allproc_lock, SA_LOCKED);
1098 rw_wlock(&rctl_lock);
1099 FOREACH_PROC_IN_SYSTEM(p) {
1100 found += rctl_racct_remove_rules(p->p_racct, filter);
1102 rw_wunlock(&rctl_lock);
1110 * Appends a rule to the sbuf.
1113 rctl_rule_to_sbuf(struct sbuf *sb, const struct rctl_rule *rule)
1117 sbuf_printf(sb, "%s:", rctl_subject_type_name(rule->rr_subject_type));
1119 switch (rule->rr_subject_type) {
1120 case RCTL_SUBJECT_TYPE_PROCESS:
1121 if (rule->rr_subject.rs_proc == NULL)
1122 sbuf_printf(sb, ":");
1124 sbuf_printf(sb, "%d:",
1125 rule->rr_subject.rs_proc->p_pid);
1127 case RCTL_SUBJECT_TYPE_USER:
1128 if (rule->rr_subject.rs_uip == NULL)
1129 sbuf_printf(sb, ":");
1131 sbuf_printf(sb, "%d:",
1132 rule->rr_subject.rs_uip->ui_uid);
1134 case RCTL_SUBJECT_TYPE_LOGINCLASS:
1135 if (rule->rr_subject.rs_loginclass == NULL)
1136 sbuf_printf(sb, ":");
1138 sbuf_printf(sb, "%s:",
1139 rule->rr_subject.rs_loginclass->lc_name);
1141 case RCTL_SUBJECT_TYPE_JAIL:
1142 if (rule->rr_subject.rs_prison_racct == NULL)
1143 sbuf_printf(sb, ":");
1145 sbuf_printf(sb, "%s:",
1146 rule->rr_subject.rs_prison_racct->prr_name);
1149 panic("rctl_rule_to_sbuf: unknown subject type %d",
1150 rule->rr_subject_type);
1153 amount = rule->rr_amount;
1154 if (amount != RCTL_AMOUNT_UNDEFINED &&
1155 racct_is_in_thousands(rule->rr_resource))
1158 sbuf_printf(sb, "%s:%s=%jd",
1159 rctl_resource_name(rule->rr_resource),
1160 rctl_action_name(rule->rr_action),
1163 if (rule->rr_per != rule->rr_subject_type)
1164 sbuf_printf(sb, "/%s", rctl_subject_type_name(rule->rr_per));
1168 * Routine used by RCTL syscalls to read in input string.
1171 rctl_read_inbuf(char **inputstr, const char *inbufp, size_t inbuflen)
1179 str = malloc(inbuflen + 1, M_RCTL, M_WAITOK);
1180 error = copyinstr(inbufp, str, inbuflen, NULL);
1192 * Routine used by RCTL syscalls to write out output string.
1195 rctl_write_outbuf(struct sbuf *outputsbuf, char *outbufp, size_t outbuflen)
1199 if (outputsbuf == NULL)
1202 sbuf_finish(outputsbuf);
1203 if (outbuflen < sbuf_len(outputsbuf) + 1) {
1204 sbuf_delete(outputsbuf);
1207 error = copyout(sbuf_data(outputsbuf), outbufp,
1208 sbuf_len(outputsbuf) + 1);
1209 sbuf_delete(outputsbuf);
1213 static struct sbuf *
1214 rctl_racct_to_sbuf(struct racct *racct, int sloppy)
1220 sb = sbuf_new_auto();
1221 for (i = 0; i <= RACCT_MAX; i++) {
1222 if (sloppy == 0 && racct_is_sloppy(i))
1224 amount = racct->r_resources[i];
1225 if (racct_is_in_thousands(i))
1227 sbuf_printf(sb, "%s=%jd,", rctl_resource_name(i), amount);
1229 sbuf_setpos(sb, sbuf_len(sb) - 1);
1234 rctl_get_racct(struct thread *td, struct rctl_get_racct_args *uap)
1238 struct rctl_rule *filter;
1239 struct sbuf *outputsbuf = NULL;
1241 struct uidinfo *uip;
1242 struct loginclass *lc;
1243 struct prison_racct *prr;
1245 error = priv_check(td, PRIV_RCTL_GET_RACCT);
1249 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1253 sx_slock(&allproc_lock);
1254 error = rctl_string_to_rule(inputstr, &filter);
1255 free(inputstr, M_RCTL);
1257 sx_sunlock(&allproc_lock);
1261 switch (filter->rr_subject_type) {
1262 case RCTL_SUBJECT_TYPE_PROCESS:
1263 p = filter->rr_subject.rs_proc;
1268 if (p->p_flag & P_SYSTEM) {
1272 outputsbuf = rctl_racct_to_sbuf(p->p_racct, 0);
1274 case RCTL_SUBJECT_TYPE_USER:
1275 uip = filter->rr_subject.rs_uip;
1280 outputsbuf = rctl_racct_to_sbuf(uip->ui_racct, 1);
1282 case RCTL_SUBJECT_TYPE_LOGINCLASS:
1283 lc = filter->rr_subject.rs_loginclass;
1288 outputsbuf = rctl_racct_to_sbuf(lc->lc_racct, 1);
1290 case RCTL_SUBJECT_TYPE_JAIL:
1291 prr = filter->rr_subject.rs_prison_racct;
1296 outputsbuf = rctl_racct_to_sbuf(prr->prr_racct, 1);
1302 rctl_rule_release(filter);
1303 sx_sunlock(&allproc_lock);
1307 error = rctl_write_outbuf(outputsbuf, uap->outbufp, uap->outbuflen);
1313 rctl_get_rules_callback(struct racct *racct, void *arg2, void *arg3)
1315 struct rctl_rule *filter = (struct rctl_rule *)arg2;
1316 struct rctl_rule_link *link;
1317 struct sbuf *sb = (struct sbuf *)arg3;
1319 rw_rlock(&rctl_lock);
1320 LIST_FOREACH(link, &racct->r_rule_links, rrl_next) {
1321 if (!rctl_rule_matches(link->rrl_rule, filter))
1323 rctl_rule_to_sbuf(sb, link->rrl_rule);
1324 sbuf_printf(sb, ",");
1326 rw_runlock(&rctl_lock);
1330 rctl_get_rules(struct thread *td, struct rctl_get_rules_args *uap)
1333 size_t bufsize = RCTL_DEFAULT_BUFSIZE;
1334 char *inputstr, *buf;
1336 struct rctl_rule *filter;
1337 struct rctl_rule_link *link;
1340 error = priv_check(td, PRIV_RCTL_GET_RULES);
1344 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1348 sx_slock(&allproc_lock);
1349 error = rctl_string_to_rule(inputstr, &filter);
1350 free(inputstr, M_RCTL);
1352 sx_sunlock(&allproc_lock);
1357 buf = malloc(bufsize, M_RCTL, M_WAITOK);
1358 sb = sbuf_new(NULL, buf, bufsize, SBUF_FIXEDLEN);
1359 KASSERT(sb != NULL, ("sbuf_new failed"));
1361 sx_assert(&allproc_lock, SA_LOCKED);
1362 FOREACH_PROC_IN_SYSTEM(p) {
1363 rw_rlock(&rctl_lock);
1364 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
1366 * Non-process rules will be added to the buffer later.
1367 * Adding them here would result in duplicated output.
1369 if (link->rrl_rule->rr_subject_type !=
1370 RCTL_SUBJECT_TYPE_PROCESS)
1372 if (!rctl_rule_matches(link->rrl_rule, filter))
1374 rctl_rule_to_sbuf(sb, link->rrl_rule);
1375 sbuf_printf(sb, ",");
1377 rw_runlock(&rctl_lock);
1380 loginclass_racct_foreach(rctl_get_rules_callback, filter, sb);
1381 ui_racct_foreach(rctl_get_rules_callback, filter, sb);
1382 prison_racct_foreach(rctl_get_rules_callback, filter, sb);
1383 if (sbuf_error(sb) == ENOMEM) {
1391 * Remove trailing ",".
1393 if (sbuf_len(sb) > 0)
1394 sbuf_setpos(sb, sbuf_len(sb) - 1);
1396 error = rctl_write_outbuf(sb, uap->outbufp, uap->outbuflen);
1398 rctl_rule_release(filter);
1399 sx_sunlock(&allproc_lock);
1405 rctl_get_limits(struct thread *td, struct rctl_get_limits_args *uap)
1408 size_t bufsize = RCTL_DEFAULT_BUFSIZE;
1409 char *inputstr, *buf;
1411 struct rctl_rule *filter;
1412 struct rctl_rule_link *link;
1414 error = priv_check(td, PRIV_RCTL_GET_LIMITS);
1418 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1422 sx_slock(&allproc_lock);
1423 error = rctl_string_to_rule(inputstr, &filter);
1424 free(inputstr, M_RCTL);
1426 sx_sunlock(&allproc_lock);
1430 if (filter->rr_subject_type == RCTL_SUBJECT_TYPE_UNDEFINED) {
1431 rctl_rule_release(filter);
1432 sx_sunlock(&allproc_lock);
1435 if (filter->rr_subject_type != RCTL_SUBJECT_TYPE_PROCESS) {
1436 rctl_rule_release(filter);
1437 sx_sunlock(&allproc_lock);
1438 return (EOPNOTSUPP);
1440 if (filter->rr_subject.rs_proc == NULL) {
1441 rctl_rule_release(filter);
1442 sx_sunlock(&allproc_lock);
1447 buf = malloc(bufsize, M_RCTL, M_WAITOK);
1448 sb = sbuf_new(NULL, buf, bufsize, SBUF_FIXEDLEN);
1449 KASSERT(sb != NULL, ("sbuf_new failed"));
1451 rw_rlock(&rctl_lock);
1452 LIST_FOREACH(link, &filter->rr_subject.rs_proc->p_racct->r_rule_links,
1454 rctl_rule_to_sbuf(sb, link->rrl_rule);
1455 sbuf_printf(sb, ",");
1457 rw_runlock(&rctl_lock);
1458 if (sbuf_error(sb) == ENOMEM) {
1466 * Remove trailing ",".
1468 if (sbuf_len(sb) > 0)
1469 sbuf_setpos(sb, sbuf_len(sb) - 1);
1471 error = rctl_write_outbuf(sb, uap->outbufp, uap->outbuflen);
1472 rctl_rule_release(filter);
1473 sx_sunlock(&allproc_lock);
1479 rctl_add_rule(struct thread *td, struct rctl_add_rule_args *uap)
1482 struct rctl_rule *rule;
1485 error = priv_check(td, PRIV_RCTL_ADD_RULE);
1489 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1493 sx_slock(&allproc_lock);
1494 error = rctl_string_to_rule(inputstr, &rule);
1495 free(inputstr, M_RCTL);
1497 sx_sunlock(&allproc_lock);
1501 * The 'per' part of a rule is optional.
1503 if (rule->rr_per == RCTL_SUBJECT_TYPE_UNDEFINED &&
1504 rule->rr_subject_type != RCTL_SUBJECT_TYPE_UNDEFINED)
1505 rule->rr_per = rule->rr_subject_type;
1507 if (!rctl_rule_fully_specified(rule)) {
1512 error = rctl_rule_add(rule);
1515 rctl_rule_release(rule);
1516 sx_sunlock(&allproc_lock);
1521 rctl_remove_rule(struct thread *td, struct rctl_remove_rule_args *uap)
1524 struct rctl_rule *filter;
1527 error = priv_check(td, PRIV_RCTL_REMOVE_RULE);
1531 error = rctl_read_inbuf(&inputstr, uap->inbufp, uap->inbuflen);
1535 sx_slock(&allproc_lock);
1536 error = rctl_string_to_rule(inputstr, &filter);
1537 free(inputstr, M_RCTL);
1539 sx_sunlock(&allproc_lock);
1543 error = rctl_rule_remove(filter);
1544 rctl_rule_release(filter);
1545 sx_sunlock(&allproc_lock);
1551 * Update RCTL rule list after credential change.
1554 rctl_proc_ucred_changed(struct proc *p, struct ucred *newcred)
1557 struct rctl_rule_link *link, *newlink;
1558 struct uidinfo *newuip;
1559 struct loginclass *newlc;
1560 struct prison_racct *newprr;
1561 LIST_HEAD(, rctl_rule_link) newrules;
1563 newuip = newcred->cr_ruidinfo;
1564 newlc = newcred->cr_loginclass;
1565 newprr = newcred->cr_prison->pr_prison_racct;
1567 LIST_INIT(&newrules);
1571 * First, count the rules that apply to the process with new
1575 rw_rlock(&rctl_lock);
1576 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
1577 if (link->rrl_rule->rr_subject_type ==
1578 RCTL_SUBJECT_TYPE_PROCESS)
1581 LIST_FOREACH(link, &newuip->ui_racct->r_rule_links, rrl_next)
1583 LIST_FOREACH(link, &newlc->lc_racct->r_rule_links, rrl_next)
1585 LIST_FOREACH(link, &newprr->prr_racct->r_rule_links, rrl_next)
1587 rw_runlock(&rctl_lock);
1590 * Create temporary list. We've dropped the rctl_lock in order
1593 for (i = 0; i < rulecnt; i++) {
1594 newlink = uma_zalloc(rctl_rule_link_zone, M_WAITOK);
1595 newlink->rrl_rule = NULL;
1596 LIST_INSERT_HEAD(&newrules, newlink, rrl_next);
1599 newlink = LIST_FIRST(&newrules);
1602 * Assign rules to the newly allocated list entries.
1604 rw_wlock(&rctl_lock);
1605 LIST_FOREACH(link, &p->p_racct->r_rule_links, rrl_next) {
1606 if (link->rrl_rule->rr_subject_type ==
1607 RCTL_SUBJECT_TYPE_PROCESS) {
1608 if (newlink == NULL)
1610 rctl_rule_acquire(link->rrl_rule);
1611 newlink->rrl_rule = link->rrl_rule;
1612 newlink = LIST_NEXT(newlink, rrl_next);
1617 LIST_FOREACH(link, &newuip->ui_racct->r_rule_links, rrl_next) {
1618 if (newlink == NULL)
1620 rctl_rule_acquire(link->rrl_rule);
1621 newlink->rrl_rule = link->rrl_rule;
1622 newlink = LIST_NEXT(newlink, rrl_next);
1626 LIST_FOREACH(link, &newlc->lc_racct->r_rule_links, rrl_next) {
1627 if (newlink == NULL)
1629 rctl_rule_acquire(link->rrl_rule);
1630 newlink->rrl_rule = link->rrl_rule;
1631 newlink = LIST_NEXT(newlink, rrl_next);
1635 LIST_FOREACH(link, &newprr->prr_racct->r_rule_links, rrl_next) {
1636 if (newlink == NULL)
1638 rctl_rule_acquire(link->rrl_rule);
1639 newlink->rrl_rule = link->rrl_rule;
1640 newlink = LIST_NEXT(newlink, rrl_next);
1646 * Free the old rule list.
1648 while (!LIST_EMPTY(&p->p_racct->r_rule_links)) {
1649 link = LIST_FIRST(&p->p_racct->r_rule_links);
1650 LIST_REMOVE(link, rrl_next);
1651 rctl_rule_release(link->rrl_rule);
1652 uma_zfree(rctl_rule_link_zone, link);
1656 * Replace lists and we're done.
1658 * XXX: Is there any way to switch list heads instead
1659 * of iterating here?
1661 while (!LIST_EMPTY(&newrules)) {
1662 newlink = LIST_FIRST(&newrules);
1663 LIST_REMOVE(newlink, rrl_next);
1664 LIST_INSERT_HEAD(&p->p_racct->r_rule_links,
1668 rw_wunlock(&rctl_lock);
1674 rw_wunlock(&rctl_lock);
1677 * Rule list changed while we were not holding the rctl_lock.
1678 * Free the new list and try again.
1680 while (!LIST_EMPTY(&newrules)) {
1681 newlink = LIST_FIRST(&newrules);
1682 LIST_REMOVE(newlink, rrl_next);
1683 if (newlink->rrl_rule != NULL)
1684 rctl_rule_release(newlink->rrl_rule);
1685 uma_zfree(rctl_rule_link_zone, newlink);
1692 * Assign RCTL rules to the newly created process.
1695 rctl_proc_fork(struct proc *parent, struct proc *child)
1698 struct rctl_rule_link *link;
1699 struct rctl_rule *rule;
1701 LIST_INIT(&child->p_racct->r_rule_links);
1704 * No limits for kernel processes.
1706 if (child->p_flag & P_SYSTEM)
1710 * Nothing to inherit from P_SYSTEM parents.
1712 if (parent->p_racct == NULL) {
1713 KASSERT(parent->p_flag & P_SYSTEM,
1714 ("non-system process without racct; p = %p", parent));
1718 rw_wlock(&rctl_lock);
1721 * Go through limits applicable to the parent and assign them
1722 * to the child. Rules with 'process' subject have to be duplicated
1723 * in order to make their rr_subject point to the new process.
1725 LIST_FOREACH(link, &parent->p_racct->r_rule_links, rrl_next) {
1726 if (link->rrl_rule->rr_subject_type ==
1727 RCTL_SUBJECT_TYPE_PROCESS) {
1728 rule = rctl_rule_duplicate(link->rrl_rule, M_NOWAIT);
1731 KASSERT(rule->rr_subject.rs_proc == parent,
1732 ("rule->rr_subject.rs_proc != parent"));
1733 rule->rr_subject.rs_proc = child;
1734 error = rctl_racct_add_rule_locked(child->p_racct,
1736 rctl_rule_release(rule);
1740 error = rctl_racct_add_rule_locked(child->p_racct,
1747 rw_wunlock(&rctl_lock);
1751 while (!LIST_EMPTY(&child->p_racct->r_rule_links)) {
1752 link = LIST_FIRST(&child->p_racct->r_rule_links);
1753 LIST_REMOVE(link, rrl_next);
1754 rctl_rule_release(link->rrl_rule);
1755 uma_zfree(rctl_rule_link_zone, link);
1757 rw_wunlock(&rctl_lock);
1762 * Release rules attached to the racct.
1765 rctl_racct_release(struct racct *racct)
1767 struct rctl_rule_link *link;
1769 rw_wlock(&rctl_lock);
1770 while (!LIST_EMPTY(&racct->r_rule_links)) {
1771 link = LIST_FIRST(&racct->r_rule_links);
1772 LIST_REMOVE(link, rrl_next);
1773 rctl_rule_release(link->rrl_rule);
1774 uma_zfree(rctl_rule_link_zone, link);
1776 rw_wunlock(&rctl_lock);
1783 rctl_rule_link_zone = uma_zcreate("rctl_rule_link",
1784 sizeof(struct rctl_rule_link), NULL, NULL, NULL, NULL,
1785 UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
1786 rctl_rule_zone = uma_zcreate("rctl_rule", sizeof(struct rctl_rule),
1787 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
1793 rctl_get_racct(struct thread *td, struct rctl_get_racct_args *uap)
1800 rctl_get_rules(struct thread *td, struct rctl_get_rules_args *uap)
1807 rctl_get_limits(struct thread *td, struct rctl_get_limits_args *uap)
1814 rctl_add_rule(struct thread *td, struct rctl_add_rule_args *uap)
1821 rctl_remove_rule(struct thread *td, struct rctl_remove_rule_args *uap)