bin/sh/parser.h

   1 /*      $NetBSD: parser.h,v 1.16 2003/08/07 09:05:37 agc Exp $  */
   2
   3 /*-
   4  * Copyright (c) 1991, 1993
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * This code is derived from software contributed to Berkeley by
   8  * Kenneth Almquist.
   9  *
  10  * Redistribution and use in source and binary forms, with or without
  11  * modification, are permitted provided that the following conditions
  12  * are met:
  13  * 1. Redistributions of source code must retain the above copyright
  14  *    notice, this list of conditions and the following disclaimer.
  15  * 2. Redistributions in binary form must reproduce the above copyright
  16  *    notice, this list of conditions and the following disclaimer in the
  17  *    documentation and/or other materials provided with the distribution.
  18  * 3. Neither the name of the University nor the names of its contributors
  19  *    may be used to endorse or promote products derived from this software
  20  *    without specific prior written permission.
  21  *
  22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  32  * SUCH DAMAGE.
  33  *
  34  *      @(#)parser.h    8.3 (Berkeley) 5/4/95
  35  */
  36
  37 /* control characters in argument strings */
  38 #define CTL_FIRST '\201'        /* first 'special' character */
  39 #define CTLESC '\201'           /* escape next character */
  40 #define CTLVAR '\202'           /* variable defn */
  41 #define CTLENDVAR '\203'
  42 #define CTLBACKQ '\204'
  43 #define CTLQUOTE 01             /* ored with CTLBACKQ code if in quotes */
  44 /*      CTLBACKQ | CTLQUOTE == '\205' */
  45 #define CTLARI  '\206'          /* arithmetic expression */
  46 #define CTLENDARI '\207'
  47 #define CTLQUOTEMARK '\210'
  48 #define CTLQUOTEEND '\211'      /* only inside ${...} */
  49 #define CTL_LAST '\211'         /* last 'special' character */
  50
  51 /* variable substitution byte (follows CTLVAR) */
  52 #define VSTYPE  0x0f            /* type of variable substitution */
  53 #define VSNUL   0x10            /* colon--treat the empty string as unset */
  54 #define VSQUOTE 0x80            /* inside double quotes--suppress splitting */
  55
  56 /* values of VSTYPE field */
  57 #define VSNORMAL        0x1             /* normal variable:  $var or ${var} */
  58 #define VSMINUS         0x2             /* ${var-text} */
  59 #define VSPLUS          0x3             /* ${var+text} */
  60 #define VSQUESTION      0x4             /* ${var?message} */
  61 #define VSASSIGN        0x5             /* ${var=text} */
  62 #define VSTRIMLEFT      0x6             /* ${var#pattern} */
  63 #define VSTRIMLEFTMAX   0x7             /* ${var##pattern} */
  64 #define VSTRIMRIGHT     0x8             /* ${var%pattern} */
  65 #define VSTRIMRIGHTMAX  0x9             /* ${var%%pattern} */
  66 #define VSLENGTH        0xa             /* ${#var} */
  67
  68
  69 /*
  70  * NEOF is returned by parsecmd when it encounters an end of file.  It
  71  * must be distinct from NULL, so we use the address of a variable that
  72  * happens to be handy.
  73  */
  74 extern int tokpushback;
  75 #define NEOF ((union node *)&tokpushback)
  76 extern int whichprompt;         /* 1 == PS1, 2 == PS2 */
  77
  78
  79 union node *parsecmd(int);
  80 void fixredir(union node *, const char *, int);
  81 int goodname(char *);
  82 const char *getprompt(void *);