diff --git a/usr.bin/vgrind/extern.h b/usr.bin/vgrind/extern.h index 0526d56e2614..946bcd551ee7 100644 --- a/usr.bin/vgrind/extern.h +++ b/usr.bin/vgrind/extern.h @@ -1,65 +1,65 @@ /* * Copyright (c) 1980, 1993 * The Regents of the University of California. All rights reserved. * * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)extern.h 8.1 (Berkeley) 6/6/93 */ typedef int boolean; extern boolean _escaped; /* if last character was an escape */ -extern char *_start; /* start of the current string */ +extern char *s_start; /* start of the current string */ extern char *l_acmbeg; /* string introducing a comment */ extern char *l_acmend; /* string ending a comment */ extern char *l_blkbeg; /* string begining of a block */ extern char *l_blkend; /* string ending a block */ extern char *l_chrbeg; /* delimiter for character constant */ extern char *l_chrend; /* delimiter for character constant */ extern char *l_combeg; /* string introducing a comment */ extern char *l_comend; /* string ending a comment */ extern char l_escape; /* character used to escape characters */ extern char *l_keywds[]; /* keyword table address */ extern boolean l_onecase; /* upper and lower case are equivalent */ extern char *l_prcbeg; /* regular expr for procedure begin */ extern char *l_strbeg; /* delimiter for string constant */ extern char *l_strend; /* delimiter for string constant */ extern boolean l_toplex; /* procedures only defined at top lex level */ extern char *language; /* the language indicator */ #include __BEGIN_DECLS extern int STRNCMP __P((char *, char *, int)); extern char *convexp __P((char *)); extern char *expmatch __P((char *, char *, char *)); __END_DECLS diff --git a/usr.bin/vgrind/regexp.c b/usr.bin/vgrind/regexp.c index d606620c3af2..476a548e3ba4 100644 --- a/usr.bin/vgrind/regexp.c +++ b/usr.bin/vgrind/regexp.c @@ -1,598 +1,598 @@ /* * Copyright (c) 1980, 1993 * The Regents of the University of California. All rights reserved. * * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char copyright[] = "@(#) Copyright (c) 1980, 1993\n\ The Regents of the University of California. All rights reserved.\n"; #endif /* not lint */ #ifndef lint static char sccsid[] = "@(#)regexp.c 8.1 (Berkeley) 6/6/93"; #endif /* not lint */ #include #include #include #include "extern.h" #define FALSE 0 #define TRUE !(FALSE) #define NIL 0 static void expconv __P((void)); boolean _escaped; /* true if we are currently _escaped */ -char *_start; /* start of string */ +char *s_start; /* start of string */ boolean l_onecase; /* true if upper and lower equivalent */ #define makelower(c) (isupper((c)) ? tolower((c)) : (c)) /* STRNCMP - like strncmp except that we convert the * first string to lower case before comparing * if l_onecase is set. */ int STRNCMP(s1, s2, len) register char *s1,*s2; register int len; { if (l_onecase) { do if (*s2 - makelower(*s1)) return (*s2 - makelower(*s1)); else { s2++; s1++; } while (--len); } else { do if (*s2 - *s1) return (*s2 - *s1); else { s2++; s1++; } while (--len); } return(0); } /* The following routine converts an irregular expression to * internal format. * * Either meta symbols (\a \d or \p) or character strings or * operations ( alternation or perenthesizing ) can be * specified. Each starts with a descriptor byte. The descriptor * byte has STR set for strings, META set for meta symbols * and OPER set for operations. * The descriptor byte can also have the OPT bit set if the object * defined is optional. Also ALT can be set to indicate an alternation. * * For metasymbols the byte following the descriptor byte identities * the meta symbol (containing an ascii 'a', 'd', 'p', '|', or '('). For * strings the byte after the descriptor is a character count for * the string: * * meta symbols := descriptor * symbol * * strings := descriptor * character count * the string * * operatins := descriptor * symbol * character count */ /* * handy macros for accessing parts of match blocks */ #define MSYM(A) (*(A+1)) /* symbol in a meta symbol block */ #define MNEXT(A) (A+2) /* character following a metasymbol block */ #define OSYM(A) (*(A+1)) /* symbol in an operation block */ #define OCNT(A) (*(A+2)) /* character count */ #define ONEXT(A) (A+3) /* next character after the operation */ #define OPTR(A) (A+*(A+2)) /* place pointed to by the operator */ #define SCNT(A) (*(A+1)) /* byte count of a string */ #define SSTR(A) (A+2) /* address of the string */ #define SNEXT(A) (A+2+*(A+1)) /* character following the string */ /* * bit flags in the descriptor */ #define OPT 1 #define STR 2 #define META 4 #define ALT 8 #define OPER 16 static char *ccre; /* pointer to current position in converted exp*/ static char *ure; /* pointer current position in unconverted exp */ char * convexp(re) char *re; /* unconverted irregular expression */ { register char *cre; /* pointer to converted regular expression */ /* allocate room for the converted expression */ if (re == NIL) return (NIL); if (*re == '\0') return (NIL); cre = malloc (4 * strlen(re) + 3); ccre = cre; ure = re; /* start the conversion with a \a */ *cre = META | OPT; MSYM(cre) = 'a'; ccre = MNEXT(cre); /* start the conversion (its recursive) */ expconv (); *ccre = 0; return (cre); } static void expconv() { register char *cs; /* pointer to current symbol in converted exp */ register char c; /* character being processed */ register char *acs; /* pinter to last alternate */ register int temp; /* let the conversion begin */ acs = NIL; cs = NIL; while (*ure != NIL) { switch (c = *ure++) { case '\\': switch (c = *ure++) { /* escaped characters are just characters */ default: if (cs == NIL || (*cs & STR) == 0) { cs = ccre; *cs = STR; SCNT(cs) = 1; ccre += 2; } else SCNT(cs)++; *ccre++ = c; break; /* normal(?) metacharacters */ case 'a': case 'd': case 'e': case 'p': if (acs != NIL && acs != cs) { do { temp = OCNT(acs); OCNT(acs) = ccre - acs; acs -= temp; } while (temp != 0); acs = NIL; } cs = ccre; *cs = META; MSYM(cs) = c; ccre = MNEXT(cs); break; } break; /* just put the symbol in */ case '^': case '$': if (acs != NIL && acs != cs) { do { temp = OCNT(acs); OCNT(acs) = ccre - acs; acs -= temp; } while (temp != 0); acs = NIL; } cs = ccre; *cs = META; MSYM(cs) = c; ccre = MNEXT(cs); break; /* mark the last match sequence as optional */ case '?': if (cs) *cs = *cs | OPT; break; /* recurse and define a subexpression */ case '(': if (acs != NIL && acs != cs) { do { temp = OCNT(acs); OCNT(acs) = ccre - acs; acs -= temp; } while (temp != 0); acs = NIL; } cs = ccre; *cs = OPER; OSYM(cs) = '('; ccre = ONEXT(cs); expconv (); OCNT(cs) = ccre - cs; /* offset to next symbol */ break; /* return from a recursion */ case ')': if (acs != NIL) { do { temp = OCNT(acs); OCNT(acs) = ccre - acs; acs -= temp; } while (temp != 0); acs = NIL; } cs = ccre; *cs = META; MSYM(cs) = c; ccre = MNEXT(cs); return; /* mark the last match sequence as having an alternate */ /* the third byte will contain an offset to jump over the */ /* alternate match in case the first did not fail */ case '|': if (acs != NIL && acs != cs) OCNT(ccre) = ccre - acs; /* make a back pointer */ else OCNT(ccre) = 0; *cs |= ALT; cs = ccre; *cs = OPER; OSYM(cs) = '|'; ccre = ONEXT(cs); acs = cs; /* remember that the pointer is to be filles */ break; /* if its not a metasymbol just build a scharacter string */ default: if (cs == NIL || (*cs & STR) == 0) { cs = ccre; *cs = STR; SCNT(cs) = 1; ccre = SSTR(cs); } else SCNT(cs)++; *ccre++ = c; break; } } if (acs != NIL) { do { temp = OCNT(acs); OCNT(acs) = ccre - acs; acs -= temp; } while (temp != 0); acs = NIL; } return; } /* end of convertre */ /* * The following routine recognises an irregular expresion * with the following special characters: * * \? - means last match was optional * \a - matches any number of characters * \d - matches any number of spaces and tabs * \p - matches any number of alphanumeric * characters. The * characters matched will be copied into * the area pointed to by 'name'. * \| - alternation * \( \) - grouping used mostly for alternation and * optionality * * The irregular expression must be translated to internal form * prior to calling this routine * * The value returned is the pointer to the first non \a * character matched. */ char * expmatch (s, re, mstring) register char *s; /* string to check for a match in */ register char *re; /* a converted irregular expression */ register char *mstring; /* where to put whatever matches a \p */ { register char *cs; /* the current symbol */ register char *ptr,*s1; /* temporary pointer */ boolean matched; /* a temporary boolean */ /* initial conditions */ if (re == NIL) return (NIL); cs = re; matched = FALSE; /* loop till expression string is exhausted (or at least pretty tired) */ while (*cs) { switch (*cs & (OPER | STR | META)) { /* try to match a string */ case STR: matched = !STRNCMP (s, SSTR(cs), SCNT(cs)); if (matched) { /* hoorah it matches */ s += SCNT(cs); cs = SNEXT(cs); } else if (*cs & ALT) { /* alternation, skip to next expression */ cs = SNEXT(cs); } else if (*cs & OPT) { /* the match is optional */ cs = SNEXT(cs); matched = 1; /* indicate a successful match */ } else { /* no match, error return */ return (NIL); } break; /* an operator, do something fancy */ case OPER: switch (OSYM(cs)) { /* this is an alternation */ case '|': if (matched) /* last thing in the alternation was a match, skip ahead */ cs = OPTR(cs); else /* no match, keep trying */ cs = ONEXT(cs); break; /* this is a grouping, recurse */ case '(': ptr = expmatch (s, ONEXT(cs), mstring); if (ptr != NIL) { /* the subexpression matched */ matched = 1; s = ptr; } else if (*cs & ALT) { /* alternation, skip to next expression */ matched = 0; } else if (*cs & OPT) { /* the match is optional */ matched = 1; /* indicate a successful match */ } else { /* no match, error return */ return (NIL); } cs = OPTR(cs); break; } break; /* try to match a metasymbol */ case META: switch (MSYM(cs)) { /* try to match anything and remember what was matched */ case 'p': /* * This is really the same as trying the match the * remaining parts of the expression to any subset * of the string. */ s1 = s; do { ptr = expmatch (s1, MNEXT(cs), mstring); if (ptr != NIL && s1 != s) { /* we have a match, remember the match */ strncpy (mstring, s, s1 - s); mstring[s1 - s] = '\0'; return (ptr); } else if (ptr != NIL && (*cs & OPT)) { /* it was aoptional so no match is ok */ return (ptr); } else if (ptr != NIL) { /* not optional and we still matched */ return (NIL); } if (!(isalnum(*s1) || *s1 == '_' || /* C++ destructor */ *s1 == '~' || /* C++ scope operator */ (strlen(s1) > 1 && *s1 == ':' && s1[1] == ':' && (s1++, TRUE)))) return (NIL); if (*s1 == '\\') _escaped = _escaped ? FALSE : TRUE; else _escaped = FALSE; } while (*s1++); return (NIL); /* try to match anything */ case 'a': /* * This is really the same as trying the match the * remaining parts of the expression to any subset * of the string. */ s1 = s; do { ptr = expmatch (s1, MNEXT(cs), mstring); if (ptr != NIL && s1 != s) { /* we have a match */ return (ptr); } else if (ptr != NIL && (*cs & OPT)) { /* it was aoptional so no match is ok */ return (ptr); } else if (ptr != NIL) { /* not optional and we still matched */ return (NIL); } if (*s1 == '\\') _escaped = _escaped ? FALSE : TRUE; else _escaped = FALSE; } while (*s1++); return (NIL); /* fail if we are currently _escaped */ case 'e': if (_escaped) return(NIL); cs = MNEXT(cs); break; /* match any number of tabs and spaces */ case 'd': ptr = s; while (*s == ' ' || *s == '\t') s++; - if (s != ptr || s == _start) { + if (s != ptr || s == s_start) { /* match, be happy */ matched = 1; cs = MNEXT(cs); } else if (*s == '\n' || *s == '\0') { /* match, be happy */ matched = 1; cs = MNEXT(cs); } else if (*cs & ALT) { /* try the next part */ matched = 0; cs = MNEXT(cs); } else if (*cs & OPT) { /* doesn't matter */ matched = 1; cs = MNEXT(cs); } else /* no match, error return */ return (NIL); break; /* check for end of line */ case '$': if (*s == '\0' || *s == '\n') { /* match, be happy */ s++; matched = 1; cs = MNEXT(cs); } else if (*cs & ALT) { /* try the next part */ matched = 0; cs = MNEXT(cs); } else if (*cs & OPT) { /* doesn't matter */ matched = 1; cs = MNEXT(cs); } else /* no match, error return */ return (NIL); break; /* check for start of line */ case '^': - if (s == _start) { + if (s == s_start) { /* match, be happy */ matched = 1; cs = MNEXT(cs); } else if (*cs & ALT) { /* try the next part */ matched = 0; cs = MNEXT(cs); } else if (*cs & OPT) { /* doesn't matter */ matched = 1; cs = MNEXT(cs); } else /* no match, error return */ return (NIL); break; /* end of a subexpression, return success */ case ')': return (s); } break; } } return (s); } diff --git a/usr.bin/vgrind/vfontedpr.c b/usr.bin/vgrind/vfontedpr.c index 7ba7da9a7932..8b5102aef366 100644 --- a/usr.bin/vgrind/vfontedpr.c +++ b/usr.bin/vgrind/vfontedpr.c @@ -1,727 +1,727 @@ /* * Copyright (c) 1980, 1993 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static const char copyright[] = "@(#) Copyright (c) 1980, 1993\n\ The Regents of the University of California. All rights reserved.\n"; #endif /* not lint */ #ifndef lint #if 0 static char sccsid[] = "@(#)vfontedpr.c 8.1 (Berkeley) 6/6/93"; #endif static const char rcsid[] = - "$Id: vfontedpr.c,v 1.9 1997/08/26 11:08:24 charnier Exp $"; + "$Id: vfontedpr.c,v 1.10 1997/09/18 14:07:33 phk Exp $"; #endif /* not lint */ #include #include #include #include #include #include #include #include #include "pathnames.h" #include "extern.h" #define FALSE 0 #define TRUE !(FALSE) #define NIL 0 #define STANDARD 0 #define ALTERNATE 1 /* * Vfontedpr. * * Dave Presotto 1/12/81 (adapted from an earlier version by Bill Joy) * */ #define STRLEN 10 /* length of strings introducing things */ #define PNAMELEN 40 /* length of a function/procedure name */ #define PSMAX 20 /* size of procedure name stacking */ static int iskw __P((char *)); static boolean isproc __P((char *)); static void putKcp __P((char *, char *, boolean)); static void putScp __P((char *)); static void putcp __P((int)); static int tabs __P((char *, char *)); static int width __P((char *, char *)); /* * The state variables */ static boolean filter = FALSE; /* act as a filter (like eqn) */ static boolean inchr; /* in a string constant */ static boolean incomm; /* in a comment of the primary type */ static boolean idx = FALSE; /* form an index */ static boolean instr; /* in a string constant */ static boolean nokeyw = FALSE; /* no keywords being flagged */ static boolean pass = FALSE; /* * when acting as a filter, pass indicates * whether we are currently processing * input. */ static int blklevel; /* current nesting level */ static int comtype; /* type of comment */ static char *defsfile[2] = { _PATH_VGRINDEFS, 0 }; /* name of language definitions file */ static int margin; static int plstack[PSMAX]; /* the procedure nesting level stack */ static char pname[BUFSIZ+1]; static boolean prccont; /* continue last procedure */ static int psptr; /* the stack index of the current procedure */ static char pstack[PSMAX][PNAMELEN+1]; /* the procedure name stack */ /* * The language specific globals */ char *l_acmbeg; /* string introducing a comment */ char *l_acmend; /* string ending a comment */ char *l_blkbeg; /* string begining of a block */ char *l_blkend; /* string ending a block */ char *l_chrbeg; /* delimiter for character constant */ char *l_chrend; /* delimiter for character constant */ char *l_combeg; /* string introducing a comment */ char *l_comend; /* string ending a comment */ char l_escape; /* character used to escape characters */ char *l_keywds[BUFSIZ/2]; /* keyword table address */ char *l_nocom; /* regexp for non-comments */ char *l_prcbeg; /* regular expr for procedure begin */ char *l_strbeg; /* delimiter for string constant */ char *l_strend; /* delimiter for string constant */ boolean l_toplex; /* procedures only defined at top lex level */ char *language = "c"; /* the language indicator */ #define ps(x) printf("%s", x) int main(argc, argv) int argc; char *argv[]; { char *fname = ""; struct stat stbuf; char buf[BUFSIZ]; char *defs; int needbp = 0; argc--, argv++; do { char *cp; int i; if (argc > 0) { if (!strcmp(argv[0], "-h")) { if (argc == 1) { printf("'ds =H\n"); argc = 0; goto rest; } printf("'ds =H %s\n", argv[1]); argc--, argv++; argc--, argv++; if (argc > 0) continue; goto rest; } /* act as a filter like eqn */ if (!strcmp(argv[0], "-f")) { filter++; argv[0] = argv[argc-1]; argv[argc-1] = "-"; continue; } /* take input from the standard place */ if (!strcmp(argv[0], "-")) { argc = 0; goto rest; } /* build an index */ if (!strcmp(argv[0], "-x")) { idx++; argv[0] = "-n"; } /* indicate no keywords */ if (!strcmp(argv[0], "-n")) { nokeyw++; argc--, argv++; continue; } /* specify the font size */ if (!strncmp(argv[0], "-s", 2)) { i = 0; cp = argv[0] + 2; while (*cp) i = i * 10 + (*cp++ - '0'); printf("'ps %d\n'vs %d\n", i, i+1); argc--, argv++; continue; } /* specify the language */ if (!strncmp(argv[0], "-l", 2)) { language = argv[0]+2; argc--, argv++; continue; } /* specify the language description file */ if (!strncmp(argv[0], "-d", 2)) { defsfile[0] = argv[1]; argc--, argv++; argc--, argv++; continue; } /* open the file for input */ if (freopen(argv[0], "r", stdin) == NULL) err(1, "%s", argv[0]); if (idx) printf("'ta 4i 4.25i 5.5iR\n'in .5i\n"); fname = argv[0]; argc--, argv++; } rest: /* * get the language definition from the defs file */ i = cgetent(&defs, defsfile, language); if (i == -1) { fprintf (stderr, "no entry for language %s\n", language); exit (0); } else if (i == -2) { fprintf(stderr, "cannot find vgrindefs file %s\n", defsfile[0]); exit (0); } else if (i == -3) { fprintf(stderr, "potential reference loop detected in vgrindefs file %s\n", defsfile[0]); exit(0); } if (cgetustr(defs, "kw", &cp) == -1) nokeyw = TRUE; else { char **cpp; cpp = l_keywds; while (*cp) { while (*cp == ' ' || *cp =='\t') *cp++ = '\0'; if (*cp) *cpp++ = cp; while (*cp != ' ' && *cp != '\t' && *cp) cp++; } *cpp = NIL; } cgetustr(defs, "pb", &cp); l_prcbeg = convexp(cp); cgetustr(defs, "cb", &cp); l_combeg = convexp(cp); cgetustr(defs, "ce", &cp); l_comend = convexp(cp); cgetustr(defs, "ab", &cp); l_acmbeg = convexp(cp); cgetustr(defs, "ae", &cp); l_acmend = convexp(cp); cgetustr(defs, "sb", &cp); l_strbeg = convexp(cp); cgetustr(defs, "se", &cp); l_strend = convexp(cp); cgetustr(defs, "bb", &cp); l_blkbeg = convexp(cp); cgetustr(defs, "be", &cp); l_blkend = convexp(cp); cgetustr(defs, "lb", &cp); l_chrbeg = convexp(cp); cgetustr(defs, "le", &cp); l_chrend = convexp(cp); if (cgetustr(defs, "nc", &cp) >= 0) l_nocom = convexp(cp); l_escape = '\\'; l_onecase = (cgetcap(defs, "oc", ':') != NULL); l_toplex = (cgetcap(defs, "tl", ':') != NULL); /* initialize the program */ incomm = FALSE; instr = FALSE; inchr = FALSE; _escaped = FALSE; blklevel = 0; for (psptr=0; psptr= 0)) { ps("'FC "); ps(pstack[psptr]); ps("\n"); } #ifdef DEBUG printf ("com %o str %o chr %o ptr %d\n", incomm, instr, inchr, psptr); #endif margin = 0; } needbp = 1; } while (argc > 0); exit(0); } #define isidchr(c) (isalnum(c) || (c) == '_') static void putScp(os) char *os; { register char *s = os; /* pointer to unmatched string */ char dummy[BUFSIZ]; /* dummy to be used by expmatch */ char *comptr; /* end of a comment delimiter */ char *acmptr; /* end of a comment delimiter */ char *strptr; /* end of a string delimiter */ char *chrptr; /* end of a character const delimiter */ char *blksptr; /* end of a lexical block start */ char *blkeptr; /* end of a lexical block end */ char *nocomptr; /* end of a non-comment delimiter */ - _start = os; /* remember the start for expmatch */ + s_start = os; /* remember the start for expmatch */ _escaped = FALSE; if (nokeyw || incomm || instr) goto skip; if (isproc(s)) { ps("'FN "); ps(pname); ps("\n"); if (psptr < PSMAX) { ++psptr; strncpy (pstack[psptr], pname, PNAMELEN); pstack[psptr][PNAMELEN] = '\0'; plstack[psptr] = blklevel; } } skip: do { /* check for string, comment, blockstart, etc */ if (!incomm && !instr && !inchr) { blkeptr = expmatch (s, l_blkend, dummy); blksptr = expmatch (s, l_blkbeg, dummy); comptr = expmatch (s, l_combeg, dummy); acmptr = expmatch (s, l_acmbeg, dummy); strptr = expmatch (s, l_strbeg, dummy); chrptr = expmatch (s, l_chrbeg, dummy); nocomptr = expmatch (s, l_nocom, dummy); /* start of non-comment? */ if (nocomptr != NIL) if ((nocomptr <= comptr || comptr == NIL) && (nocomptr <= acmptr || acmptr == NIL)) { /* continue after non-comment */ putKcp (s, nocomptr-1, FALSE); s = nocomptr; continue; } /* start of a comment? */ if (comptr != NIL) if ((comptr < strptr || strptr == NIL) && (comptr < acmptr || acmptr == NIL) && (comptr < chrptr || chrptr == NIL) && (comptr < blksptr || blksptr == NIL) && (comptr < blkeptr || blkeptr == NIL)) { putKcp (s, comptr-1, FALSE); s = comptr; incomm = TRUE; comtype = STANDARD; if (s != os) ps ("\\c"); ps ("\\c\n'+C\n"); continue; } /* start of a comment? */ if (acmptr != NIL) if ((acmptr < strptr || strptr == NIL) && (acmptr < chrptr || chrptr == NIL) && (acmptr < blksptr || blksptr == NIL) && (acmptr < blkeptr || blkeptr == NIL)) { putKcp (s, acmptr-1, FALSE); s = acmptr; incomm = TRUE; comtype = ALTERNATE; if (s != os) ps ("\\c"); ps ("\\c\n'+C\n"); continue; } /* start of a string? */ if (strptr != NIL) if ((strptr < chrptr || chrptr == NIL) && (strptr < blksptr || blksptr == NIL) && (strptr < blkeptr || blkeptr == NIL)) { putKcp (s, strptr-1, FALSE); s = strptr; instr = TRUE; continue; } /* start of a character string? */ if (chrptr != NIL) if ((chrptr < blksptr || blksptr == NIL) && (chrptr < blkeptr || blkeptr == NIL)) { putKcp (s, chrptr-1, FALSE); s = chrptr; inchr = TRUE; continue; } /* end of a lexical block */ if (blkeptr != NIL) { if (blkeptr < blksptr || blksptr == NIL) { putKcp (s, blkeptr - 1, FALSE); s = blkeptr; if (blklevel > 0 /* sanity */) blklevel--; if (psptr >= 0 && plstack[psptr] >= blklevel) { /* end of current procedure */ if (s != os) ps ("\\c"); ps ("\\c\n'-F\n"); blklevel = plstack[psptr]; /* see if we should print the last proc name */ if (--psptr >= 0) prccont = TRUE; else psptr = -1; } continue; } } /* start of a lexical block */ if (blksptr != NIL) { putKcp (s, blksptr - 1, FALSE); s = blksptr; blklevel++; continue; } /* check for end of comment */ } else if (incomm) { comptr = expmatch (s, l_comend, dummy); acmptr = expmatch (s, l_acmend, dummy); if (((comtype == STANDARD) && (comptr != NIL)) || ((comtype == ALTERNATE) && (acmptr != NIL))) { if (comtype == STANDARD) { putKcp (s, comptr-1, TRUE); s = comptr; } else { putKcp (s, acmptr-1, TRUE); s = acmptr; } incomm = FALSE; ps("\\c\n'-C\n"); continue; } else { putKcp (s, s + strlen(s) -1, TRUE); s = s + strlen(s); continue; } /* check for end of string */ } else if (instr) { if ((strptr = expmatch (s, l_strend, dummy)) != NIL) { putKcp (s, strptr-1, TRUE); s = strptr; instr = FALSE; continue; } else { putKcp (s, s+strlen(s)-1, TRUE); s = s + strlen(s); continue; } /* check for end of character string */ } else if (inchr) { if ((chrptr = expmatch (s, l_chrend, dummy)) != NIL) { putKcp (s, chrptr-1, TRUE); s = chrptr; inchr = FALSE; continue; } else { putKcp (s, s+strlen(s)-1, TRUE); s = s + strlen(s); continue; } } /* print out the line */ putKcp (s, s + strlen(s) -1, FALSE); s = s + strlen(s); } while (*s); } static void putKcp (start, end, force) char *start; /* start of string to write */ char *end; /* end of string to write */ boolean force; /* true if we should force nokeyw */ { int i; int xfld = 0; while (start <= end) { if (idx) { if (*start == ' ' || *start == '\t') { if (xfld == 0) printf("\001"); printf("\t"); xfld = 1; while (*start == ' ' || *start == '\t') start++; continue; } } /* take care of nice tab stops */ if (*start == '\t') { while (*start == '\t') start++; - i = tabs(_start, start) - margin / 8; + i = tabs(s_start, start) - margin / 8; printf("\\h'|%dn'", i * 10 + 1 - margin % 8); continue; } if (!nokeyw && !force) if ((*start == '#' || isidchr(*start)) - && (start == _start || !isidchr(start[-1]))) { + && (start == s_start || !isidchr(start[-1]))) { i = iskw(start); if (i > 0) { ps("\\*(+K"); do putcp((unsigned char)*start++); while (--i > 0); ps("\\*(-K"); continue; } } putcp ((unsigned char)*start++); } } static int tabs(s, os) char *s, *os; { return (width(s, os) / 8); } static int width(s, os) register char *s, *os; { register int i = 0; while (s < os) { if (*s == '\t') { i = (i + 8) &~ 7; s++; continue; } if (*s < ' ') i += 2; else i++; s++; } return (i); } static void putcp(c) register int c; { switch(c) { case 0: break; case '\f': break; case '\r': break; case '{': ps("\\*(+K{\\*(-K"); break; case '}': ps("\\*(+K}\\*(-K"); break; case '\\': ps("\\e"); break; case '_': ps("\\*_"); break; case '-': ps("\\*-"); break; case '`': ps("\\`"); break; case '\'': ps("\\'"); break; case '.': ps("\\&."); break; case '*': ps("\\fI*\\fP"); break; case '/': ps("\\fI\\h'\\w' 'u-\\w'/'u'/\\fP"); break; default: if (c < 040) putchar('^'), c |= '@'; case '\t': case '\n': putchar(c); } } /* * look for a process beginning on this line */ static boolean isproc(s) char *s; { pname[0] = '\0'; if (!l_toplex || blklevel == 0) if (expmatch (s, l_prcbeg, pname) != NIL) { return (TRUE); } return (FALSE); } /* iskw - check to see if the next word is a keyword */ static int iskw(s) register char *s; { register char **ss = l_keywds; register int i = 1; register char *cp = s; while (++cp, isidchr(*cp)) i++; while (cp = *ss++) if (!STRNCMP(s,cp,i) && !isidchr(cp[i])) return (i); return (0); }