1# 2# Copyright (c) 1991, 1993 3# The Regents of the University of California. All rights reserved. 4# 5# This code is derived from software contributed to Berkeley by 6# Kenneth Almquist. 7# 8# Redistribution and use in source and binary forms, with or without 9# modification, are permitted provided that the following conditions 10# are met: 11# 1. Redistributions of source code must retain the above copyright 12# notice, this list of conditions and the following disclaimer. 13# 2. Redistributions in binary form must reproduce the above copyright 14# notice, this list of conditions and the following disclaimer in the 15# documentation and/or other materials provided with the distribution. 16# 3. All advertising materials mentioning features or use of this software 17# must display the following acknowledgement: 18# This product includes software developed by the University of 19# California, Berkeley and its contributors. 20# 4. Neither the name of the University nor the names of its contributors 21# may be used to endorse or promote products derived from this software 22# without specific prior written permission. 23# 24# THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27# ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34# SUCH DAMAGE. 35# 36# @(#)nodetypes 8.1 (Berkeley) 5/31/93 37# $Id$ 38 39# This file describes the nodes used in parse trees. Unindented lines 40# contain a node type followed by a structure tag. Subsequent indented 41# lines specify the fields of the structure. Several node types can share 42# the same structure, in which case the fields of the structure should be 43# specified only once. 44# 45# A field of a structure is described by the name of the field followed 46# by a type. The currently implemented types are: 47# nodeptr - a pointer to a node 48# nodelist - a pointer to a list of nodes 49# string - a pointer to a nul terminated string 50# int - an integer 51# other - any type that can be copied by assignment 52# temp - a field that doesn't have to be copied when the node is copied 53# The last two types should be followed by the text of a C declaration for 54# the field. 55 56NSEMI nbinary # two commands separated by a semicolon 57 type int 58 ch1 nodeptr # the first child 59 ch2 nodeptr # the second child 60 61NCMD ncmd # a simple command 62 type int 63 backgnd int # set to run command in background 64 args nodeptr # the arguments 65 redirect nodeptr # list of file redirections 66 67NPIPE npipe # a pipeline 68 type int 69 backgnd int # set to run pipeline in background 70 cmdlist nodelist # the commands in the pipeline 71 72NREDIR nredir # redirection (of a compex command) 73 type int 74 n nodeptr # the command 75 redirect nodeptr # list of file redirections 76 77NBACKGND nredir # run command in background 78NSUBSHELL nredir # run command in a subshell 79 80NAND nbinary # the && operator 81NOR nbinary # the || operator 82 83NIF nif # the if statement. Elif clauses are handled 84 type int # using multiple if nodes. 85 test nodeptr # if test 86 ifpart nodeptr # then ifpart 87 elsepart nodeptr # else elsepart 88 89NWHILE nbinary # the while statement. First child is the test 90NUNTIL nbinary # the until statement 91 92NFOR nfor # the for statement 93 type int 94 args nodeptr # for var in args 95 body nodeptr # do body; done 96 var string # the for variable 97 98NCASE ncase # a case statement 99 type int 100 expr nodeptr # the word to switch on 101 cases nodeptr # the list of cases (NCLIST nodes) 102 103NCLIST nclist # a case 104 type int 105 next nodeptr # the next case in list 106 pattern nodeptr # list of patterns for this case 107 body nodeptr # code to execute for this case 108 109 110NDEFUN narg # define a function. The "next" field contains 111 # the body of the function. 112 113NARG narg # represents a word 114 type int 115 next nodeptr # next word in list 116 text string # the text of the word 117 backquote nodelist # list of commands in back quotes 118 119NTO nfile # fd> fname 120NFROM nfile # fd< fname 121NAPPEND nfile # fd>> fname 122 type int 123 next nodeptr # next redirection in list 124 fd int # file descriptor being redirected 125 fname nodeptr # file name, in a NARG node 126 expfname temp char *expfname # actual file name 127 128NTOFD ndup # fd<&dupfd 129NFROMFD ndup # fd>&dupfd 130 type int 131 next nodeptr # next redirection in list 132 fd int # file descriptor being redirected 133 dupfd int # file descriptor to duplicate 134 135NHERE nhere # fd<<\! 136NXHERE nhere # fd<<! 137 type int 138 next nodeptr # next redirection in list 139 fd int # file descriptor being redirected 140 doc nodeptr # input to command (NARG node) 141 142NNOT nnot # ! command (actually pipeline) 143 type int 144 com nodeptr 145