Browse code

Fix typos and remove duplicate #include

RainRat authored on 2024/04/11 08:31:46
Showing 11 changed files
... ...
@@ -131,7 +131,7 @@ set(CMAKE_SYSROOT           /opt/aarch64-wrs-linux-sysroot)
131 131
 # Note, you may need to set ENABLE_JSON_SHARED if your sysroot provides libjson-c.so instead of libjson-c.a.
132 132
 #set(ENABLE_JSON_SHARED      ON)
133 133
 
134
-# You may need to set the following if CMake has some trouble finding the depenencies.
134
+# You may need to set the following if CMake has some trouble finding the dependencies.
135 135
 # For example if you have `libjson-c.a` in your sysroot, here: `/opt/aarch64-wrs-linux-sysroot/usr/lib64/libjson-c.a`
136 136
 # then you would set:
137 137
 #set(JSONC_LIBRARY           "/usr/lib64/libjson-c.a")
... ...
@@ -41,7 +41,6 @@
41 41
 #include <sys/types.h>
42 42
 #include <sys/stat.h>
43 43
 #include <fcntl.h>
44
-#include <sys/types.h>
45 44
 #ifdef HAVE_SYS_SELECT_H
46 45
 #include <sys/select.h>
47 46
 #endif
... ...
@@ -50,7 +50,7 @@ int getopt_reset(void)
50 50
 
51 51
 /* this is the plain old UNIX getopt, with GNU-style extensions. */
52 52
 /* if you're porting some piece of UNIX software, this is all you need. */
53
-/* this supports GNU-style permution and optional arguments */
53
+/* this supports GNU-style permutation and optional arguments */
54 54
 
55 55
 int my_getopt(int argc, char *argvc[], const char *opts)
