infra/linters: Replace spellcheck with typos

Spellcheck is difficult to maintain because it complains about every
unknown word, including technical terms, acronyms, and names.
Typos is a more relaxed spellchecker, which only complains about common
misspellings and lets the user handle new words such as the previous
examples.

The configuration in .github/.typos.toml allows ignoring strings that
match regexes, so we have a nice way of handling command outputs.

Signed-off-by: Alex Apostolescu <[email protected]>

.github/.typos.toml

@@ -0,0 +1,10 @@
+[default]
+# ```(console)?[\\s\\S]+?```    -> Ignore fenced sequences
+# -\\w+|--\\w+                  -> Ignore command flags
+extend-ignore-re= ["```(console)?[\\s\\S]+?```", "-\\w+|--\\w+"]
+[files]
+extend-exclude = ["*.svg", "*.drawio", "ssh_key", "ssh_key.pub"]
+[default.extend-words]
+# word1 = "word2" to correct word1 to word2
+# word3 = "word3" to consider word3 a valid word
+VAS = "VAS"

.github/workflows/actions.yml

@@ -24,11 +24,12 @@ jobs:
         with:
           GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
 
-  spellcheck:
-    name: Spellcheck
+  typos:
+    name: Typos
     runs-on: ubuntu-latest
     steps:
-      - name: Spellcheck
-        uses: open-education-hub/actions/spellcheck@main
+      - uses: actions/checkout@v4
+      - name: Typos
+        uses: crate-ci/[email protected]
         with:
-          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
+          config: .github/.typos.toml

chapters/compute/processes/guides/sum-array-processes/support/c/sum_array_sequential.c

@@ -31,7 +31,7 @@ int main(void)
 
 	time = 1000 * (stop.tv_sec - start.tv_sec) + (stop.tv_usec - start.tv_usec) / 1000;
 
-	printf("Array sum is %ld\nTime spent: %lu miliseconds\n", result, time);
+	printf("Array sum is %ld\nTime spent: %lu milliseconds\n", result, time);
 
 	free(array);
 

chapters/compute/scheduling/drills/tasks/libult/solution/queue.h

@@ -58,7 +58,7 @@ void queue_destroy(QUEUE *queue);
 size_t queue_size(const QUEUE *queue);
 
 
-/* Add elem to the end of queue. Returns 0 on succes and non-zero on
+/* Add elem to the end of queue. Returns 0 on success and non-zero on
  * failure.
  */
 int queue_enqueue(QUEUE *queue, TCB *elem);

chapters/compute/scheduling/drills/tasks/libult/support/queue.h

@@ -58,7 +58,7 @@ void queue_destroy(QUEUE *queue);
 size_t queue_size(const QUEUE *queue);
 
 
-/* Add elem to the end of queue. Returns 0 on succes and non-zero on
+/* Add elem to the end of queue. Returns 0 on success and non-zero on
  * failure.
  */
 int queue_enqueue(QUEUE *queue, TCB *elem);

chapters/compute/scheduling/guides/libult/solution/queue.h

@@ -58,7 +58,7 @@ void queue_destroy(QUEUE *queue);
 size_t queue_size(const QUEUE *queue);
 
 
-/* Add elem to the end of queue. Returns 0 on succes and non-zero on
+/* Add elem to the end of queue. Returns 0 on success and non-zero on
  * failure.
  */
 int queue_enqueue(QUEUE *queue, TCB *elem);

chapters/compute/scheduling/guides/libult/support/queue.h

@@ -58,7 +58,7 @@ void queue_destroy(QUEUE *queue);
 size_t queue_size(const QUEUE *queue);
 
 
-/* Add elem to the end of queue. Returns 0 on succes and non-zero on
+/* Add elem to the end of queue. Returns 0 on success and non-zero on
  * failure.
  */
 int queue_enqueue(QUEUE *queue, TCB *elem);

chapters/compute/synchronization/drills/tasks/race-condition/solution/d/race_condition_atomic.d

@@ -16,7 +16,7 @@ void incrementVar()
         // `atomicOp` is a template function. It can perform any simple
         // operation, such as `+=`, &= or `-=`, atomically. The operations is
         // given to the function as a template argument using the following
-        // construction: !"+=". The values in parantheses are the operands
+        // construction: !"+=". The values in parentheses are the operands
         // of the atomic operation.
         atomicOp!"+="(var, 1);
     }

chapters/compute/synchronization/drills/tasks/threadsafe-data-struct/support/clist.h

@@ -59,7 +59,7 @@ typedef struct CList
                                                                 /* Returns object with first match of string or byte compare */
   void * (* lastMatch)   (struct CList *l, const void *o, size_t shift, size_t size, int string);
                                                                 /* Returns object with last match of string or byte compare */
