xref: /freebsd/usr.sbin/ugidfw/ugidfw.c (revision 2008043f386721d58158e37e0d7e50df8095942d)
1 /*-
2  * SPDX-License-Identifier: BSD-2-Clause
3  *
4  * Copyright (c) 2002, 2004 Networks Associates Technology, Inc.
5  * All rights reserved.
6  *
7  * This software was developed for the FreeBSD Project by NAI Labs, the
8  * Security Research Division of Network Associates, Inc. under
9  * DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA
10  * CHATS research program.
11  *
12  * Redistribution and use in source and binary forms, with or without
13  * modification, are permitted provided that the following conditions
14  * are met:
15  * 1. Redistributions of source code must retain the above copyright
16  *    notice, this list of conditions and the following disclaimer.
17  * 2. Redistributions in binary form must reproduce the above copyright
18  *    notice, this list of conditions and the following disclaimer in the
19  *    documentation and/or other materials provided with the distribution.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  */
33 
34 #include <sys/cdefs.h>
35 #include <sys/param.h>
36 #include <sys/errno.h>
37 #include <sys/mount.h>
38 #include <sys/time.h>
39 #include <sys/sysctl.h>
40 
41 #include <security/mac_bsdextended/mac_bsdextended.h>
42 
43 #include <err.h>
44 #include <stdio.h>
45 #include <stdlib.h>
46 #include <string.h>
47 #include <ugidfw.h>
48 
49 void add_rule(int argc, char *argv[]);
50 void list_rules(void);
51 void remove_rule(int argc, char *argv[]);
52 void set_rule(int argc, char *argv[]);
53 void usage(void);
54 
55 void
56 usage(void)
57 {
58 
59 	fprintf(stderr, "usage: ugidfw add [subject [not] [uid uid] [gid gid]]"
60 	    " [object [not] [uid uid] \\\n");
61 	fprintf(stderr, "    [gid gid]] mode arswxn\n");
62 	fprintf(stderr, "       ugidfw list\n");
63 	fprintf(stderr, "       ugidfw set rulenum [subject [not] [uid uid] [gid gid]]"
64 	    " [object [not] \\\n");
65 	fprintf(stderr, "    [uid uid] [gid gid]] mode arswxn\n");
66 	fprintf(stderr, "       ugidfw remove rulenum\n");
67 
68 	exit(1);
69 }
70 
71 void
72 add_rule(int argc, char *argv[])
73 {
74 	char errstr[BUFSIZ], charstr[BUFSIZ];
75 	struct mac_bsdextended_rule rule;
76 	int error, rulenum;
77 
78 	error = bsde_parse_rule(argc, argv, &rule, BUFSIZ, errstr);
79 	if (error) {
80 		warnx("%s", errstr);
81 		return;
82 	}
83 
84 	error = bsde_add_rule(&rulenum, &rule, BUFSIZ, errstr);
85 	if (error) {
86 		warnx("%s", errstr);
87 		return;
88 	}
89 	if (bsde_rule_to_string(&rule, charstr, BUFSIZ) == -1)
90 		warnx("Added rule, but unable to print string.");
91 	else
92 		printf("%d %s\n", rulenum, charstr);
93 }
94 
95 void
96 list_rules(void)
97 {
98 	char errstr[BUFSIZ], charstr[BUFSIZ];
99 	struct mac_bsdextended_rule rule;
100 	int error, i, rule_count, rule_slots;
101 
102 	rule_slots = bsde_get_rule_slots(BUFSIZ, errstr);
103 	if (rule_slots == -1) {
104 		warnx("unable to get rule slots; mac_bsdextended.ko "
105 		    "may not be loaded");
106 		errx(1, "bsde_get_rule_slots: %s", errstr);
107 	}
108 
109 	rule_count = bsde_get_rule_count(BUFSIZ, errstr);
110 	if (rule_count == -1)
111 		errx(1, "bsde_get_rule_count: %s", errstr);
112 
113 	printf("%d slots, %d rules\n", rule_slots, rule_count);
114 
115 	for (i = 0; i < rule_slots; i++) {
116 		error = bsde_get_rule(i, &rule, BUFSIZ, errstr);
117 		switch (error) {
118 		case -2:
119 			continue;
120 		case -1:
121 			warnx("rule %d: %s", i, errstr);
122 			continue;
123 		case 0:
124 			break;
125 		}
126 
127 		if (bsde_rule_to_string(&rule, charstr, BUFSIZ) == -1)
128 			warnx("unable to translate rule %d to string", i);
129 		else
130 			printf("%d %s\n", i, charstr);
131 	}
132 }
133 
134 void
135 set_rule(int argc, char *argv[])
136 {
137 	char errstr[BUFSIZ];
138 	struct mac_bsdextended_rule rule;
139 	long value;
140 	int error, rulenum;
141 	char *endp;
142 
143 	if (argc < 1)
144 		usage();
145 
146 	value = strtol(argv[0], &endp, 10);
147 	if (*endp != '\0')
148 		usage();
149 
150 	if ((long) value != (int) value || value < 0)
151 		usage();
152 
153 	rulenum = value;
154 
155 	error = bsde_parse_rule(argc - 1, argv + 1, &rule, BUFSIZ, errstr);
156 	if (error) {
157 		warnx("%s", errstr);
158 		return;
159 	}
160 
161 	error = bsde_set_rule(rulenum, &rule, BUFSIZ, errstr);
162 	if (error) {
163 		warnx("%s", errstr);
164 		return;
165 	}
166 }
167 
168 void
169 remove_rule(int argc, char *argv[])
170 {
171 	char errstr[BUFSIZ];
172 	long value;
173 	int error, rulenum;
174 	char *endp;
175 
176 	if (argc != 1)
177 		usage();
178 
179 	value = strtol(argv[0], &endp, 10);
180 	if (*endp != '\0')
181 		usage();
182 
183 	if ((long) value != (int) value || value < 0)
184 		usage();
185 
186 	rulenum = value;
187 
188 	error = bsde_delete_rule(rulenum, BUFSIZ, errstr);
189 	if (error)
190 		warnx("%s", errstr);
191 }
192 
193 int
194 main(int argc, char *argv[])
195 {
196 
197 	if (argc < 2)
198 		usage();
199 
200 	if (strcmp("add", argv[1]) == 0) {
201 		add_rule(argc-2, argv+2);
202 	} else if (strcmp("list", argv[1]) == 0) {
203 		if (argc != 2)
204 			usage();
205 		list_rules();
206 	} else if (strcmp("set", argv[1]) == 0) {
207 		set_rule(argc-2, argv+2);
208 	} else if (strcmp("remove", argv[1]) == 0) {
209 		remove_rule(argc-2, argv+2);
210 	} else
211 		usage();
212 
213 	return (0);
214 }
215