docs: spelling and grammar fixes

Signed-off-by: Ville Skyttä <ville.skytta@iki.fi>

docs/reference/gio/migrating-gconf.md

@@ -131,7 +131,7 @@ need assistance in some cases.
 
 Running `gsettings-schema-convert --gconf --xml --schema-id
 "org.gnome.font-rendering" --output org.gnome.font-rendering.gschema.xml
-destop_gnome_font_rendering.schemas` on the following
+desktop_gnome_font_rendering.schemas` on the following
 `desktop_gnome_font_rendering.schemas` file:
 
 ```xml

docs/reference/gio/migrating-gdbus.md

@@ -144,7 +144,7 @@ on_name_acquired (GDBusConnection *connection,
 ```
 
 Note that `g_bus_own_name()` works asynchronously and requires you to enter
-your mainloop to await the `on_name_aquired()` callback. Also note that in
+your mainloop to await the `on_name_acquired()` callback. Also note that in
 order to avoid race conditions (e.g. when your service is activated by a
 method call), you have to export your manager object before acquiring the
 name. The `on_bus_acquired()` callback is the right place to do such

docs/reference/glib/conversion-macros.md

@@ -217,63 +217,63 @@ side-effects.
 : Converts a `size_t` value from host byte order to little-endian.
 
 `GUINT16_FROM_BE(value)`
-: Converts an `uint16_t` value from big-endian to host byte order.
+: Converts a `uint16_t` value from big-endian to host byte order.
 
 `GUINT16_FROM_LE(value)`
-: Converts an `uint16_t` value from little-endian to host byte order.
+: Converts a `uint16_t` value from little-endian to host byte order.
 
 `GUINT16_TO_BE(value)`
-: Converts an `uint16_t` value from host byte order to big-endian.
+: Converts a `uint16_t` value from host byte order to big-endian.
 
 `GUINT16_TO_LE(value)`
-: Converts an `uint16_t` value from host byte order to little-endian.
+: Converts a `uint16_t` value from host byte order to little-endian.
 
 `GUINT32_FROM_BE(value)`
-: Converts an `uint32_t` value from big-endian to host byte order.
+: Converts a `uint32_t` value from big-endian to host byte order.
 
 `GUINT32_FROM_LE(value)`
-: Converts an `uint32_t` value from little-endian to host byte order.
+: Converts a `uint32_t` value from little-endian to host byte order.
 
 `GUINT32_TO_BE(value)`
-: Converts an `uint32_t` value from host byte order to big-endian.
+: Converts a `uint32_t` value from host byte order to big-endian.
 
 `GUINT32_TO_LE(value)`
-: Converts an `uint32_t` value from host byte order to little-endian.
+: Converts a `uint32_t` value from host byte order to little-endian.
 
 `GUINT64_FROM_BE(value)`
-: Converts an `uint64_t` value from big-endian to host byte order.
+: Converts a `uint64_t` value from big-endian to host byte order.
 
 `GUINT64_FROM_LE(value)`
-: Converts an `uint64_t` value from little-endian to host byte order.
+: Converts a `uint64_t` value from little-endian to host byte order.
 
 `GUINT64_TO_BE(value)`
-: Converts an `uint64_t` value from host byte order to big-endian.
+: Converts a `uint64_t` value from host byte order to big-endian.
 
 `GUINT64_TO_LE(value)`
-: Converts an `uint64_t` value from host byte order to little-endian.
+: Converts a `uint64_t` value from host byte order to little-endian.
 
 `GUINT16_SWAP_BE_PDP(value)`
-: Converts an `uint16_t` value between big-endian and pdp-endian byte order.
+: Converts a `uint16_t` value between big-endian and pdp-endian byte order.
   The conversion is symmetric so it can be used both ways.
 
 `GUINT16_SWAP_LE_BE(value)`
-: Converts an `uint16_t` value between little-endian and big-endian byte order.
+: Converts a `uint16_t` value between little-endian and big-endian byte order.
   The conversion is symmetric so it can be used both ways.
 
 `GUINT16_SWAP_LE_PDP(value)`
-: Converts an `uint16_t` value between little-endian and pdp-endian byte order.
+: Converts a `uint16_t` value between little-endian and pdp-endian byte order.
   The conversion is symmetric so it can be used both ways.
 
 `GUINT32_SWAP_BE_PDP(value)`
-: Converts an `uint32_t` value between big-endian and pdp-endian byte order.
+: Converts a `uint32_t` value between big-endian and pdp-endian byte order.
   The conversion is symmetric so it can be used both ways.
 
 `GUINT32_SWAP_LE_BE(value)`
-: Converts an `uint32_t` value between little-endian and big-endian byte order.
+: Converts a `uint32_t` value between little-endian and big-endian byte order.
   The conversion is symmetric so it can be used both ways.
 
 `GUINT32_SWAP_LE_PDP(value)`
-: Converts an `uint32_t` value between little-endian and pdp-endian byte order.
+: Converts a `uint32_t` value between little-endian and pdp-endian byte order.
   The conversion is symmetric so it can be used both ways.
 
 `GUINT64_SWAP_LE_BE(value)`

docs/reference/glib/data-structures.md

@@ -12,7 +12,7 @@ SPDX-FileCopyrightText: 2020 Endless OS Foundation, LLC
 
 # Data Structures
 
-GLib includes a number of basic data sructures, such as arrays, linked lists, hash tables,
+GLib includes a number of basic data structures, such as arrays, linked lists, hash tables,
 queues, trees, etc.
 
 ## Arrays
@@ -506,7 +506,7 @@ person_details_from_data (const char *data)
 In the example above, we have multiple functions taking the same strings for different uses; with typical
 C strings, we'd have to copy the strings every time the life time rules of the data differ from the
 life-time of the string parsed from the original buffer. With reference counted strings, each caller can
-ake a reference on the data, and keep it as long as it needs to own the string.
+take a reference on the data, and keep it as long as it needs to own the string.
 
 Reference-counted strings can also be "interned" inside a global table owned by GLib; while an interned
 string has at least a reference, creating a new interned reference-counted string with the same contents

docs/reference/glib/gvariant-specification-1.0.rst

@@ -73,7 +73,7 @@ Some of these changes are under consideration for inclusion into D-Bus [#f2]_.
          special value outside of that range, called ``NULL``, ``Nothing``, ``None`` or similar. In most languages with reference
          or pointer types, these types are nullable. Some languages have the ability to have nullable versions of
          any type (for example, “``Maybe Int``” in Haskell and “``int? i;``” in C#).
-.. [#f2] Considerable discussion has been made in face-to-face meetings and some discussion has also occured
+.. [#f2] Considerable discussion has been made in face-to-face meetings and some discussion has also occurred
          on the D-Bus mailing list: http://lists.freedesktop.org/archives/dbus/2007-August/008290.html
 
 Enumeration of Types

gio/gapplication.c

@@ -160,7 +160,7 @@
  *
  * To parse commandline arguments you may handle the
  * [signal@Gio.Application::command-line] signal or override the
- * [vfunc@Gio.Application.local_command_line] virtual funcion, to parse them in
+ * [vfunc@Gio.Application.local_command_line] virtual function, to parse them in
  * either the primary instance or the local instance, respectively.
  *
  * For an example of opening files with a `GApplication`, see

gio/gdbusintrospection.h

@@ -79,7 +79,7 @@ struct _GDBusArgInfo
  * @out_args: (array zero-terminated=1): A pointer to a %NULL-terminated array of pointers to #GDBusArgInfo structures or %NULL if there are no out arguments.
  * @annotations: (array zero-terminated=1): A pointer to a %NULL-terminated array of pointers to #GDBusAnnotationInfo structures or %NULL if there are no annotations.
  *
- * Information about a method on an D-Bus interface.
+ * Information about a method on a D-Bus interface.
  *
  * Since: 2.26
  */

gio/gmenu.c

@@ -1182,7 +1182,7 @@ g_menu_item_new_submenu (const gchar *label,
  * the menu that @menu_item is added to.
  *
  * Visual separation is typically displayed between two non-empty
- * sections.  If @label is non-%NULL then it will be encorporated into
+ * sections.  If @label is non-%NULL then it will be incorporated into
  * this visual indication.  This allows for labeled subsections of a
  * menu.
  *

gio/gsocketclient.c

@@ -1025,7 +1025,7 @@ g_socket_client_emit_event (GSocketClient       *client,
 		 event, connectable, connection);
 }
 
-/* Originally, GSocketClient returned whatever error occured last. Turns
+/* Originally, GSocketClient returned whatever error occurred last. Turns
  * out this doesn't work well in practice. Consider the following case:
  * DNS returns an IPv4 and IPv6 address. First we'll connect() to the
  * IPv4 address, and say that succeeds, but TLS is enabled and the TLS

gio/gvfs.h

@@ -42,11 +42,11 @@ G_BEGIN_DECLS
  * GVfsFileLookupFunc:
  * @vfs: a #GVfs
  * @identifier: the identifier to look up a #GFile for. This can either
- *     be an URI or a parse name as returned by g_file_get_parse_name()
+ *     be a URI or a parse name as returned by g_file_get_parse_name()
  * @user_data: user data passed to the function
  *
  * This function type is used by g_vfs_register_uri_scheme() to make it
- * possible for a client to associate an URI scheme to a different #GFile
+ * possible for a client to associate a URI scheme to a different #GFile
  * implementation.
  *
  * The client should return a reference to the new file that has been

gio/gwin32appinfo.c

@@ -1649,7 +1649,7 @@ process_uwp_verbs (GList                    *verbs,
           acid_len > sizeof (gunichar2))
         {
           /* TODO: default value of a shell subkey, if not empty,
-           * migh contain something like @{Some.Identifier_1234.456.678.789_some_words?ms-resource://Arbitrary.Path/Pointing/Somewhere}
+           * might contain something like @{Some.Identifier_1234.456.678.789_some_words?ms-resource://Arbitrary.Path/Pointing/Somewhere}
            * and it might be possible to turn it into a nice displayname.
            */
           uwp_handler_add_verb (handler_rec,

gio/gwin32networkmonitor.c

@@ -86,7 +86,7 @@ win_network_monitor_get_ip_info (const IP_ADDRESS_PREFIX  *prefix,
   switch (prefix->Prefix.si_family)
     {
       case AF_UNSPEC:
-        /* Fall-through: AF_UNSPEC deliveres both IPV4 and IPV6 infos, let`s stick with IPV4 here */
+        /* Fall-through: AF_UNSPEC delivers both IPV4 and IPV6 infos, let`s stick with IPV4 here */
       case AF_INET:
         *family = G_SOCKET_FAMILY_IPV4;
         *dest = (guint8 *) &(prefix->Prefix.Ipv4.sin_addr);

girepository/cmph/bdz.c

@@ -694,7 +694,7 @@ cmph_uint32 bdz_packed_size(cmph_t *mphf)
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 bdz_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen)

