1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430
|
/*
* Copyright 1989 by Rayan S. Zachariassen, all rights reserved.
* This will be free software, but only when it is finished.
*/
/*
* This is an almost-standalone optimizer for the Shell pseudo-code.
* It usually improves execution time and code space by 20-40%.
*/
#include "hostenv.h"
#include <stdio.h>
#include <sys/stat.h>
#include "listutils.h"
#include "sh.h"
#include "shconfig.h"
#include "libsh.h"
#ifdef DEBUG
#define ASSERT_INRANGE(val,low,high) ({if (val < low || val > high) abort();})
#else
#define ASSERT_INRANGE(val,low,high)
#endif
#define LNEXT(x) (*((x)+1) & 0xFF)
#define LNEXTl(x) *((x)+1)
#define NEXT(x) (OutputTokens)LNEXT(x)
#define LNEXTNEXT(x) (*((x)+2) & 0xFF)
#define LNEXTNEXTl(x) *((x)+2)
#define NEXTNEXT(x) (OutputTokens)LNEXTNEXT(x)
/* NEXTNEXT only makes sense if nargs of NEXT(pc) is 0 */
#define LNEXTNEXTNEXT(x) (*((x)+3) & 0xFF)
#define LNEXTNEXTNEXTl(x) *((x)+3)
#define NEXTNEXTNEXT(x) (OutputTokens)LNEXTNEXTNEXT(x)
/* NEXTNEXTNEXT only makes sense if (as above) */
#define CODE(x) (OutputTokens)(code[(x)] & 0xFF)
#define JUMPADDRESS(x) ((code[(x)+1] & 0xFF) << 24 | \
(code[(x)+2] & 0xFF) << 16 | \
(code[(x)+3] & 0xFF) << 8 | \
(code[(x)+4] & 0xFF))
/*
* Shell pseudo-code optimizer.
*/
void *
optimize(print, Vcode, eocodep)
int print;
void *Vcode, **eocodep;
{
char *code = Vcode;
char *arg1, *bitmap;
char *pc, *spc;
char *eocode = (char*) *eocodep;
char *npc, *nspc, *ncode;
int *addrmap;
int coderange = (eocode - code)+1;
int cmd, argi1, i, j, k, scopetop = -1, commandtop = -1, quotenext;
short scope[MAXNSCOPES], command[MAXNCOMMANDS];
char *scopeaddr[MAXNSCOPES], *commandaddr[MAXNCOMMANDS];
quotenext = 0;
/* The ncode[] array may REPLACE the code[] array, thus it
MUST be malloc()ed buffer.. */
ncode = (char *)malloc(coderange);
if (ncode == NULL) {
fprintf(stderr, "%s: can't malloc %d bytes\n",
progname, (int)((char *)*eocodep - code));
return code;
}
#ifdef USE_ALLOCA
if ((addrmap = (int *)alloca((coderange) * sizeof(int))) == NULL ||
(bitmap = (char *)alloca((coderange)/8+1)) == NULL) {
fprintf(stderr, "%s: can't alloca %d bytes\n",
progname, (int)((char *)*eocodep - code));
return code;
}
memset(bitmap, 0, (coderange)/8+1);
#else /* Not USE_ALLOCA */
if ((addrmap = (int *)malloc((coderange) * sizeof(int))) == NULL ||
(bitmap = (char *)calloc((coderange)/8+1, 1)) == NULL) {
fprintf(stderr, "%s: can't malloc %d bytes\n",
progname, coderange);
if (addrmap) free(addrmap);
if (bitmap) free(bitmap);
/* If those previous ones succeeded, it was ncode that
failed.. no need to test and free it.. */
return code;
}
#endif
/* shut up compilers */
arg1 = NULL; spc = NULL; argi1 = 0;
again:
for (pc = code, npc = ncode; pc < eocode; ++pc) {
if ((*pc & 0xFF) >= ncommands) {
fprintf(stderr, "%s: unknown opcode %d at %d\n",
progname, (*pc & 0xFF), (int)(pc - code));
fprintf(stderr, "%s: previous opcode was %d\n",
progname, *(pc-1) & 0xFF);
break;
}
cmd = (*pc) & 0xFF;
if (print)
printf("%d:\t%s", (int)(pc-code), TOKEN_NAME(cmd));
spc = pc;
switch (TOKEN_NARGS(cmd)) {
case 1:
arg1 = (char *)++pc;
while (*pc != '\0')
++pc;
if (print)
printf("(%s)", arg1);
break;
case -1:
argi1 = (*++pc) & 0xFF;
argi1 <<= 8;
argi1 |= (*++pc) & 0xFF;
argi1 <<= 8;
argi1 |= (*++pc) & 0xFF;
argi1 <<= 8;
argi1 |= (*++pc) & 0xFF;
if (argi1 < 0 || argi1 > coderange-1)
printf("argi1 @%d outside coderange! %d (%d..%d)\n",
(int)(pc-code),argi1,0,coderange-1);
if (print)
printf("(%d)", argi1);
break;
}
nspc = npc;
ASSERT_INRANGE(spc-code,0,coderange-1);
addrmap[spc-code] = npc-ncode;
while (spc <= pc)
*npc++ = *spc++;
if (print) {
putchar('\n');
continue;
}
if (commandtop >= 0)
++command[commandtop];
switch ((OutputTokens)cmd) {
case sBufferSet:
if (quotenext == 0 && *arg1 == '\0') {
if (NEXT(pc) == sBufferAppend) {
npc = nspc;
LNEXTl(pc) = sBufferSet;
} else if (NEXT(pc) == sBufferSet) {
npc = nspc;
} else if ((NEXT(pc) == sDollarExpand
|| NEXT(pc) == sBufferQuote)
&& NEXTNEXT(pc) == sBufferAppend) {
npc = nspc;
LNEXTNEXTl(pc) = sBufferSet;
} else if (NEXT(pc) == sDollarExpand
&& NEXTNEXT(pc) == sBufferQuote
&& NEXTNEXTNEXT(pc) == sBufferAppend) {
npc = nspc;
LNEXTNEXTNEXTl(pc) = sBufferSet;
}
} else if (NEXT(pc) == sVariablePop
|| NEXT(pc) == sBufferSet
|| (NEXT(pc) == sIOsetOut
&& NEXTNEXT(pc) == sBufferSet))
npc = nspc;
break;
case sBufferQuote:
quotenext = 1;
continue;
case sBufferAppend:
case sBufferExpand:
case sBufferSetFromArgV:
case sArgVpush:
case sArgList:
case sVariableCdr:
case sVariablePush:
case sVariablePop:
case sVariableBuffer:
case sVariableAppend:
case sVariableLoopAttach:
break;
case sCommandPush:
if (NEXT(pc) == sCommandPop) {
npc = nspc; /* skip the CommandPush */
++pc; /* skip the CommandPop */
} else {
if (commandtop >= 0)
--command[commandtop];
command[++commandtop] = 0;
commandaddr[commandtop] = nspc;
}
break;
case sCommandPop:
--command[commandtop];
if (command[commandtop] == 0) {
/* this command push/pop pair is superfluous */
*commandaddr[commandtop] = (u_char)sNoOp;
npc = nspc; /* superfluous commandPop */
}
--commandtop;
break;
case sCommandCarryBuffer:
case sIOopen:
case sIOopenString:
case sIOopenPortal:
case sIOintoBuffer:
case sIOclose:
case sIOdup:
break;
case sIOsetIn:
case sIOsetInOut:
case sIOsetOut:
case sIOsetAppend:
if (NEXT(pc) == sIOdup)
npc = nspc; /* skip the sIOset{In,Out} */
break;
case sIOsetDesc:
case sAssign:
case sAssignTemporary:
break;
case sFunction:
case sJump:
while (CODE(argi1) == sJump)
argi1 = JUMPADDRESS(argi1);
if (argi1 == pc-code+1)
npc = nspc; /* superfluous Jump */
else {
*(npc-1) = argi1 & 0xff;
*(npc-2) = (argi1 >> 8) & 0xff;
*(npc-3) = (argi1 >> 16) & 0xff;
*(npc-4) = (argi1 >> 24) & 0xff;
}
if (npc != nspc /* jump wasn't superfluous */
&& NEXT(pc) == sJump) {
/* superfluous jump because it is cascaded */
ASSERT_INRANGE(pc-code+1,0,coderange-1);
addrmap[pc-code+1] = npc-ncode;
pc += 5; /* skip next Jump command */
}
if (npc != nspc) {
if (argi1 < pc-code) {
ASSERT_INRANGE(argi1,0,coderange-1);
i = addrmap[argi1];
} else {
ASSERT_INRANGE(npc-4-ncode,0,coderange-1);
i = -argi1, BITSET(bitmap,npc-4-ncode);
}
*(npc-1) = i & 0xff;
*(npc-2) = (i >> 8) & 0xff;
*(npc-3) = (i >> 16) & 0xff;
*(npc-4) = (i >> 24) & 0xff;
}
break;
case sBranchOrigin:
fprintf(stderr, "%s: unpatched branch at %d\n",
progname, (int)(pc-code));
break;
case sJumpFork:
while (CODE(argi1) == sJump)
argi1 = JUMPADDRESS(argi1);
if (argi1 < pc-code) {
ASSERT_INRANGE(argi1,0,coderange-1);
i = addrmap[argi1];
} else {
ASSERT_INRANGE(npc-4-ncode,0,coderange-1);
i = -argi1, BITSET(bitmap,npc-4-ncode);
}
*(npc-1) = i & 0xff;
*(npc-2) = (i >> 8) & 0xff;
*(npc-3) = (i >>16) & 0xff;
*(npc-4) = (i >>24) & 0xff;
break;
case sJumpIfFailure:
while (argi1 < (eocode - code)
&& (CODE(argi1) == sJump
|| CODE(argi1) == sJumpIfFailure)) {
argi1 = JUMPADDRESS(argi1);
}
if (argi1 < pc-code) {
ASSERT_INRANGE(argi1,0,coderange-1);
i = addrmap[argi1];
} else {
ASSERT_INRANGE(npc-4-ncode,0,coderange-1);
i = -argi1;
BITSET(bitmap, npc-4-ncode);
}
*(npc-1) = i & 0xff;
*(npc-2) = (i >> 8) & 0xff;
*(npc-3) = (i >> 16) & 0xff;
*(npc-4) = (i >> 24) & 0xff;
break;
#ifdef MAILER
case sSiftPush:
case sSiftBody:
case sSiftCompileRegexp:
case sSiftReevaluate:
case sSiftPop:
case sSiftBufferAppend:
case sTSiftPush:
case sTSiftBody:
case sTSiftCompileRegexp:
case sTSiftReevaluate:
case sTSiftPop:
/* case sTSiftBufferAppend: */
break;
case sJumpIfRegmatch:
case sTJumpIfRegmatch:
#endif /* MAILER */
case sJumpIfSuccess:
case sJumpIfNilVariable:
case sJumpIfFindVarNil:
case sJumpIfOrValueNil:
case sJumpLoopBreak:
case sJumpLoopContinue:
if (argi1 < pc-code) {
ASSERT_INRANGE(argi1,0,coderange-1);
i = addrmap[argi1];
} else {
ASSERT_INRANGE(npc-4-ncode,0,coderange-1);
i = -argi1, BITSET(bitmap,npc-4-ncode);
}
*(npc-1) = i & 0xff;
*(npc-2) = (i >> 8) & 0xff;
*(npc-3) = (i >> 16) & 0xff;
*(npc-4) = (i >> 24) & 0xff;
break;
case sJumpIfMatch:
while (CODE(argi1) == sJumpIfMatch
|| CODE(argi1) == sJump)
argi1 = JUMPADDRESS(argi1);
if (argi1 < pc-code) {
ASSERT_INRANGE(argi1,0,coderange-1);
i = addrmap[argi1];
} else {
ASSERT_INRANGE(npc-4-ncode,0,coderange-1);
i = -argi1, BITSET(bitmap,npc-4-ncode);
}
*(npc-1) = i & 0xff;
*(npc-2) = (i >> 8) & 0xff;
*(npc-3) = (i >> 16) & 0xff;
*(npc-4) = (i >> 24) & 0xff;
break;
case sLocalVariable:
--command[commandtop];
/* FALL THROUGH */
case sParameter:
scope[scopetop] = 1;
break;
case sScopePush:
scope[++scopetop] = 0;
scopeaddr[scopetop] = nspc;
if (commandtop >= 0)
--command[commandtop];
break;
case sScopePop:
if (scope[scopetop] == 0
/*
* WARNING!!! the following optimization is on
* the assumption that two ScopePop's in a row
* will only occur for local variables in a
* function, which is usually a benign assumption.
* IT MAY BECOME THE SOURCE OF STRANGE BEHAVIOUR!
*/
|| NEXT(pc) == sScopePop) {
/* this scope push/pop pair is superfluous */
*scopeaddr[scopetop] = (u_char)sNoOp;
npc = nspc; /* superfluous scopePop */
}
--scopetop;
if (commandtop >= 0)
--command[commandtop];
case sDollarExpand:
case sPrintAndExit:
case sLoopEnter:
case sLoopExit:
case sBackground:
break;
case sNoOp:
npc = nspc; /* superfluous command */
if (commandtop >= 0)
--command[commandtop];
break;
default:
break;
}
quotenext = 0;
}
if (print)
goto done;
ASSERT_INRANGE(spc-code,0,coderange-1);
addrmap[spc-code] = npc-ncode; /* in case we jump to after eocode */
for (i = 0; i <= npc-ncode; i += 8) { /* yes, the <= is on purpose */
ASSERT_INRANGE(i,0,coderange-1);
if (bitmap[i/8]) {
for (j = 0; j < 8; ++j) {
if (BITTEST(bitmap,i+j)) {
k = ncode[i+j ] & 0xFF;
k <<= 8;
k |= ncode[i+j+1] & 0xFF;
k <<= 8;
k |= ncode[i+j+2] & 0xFF;
k <<= 8;
k |= ncode[i+j+3] & 0xFF;
ASSERT_INRANGE(-k,0,coderange-1);
k = addrmap[-k];
ncode[i+j ] = (k >>24) & 0xff;
ncode[i+j+1] = (k >>16) & 0xff;
ncode[i+j+2] = (k >> 8) & 0xff;
ncode[i+j+3] = k & 0xff;
}
}
bitmap[i/8] = 0; /* so we can reuse the bitmap */
}
}
if (npc-ncode < pc-code) {
*eocodep = eocode = ncode + (npc-ncode);
spc = ncode;
ncode = code;
code = spc;
goto again;
}
done:
#ifndef USE_ALLOCA
free((char *)addrmap);
free(bitmap);
#endif
free(ncode);
return code;
}
|