2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Edward Wang at The University of California, Berkeley.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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.
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
38 static char sccsid
[] = "@(#)parser4.c 8.1 (Berkeley) 6/6/93";
56 p_expr3_10(level
, v
, flag
)
57 register struct value
*v
;
64 if ((level
== 10 ? p_expr11(v
, flag
)
65 : p_expr3_10(level
+ 1, v
, flag
)) < 0)
87 else if (token
== T_NE
)
113 else if (token
== T_RS
)
121 else if (token
== T_MINUS
)
143 if (l
.v_type
== V_ERR
)
148 if ((level
== 10 ? p_expr11(&r
, flag
)
149 : p_expr3_10(level
+ 1, &r
, flag
)) < 0) {
155 if (r
.v_type
== V_ERR
)
165 if (l
.v_type
== V_STR
) {
166 if (r
.v_type
== V_NUM
)
167 if (p_convstr(&r
) < 0)
170 if (r
.v_type
== V_STR
)
171 if (p_convstr(&l
) < 0)
176 if (r
.v_type
== V_STR
) {
191 if (l
.v_type
== V_STR
|| r
.v_type
== V_STR
) {
192 p_error("%s: Numeric operands required.",
214 if (l
.v_type
== V_STR
) {
215 int tmp
= strcmp(l
.v_str
, r
.v_str
);
227 v
->v_num
= l
.v_num
| r
.v_num
;
230 v
->v_num
= l
.v_num
^ r
.v_num
;
233 v
->v_num
= l
.v_num
& r
.v_num
;
236 v
->v_num
= l
.v_num
== r
.v_num
;
239 v
->v_num
= l
.v_num
!= r
.v_num
;
242 v
->v_num
= l
.v_num
< r
.v_num
;
245 v
->v_num
= l
.v_num
<= r
.v_num
;
248 v
->v_num
= l
.v_num
> r
.v_num
;
251 v
->v_num
= l
.v_num
>= r
.v_num
;
254 if (l
.v_type
== V_STR
) {
256 if ((i
= strlen(l
.v_str
)) > r
.v_num
)
258 v
->v_str
= str_ncpy(l
.v_str
, i
);
261 v
->v_num
= l
.v_num
<< r
.v_num
;
264 if (l
.v_type
== V_STR
) {
266 if ((i
= strlen(l
.v_str
)) > r
.v_num
)
270 v
->v_str
= str_cpy(l
.v_str
+ i
);
273 v
->v_num
= l
.v_num
>> r
.v_num
;
276 if (l
.v_type
== V_STR
) {
277 v
->v_str
= str_cat(l
.v_str
, r
.v_str
);
280 v
->v_num
= l
.v_num
+ r
.v_num
;
283 v
->v_num
= l
.v_num
- r
.v_num
;
286 v
->v_num
= l
.v_num
* r
.v_num
;
289 v
->v_num
= l
.v_num
/ r
.v_num
;
292 v
->v_num
= l
.v_num
% r
.v_num
;