X-Git-Url: https://jxself.org/git/?p=open-adventure.git;a=blobdiff_plain;f=misc.c;h=e7a03984b0fb96739797499247b797e49e984166;hp=6f33146c2020ef74badb4ef85b8e89998fe334d7;hb=2fac8d1aefb3526618ba0f1e7d25c7c7c81dddf4;hpb=dc6a5751ed04ff15103c9852c8dc7427298b6945 diff --git a/misc.c b/misc.c index 6f33146..e7a0398 100644 --- a/misc.c +++ b/misc.c @@ -2,6 +2,7 @@ #include #include #include +#include #include #include @@ -10,163 +11,194 @@ #include "linenoise/linenoise.h" #include "newdb.h" -char* xstrdup(const char* s) +void* xmalloc(size_t size) { - char* ptr = strdup(s); - if (ptr == NULL) - { - fprintf(stderr, "Out of memory!\n"); - exit(EXIT_FAILURE); + void* ptr = malloc(size); + if (ptr == NULL) { + fprintf(stderr, "Out of memory!\n"); + exit(EXIT_FAILURE); } - return(ptr); + return (ptr); } void packed_to_token(long packed, char token[6]) { - // Unpack and map back to ASCII. - for (int i = 0; i < 5; ++i) - { - char advent = (packed >> i * 6) & 63; - token[4 - i] = advent_to_ascii[(int) advent]; + // Unpack and map back to ASCII. + for (int i = 0; i < 5; ++i) { + char advent = (packed >> i * 6) & 63; + token[4 - i] = advent_to_ascii[(int) advent]; } - // Ensure the last character is \0. - token[5] = '\0'; + // Ensure the last character is \0. + token[5] = '\0'; + + // Replace trailing whitespace with \0. + for (int i = 4; i >= 0; --i) { + if (token[i] == ' ' || token[i] == '\t') + token[i] = '\0'; + else + break; + } +} - // Replace trailing whitespace with \0. - for (int i = 4; i >= 0; --i) +void token_to_packed(char token[6], long* packed) +{ + *packed = 0; + for (size_t i = 0; i < 5; ++i) { - if (token[i] == ' ' || token[i] == '\t') - token[i] = '\0'; - else - break; + if (token[4 - i] == '\0') + continue; + char mapped = ascii_to_advent[(int) token[4 - i]]; + *packed |= (mapped << (6 * i)); } } -/* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */ +/* Hide the fact that wods are corrently packed longs */ -void newspeak(char* msg) +bool wordeq(token_t a, token_t b) { - // Do nothing if we got a null pointer. - if (msg == NULL) - return; + return a == b; +} - // Do nothing if we got an empty string. - if (strlen(msg) == 0) - return; +bool wordempty(token_t a) +{ + return a == 0; +} - // Print a newline if the global game.blklin says to. - if (game.blklin == true) - printf("\n"); +void wordclear(token_t *v) +{ + *v = 0; +} - // Create a copy of our string, so we can edit it. - char* copy = xstrdup(msg); +/* I/O routines (speak, pspeak, rspeak, GETIN, YES) */ - // Staging area for stringified parameters. - char parameters[5][100]; // FIXME: to be replaced with dynamic allocation - - // Handle format specifiers (including the custom %C, %L, %S) by adjusting the parameter accordingly, and replacing the specifier with %s. - int pi = 0; // parameter index - for (int i = 0; i < strlen(msg); ++i) - { - if (msg[i] == '%') - { - ++pi; - - // Integer specifier. In order to accommodate the fact that PARMS can have both legitimate integers *and* packed tokens, stringify everything. Future work may eliminate the need for this. - if (msg[i + 1] == 'd') - { - copy[i + 1] = 's'; - sprintf(parameters[pi], "%ld", PARMS[pi]); - } - - // Unmodified string specifier. - if (msg[i + 1] == 's') - { - packed_to_token(PARMS[pi], parameters[pi]); - } - - // Singular/plural specifier. - if (msg[i + 1] == 'S') - { - copy[i + 1] = 's'; - if (PARMS[pi - 1] > 1) // look at the *previous* parameter (which by necessity must be numeric) - { - sprintf(parameters[pi], "%s", "s"); - } - else - { - sprintf(parameters[pi], "%s", ""); - } - } - - // All-lowercase specifier. - if (msg[i + 1] == 'L') - { - copy[i + 1] = 's'; - packed_to_token(PARMS[pi], parameters[pi]); - for (int i = 0; i < strlen(parameters[pi]); ++i) - { - parameters[pi][i] = tolower(parameters[pi][i]); - } - } - - // First char uppercase, rest lowercase. - if (msg[i + 1] == 'C') - { - copy[i + 1] = 's'; - packed_to_token(PARMS[pi], parameters[pi]); - for (int i = 0; i < strlen(parameters[pi]); ++i) - { - parameters[pi][i] = tolower(parameters[pi][i]); - } - parameters[pi][0] = toupper(parameters[pi][0]); - } - } +void vspeak(const char* msg, va_list ap) +{ + // Do nothing if we got a null pointer. + if (msg == NULL) + return; + + // Do nothing if we got an empty string. + if (strlen(msg) == 0) + return; + + // Print a newline if the global game.blklin says to. + if (game.blklin == true) + printf("\n"); + + int msglen = strlen(msg); + + // Rendered string + ssize_t size = 2000; /* msglen > 50 ? msglen*2 : 100; */ + char* rendered = xmalloc(size); + char* renderp = rendered; + + // Handle format specifiers (including the custom %C, %L, %S) by adjusting the parameter accordingly, and replacing the specifier with %s. + long previous_arg = 0; + for (int i = 0; i < msglen; i++) { + if (msg[i] != '%') { + *renderp++ = msg[i]; + size--; + } else { + long arg = va_arg(ap, long); + if (arg == -1) + arg = 0; + i++; + // Integer specifier. In order to accommodate the fact that PARMS can have both legitimate integers *and* packed tokens, stringify everything. Future work may eliminate the need for this. + if (msg[i] == 'd') { + int ret = snprintf(renderp, size, "%ld", arg); + if (ret < size) { + renderp += ret; + size -= ret; + } + } + + // Unmodified string specifier. + if (msg[i] == 's') { + packed_to_token(arg, renderp); /* unpack directly to destination */ + size_t len = strlen(renderp); + renderp += len; + size -= len; + } + + // Singular/plural specifier. + if (msg[i] == 'S') { + if (previous_arg > 1) { // look at the *previous* parameter (which by necessity must be numeric) + *renderp++ = 's'; + size--; + } + } + + // All-lowercase specifier. + if (msg[i] == 'L' || msg[i] == 'C') { + packed_to_token(arg, renderp); /* unpack directly to destination */ + int len = strlen(renderp); + for (int j = 0; j < len; ++j) { + renderp[j] = tolower(renderp[j]); + } + if (msg[i] == 'C') // First char uppercase, rest lowercase. + renderp[0] = toupper(renderp[0]); + renderp += len; + size -= len; + } + + previous_arg = arg; + } } + *renderp = 0; - // Render the final string. - char rendered[2000]; // FIXME: to be replaced with dynamic allocation - sprintf(rendered, copy, parameters[1], parameters[2], parameters[3], parameters[4]); // FIXME: to be replaced with vsprintf() - - // Print the message. - printf("%s\n", rendered); + // Print the message. + printf("%s\n", rendered); - free(copy); + free(rendered); } -void PSPEAK(vocab_t msg,int skip) -/* Find the skip+1st message from msg and print it. msg should be - * the index of the inventory message for object. (INVEN+N+1 message - * is game.prop=N message). */ +void speak(const char* msg, ...) { - if (skip >= 0) - newspeak(object_descriptions[msg].longs[skip]); - else - newspeak(object_descriptions[msg].inventory); + va_list ap; + va_start(ap, msg); + vspeak(msg, ap); + va_end(ap); } -void RSPEAK(vocab_t i) -/* Print the i-th "random" message (section 6 of database). */ +void pspeak(vocab_t msg, enum speaktype mode, int skip, ...) +/* Find the skip+1st message from msg and print it. Modes are: + * feel = for inventory, what you can touch + * look = the long description for the state the object is in + * listen = the sound for the state the object is in + * study = text on the object. */ { - newspeak(arbitrary_messages[i]); + va_list ap; + va_start(ap, skip); + switch (mode) { + case touch: + vspeak(objects[msg].inventory, ap); + break; + case look: + vspeak(objects[msg].longs[skip], ap); + break; + case hear: + vspeak(objects[msg].sounds[skip], ap); + break; + case study: + vspeak(objects[msg].texts[skip], ap); + break; + } + va_end(ap); } -void SETPRM(long first, long p1, long p2) -/* Stores parameters into the PRMCOM parms array for use by speak. P1 and P2 - * are stored into PARMS(first) and PARMS(first+1). */ +void rspeak(vocab_t i, ...) +/* Print the i-th "random" message (section 6 of database). */ { - if (first >= MAXPARMS) - BUG(29); - else { - PARMS[first] = p1; - PARMS[first+1] = p2; - } + va_list ap; + va_start(ap, i); + vspeak(arbitrary_messages[i], ap); + va_end(ap); } bool GETIN(FILE *input, - long *pword1, long *pword1x, - long *pword2, long *pword2x) + long *pword1, long *pword1x, + long *pword2, long *pword2x) /* Get a command from the adventurer. Snarf out the first word, pad it with * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in * case we need to print out the whole word in an error message. Any number of @@ -176,52 +208,130 @@ bool GETIN(FILE *input, long junk; for (;;) { - if (game.blklin) - TYPE0(); - if (!MAPLIN(input)) - return false; - *pword1=GETTXT(true,true,true); - if (game.blklin && *pword1 < 0) - continue; - *pword1x=GETTXT(false,true,true); - do { - junk=GETTXT(false,true,true); - } while - (junk > 0); - *pword2=GETTXT(true,true,true); - *pword2x=GETTXT(false,true,true); - do { - junk=GETTXT(false,true,true); - } while - (junk > 0); - if (GETTXT(true,true,true) <= 0) - return true; - RSPEAK(53); + if (game.blklin) + fputc('\n', stdout);; + if (!MAPLIN(input)) + return false; + *pword1 = GETTXT(true, true, true); + if (game.blklin && *pword1 < 0) + continue; + *pword1x = GETTXT(false, true, true); + do { + junk = GETTXT(false, true, true); + } while + (junk > 0); + *pword2 = GETTXT(true, true, true); + *pword2x = GETTXT(false, true, true); + do { + junk = GETTXT(false, true, true); + } while + (junk > 0); + if (GETTXT(true, true, true) <= 0) + return true; + rspeak(TWO_WORDS); } } -long YES(FILE *input, vocab_t x, vocab_t y, vocab_t z) +void echo_input(FILE* destination, char* input_prompt, char* input) +{ + size_t len = strlen(input_prompt) + strlen(input) + 1; + char* prompt_and_input = (char*) xmalloc(len); + strcpy(prompt_and_input, input_prompt); + strcat(prompt_and_input, input); + fprintf(destination, "%s\n", prompt_and_input); + free(prompt_and_input); +} + +char* get_input() +{ + // Set up the prompt + char input_prompt[] = "> "; + if (!prompt) + input_prompt[0] = '\0'; + + // Print a blank line if game.blklin tells us to. + if (game.blklin == true) + printf("\n"); + + char* input; + while (true) { + if (editline) + input = linenoise(input_prompt); + else { + input = NULL; + size_t n = 0; + if (isatty(0)) + printf("%s", input_prompt); + IGNORE(getline(&input, &n, stdin)); + } + + if (input == NULL) // Got EOF; return with it. + return(input); + else if (input[0] == '#') // Ignore comments. + continue; + else // We have a 'normal' line; leave the loop. + break; + } + + // Strip trailing newlines from the input + input[strcspn(input, "\n")] = 0; + + linenoiseHistoryAdd(input); + + if (!isatty(0)) + echo_input(stdout, input_prompt, input); + + if (logfp) + echo_input(logfp, input_prompt, input); + + return (input); +} + +bool yes(const char* question, const char* yes_response, const char* no_response) /* Print message X, wait for yes/no answer. If yes, print Y and return true; * if no, print Z and return false. */ { - token_t reply, junk1, junk2, junk3; + char* reply; + bool outcome; for (;;) { - RSPEAK(x); - GETIN(input, &reply, &junk1, &junk2, &junk3); - if (reply == MAKEWD(250519) || reply == MAKEWD(25)) { - RSPEAK(y); - return true; - } - if (reply == MAKEWD(1415) || reply == MAKEWD(14)) { - RSPEAK(z); - return false; + speak(question); + + reply = get_input(); + if (reply == NULL) { + linenoiseFree(reply); + exit(EXIT_SUCCESS); } - RSPEAK(185); + + char* firstword = (char*) xmalloc(strlen(reply)+1); + sscanf(reply, "%s", firstword); + + for (int i = 0; i < (int)strlen(firstword); ++i) + firstword[i] = tolower(firstword[i]); + + int yes = strncmp("yes", firstword, sizeof("yes") - 1); + int y = strncmp("y", firstword, sizeof("y") - 1); + int no = strncmp("no", firstword, sizeof("no") - 1); + int n = strncmp("n", firstword, sizeof("n") - 1); + + free(firstword); + + if (yes == 0 || y == 0) { + speak(yes_response); + outcome = true; + break; + } else if (no == 0 || n == 0) { + speak(no_response); + outcome = false; + break; + } else + rspeak(PLEASE_ANSWER); } + linenoiseFree(reply); + return (outcome); } -/* Line-parsing routines (GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0) */ +/* Line-parsing routines (GETTXT, MAKEWD, PUTTXT, SHFTXT) */ long GETTXT(bool skip, bool onewrd, bool upper) /* Take characters from an input line and pack them into 30-bit words. @@ -234,39 +344,39 @@ long GETTXT(bool skip, bool onewrd, bool upper) static long splitting = -1; if (LNPOSN != splitting) - splitting = -1; - text= -1; + splitting = -1; + text = -1; while (true) { - if (LNPOSN > LNLENG) - return(text); - if ((!skip) || INLINE[LNPOSN] != 0) - break; - ++LNPOSN; + if (LNPOSN > LNLENG) + return (text); + if ((!skip) || INLINE[LNPOSN] != 0) + break; + ++LNPOSN; } - text=0; - for (int I=1; I<=TOKLEN; I++) { - text=text*64; - if (LNPOSN > LNLENG || (onewrd && INLINE[LNPOSN] == 0)) - continue; - char current=INLINE[LNPOSN]; - if (current < ascii_to_advent['%']) { - splitting = -1; - if (upper && current >= ascii_to_advent['a']) - current=current-26; - text=text+current; - ++LNPOSN; - continue; - } - if (splitting != LNPOSN) { - text=text+ascii_to_advent['%']; - splitting = LNPOSN; - continue; - } - - text=text+current-ascii_to_advent['%']; - splitting = -1; - ++LNPOSN; + text = 0; + for (int I = 1; I <= TOKLEN; I++) { + text = text * 64; + if (LNPOSN > LNLENG || (onewrd && INLINE[LNPOSN] == 0)) + continue; + char current = INLINE[LNPOSN]; + if (current < ascii_to_advent['%']) { + splitting = -1; + if (upper && current >= ascii_to_advent['a']) + current = current - 26; + text = text + current; + ++LNPOSN; + continue; + } + if (splitting != LNPOSN) { + text = text + ascii_to_advent['%']; + splitting = LNPOSN; + continue; + } + + text = text + current - ascii_to_advent['%']; + splitting = -1; + ++LNPOSN; } return text; @@ -283,32 +393,19 @@ token_t MAKEWD(long letters) { long i = 1, word = 0; - for (long k=letters; k != 0; k=k/100) { - word=word+i*(MOD(k,50)+10); - i=i*64; - if (MOD(k,100) > 50)word=word+i*5; + for (long k = letters; k != 0; k = k / 100) { + word = word + i * (MOD(k, 50) + 10); + i = i * 64; + if (MOD(k, 100) > 50)word = word + i * 5; } - i=64L*64L*64L*64L*64L/i; - word=word*i; + i = 64L * 64L * 64L * 64L * 64L / i; + word = word * i; return word; } -void TYPE0(void) -/* Type a blank line. This procedure is provided as a convenience for callers - * who otherwise have no use for MAPCOM. */ -{ - long temp; - - temp=LNLENG; - LNLENG=0; - TYPE(); - LNLENG=temp; - return; -} - /* Data structure routines */ -long VOCAB(long id, long init) +long vocab(long id, long init) /* Look up ID in the vocabulary (ATAB) and return its "definition" (KTAB), or * -1 if not found. If INIT is positive, this is an initialisation call setting * up a keyword variable, and not finding it constitutes a bug. It also means @@ -316,46 +413,40 @@ long VOCAB(long id, long init) * (Thus "STEPS", which is a motion verb as well as an object, may be located * as an object.) And it also means the KTAB value is taken modulo 1000. */ { - long i, lexeme; - - for (i=1; i<=TABSIZ; i++) { - if (KTAB[i] == -1) { - lexeme= -1; - if (init < 0) - return(lexeme); - BUG(5); - } - if (init >= 0 && KTAB[i]/1000 != init) - continue; - if (ATAB[i] == id) { - lexeme=KTAB[i]; - if (init >= 0) - lexeme=MOD(lexeme,1000); - return(lexeme); - } + long lexeme; + + for (long i = 1; i <= TABSIZ; i++) { + if (KTAB[i] == -1) { + lexeme = -1; + if (init < 0) + return (lexeme); + BUG(REQUIRED_VOCABULARY_WORD_NOT_FOUND); + } + if (init >= 0 && KTAB[i] / 1000 != init) + continue; + if (ATAB[i] == id) { + lexeme = KTAB[i]; + if (init >= 0) + lexeme = MOD(lexeme, 1000); + return (lexeme); + } } - BUG(21); -} - -void DSTROY(long object) -/* Permanently eliminate "object" by moving to a non-existent location. */ -{ - MOVE(object,0); + BUG(RAN_OFF_END_OF_VOCABULARY_TABLE); } -void JUGGLE(long object) +void juggle(long object) /* Juggle an object by picking it up and putting it down again, the purpose * being to get the object to the front of the chain of things at its loc. */ { long i, j; - i=game.place[object]; - j=game.fixed[object]; - MOVE(object,i); - MOVE(object+NOBJECTS,j); + i = game.place[object]; + j = game.fixed[object]; + move(object, i); + move(object + NOBJECTS, j); } -void MOVE(long object, long where) +void move(long object, long where) /* Place any object anywhere by picking it up and dropping it. May * already be toting, in which case the carry is a no-op. Mustn't * pick up objects which are not at any loc, since carry wants to @@ -363,24 +454,24 @@ void MOVE(long object, long where) { long from; - if (object > NOBJECTS) - from=game.fixed[object-NOBJECTS]; + if (object > NOBJECTS) + from = game.fixed[object - NOBJECTS]; else - from=game.place[object]; - if (from > 0 && !SPECIAL(from)) - CARRY(object,from); - DROP(object,where); + from = game.place[object]; + if (from != LOC_NOWHERE && from != CARRIED && !SPECIAL(from)) + carry(object, from); + drop(object, where); } -long PUT(long object, long where, long pval) +long put(long object, long where, long pval) /* PUT is the same as MOVE, except it returns a value used to set up the * negated game.prop values for the repository objects. */ { - MOVE(object,where); - return (-1)-pval;; + move(object, where); + return (-1) - pval;; } -void CARRY(long object, long where) +void carry(long object, long where) /* Start toting an object, removing it from the list of things at its former * location. Incr holdng unless it was already being toted. If object>NOBJECTS * (moving "fixed" second loc), don't change game.place or game.holdng. */ @@ -388,70 +479,69 @@ void CARRY(long object, long where) long temp; if (object <= NOBJECTS) { - if (game.place[object] == -1) - return; - game.place[object]= -1; - ++game.holdng; + if (game.place[object] == CARRIED) + return; + game.place[object] = CARRIED; + ++game.holdng; } if (game.atloc[where] == object) { - game.atloc[where]=game.link[object]; - return; + game.atloc[where] = game.link[object]; + return; } - temp=game.atloc[where]; + temp = game.atloc[where]; while (game.link[temp] != object) { - temp=game.link[temp]; + temp = game.link[temp]; } - game.link[temp]=game.link[object]; + game.link[temp] = game.link[object]; } -void DROP(long object, long where) +void drop(long object, long where) /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr * game.holdng if the object was being toted. */ { if (object > NOBJECTS) - game.fixed[object-NOBJECTS] = where; - else - { - if (game.place[object] == -1) - --game.holdng; - game.place[object] = where; + game.fixed[object - NOBJECTS] = where; + else { + if (game.place[object] == CARRIED) + --game.holdng; + game.place[object] = where; } if (where <= 0) - return; + return; game.link[object] = game.atloc[where]; game.atloc[where] = object; } -long ATDWRF(long where) +long atdwrf(long where) /* Return the index of first dwarf at the given location, zero if no dwarf is * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore * the pirate (6th dwarf). */ { - long at, i; + long at; - at =0; + at = 0; if (game.dflag < 2) - return(at); + return (at); at = -1; - for (i=1; i<=NDWARVES-1; i++) { - if (game.dloc[i] == where) - return i; - if (game.dloc[i] != 0) - at=0; + for (long i = 1; i <= NDWARVES - 1; i++) { + if (game.dloc[i] == where) + return i; + if (game.dloc[i] != 0) + at = 0; } - return(at); + return (at); } /* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value, - * randrange, RNDVOC, BUG) */ + * randrange, RNDVOC) */ -long SETBIT(long bit) +long setbit(long bit) /* Returns 2**bit for use in constructing bit-masks. */ { - return(1 << bit); + return (1 << bit); } -bool TSTBIT(long mask, int bit) +bool tstbit(long mask, int bit) /* Returns true if the specified bit is set in the mask. */ { return (mask & (1 << bit)) != 0; @@ -460,24 +550,24 @@ bool TSTBIT(long mask, int bit) void set_seed(long seedval) /* Set the LCG seed */ { - lcgstate.x = (unsigned long) seedval % lcgstate.m; + game.lcg_x = (unsigned long) seedval % game.lcg_m; } unsigned long get_next_lcg_value(void) /* Return the LCG's current value, and then iterate it. */ { - unsigned long old_x = lcgstate.x; - lcgstate.x = (lcgstate.a * lcgstate.x + lcgstate.c) % lcgstate.m; + unsigned long old_x = game.lcg_x; + game.lcg_x = (game.lcg_a * game.lcg_x + game.lcg_c) % game.lcg_m; return old_x; } long randrange(long range) /* Return a random integer from [0, range). */ { - return range * get_next_lcg_value() / lcgstate.m; + return range * get_next_lcg_value() / game.lcg_m; } -long RNDVOC(long second, long force) +long rndvoc(long second, long force) /* Searches the vocabulary ATAB for a word whose second character is * char, and changes that word such that each of the other four * characters is a random letter. If force is non-zero, it is used @@ -486,66 +576,34 @@ long RNDVOC(long second, long force) long rnd = force; if (rnd == 0) { - for (int i = 1; i <= 5; i++) { - long j = 11 + randrange(26); - if (i == 2) - j = second; - rnd = rnd * 64 + j; - } + for (int i = 1; i <= 5; i++) { + long j = 11 + randrange(26); + if (i == 2) + j = second; + rnd = rnd * 64 + j; + } } long div = 64L * 64L * 64L; for (int i = 1; i <= TABSIZ; i++) { - if (MOD(ATAB[i]/div, 64L) == second) - { - ATAB[i] = rnd; - break; - } + if (MOD(ATAB[i] / div, 64L) == second) { + ATAB[i] = rnd; + break; + } } return rnd; } -void BUG(long num) -/* The following conditions are currently considered fatal bugs. Numbers < 20 - * are detected while reading the database; the others occur at "run time". - * 0 Message line > 70 characters - * 1 Null line in message - * 2 Too many words of messages - * 3 Too many travel options - * 4 Too many vocabulary words - * 5 Required vocabulary word not found - * 6 Too many RTEXT messages - * 7 Too many hints - * 8 Location has cond bit being set twice - * 9 Invalid section number in database - * 10 Too many locations - * 11 Too many class or turn messages - * 20 Special travel (500>L>300) exceeds goto list - * 21 Ran off end of vocabulary table - * 22 Vocabulary type (N/1000) not between 0 and 3 - * 23 Intransitive action verb exceeds goto list - * 24 Transitive action verb exceeds goto list - * 25 Conditional travel entry with no alternative - * 26 Location has no travel entries - * 27 Hint number exceeds goto list - * 28 Invalid month returned by date function - * 29 Too many parameters given to SETPRM */ -{ - - printf("Fatal error %ld. See source code for interpretation.\n", num); - exit(0); -} - -/* Machine dependent routines (MAPLIN, TYPE, SAVEIO) */ + +/* Machine dependent routines (MAPLIN, SAVEIO) */ bool MAPLIN(FILE *fp) { - long i, val; bool eof; /* Read a line of input, from the specified input source. - * This logic is complicated partly because it has to serve + * This logic is complicated partly because it has to serve * several cases with different requirements and partly because * of a quirk in linenoise(). * @@ -558,104 +616,82 @@ bool MAPLIN(FILE *fp) * fed redirected stdin. * * The logging is a bit of a mess because there are two distinct cases - * in which you want to echo commands. One is when shipping them to + * in which you want to echo commands. One is when shipping them to * a log under the -l option, in which case you want to suppress * prompt generation (so test logs are unadorned command sequences). - * On the other hand, if you redirected stdin and are feeding the program + * On the other hand, if you redirected stdin and are feeding the program * a logfile, you *do* want prompt generation - it makes checkfiles * easier to read when the commands are marked by a preceding prompt. */ do { - if (!editline) { - if (prompt) - fputs("> ", stdout); - IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,fp)); - eof = (feof(fp)); - } else { - char *cp = linenoise("> "); - eof = (cp == NULL); - if (!eof) { - strncpy(rawbuf, cp, sizeof(rawbuf)-1); - linenoiseHistoryAdd(rawbuf); - strncat(rawbuf, "\n", sizeof(rawbuf)-1); - linenoiseFree(cp); - } - } + if (!editline) { + if (prompt) + fputs("> ", stdout); + IGNORE(fgets(rawbuf, sizeof(rawbuf) - 1, fp)); + eof = (feof(fp)); + } else { + char *cp = linenoise("> "); + eof = (cp == NULL); + if (!eof) { + strncpy(rawbuf, cp, sizeof(rawbuf) - 1); + linenoiseHistoryAdd(rawbuf); + strncat(rawbuf, "\n", sizeof(rawbuf) - strlen(rawbuf) - 1); + linenoiseFree(cp); + } + } } while - (!eof && rawbuf[0] == '#'); + (!eof && rawbuf[0] == '#'); if (eof) { - if (logfp && fp == stdin) - fclose(logfp); - return false; + if (logfp && fp == stdin) + fclose(logfp); + return false; } else { - FILE *efp = NULL; - if (logfp && fp == stdin) - efp = logfp; - else if (!isatty(0)) - efp = stdout; - if (efp != NULL) - { - if (prompt && efp == stdout) - fputs("> ", efp); - IGNORE(fputs(rawbuf, efp)); - } - strcpy(INLINE+1, rawbuf); - /* translate the chars to integers in the range 0-126 and store - * them in the common array "INLINE". Integer values are as follows: - * 0 = space [ASCII CODE 40 octal, 32 decimal] - * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal] - * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal] - * 11-36 = upper-case letters - * 37-62 = lower-case letters - * 63 = percent (%) [ASCII 45 octal, 37 decimal] - * 64-73 = digits, 0 through 9 - * Remaining characters can be translated any way that is convenient; - * The "TYPE" routine below is used to map them back to characters when - * necessary. The above mappings are required so that certain special - * characters are known to fit in 6 bits and/or can be easily spotted. - * Array elements beyond the end of the line should be filled with 0, - * and LNLENG should be set to the index of the last character. - * - * If the data file uses a character other than space (e.g., tab) to - * separate numbers, that character should also translate to 0. - * - * This procedure may use the map1,map2 arrays to maintain static data for - * the mapping. MAP2(1) is set to 0 when the program starts - * and is not changed thereafter unless the routines on this page choose - * to do so. */ - LNLENG=0; - for (i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) { - val=INLINE[i]; - INLINE[i]=ascii_to_advent[val]; - if (INLINE[i] != 0) - LNLENG=i; - } - LNPOSN=1; - return true; + FILE *efp = NULL; + if (logfp && fp == stdin) + efp = logfp; + else if (!isatty(0)) + efp = stdout; + if (efp != NULL) { + if (prompt && efp == stdout) + fputs("> ", efp); + IGNORE(fputs(rawbuf, efp)); + } + strcpy(INLINE + 1, rawbuf); + /* translate the chars to integers in the range 0-126 and store + * them in the common array "INLINE". Integer values are as follows: + * 0 = space [ASCII CODE 40 octal, 32 decimal] + * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal] + * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal] + * 11-36 = upper-case letters + * 37-62 = lower-case letters + * 63 = percent (%) [ASCII 45 octal, 37 decimal] + * 64-73 = digits, 0 through 9 + * Remaining characters can be translated any way that is convenient; + * The above mappings are required so that certain special + * characters are known to fit in 6 bits and/or can be easily spotted. + * Array elements beyond the end of the line should be filled with 0, + * and LNLENG should be set to the index of the last character. + * + * If the data file uses a character other than space (e.g., tab) to + * separate numbers, that character should also translate to 0. + * + * This procedure may use the map1,map2 arrays to maintain + * static data for he mapping. MAP2(1) is set to 0 when the + * program starts and is not changed thereafter unless the + * routines in this module choose to do so. */ + LNLENG = 0; + for (long i = 1; i <= (long)sizeof(INLINE) && INLINE[i] != 0; i++) { + long val = INLINE[i]; + INLINE[i] = ascii_to_advent[val]; + if (INLINE[i] != 0) + LNLENG = i; + } + LNPOSN = 1; + return true; } } -void TYPE(void) -/* Type the first "LNLENG" characters stored in inline, mapping them - * from integers to text per the rules described above. INLINE - * may be changed by this routine. */ -{ - long i; - - if (LNLENG == 0) { - printf("\n"); - return; - } - - for (i=1; i<=LNLENG; i++) { - INLINE[i]=advent_to_ascii[(int) INLINE[i]]; - } - INLINE[LNLENG+1]=0; - printf("%s\n", INLINE+1); - return; -} - -void DATIME(long* d, long* t) +void datime(long* d, long* t) { struct timeval tv; gettimeofday(&tv, NULL); @@ -663,4 +699,10 @@ void DATIME(long* d, long* t) *t = (long) tv.tv_usec; } +void bug(enum bugtype num, const char *error_string) +{ + fprintf(stderr, "Fatal error %d, %s.\n", num, error_string); + exit(EXIT_FAILURE); +} + /* end */