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 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490
|
/*
* coms.c program execution control module dvb
*
* Copyright (C) 1993 by the Regents of the University of California
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
*/
#include "logo.h"
#include "globals.h"
#include <math.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef ibm
#include "process.h"
#endif
#ifdef mac
#include <console.h>
#include <Events.h>
#endif
#ifdef __RZTC__
#include <time.h>
#include <controlc.h>
#include <dos.h>
#endif
#ifdef HAVE_TERMIO_H
#include <termio.h>
#else
#ifdef HAVE_SGTTY_H
#include <sgtty.h>
#endif
#endif
FIXNUM ift_iff_flag = -1;
NODE *runhelp(NODE *args);
NODE *make_cont(enum labels cont, NODE *val) {
#ifdef __RZTC__
union { enum labels lll;
NODE *ppp;} cast;
#endif
NODE *retval = cons(NIL, val);
#ifdef __RZTC__
cast.lll = cont;
retval->n_car = cast.ppp;
#else
retval->n_car = (NODE *)cont;
#endif
settype(retval, CONT);
return retval;
}
NODE *loutput(NODE *arg) {
if (NOT_THROWING) {
stopping_flag = OUTPUT;
output_node = car(arg);
}
return(UNBOUND);
}
NODE *lstop(NODE *args) {
if (NOT_THROWING)
stopping_flag = STOP;
return(UNBOUND);
}
NODE *lthrow(NODE *arg) {
if (NOT_THROWING) {
if (compare_node(car(arg),Error,TRUE) == 0) {
if (cdr(arg) != NIL)
err_logo(USER_ERR_MESSAGE, cadr(arg));
else
err_logo(USER_ERR, UNBOUND);
} else {
stopping_flag = THROWING;
throw_node = car(arg);
if (cdr(arg) != NIL)
output_node = cadr(arg);
else
output_node = UNBOUND;
}
}
return(UNBOUND);
}
NODE *lcatch(NODE *args) {
return make_cont(catch_continuation, cons(car(args), runhelp(cdr(args))));
}
int torf_arg(NODE *args) {
NODE *arg = car(args);
while (NOT_THROWING) {
if (compare_node(arg, True, TRUE) == 0) return TRUE;
if (compare_node(arg, False, TRUE) == 0) return FALSE;
setcar(args, err_logo(BAD_DATA, arg));
arg = car(args);
}
return -1;
}
NODE *lgoto(NODE *args) {
return make_cont(goto_continuation, car(args));
}
NODE *ltag(NODE *args) {
return UNBOUND;
}
NODE *lnot(NODE *args) {
int arg = torf_arg(args);
if (NOT_THROWING) {
if (arg) return(False);
else return(True);
}
return(UNBOUND);
}
NODE *land(NODE *args) {
int arg;
if (args == NIL) return(True);
while (NOT_THROWING) {
arg = torf_arg(args);
if (arg == FALSE)
return(False);
args = cdr(args);
if (args == NIL) break;
}
if (NOT_THROWING) return(True);
else return(UNBOUND);
}
NODE *lor(NODE *args) {
int arg;
if (args == NIL) return(False);
while (NOT_THROWING) {
arg = torf_arg(args);
if (arg == TRUE)
return(True);
args = cdr(args);
if (args == NIL) break;
}
if (NOT_THROWING) return(False);
else return(UNBOUND);
}
NODE *runnable_arg(NODE *args) {
NODE *arg = car(args);
if (!aggregate(arg)) {
setcar(args, parser(arg, TRUE));
arg = car(args);
}
while (!is_list(arg) && NOT_THROWING) {
setcar(args, err_logo(BAD_DATA, arg));
arg = car(args);
}
return(arg);
}
NODE *lif(NODE *args) { /* macroized */
NODE *yes;
int pred;
if (cddr(args) != NIL) return(lifelse(args));
pred = torf_arg(args);
yes = runnable_arg(cdr(args));
if (NOT_THROWING) {
if (pred) return(yes);
return(NIL);
}
return(UNBOUND);
}
NODE *lifelse(NODE *args) { /* macroized */
NODE *yes, *no;
int pred;
pred = torf_arg(args);
yes = runnable_arg(cdr(args));
no = runnable_arg(cddr(args));
if (NOT_THROWING) {
if (pred) return(yes);
return(no);
}
return(UNBOUND);
}
NODE *runhelp(NODE *args) {
NODE *arg = runnable_arg(args);
if (NOT_THROWING) return(arg);
return(UNBOUND);
}
NODE *lrun(NODE *args) { /* macroized */
/* return make_cont(run_continuation, runhelp(args)); */
return runhelp(args);
}
NODE *lrunresult(NODE *args) {
return make_cont(runresult_continuation, runhelp(args));
}
NODE *pos_int_arg(NODE *args) {
NODE *arg = car(args), *val;
FIXNUM i;
FLONUM f;
val = cnv_node_to_numnode(arg);
while ((nodetype(val) != INT || getint(val) < 0) && NOT_THROWING) {
if (nodetype(val) == FLOATT &&
fmod((f = getfloat(val)), 1.0) == 0.0 &&
f >= 0.0 && f < (FLONUM)MAXLOGOINT) {
#if HAVE_IRINT
i = irint(f);
#else
i = (FIXNUM)f;
#endif
val = make_intnode(i);
break;
}
setcar(args, err_logo(BAD_DATA, arg));
arg = car(args);
val = cnv_node_to_numnode(arg);
}
setcar(args,val);
if (nodetype(val) == INT) return(val);
return UNBOUND;
}
NODE *lrepeat(NODE *args) {
NODE *cnt, *torpt, *retval = NIL;
cnt = pos_int_arg(args);
torpt = runhelp(cdr(args));
if (NOT_THROWING) {
retval = make_cont(repeat_continuation, cons(cnt,torpt));
}
return(retval);
}
NODE *lrepcount(NODE *args) {
return make_intnode(user_repcount);
}
NODE *lforever(NODE *args) {
NODE *torpt = runhelp(args);
if (NOT_THROWING)
return make_cont(repeat_continuation, cons(make_intnode(-1), torpt));
return NIL;
}
NODE *ltest(NODE *args) {
int arg = torf_arg(args);
if (tailcall != 0) return UNBOUND;
if (NOT_THROWING) {
ift_iff_flag = arg;
dont_fix_ift = 1;
}
return(UNBOUND);
}
NODE *liftrue(NODE *args) {
if (ift_iff_flag < 0)
return(err_logo(NO_TEST,NIL));
else if (ift_iff_flag > 0)
return(runhelp(args));
else
return(NIL);
}
NODE *liffalse(NODE *args) {
if (ift_iff_flag < 0)
return(err_logo(NO_TEST,NIL));
else if (ift_iff_flag == 0)
return(runhelp(args));
else
return(NIL);
}
void prepare_to_exit(BOOLEAN okay) {
#ifdef mac
if (okay) {
console_options.pause_atexit = 0;
exit(0);
}
#endif
#ifndef WIN32 /* sowings */
#ifdef ibm
ltextscreen(NIL);
ibm_plain_mode();
#ifdef __RZTC__
zflush();
controlc_close();
#endif
#endif
#endif /* !WIN32 */
#ifdef unix
#ifndef HAVE_UNISTD_H
extern int getpid();
#endif
char ef[30];
charmode_off();
sprintf(ef, "/tmp/logo%d", (int)getpid());
unlink(ef);
#endif
}
NODE *lbye(NODE *args) {
prepare_to_exit(TRUE);
if (ufun != NIL || loadstream != stdin) exit(0);
#ifndef WIN32
if (isatty(0) && isatty(1))
#endif
lcleartext(NIL);
ndprintf(stdout, "%t\n", message_texts[THANK_YOU]);
ndprintf(stdout, "%t\n", message_texts[NICE_DAY]);
#ifdef __RZTC__
printf("\n");
#endif
exit(0);
return UNBOUND; /* not reached, but makes compiler happy */
}
NODE *lwait(NODE *args) {
NODE *num;
unsigned int n;
#ifdef mac
long target;
extern void ProcessEvent(void);
#endif
num = pos_int_arg(args);
if (NOT_THROWING) {
#ifdef WIN32
win32_update_text();
#else
fflush(stdout); /* csls v. 1 p. 7 */
#endif
#if defined(__RZTC__)
zflush();
#endif
if (getint(num) > 0) {
#ifdef unix
#ifdef HAVE_USLEEP
n = (unsigned int)getint(num) * 16667;
usleep(n);
#else
n = (unsigned int)getint(num) / 60;
sleep(n);
#endif
#elif defined(__RZTC__)
usleep(getint(num) * 16667L);
#elif defined(mac)
target = getint(num)+TickCount();
while (TickCount() < target) {
if (check_throwing) break;
ProcessEvent();
}
#elif defined(_MSC_VER)
n = (unsigned int)getint(num);
while (n > 60) {
_sleep(1000);
n -= 60;
if (check_throwing) n = 0;
}
if (n > 0) _sleep(n*1000/60);
#else /* unreachable, I think */
if (!setjmp(iblk_buf)) {
input_blocking++;
n = ((unsigned int)getint(num)+30) / 60;
if (n > 0) sleep(n);
}
input_blocking = 0;
#endif
}
}
return(UNBOUND);
}
NODE *lshell(NODE *args) {
#ifdef mac
printf("%s\n", message_texts[NOSHELL_MAC]);
return(UNBOUND);
#else
#ifdef ibm
NODE *arg;
char doscmd[200];
/* union REGS r; */
arg = car(args);
while (!is_list(arg) && NOT_THROWING) {
setcar(args, err_logo(BAD_DATA, arg));
arg = car(args);
}
if (arg == NIL) {
ndprintf(stdout, "%t\n", message_texts[TYPE_EXIT]);
if (spawnlp(P_WAIT, "command", "command", NULL))
err_logo(FILE_ERROR,
make_static_strnode
("Could not open shell (probably due to low memory)"));
}
else {
print_stringlen = 199;
print_stringptr = doscmd;
ndprintf((FILE *)NULL,"%p",arg);
*print_stringptr = '\0';
if (system(doscmd))
err_logo(FILE_ERROR,
make_static_strnode
("Could not open shell (probably due to low memory)"));
}
/*
r.h.ah = 0x3;
r.h.al = 0;
r.h.dh = 0; r.h.dl = 0;
int86(0x21, &r, &r);
x_coord = x_margin;
y_coord = r.h.dh;
*/
#ifndef WIN32
x_coord = x_margin;
y_coord = y_max;
ibm_gotoxy(x_coord, y_coord);
#else
win32_repaint_screen();
#endif
return(UNBOUND);
#else
extern FILE *popen();
char cmdbuf[300];
FILE *strm;
NODE *head = NIL, *tail = NIL, *this;
BOOLEAN wordmode = FALSE;
int len;
if (cdr(args) != NIL) wordmode = TRUE;
print_stringptr = cmdbuf;
print_stringlen = 300;
ndprintf((FILE *)NULL,"%p\n",car(args));
*print_stringptr = '\0';
strm = popen(cmdbuf,"r");
fgets(cmdbuf,300,strm);
while (!feof(strm)) {
len = (int)strlen(cmdbuf);
if (cmdbuf[len-1] == '\n')
cmdbuf[--len] = '\0';
if (wordmode)
this = make_strnode(cmdbuf, (struct string_block *)NULL, len,
STRING, strnzcpy);
else
this = parser(make_static_strnode(cmdbuf), FALSE);
if (head == NIL) {
tail = head = cons(this,NIL);
} else {
setcdr(tail, cons(this,NIL));
tail = cdr(tail);
}
fgets(cmdbuf,300,strm);
}
pclose(strm);
return(head);
#endif
#endif
}
|