Fix common misspellings

Following misspellings were fixed:

accross->across
calulate->calculate
existance->existence
existant->existent
isnt->isn't
paranthesis->parenthesis
reffered->referred
runing->running
statment->statement
tranformed->transformed
unfortunatly->unfortunately
usefull->useful



SVN revision: 51964

legacy/embryo/doc/embryo.dox.in

@@ -289,7 +289,7 @@ This is the @e only file you need to include.
 
 /**
   @def EMBRYO_FUNCTION_NONE 
-  An invalid/non-existant function.
+  An invalid/non-existent function.
 */
 
 /**

legacy/embryo/m4/efl_binary.m4

@@ -4,9 +4,9 @@ dnl That code is public domain and can be freely used or copied.
 dnl Macro that check if a binary is built or not
 
 dnl Usage: EFL_ENABLE_BIN(binary)
-dnl Call AC_SUBST(BINARY_PRG) (BINARY is the uppercase of binary, - being tranformed into _)
-dnl Define have_binary (- is tranformed into _)
-dnl Define conditional BUILD_BINARY (BINARY is the uppercase of binary, - being tranformed into _)
+dnl Call AC_SUBST(BINARY_PRG) (BINARY is the uppercase of binary, - being transformed into _)
+dnl Define have_binary (- is transformed into _)
+dnl Define conditional BUILD_BINARY (BINARY is the uppercase of binary, - being transformed into _)
 
 AC_DEFUN([EFL_ENABLE_BIN],
 [

legacy/embryo/src/bin/embryo_cc_prefix.c

@@ -205,7 +205,7 @@ _e_prefix_share_hunt(void)
    char buf[4096], buf2[4096], *p;
    struct stat st;
 
-   /* sometimes this isnt the case - so we need to do a more exhaustive search
+   /* sometimes this isn't the case - so we need to do a more exhaustive search
     * through more parent and subdirs. hre is an example i have seen:
     *
     * /blah/whatever/exec/bin/exe

legacy/embryo/src/bin/embryo_cc_sc1.c

@@ -828,7 +828,7 @@ parse(void)
 	  case tSTATIC:
 	     /* This can be a static function or a static global variable;
 	      * we know which of the two as soon as we have parsed up to the
-	      * point where an opening paranthesis of a function would be
+	      * point where an opening parenthesis of a function would be
 	      * expected. To back out after deciding it was a declaration of
 	      * a static variable after all, we have to store the symbol name
 	      * and tag.
@@ -2705,7 +2705,7 @@ doarg(char *name, int ident, int offset, int tags[], int numtags,
 		  arg->hasdefault = TRUE;	/* argument has default value */
 		  arg->defvalue.array.size = litidx;
 		  arg->defvalue.array.addr = -1;
-		  /* calulate size to reserve on the heap */
+		  /* calculate size to reserve on the heap */
 		  arg->defvalue.array.arraysize = 1;
 		  for (i = 0; i < arg->numdim; i++)
 		     arg->defvalue.array.arraysize *= arg->dim[i];