-  int    (* index)       (struct CList *l);                     /* Get index of previos search match */
+  int    (* index)       (struct CList *l);                     /* Get index of previous search match */
   int    (* swap)        (struct CList *l, int a, int b);       /* Swap, replace two items with index a b */
   int    (* allocSize)   (struct CList *l);                     /* Get allocated size in items */
   size_t (* itemSize)    (struct CList *l);                     /* Get item size in bytes */

chapters/compute/synchronization/drills/tasks/threadsafe-data-struct/support/test.c

@@ -242,7 +242,7 @@ int main(void)
 
 	/******************************************************* POINTERS LIST */
 
-	/* If we want create list of objects located in diffent places of memory, */
+	/* If we want create list of objects located in different places of memory, */
 	/* let create pointers list or in our case "uintptr_t" address list       */
 
 	printf("Size of 'uintptr_t' = %zu bytes\n", sizeof(uintptr_t));

chapters/compute/synchronization/slides/mutual-exclusion.md

@@ -97,7 +97,7 @@ void mutex_unlock(struct mutex *m)
 * Prevents overhead from busy-waiting
 * Threads move to WAITING state while waiting for the lock
 * Introduces overhead from context switch
-* Releasing a mutex held by another thread is [**undefinded behaviour**](https://pubs.opengroup.org/onlinepubs/9699919799/functions/pthread_mutex_lock.html)
+* Releasing a mutex held by another thread is [**undefined behaviour**](https://pubs.opengroup.org/onlinepubs/9699919799/functions/pthread_mutex_lock.html)
 
 ----
 

chapters/compute/threads/drills/tasks/sum-array-bugs/solution/seg-fault/sum_array_processes.d

@@ -62,10 +62,10 @@ void main(string[] args)
 
     for (size_t i = 0; i < numProcesses; ++i)
     {
-        size_t elemsPerThred = cast(size_t) ceil(
+        size_t elemsPerThread = cast(size_t) ceil(
             (cast(double) ARR_LEN) / numProcesses);
-        size_t start = i * elemsPerThred;
-        size_t end = min(ARR_LEN, (i + 1) * elemsPerThred);
+        size_t start = i * elemsPerThread;
+        size_t end = min(ARR_LEN, (i + 1) * elemsPerThread);
 
         // Spawn another process with the current one as its parent.
         children[i] = fork();

chapters/compute/threads/drills/tasks/sum-array/support/c/sum_array_sequential.c

@@ -31,7 +31,7 @@ int main(void)
 
 	time = 1000 * (stop.tv_sec - start.tv_sec) + (stop.tv_usec - start.tv_usec) / 1000;
 
-	printf("Array sum is %ld\nTime spent: %lu miliseconds\n", result, time);
+	printf("Array sum is %ld\nTime spent: %lu milliseconds\n", result, time);
 
 	free(array);
 

chapters/compute/threads/guides/sum-array-threads/support/c/sum_array_sequential.c

@@ -31,7 +31,7 @@ int main(void)
 
 	time = 1000 * (stop.tv_sec - start.tv_sec) + (stop.tv_usec - start.tv_usec) / 1000;
 
-	printf("Array sum is %ld\nTime spent: %lu miliseconds\n", result, time);
+	printf("Array sum is %ld\nTime spent: %lu milliseconds\n", result, time);
 
 	free(array);
 

chapters/data/working-with-memory/drills/tasks/access-counter/README.md

@@ -29,15 +29,15 @@ In case of a correct solution, you will get an output such as:
 
 ```text
 ./run_all_tests.sh
-test_acess_read                  ........................ passed ...   9
-test_acess_write                 ........................ passed ...   9
-test_acess_exec                  ........................ passed ...  10
-test_acess_read_write            ........................ passed ...  12
-test_acess_read_exec             ........................ passed ...  12
-test_acess_write_exec            ........................ passed ...  12
-test_acess_exec_read             ........................ passed ...  12
-test_acess_exec_write            ........................ passed ...  12
-test_acess_write_read            ........................ passed ...  12
+test_access_read                  ........................ passed ...   9
+test_access_write                 ........................ passed ...   9
+test_access_exec                  ........................ passed ...  10
+test_access_read_write            ........................ passed ...  12
+test_access_read_exec             ........................ passed ...  12
+test_access_write_exec            ........................ passed ...  12
+test_access_exec_read             ........................ passed ...  12
+test_access_exec_write            ........................ passed ...  12
+test_access_write_read            ........................ passed ...  12
 
 Total:                                                           100/100
 ```

chapters/data/working-with-memory/drills/tasks/access-counter/solution/src/access_counter.c

@@ -45,7 +45,7 @@ static void access_handler(int signum, siginfo_t *si, void *arg)
 		return;
 	}
 
-	/* TODO 2: Obtain page strart address in start variable. */
+	/* TODO 2: Obtain page start address in start variable. */
 	start = (void *) ((unsigned long) si->si_addr & ~0xFFFUL);
 	log_debug("start: %p", start);
 

chapters/data/working-with-memory/drills/tasks/access-counter/support/tests/test.c

@@ -29,7 +29,7 @@ static void do_exec(void *addr)
 	((void (*)(void)) addr)();
 }
 
-static int test_acess_read(void)
+static int test_access_read(void)
 {
 	void *addr;
 
@@ -42,7 +42,7 @@ static int test_acess_read(void)
 	return counter == 1;
 }
 
-static int test_acess_write(void)
+static int test_access_write(void)
 {
 	void *addr;
 
@@ -55,7 +55,7 @@ static int test_acess_write(void)
 	return counter == 2;
 }
 
-static int test_acess_exec(void)
+static int test_access_exec(void)
 {
 	void *addr;
 
@@ -68,7 +68,7 @@ static int test_acess_exec(void)
 	return counter == 3;
 }
 
-static int test_acess_read_write(void)
+static int test_access_read_write(void)
 {
 	void *addr;
 
@@ -82,7 +82,7 @@ static int test_acess_read_write(void)
 	return counter == 1;
 }
 
-static int test_acess_read_exec(void)
+static int test_access_read_exec(void)
 {
 	void *addr;
 
@@ -96,7 +96,7 @@ static int test_acess_read_exec(void)
 	return counter == 2;
 }
 
-static int test_acess_write_exec(void)
+static int test_access_write_exec(void)
 {
 	void *addr;
 
@@ -110,7 +110,7 @@ static int test_acess_write_exec(void)
 	return counter == 1;
 }
 
-static int test_acess_exec_read(void)
+static int test_access_exec_read(void)
 {
 	void *addr;
 
@@ -124,7 +124,7 @@ static int test_acess_exec_read(void)
 	return counter == 0;
 }
 
-static int test_acess_exec_write(void)
+static int test_access_exec_write(void)
 {
 	void *addr;
 
@@ -138,7 +138,7 @@ static int test_acess_exec_write(void)
 	return counter == 0;
 }
 
-static int test_acess_write_read(void)
+static int test_access_write_read(void)
 {
 	void *addr;
 
@@ -153,15 +153,15 @@ static int test_acess_write_read(void)
 }
 
 static struct graded_test all_tests[] = {
-	{ test_acess_read, "test_acess_read", 9 },
-	{ test_acess_write, "test_acess_write", 9 },
-	{ test_acess_exec, "test_acess_exec", 10 },
-	{ test_acess_read_write, "test_acess_read_write", 12 },
-	{ test_acess_read_exec, "test_acess_read_exec", 12 },
-	{ test_acess_write_exec, "test_acess_write_exec", 12 },
-	{ test_acess_exec_read, "test_acess_exec_read", 12 },
-	{ test_acess_exec_write, "test_acess_exec_write", 12 },
-	{ test_acess_write_read, "test_acess_write_read", 12 }
+	{ test_access_read, "test_access_read", 9 },
+	{ test_access_write, "test_access_write", 9 },
+	{ test_access_exec, "test_access_exec", 10 },
+	{ test_access_read_write, "test_access_read_write", 12 },
+	{ test_access_read_exec, "test_access_read_exec", 12 },
+	{ test_access_write_exec, "test_access_write_exec", 12 },
+	{ test_access_exec_read, "test_access_exec_read", 12 },
+	{ test_access_exec_write, "test_access_exec_write", 12 },
+	{ test_access_write_read, "test_access_write_read", 12 }
 };
 
 int main(void)

config.yaml

@@ -102,7 +102,7 @@ lab_structure:
       - reading/copy-on-write.md
       - guides/apache2.md
       - guides/fork-faults.md
-  - title: Lab 8 - Syncronization
+  - title: Lab 8 - Synchronization
     filename: lab8.md
     content:
       - tasks/race-condition.md
@@ -313,7 +313,7 @@ docusaurus:
                   - Not Race Condition: not-race-condition.md
             - Lab 6 - Multiprocess and Multithread: lab6.md
             - Lab 7 - Copy-on-Write: lab7.md
-            - Lab 8 - Syncronization: lab8.md
+            - Lab 8 - Synchronization: lab8.md
       - IO:
           path: /build/prepare_view/.view
           extra:

content/assignments/async-web-server/src/http-parser/README.md

@@ -57,7 +57,7 @@ When data is received on the socket execute the parser and check for errors.
     }
 
     /* Start up / continue the parser.
-     * Note we pass recved==0 to signal that EOF has been recieved.
+     * Note we pass recved==0 to signal that EOF has been received.
      */
     nparsed = http_parser_execute(parser, &settings, buf, recved);
 

content/assignments/async-web-server/src/http-parser/http_parser.c

@@ -1383,7 +1383,7 @@ size_t http_parser_execute (http_parser *parser,
         /* Here we call the headers_complete callback. This is somewhat
          * different than other callbacks because if the user returns 1, we
          * will interpret that as saying that this message has no body. This
-         * is needed for the annoying case of recieving a response to a HEAD
+         * is needed for the annoying case of receiving a response to a HEAD
          * request.
          */
         if (settings->on_headers_complete) {

content/assignments/async-web-server/src/http-parser/http_parser.h

@@ -52,7 +52,7 @@ typedef int ssize_t;
 #endif
 
 
-/* Maximium header size allowed */
+/* Maximum header size allowed */
 #define HTTP_MAX_HEADER_SIZE (80*1024)
 
 

content/assignments/lambda-function-loader/tests/checker.sh

@@ -82,7 +82,7 @@ gen_big_test() {
         elif [ $((CLIENT_NUM%4)) -eq 1 ]; then
             cat "${BIG_DIR}/test_${CLIENT_NUM}" >> "$GEN_REF_FILE"
         elif [ $((CLIENT_NUM%4)) -eq 2 ]; then
-            echo "Reseted the counter!" >> "$GEN_REF_FILE"
+            echo "Reset the counter!" >> "$GEN_REF_FILE"
         else
             echo "Error: $CHECKER_DIR/libfictional.so reset could not be executed." >> "$GEN_REF_FILE"
         fi

content/assignments/lambda-function-loader/tests/special.c

@@ -26,5 +26,5 @@ void reset(void)
 {
 	/* Let's erase the history, shall we? */
 	counter = 0;
-	printf("Reseted the counter!\n");
+	printf("Reset the counter!\n");
 }

content/assignments/minishell/tests/_test/run_test.sh

@@ -129,7 +129,7 @@ execute_cmd() {
 	mkdir -p "${OUT_DIR}" && cd "${OUT_DIR}" &>"$LOG_FILE" || exit 1
 	# shellcheck disable=SC2086
 	timeout "$TEST_TIMEOUT" $BUFFERING_WRAPPER $EXEC <"${INPUT}" &>"$OUTPUT"
-	# Ocasionally, in a virtualized environment, the diff that compares the
+	# Occasionally, in a virtualized environment, the diff that compares the
 	# target implementation with the reference output starts before the
 	# target implementation has finished writing files to disk. Handle this
 	# by mandating that all I/O buffers be flushed.

content/assignments/minishell/util/parser/parser.h

@@ -157,7 +157,7 @@ typedef enum {
  * (the father of the current node in the parse tree)
  * The root of the tree has up == NULL
 
- * The parsed expressions do not contain parantheses, this means that
+ * The parsed expressions do not contain parentheses, this means that
  * the following holds:
  * for any op_lower that has a lower priority than op, there is no
  * parent in the tree with op == op_lower
@@ -194,7 +194,7 @@ void parse_error(const char *str, const int where);
 /*
  * Call this to parse a line
 
- * line must point to a string containig a single line
+ * line must point to a string containing a single line
  * The line must end with "\r\n\0" or "\n\0" or "\0"
  * (*root) must point to NULL ((*root) == NULL)
 

content/assignments/minishell/util/parser/parser.l

@@ -11,7 +11,7 @@
 #ifdef _MSC_VER
 /* Speaking of MS, they do not implement standard C;
  * YY_USE_CONST is defined only if __STDC__ is defined;
- * here is alread too late to redefine YY_USE_CONST so
+ * here is already too late to redefine YY_USE_CONST so
  * we use pragma instead ^^.
  */
 #pragma warning(disable:4090)

content/assignments/minishell/util/parser/parser.y

@@ -177,7 +177,7 @@ static word_t * add_part_to_word(word_t * w, word_t * lst)
 	assert(w != NULL);
 
 	/*
-	 we could insert at the beginnig and then invert the list
+	 we could insert at the beginning and then invert the list
 	 but this would make the code a bit more complicated
 	 thus, we assume we have small lists and O(n*n) is acceptable
 	*/

content/assignments/parallel-firewall/src/ring_buffer.h

@@ -15,7 +15,7 @@ typedef struct so_ring_buffer_t {
 	size_t len;
 	size_t cap;
 
-	/* TODO: Add syncronization primitives */
+	/* TODO: Add synchronization primitives */
 } so_ring_buffer_t;
 
 int     ring_buffer_init(so_ring_buffer_t *rb, size_t cap);