1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
/* $NetBSD: netbsd32_rlimit.c,v 1.2 2021/01/19 03:20:13 simonb Exp $ */
/*
* Copyright (c) 1998, 2001, 2008, 2018 Matthew R. Green
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* from: NetBSD: netbsd32_netbsd.c,v 1.218 2018/08/10 21:44:58 pgoyette Exp
*/
/* rlimit netbsd32 related code */
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: netbsd32_rlimit.c,v 1.2 2021/01/19 03:20:13 simonb Exp $");
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/resource.h>
#include <sys/exec.h>
#include <compat/netbsd32/netbsd32.h>
#include <compat/netbsd32/netbsd32_syscall.h>
#include <compat/netbsd32/netbsd32_syscallargs.h>
#include <compat/netbsd32/netbsd32_conv.h>
#define LIMITCHECK(a, b) ((a) != RLIM_INFINITY && (a) > (b))
static void
fixlimit(int which, struct rlimit *alim)
{
switch (which) {
case RLIMIT_DATA:
if (LIMITCHECK(alim->rlim_cur, MAXDSIZ32))
alim->rlim_cur = MAXDSIZ32;
if (LIMITCHECK(alim->rlim_max, MAXDSIZ32))
alim->rlim_max = MAXDSIZ32;
return;
case RLIMIT_STACK:
if (LIMITCHECK(alim->rlim_cur, MAXSSIZ32))
alim->rlim_cur = MAXSSIZ32;
if (LIMITCHECK(alim->rlim_max, MAXSSIZ32))
alim->rlim_max = MAXSSIZ32;
return;
default:
return;
}
}
int
netbsd32_getrlimit(struct lwp *l, const struct netbsd32_getrlimit_args *uap,
register_t *retval)
{
/* {
syscallarg(int) which;
syscallarg(netbsd32_rlimitp_t) rlp;
} */
int which = SCARG(uap, which);
struct rlimit alim;
if ((u_int)which >= RLIM_NLIMITS)
return EINVAL;
alim = l->l_proc->p_rlimit[which];
fixlimit(which, &alim);
return copyout(&alim, SCARG_P32(uap, rlp), sizeof(alim));
}
int
netbsd32_setrlimit(struct lwp *l, const struct netbsd32_setrlimit_args *uap,
register_t *retval)
{
/* {
syscallarg(int) which;
syscallarg(const netbsd32_rlimitp_t) rlp;
} */
int which = SCARG(uap, which);
struct rlimit alim;
int error;
if ((u_int)which >= RLIM_NLIMITS)
return EINVAL;
error = copyin(SCARG_P32(uap, rlp), &alim, sizeof(struct rlimit));
if (error)
return error;
fixlimit(which, &alim);
return dosetrlimit(l, l->l_proc, which, &alim);
}
void
netbsd32_adjust_limits(struct proc *p)
{
static const struct {
int id;
rlim_t lim;
} lm[] = {
{ RLIMIT_DATA, MAXDSIZ32 },
{ RLIMIT_STACK, MAXSSIZ32 },
};
size_t i;
struct plimit *lim;
struct rlimit *rlim;
/*
* We can only reduce the current limits, we cannot stop external
* processes from changing them (eg via sysctl) later on.
* So there is no point trying to lock out such changes here.
*
* If we assume that rlim_cur/max are accessed using atomic
* operations, we don't need to lock against any other updates
* that might happen if the plimit structure is shared writable
* between multiple processes.
*/
/* Scan to determine is any limits are out of range */
lim = p->p_limit;
for (i = 0; ; i++) {
if (i >= __arraycount(lm))
/* All in range */
return;
rlim = lim->pl_rlimit + lm[i].id;
if (LIMITCHECK(rlim->rlim_cur, lm[i].lim))
break;
if (LIMITCHECK(rlim->rlim_max, lm[i].lim))
break;
}
lim_privatise(p);
lim = p->p_limit;
for (i = 0; i < __arraycount(lm); i++) {
rlim = lim->pl_rlimit + lm[i].id;
if (LIMITCHECK(rlim->rlim_cur, lm[i].lim))
rlim->rlim_cur = lm[i].lim;
if (LIMITCHECK(rlim->rlim_max, lm[i].lim))
rlim->rlim_max = lm[i].lim;
}
}
|