1 /* 2 * AppArmor security module 3 * 4 * This file contains AppArmor policy definitions. 5 * 6 * Copyright (C) 1998-2008 Novell/SUSE 7 * Copyright 2009-2010 Canonical Ltd. 8 * 9 * This program is free software; you can redistribute it and/or 10 * modify it under the terms of the GNU General Public License as 11 * published by the Free Software Foundation, version 2 of the 12 * License. 13 */ 14 15 #ifndef __AA_POLICY_H 16 #define __AA_POLICY_H 17 18 #include <linux/capability.h> 19 #include <linux/cred.h> 20 #include <linux/kref.h> 21 #include <linux/rhashtable.h> 22 #include <linux/sched.h> 23 #include <linux/slab.h> 24 #include <linux/socket.h> 25 26 #include "apparmor.h" 27 #include "audit.h" 28 #include "capability.h" 29 #include "domain.h" 30 #include "file.h" 31 #include "lib.h" 32 #include "label.h" 33 #include "net.h" 34 #include "perms.h" 35 #include "resource.h" 36 37 38 struct aa_ns; 39 40 extern int unprivileged_userns_apparmor_policy; 41 42 extern const char *const aa_profile_mode_names[]; 43 #define APPARMOR_MODE_NAMES_MAX_INDEX 4 44 45 #define PROFILE_MODE(_profile, _mode) \ 46 ((aa_g_profile_mode == (_mode)) || \ 47 ((_profile)->mode == (_mode))) 48 49 #define COMPLAIN_MODE(_profile) PROFILE_MODE((_profile), APPARMOR_COMPLAIN) 50 51 #define KILL_MODE(_profile) PROFILE_MODE((_profile), APPARMOR_KILL) 52 53 #define PROFILE_IS_HAT(_profile) ((_profile)->label.flags & FLAG_HAT) 54 55 #define profile_is_stale(_profile) (label_is_stale(&(_profile)->label)) 56 57 #define on_list_rcu(X) (!list_empty(X) && (X)->prev != LIST_POISON2) 58 59 /* 60 * FIXME: currently need a clean way to replace and remove profiles as a 61 * set. It should be done at the namespace level. 62 * Either, with a set of profiles loaded at the namespace level or via 63 * a mark and remove marked interface. 64 */ 65 enum profile_mode { 66 APPARMOR_ENFORCE, /* enforce access rules */ 67 APPARMOR_COMPLAIN, /* allow and log access violations */ 68 APPARMOR_KILL, /* kill task on access violation */ 69 APPARMOR_UNCONFINED, /* profile set to unconfined */ 70 }; 71 72 73 /* struct aa_policydb - match engine for a policy 74 * dfa: dfa pattern match 75 * start: set of start states for the different classes of data 76 */ 77 struct aa_policydb { 78 /* Generic policy DFA specific rule types will be subsections of it */ 79 struct aa_dfa *dfa; 80 unsigned int start[AA_CLASS_LAST + 1]; 81 82 }; 83 84 /* struct aa_data - generic data structure 85 * key: name for retrieving this data 86 * size: size of data in bytes 87 * data: binary data 88 * head: reserved for rhashtable 89 */ 90 struct aa_data { 91 char *key; 92 u32 size; 93 char *data; 94 struct rhash_head head; 95 }; 96 97 98 /* struct aa_profile - basic confinement data 99 * @base - base components of the profile (name, refcount, lists, lock ...) 100 * @label - label this profile is an extension of 101 * @parent: parent of profile 102 * @ns: namespace the profile is in 103 * @rename: optional profile name that this profile renamed 104 * @attach: human readable attachment string 105 * @xmatch: optional extended matching for unconfined executables names 106 * @xmatch_len: xmatch prefix len, used to determine xmatch priority 107 * @audit: the auditing mode of the profile 108 * @mode: the enforcement mode of the profile 109 * @path_flags: flags controlling path generation behavior 110 * @disconnected: what to prepend if attach_disconnected is specified 111 * @size: the memory consumed by this profiles rules 112 * @policy: general match rules governing policy 113 * @file: The set of rules governing basic file access and domain transitions 114 * @caps: capabilities for the profile 115 * @rlimits: rlimits for the profile 116 * 117 * @dents: dentries for the profiles file entries in apparmorfs 118 * @dirname: name of the profile dir in apparmorfs 119 * @data: hashtable for free-form policy aa_data 120 * 121 * The AppArmor profile contains the basic confinement data. Each profile 122 * has a name, and exists in a namespace. The @name and @exec_match are 123 * used to determine profile attachment against unconfined tasks. All other 124 * attachments are determined by profile X transition rules. 125 * 126 * Profiles have a hierarchy where hats and children profiles keep 127 * a reference to their parent. 128 * 129 * Profile names can not begin with a : and can not contain the \0 130 * character. If a profile name begins with / it will be considered when 131 * determining profile attachment on "unconfined" tasks. 132 */ 133 struct aa_profile { 134 struct aa_policy base; 135 struct aa_profile __rcu *parent; 136 137 struct aa_ns *ns; 138 const char *rename; 139 140 const char *attach; 141 struct aa_dfa *xmatch; 142 int xmatch_len; 143 enum audit_mode audit; 144 long mode; 145 u32 path_flags; 146 const char *disconnected; 147 int size; 148 149 struct aa_policydb policy; 150 struct aa_file_rules file; 151 struct aa_caps caps; 152 153 int xattr_count; 154 char **xattrs; 155 156 struct aa_rlimit rlimits; 157 158 struct aa_loaddata *rawdata; 159 unsigned char *hash; 160 char *dirname; 161 struct dentry *dents[AAFS_PROF_SIZEOF]; 162 struct rhashtable *data; 163 struct aa_label label; 164 }; 165 166 extern enum profile_mode aa_g_profile_mode; 167 168 #define AA_MAY_LOAD_POLICY AA_MAY_APPEND 169 #define AA_MAY_REPLACE_POLICY AA_MAY_WRITE 170 #define AA_MAY_REMOVE_POLICY AA_MAY_DELETE 171 172 #define profiles_ns(P) ((P)->ns) 173 #define name_is_shared(A, B) ((A)->hname && (A)->hname == (B)->hname) 174 175 void aa_add_profile(struct aa_policy *common, struct aa_profile *profile); 176 177 178 void aa_free_proxy_kref(struct kref *kref); 179 struct aa_profile *aa_alloc_profile(const char *name, struct aa_proxy *proxy, 180 gfp_t gfp); 181 struct aa_profile *aa_new_null_profile(struct aa_profile *parent, bool hat, 182 const char *base, gfp_t gfp); 183 void aa_free_profile(struct aa_profile *profile); 184 void aa_free_profile_kref(struct kref *kref); 185 struct aa_profile *aa_find_child(struct aa_profile *parent, const char *name); 186 struct aa_profile *aa_lookupn_profile(struct aa_ns *ns, const char *hname, 187 size_t n); 188 struct aa_profile *aa_lookup_profile(struct aa_ns *ns, const char *name); 189 struct aa_profile *aa_fqlookupn_profile(struct aa_label *base, 190 const char *fqname, size_t n); 191 struct aa_profile *aa_match_profile(struct aa_ns *ns, const char *name); 192 193 ssize_t aa_replace_profiles(struct aa_ns *view, struct aa_label *label, 194 u32 mask, struct aa_loaddata *udata); 195 ssize_t aa_remove_profiles(struct aa_ns *view, struct aa_label *label, 196 char *name, size_t size); 197 void __aa_profile_list_release(struct list_head *head); 198 199 #define PROF_ADD 1 200 #define PROF_REPLACE 0 201 202 #define profile_unconfined(X) ((X)->mode == APPARMOR_UNCONFINED) 203 204 /** 205 * aa_get_newest_profile - simple wrapper fn to wrap the label version 206 * @p: profile (NOT NULL) 207 * 208 * Returns refcount to newest version of the profile (maybe @p) 209 * 210 * Requires: @p must be held with a valid refcount 211 */ 212 static inline struct aa_profile *aa_get_newest_profile(struct aa_profile *p) 213 { 214 return labels_profile(aa_get_newest_label(&p->label)); 215 } 216 217 #define PROFILE_MEDIATES(P, T) ((P)->policy.start[(T)]) 218 /* safe version of POLICY_MEDIATES for full range input */ 219 static inline unsigned int PROFILE_MEDIATES_SAFE(struct aa_profile *profile, 220 unsigned char class) 221 { 222 if (profile->policy.dfa) 223 return aa_dfa_match_len(profile->policy.dfa, 224 profile->policy.start[0], &class, 1); 225 return 0; 226 } 227 228 static inline unsigned int PROFILE_MEDIATES_AF(struct aa_profile *profile, 229 u16 AF) { 230 unsigned int state = PROFILE_MEDIATES(profile, AA_CLASS_NET); 231 __be16 be_af = cpu_to_be16(AF); 232 233 if (!state) 234 return 0; 235 return aa_dfa_match_len(profile->policy.dfa, state, (char *) &be_af, 2); 236 } 237 238 /** 239 * aa_get_profile - increment refcount on profile @p 240 * @p: profile (MAYBE NULL) 241 * 242 * Returns: pointer to @p if @p is NULL will return NULL 243 * Requires: @p must be held with valid refcount when called 244 */ 245 static inline struct aa_profile *aa_get_profile(struct aa_profile *p) 246 { 247 if (p) 248 kref_get(&(p->label.count)); 249 250 return p; 251 } 252 253 /** 254 * aa_get_profile_not0 - increment refcount on profile @p found via lookup 255 * @p: profile (MAYBE NULL) 256 * 257 * Returns: pointer to @p if @p is NULL will return NULL 258 * Requires: @p must be held with valid refcount when called 259 */ 260 static inline struct aa_profile *aa_get_profile_not0(struct aa_profile *p) 261 { 262 if (p && kref_get_unless_zero(&p->label.count)) 263 return p; 264 265 return NULL; 266 } 267 268 /** 269 * aa_get_profile_rcu - increment a refcount profile that can be replaced 270 * @p: pointer to profile that can be replaced (NOT NULL) 271 * 272 * Returns: pointer to a refcounted profile. 273 * else NULL if no profile 274 */ 275 static inline struct aa_profile *aa_get_profile_rcu(struct aa_profile __rcu **p) 276 { 277 struct aa_profile *c; 278 279 rcu_read_lock(); 280 do { 281 c = rcu_dereference(*p); 282 } while (c && !kref_get_unless_zero(&c->label.count)); 283 rcu_read_unlock(); 284 285 return c; 286 } 287 288 /** 289 * aa_put_profile - decrement refcount on profile @p 290 * @p: profile (MAYBE NULL) 291 */ 292 static inline void aa_put_profile(struct aa_profile *p) 293 { 294 if (p) 295 kref_put(&p->label.count, aa_label_kref); 296 } 297 298 static inline int AUDIT_MODE(struct aa_profile *profile) 299 { 300 if (aa_g_audit != AUDIT_NORMAL) 301 return aa_g_audit; 302 303 return profile->audit; 304 } 305 306 bool policy_view_capable(struct aa_ns *ns); 307 bool policy_admin_capable(struct aa_ns *ns); 308 int aa_may_manage_policy(struct aa_label *label, struct aa_ns *ns, 309 u32 mask); 310 311 #endif /* __AA_POLICY_H */ 312