girepository/cmph/bdz.h

@@ -35,7 +35,7 @@ cmph_uint32 bdz_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 bdz_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/bdz_ph.c

@@ -596,7 +596,7 @@ cmph_uint32 bdz_ph_packed_size(cmph_t *mphf)
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 bdz_ph_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen)

girepository/cmph/bdz_ph.h

@@ -34,7 +34,7 @@ cmph_uint32 bdz_ph_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 bdz_ph_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/bitbool.h

@@ -14,29 +14,29 @@ static const cmph_uint8 valuemask[] = { 0xfc, 0xf3, 0xcf, 0x3f};
 
 
 /** \def GETBIT(array, i)
- *  \brief get the value of an 1-bit integer stored in an array. 
+ *  \brief get the value of a 1-bit integer stored in an array.
  *  \param array to get 1-bit integer values from
  *  \param i is the index in array to get the 1-bit integer value from
  * 
- * GETBIT(array, i) is a macro that gets the value of an 1-bit integer stored in array.
+ * GETBIT(array, i) is a macro that gets the value of a 1-bit integer stored in array.
  */
 #define GETBIT(array, i) ((array[i >> 3] & bitmask[i & 0x00000007]) >> (i & 0x00000007))
 
 /** \def SETBIT(array, i)
- *  \brief set 1 to an 1-bit integer stored in an array. 
+ *  \brief set 1 to a 1-bit integer stored in an array.
  *  \param array to store 1-bit integer values
  *  \param i is the index in array to set the the bit to 1
  * 
- * SETBIT(array, i) is a macro that sets 1 to an 1-bit integer stored in an array.
+ * SETBIT(array, i) is a macro that sets 1 to a 1-bit integer stored in an array.
  */
 #define SETBIT(array, i) (array[i >> 3] |= bitmask[i & 0x00000007])
 
 /** \def UNSETBIT(array, i)
- *  \brief set 0 to an 1-bit integer stored in an array. 
+ *  \brief set 0 to a 1-bit integer stored in an array.
  *  \param array to store 1-bit integer values
  *  \param i is the index in array to set the the bit to 0
  * 
- * UNSETBIT(array, i) is a macro that sets 0 to an 1-bit integer stored in an array.
+ * UNSETBIT(array, i) is a macro that sets 0 to a 1-bit integer stored in an array.
  */
 #define UNSETBIT(array, i) (array[i >> 3] ^= ((bitmask[i & 0x00000007])))
 
