typo fixes

Author: syan212

README.md

@@ -3,7 +3,7 @@ MicroQuickJS
 
 ## Introduction
 
-MicroQuickJS (aka. MQuickJS) is a JavaScript engine targetted at
+MicroQuickJS (aka. MQuickJS) is a JavaScript engine targeted at
 embedded systems. It compiles and runs JavaScript programs using as little
 as 10 kB of RAM. The whole engine requires about 100 kB of ROM (ARM
 Thumb-2 code) including the C library. The speed is comparable to
@@ -269,7 +269,7 @@ case, it must be relocated before being flashed into ROM (see
 `JS_LoadBytecode()` and run as normal script with `JS_Run()` (see
 `mqjs.c`).
 
-As with QuickJS, no backward compatibility is garanteed at the
+As with QuickJS, no backward compatibility is guaranteed at the
 bytecode level. Moreover, the bytecode is not verified before being
 executed. Only run JavaScript bytecode from trusted sources.
 
@@ -358,7 +358,7 @@ Running the QuickJS micro benchmark:
 make microbench
 ``
 
-Addtional tests and a patched version of the Octane benchmark running
+Additional tests and a patched version of the Octane benchmark running
 in stricter mode can be downloaded
 [here](https://bellard.org/mquickjs/mquickjs-extras.tar.xz):
 

dtoa.c

@@ -1184,14 +1184,14 @@ int js_dtoa(char *buf, double d, int radix, int n_digits, int flags,
     if (fmt == JS_DTOA_FORMAT_FREE) {
         int P_max, E0, e1, E_found, P_found;
         uint64_t m1, mant_found, mant, mant_max1;
-        /* P_max is guarranteed to work by construction */
+        /* P_max is guaranteed to work by construction */
         P_max = dtoa_max_digits_table[radix - 2];
         E0 = E;
         E_found = 0;
         P_found = 0;
         mant_found = 0;
         /* find the minimum number of digits by successive tries */
-        P = P_max; /* P_max is guarateed to work */
+        P = P_max; /* P_max is guaranteed to work */
         for(;;) {
             /* mant_max always fits on 64 bits */
             mant_max1 = pow_ui(radix, P);
@@ -1210,7 +1210,7 @@ int js_dtoa(char *buf, double d, int radix, int n_digits, int flags,
                 mant /= radix;
                 P--;
             }
-            /* garanteed to work for P = P_max */
+            /* guaranteed to work for P = P_max */
             if (P_found == 0)
                 goto prec_found;
             /* convert back to base 2 */

libm.c

@@ -484,7 +484,7 @@ double js_scalbn(double x, int n)
  *	If (2) is false, then q   = q ; otherwise q   = q  + 2      .
  *		 	       i+1   i             i+1   i
  *
- *	With some algebric manipulation, it is not difficult to see
+ *	With some algebraic manipulation, it is not difficult to see
  *	that (2) is equivalent to 
  *                             -(i+1)
  *			s  +  2       <= y			(3)
@@ -1937,7 +1937,7 @@ double js_exp(double x)
  *	1. Compute and return log2(x) in two pieces:
  *		log2(x) = w1 + w2,
  *	   where w1 has 53-24 = 29 bit trailing zeros.
- *	2. Perform y*log2(x) = n+y' by simulating muti-precision 
+ *	2. Perform y*log2(x) = n+y' by simulating multi-precision 
  *	   arithmetic, where |y'|<=0.5.
  *	3. Return x**y = 2**n*exp(y'*log2)
  *
@@ -2086,7 +2086,7 @@ static double js_log_internal(double x, int flag)
     } else {
         t = zero_low(t);
         if (flag == 1) {
-            /* mutiply (p_l+p_h) by lg2 */
+            /* multiply (p_l+p_h) by lg2 */
             u = t*lg2_h;
             v = (p_l-(t-p_h))*lg2+t*lg2_l;
         } else {
@@ -2249,7 +2249,7 @@ double js_pow(double x, double y)
 	    if(j<0) n = -n;
 	    p_h -= t;
 	}
-        /* mutiply (p_l+p_h) by lg2 */
+        /* multiply (p_l+p_h) by lg2 */
 	t = zero_low(p_l+p_h);
 	u = t*lg2_h;
 	v = (p_l-(t-p_h))*lg2+t*lg2_l;

mquickjs.c

@@ -38,7 +38,7 @@
 /*
   TODO:
   - regexp: better error position info
-  - use a specific MTAG for short functions intead of an immediate value
+  - use a specific MTAG for short functions instead of an immediate value
   - use hash table for atoms
   - set the length accessors as non configurable so that the
     'get_length' instruction optimizations are always safe.
@@ -51,7 +51,7 @@
       saved bytecode ?
   - reduced memory usage:
     - reduce JSFunctionBytecode size (remove source_pos)
-    - do not explictely store function names for get/set/bound
+    - do not explicitly store function names for get/set/bound
     - use JSSTDLibraryDef fields instead of copying them to JSContext ?
 */
 
@@ -1583,7 +1583,7 @@ static BOOL is_utf8_right_surrogate(const uint8_t *p)
 
 typedef struct {
     JSValue buffer; /* string, JSByteBuffer or JS_EXCEPTION */
-    int len; /* currrent string length (in bytes) */
+    int len; /* current string length (in bytes) */
     BOOL is_ascii;
 } StringBuffer;
 
@@ -3845,7 +3845,7 @@ static uint32_t get_ugolomb(const uint8_t *buf, uint32_t buf_len,
             break;
         i++;
         if (i == 32) {
-            /* errror */
+            /* error */
             *pindex = index;
             return 0xffffffff;
         }
@@ -5820,7 +5820,7 @@ JSValue JS_Call(JSContext *ctx, int call_flags)
                         goto get_field_slow;
                     for(;;) {
                         /* no array check is necessary because 'prop' is
-                           guaranted not to be a numeric property */
+                           guaranteed not to be a numeric property */
                         /* XXX: slow due to short ints */
                         pr = find_own_property_inlined(ctx, p, prop);
                         if (pr) {
@@ -5918,7 +5918,7 @@ JSValue JS_Call(JSContext *ctx, int call_flags)
                     if (unlikely(p->mtag != JS_MTAG_OBJECT))
                         goto put_field_slow;
                     /* no array check is necessary because 'prop' is
-                       guaranted not to be a numeric property */
+                       guaranteed not to be a numeric property */
                     /* XXX: slow due to short ints */
                     pr = find_own_property_inlined(ctx, p, prop);
                     if (unlikely(!pr))
@@ -9160,10 +9160,10 @@ static JSValue js_parse_pop_val(JSParseState *s)
     }
 
 /* WARNING: local variables are not preserved across PARSE_CALL(). So
-   they must be explicitely saved and restored */
+   they must be explicitly saved and restored */
 #define PARSE_CALL(s, cur_state, func, param) return (cur_state | (PARSE_FUNC_ ## func << 8) | ((param) << 16)); parse_state ## cur_state : ;
 
-/* preserve var1, ... accross the call */
+/* preserve var1, ... across the call */
 #define PARSE_CALL_SAVE1(s, cur_state, func, param, var1) \
     PARSE_PUSH_INT(s, var1);                                    \
     PARSE_CALL(s, cur_state, func, param);                      \
@@ -11227,13 +11227,13 @@ static void compute_stack_size_push(JSParseState *s,
     js_printf(s->ctx, "%5d: %d\n", pos, stack_len);
 #endif
     if (pos >= (uint32_t)arr->size)
-        js_parse_error(s, "bytecode buffer overlow (pc=%d)", pos);
+        js_parse_error(s, "bytecode buffer overflow (pc=%d)", pos);
     /* XXX: could avoid the division */
     short_stack_len = 1 + ((unsigned)stack_len % 255);
     if (explore_tab[pos] != 0) {
         /* already explored: check that the stack size is consistent */
         if (explore_tab[pos] != short_stack_len) {
-            js_parse_error(s, "unconsistent stack size: %d %d (pc=%d)", explore_tab[pos] - 1, short_stack_len - 1, (int)pos);
+            js_parse_error(s, "inconsistent stack size: %d %d (pc=%d)", explore_tab[pos] - 1, short_stack_len - 1, (int)pos);
         }
     } else {
         explore_tab[pos] = short_stack_len;
@@ -11291,7 +11291,7 @@ static void compute_stack_size(JSParseState *s, JSValue *pfunc)
         oi = &opcode_info[op];
         op_len = oi->size;
         if ((pos + op_len - 1) > arr->size) {
-            js_parse_error(s, "bytecode buffer overlow (pc=%d)", (int)(pos - 1));
+            js_parse_error(s, "bytecode buffer overflow (pc=%d)", (int)(pos - 1));
         }
         n_pop = oi->n_pop;
         if (oi->fmt == OP_FMT_npop)
@@ -14797,7 +14797,7 @@ JSValue js_array_sort(JSContext *ctx, JSValue *this_val,
 
     p = JS_VALUE_TO_PTR(*this_val);
     arr = JS_VALUE_TO_PTR(p->u.array.tab);
-    /* XXX: could resize the array in case it was shrinked by the compare function */
+    /* XXX: could resize the array in case it was shrank by the compare function */
     len = min_int(len, p->u.array.len);
     for(i = 0; i < len; i++) {
         arr->arr[i] = tab->arr[2 * i];

mquickjs_build.c

@@ -284,7 +284,7 @@ static int atom_cmp(const void *p1, const void *p2)
     return strcmp(a1->str, a2->str);
 }
 
-/* js_atom_table must be propertly aligned because the property hash
+/* js_atom_table must be properly aligned because the property hash
    table uses the low bits of the atom pointer value */
 #define ATOM_ALIGN 64
 

tests/microbench.js

@@ -757,7 +757,7 @@ function string_length(n)
     return n * 4;
 }
 
-/* incremental string contruction as local var */
+/* incremental string construction as local var */
 function string_build1(n)
 {
     var i, j, r;
@@ -770,7 +770,7 @@ function string_build1(n)
     return n * 100;
 }
 
-/* incremental string contruction as arg */
+/* incremental string construction as arg */
 function string_build2(n, r)
 {
     var i, j;
@@ -783,7 +783,7 @@ function string_build2(n, r)
     return n * 100;
 }
 
-/* incremental string contruction by prepending */
+/* incremental string construction by prepending */
 function string_build3(n, r)
 {
     var i, j;
@@ -796,7 +796,7 @@ function string_build3(n, r)
     return n * 100;
 }
 
-/* incremental string contruction with multiple reference */
+/* incremental string construction with multiple reference */
 function string_build4(n)
 {
     var i, j, r, s;

tests/test_loop.js

@@ -92,7 +92,7 @@ function test_for_in()
     }
     assert(tab.toString(), "1,x,y,4", "for_in");
 
-    /* non enumerable properties hide enumerables ones in the
+    /* non enumerable properties hide enumerable ones in the
        prototype chain */
     a = {y: 2, "1": 3};
     Object.defineProperty(a, "x", { value: 1 });
@@ -138,7 +138,7 @@ function test_for_in()
     }
     assert(tab.toString(), "x,y", "for_in");
 
-    /* variable assigment in the for in */
+    /* variable assignment in the for in */
 /*
     tab = [];
     for(var k = 2 in {x:1, y: 2}) {