done

Author: corneliusroemer

Python/remote_debug.h

@@ -1119,7 +1119,7 @@ _Py_RemoteDebug_PagedReadRemoteMemory(proc_handle_t *handle,
             }
 
             if (_Py_RemoteDebug_ReadRemoteMemory(handle, page_base, page_size, entry->data) < 0) {
-                // Try to just copy the exact ammount as a fallback
+                // Try to just copy the exact amount as a fallback
                 PyErr_Clear();
                 goto fallback;
             }

Python/specialize.c

@@ -2544,7 +2544,7 @@ static _PyBinaryOpSpecializationDescr binaryop_extend_descrs[] = {
     {NB_INPLACE_AND, compactlongs_guard, compactlongs_and},
     {NB_INPLACE_XOR, compactlongs_guard, compactlongs_xor},
 
-    /* float-long arithemetic */
+    /* float-long arithmetic */
     {NB_ADD, float_compactlong_guard, float_compactlong_add},
     {NB_SUBTRACT, float_compactlong_guard, float_compactlong_subtract},
     {NB_TRUE_DIVIDE, nonzero_float_compactlong_guard, float_compactlong_true_div},

Tools/build/generate-build-details.py

@@ -155,7 +155,7 @@ def make_paths_relative(data: dict[str, Any], config_path: str | None = None) ->
             continue
         # Get the relative path
         new_path = os.path.relpath(current_path, data['base_prefix'])
-        # Join '.' so that the path is formated as './path' instead of 'path'
+        # Join '.' so that the path is formatted as './path' instead of 'path'
         new_path = os.path.join('.', new_path)
         container[child] = new_path
 

Tools/cases_generator/tier1_generator.py

@@ -201,7 +201,7 @@ def generate_tier1_labels(
     analysis: Analysis, emitter: Emitter
 ) -> None:
     emitter.emit("\n")
-    # Emit tail-callable labels as function defintions
+    # Emit tail-callable labels as function definitions
     for name, label in analysis.labels.items():
         emitter.emit(f"LABEL({name})\n")
         storage = Storage(Stack(), [], [], 0, False)

Tools/peg_generator/pegen/grammar_visualizer.py

@@ -33,15 +33,15 @@ def print_nodes_recursively(self, node: Rule, prefix: str = "", istail: bool = T
         value = self.name(node)
 
         line = prefix + ("└──" if istail else "├──") + value + "\n"
-        sufix = "   " if istail else "│  "
+        suffix = "   " if istail else "│  "
 
         if not children:
             return line
 
         *children, last = children
         for child in children:
-            line += self.print_nodes_recursively(child, prefix + sufix, False)
-        line += self.print_nodes_recursively(last, prefix + sufix, True)
+            line += self.print_nodes_recursively(child, prefix + suffix, False)
+        line += self.print_nodes_recursively(last, prefix + suffix, True)
 
         return line