@@ -82,29 +82,29 @@ static const cmph_uint8 valuemask[] = { 0xfc, 0xf3, 0xcf, 0x3f};
 
 
 /** \def SETBIT32(array, i)
- *  \brief set 1 to an 1-bit integer stored in an array of 32-bit words. 
+ *  \brief set 1 to a 1-bit integer stored in an array of 32-bit words.
  *  \param array to store 1-bit integer values. The entries are 32-bit words.
  *  \param i is the index in array to set the the bit to 1
  * 
- * SETBIT32(array, i) is a macro that sets 1 to an 1-bit integer stored in an array of 32-bit words.
+ * SETBIT32(array, i) is a macro that sets 1 to a 1-bit integer stored in an array of 32-bit words.
  */
 #define SETBIT32(array, i) (array[i >> 5] |= bitmask32[i & 0x0000001f])
 
 /** \def GETBIT32(array, i)
- *  \brief get the value of an 1-bit integer stored in an array of 32-bit words. 
+ *  \brief get the value of a 1-bit integer stored in an array of 32-bit words.
  *  \param array to get 1-bit integer values from. The entries are 32-bit words.
  *  \param i is the index in array to get the 1-bit integer value from
  * 
- * GETBIT32(array, i) is a macro that gets the value of an 1-bit integer stored in an array of 32-bit words.
+ * GETBIT32(array, i) is a macro that gets the value of a 1-bit integer stored in an array of 32-bit words.
  */
 #define GETBIT32(array, i) (array[i >> 5] & bitmask32[i & 0x0000001f])
 
 /** \def UNSETBIT32(array, i)
- *  \brief set 0 to an 1-bit integer stored in an array of 32-bit words. 
+ *  \brief set 0 to a 1-bit integer stored in an array of 32-bit words.
  *  \param array to store 1-bit integer values. The entries ar 32-bit words
  *  \param i is the index in array to set the the bit to 0
  * 
- * UNSETBIT32(array, i) is a macro that sets 0 to an 1-bit integer stored in an array of 32-bit words.
+ * UNSETBIT32(array, i) is a macro that sets 0 to a 1-bit integer stored in an array of 32-bit words.
  */
 #define UNSETBIT32(array, i) (array[i >> 5] ^= ((bitmask32[i & 0x0000001f])))
 

