1 /* SPDX-License-Identifier: LGPL-2.1+ */
6 #define __STDC_FORMAT_MACROS /* Required for PRIu64 to work. */
21 #include <sys/mount.h>
22 #include <sys/param.h>
23 #include <sys/prctl.h>
25 #include <sys/types.h>
32 #include "memory_utils.h"
33 #include "namespace.h"
35 #include "string_utils.h"
38 #include "include/strlcpy.h"
42 #include "include/strlcat.h"
45 char **lxc_va_arg_list_to_argv(va_list ap
, size_t skip
, int do_strdup
)
48 size_t count
= 1 + skip
;
51 /* first determine size of argument list, we don't want to reallocate
56 char *arg
= va_arg(ap2
, char *);
63 result
= calloc(count
, sizeof(char *));
69 char *arg
= va_arg(ap
, char *);
72 arg
= do_strdup
? strdup(arg
) : arg
;
75 result
[count
++] = arg
;
78 /* calloc has already set last element to NULL*/
86 const char **lxc_va_arg_list_to_argv_const(va_list ap
, size_t skip
)
88 return (const char **)lxc_va_arg_list_to_argv(ap
, skip
, 0);
91 char *lxc_string_replace(const char *needle
, const char *replacement
,
94 ssize_t len
= -1, saved_len
= -1;
96 size_t replacement_len
= strlen(replacement
);
97 size_t needle_len
= strlen(needle
);
99 /* should be executed exactly twice */
100 while (len
== -1 || result
== NULL
) {
106 result
= calloc(1, len
+ 1);
115 for (last_p
= (char *)haystack
, p
= strstr(last_p
, needle
); p
;
116 last_p
= p
, p
= strstr(last_p
, needle
)) {
117 part_len
= (ssize_t
)(p
- last_p
);
118 if (result
&& part_len
> 0)
119 memcpy(&result
[len
], last_p
, part_len
);
123 if (result
&& replacement_len
> 0)
124 memcpy(&result
[len
], replacement
,
127 len
+= replacement_len
;
131 part_len
= strlen(last_p
);
132 if (result
&& part_len
> 0)
133 memcpy(&result
[len
], last_p
, part_len
);
138 /* make sure we did the same thing twice,
139 * once for calculating length, the other
140 * time for copying data */
141 if (saved_len
!= len
) {
146 /* make sure we didn't overwrite any buffer,
147 * due to calloc the string should be 0-terminated */
148 if (result
[len
] != '\0') {
156 bool lxc_string_in_array(const char *needle
, const char **haystack
)
158 for (; haystack
&& *haystack
; haystack
++)
159 if (strequal(needle
, *haystack
))
165 char *lxc_string_join(const char *sep
, const char **parts
, bool use_as_prefix
)
169 size_t sep_len
= strlen(sep
);
170 size_t result_len
= use_as_prefix
* sep_len
;
173 /* calculate new string length */
174 for (p
= (char **)parts
; *p
; p
++)
175 result_len
+= (p
> (char **)parts
) * sep_len
+ strlen(*p
);
177 buf_len
= result_len
+ 1;
178 result
= calloc(buf_len
, 1);
183 (void)strlcpy(result
, sep
, buf_len
);
185 for (p
= (char **)parts
; *p
; p
++) {
186 if (p
> (char **)parts
)
187 (void)strlcat(result
, sep
, buf_len
);
189 (void)strlcat(result
, *p
, buf_len
);
195 char **lxc_normalize_path(const char *path
)
199 size_t components_len
= 0;
202 components
= lxc_string_split(path
, '/');
206 for (p
= components
; *p
; p
++)
209 /* resolve '.' and '..' */
210 for (pos
= 0; pos
< components_len
;) {
211 if (strequal(components
[pos
], ".") ||
212 (strequal(components
[pos
], "..") && pos
== 0)) {
213 /* eat this element */
214 free(components
[pos
]);
215 memmove(&components
[pos
], &components
[pos
+ 1],
216 sizeof(char *) * (components_len
- pos
));
218 } else if (strequal(components
[pos
], "..")) {
219 /* eat this and the previous element */
220 free(components
[pos
- 1]);
221 free(components
[pos
]);
222 memmove(&components
[pos
- 1], &components
[pos
+ 1],
223 sizeof(char *) * (components_len
- pos
));
234 char *lxc_deslashify(const char *path
)
244 parts
= lxc_normalize_path(dup
);
250 /* We'll end up here if path == "///" or path == "". */
254 lxc_free_array((void **)parts
, free
);
258 n
= strcspn(dup
, "/");
261 lxc_free_array((void **)parts
, free
);
271 p
= lxc_string_join("/", (const char **)parts
, *dup
== '/');
273 lxc_free_array((void **)parts
, free
);
277 char *lxc_append_paths(const char *first
, const char *second
)
279 __do_free
char *result
= NULL
;
282 int pattern_type
= 0;
284 len
= strlen(first
) + strlen(second
) + 1;
285 if (second
[0] != '/') {
290 result
= zalloc(len
);
294 if (pattern_type
== 0)
295 ret
= strnprintf(result
, len
, "%s%s", first
, second
);
297 ret
= strnprintf(result
, len
, "%s/%s", first
, second
);
301 return move_ptr(result
);
304 bool lxc_string_in_list(const char *needle
, const char *haystack
, char _sep
)
306 __do_free
char *str
= NULL
;
308 char sep
[2] = { _sep
, '\0' };
310 if (!haystack
|| !needle
)
313 str
= must_copy_string(haystack
);
314 lxc_iterate_parts(token
, str
, sep
)
315 if (strequal(needle
, token
))
321 char **lxc_string_split(const char *string
, char _sep
)
323 __do_free
char *str
= NULL
;
325 char sep
[2] = {_sep
, '\0'};
326 char **tmp
= NULL
, **result
= NULL
;
327 size_t result_capacity
= 0;
328 size_t result_count
= 0;
332 return calloc(1, sizeof(char *));
334 str
= must_copy_string(string
);
335 lxc_iterate_parts(token
, str
, sep
) {
336 r
= lxc_grow_array((void ***)&result
, &result_capacity
, result_count
+ 1, 16);
340 result
[result_count
] = strdup(token
);
341 if (!result
[result_count
])
347 /* if we allocated too much, reduce it */
348 tmp
= realloc(result
, (result_count
+ 1) * sizeof(char *));
354 /* Make sure we don't return uninitialized memory. */
355 if (result_count
== 0)
362 lxc_free_array((void **)result
, free
);
367 static bool complete_word(char ***result
, char *start
, char *end
, size_t *cap
,
372 r
= lxc_grow_array((void ***)result
, cap
, 2 + *cnt
, 16);
376 (*result
)[*cnt
] = strndup(start
, end
- start
);
377 if (!(*result
)[*cnt
])
386 * Given a a string 'one two "three four"', split into three words,
387 * one, two, and "three four"
389 char **lxc_string_split_quoted(char *string
)
391 char *nextword
= string
, *p
, state
;
392 char **result
= NULL
;
393 size_t result_capacity
= 0;
394 size_t result_count
= 0;
396 if (!string
|| !*string
)
397 return calloc(1, sizeof(char *));
399 // TODO I'm *not* handling escaped quote
401 for (p
= string
; *p
; p
++) {
406 else if (*p
== '"' || *p
== '\'') {
416 complete_word(&result
, nextword
, p
, &result_capacity
, &result_count
);
424 complete_word(&result
, nextword
+1, p
, &result_capacity
, &result_count
);
433 complete_word(&result
, nextword
, p
, &result_capacity
, &result_count
);
435 return realloc(result
, (result_count
+ 1) * sizeof(char *));
438 char **lxc_string_split_and_trim(const char *string
, char _sep
)
440 __do_free
char *str
= NULL
;
442 char sep
[2] = { _sep
, '\0' };
443 char **result
= NULL
;
444 size_t result_capacity
= 0;
445 size_t result_count
= 0;
450 return calloc(1, sizeof(char *));
452 str
= must_copy_string(string
);
453 lxc_iterate_parts(token
, str
, sep
) {
454 while (token
[0] == ' ' || token
[0] == '\t')
458 while (i
> 0 && (token
[i
- 1] == ' ' || token
[i
- 1] == '\t')) {
463 r
= lxc_grow_array((void ***)&result
, &result_capacity
, result_count
+ 1, 16);
467 result
[result_count
] = strdup(token
);
468 if (!result
[result_count
])
474 /* if we allocated too much, reduce it */
475 return realloc(result
, (result_count
+ 1) * sizeof(char *));
479 lxc_free_array((void **)result
, free
);
484 void lxc_free_array(void **array
, lxc_free_fn element_free_fn
)
488 for (p
= array
; p
&& *p
; p
++)
494 int lxc_grow_array(void ***array
, size_t *capacity
, size_t new_size
, size_t capacity_increment
)
499 /* first time around, catch some trivial mistakes of the user
500 * only initializing one of these */
501 if (!*array
|| !*capacity
) {
506 new_capacity
= *capacity
;
507 while (new_size
+ 1 > new_capacity
)
508 new_capacity
+= capacity_increment
;
510 if (new_capacity
!= *capacity
) {
511 /* we have to reallocate */
512 new_array
= realloc(*array
, new_capacity
* sizeof(void *));
516 memset(&new_array
[*capacity
], 0, (new_capacity
- (*capacity
)) * sizeof(void *));
518 *capacity
= new_capacity
;
521 /* array has sufficient elements */
525 size_t lxc_array_len(void **array
)
530 for (p
= array
; p
&& *p
; p
++)
536 void **lxc_append_null_to_array(void **array
, size_t count
)
540 /* Append NULL to the array */
542 temp
= realloc(array
, (count
+ 1) * sizeof(*array
));
545 for (i
= 0; i
< count
; i
++)
558 static int lxc_append_null_to_list(void ***list
)
564 for (; (*list
)[newentry
]; newentry
++) {
568 tmp
= realloc(*list
, (newentry
+ 2) * sizeof(void **));
573 (*list
)[newentry
+ 1] = NULL
;
578 int lxc_append_string(char ***list
, char *entry
)
583 newentry
= lxc_append_null_to_list((void ***)list
);
587 copy
= strdup(entry
);
591 (*list
)[newentry
] = copy
;
596 int lxc_safe_uint(const char *numstr
, unsigned int *converted
)
599 unsigned long int uli
;
601 while (isspace(*numstr
))
608 uli
= strtoul(numstr
, &err
, 0);
609 if (errno
== ERANGE
&& uli
== ULONG_MAX
)
612 if (err
== numstr
|| *err
!= '\0')
618 *converted
= (unsigned int)uli
;
622 int lxc_safe_ulong(const char *numstr
, unsigned long *converted
)
625 unsigned long int uli
;
627 while (isspace(*numstr
))
634 uli
= strtoul(numstr
, &err
, 0);
635 if (errno
== ERANGE
&& uli
== ULONG_MAX
)
638 if (err
== numstr
|| *err
!= '\0')
645 int lxc_safe_uint64(const char *numstr
, uint64_t *converted
, int base
)
650 while (isspace(*numstr
))
657 u
= strtoull(numstr
, &err
, base
);
658 if (errno
== ERANGE
&& u
== UINT64_MAX
)
661 if (err
== numstr
|| *err
!= '\0')
668 int lxc_safe_int64_residual(const char *numstr
, int64_t *converted
, int base
, char *residual
,
671 char *remaining
= NULL
;
674 if (residual
&& residual_len
== 0)
675 return ret_errno(EINVAL
);
677 if (!residual
&& residual_len
!= 0)
678 return ret_errno(EINVAL
);
680 memset(residual
, 0, residual_len
);
682 while (isspace(*numstr
))
686 u
= strtoll(numstr
, &remaining
, base
);
687 if (errno
== ERANGE
&& u
== INT64_MAX
)
690 if (remaining
== numstr
)
696 if (*remaining
== '\0')
699 len
= strlen(remaining
);
700 if (len
>= residual_len
)
703 memcpy(residual
, remaining
, len
);
704 } else if (*remaining
!= '\0') {
713 int lxc_safe_int(const char *numstr
, int *converted
)
719 sli
= strtol(numstr
, &err
, 0);
720 if (errno
== ERANGE
&& (sli
== LONG_MAX
|| sli
== LONG_MIN
))
723 if (errno
!= 0 && sli
== 0)
726 if (err
== numstr
|| *err
!= '\0')
729 if (sli
> INT_MAX
|| sli
< INT_MIN
)
732 *converted
= (int)sli
;
736 int lxc_safe_long(const char *numstr
, long int *converted
)
742 sli
= strtol(numstr
, &err
, 0);
743 if (errno
== ERANGE
&& (sli
== LONG_MAX
|| sli
== LONG_MIN
))
746 if (errno
!= 0 && sli
== 0)
749 if (err
== numstr
|| *err
!= '\0')
756 int lxc_safe_long_long(const char *numstr
, long long int *converted
)
759 signed long long int sli
;
762 sli
= strtoll(numstr
, &err
, 0);
763 if (errno
== ERANGE
&& (sli
== LLONG_MAX
|| sli
== LLONG_MIN
))
766 if (errno
!= 0 && sli
== 0)
769 if (err
== numstr
|| *err
!= '\0')
776 char *must_concat(size_t *len
, const char *first
, ...)
780 size_t cur_len
, it_len
;
782 dest
= must_copy_string(first
);
783 cur_len
= it_len
= strlen(first
);
785 va_start(args
, first
);
786 while ((cur
= va_arg(args
, char *)) != NULL
) {
787 it_len
= strlen(cur
);
789 dest
= must_realloc(dest
, cur_len
+ it_len
+ 1);
791 (void)memcpy(dest
+ cur_len
, cur
, it_len
);
796 dest
[cur_len
] = '\0';
802 char *must_make_path(const char *first
, ...)
806 size_t full_len
= strlen(first
);
810 dest
= must_copy_string(first
);
813 va_start(args
, first
);
814 while ((cur
= va_arg(args
, char *)) != NULL
) {
815 buf_len
= strlen(cur
);
823 dest
= must_realloc(dest
, full_len
+ 1);
826 memcpy(dest
+ cur_len
, "/", 1);
830 memcpy(dest
+ cur_len
, cur
, buf_len
);
835 dest
[cur_len
] = '\0';
839 char *must_append_path(char *first
, ...)
848 full_len
= strlen(first
);
851 va_start(args
, first
);
852 while ((cur
= va_arg(args
, char *)) != NULL
) {
853 buf_len
= strlen(cur
);
859 dest
= must_realloc(dest
, full_len
+ 1);
862 memcpy(dest
+ cur_len
, "/", 1);
866 memcpy(dest
+ cur_len
, cur
, buf_len
);
871 dest
[cur_len
] = '\0';
875 char *must_copy_string(const char *entry
)
889 void *must_realloc(void *orig
, size_t sz
)
894 ret
= realloc(orig
, sz
);
900 int parse_byte_size_string(const char *s
, long long int *converted
)
903 long long int conv
, mltpl
;
905 char dup
[INTTYPE_TO_STRLEN(long long int)];
906 char suffix
[3] = {0};
908 if (is_empty_string(s
))
909 return ret_errno(EINVAL
);
911 end
= stpncpy(dup
, s
, sizeof(dup
) - 1);
913 return ret_errno(EINVAL
);
915 if (isdigit(*(end
- 1)))
917 else if (isalpha(*(end
- 1)))
920 return ret_errno(EINVAL
);
922 if (suffix_len
> 0) {
923 if ((end
- 1) == dup
)
924 return ret_errno(EINVAL
);
926 if ((end
- 2) == dup
) {
927 if (isalpha(*(end
- 2)))
928 return ret_errno(EINVAL
);
931 if (isalpha(*(end
- 2))) /* 12MB */
937 memcpy(suffix
, end
- suffix_len
, suffix_len
);
938 *(suffix
+ suffix_len
) = '\0';
939 *(end
- suffix_len
) = '\0';
942 dup
[lxc_char_right_gc(dup
, strlen(dup
))] = '\0';
944 ret
= lxc_safe_long_long(dup
, &conv
);
948 if (suffix_len
!= 2) {
953 if (strcasecmp(suffix
, "KB") == 0)
955 else if (strcasecmp(suffix
, "MB") == 0)
957 else if (strcasecmp(suffix
, "GB") == 0)
958 mltpl
= 1024 * 1024 * 1024;
960 return ret_errno(EINVAL
);
962 if (check_mul_overflow(conv
, mltpl
, converted
))
963 return ret_errno(ERANGE
);
968 void remove_trailing_newlines(char *l
)
975 while (--p
>= l
&& *p
== '\n')
979 int lxc_char_left_gc(const char *buffer
, size_t len
)
983 for (i
= 0; i
< len
; i
++) {
984 if (buffer
[i
] == ' ' ||
994 int lxc_char_right_gc(const char *buffer
, size_t len
)
998 for (i
= len
- 1; i
>= 0; i
--) {
999 if (buffer
[i
] == ' ' ||
1000 buffer
[i
] == '\t' ||
1001 buffer
[i
] == '\n' ||
1011 char *lxc_trim_whitespace_in_place(char *buffer
)
1013 buffer
+= lxc_char_left_gc(buffer
, strlen(buffer
));
1014 buffer
[lxc_char_right_gc(buffer
, strlen(buffer
))] = '\0';
1018 int lxc_is_line_empty(const char *line
)
1021 size_t len
= strlen(line
);
1023 for (i
= 0; i
< len
; i
++)
1024 if (line
[i
] != ' ' && line
[i
] != '\t' &&
1025 line
[i
] != '\n' && line
[i
] != '\r' &&
1026 line
[i
] != '\f' && line
[i
] != '\0')
1031 void remove_trailing_slashes(char *p
)
1034 while (--l
>= 0 && (p
[l
] == '/' || p
[l
] == '\n'))