56 56
 {
... ...
@@ -106,7 +106,7 @@
106 106
 #define OID_1_3_6_1_4_1_311_12_1_2 "\x2b\x06\x01\x04\x01\x82\x37\x0c\x01\x02"
107 107
 #define OID_szOID_CATALOG_LIST_MEMBER OID_1_3_6_1_4_1_311_12_1_2
108 108
 
109
-/* CATALOG_LIST_MEMBER2 seems to be whats used by the SHA256-based CAT files */
109
+/* CATALOG_LIST_MEMBER2 seems to be what's used by the SHA256-based CAT files */
110 110
 #define OID_1_3_6_1_4_1_311_12_1_3 "\x2b\x06\x01\x04\x01\x82\x37\x0c\x01\x03"
111 111
 #define OID_szOID_CATALOG_LIST_MEMBER2 OID_1_3_6_1_4_1_311_12_1_3
112 112
 
... ...
@@ -172,7 +172,7 @@ static inline void funmap(fmap_t *m)
172 172
  * @param m     The fmap.
173 173
  * @param at    The map offset requested.
174 174
  * @param len   The data length requested.
175
- * @return const void* A pointer into to the fmap->data at the requested ofset. NULL if offset/len are not contained in the fmap.
175
+ * @return const void* A pointer into to the fmap->data at the requested offset. NULL if offset/len are not contained in the fmap.
176 176
  */
177 177
 static inline const void *fmap_need_off(fmap_t *m, size_t at, size_t len)
178 178
 {
... ...
@@ -190,7 +190,7 @@ static inline const void *fmap_need_off(fmap_t *m, size_t at, size_t len)
190 190
  * @param m     The fmap.
191 191
  * @param at    The map offset requested.
192 192
  * @param len   The data length requested.
193
- * @return const void* A pointer into to the fmap->data at the requested ofset. NULL if offset/len are not contained in the fmap.
193
+ * @return const void* A pointer into to the fmap->data at the requested offset. NULL if offset/len are not contained in the fmap.
194 194
  */
195 195
 static inline const void *fmap_need_off_once(fmap_t *m, size_t at, size_t len)
196 196
 {
... ...
@@ -228,7 +228,7 @@ static inline size_t fmap_ptr2off(const fmap_t *m, const void *ptr)
228 228
  * @param m     The fmap.
229 229
  * @param ptr   A pointer into the fmap->data.
230 230
  * @param len   The data length requested.
231
- * @return const void* A pointer into to the fmap->data at the requested ofset. NULL if offset/len are not contained in the fmap.
231
+ * @return const void* A pointer into to the fmap->data at the requested offset. NULL if offset/len are not contained in the fmap.
232 232
  */
233 233
 static inline const void *fmap_need_ptr(fmap_t *m, const void *ptr, size_t len)
234 234
 {
... ...
@@ -246,7 +246,7 @@ static inline const void *fmap_need_ptr(fmap_t *m, const void *ptr, size_t len)
246 246
  * @param m     The fmap.
247 247
  * @param ptr   A pointer into the fmap->data.
248 248
  * @param len   The data length requested.
249
- * @return const void* A pointer into to the fmap->data at the requested ofset. NULL if offset/len are not contained in the fmap.
249
+ * @return const void* A pointer into to the fmap->data at the requested offset. NULL if offset/len are not contained in the fmap.
250 250
  */
251 251
 static inline const void *fmap_need_ptr_once(fmap_t *m, const void *ptr, size_t len)
252 252
 {
... ...
@@ -370,7 +370,7 @@ static inline const void *fmap_gets(fmap_t *m, char *dst, size_t *at, size_t max
370 370
  * @param at            The map offset requested.
371 371
  * @param len           Maximum length of data requested.
372 372
  * @param[out] lenout   The actual len of data available.
373
- * @return const void*  A pointer into to the fmap->data at the requested ofset. NULL if offset/len are not contained in the fmap.
373
+ * @return const void*  A pointer into to the fmap->data at the requested offset. NULL if offset/len are not contained in the fmap.
374 374
  */
375 375
 static inline const void *fmap_need_off_once_len(fmap_t *m, size_t at, size_t len, size_t *lenout)
376 376
 {
... ...
@@ -396,7 +396,7 @@ static inline const void *fmap_need_off_once_len(fmap_t *m, size_t at, size_t le
396 396
  * @param ptr           A pointer into the fmap->data.
397 397
  * @param len           Maximum length of data requested.
398 398
  * @param[out] lenout   The actual len of data available.
399
- * @return const void* A pointer into to the fmap->data at the requested ofset. NULL if offset/len are not contained in the fmap.
399
+ * @return const void* A pointer into to the fmap->data at the requested offset. NULL if offset/len are not contained in the fmap.
400 400
  */
401 401
 static inline const void *fmap_need_ptr_once_len(fmap_t *m, const void *ptr, size_t len, size_t *lenout)
402 402
 {
... ...
@@ -477,7 +477,7 @@ const struct cli_element *cli_hashtab_insert(struct cli_hashtable *s, const char
477 477
         } while (tries <= s->capacity);
478 478
         /* no free place found*/
479 479
         PROFILE_HASH_EXHAUSTED(s);
480
-        cli_dbgmsg("hashtab.c: Growing hashtable %p, because its full, old size: %zu.\n", (void *)s, s->capacity);
480
+        cli_dbgmsg("hashtab.c: Growing hashtable %p, because it's full, old size: %zu.\n", (void *)s, s->capacity);
481 481
     } while (cli_hashtab_grow(s) >= 0);
482 482
     cli_warnmsg("hashtab.c: Unable to grow hashtable\n");
483 483
     return NULL;
... ...
@@ -529,7 +529,7 @@ cl_error_t cli_htu32_insert(struct cli_htu32 *s, const struct cli_htu32_element
529 529
         } while (tries <= s->capacity);
530 530
         /* no free place found*/
531 531
         PROFILE_HASH_EXHAUSTED(s);
532
-        cli_dbgmsg("hashtab.c: Growing hashtable %p, because its full, old size: %zu.\n", (void *)s, s->capacity);
532
+        cli_dbgmsg("hashtab.c: Growing hashtable %p, because it's full, old size: %zu.\n", (void *)s, s->capacity);
533 533
     } while ((ret = cli_htu32_grow(s, mempool)) >= 0);
534 534
     cli_warnmsg("hashtab.c: Unable to grow hashtable\n");
535 535
     return ret;
... ...
@@ -1766,7 +1766,7 @@ static int yylex(YYSTYPE *lvalp, yyscan_t scanner)
1766 1766
             cli_dbgmsg(MODULE "infloop detected, skipping character\n");
1767 1767
             scanner->pos++;
1768 1768
         }
1769
-        /* its not necessarily an infloop if it changed
1769
+        /* it's not necessarily an infloop if it changed
1770 1770
          * state, and it shouldn't infloop between states */
1771 1771
     }
1772 1772
     scanner->lastpos    = scanner->pos;
... ...
@@ -5797,12 +5797,12 @@ finish:
5797 5797
  * If the section hashes are to be computed and returned, this function
5798 5798
  * allocates memory for the section hashes, and it's up to the caller to free
5799 5799
  * it.  hashes->sections will be initialized to NULL at the beginning of the
5800
- * function, and if after the call it's value is non-NULL, the memory should be
5800
+ * function, and if after the call its value is non-NULL, the memory should be
5801 5801
  * freed.  Furthermore, if hashes->sections is non-NULL, the hashes can assume
5802 5802
  * to be valid regardless of the return code.
5803 5803
  *
5804 5804
  * Also, a few other notes:
5805
- *  - If a section has a virtual size of zero, it's corresponding hash value
5805
+ *  - If a section has a virtual size of zero, its corresponding hash value
5806 5806
  *    will not be computed and the hash contents will be all zeroes.
5807 5807
  *  - If a section extends beyond the end of the file, the section data and
5808 5808
  *    length will be truncated, and the hash generated accordingly
... ...
@@ -536,7 +536,7 @@ fn rgb_to_luma(rgb: &[u8]) -> u8 {
536 536
 
537 537
 /// Convert the supplied image to grayscale. Alpha channel is discarded.
538 538
 ///
539
-/// This is a customized implemententation of the grayscale feature from the `image` crate.
539
+/// This is a customized implementation of the grayscale feature from the `image` crate.
540 540
 /// This allows us to:
541 541
 /// - use RGB->LUMA constants that match those used by the Python Pillow package.
542 542
 /// - round the luma floating point value to the nearest integer rather than truncating.
... ...
@@ -1270,7 +1270,7 @@ START_TEST(test_fmap_assorted_api)
1270 1270
     free_duplicate_fmap(dup_map);
1271 1271
     dup_map = NULL;
1272 1272
 
1273
-    /* We can close the fd-based map now that we're done with it's duplicate */
1273
+    /* We can close the fd-based map now that we're done with its duplicate */
1274 1274
     cl_fmap_close(fd_based_map);
1275 1275
     fd_based_map = NULL;
1276 1276
 
... ...
@@ -190,7 +190,7 @@ static const unsigned short int __mon_yday[2][13] =
190 190
 static void
191 191
 day_of_the_week(struct tm *tm)
192 192
 {
193
-    /* We know that January 1st 1970 was a Thursday (= 4).  Compute the
193
+    /* We know that January 1st 1970 was a Thursday (= 4).  Compute
194 194
      the difference between this data in the one on TM and so determine
195 195
      the weekday.  */
196 196
     int corr_year = 1900 + tm->tm_year - (tm->tm_mon < 2);