girepository/cmph/bmz.c

@@ -610,7 +610,7 @@ cmph_uint32 bmz_packed_size(cmph_t *mphf)
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 bmz_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen)

girepository/cmph/bmz.h

@@ -34,7 +34,7 @@ cmph_uint32 bmz_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 bmz_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/bmz8.c

@@ -618,7 +618,7 @@ cmph_uint32 bmz8_packed_size(cmph_t *mphf)
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint8 bmz8_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen)

girepository/cmph/bmz8.h

@@ -34,7 +34,7 @@ cmph_uint32 bmz8_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint8 bmz8_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/brz.c

@@ -983,7 +983,7 @@ static cmph_uint32 brz_fch_search_packed(cmph_uint32 *packed_mphf, const char *k
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 brz_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen)

girepository/cmph/brz.h

@@ -39,7 +39,7 @@ cmph_uint32 brz_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 brz_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/chd.h

@@ -51,7 +51,7 @@ cmph_uint32 chd_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 chd_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/chd_ph.h

@@ -51,7 +51,7 @@ cmph_uint32 chd_ph_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 chd_ph_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/chm.c

@@ -364,7 +364,7 @@ cmph_uint32 chm_packed_size(cmph_t *mphf)
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 chm_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen)

girepository/cmph/chm.h

@@ -34,7 +34,7 @@ cmph_uint32 chm_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 chm_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/cmph.c

@@ -810,7 +810,7 @@ cmph_uint32 cmph_packed_size(cmph_t *mphf)
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 cmph_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen)

