1
2
3
4
5
6
7
8
9
10
11
12
13
14
15#include <linux/audit.h>
16
17#include "include/audit.h"
18#include "include/resource.h"
19#include "include/policy.h"
20
21
22
23
24#include "rlim_names.h"
25
26struct aa_fs_entry aa_fs_entry_rlimit[] = {
27 AA_FS_FILE_STRING("mask", AA_FS_RLIMIT_MASK),
28 { }
29};
30
31
32static void audit_cb(struct audit_buffer *ab, void *va)
33{
34 struct common_audit_data *sa = va;
35
36 audit_log_format(ab, " rlimit=%s value=%lu",
37 rlim_names[sa->aad->rlim.rlim], sa->aad->rlim.max);
38}
39
40
41
42
43
44
45
46
47
48
49static int audit_resource(struct aa_profile *profile, unsigned int resource,
50 unsigned long value, int error)
51{
52 struct common_audit_data sa;
53 struct apparmor_audit_data aad = {0,};
54
55 COMMON_AUDIT_DATA_INIT(&sa, NONE);
56 sa.aad = &aad;
57 aad.op = OP_SETRLIMIT,
58 aad.rlim.rlim = resource;
59 aad.rlim.max = value;
60 aad.error = error;
61 return aa_audit(AUDIT_APPARMOR_AUTO, profile, GFP_KERNEL, &sa,
62 audit_cb);
63}
64
65
66
67
68
69
70
71
72
73
74int aa_map_resource(int resource)
75{
76 return rlim_map[resource];
77}
78
79
80
81
82
83
84
85
86
87
88
89
90int aa_task_setrlimit(struct aa_profile *profile, struct task_struct *task,
91 unsigned int resource, struct rlimit *new_rlim)
92{
93 int error = 0;
94
95
96
97
98
99 if ((task != current->group_leader) ||
100 (profile->rlimits.mask & (1 << resource) &&
101 new_rlim->rlim_max > profile->rlimits.limits[resource].rlim_max))
102 error = -EACCES;
103
104 return audit_resource(profile, resource, new_rlim->rlim_max, error);
105}
106
107
108
109
110
111
112void __aa_transition_rlimits(struct aa_profile *old, struct aa_profile *new)
113{
114 unsigned int mask = 0;
115 struct rlimit *rlim, *initrlim;
116 int i;
117
118
119
120
121 if (old->rlimits.mask) {
122 for (i = 0, mask = 1; i < RLIM_NLIMITS; i++, mask <<= 1) {
123 if (old->rlimits.mask & mask) {
124 rlim = current->signal->rlim + i;
125 initrlim = init_task.signal->rlim + i;
126 rlim->rlim_cur = min(rlim->rlim_max,
127 initrlim->rlim_cur);
128 }
129 }
130 }
131
132
133 if (!new->rlimits.mask)
134 return;
135 for (i = 0, mask = 1; i < RLIM_NLIMITS; i++, mask <<= 1) {
136 if (!(new->rlimits.mask & mask))
137 continue;
138
139 rlim = current->signal->rlim + i;
140 rlim->rlim_max = min(rlim->rlim_max,
141 new->rlimits.limits[i].rlim_max);
142
143 rlim->rlim_cur = min(rlim->rlim_cur, rlim->rlim_max);
144 }
145}
146