1 /* $NetBSD: parser2.c,v 1.11 2009/04/14 08:50:06 lukem Exp $ */ 2 3 /* 4 * Copyright (c) 1983, 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 * Edward Wang at The University of California, Berkeley. 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 35 #include <sys/cdefs.h> 36 #ifndef lint 37 #if 0 38 static char sccsid[] = "@(#)parser2.c 8.1 (Berkeley) 6/6/93"; 39 #else 40 __RCSID("$NetBSD: parser2.c,v 1.11 2009/04/14 08:50:06 lukem Exp $"); 41 #endif 42 #endif /* not lint */ 43 44 #define EXTERN 45 #include "ww.h" 46 #include "defs.h" 47 #include "alias.h" 48 #undef EXTERN 49 #include "parser.h" 50 #include "var.h" 51 #include "lcmd.h" 52 53 /* 54 * name == 0 means we don't have a function name but 55 * want to parse the arguments anyway. flag == 0 in this case. 56 */ 57 int 58 p_function(const char *name, struct value *v, int flag) 59 { 60 struct value t; 61 struct lcmd_tab *c = 0; 62 struct alias *a = 0; 63 struct lcmd_arg *ap; /* this arg */ 64 struct lcmd_arg *lp = 0; /* list arg */ 65 int i; 66 struct value av[LCMD_NARG + 1]; 67 struct value *vp; 68 69 if (name != 0) { 70 if ((c = lcmd_lookup(name))) 71 name = c->lc_name; 72 else if ((a = alias_lookup(name))) 73 name = a->a_name; 74 else { 75 p_error("%s: No such command or alias.", name); 76 flag = 0; 77 } 78 } 79 for (vp = av; vp < &av[LCMD_NARG + 1]; vp++) 80 vp->v_type = V_ERR; 81 82 if (token == T_LP) 83 (void) s_gettok(); 84 i = 0; 85 for (;;) { 86 ap = 0; 87 vp = 0; 88 if (token == T_COMMA) /* null argument */ 89 t.v_type = V_ERR; 90 else { 91 if (p_expr0(&t, flag) < 0) 92 break; 93 if (t.v_type == V_ERR) 94 flag = 0; 95 } 96 if (token != T_ASSIGN) { 97 if (i >= LCMD_NARG || 98 (c != 0 && (ap = lp) == 0 && 99 (ap = c->lc_arg + i)->arg_name == 0)) { 100 p_error("%s: Too many arguments.", name); 101 flag = 0; 102 } else 103 vp = &av[i++]; 104 } else { 105 char *tmp; 106 if (p_convstr(&t) < 0) 107 goto abort; 108 tmp = t.v_type == V_STR ? t.v_str : 0; 109 (void) s_gettok(); 110 if (p_expr(&t, flag) < 0) { 111 if (tmp) 112 str_free(tmp); 113 p_synerror(); 114 goto abort; 115 } 116 if (t.v_type == V_ERR) 117 flag = 0; 118 if (tmp) { 119 if (c == 0) { 120 /* an aliase */ 121 p_error("%s: Bad alias syntax.", name); 122 flag = 0; 123 } else { 124 for (ap = c->lc_arg, vp = av; 125 ap != 0 && ap->arg_name != 0 && 126 (*ap->arg_name == '\0' || 127 !str_match(tmp, ap->arg_name, 128 ap->arg_minlen)); 129 ap++, vp++) 130 ; 131 if (ap == 0 || ap->arg_name == 0) { 132 p_error("%s: Unknown argument \"%s\".", 133 name, tmp); 134 flag = 0; 135 ap = 0; 136 vp = 0; 137 } 138 } 139 str_free(tmp); 140 } 141 } 142 if (ap != 0) { 143 if (ap->arg_flags & ARG_LIST) { 144 i = vp - av + 1; 145 lp = ap; 146 } 147 if (vp && vp->v_type != V_ERR) { 148 if (*ap->arg_name) 149 p_error("%s: Argument %d (%s) duplicated.", 150 name, (int)(vp - av + 1), 151 ap->arg_name); 152 else 153 p_error("%s: Argument %d duplicated.", 154 name, (int)(vp - av + 1)); 155 flag = 0; 156 vp = 0; 157 } else if (t.v_type == V_ERR) { 158 /* do nothing */ 159 } else if (((ap->arg_flags&ARG_TYPE) == ARG_NUM && 160 t.v_type != V_NUM) || 161 ((ap->arg_flags&ARG_TYPE) == ARG_STR && 162 t.v_type != V_STR)) { 163 if (*ap->arg_name) 164 p_error("%s: Argument %d (%s) type mismatch.", 165 name, (int)(vp - av + 1), 166 ap->arg_name); 167 else 168 p_error("%s: Argument %d type mismatch.", 169 name, (int)(vp - av + 1)); 170 flag = 0; 171 vp = 0; 172 } 173 } 174 if (vp != 0) 175 *vp = t; 176 else 177 val_free(t); 178 if (token == T_COMMA) 179 (void) s_gettok(); 180 } 181 182 if (p_erred()) 183 flag = 0; 184 if (token == T_RP) 185 (void) s_gettok(); 186 else if (token != T_EOL && token != T_EOF) 187 flag = 0; /* look for legal follow set */ 188 v->v_type = V_ERR; 189 if (flag) { 190 if (c != 0) 191 (*c->lc_func)(v, av); 192 else { 193 if (a->a_flags & A_INUSE) 194 p_error("%s: Recursive alias.", a->a_name); 195 else { 196 a->a_flags |= A_INUSE; 197 if (dolongcmd(a->a_buf, av, i) < 0) 198 p_memerror(); 199 a->a_flags &= ~A_INUSE; 200 } 201 } 202 } 203 if (p_abort()) { 204 val_free(*v); 205 v->v_type = V_ERR; 206 goto abort; 207 } 208 for (vp = av; vp < &av[LCMD_NARG]; vp++) 209 val_free(*vp); 210 return 0; 211 abort: 212 for (vp = av; vp < &av[LCMD_NARG]; vp++) 213 val_free(*vp); 214 return -1; 215 } 216 217 int 218 p_assign(const char *name, struct value *v, int flag) 219 { 220 (void) s_gettok(); 221 222 if (p_expr(v, flag) < 0) { 223 p_synerror(); 224 return -1; 225 } 226 switch (v->v_type) { 227 case V_STR: 228 case V_NUM: 229 if (name && flag && var_set(name, v) == 0) { 230 p_memerror(); 231 val_free(*v); 232 return -1; 233 } 234 break; 235 } 236 return 0; 237 } 238