girepository/cmph/cmph.h

@@ -65,7 +65,7 @@ cmph_t *cmph_new(cmph_config_t *mph);
  *  \brief Computes the mphf value. 
  *  \param mphf pointer to the resulting function
  *  \param key is the key to be hashed
- *  \param keylen is the key legth in bytes
+ *  \param keylen is the key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 cmph_search(cmph_t *mphf, const char *key, cmph_uint32 keylen);
@@ -96,7 +96,7 @@ cmph_uint32 cmph_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 cmph_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/compressed_rank.h

@@ -7,7 +7,7 @@ struct _compressed_rank_t
 {
 	cmph_uint32 max_val;
 	cmph_uint32 n; // number of values stored in vals_rems
-	// The length in bits of each value is decomposed into two compnents: the lg(n) MSBs are stored in rank_select data structure
+	// The length in bits of each value is decomposed into two components: the lg(n) MSBs are stored in rank_select data structure
 	// the remaining LSBs are stored in a table of n cells, each one of rem_r bits.
 	cmph_uint32 rem_r;
 	select_t sel;

girepository/cmph/compressed_seq.h

@@ -6,7 +6,7 @@
 struct _compressed_seq_t
 {
 	cmph_uint32 n; // number of values stored in store_table
-	// The length in bits of each value is decomposed into two compnents: the lg(n) MSBs are stored in rank_select data structure
+	// The length in bits of each value is decomposed into two components: the lg(n) MSBs are stored in rank_select data structure
 	// the remaining LSBs are stored in a table of n cells, each one of rem_r bits.
 	cmph_uint32 rem_r;
 	cmph_uint32 total_length; // total length in bits of stored_table
@@ -32,7 +32,7 @@ void compressed_seq_destroy(compressed_seq_t * cs);
 /** \fn void compressed_seq_generate(compressed_seq_t * cs, cmph_uint32 * vals_table, cmph_uint32 n);
  *  \brief Generate a compressed sequence from an input array with n values.
  *  \param cs points to the compressed sequence structure
- *  \param vals_table poiter to the array given as input
+ *  \param vals_table pointer to the array given as input
  *  \param n number of values in @see vals_table
  */
 void compressed_seq_generate(compressed_seq_t * cs, cmph_uint32 * vals_table, cmph_uint32 n);

girepository/cmph/fch.c

@@ -500,7 +500,7 @@ cmph_uint32 fch_packed_size(cmph_t *mphf)
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 fch_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen)

girepository/cmph/fch.h

@@ -40,7 +40,7 @@ cmph_uint32 fch_packed_size(cmph_t *mphf);
  *  \brief Use the packed mphf to do a search. 
  *  \param  packed_mphf pointer to the packed mphf
  *  \param key key to be hashed
- *  \param keylen key legth in bytes
+ *  \param keylen key length in bytes
  *  \return The mphf value
  */
 cmph_uint32 fch_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);

girepository/cmph/main.c

@@ -60,7 +60,7 @@ void usage_long(const char *prg)
 	fprintf(stderr, "  -t\t set the number of keys per bin for a t-perfect hashing function. A t-perfect\n");	
 	fprintf(stderr, "    \t hash function allows at most t collisions in a given bin. This parameter applies\n");
 	fprintf(stderr, "    \t only to the CHD and CHD_PH algorithms. Its value should be an integer in the\n");
-	fprintf(stderr, "    \t range [1,128]. Defaul is 1\n");
+	fprintf(stderr, "    \t range [1,128]. Default is 1\n");
 	fprintf(stderr, "  keysfile\t line separated file with keys\n");
 }
 

girepository/gitypelib-internal.h

@@ -449,7 +449,7 @@ typedef union _SimpleTypeBlob SimpleTypeBlob;
  * @out: The parameter is used to return an output of the function. Parameters
  *   can be both in and out. Out parameters implicitly add another level of
  *   indirection to the parameter type. Ie if the type is uint32 in an out
- *   parameter, the function actually takes an uint32*.
+ *   parameter, the function actually takes a uint32*.
  * @caller_allocates: The parameter is a pointer to a struct or object that
  *   will receive an output of the function.
  * @nullable: Only meaningful for types which are passed as pointers. For an
