treewide: fix a few typos in NEWS, docs and comments
This commit is contained in:
+1
-1
@@ -418,7 +418,7 @@ typedef struct {
|
||||
|
||||
assert_cc(sizeof(dummy_t) == 0);
|
||||
|
||||
/* A little helper for subtracting 1 off a pointer in a safe UB-free way. This is intended to be used for for
|
||||
/* A little helper for subtracting 1 off a pointer in a safe UB-free way. This is intended to be used for
|
||||
* loops that count down from a high pointer until some base. A naive loop would implement this like this:
|
||||
*
|
||||
* for (p = end-1; p >= base; p--) …
|
||||
|
||||
@@ -329,7 +329,7 @@ int unit_file_resolve_symlink(
|
||||
|
||||
assert(path_is_absolute(simplified));
|
||||
|
||||
/* Check if the symlink remain inside of of our search path.
|
||||
/* Check if the symlink remain inside of our search path.
|
||||
* If yes, it is an alias. Verify that it is valid.
|
||||
*
|
||||
* If no, then this is a linked unit file or mask, and we don't care about the target name
|
||||
|
||||
+1
-1
@@ -892,7 +892,7 @@ static int device_setup_units(Manager *m, sd_device *dev, Set **ready_units, Set
|
||||
|
||||
/* First, process the main (that is, points to the syspath) and (real, not symlink) devnode units. */
|
||||
if (device_for_action(dev, SD_DEVICE_REMOVE))
|
||||
/* If the device is removed, the main and devnode units units will be removed by
|
||||
/* If the device is removed, the main and devnode units will be removed by
|
||||
* device_update_found_by_sysfs() in device_dispatch_io(). Hence, it is not necessary to
|
||||
* store them to not_ready_units, and we have nothing to do here.
|
||||
*
|
||||
|
||||
+1
-1
@@ -2994,7 +2994,7 @@ static int manager_dispatch_idle_pipe_fd(sd_event_source *source, int fd, uint32
|
||||
* on services that want to own the console exclusively without our interference. */
|
||||
m->no_console_output = m->n_on_console > 0;
|
||||
|
||||
/* Acknowledge the child's request, and let all all other children know too that they shouldn't wait
|
||||
/* Acknowledge the child's request, and let all other children know too that they shouldn't wait
|
||||
* any longer by closing the pipes towards them, which is what they are waiting for. */
|
||||
manager_close_idle_pipe(m);
|
||||
|
||||
|
||||
@@ -2242,7 +2242,7 @@ static int home_get_disk_status_luks(
|
||||
* that case the image is pre-allocated and thus appears all used from the host PoV but is not used
|
||||
* up at all yet from the user's PoV.
|
||||
*
|
||||
* That said, we use use the stat() reported loopback file size as upper boundary: our footprint can
|
||||
* That said, we use the stat() reported loopback file size as upper boundary: our footprint can
|
||||
* never be larger than what we take up on the lowest layers. */
|
||||
|
||||
if (disk_size != UINT64_MAX && disk_size > disk_free) {
|
||||
|
||||
+1
-1
@@ -2516,7 +2516,7 @@ static int setup_kmsg(int fd_inner_socket) {
|
||||
|
||||
BLOCK_WITH_UMASK(0000);
|
||||
|
||||
/* We create the kmsg FIFO as as temporary file in /run, but immediately delete it after bind mounting it to
|
||||
/* We create the kmsg FIFO as a temporary file in /run, but immediately delete it after bind mounting it to
|
||||
* /proc/kmsg. While FIFOs on the reading side behave very similar to /proc/kmsg, their writing side behaves
|
||||
* differently from /dev/kmsg in that writing blocks when nothing is reading. In order to avoid any problems
|
||||
* with containers deadlocking due to this we simply make /dev/kmsg unavailable to the container. */
|
||||
|
||||
+1
-1
@@ -351,7 +351,7 @@ static int run(int argc, char *argv[]) {
|
||||
return r;
|
||||
|
||||
/* Handle each pstore file */
|
||||
/* Sort files lexigraphically ascending, generally needed by all */
|
||||
/* Sort files lexicographically ascending, generally needed by all */
|
||||
typesafe_qsort(list.entries, list.n_entries, compare_pstore_entries);
|
||||
|
||||
/* Process known file types */
|
||||
|
||||
@@ -348,7 +348,7 @@ static int dnssec_ecdsa_verify_raw(
|
||||
if (!s)
|
||||
return -EIO;
|
||||
|
||||
/* TODO: We should eventually use use the EVP API once it supports ECDSA signature verification */
|
||||
/* TODO: We should eventually use the EVP API once it supports ECDSA signature verification */
|
||||
|
||||
sig = ECDSA_SIG_new();
|
||||
if (!sig)
|
||||
|
||||
@@ -2868,7 +2868,7 @@ static int normalize_linked_files(
|
||||
char ***ret_files) {
|
||||
|
||||
/* This is similar to normalize_filenames()/normalize_names() in src/systemctl/,
|
||||
* but operates on real unit names. For each argument we we look up the actual path
|
||||
* but operates on real unit names. For each argument we look up the actual path
|
||||
* where the unit is found. This way linked units can be re-enabled successfully. */
|
||||
|
||||
_cleanup_strv_free_ char **files = NULL, **names = NULL;
|
||||
|
||||
@@ -38,7 +38,7 @@ static void test_xescape_full_one(bool eight_bits) {
|
||||
if (i >= full_fit)
|
||||
assert_se(streq(t, escaped));
|
||||
else if (i >= 3) {
|
||||
/* We need up to four columns, so up to three three columns may be wasted */
|
||||
/* We need up to four columns, so up to three columns may be wasted */
|
||||
assert_se(strlen(t) == i || strlen(t) == i - 1 || strlen(t) == i - 2 || strlen(t) == i - 3);
|
||||
assert_se(strneq(t, escaped, i - 3) || strneq(t, escaped, i - 4) ||
|
||||
strneq(t, escaped, i - 5) || strneq(t, escaped, i - 6));
|
||||
|
||||
+1
-1
@@ -518,7 +518,7 @@ def make_uki(opts):
|
||||
uki = UKI(opts.stub)
|
||||
initrd = join_initrds(opts.initrd)
|
||||
|
||||
# TODO: derive public key from from opts.pcr_private_keys?
|
||||
# TODO: derive public key from opts.pcr_private_keys?
|
||||
pcrpkey = opts.pcrpkey
|
||||
if pcrpkey is None:
|
||||
if opts.pcr_public_keys and len(opts.pcr_public_keys) == 1:
|
||||
|
||||
Reference in New Issue
Block a user