Fix spelling (#128)

* Fix spelling in .cpp files

* Fix spelling in all files

liba/src/armv7m/longjmp.s

@@ -5,7 +5,7 @@
 .thumb
 .global longjmp
 longjmp:
-  /* Restore all the regsiters to get back in the original state (whenever the
+  /* Restore all the registers to get back in the original state (whenever the
      matching setjmp was called. */
   // General purpose registers
   ldmia  r0!, { r4-r11, ip, lr }

liba/src/external/openbsd/e_log.c

@@ -11,7 +11,7 @@
  */
 
 /* log(x)
- * Return the logrithm of x
+ * Return the logarithm of x
  *
  * Method :                  
  *   1. Argument Reduction: find k and f such that 

liba/src/external/openbsd/e_sqrt.c

@@ -38,7 +38,7 @@
  *	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)
@@ -121,7 +121,7 @@ sqrt(double x)
 	    ix0 |= (ix1>>(32-i));
 	    ix1 <<= i;
 	}
-	m -= 1023;	/* unbias exponent */
+	m -= 1023;	/* unbiased exponent */
 	ix0 = (ix0&0x000fffff)|0x00100000;
 	if(m&1){	/* odd m, double x to make it even */
 	    ix0 += ix0 + ((ix1&sign)>>31);
@@ -266,7 +266,7 @@ A.  sqrt(x) by Newton Iteration
 	This formula has one division fewer than the one above; however,
 	it requires more multiplications and additions. Also x must be
 	scaled in advance to avoid spurious overflow in evaluating the
-	expression 3y*y+x. Hence it is not recommended uless division
+	expression 3y*y+x. Hence it is not recommended unless division
 	is slow. If division is very slow, then one should use the 
 	reciproot algorithm given in section B.
 
@@ -316,7 +316,7 @@ B.  sqrt(x) by Reciproot Iteration
 
 	Let x0 and x1 be the leading and the trailing 32-bit words of
 	a floating point number x (in IEEE double format) respectively
-	(see section A). By performing shifs and subtracts on x0 and y0,
+	(see section A). By performing shifts and subtracts on x0 and y0,
 	we obtain a 7.8-bit approximation of 1/sqrt(x) as follows.
 
 	    k := 0x5fe80000 - (x0>>1);

liba/src/external/openbsd/e_sqrtf.c

@@ -45,7 +45,7 @@ sqrtf(float x)
 	    for(i=0;(ix&0x00800000)==0;i++) ix<<=1;
 	    m -= i-1;
 	}
-	m -= 127;	/* unbias exponent */
+	m -= 127;	/* unbiased exponent */
 	ix = (ix&0x007fffff)|0x00800000;
 	if(m&1)	/* odd m, double x to make it even */
 	    ix += ix;

liba/src/external/openbsd/k_rem_pio2.c

@@ -48,7 +48,7 @@
  *			64-bit  precision	2
  *			113-bit precision	3
  *		The actual value is the sum of them. Thus for 113-bit
- *		precison, one may have to do something like:
+ *		precision, one may have to do something like:
  *
  *		long double t,w,r_head, r_tail;
  *		t = (long double)y[2] + (long double)y[1];
@@ -307,7 +307,7 @@ __kernel_rem_pio2(double *x, double *y, int e0, int nx, int prec)
 
 	jz = jk;
 recompute:
-    /* distill q[] into iq[] reversingly */
+    /* distill q[] into iq[] reversely */
 	for(i=0,j=jz,z=q[jz];j>0;i++,j--) {
 	    fw    =  (double)((int32_t)(twon24* z));
 	    iq[i] =  (int32_t)(z-two24*fw);

liba/src/external/openbsd/k_rem_pio2f.c

@@ -68,7 +68,7 @@ __kernel_rem_pio2f(float *x, float *y, int e0, int nx, int prec,
 
 	jz = jk;
 recompute:
-    /* distill q[] into iq[] reversingly */
+    /* distill q[] into iq[] reversely */
 	for(i=0,j=jz,z=q[jz];j>0;i++,j--) {
 	    fw    =  (float)((int32_t)(twon8* z));
 	    iq[i] =  (int32_t)(z-two8*fw);

liba/src/external/sqlite/sqliteInt.h

@@ -29,7 +29,7 @@ typedef int64_t sqlite3_int64;
 #define UNUSED_PARAMETER(x) ((void)0)
 #define SQLITE_OK 0
 
-/* Completly ignore asserts: one of them contains a modulo, which our platform
+/* Completely ignore asserts: one of them contains a modulo, which our platform
  * doesn't support in hardware. This therefore translates to a __aeabi_idivmod
  * call, which we do not provide. */
 #define assert(x) ((void)0)