]>
git.ipfire.org Git - thirdparty/systemd.git/blob - src/shared/uid-range.c
1 /* SPDX-License-Identifier: LGPL-2.1+ */
7 #include "alloc-util.h"
10 #include "user-util.h"
12 static bool uid_range_intersect(UidRange
*range
, uid_t start
, uid_t nr
) {
15 return range
->start
<= start
+ nr
&&
16 range
->start
+ range
->nr
>= start
;
19 static void uid_range_coalesce(UidRange
**p
, unsigned *n
) {
25 for (i
= 0; i
< *n
; i
++) {
26 for (j
= i
+ 1; j
< *n
; j
++) {
27 UidRange
*x
= (*p
)+i
, *y
= (*p
)+j
;
29 if (uid_range_intersect(x
, y
->start
, y
->nr
)) {
32 begin
= MIN(x
->start
, y
->start
);
33 end
= MAX(x
->start
+ x
->nr
, y
->start
+ y
->nr
);
39 memmove(y
, y
+1, sizeof(UidRange
) * (*n
- j
-1));
48 static int uid_range_compare(const void *a
, const void *b
) {
49 const UidRange
*x
= a
, *y
= b
;
51 if (x
->start
< y
->start
)
53 if (x
->start
> y
->start
)
64 int uid_range_add(UidRange
**p
, unsigned *n
, uid_t start
, uid_t nr
) {
75 for (i
= 0; i
< *n
; i
++) {
77 if (uid_range_intersect(x
, start
, nr
)) {
86 begin
= MIN(x
->start
, start
);
87 end
= MAX(x
->start
+ x
->nr
, start
+ nr
);
94 t
= reallocarray(*p
, *n
+ 1, sizeof(UidRange
));
105 qsort(*p
, *n
, sizeof(UidRange
), uid_range_compare
);
106 uid_range_coalesce(p
, n
);
111 int uid_range_add_str(UidRange
**p
, unsigned *n
, const char *s
) {
125 b
= strndupa(s
, t
- s
);
126 r
= parse_uid(b
, &start
);
130 r
= parse_uid(t
+1, &end
);
137 nr
= end
- start
+ 1;
139 r
= parse_uid(s
, &start
);
146 return uid_range_add(p
, n
, start
, nr
);
149 int uid_range_next_lower(const UidRange
*p
, unsigned n
, uid_t
*uid
) {
150 uid_t closest
= UID_INVALID
, candidate
;
156 candidate
= *uid
- 1;
158 for (i
= 0; i
< n
; i
++) {
162 end
= p
[i
].start
+ p
[i
].nr
- 1;
164 if (candidate
>= begin
&& candidate
<= end
) {
173 if (closest
== UID_INVALID
)
180 bool uid_range_contains(const UidRange
*p
, unsigned n
, uid_t uid
) {
186 for (i
= 0; i
< n
; i
++)
187 if (uid
>= p
[i
].start
&& uid
< p
[i
].start
+ p
[i
].nr
)