util: spelling fixes

Signed-off-by: Michael Tokarev <mjt@tls.msk.ru>
Reviewed-by: Philippe Mathieu-Daudé <philmd@linaro.org>
Message-ID: <20230823065335.1919380-3-mjt@tls.msk.ru>
Signed-off-by: Philippe Mathieu-Daudé <philmd@linaro.org>
This commit is contained in:
Michael Tokarev 2023-08-23 09:53:15 +03:00 committed by Philippe Mathieu-Daudé
parent c342a5d38c
commit d02d06f8f1
13 changed files with 18 additions and 18 deletions

View File

@ -1125,9 +1125,9 @@ typedef struct {
#define EFA_PARISC_1_1 0x0210 /* PA-RISC 1.1 big-endian. */ #define EFA_PARISC_1_1 0x0210 /* PA-RISC 1.1 big-endian. */
#define EFA_PARISC_2_0 0x0214 /* PA-RISC 2.0 big-endian. */ #define EFA_PARISC_2_0 0x0214 /* PA-RISC 2.0 big-endian. */
/* Additional section indeces. */ /* Additional section indices. */
#define SHN_PARISC_ANSI_COMMON 0xff00 /* Section for tenatively declared #define SHN_PARISC_ANSI_COMMON 0xff00 /* Section for tentatively declared
symbols in ANSI C. */ symbols in ANSI C. */
#define SHN_PARISC_HUGE_COMMON 0xff01 /* Common blocks in huge model. */ #define SHN_PARISC_HUGE_COMMON 0xff01 /* Common blocks in huge model. */

View File

@ -124,7 +124,7 @@ void qio_channel_socket_connect_async(QIOChannelSocket *ioc,
* qio_channel_socket_listen_sync: * qio_channel_socket_listen_sync:
* @ioc: the socket channel object * @ioc: the socket channel object
* @addr: the address to listen to * @addr: the address to listen to
* @num: the expected ammount of connections * @num: the expected amount of connections
* @errp: pointer to a NULL-initialized error object * @errp: pointer to a NULL-initialized error object
* *
* Attempt to listen to the address @addr. This method * Attempt to listen to the address @addr. This method
@ -141,7 +141,7 @@ int qio_channel_socket_listen_sync(QIOChannelSocket *ioc,
* qio_channel_socket_listen_async: * qio_channel_socket_listen_async:
* @ioc: the socket channel object * @ioc: the socket channel object
* @addr: the address to listen to * @addr: the address to listen to
* @num: the expected ammount of connections * @num: the expected amount of connections
* @callback: the function to invoke on completion * @callback: the function to invoke on completion
* @opaque: user data to pass to @callback * @opaque: user data to pass to @callback
* @destroy: the function to free @opaque * @destroy: the function to free @opaque

View File

@ -145,7 +145,7 @@ typedef void (*QIOTaskWorker)(QIOTask *task,
* The QIOTask module can also be used to perform operations * The QIOTask module can also be used to perform operations
* in a background thread context, while still reporting the * in a background thread context, while still reporting the
* results in the main event thread. This allows code which * results in the main event thread. This allows code which
* cannot easily be rewritten to be asychronous (such as DNS * cannot easily be rewritten to be asynchronous (such as DNS
* lookups) to be easily run non-blocking. Reporting the * lookups) to be easily run non-blocking. Reporting the
* results in the main thread context means that the caller * results in the main thread context means that the caller
* typically does not need to be concerned about thread * typically does not need to be concerned about thread

View File

@ -15,7 +15,7 @@
* Currently the iova tree will only allow to keep ranges * Currently the iova tree will only allow to keep ranges
* information, and no extra user data is allowed for each element. A * information, and no extra user data is allowed for each element. A
* benefit is that we can merge adjacent ranges internally within the * benefit is that we can merge adjacent ranges internally within the
* tree. It can save a lot of memory when the ranges are splitted but * tree. It can save a lot of memory when the ranges are split but
* mostly continuous. * mostly continuous.
* *
* Note that current implementation does not provide any thread * Note that current implementation does not provide any thread
@ -128,7 +128,7 @@ const DMAMap *iova_tree_find_address(const IOVATree *tree, hwaddr iova);
* iova_tree_foreach: * iova_tree_foreach:
* *
* @tree: the iova tree to iterate on * @tree: the iova tree to iterate on
* @iterator: the interator for the mappings, return true to stop * @iterator: the iterator for the mappings, return true to stop
* *
* Iterate over the iova tree. * Iterate over the iova tree.
* *

View File

@ -25,7 +25,7 @@ typedef void (YankFn)(void *opaque);
* @instance: The instance. * @instance: The instance.
* @errp: Error object. * @errp: Error object.
* *
* Returns true on success or false if an error occured. * Returns true on success or false if an error occurred.
*/ */
bool yank_register_instance(const YankInstance *instance, Error **errp); bool yank_register_instance(const YankInstance *instance, Error **errp);

View File

@ -1,6 +1,6 @@
/* /*
* SPDX-License-Identifier: GPL-2.0-or-later * SPDX-License-Identifier: GPL-2.0-or-later
* Host specific cpu indentification for AArch64. * Host specific cpu identification for AArch64.
*/ */
#include "qemu/osdep.h" #include "qemu/osdep.h"
@ -33,7 +33,7 @@ static bool sysctl_for_bool(const char *name)
/* /*
* We might in the future ask for properties not present in older kernels, * We might in the future ask for properties not present in older kernels,
* but we're only asking about static properties, all of which should be * but we're only asking about static properties, all of which should be
* 'int'. So we shouln't see ENOMEM (val too small), or any of the other * 'int'. So we shouldn't see ENOMEM (val too small), or any of the other
* more exotic errors. * more exotic errors.
*/ */
assert(errno == ENOENT); assert(errno == ENOENT);

View File

@ -1,6 +1,6 @@
/* /*
* SPDX-License-Identifier: GPL-2.0-or-later * SPDX-License-Identifier: GPL-2.0-or-later
* Host specific cpu indentification for x86. * Host specific cpu identification for x86.
*/ */
#include "qemu/osdep.h" #include "qemu/osdep.h"
@ -74,7 +74,7 @@ unsigned __attribute__((constructor)) cpuinfo_init(void)
* of their memory operands to be 16-byte aligned. * of their memory operands to be 16-byte aligned.
* *
* AMD has provided an even stronger guarantee that processors * AMD has provided an even stronger guarantee that processors
* with AVX provide 16-byte atomicity for all cachable, * with AVX provide 16-byte atomicity for all cacheable,
* naturally aligned single loads and stores, e.g. MOVDQU. * naturally aligned single loads and stores, e.g. MOVDQU.
* *
* See https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104688 * See https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104688

View File

@ -1,6 +1,6 @@
/* /*
* SPDX-License-Identifier: GPL-2.0-or-later * SPDX-License-Identifier: GPL-2.0-or-later
* Host specific cpu indentification for ppc. * Host specific cpu identification for ppc.
*/ */
#include "qemu/osdep.h" #include "qemu/osdep.h"

View File

@ -47,7 +47,7 @@
*/ */
/* /*
* Disable CFI checks. * Disable CFI checks.
* We are going to call a signal hander directly. Such handler may or may not * We are going to call a signal handler directly. Such handler may or may not
* have been defined in our binary, so there's no guarantee that the pointer * have been defined in our binary, so there's no guarantee that the pointer
* used to set the handler is a cfi-valid pointer. Since the handlers are * used to set the handler is a cfi-valid pointer. Since the handlers are
* stored in kernel memory, changing the handler to an attacker-defined * stored in kernel memory, changing the handler to an attacker-defined

View File

@ -671,7 +671,7 @@ void qemu_free_stack(void *stack, size_t sz)
/* /*
* Disable CFI checks. * Disable CFI checks.
* We are going to call a signal hander directly. Such handler may or may not * We are going to call a signal handler directly. Such handler may or may not
* have been defined in our binary, so there's no guarantee that the pointer * have been defined in our binary, so there's no guarantee that the pointer
* used to set the handler is a cfi-valid pointer. Since the handlers are * used to set the handler is a cfi-valid pointer. Since the handlers are
* stored in kernel memory, changing the handler to an attacker-defined * stored in kernel memory, changing the handler to an attacker-defined

View File

@ -210,7 +210,7 @@ void qdist_bin__internal(struct qdist *to, const struct qdist *from, size_t n)
/* /*
* To avoid double-counting we capture [left, right) ranges, except for * To avoid double-counting we capture [left, right) ranges, except for
* the righmost bin, which captures a [left, right] range. * the rightmost bin, which captures a [left, right] range.
*/ */
while (j < from->n && (from->entries[j].x < right || i == n - 1)) { while (j < from->n && (from->entries[j].x < right || i == n - 1)) {
struct qdist_entry *o = &from->entries[j]; struct qdist_entry *o = &from->entries[j];

View File

@ -929,7 +929,7 @@ static int unix_listen_saddr(UnixSocketAddress *saddr,
if (pathbuf != NULL) { if (pathbuf != NULL) {
/* /*
* This dummy fd usage silences the mktemp() unsecure warning. * This dummy fd usage silences the mktemp() insecure warning.
* Using mkstemp() doesn't make things more secure here * Using mkstemp() doesn't make things more secure here
* though. bind() complains about existing files, so we have * though. bind() complains about existing files, so we have
* to unlink first and thus re-open the race window. The * to unlink first and thus re-open the race window. The

View File

@ -355,7 +355,7 @@ void drain_call_rcu(void)
* *
* Note that since we have only one global queue of the RCU callbacks, * Note that since we have only one global queue of the RCU callbacks,
* we also end up waiting for most of RCU callbacks that were registered * we also end up waiting for most of RCU callbacks that were registered
* on the other threads, but this is a side effect that shoudn't be * on the other threads, but this is a side effect that shouldn't be
* assumed. * assumed.
*/ */