; Fix trivial typos

lisp/emacs-lisp/bytecomp.el

@@ -602,7 +602,7 @@ Each element is (INDEX . VALUE)")
   "To spill default qualities from the compiled file.")
 (defvar byte-native-for-bootstrap nil
   "Non nil while compiling for bootstrap."
-  ;; During boostrap we produce both the .eln and the .elc together.
+  ;; During bootstrap we produce both the .eln and the .elc together.
   ;; Because the make target is the later this has to be produced as
   ;; last to be resilient against build interruptions.
 )

lisp/emacs-lisp/comp.el

@@ -118,7 +118,7 @@ compilation input."
   :type 'hook)
 
 (defcustom comp-async-env-modifier-form nil
-  "Form evaluated before compilation by each asyncronous compilation worker.
+  "Form evaluated before compilation by each asynchronous compilation worker.
 Usable to modify the compiler environment."
   :type 'list)
 
@@ -352,7 +352,7 @@ Needed to replace immediate byte-compiled lambdas with the compiled reference.")
              :documentation "Standard data relocated in use by functions.")
   (d-impure (make-comp-data-container) :type comp-data-container
             :documentation "Relocated data that cannot be moved into pure space.
-This is tipically for top-level forms other than defun.")
+This is typically for top-level forms other than defun.")
   (d-ephemeral (make-comp-data-container) :type comp-data-container
                :documentation "Relocated data not necessary after load.")
   (with-late-load nil :type boolean
@@ -389,7 +389,7 @@ To be used when ncall-conv is nil."))
          :documentation "List of instructions.")
   (closed nil :type boolean
           :documentation "t if closed.")
-  ;; All the followings are for SSA and CGF analysis.
+  ;; All the following are for SSA and CGF analysis.
   ;; Keep in sync with `comp-clean-ssa'!!
   (in-edges () :type list
             :documentation "List of incoming edges.")
@@ -461,7 +461,7 @@ CFG is mutated by a pass.")
   (blocks (make-hash-table) :type hash-table
           :documentation "Basic block name -> basic block.")
   (lap-block (make-hash-table :test #'equal) :type hash-table
-             :documentation "LAP lable -> LIMPLE basic block name.")
+             :documentation "LAP label -> LIMPLE basic block name.")
   (edges-h (make-hash-table) :type hash-table
          :documentation "Hash edge-num -> edge connecting basic two blocks.")
   (block-cnt-gen (funcall #'comp-gen-counter) :type function
@@ -749,7 +749,7 @@ Assume allocation class 'd-default as default."
                                            comp-curr-allocation-class))))
 
 
-;;; Log rountines.
+;;; Log routines.
 
 (defconst comp-limple-lock-keywords
   `((,(rx bol "(comment" (1+ not-newline)) . font-lock-comment-face)
@@ -873,7 +873,7 @@ instruction."
 Add PREFIX in front of it.  If FIRST is not nil, pick the first
 available name ignoring compilation context and potential name
 clashes."
-  ;; Unfortunatelly not all symbol names are valid as C function names...
+  ;; Unfortunately not all symbol names are valid as C function names...
   ;; Nassi's algorithm here:
   (let* ((orig-name (if (symbolp name) (symbol-name name) name))
          (crypted (cl-loop with str = (make-string (* 2 (length orig-name)) 0)
@@ -2008,7 +2008,7 @@ Return the corresponding rhs slot number."
 (defun comp-cond-rw (_)
   "Rewrite conditional branches adding appropriate 'assume' insns.
 This is introducing and placing 'assume' insns in use by fwprop
-to propagate conditional branch test informations on target basic
+to propagate conditional branch test information on target basic
 blocks."
   (maphash (lambda (_ f)
              (when (and (>= (comp-func-speed f) 1)
@@ -2051,7 +2051,7 @@ blocks."
                              f))))
 
 (defun comp-pure-infer-func (f)
-  "If all funtions called by F are pure then F is pure too."
+  "If all functions called by F are pure then F is pure too."
   (when (and (cl-every (lambda (x)
                          (or (comp-function-pure-p x)
                              (eq x (comp-func-name f))))
@@ -2094,7 +2094,7 @@ blocks."
     mvar))
 
 (defun comp-clean-ssa (f)
-  "Clean-up SSA for funtion F."
+  "Clean-up SSA for function F."
   (setf (comp-func-edges-h f) (make-hash-table))
   (cl-loop
    for b being each hash-value of (comp-func-blocks f)
@@ -2367,7 +2367,7 @@ PRE-LAMBDA and POST-LAMBDA are called in pre or post-order if non-nil."
                            do (finalize-phi args b)))))
 
 (defun comp-ssa ()
-  "Port all functions into mininal SSA form."
+  "Port all functions into minimal SSA form."
   (maphash (lambda (_ f)
              (let* ((comp-func f)
                     (ssa-status (comp-func-ssa-status f)))
@@ -3139,7 +3139,7 @@ Prepare every function for final compilation and drive the C back-end."
   x)
 
 
-;; Primitive funciton advice machinery
+;; Primitive function advice machinery
 
 (defun comp-trampoline-filename (subr-name)
   "Given SUBR-NAME return the filename containing the trampoline."
@@ -3445,7 +3445,7 @@ load once finished compiling."
 ;;;###autoload
 (defun native-compile (function-or-file &optional output)
   "Compile FUNCTION-OR-FILE into native code.
-This is the syncronous entry-point for the Emacs Lisp native
+This is the synchronous entry-point for the Emacs Lisp native
 compiler.
 FUNCTION-OR-FILE is a function symbol, a form or the filename of
 an Emacs Lisp source file.

src/comp.c

@@ -1517,7 +1517,7 @@ emit_XFIXNUM (gcc_jit_rvalue *obj)
   emit_comment ("XFIXNUM");
   gcc_jit_rvalue *i = emit_coerce (comp.emacs_uint_type, emit_XLI (obj));
 
-  /* FIXME: Implementation dependent (both RSHIFT are arithmetics).  */
+  /* FIXME: Implementation dependent (both RSHIFT are arithmetic).  */
 
   if (!USE_LSB_TAG)
     {
@@ -3780,7 +3780,7 @@ define_maybe_gc_or_quit (void)
     /* 9 translates into checking for GC or quit every 512 calls to
        'maybe_gc_quit'.  This is the smallest value I could find with
        no performance impact running elisp-banechmarks and the same
-       used by the byte intepreter (see 'exec_byte_code').  */
+       used by the byte interpreter (see 'exec_byte_code').  */
     maybe_do_it_block,
     pass_block);
 
@@ -4067,7 +4067,7 @@ If BASE-DIR is nil use the first entry in `comp-eln-load-path'.  */)
      included in the hashing algorithm.
 
      As at any point in time no more then one file can exist with the
-     same filename, should be possibile to clean up all
+     same filename, should be possible to clean up all
      filename-path_hash-* except the most recent one (or the new one
      being recompiled).
 
@@ -4617,7 +4617,7 @@ register_native_comp_unit (Lisp_Object comp_u)
    loaded the compiler and its dependencies.  */
 static Lisp_Object delayed_sources;
 
-/* Queue an asyncronous compilation for the source file defining
+/* Queue an asynchronous compilation for the source file defining
    FUNCTION_NAME and perform a late load.
 
    NOTE: ideally would be nice to move its call simply into Fload but
@@ -4671,7 +4671,7 @@ maybe_defer_native_compilation (Lisp_Object function_name,
     }
 
   /* This is to have deferred compilaiton able to compile comp
-     dependecies breaking circularity.  */
+     dependencies breaking circularity.  */
   if (!NILP (Ffeaturep (Qcomp, Qnil)))
     {
       /* Comp already loaded.  */
@@ -5297,7 +5297,7 @@ If a directory is non absolute is assumed to be relative to
 `invocation-directory'.
 The last directory of this list is assumed to be the system one.  */);
 
-  /* Temporary value in use for boostrap.  We can't do better as
+  /* Temporary value in use for bootstrap.  We can't do better as
      `invocation-directory' is still unset, will be fixed up during
      dump reload.  */
   Vcomp_eln_load_path = Fcons (build_string ("../native-lisp/"), Qnil);

src/comp.h

@@ -42,7 +42,7 @@ struct Lisp_Native_Comp_Unit
   Lisp_Object lambda_gc_guard_h;
   /* Hash c_name -> d_reloc_imp index.  */
   Lisp_Object lambda_c_name_idx_h;
-  /* Hash doc-idx -> function documentaiton.  */
+  /* Hash doc-idx -> function documentation.  */
   Lisp_Object data_fdoc_v;
   /* Analogous to the constant vector but per compilation unit.  */
   Lisp_Object data_vec;

src/pdumper.c

@@ -326,7 +326,7 @@ dump_fingerprint (char const *label,
 /* To be used if some order in the relocation process has to be enforced. */
 enum reloc_phase
   {
-    /* First to run.  Place here every relocation with no dependecy.  */
+    /* First to run.  Place every relocation with no dependency here.  */
     EARLY_RELOCS,
     /* Late and very late relocs are relocated at the very last after
        all hooks has been run.  All lisp machinery is at disposal

test/src/comp-tests.el

@@ -393,7 +393,7 @@ https://lists.gnu.org/archive/html/bug-gnu-emacs/2020-03/msg00914.html."
 
 (defvar comp-test-primitive-advice)
 (comp-deftest primitive-advice ()
-  "Test effectiveness of primitve advicing."
+  "Test effectiveness of primitive advicing."
   (let (comp-test-primitive-advice
         (f (lambda (&rest args)
              (setq comp-test-primitive-advice args))))
@@ -406,7 +406,7 @@ https://lists.gnu.org/archive/html/bug-gnu-emacs/2020-03/msg00914.html."
 
 (defvar comp-test-primitive-redefine-args)
 (comp-deftest primitive-redefine ()
-  "Test effectiveness of primitve redefinition."
+  "Test effectiveness of primitive redefinition."
   (cl-letf ((comp-test-primitive-redefine-args nil)
             ((symbol-function #'-)
              (lambda (&rest args)