aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDenis Vlasenko <vda.linux@googlemail.com>2008-06-23 13:06:34 +0000
committerDenis Vlasenko <vda.linux@googlemail.com>2008-06-23 13:06:34 +0000
commit2b75a94118b29df8d0aaa1240ab75a6ad48f2cd1 (patch)
treed136b31fd14eb9274a12aa71ab7621e24ead9c63
parentef527f50e62ee8c0c9f34e8c1ab0489f6b0b1293 (diff)
downloadbusybox-w32-2b75a94118b29df8d0aaa1240ab75a6ad48f2cd1.tar.gz
busybox-w32-2b75a94118b29df8d0aaa1240ab75a6ad48f2cd1.tar.bz2
busybox-w32-2b75a94118b29df8d0aaa1240ab75a6ad48f2cd1.zip
ash: improve readability of the code. No real code changes.
-rw-r--r--shell/ash.c18
1 files changed, 9 insertions, 9 deletions
diff --git a/shell/ash.c b/shell/ash.c
index 8a731fd68..e407dc395 100644
--- a/shell/ash.c
+++ b/shell/ash.c
@@ -11146,7 +11146,8 @@ xxreadtoken(void)
11146 } 11146 }
11147 } 11147 }
11148 } 11148 }
11149 return lasttoken = xxreadtoken_tokens[p - xxreadtoken_chars]; 11149 lasttoken = xxreadtoken_tokens[p - xxreadtoken_chars];
11150 return lasttoken;
11150 } 11151 }
11151 } 11152 }
11152 } /* for */ 11153 } /* for */
@@ -12997,21 +12998,19 @@ arith(const char *expr, int *perrcode)
12997 char arithval; /* Current character under analysis */ 12998 char arithval; /* Current character under analysis */
12998 operator lasttok, op; 12999 operator lasttok, op;
12999 operator prec; 13000 operator prec;
13000 13001 operator *stack, *stackptr;
13001 const char *p = endexpression; 13002 const char *p = endexpression;
13002 int errcode; 13003 int errcode;
13003 13004 v_n_t *numstack, *numstackptr;
13004 size_t datasizes = strlen(expr) + 2; 13005 unsigned datasizes = strlen(expr) + 2;
13005 13006
13006 /* Stack of integers */ 13007 /* Stack of integers */
13007 /* The proof that there can be no more than strlen(startbuf)/2+1 integers 13008 /* The proof that there can be no more than strlen(startbuf)/2+1 integers
13008 * in any given correct or incorrect expression is left as an exercise to 13009 * in any given correct or incorrect expression is left as an exercise to
13009 * the reader. */ 13010 * the reader. */
13010 v_n_t *numstack = alloca(((datasizes)/2)*sizeof(v_n_t)), 13011 numstackptr = numstack = alloca((datasizes / 2) * sizeof(numstack[0]));
13011 *numstackptr = numstack;
13012 /* Stack of operator tokens */ 13012 /* Stack of operator tokens */
13013 operator *stack = alloca((datasizes) * sizeof(operator)), 13013 stackptr = stack = alloca(datasizes * sizeof(stack[0]));
13014 *stackptr = stack;
13015 13014
13016 *stackptr++ = lasttok = TOK_LPAREN; /* start off with a left paren */ 13015 *stackptr++ = lasttok = TOK_LPAREN; /* start off with a left paren */
13017 *perrcode = errcode = 0; 13016 *perrcode = errcode = 0;
@@ -13040,7 +13039,8 @@ arith(const char *expr, int *perrcode)
13040 if (numstackptr != numstack+1) { 13039 if (numstackptr != numstack+1) {
13041 /* ... but if there isn't, it's bad */ 13040 /* ... but if there isn't, it's bad */
13042 err: 13041 err:
13043 return (*perrcode = -1); 13042 *perrcode = -1;
13043 return *perrcode;
13044 } 13044 }
13045 if (numstack->var) { 13045 if (numstack->var) {
13046 /* expression is $((var)) only, lookup now */ 13046 /* expression is $((var)) only, lookup now */