token_p tp;
tkdef_p tdp;
int tinstno;
- struct reginfo *rp,**rpp;
+ register struct reginfo *rp;
+ struct reginfo **rpp;
token_t token,mtoken,token2;
int propno;
int exactmatch;
token_p regtp[MAXCREG];
c3_p regcp[MAXCREG];
rl_p regls[MAXCREG];
- c3_p cp,findcoerc();
+ c3_p findcoerc();
int sret;
token_t reptoken[MAXREPLLEN];
int emrepllen,eminstr;
i=0; nregneeded = 0;
while (i<tokpatlen && tp>=fakestack) {
if (!match(tp,&machsets[tokexp[i]],0)) {
- cp = findcoerc(tp, &machsets[tokexp[i]]);
+ register c3_p cp = findcoerc(tp, &machsets[tokexp[i]]);
if (cp==0) {
for (j=0;j<nregneeded;j++)
regtp[j] -= (tp-fakestack+1);
regtp[j] += stackpad;
tp = &fakestack[stackpad-1];
while (i<tokpatlen && tp>=fakestack) {
- cp = findcoerc((token_p) 0, &machsets[tokexp[i]]);
+ register c3_p cp = findcoerc((token_p) 0, &machsets[tokexp[i]]);
if (cp==0) {
assert(!toplevel);
for (j=0;j<nregneeded;j++)
result_t undefres= {EV_UNDEF};
-result_t compute(node) node_p node; {
+result_t compute(node) register node_p node; {
result_t leaf1,leaf2,result;
token_p tp;
int desc;