@@ -478,7 +478,7 @@ typedef union _SimpleTypeBlob SimpleTypeBlob;
  * @reserved: Reserved for future use.
  * @closure: Index of the closure (user_data) parameter associated with the
  *   callback, or -1.
- * @destroy: Index of the destroy notfication callback parameter associated
+ * @destroy: Index of the destroy notification callback parameter associated
  *   with the callback, or -1.
  * @padding: TODO
  * @arg_type: Describes the type of the parameter. See details below.
@@ -1360,7 +1360,7 @@ gboolean  gi_typelib_matches_gtype_name_prefix (GITypelib   *typelib,
  * @GI_TYPELIB_ERROR_INVALID_ENTRY: a typelib entry is invalid
  * @GI_TYPELIB_ERROR_INVALID_BLOB: a typelib blob is invalid
  *
- * A error set while validating the #GITypelib
+ * An error set while validating the #GITypelib
  *
  * Since: 2.80
  */

girepository/gthash.c

@@ -40,7 +40,7 @@
  * quality, well documented, and easy to embed.
  *
  * CMPH provides a number of algorithms; I chose BDZ, because while CHD
- * appears to be the "best", the simplicitly of BDZ appealed, and really,
+ * appears to be the "best", the simplicity of BDZ appealed, and really,
  * we're only talking about thousands of strings here, not millions, so
  * a few microseconds is no big deal.
  *

glib/gconvert.c

@@ -76,7 +76,7 @@ try_conversion (const char *to_codeset,
 
 #if defined(__FreeBSD__) && defined(ICONV_SET_ILSEQ_INVALID)
   /* On FreeBSD request GNU iconv compatible handling of characters that cannot
-   * be repesented in the destination character set.
+   * be represented in the destination character set.
    * See https://cgit.freebsd.org/src/commit/?id=7c5b23111c5fd1992047922d4247c4a1ce1bb6c3
    */
   int value = 1;

glib/giochannel.h

@@ -118,7 +118,7 @@ struct _GIOChannel
   /* Group the flags together, immediately after partial_write_buf, to save memory */
 
   guint use_buffer     : 1;	/* The encoding uses the buffers */
-  guint do_encode      : 1;	/* The encoding uses the GIConv coverters */
+  guint do_encode      : 1;	/* The encoding uses the GIConv converters */
   guint close_on_unref : 1;	/* Close the channel on final unref */
   guint is_readable    : 1;	/* Cached GIOFlag */
   guint is_writeable   : 1;	/* ditto */
@@ -370,7 +370,7 @@ GIOChannel *g_io_channel_win32_new_messages (guint hwnd);
 #endif
 
 /* Create an IO channel for C runtime (emulated Unix-like) file
- * descriptors. After calling g_io_add_watch() on a IO channel
+ * descriptors. After calling g_io_add_watch() on an IO channel
  * returned by this function, you shouldn't call read() on the file
  * descriptor. This is because adding polling for a file descriptor is
  * implemented on Win32 by starting a thread that sits blocked in a

glib/glib.stp.in

@@ -676,7 +676,7 @@ probe glib.variant_type_info_free = process("@ABS_GLIB_RUNTIME_LIBDIR@/libglib-2
  * Indicates that a @value has started the process of serialising
  * itself.  This involves dropping references on the child elements of
  * @value, so when mixed with the end_serialise probe, it is possible to
- * see the context in which the unrefs are occuring.
+ * see the context in which the unrefs are occurring.
  **/
 probe glib.variant_start_serialise = process("@ABS_GLIB_RUNTIME_LIBDIR@/libglib-2.0.so.0.@LT_CURRENT@.@LT_REVISION@").mark("variant__start_serialise")
 {
@@ -836,7 +836,7 @@ probe glib.variant_take_ref = process("@ABS_GLIB_RUNTIME_LIBDIR@/libglib-2.0.so.
  *
  * Reports that a #GVariant has been created as a result of calling
  * g_variant_get_child_value() on a serialised #GVariant (ie:
- * deserialisation has occured).
+ * deserialisation has occurred).
  **/
 probe glib.variant_from_parent = process("@ABS_GLIB_RUNTIME_LIBDIR@/libglib-2.0.so.0.@LT_CURRENT@.@LT_REVISION@").mark("variant__from_parent")
 {

glib/gstdioprivate.h

@@ -75,7 +75,7 @@ int g_win32_fstat         (int                fd,
  * call to close() may indicate the wrong FD, so the error must be
  * ignored.
  *
- * However, since Mac OS X 10.5 (Leopard) Apple provdes a hidden
+ * However, since Mac OS X 10.5 (Leopard) Apple provides a hidden
  * implementation of close that doesn't allow another thread
  * to cancel the close so it never fails with EINTR.
  *

glib/guri.c

@@ -103,7 +103,7 @@
  * references’ (sometimes referred to as ‘relative URIs’) or ‘URIs’ (for
  * clarity, ‘URIs’ are referred to in this documentation as
  * ‘absolute URIs’ — although
- * [in constrast to RFC 3986](https://tools.ietf.org/html/rfc3986#section-4.3),
+ * [in contrast to RFC 3986](https://tools.ietf.org/html/rfc3986#section-4.3),
  * fragment identifiers are always allowed).
  *
  * Relative references have one or more components of the URI missing. In

glib/gwin32.c

@@ -397,7 +397,7 @@ get_package_directory_from_module (const gchar *module_name)
  *
  * It is strongly recommended that packagers of GLib-using libraries
  * for Windows do not store installation paths in the Registry to be
- * used by this function as that interfers with having several
+ * used by this function as that interferes with having several
  * parallel installations of the library. Enabling multiple
  * installations of different versions of some GLib-using library, or
  * GLib itself, is desirable for various reasons.

glib/valgrind.h

@@ -1077,7 +1077,7 @@ typedef
 
 /* Use these to write the name of your wrapper.  NOTE: duplicates
    VG_WRAP_FUNCTION_Z{U,Z} in pub_tool_redir.h.  NOTE also: inserts
-   the default behaviour equivalance class tag "0000" into the name.
+   the default behaviour equivalence class tag "0000" into the name.
    See pub_tool_redir.h for details -- normally you don't need to
    think about this, though. */
 
@@ -1675,7 +1675,7 @@ typedef
 /* NB 9 Sept 07.  There is a nasty kludge here in all these CALL_FN_
    macros.  In order not to trash the stack redzone, we need to drop
    %rsp by 128 before the hidden call, and restore afterwards.  The
-   nastyness is that it is only by luck that the stack still appears
+   nastiness is that it is only by luck that the stack still appears
    to be unwindable during the hidden call - since then the behaviour
    of any routine using this macro does not match what the CFI data
    says.  Sigh.

gobject/gobject.c

@@ -3895,7 +3895,7 @@ gpointer
  *
  * Using this function on the return value of the user's callback allows
  * the user to do whichever is more convenient for them. The caller will
- * alway receives exactly one full reference to the value: either the
+ * always receives exactly one full reference to the value: either the
  * one that was returned in the first place, or a floating reference
  * that has been converted to a full reference.
  *

gobject/gparam.c

@@ -1337,8 +1337,8 @@ pool_depth_list (gpointer key,
  * the prerequisite class, not from the interface that
  * prerequires it.
  * 
- * also 'depth' isn't a meaningful concept for interface
+ * Also 'depth' isn't a meaningful concept for interface
- * prerequites.
+ * prerequisites.
  */
 static void
 pool_depth_list_for_interface (gpointer key,

gobject/gtype.h

@@ -1095,7 +1095,7 @@ typedef enum    /*< skip >*/
  * @base_finalize: Location of the base finalization function (optional)
  * @class_init: Location of the class initialization function for
  *  classed and instantiatable types. Location of the default vtable 
- *  inititalization function for interface types. (optional) This function 
+ *  initialization function for interface types. (optional) This function
  *  is used both to fill in virtual functions in the class or default vtable, 
  *  and to do type-specific setup such as registering signals and object
  *  properties.

gobject/gvaluearray.c

@@ -71,7 +71,7 @@
  * @value_array: #GValueArray to get a value from
  * @index_: index of the value of interest
  *
- * Return a pointer to the value at @index_ containd in @value_array.
+ * Return a pointer to the value at @index_ contained in @value_array.
  *
  * Returns: (transfer none): pointer to a value at @index_ in @value_array
  *

gthread/meson.build

@@ -1,4 +1,4 @@
-# Just a skeleton lib for backwards compatibility since all the functionaliy
+# Just a skeleton lib for backwards compatibility since all the functionality
 # has been moved into glib now
 
 gthread_sources = ['gthread-impl.c']