#endif
*/
-void errsignal(exception)
-int exception;
+void errsignal(int exception)
{
- word signum, ah, am;
+ word signum, ah, am;
- signum = scot[ exception ];
- /* A.Salwicki 30 pazdz. 2002 *
- fprintf(stderr, "\n signum= %ld\n", signum);
-
- * fprintf(stderr, " Wlazl kotek"); *
-
-
+ signum = scot[exception];
+ /* A.Salwicki 30 pazdz. 2002 *
+ fprintf(stderr, "\n signum= %ld\n", signum);
+
+ * fprintf(stderr, " Wlazl kotek"); *
+
if (signum != -1) * attempt to call a handler *
{
} *
}
*/
-
+
/* A. Salwicki 27-10-2002
#if MSDOS && !NO_GRAPH
- {
+ {
extern bool graphmode;
- if (graphmode) groff();
+ if (graphmode)
+ groff();
graphmode = FALSE;
- }
+ }
#endif
*/
- putc('\n', stderr);
- switch (exception)
- {
- case RTESLCOF: fprintf(stderr, " SL CHAIN CUT OFF"); break;
- case RTEUNSTP: fprintf(stderr, " UNIMPLEMENTED STANDARD PROCEDURE"); break;
- case RTEILLAT: fprintf(stderr, " ILLEGAL ATTACH"); break;
- case RTEILLDT: fprintf(stderr, " ILLEGAL DETACH"); break;
- case RTECORTM: fprintf(stderr, " COROUTINE TERMINATED"); break;
- case RTECORAC: fprintf(stderr, " COROUTINE ACTIVE"); break;
- case RTEINVIN: fprintf(stderr, " ARRAY INDEX ERROR"); break;
- case RTEILLAB: fprintf(stderr, " INCORRECT ARRAY BOUNDS"); break;
- case RTEINCQA: fprintf(stderr, " IMPROPER QUA"); break;
- case RTEINCAS: fprintf(stderr, " ILLEGAL ASSIGNMENT"); break;
- case RTEFTPMS: fprintf(stderr, " FORMAL TYPE MISSING"); break;
- case RTEILLKL: fprintf(stderr, " ILLEGAL KILL"); break;
- case RTEILLCP: fprintf(stderr, " ILLEGAL COPY"); break;
- case RTEINCHS: fprintf(stderr, " INCOMPATIBLE HEADERS"); break;
- case RTEHNDNF: fprintf(stderr, " HANDLER NOT FOUND"); break;
- case RTEMEMOV: fprintf(stderr, " MEMORY OVERFLOW"); break;
- case RTEFHTLG: fprintf(stderr, " FORMAL LIST TOO LONG"); break;
- case RTEILLRT: fprintf(stderr, " ILLEGAL RETURN"); break;
- case RTEREFTN: fprintf(stderr, " REFERENCE TO NONE"); break;
- case RTEDIVBZ: fprintf(stderr, " DIVISION BY ZERO"); break;
- case RTESYSER: fprintf(stderr, " SYSTEM ERROR"); break;
- case RTEILLIO: fprintf(stderr, " ILLEGAL I/O OPERATION"); break;
- case RTEIOERR: fprintf(stderr, " I/O ERROR"); break;
- case RTECNTOP: fprintf(stderr, " CANNOT OPEN FILE"); break;
- case RTEBADFM: fprintf(stderr, " INPUT DATA FORMAT BAD"); break;
- case RTEILLRS: fprintf(stderr, " ILLEGAL RESUME"); break;
- case RTETMPRC: fprintf(stderr, " TOO MANY PROCESSES ON ONE MACHINE"); break;
- case RTEINVND: fprintf(stderr, " INVALID NODE NUMBER"); break;
- case RTENEGST: fprintf(stderr, " NEGATIVE STEP VALUE"); break;
- case RTENONGL: fprintf(stderr, " REFERENCE TO GLOBAL NON PROCESS OBJECT FROM PROCESS"); break;
- default : fprintf(stderr, " UNRECOGNIZED ERROR");
- }
- if (thisp->trlnumber < 0) thisp->trlnumber = - thisp->trlnumber;
- if (thisp->trlnumber != 0)
- fprintf(stderr, "\n AT LINE: %ld\n", (long) thisp->trlnumber);
- endprocess(4);
-} /* end errsignal */
-
+ putc('\n', stderr);
+ switch (exception) {
+ case RTESLCOF:
+ fprintf(stderr, " SL CHAIN CUT OFF");
+ break;
+ case RTEUNSTP:
+ fprintf(stderr, " UNIMPLEMENTED STANDARD PROCEDURE");
+ break;
+ case RTEILLAT:
+ fprintf(stderr, " ILLEGAL ATTACH");
+ break;
+ case RTEILLDT:
+ fprintf(stderr, " ILLEGAL DETACH");
+ break;
+ case RTECORTM:
+ fprintf(stderr, " COROUTINE TERMINATED");
+ break;
+ case RTECORAC:
+ fprintf(stderr, " COROUTINE ACTIVE");
+ break;
+ case RTEINVIN:
+ fprintf(stderr, " ARRAY INDEX ERROR");
+ break;
+ case RTEILLAB:
+ fprintf(stderr, " INCORRECT ARRAY BOUNDS");
+ break;
+ case RTEINCQA:
+ fprintf(stderr, " IMPROPER QUA");
+ break;
+ case RTEINCAS:
+ fprintf(stderr, " ILLEGAL ASSIGNMENT");
+ break;
+ case RTEFTPMS:
+ fprintf(stderr, " FORMAL TYPE MISSING");
+ break;
+ case RTEILLKL:
+ fprintf(stderr, " ILLEGAL KILL");
+ break;
+ case RTEILLCP:
+ fprintf(stderr, " ILLEGAL COPY");
+ break;
+ case RTEINCHS:
+ fprintf(stderr, " INCOMPATIBLE HEADERS");
+ break;
+ case RTEHNDNF:
+ fprintf(stderr, " HANDLER NOT FOUND");
+ break;
+ case RTEMEMOV:
+ fprintf(stderr, " MEMORY OVERFLOW");
+ break;
+ case RTEFHTLG:
+ fprintf(stderr, " FORMAL LIST TOO LONG");
+ break;
+ case RTEILLRT:
+ fprintf(stderr, " ILLEGAL RETURN");
+ break;
+ case RTEREFTN:
+ fprintf(stderr, " REFERENCE TO NONE");
+ break;
+ case RTEDIVBZ:
+ fprintf(stderr, " DIVISION BY ZERO");
+ break;
+ case RTESYSER:
+ fprintf(stderr, " SYSTEM ERROR");
+ break;
+ case RTEILLIO:
+ fprintf(stderr, " ILLEGAL I/O OPERATION");
+ break;
+ case RTEIOERR:
+ fprintf(stderr, " I/O ERROR");
+ break;
+ case RTECNTOP:
+ fprintf(stderr, " CANNOT OPEN FILE");
+ break;
+ case RTEBADFM:
+ fprintf(stderr, " INPUT DATA FORMAT BAD");
+ break;
+ case RTEILLRS:
+ fprintf(stderr, " ILLEGAL RESUME");
+ break;
+ case RTETMPRC:
+ fprintf(stderr, " TOO MANY PROCESSES ON ONE MACHINE");
+ break;
+ case RTEINVND:
+ fprintf(stderr, " INVALID NODE NUMBER");
+ break;
+ case RTENEGST:
+ fprintf(stderr, " NEGATIVE STEP VALUE");
+ break;
+ case RTENONGL:
+ fprintf(stderr, " REFERENCE TO GLOBAL NON PROCESS OBJECT FROM PROCESS");
+ break;
+ default:
+ fprintf(stderr, " UNRECOGNIZED ERROR");
+ }
+ if (thisp->trlnumber < 0)
+ thisp->trlnumber = -thisp->trlnumber;
+ if (thisp->trlnumber != 0)
+ fprintf(stderr, "\n AT LINE: %ld\n", (long)thisp->trlnumber);
+ endprocess(4);
+}
-void raise_signal(signal, skip, ahnew, amnew) /* Raise exception */
-word signal, skip;
-word *ahnew, *amnew;
+/**
+ * Raise exception
+ */
+void raise_signal(word signal, word skip, word *ahnew, word *amnew)
{
- word t1, t2, t3, t4, t5, virts;
- protdescr *ptr;
-
- t1 = 0; /* handler for others = no */
- t2 = M[ display2+M[ c1+PROTNUM ] ]; /* ah of current */
- t3 = c1; /* am of current */
- t5 = 0; /* flag handler not found */
- do
- {
- ptr = prototype[ M[ t3+PROTNUM ] ]; /* prototype of current */
- t4 = ptr->handlerlist;
- if (t4 != 0) /* any handlers ? */
- {
- do
- {
- t5 = M[ t4 ]; /* signal number */
- if (t5 != signal)
- {
- if (t5 == 0 && t1 == 0) t1 = t4;
- t4 = M[ t4+2 ];
+ word t1, t2, t3, t4, t5, virts;
+ protdescr *ptr;
+
+ /* handler for others = no */
+ t1 = 0;
+ /* ah of current */
+ t2 = M[display2 + M[c1 + PROTNUM]];
+ /* am of current */
+ t3 = c1;
+ /* flag handler not found */
+ t5 = 0;
+ do {
+ /* prototype of current */
+ ptr = prototype[M[t3 + PROTNUM]];
+ t4 = ptr->handlerlist;
+ /* any handlers ? */
+ if (t4 != 0) {
+ do {
+ /* signal number */
+ t5 = M[ t4 ];
+ if (t5 != signal) {
+ if (t5 == 0 && t1 == 0)
+ t1 = t4;
+ t4 = M[t4 + 2];
+ }
+ } while (t5 != signal && t4 != 0);
}
- } while (t5 != signal && t4 != 0);
- }
- if (t5 != signal) /* look in DL or SL */
- {
- if (t1 != 0) t4 = t1; /* handler for others found */
- else
- {
- t4 = t3+M[ t3 ];
- if (ptr->kind == HANDLER)
- t2 = M[ t4+SL ]; /* use SL for handlers */
- else
- t2 = M[ t4+DL ]; /* or DL for other goodies */
- if (t2 == 0) /* handler not found */
- {
- if (signal <= MAXSYSSN)
- { /* system signal */
- ic = skip;
- if (ic != 0) longjmp(contenv, 1);
- else return;
- }
- else errsignal(RTEHNDNF);
+ /* look in DL or SL */
+ if (t5 != signal) {
+ /* handler for others found */
+ if (t1 != 0)
+ t4 = t1;
+ else {
+ t4 = t3 + M[t3];
+ if (ptr->kind == HANDLER) {
+ /* use SL for handlers */
+ t2 = M[t4 + SL];
+ } else {
+ /* or DL for other goodies */
+ t2 = M[t4 + DL];
+ }
+ /* handler not found */
+ if (t2 == 0) {
+ /* system signal */
+ if (signal <= MAXSYSSN) {
+ ic = skip;
+ if (ic != 0)
+ longjmp(contenv, 1);
+ else
+ return;
+ }
+ else
+ errsignal(RTEHNDNF);
+ }
+ t3 = M[t2];
+ }
+ } else {
+ t1 = 0;
}
- t3 = M[ t2 ];
- }
+ } while (t1 == 0 && t5 != signal);
+
+ virts = thisp->prochead + M[thisp->prochead] + VIRTSC;
+ /* compactification possible */
+ M[virts] = t2;
+ M[virts + 1] = M[t2 + 1];
+ /* prototype number of handler */
+ t3 = M[t4 + 1];
+ t5 = prototype[t3]->appetite;
+ /* others */
+ if (t1 != 0) {
+ request(t5, ahnew, amnew);
+ M[*amnew + M[*amnew] + SIGNR] = 0;
+ } else {
+ if (signal == scot[RTEMEMOV] &&
+ thisp->lastitem - thisp->lastused-1 < t5) {
+ /* make memov look like abort */
+ scot[RTEMEMOV] = -1;
+ errsignal(RTEMEMOV);
+ }
+ request(t5, ahnew, amnew);
+ M[*amnew + M[*amnew] + SIGNR] = signal;
}
- else t1 = 0;
- } while (t1 == 0 && t5 != signal);
-
- virts = thisp->prochead+M[ thisp->prochead ]+VIRTSC;
- M[ virts ] = t2; /* compactification possible */
- M[ virts+1 ] = M[ t2+1 ];
- t3 = M[ t4+1 ]; /* prototype number of handler */
- t5 = prototype[ t3 ]->appetite;
- if (t1 != 0) /* others */
- {
- request(t5, ahnew, amnew);
- M[ *amnew+M[ *amnew ]+SIGNR ] = 0;
- }
- else
- {
- if (signal == scot[ RTEMEMOV ] &&
- thisp->lastitem-thisp->lastused-1 < t5)
- {
- scot[ RTEMEMOV ] = -1; /* make memov look like abort */
- errsignal(RTEMEMOV);
+ /* provide system attributes */
+ M[*amnew + PROTNUM] = t3;
+ t5 = *amnew + M[*amnew];
+ M[t5 + SL] = M[virts];
+ M[t5 + SL + 1] = M[virts + 1];
+ /* ah of current */
+ t2 = M[display2 + M[c1 + PROTNUM]];
+ M[t5 + DL] = t2;
+ M[t5 + DL + 1] = M[t2 + 1];
+ /* skip */
+ if (t1 != 0) {
+ ic = skip;
+ go(*ahnew, *amnew);
}
- request(t5, ahnew, amnew);
- M[ *amnew+M[ *amnew ]+SIGNR ] = signal;
- }
- M[ *amnew+PROTNUM ] = t3; /* provide system attributes */
- t5 = *amnew+M[ *amnew ];
- M[ t5+SL ] = M[ virts ];
- M[ t5+SL+1 ] = M[ virts+1 ];
- t2 = M[ display2+M[ c1+PROTNUM ] ]; /* ah of current */
- M[ t5+DL ] = t2;
- M[ t5+DL+1 ] = M[ t2+1 ];
- if (t1 != 0) /* skip */
- {
- ic = skip;
- go(*ahnew, *amnew);
- }
-} /* end raise_signal */
-
+}
void wind()
{
- word t1, t2;
-
- t1 = M[ M[ c1+M[ c1 ]+SL ] ]; /* am of handlers' SL */
- t2 = c1; /* current */
- while (TRUE)
- {
- t2 = M[ M[ t2+M[ t2 ]+DL ] ]; /* am of DL */
- if (t2 == t1) break;
- M[ t2+M[ t2 ]+LSC ] = prototype[ M[ t2+PROTNUM ] ]->lastwill;
- }
- back(&thisp->backobj, &M[ temporary ], (word) 0);
-} /* end wind */
+ word t1, t2;
+ /* am of handlers' SL */
+ t1 = M[M[c1 + M[c1] + SL]];
+ /* current */
+ t2 = c1;
+ while (TRUE) {
+ /* am of DL */
+ t2 = M[M[t2 + M[t2] + DL]];
+ if (t2 == t1)
+ break;
+ M[t2 + M[t2] + LSC] = prototype[M[t2 + PROTNUM]]->lastwill;
+ }
+ back(&thisp->backobj, &M[ temporary ], (word) 0);
+}
void term()
{
- word t1;
+ word t1;
- t1 = M[ M[ c1+M[ c1 ]+SL ] ]; /* am of handlers' SL */
- M[ t1+M[ t1 ]+LSC ] = prototype[ M[ t1+PROTNUM ] ]->lastwill;
- wind();
-} /* end term */
+ /* am of handlers' SL */
+ t1 = M[M[c1 + M[c1] + SL]];
+ M[t1 + M[t1] + LSC] = prototype[M[t1 + PROTNUM]]->lastwill;
+ wind();
+}
-
-/* This wraps up the above series of the handler procedures.
+/*
+ * This wraps up the above series of the handler procedures.
*/
-
-void backhd(virt, am)
-virtaddr *virt;
-word *am;
+
+void backhd(virtaddr *virt, word *am)
{
- if (M[ c1+M[ c1 ]+SIGNR ] <= MAXSYSSN)
- errsignal(RTEILLRT); /* illegal return */
- else
- back(virt, am, (word) 0);
-} /* end backhd */
+ if (M[c1 + M[c1] + SIGNR] <= MAXSYSSN) {
+ /* illegal return */
+ errsignal(RTEILLRT);
+ }
+ else {
+ back(virt, am, (word) 0);
+ }
+}
projects / vlp.git / commitdiff