1 /* 2 * Copyright (c) 2009 The DragonFly Project. All rights reserved. 3 * 4 * This code is derived from software contributed to The DragonFly Project 5 * by Alex Hornung <ahornung@gmail.com> 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 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 15 * the documentation and/or other materials provided with the 16 * distribution. 17 * 3. Neither the name of The DragonFly Project nor the names of its 18 * contributors may be used to endorse or promote products derived 19 * from this software without specific, prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, 27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 */ 34 35 #ifndef DEVFSCTL_H 36 #define DEVFSCTL_H 37 38 #include <sys/queue.h> 39 40 #define iswhitespace(X) ((((X) == ' ') || ((X) == '\t'))?1:0) 41 #define RULE_MAX_STACK 32 42 #define RULES_FILE 0x01 43 44 #if 0 45 #define RULETAB_FILE 0x02 46 #define RULETAB_ALL 0x01 47 #define RULETAB_ONLY_BOOT 0x02 48 #define RULETAB_SPECIFIC 0x03 49 #endif 50 51 struct groupdevid { 52 enum { 53 isGROUP = 1, 54 isNAME, 55 isTYPE 56 } type; 57 58 union { 59 char *name; 60 int devtype; 61 }; 62 63 struct groupdevid **list; 64 size_t listsize; 65 #if 0 66 struct groupdevid *next; 67 TAILQ_HEAD(, groupdevid) list; 68 #endif 69 TAILQ_ENTRY(groupdevid) link; 70 }; 71 72 struct rule { 73 enum { 74 rPERM = 1, 75 rLINK, 76 rHIDE, 77 rSHOW 78 } type; 79 80 struct groupdevid *id; 81 char *dest; 82 uid_t uid; 83 uid_t gid; 84 int mode; 85 int jail; 86 87 TAILQ_ENTRY(rule) link; 88 }; 89 90 #if 0 91 struct rule_tab { 92 const char *mntpoint; 93 const char *rule_file; 94 TAILQ_ENTRY(rule_tab) link; 95 }; 96 #endif 97 98 typedef int (rule_iterate_callback_t)(struct rule *rule, 99 struct groupdevid *id); 100 typedef int (rule_parser_t)(char **); 101 102 struct groupdevid *new_id(const char *, int); 103 struct groupdevid *get_id(const char *); 104 struct groupdevid *get_group(const char *, int); 105 struct rule *new_rule(int, struct groupdevid *); 106 void add_rule(struct rule *); 107 int rule_apply(void); 108 void dump_config(void); 109 int read_config(const char *, int); 110 void syntax_error(const char *fmt, ...) __dead2 __printflike(1, 2); 111 void rule_tab(void); 112 void delete_rules(void); 113 #endif 114