@@ -2989,7 +2989,7 @@ destructsymbols(symbol * root, int level)
 	     operator_symname(symbolname, "~", sym->tag, 0, 1, 0);
 	     if ((opsym = findglb(symbolname)))
 	       {
-		  /* save PRI, in case of a return statment */
+		  /* save PRI, in case of a return statement */
 		  if (!savepri)
 		    {
 		       push1();	/* right-hand operand is in PRI */
@@ -3797,7 +3797,7 @@ doswitch(void)
    while (tok != '}');
 
 #if !defined NDEBUG
-   /* verify that the case table is sorted (unfortunatly, duplicates can
+   /* verify that the case table is sorted (unfortunately, duplicates can
     * occur; there really shouldn't be duplicate cases, but the compiler
     * may not crash or drop into an assertion for a user error). */
    for (cse = caselist.next; cse && cse->next; cse = cse->next)

legacy/embryo/src/bin/embryo_cc_sc3.c

@@ -221,7 +221,7 @@ check_userop(void   (*oper) (void), int tag1, int tag2, int numparam,
 	   return FALSE;
      }				/* if */
 
-   /* check existance and the proper declaration of this function */
+   /* check existence and the proper declaration of this function */
    if ((sym->usage & uMISSING) != 0 || (sym->usage & uPROTOTYPED) == 0)
      {
 	char                symname[2 * sNAMEMAX + 16];	/* allow space for user defined operators */
@@ -266,7 +266,7 @@ check_userop(void   (*oper) (void), int tag1, int tag2, int numparam,
    else if (savealt)
      {
 	/* for the assignment operator, ALT may contain an address at which the
-	 * result must be stored; this address must be preserved accross the
+	 * result must be stored; this address must be preserved across the
 	 * call
 	 */
 	assert(lval != NULL);	/* this was checked earlier */
@@ -820,7 +820,7 @@ array_levelsize(symbol * sym, int level)
  *
  *  Lowest hierarchy level (except for the , operator).
  *
- *  Global references: intest   (reffered to only)
+ *  Global references: intest   (referred to only)
  */
 int
 hier14(value * lval1)

legacy/embryo/src/bin/embryo_cc_sc5.c

@@ -49,9 +49,9 @@ static int errstart;	/* line number at which the instruction started */
  *  errors are ignored until lex() finds a semicolumn or a keyword
  *  (lex() resets "errflag" in that case).
  *
- *  Global references: inpfname   (reffered to only)
- *                     fline      (reffered to only)
- *                     fcurrent   (reffered to only)
+ *  Global references: inpfname   (referred to only)
+ *                     fline      (referred to only)
+ *                     fcurrent   (referred to only)
  *                     errflag    (altered)
  */
 int

legacy/embryo/src/bin/embryo_cc_sc6.c

@@ -662,7 +662,7 @@ assemble(FILE * fout, FILE * fin)
 
 #if !defined NDEBUG
    /* verify that the opcode list is sorted (skip entry 1; it is reserved
-    * for a non-existant opcode)
+    * for a non-existent opcode)
     */
    assert(opcodelist[1].name != NULL);
    for (i = 2; i < (sizeof opcodelist / sizeof opcodelist[0]); i++)

legacy/embryo/src/bin/embryo_cc_sc7.c

@@ -235,7 +235,7 @@ typedef struct
  *  by '[', sENDREORDER by ']' and sEXPRSTART by '|' the following applies:
  *     '[]...'     valid, but useless; no output
  *     '[|...]     valid, but useless; only one string
- *     '[|...|...] valid and usefull
+ *     '[|...|...] valid and useful
  *     '[...|...]  invalid, first string doesn't start with '|'
  *     '[|...|]    invalid
  */
@@ -316,7 +316,7 @@ stgstring(char *start, char *end)
  *  Scraps code from the staging buffer by resetting "stgidx" to "index".
  *
  *  Global references: stgidx (altered)
- *                     staging (reffered to only)
+ *                     staging (referred to only)
  */
 void
 stgdel(int index, cell code_index)

legacy/embryo/src/lib/Embryo.h

@@ -76,7 +76,7 @@ extern "C" {
      };
 
    /* possible function type values that are enumerated */
-#define EMBRYO_FUNCTION_NONE 0x7fffffff /* An invalid/non existant function */
+#define EMBRYO_FUNCTION_NONE 0x7fffffff /* An invalid/non existent function */
 #define EMBRYO_FUNCTION_MAIN -1         /* Start at program entry point */
 #define EMBRYO_FUNCTION_CONT -2         /* Continue from last address */
   /** An invalid cell reference */

legacy/embryo/src/lib/embryo_amx.c

@@ -2062,7 +2062,7 @@ embryo_program_run(Embryo_Program *ep, Embryo_Function fn)
 
 		       entry_name = GETENTRYNAME(hdr, func_entry);
 		       if (i == offs)
-			 printf("EMBRYO: CALL [%i] %s() non-existant!\n", i, entry_name);
+			 printf("EMBRYO: CALL [%i] %s() non-existent!\n", i, entry_name);
 		       func_entry =
 			 (Embryo_Func_Stub *)((unsigned char *)func_entry + hdr->defsize);
 		    }
@@ -2193,7 +2193,7 @@ embryo_program_return_value_get(Embryo_Program *ep)
  * run for a specific period of time. If the cycle count is set to something
  * low like 5000 or 1000, then every 1000 (or 5000) cycles control will be
  * returned to the calling process where it can check a timer to see if a
- * physical runtime limit has been elapsed and then abort runing further
+ * physical runtime limit has been elapsed and then abort running further
  * assuming a "runaway script" or keep continuing the script run. This
  * limits resolution to only that many cycles which do not take a determined
  * amount of time to execute, as this varies from cpu to cpu and also depends