sourcemod-central: sourcepawn/compiler/sc3.c@dabef847cd2c (annotated)

dvander@27	1	/* Pawn compiler - Recursive descend expresion parser
dvander@27	2	*
dvander@27	3	* Copyright (c) ITB CompuPhase, 1997-2005
dvander@27	4	*
dvander@27	5	* This software is provided "as-is", without any express or implied warranty.
dvander@27	6	* In no event will the authors be held liable for any damages arising from
dvander@27	7	* the use of this software.
dvander@27	8	*
dvander@27	9	* Permission is granted to anyone to use this software for any purpose,
dvander@27	10	* including commercial applications, and to alter it and redistribute it
dvander@27	11	* freely, subject to the following restrictions:
dvander@27	12	*
dvander@27	13	* 1. The origin of this software must not be misrepresented; you must not
dvander@27	14	* claim that you wrote the original software. If you use this software in
dvander@27	15	* a product, an acknowledgment in the product documentation would be
dvander@101	16	* appreciated but is not reeq;quired.
dvander@27	17	* 2. Altered source versions must be plainly marked as such, and must not be
dvander@27	18	* misrepresented as being the original software.
dvander@27	19	* 3. This notice may not be removed or altered from any source distribution.
dvander@27	20	*
faluco@62	21	* Version: $Id: sc3.c 3635 2006-08-13 12:19:41Z thiadmer $
dvander@27	22	*/
dvander@27	23	#include <assert.h>
dvander@27	24	#include <stdio.h>
dvander@27	25	#include <stdlib.h> /* for _MAX_PATH */
dvander@27	26	#include <string.h>
dvander@27	27	#if defined FORTIFY
dvander@27	28	#include <alloc/fortify.h>
dvander@27	29	#endif
dvander@27	30	#include "sc.h"
dvander@115	31	#include "sctracker.h"
dvander@27	32
dvander@27	33	static int skim(int opstr,void (testfunc)(int),int dropval,int endval,
dvander@27	34	int (hier)(value),value *lval);
dvander@27	35	static void dropout(int lvalue,void (testfunc)(int val),int exit1,value lval);
dvander@27	36	static int plnge(int opstr,int opoff,int (hier)(value lval),value lval,
dvander@27	37	char *forcetag,int chkbitwise);
dvander@27	38	static int plnge1(int (hier)(value lval),value *lval);
dvander@27	39	static void plnge2(void (*oper)(void),
dvander@27	40	int (hier)(value lval),
dvander@27	41	value lval1,value lval2);
dvander@27	42	static cell calc(cell left,void (oper)(),cell right,char boolresult);
dvander@27	43	static int hier14(value *lval);
dvander@27	44	static int hier13(value *lval);
dvander@27	45	static int hier12(value *lval);
dvander@27	46	static int hier11(value *lval);
dvander@27	47	static int hier10(value *lval);
dvander@27	48	static int hier9(value *lval);
dvander@27	49	static int hier8(value *lval);
dvander@27	50	static int hier7(value *lval);
dvander@27	51	static int hier6(value *lval);
dvander@27	52	static int hier5(value *lval);
dvander@27	53	static int hier4(value *lval);
dvander@27	54	static int hier3(value *lval);
dvander@27	55	static int hier2(value *lval);
dvander@27	56	static int hier1(value *lval1);
dvander@27	57	static int primary(value *lval);
dvander@27	58	static void clear_value(value *lval);
dvander@27	59	static void callfunction(symbol sym,value lval_result,int matchparanthesis);
dvander@27	60	static int dbltest(void (oper)(),value lval1,value *lval2);
dvander@27	61	static int commutative(void (*oper)());
dvander@27	62	static int constant(value *lval);
dvander@27	63
dvander@27	64	static char lastsymbol[sNAMEMAX+1]; /* name of last function/variable */
dvander@27	65	static int bitwise_opercount; /* count of bitwise operators in an expression */
dvander@27	66
dvander@27	67	/* Function addresses of binary operators for signed operations */
dvander@27	68	static void (*op1[17])(void) = {
dvander@27	69	os_mult,os_div,os_mod, /* hier3, index 0 */
dvander@27	70	ob_add,ob_sub, /* hier4, index 3 */
dvander@27	71	ob_sal,os_sar,ou_sar, /* hier5, index 5 */
dvander@27	72	ob_and, /* hier6, index 8 */
dvander@27	73	ob_xor, /* hier7, index 9 */
dvander@27	74	ob_or, /* hier8, index 10 */
dvander@27	75	os_le,os_ge,os_lt,os_gt, /* hier9, index 11 */
dvander@27	76	ob_eq,ob_ne, /* hier10, index 15 */
dvander@27	77	};
dvander@27	78	/* These two functions are defined because the functions inc() and dec() in
dvander@27	79	* SC4.C have a different prototype than the other code generation functions.
dvander@27	80	* The arrays for user-defined functions use the function pointers for
dvander@27	81	* identifying what kind of operation is requested; these functions must all
dvander@27	82	* have the same prototype. As inc() and dec() are special cases already, it
dvander@27	83	* is simplest to add two "do-nothing" functions.
dvander@27	84	*/
dvander@27	85	static void user_inc(void) {}
dvander@27	86	static void user_dec(void) {}
dvander@27	87
dvander@27	88	/*
dvander@27	89	* Searches for a binary operator a list of operators. The list is stored in
dvander@27	90	* the array "list". The last entry in the list should be set to 0.
dvander@27	91	*
dvander@27	92	* The index of an operator in "list" (if found) is returned in "opidx". If
dvander@27	93	* no operator is found, nextop() returns 0.
dvander@27	94	*
dvander@27	95	* If an operator is found in the expression, it cannot be used in a function
dvander@27	96	* call with omitted parantheses. Mark this...
dvander@27	97	*
dvander@27	98	* Global references: sc_allowproccall (modified)
dvander@27	99	*/
dvander@27	100	static int nextop(int opidx,int list)
dvander@27	101	{
dvander@27	102	*opidx=0;
dvander@27	103	while (*list){
dvander@27	104	if (matchtoken(*list)){
dvander@27	105	sc_allowproccall=FALSE;
dvander@27	106	return TRUE; /* found! */
dvander@27	107	} else {
dvander@27	108	list+=1;
dvander@27	109	*opidx+=1;
dvander@27	110	} /* if */
dvander@27	111	} /* while */
dvander@27	112	return FALSE; /* entire list scanned, nothing found */
dvander@27	113	}
dvander@27	114
dvander@27	115	SC_FUNC int check_userop(void (*oper)(void),int tag1,int tag2,int numparam,
dvander@27	116	value lval,int resulttag)
dvander@27	117	{
dvander@27	118	static char binoperstr[] = { "", "/", "%", "+", "-", "", "", "",
dvander@27	119	"", "", "", "<=", ">=", "<", ">", "==", "!=" };
dvander@27	120	static int binoper_savepri[] = { FALSE, FALSE, FALSE, FALSE, FALSE, FALSE,
dvander@27	121	FALSE, FALSE, FALSE, FALSE, FALSE,
dvander@27	122	TRUE, TRUE, TRUE, TRUE, FALSE, FALSE };
dvander@27	123	static char *unoperstr[] = { "!", "-", "++", "--" };
dvander@27	124	static void (*unopers[])(void) = { lneg, neg, user_inc, user_dec };
dvander@27	125	char opername[4] = "", symbolname[sNAMEMAX+1];
dvander@27	126	int i,swapparams,savepri,savealt;
dvander@27	127	int paramspassed;
dvander@27	128	symbol *sym;
dvander@27	129
dvander@27	130	/* since user-defined operators on untagged operands are forbidden, we have
dvander@27	131	* a quick exit.
dvander@27	132	*/
dvander@27	133	assert(numparam==1 \|\| numparam==2);
dvander@27	134	if (tag1==0 && (numparam==1 \|\| tag2==0))
dvander@27	135	return FALSE;
dvander@27	136
dvander@27	137	savepri=savealt=FALSE;
dvander@27	138	/* find the name with the operator */
dvander@27	139	if (numparam==2) {
dvander@27	140	if (oper==NULL) {
dvander@27	141	/* assignment operator: a special case */
dvander@27	142	strcpy(opername,"=");
dvander@27	143	if (lval!=NULL && (lval->ident==iARRAYCELL \|\| lval->ident==iARRAYCHAR))
dvander@27	144	savealt=TRUE;
dvander@27	145	} else {
dvander@27	146	assert( (sizeof binoperstr / sizeof binoperstr[0]) == (sizeof op1 / sizeof op1[0]) );
dvander@27	147	for (i=0; i<sizeof op1 / sizeof op1[0]; i++) {
dvander@27	148	if (oper==op1[i]) {
dvander@27	149	strcpy(opername,binoperstr[i]);
dvander@27	150	savepri=binoper_savepri[i];
dvander@27	151	break;
dvander@27	152	} /* if */
dvander@27	153	} /* for */
dvander@27	154	} /* if */
dvander@27	155	} else {
dvander@27	156	assert(oper!=NULL);
dvander@27	157	assert(numparam==1);
dvander@27	158	/* try a select group of unary operators */
dvander@27	159	assert( (sizeof unoperstr / sizeof unoperstr[0]) == (sizeof unopers / sizeof unopers[0]) );
dvander@27	160	if (opername[0]=='\0') {
dvander@27	161	for (i=0; i<sizeof unopers / sizeof unopers[0]; i++) {
dvander@27	162	if (oper==unopers[i]) {
dvander@27	163	strcpy(opername,unoperstr[i]);
dvander@27	164	break;
dvander@27	165	} /* if */
dvander@27	166	} /* for */
dvander@27	167	} /* if */
dvander@27	168	} /* if */
dvander@27	169	/* if not found, quit */
dvander@27	170	if (opername[0]=='\0')
dvander@27	171	return FALSE;
dvander@27	172
dvander@27	173	/* create a symbol name from the tags and the operator name */
dvander@27	174	assert(numparam==1 \|\| numparam==2);
dvander@27	175	operator_symname(symbolname,opername,tag1,tag2,numparam,tag2);
dvander@27	176	swapparams=FALSE;
dvander@27	177	sym=findglb(symbolname,sGLOBAL);
dvander@27	178	if (sym==NULL /\|\| (sym->usage & uDEFINE)==0/) { /* ??? should not check uDEFINE; first pass clears these bits */
dvander@27	179	/* check for commutative operators */
dvander@27	180	if (tag1==tag2 \|\| oper==NULL \|\| !commutative(oper))
dvander@27	181	return FALSE; /* not commutative, cannot swap operands */
dvander@27	182	/* if arrived here, the operator is commutative and the tags are different,
dvander@27	183	* swap tags and try again
dvander@27	184	*/
dvander@27	185	assert(numparam==2); /* commutative operator must be a binary operator */
dvander@27	186	operator_symname(symbolname,opername,tag2,tag1,numparam,tag1);
dvander@27	187	swapparams=TRUE;
dvander@27	188	sym=findglb(symbolname,sGLOBAL);
dvander@27	189	if (sym==NULL /\|\| (sym->usage & uDEFINE)==0/)
dvander@27	190	return FALSE;
dvander@27	191	} /* if */
dvander@27	192
dvander@27	193	/* check existance and the proper declaration of this function */
dvander@27	194	if ((sym->usage & uMISSING)!=0 \|\| (sym->usage & uPROTOTYPED)==0) {
dvander@27	195	char symname[2sNAMEMAX+16]; / allow space for user defined operators */
dvander@27	196	funcdisplayname(symname,sym->name);
dvander@27	197	if ((sym->usage & uMISSING)!=0)
dvander@27	198	error(4,symname); /* function not defined */
dvander@27	199	if ((sym->usage & uPROTOTYPED)==0)
dvander@27	200	error(71,symname); /* operator must be declared before use */
dvander@27	201	} /* if */
dvander@27	202
dvander@27	203	/* we don't want to use the redefined operator in the function that
dvander@27	204	* redefines the operator itself, otherwise the snippet below gives
dvander@27	205	* an unexpected recursion:
dvander@27	206	* fixed:operator+(fixed:a, fixed:b)
dvander@27	207	* return a + b
dvander@27	208	*/
dvander@27	209	if (sym==curfunc)
dvander@27	210	return FALSE;
dvander@27	211
dvander@27	212	/* for increment and decrement operators, the symbol must first be loaded
dvander@27	213	* (and stored back afterwards)
dvander@27	214	*/
dvander@27	215	if (oper==user_inc \|\| oper==user_dec) {
dvander@27	216	assert(!savepri);
dvander@27	217	assert(lval!=NULL);
dvander@27	218	if (lval->ident==iARRAYCELL \|\| lval->ident==iARRAYCHAR)
dvander@27	219	pushreg(sPRI); /* save current address in PRI */
dvander@27	220	rvalue(lval); /* get the symbol's value in PRI */
dvander@27	221	} /* if */
dvander@27	222
dvander@27	223	assert(!savepri \|\| !savealt); /* either one MAY be set, but not both */
dvander@27	224	if (savepri) {
dvander@27	225	/* the chained comparison operators require that the ALT register is
dvander@27	226	* unmodified, so we save it here; actually, we save PRI because the normal
dvander@27	227	* instruction sequence (without user operator) swaps PRI and ALT
dvander@27	228	*/
dvander@27	229	pushreg(sPRI); /* right-hand operand is in PRI */
dvander@27	230	} else if (savealt) {
dvander@27	231	/* for the assignment operator, ALT may contain an address at which the
dvander@27	232	* result must be stored; this address must be preserved accross the
dvander@27	233	* call
dvander@27	234	*/
dvander@27	235	assert(lval!=NULL); /* this was checked earlier */
dvander@27	236	assert(lval->ident==iARRAYCELL \|\| lval->ident==iARRAYCHAR); /* checked earlier */
dvander@27	237	pushreg(sALT);
dvander@27	238	} /* if */
dvander@27	239
dvander@27	240	/* push parameters, call the function */
dvander@27	241	paramspassed= (oper==NULL) ? 1 : numparam;
dvander@27	242	switch (paramspassed) {
dvander@27	243	case 1:
dvander@27	244	pushreg(sPRI);
dvander@27	245	break;
dvander@27	246	case 2:
dvander@27	247	/* note that 1) a function expects that the parameters are pushed
dvander@27	248	* in reversed order, and 2) the left operand is in the secondary register
dvander@27	249	* and the right operand is in the primary register */
dvander@27	250	if (swapparams) {
dvander@27	251	pushreg(sALT);
dvander@27	252	pushreg(sPRI);
dvander@27	253	} else {
dvander@27	254	pushreg(sPRI);
dvander@27	255	pushreg(sALT);
dvander@27	256	} /* if */
dvander@27	257	break;
dvander@27	258	default:
dvander@27	259	assert(0);
dvander@27	260	} /* switch */
dvander@27	261	markexpr(sPARM,NULL,0); /* mark the end of a sub-expression */
dvander@101	262	pushval((cell)paramspassed /* sizeof(cell)/ );
dvander@27	263	assert(sym->ident==iFUNCTN);
dvander@27	264	ffcall(sym,NULL,paramspassed);
dvander@27	265	if (sc_status!=statSKIP)
dvander@27	266	markusage(sym,uREAD); /* do not mark as "used" when this call itself is skipped */
dvander@27	267	if ((sym->usage & uNATIVE)!=0 && sym->x.lib!=NULL)
dvander@27	268	sym->x.lib->value += 1; /* increment "usage count" of the library */
dvander@27	269	sideeffect=TRUE; /* assume functions carry out a side-effect */
dvander@27	270	assert(resulttag!=NULL);
dvander@27	271	resulttag=sym->tag; / save tag of the called function */
dvander@27	272
dvander@27	273	if (savepri \|\| savealt)
dvander@27	274	popreg(sALT); /* restore the saved PRI/ALT that into ALT */
dvander@27	275	if (oper==user_inc \|\| oper==user_dec) {
dvander@27	276	assert(lval!=NULL);
dvander@27	277	if (lval->ident==iARRAYCELL \|\| lval->ident==iARRAYCHAR)
dvander@27	278	popreg(sALT); /* restore address (in ALT) */
dvander@27	279	store(lval); /* store PRI in the symbol */
dvander@27	280	moveto1(); /* make sure PRI is restored on exit */
dvander@27	281	} /* if */
dvander@27	282	return TRUE;
dvander@27	283	}
dvander@27	284
dvander@27	285	SC_FUNC int matchtag(int formaltag,int actualtag,int allowcoerce)
dvander@27	286	{
dvander@27	287	if (formaltag!=actualtag) {
dvander@27	288	/* if the formal tag is zero and the actual tag is not "fixed", the actual
dvander@27	289	* tag is "coerced" to zero
dvander@27	290	*/
dvander@132	291	if (!allowcoerce \|\| formaltag!=0 \|\| (actualtag & FIXEDTAG)!=0) {
dvander@132	292	if (formaltag & FUNCTAG)
dvander@132	293	{
dvander@132	294	if (actualtag == pc_functag \|\| (formaltag == pc_functag && actualtag & FUNCTAG))
dvander@132	295	{
dvander@132	296	return TRUE;
dvander@132	297	} else if (actualtag & FUNCTAG) {
dvander@132	298	constvalue *v = find_tag_byval(actualtag);
dvander@132	299	int index;
dvander@132	300	short usage = uPUBLIC;
dvander@132	301	symbol sym, found = NULL;
dvander@132	302	funcenum_t *e;
dvander@132	303	functag_t *t;
dvander@132	304
dvander@132	305	if (strncmp(v->name, "$Func", 5) != 0)
dvander@132	306	{
dvander@132	307	return FALSE;
dvander@132	308	}
dvander@132	309
dvander@132	310	/* Now we have to go about looking up each function in this enum. WHICH IS IT. */
dvander@132	311	e = funcenums_find_byval(formaltag);
dvander@132	312	if (!e)
dvander@132	313	{
dvander@132	314	return FALSE;
dvander@132	315	}
dvander@132	316
dvander@132	317	assert(v->name[5] == '@' \|\| v->name[5] == '!');
dvander@132	318
dvander@132	319	/* Deduce which function type this is */
dvander@132	320	if (v->name[5] == '@')
dvander@132	321	{
dvander@132	322	usage = uPUBLIC;
dvander@132	323	} else if (v->name[5] = '!') {
dvander@132	324	usage = uFORWARD;
dvander@132	325	}
dvander@132	326
dvander@132	327	index = atoi(&v->name[6]);
dvander@132	328
dvander@132	329	assert(index >= 0);
dvander@132	330
dvander@132	331	/* Find the function, either by public idx or code addr */
dvander@132	332	if (usage == uPUBLIC)
dvander@132	333	{
dvander@132	334	for (sym=glbtab.next; sym!=NULL; sym=sym->next) {
dvander@132	335	if (sym->ident==iFUNCTN && (sym->usage & uPUBLIC)!=0 && (sym->vclass == sGLOBAL))
dvander@132	336	{
dvander@132	337	if (index-- == 0)
dvander@132	338	{
dvander@132	339	found = sym;
dvander@132	340	break;
dvander@132	341	}
dvander@132	342	}
dvander@132	343	}
dvander@132	344	} else if (usage == uFORWARD) {
dvander@132	345	for (sym=glbtab.next; sym!=NULL; sym=sym->next) {
dvander@132	346	if (sym->ident==iFUNCTN && (sym->vclass == sGLOBAL))
dvander@132	347	{
dvander@132	348	if (sym->codeaddr == index)
dvander@132	349	{
dvander@132	350	found = sym;
dvander@132	351	break;
dvander@132	352	}
dvander@132	353	}
dvander@132	354	}
dvander@132	355	}
dvander@132	356
dvander@132	357	if (!found)
dvander@132	358	{
dvander@132	359	assert(found);
dvander@132	360	return FALSE;
dvander@132	361	}
dvander@132	362
dvander@132	363	/* Wow, we now have:
dvander@132	364	* 1) The functional enum deduced from formaltag
dvander@132	365	* 2) The function trying to be shoved in deduced from actualtag
dvander@132	366	* Now we have to check if it matches any one of the functags inside the enum.
dvander@132	367	*/
dvander@132	368	t = e->first;
dvander@132	369	while (t)
dvander@132	370	{
dvander@132	371	int curarg,skip=0,i;
dvander@132	372	arginfo *func_arg;
dvander@132	373	funcarg_t *enum_arg;
dvander@132	374	/* Check return type first. */
dvander@132	375	if (t->ret_tag != sym->tag)
dvander@132	376	{
dvander@132	377	t = t->next;
dvander@132	378	continue;
dvander@132	379	}
dvander@132	380	/* Check usage */
dvander@132	381	if (t->type != usage)
dvander@132	382	{
dvander@132	383	t = t->next;
dvander@132	384	continue;
dvander@132	385	}
dvander@132	386	/* Begin iterating arguments */
dvander@132	387	for (curarg=0; curarg<t->argcount; curarg++)
dvander@132	388	{
dvander@132	389	enum_arg = &t->args[curarg];
dvander@132	390	/* Check whether we've exhausted our arguments */
dvander@132	391	if (sym->dim.arglist[curarg].ident == 0)
dvander@132	392	{
dvander@132	393	/* Can we bail out early? */
dvander@132	394	if (!enum_arg->ommittable)
dvander@132	395	{
dvander@132	396	/* No! */
dvander@132	397	skip = 1;
dvander@132	398	}
dvander@132	399	break;
dvander@132	400	}
dvander@132	401	func_arg = &sym->dim.arglist[curarg];
dvander@132	402	/* First check the ident type */
dvander@132	403	if (enum_arg->ident != func_arg->ident)
dvander@132	404	{
dvander@132	405	skip = 1;
dvander@132	406	break;
dvander@132	407	}
dvander@132	408	/* Next check arrayness */
dvander@132	409	if (enum_arg->dimcount != func_arg->numdim)
dvander@132	410	{
dvander@132	411	skip = 1;
dvander@132	412	break;
dvander@132	413	}
dvander@132	414	if (enum_arg->dimcount > 0)
dvander@132	415	{
dvander@132	416	for (i=0; i<enum_arg->dimcount; i++)
dvander@132	417	{
dvander@132	418	if (enum_arg->dims[i] != func_arg->dim[i])
dvander@132	419	{
dvander@132	420	skip = 1;
dvander@132	421	break;
dvander@132	422	}
dvander@132	423	}
dvander@132	424	if (skip)
dvander@132	425	{
dvander@132	426	break;
dvander@132	427	}
dvander@132	428	}
dvander@132	429	/* Lastly, check the tags */
dvander@132	430	if (enum_arg->tagcount != func_arg->numtags)
dvander@132	431	{
dvander@132	432	skip = 1;
dvander@132	433	break;
dvander@132	434	}
dvander@132	435	/* They should all be in the same order just for clarity... */
dvander@132	436	for (i=0; i<enum_arg->tagcount; i++)
dvander@132	437	{
dvander@132	438	if (enum_arg->tags[i] != func_arg->tags[i])
dvander@132	439	{
dvander@132	440	skip = 1;
dvander@132	441	break;
dvander@132	442	}
dvander@132	443	}
dvander@132	444	if (skip)
dvander@132	445	{
dvander@132	446	break;
dvander@132	447	}
dvander@132	448	}
dvander@132	449	if (!skip)
dvander@132	450	{
dvander@132	451	/* Make sure there are no trailing arguments */
dvander@132	452	if (sym->dim.arglist[curarg].ident == 0)
dvander@132	453	{
dvander@132	454	return TRUE;
dvander@132	455	}
dvander@132	456	}
dvander@132	457	t = t->next;
dvander@132	458	}
dvander@132	459	}
dvander@132	460	}
dvander@132	461	return FALSE;
dvander@132	462	}
dvander@27	463	} /* if */
dvander@27	464	return TRUE;
dvander@27	465	}
dvander@27	466
dvander@27	467	/*
dvander@27	468	* The AMX pseudo-processor has no direct support for logical (boolean)
dvander@27	469	* operations. These have to be done via comparing and jumping. Since we are
dvander@27	470	* already jumping through the code, we might as well implement an "early
dvander@27	471	* drop-out" evaluation (also called "short-circuit"). This conforms to
dvander@27	472	* standard C:
dvander@27	473	*
dvander@27	474	* expr1 \|\| expr2 expr2 will only be evaluated if expr1 is false.
dvander@27	475	* expr1 && expr2 expr2 will only be evaluated if expr1 is true.
dvander@27	476	*
dvander@27	477	* expr1 \|\| expr2 && expr3 expr2 will only be evaluated if expr1 is false
dvander@27	478	* and expr3 will only be evaluated if expr1 is
dvander@27	479	* false and expr2 is true.
dvander@27	480	*
dvander@27	481	* Code generation for the last example proceeds thus:
dvander@27	482	*
dvander@27	483	* evaluate expr1
dvander@27	484	* operator \|\| found
dvander@27	485	* jump to "l1" if result of expr1 not equal to 0
dvander@27	486	* evaluate expr2
dvander@27	487	* -> operator && found; skip to higher level in hierarchy diagram
dvander@27	488	* jump to "l2" if result of expr2 equal to 0
dvander@27	489	* evaluate expr3
dvander@27	490	* jump to "l2" if result of expr3 equal to 0
dvander@27	491	* set expression result to 1 (true)
dvander@27	492	* jump to "l3"
dvander@27	493	* l2: set expression result to 0 (false)
dvander@27	494	* l3:
dvander@27	495	* <- drop back to previous hierarchy level
dvander@27	496	* jump to "l1" if result of expr2 && expr3 not equal to 0
dvander@27	497	* set expression result to 0 (false)
dvander@27	498	* jump to "l4"
dvander@27	499	* l1: set expression result to 1 (true)
dvander@27	500	* l4:
dvander@27	501	*
dvander@27	502	*/
dvander@27	503
dvander@27	504	/* Skim over terms adjoining \|\| and && operators
dvander@27	505	* dropval The value of the expression after "dropping out". An "or" drops
dvander@27	506	* out when the left hand is TRUE, so dropval must be 1 on "or"
dvander@27	507	* expressions.
dvander@27	508	* endval The value of the expression when no expression drops out. In an
dvander@27	509	* "or" expression, this happens when both the left hand and the
dvander@27	510	* right hand are FALSE, so endval must be 0 for "or" expressions.
dvander@27	511	*/
dvander@27	512	static int skim(int opstr,void (testfunc)(int),int dropval,int endval,
dvander@27	513	int (hier)(value),value *lval)
dvander@27	514	{
dvander@27	515	int lvalue,hits,droplab,endlab,opidx;
dvander@27	516	int allconst,foundop;
dvander@27	517	cell constval;
dvander@27	518	int index;
dvander@27	519	cell cidx;
dvander@27	520
dvander@27	521	stgget(&index,&cidx); /* mark position in code generator */
dvander@27	522	hits=FALSE; /* no logical operators "hit" yet */
dvander@27	523	allconst=TRUE; /* assume all values "const" */
dvander@27	524	constval=0;
dvander@27	525	droplab=0; /* to avoid a compiler warning */
dvander@27	526	for ( ;; ) {
dvander@27	527	lvalue=plnge1(hier,lval); /* evaluate left expression */
dvander@27	528
dvander@27	529	allconst= allconst && (lval->ident==iCONSTEXPR);
dvander@27	530	if (allconst) {
dvander@27	531	if (hits) {
dvander@27	532	/* one operator was already found */
dvander@27	533	if (testfunc==jmp_ne0)
dvander@27	534	lval->constval= lval->constval \|\| constval;
dvander@27	535	else
dvander@27	536	lval->constval= lval->constval && constval;
dvander@27	537	} /* if */
dvander@27	538	constval=lval->constval; /* save result accumulated so far */
dvander@27	539	} /* if */
dvander@27	540
dvander@27	541	foundop=nextop(&opidx,opstr);
dvander@27	542	if ((foundop \|\| hits) && (lval->ident==iARRAY \|\| lval->ident==iREFARRAY))
dvander@27	543	error(33, lval->sym ? (lval->sym->name ? lval->sym->name : "-unknown") : "-unknown-"); /* array was not indexed in an expression */
dvander@27	544	if (foundop) {
dvander@27	545	if (!hits) {
dvander@27	546	/* this is the first operator in the list */
dvander@27	547	hits=TRUE;
dvander@27	548	droplab=getlabel();
dvander@27	549	} /* if */
dvander@27	550	dropout(lvalue,testfunc,droplab,lval);
dvander@27	551	} else if (hits) { /* no (more) identical operators */
dvander@27	552	dropout(lvalue,testfunc,droplab,lval); /* found at least one operator! */
dvander@27	553	ldconst(endval,sPRI);
dvander@27	554	jumplabel(endlab=getlabel());
dvander@27	555	setlabel(droplab);
dvander@27	556	ldconst(dropval,sPRI);
dvander@27	557	setlabel(endlab);
dvander@27	558	lval->sym=NULL;
dvander@27	559	lval->tag=pc_addtag("bool"); /* force tag to be "bool" */
dvander@27	560	if (allconst) {
dvander@27	561	lval->ident=iCONSTEXPR;
dvander@27	562	lval->constval=constval;
dvander@27	563	stgdel(index,cidx); /* scratch generated code and calculate */
dvander@27	564	} else {
dvander@27	565	lval->ident=iEXPRESSION;
dvander@27	566	lval->constval=0;
dvander@27	567	} /* if */
dvander@27	568	return FALSE;
dvander@27	569	} else {
dvander@27	570	return lvalue; /* none of the operators in "opstr" were found */
dvander@27	571	} /* if */
dvander@27	572
dvander@27	573	} /* while */
dvander@27	574	}
dvander@27	575
dvander@27	576	/*
dvander@27	577	* Reads into the primary register the variable pointed to by lval if
dvander@27	578	* plunging through the hierarchy levels detected an lvalue. Otherwise
dvander@27	579	* if a constant was detected, it is loaded. If there is no constant and
dvander@27	580	* no lvalue, the primary register must already contain the expression
dvander@27	581	* result.
dvander@27	582	*
dvander@27	583	* After that, the compare routines "jmp_ne0" or "jmp_eq0" are called, which
dvander@27	584	* compare the primary register against 0, and jump to the "early drop-out"
dvander@27	585	* label "exit1" if the condition is true.
dvander@27	586	*/
dvander@27	587	static void dropout(int lvalue,void (testfunc)(int val),int exit1,value lval)
dvander@27	588	{
dvander@27	589	if (lvalue)
dvander@27	590	rvalue(lval);
dvander@27	591	else if (lval->ident==iCONSTEXPR)
dvander@27	592	ldconst(lval->constval,sPRI);
dvander@27	593	(*testfunc)(exit1);
dvander@27	594	}
dvander@27	595
dvander@27	596	static void checkfunction(value *lval)
dvander@27	597	{
dvander@27	598	symbol *sym=lval->sym;
dvander@27	599
dvander@27	600	if (sym==NULL \|\| (sym->ident!=iFUNCTN && sym->ident!=iREFFUNC))
dvander@27	601	return; /* no known symbol, or not a function result */
dvander@27	602
dvander@27	603	if ((sym->usage & uDEFINE)!=0) {
dvander@27	604	/* function is defined, can now check the return value (but make an
dvander@27	605	* exception for directly recursive functions)
dvander@27	606	*/
dvander@27	607	if (sym!=curfunc && (sym->usage & uRETVALUE)==0) {
dvander@27	608	char symname[2sNAMEMAX+16]; / allow space for user defined operators */
dvander@27	609	funcdisplayname(symname,sym->name);
dvander@27	610	error(209,symname); /* function should return a value */
dvander@27	611	} /* if */
dvander@27	612	} else {
dvander@27	613	/* function not yet defined, set */
dvander@27	614	sym->usage\|=uRETVALUE; /* make sure that a future implementation of
dvander@27	615	* the function uses "return <value>" */
dvander@27	616	} /* if */
dvander@27	617	}
dvander@27	618
dvander@27	619	/*
dvander@27	620	* Plunge to a lower level
dvander@27	621	*/
dvander@27	622	static int plnge(int opstr,int opoff,int (hier)(value lval),value lval,
dvander@27	623	char *forcetag,int chkbitwise)
dvander@27	624	{
dvander@27	625	int lvalue,opidx;
dvander@27	626	int count;
dvander@27	627	value lval2 = {0};
dvander@27	628
dvander@27	629	lvalue=plnge1(hier,lval);
dvander@27	630	if (nextop(&opidx,opstr)==0)
dvander@27	631	return lvalue; /* no operator in "opstr" found */
dvander@27	632	if (lvalue)
dvander@27	633	rvalue(lval);
dvander@27	634	count=0;
dvander@27	635	do {
dvander@27	636	if (chkbitwise && count++>0 && bitwise_opercount!=0)
dvander@27	637	error(212);
dvander@27	638	opidx+=opoff; /* add offset to index returned by nextop() */
dvander@27	639	plnge2(op1[opidx],hier,lval,&lval2);
dvander@27	640	if (op1[opidx]==ob_and \|\| op1[opidx]==ob_or)
dvander@27	641	bitwise_opercount++;
dvander@27	642	if (forcetag!=NULL)
dvander@27	643	lval->tag=pc_addtag(forcetag);
dvander@27	644	} while (nextop(&opidx,opstr)); /* do */
dvander@27	645	return FALSE; /* result of expression is not an lvalue */
dvander@27	646	}
dvander@27	647
dvander@27	648	/* plnge_rel
dvander@27	649	*
dvander@27	650	* Binary plunge to lower level; this is very simular to plnge, but
dvander@27	651	* it has special code generation sequences for chained operations.
dvander@27	652	*/
dvander@27	653	static int plnge_rel(int opstr,int opoff,int (hier)(value lval),value lval)
dvander@27	654	{
dvander@27	655	int lvalue,opidx;
dvander@27	656	value lval2={0};
dvander@27	657	int count;
dvander@27	658
dvander@27	659	/* this function should only be called for relational operators */
dvander@27	660	assert(op1[opoff]==os_le);
dvander@27	661	lvalue=plnge1(hier,lval);
dvander@27	662	if (nextop(&opidx,opstr)==0)
dvander@27	663	return lvalue; /* no operator in "opstr" found */
dvander@27	664	if (lvalue)
dvander@27	665	rvalue(lval);
dvander@27	666	count=0;
dvander@27	667	lval->boolresult=TRUE;
dvander@27	668	do {
dvander@27	669	/* same check as in plnge(), but "chkbitwise" is always TRUE */
dvander@27	670	if (count>0 && bitwise_opercount!=0)
dvander@27	671	error(212);
dvander@27	672	if (count>0) {
dvander@27	673	relop_prefix();
dvander@27	674	lval=lval2; / copy right hand expression of the previous iteration */
dvander@27	675	} /* if */
dvander@27	676	opidx+=opoff;
dvander@27	677	plnge2(op1[opidx],hier,lval,&lval2);
dvander@27	678	if (count++>0)
dvander@27	679	relop_suffix();
dvander@27	680	} while (nextop(&opidx,opstr)); /* enddo */
dvander@27	681	lval->constval=lval->boolresult;
dvander@27	682	lval->tag=pc_addtag("bool"); /* force tag to be "bool" */
dvander@27	683	return FALSE; /* result of expression is not an lvalue */
dvander@27	684	}
dvander@27	685
dvander@27	686	/* plnge1
dvander@27	687	*
dvander@27	688	* Unary plunge to lower level
dvander@27	689	* Called by: skim(), plnge(), plnge2(), plnge_rel(), hier14() and hier13()
dvander@27	690	*/
dvander@27	691	static int plnge1(int (hier)(value lval),value *lval)
dvander@27	692	{
dvander@27	693	int lvalue,index;
dvander@27	694	cell cidx;
dvander@27	695
dvander@27	696	stgget(&index,&cidx); /* mark position in code generator */
dvander@27	697	lvalue=(*hier)(lval);
dvander@27	698	if (lval->ident==iCONSTEXPR)
dvander@27	699	stgdel(index,cidx); /* load constant later */
dvander@27	700	return lvalue;
dvander@27	701	}
dvander@27	702
dvander@27	703	/* plnge2
dvander@27	704	*
dvander@27	705	* Binary plunge to lower level
dvander@27	706	* Called by: plnge(), plnge_rel(), hier14() and hier1()
dvander@27	707	*/
dvander@27	708	static void plnge2(void (*oper)(void),
dvander@27	709	int (hier)(value lval),
dvander@27	710	value lval1,value lval2)
dvander@27	711	{
dvander@27	712	int index;
dvander@27	713	cell cidx;
dvander@27	714
dvander@27	715	stgget(&index,&cidx); /* mark position in code generator */
dvander@27	716	if (lval1->ident==iCONSTEXPR) { /* constant on left side; it is not yet loaded */
dvander@27	717	if (plnge1(hier,lval2))
dvander@27	718	rvalue(lval2); /* load lvalue now */
dvander@27	719	else if (lval2->ident==iCONSTEXPR)
dvander@27	720	ldconst(lval2->constval<<dbltest(oper,lval2,lval1),sPRI);
dvander@27	721	ldconst(lval1->constval<<dbltest(oper,lval2,lval1),sALT);
dvander@27	722	/* ^ doubling of constants operating on integer addresses */
dvander@27	723	/* is restricted to "add" and "subtract" operators */
dvander@27	724	} else { /* non-constant on left side */
dvander@27	725	pushreg(sPRI);
dvander@27	726	if (plnge1(hier,lval2))
dvander@27	727	rvalue(lval2);
dvander@27	728	if (lval2->ident==iCONSTEXPR) { /* constant on right side */
dvander@27	729	if (commutative(oper)) { /* test for commutative operators */
dvander@27	730	value lvaltmp = {0};
dvander@27	731	stgdel(index,cidx); /* scratch pushreg() and constant fetch (then
dvander@27	732	* fetch the constant again */
dvander@27	733	ldconst(lval2->constval<<dbltest(oper,lval1,lval2),sALT);
dvander@27	734	/* now, the primary register has the left operand and the secondary
dvander@27	735	* register the right operand; swap the "lval" variables so that lval1
dvander@27	736	* is associated with the secondary register and lval2 with the
dvander@27	737	* primary register, as is the "normal" case.
dvander@27	738	*/
dvander@27	739	lvaltmp=*lval1;
dvander@27	740	lval1=lval2;
dvander@27	741	*lval2=lvaltmp;
dvander@27	742	} else {
dvander@27	743	ldconst(lval2->constval<<dbltest(oper,lval1,lval2),sPRI);
dvander@27	744	popreg(sALT); /* pop result of left operand into secondary register */
dvander@27	745	} /* if */
dvander@27	746	} else { /* non-constants on both sides */
dvander@27	747	popreg(sALT);
dvander@27	748	if (dbltest(oper,lval1,lval2))
dvander@27	749	cell2addr(); /* double primary register */
dvander@27	750	if (dbltest(oper,lval2,lval1))
dvander@27	751	cell2addr_alt(); /* double secondary register */
dvander@27	752	} /* if */
dvander@27	753	} /* if */
dvander@27	754	if (oper) {
dvander@27	755	/* If used in an expression, a function should return a value.
dvander@27	756	* If the function has been defined, we can check this. If the
dvander@27	757	* function was not defined, we can set this requirement (so that
dvander@27	758	* a future function definition can check this bit.
dvander@27	759	*/
dvander@27	760	checkfunction(lval1);
dvander@27	761	checkfunction(lval2);
dvander@27	762	if (lval1->ident==iARRAY \|\| lval1->ident==iREFARRAY) {
dvander@27	763	char *ptr=(lval1->sym!=NULL) ? lval1->sym->name : "-unknown-";
dvander@27	764	error(33,ptr); /* array must be indexed */
dvander@27	765	} else if (lval2->ident==iARRAY \|\| lval2->ident==iREFARRAY) {
dvander@27	766	char *ptr=(lval2->sym!=NULL) ? lval2->sym->name : "-unknown-";
dvander@27	767	error(33,ptr); /* array must be indexed */
dvander@27	768	} /* if */
dvander@27	769	/* ??? ^^^ should do same kind of error checking with functions */
dvander@27	770
dvander@27	771	/* check whether an "operator" function is defined for the tag names
dvander@27	772	* (a constant expression cannot be optimized in that case)
dvander@27	773	*/
dvander@27	774	if (check_userop(oper,lval1->tag,lval2->tag,2,NULL,&lval1->tag)) {
dvander@27	775	lval1->ident=iEXPRESSION;
dvander@27	776	lval1->constval=0;
dvander@27	777	} else if (lval1->ident==iCONSTEXPR && lval2->ident==iCONSTEXPR) {
dvander@27	778	/* only constant expression if both constant */
dvander@27	779	stgdel(index,cidx); /* scratch generated code and calculate */
dvander@27	780	if (!matchtag(lval1->tag,lval2->tag,FALSE))
dvander@27	781	error(213); /* tagname mismatch */
dvander@27	782	lval1->constval=calc(lval1->constval,oper,lval2->constval,&lval1->boolresult);
dvander@27	783	} else {
dvander@27	784	if (!matchtag(lval1->tag,lval2->tag,FALSE))
dvander@27	785	error(213); /* tagname mismatch */
dvander@27	786	(oper)(); / do the (signed) operation */
dvander@27	787	lval1->ident=iEXPRESSION;
dvander@27	788	} /* if */
dvander@27	789	} /* if */
dvander@27	790	}
dvander@27	791
faluco@62	792	static cell flooreddiv(cell a,cell b,int return_remainder)
dvander@27	793	{
faluco@62	794	cell q,r;
faluco@62	795
faluco@62	796	if (b==0) {
faluco@62	797	error(29);
faluco@62	798	return 0;
faluco@62	799	} /* if */
faluco@62	800	/* first implement truncated division in a portable way */
faluco@62	801	#define IABS(a) ((a)>=0 ? (a) : (-a))
faluco@62	802	q=IABS(a)/IABS(b);
faluco@62	803	if ((cell)(a ^ b)<0)
faluco@62	804	q=-q; /* swap sign if either "a" or "b" is negative (but not both) */
faluco@62	805	r=a-qb; / calculate the matching remainder */
faluco@62	806	/* now "fiddle" with the values to get floored division */
faluco@62	807	if (r!=0 && (cell)(r ^ b)<0) {
faluco@62	808	q--;
faluco@62	809	r+=b;
faluco@62	810	} /* if */
faluco@62	811	return return_remainder ? r : q;
dvander@27	812	}
dvander@27	813
dvander@27	814	static cell calc(cell left,void (oper)(),cell right,char boolresult)
dvander@27	815	{
dvander@27	816	if (oper==ob_or)
dvander@27	817	return (left \| right);
dvander@27	818	else if (oper==ob_xor)
dvander@27	819	return (left ^ right);
dvander@27	820	else if (oper==ob_and)
dvander@27	821	return (left & right);
dvander@27	822	else if (oper==ob_eq)
dvander@27	823	return (left == right);
dvander@27	824	else if (oper==ob_ne)
dvander@27	825	return (left != right);
dvander@27	826	else if (oper==os_le)
dvander@27	827	return *boolresult &= (char)(left <= right), right;
dvander@27	828	else if (oper==os_ge)
dvander@27	829	return *boolresult &= (char)(left >= right), right;
dvander@27	830	else if (oper==os_lt)
dvander@27	831	return *boolresult &= (char)(left < right), right;
dvander@27	832	else if (oper==os_gt)
dvander@27	833	return *boolresult &= (char)(left > right), right;
dvander@27	834	else if (oper==os_sar)
dvander@27	835	return (left >> (int)right);
dvander@27	836	else if (oper==ou_sar)
dvander@27	837	return ((ucell)left >> (ucell)right);
dvander@27	838	else if (oper==ob_sal)
dvander@27	839	return ((ucell)left << (int)right);
dvander@27	840	else if (oper==ob_add)
dvander@27	841	return (left + right);
dvander@27	842	else if (oper==ob_sub)
dvander@27	843	return (left - right);
dvander@27	844	else if (oper==os_mult)
dvander@27	845	return (left * right);
dvander@27	846	else if (oper==os_div)
faluco@62	847	return flooreddiv(left,right,0);
dvander@27	848	else if (oper==os_mod)
faluco@62	849	return flooreddiv(left,right,1);
dvander@27	850	else
dvander@27	851	error(29); /* invalid expression, assumed 0 (this should never occur) */
dvander@27	852	return 0;
dvander@27	853	}
dvander@27	854
dvander@27	855	SC_FUNC int expression(cell val,int tag,symbol **symptr,int chkfuncresult)
dvander@27	856	{
dvander@27	857	value lval={0};
dvander@64	858	pushheaplist();
dvander@27	859
dvander@27	860	if (hier14(&lval))
dvander@27	861	rvalue(&lval);
dvander@27	862	/* scrap any arrays left on the heap */
dvander@64	863	popheaplist();
dvander@27	864
dvander@27	865	if (lval.ident==iCONSTEXPR && val!=NULL) /* constant expression */
dvander@27	866	*val=lval.constval;
dvander@27	867	if (tag!=NULL)
dvander@27	868	*tag=lval.tag;
dvander@27	869	if (symptr!=NULL)
dvander@27	870	*symptr=lval.sym;
dvander@27	871	if (chkfuncresult)
dvander@27	872	checkfunction(&lval);
dvander@27	873	return lval.ident;
dvander@27	874	}
dvander@27	875
dvander@27	876	SC_FUNC int sc_getstateid(constvalue automaton,constvalue state)
dvander@27	877	{
dvander@27	878	char name[sNAMEMAX+1];
dvander@27	879	cell val;
dvander@27	880	char *str;
dvander@27	881	int fsa,islabel;
dvander@27	882
dvander@27	883	assert(automaton!=NULL);
dvander@27	884	assert(state!=NULL);
dvander@27	885	if (!(islabel=matchtoken(tLABEL)) && !needtoken(tSYMBOL))
dvander@27	886	return 0;
dvander@27	887
dvander@27	888	tokeninfo(&val,&str);
dvander@27	889	assert(strlen(str)<sizeof name);
dvander@27	890	strcpy(name,str);
dvander@27	891	if (islabel \|\| matchtoken(':')) {
dvander@27	892	/* token is an automaton name, add the name and get a new token */
dvander@27	893	*automaton=automaton_find(name);
dvander@27	894	/* read in the state name before checking the automaton, to keep the parser
dvander@27	895	* going (an "unknown automaton" error may occur when the "state" instruction
dvander@27	896	* precedes any state definition)
dvander@27	897	*/
dvander@27	898	if (!needtoken(tSYMBOL))
dvander@27	899	return 0;
dvander@27	900	tokeninfo(&val,&str); /* do not copy the name yet, must check automaton first */
dvander@27	901	if (*automaton==NULL) {
dvander@27	902	error(86,name); /* unknown automaton */
dvander@27	903	return 0;
dvander@27	904	} /* if */
dvander@27	905	assert((*automaton)->index>0);
dvander@27	906	assert(strlen(str)<sizeof name);
dvander@27	907	strcpy(name,str);
dvander@27	908	} else {
dvander@27	909	*automaton=automaton_find("");
dvander@27	910	assert(*automaton!=NULL);
dvander@27	911	assert((*automaton)->index==0);
dvander@27	912	} /* if */
dvander@27	913	assert(*automaton!=NULL);
dvander@27	914	fsa=(*automaton)->index;
dvander@27	915
dvander@27	916	assert(*automaton!=NULL);
dvander@27	917	*state=state_find(name,fsa);
dvander@27	918	if (*state==NULL) {
dvander@27	919	char fsaname=(automaton)->name;
dvander@27	920	if (*fsaname=='\0')
dvander@27	921	fsaname="<main>";
dvander@27	922	error(87,name,fsaname); /* unknown state for automaton */
dvander@27	923	return 0;
dvander@27	924	} /* if */
dvander@27	925
dvander@27	926	return 1;
dvander@27	927	}
dvander@27	928
dvander@27	929	SC_FUNC cell array_totalsize(symbol *sym)
dvander@27	930	{
dvander@27	931	cell length;
dvander@27	932
dvander@27	933	assert(sym!=NULL);
dvander@27	934	assert(sym->ident==iARRAY \|\| sym->ident==iREFARRAY);
dvander@27	935	length=sym->dim.array.length;
dvander@27	936	if (sym->dim.array.level > 0) {
dvander@27	937	cell sublength=array_totalsize(finddepend(sym));
dvander@27	938	if (sublength>0)
dvander@27	939	length=length+length*sublength;
dvander@27	940	else
dvander@27	941	length=0;
dvander@27	942	} /* if */
dvander@27	943	return length;
dvander@27	944	}
dvander@27	945
dvander@27	946	static cell array_levelsize(symbol *sym,int level)
dvander@27	947	{
dvander@27	948	assert(sym!=NULL);
dvander@27	949	assert(sym->ident==iARRAY \|\| sym->ident==iREFARRAY);
dvander@27	950	assert(level <= sym->dim.array.level);
dvander@27	951	while (level-- > 0) {
dvander@27	952	sym=finddepend(sym);
dvander@27	953	assert(sym!=NULL);
dvander@27	954	} /* if */
dvander@27	955	return sym->dim.array.length;
dvander@27	956	}
dvander@27	957
dvander@27	958	/* hier14
dvander@27	959	*
dvander@27	960	* Lowest hierarchy level (except for the , operator).
dvander@27	961	*
dvander@27	962	* Global references: sc_intest (reffered to only)
dvander@27	963	* sc_allowproccall (modified)
dvander@27	964	*/
dvander@27	965	static int hier14(value *lval1)
dvander@27	966	{
dvander@27	967	int lvalue;
dvander@27	968	value lval2={0},lval3={0};
dvander@27	969	void (*oper)(void);
dvander@27	970	int tok,level,i;
dvander@27	971	cell val;
dvander@27	972	char *st;
dvander@27	973	int bwcount,leftarray;
dvander@27	974	cell arrayidx1[sDIMEN_MAX],arrayidx2[sDIMEN_MAX]; /* last used array indices */
dvander@27	975	cell *org_arrayidx;
dvander@27	976
dvander@27	977	bwcount=bitwise_opercount;
dvander@27	978	bitwise_opercount=0;
dvander@27	979	/* initialize the index arrays with unlikely constant indices; note that
dvander@27	980	* these indices will only be changed when the array is indexed with a
dvander@27	981	* constant, and that negative array indices are invalid (so actually, any
dvander@27	982	* negative value would do).
dvander@27	983	*/
dvander@27	984	for (i=0; i<sDIMEN_MAX; i++)
dvander@27	985	arrayidx1[i]=arrayidx2[i]=(cell)(-1L << (sizeof(cell)*8-1));
dvander@27	986	org_arrayidx=lval1->arrayidx; /* save current pointer, to reset later */
dvander@27	987	if (lval1->arrayidx==NULL)
dvander@27	988	lval1->arrayidx=arrayidx1;
dvander@27	989	lvalue=plnge1(hier13,lval1);
dvander@27	990	if (lval1->ident!=iARRAYCELL && lval1->ident!=iARRAYCHAR)
dvander@27	991	lval1->arrayidx=NULL;
dvander@27	992	if (lval1->ident==iCONSTEXPR) /* load constant here */
dvander@27	993	ldconst(lval1->constval,sPRI);
dvander@27	994	tok=lex(&val,&st);
dvander@27	995	switch (tok) {
dvander@27	996	case taOR:
dvander@27	997	oper=ob_or;
dvander@27	998	break;
dvander@27	999	case taXOR:
dvander@27	1000	oper=ob_xor;
dvander@27	1001	break;
dvander@27	1002	case taAND:
dvander@27	1003	oper=ob_and;
dvander@27	1004	break;
dvander@27	1005	case taADD:
dvander@27	1006	oper=ob_add;
dvander@27	1007	break;
dvander@27	1008	case taSUB:
dvander@27	1009	oper=ob_sub;
dvander@27	1010	break;
dvander@27	1011	case taMULT:
dvander@27	1012	oper=os_mult;
dvander@27	1013	break;
dvander@27	1014	case taDIV:
dvander@27	1015	oper=os_div;
dvander@27	1016	break;
dvander@27	1017	case taMOD:
dvander@27	1018	oper=os_mod;
dvander@27	1019	break;
dvander@27	1020	case taSHRU:
dvander@27	1021	oper=ou_sar;
dvander@27	1022	break;
dvander@27	1023	case taSHR:
dvander@27	1024	oper=os_sar;
dvander@27	1025	break;
dvander@27	1026	case taSHL:
dvander@27	1027	oper=ob_sal;
dvander@27	1028	break;
dvander@27	1029	case '=': /* simple assignment */
dvander@27	1030	oper=NULL;
dvander@27	1031	if (sc_intest)
dvander@27	1032	error(211); /* possibly unintended assignment */
dvander@27	1033	break;
dvander@27	1034	default:
dvander@27	1035	lexpush();
dvander@27	1036	bitwise_opercount=bwcount;
dvander@27	1037	lval1->arrayidx=org_arrayidx; /* restore array index pointer */
dvander@27	1038	return lvalue;
dvander@27	1039	} /* switch */
dvander@27	1040
dvander@27	1041	/* if we get here, it was an assignment; first check a few special cases
dvander@27	1042	* and then the general */
dvander@27	1043	if (lval1->ident==iARRAYCHAR) {
dvander@27	1044	/* special case, assignment to packed character in a cell is permitted */
dvander@27	1045	lvalue=TRUE;
dvander@27	1046	} else if (lval1->ident==iARRAY \|\| lval1->ident==iREFARRAY) {
dvander@27	1047	/* array assignment is permitted too (with restrictions) */
dvander@27	1048	if (oper)
dvander@27	1049	return error(23); /* array assignment must be simple assigment */
dvander@27	1050	assert(lval1->sym!=NULL);
dvander@27	1051	if (array_totalsize(lval1->sym)==0)
dvander@27	1052	return error(46,lval1->sym->name); /* unknown array size */
dvander@27	1053	lvalue=TRUE;
dvander@27	1054	} /* if */
dvander@27	1055
dvander@27	1056	/* operand on left side of assignment must be lvalue */
dvander@27	1057	if (!lvalue)
dvander@27	1058	return error(22); /* must be lvalue */
dvander@27	1059	/* may not change "constant" parameters */
dvander@27	1060	assert(lval1->sym!=NULL);
dvander@27	1061	if ((lval1->sym->usage & uCONST)!=0)
dvander@27	1062	return error(22); /* assignment to const argument */
dvander@27	1063	sc_allowproccall=FALSE; /* may no longer use "procedure call" syntax */
dvander@27	1064
dvander@27	1065	lval3=lval1; / save symbol to enable storage of expresion result */
dvander@27	1066	lval1->arrayidx=org_arrayidx; /* restore array index pointer */
dvander@27	1067	if (lval1->ident==iARRAYCELL \|\| lval1->ident==iARRAYCHAR
dvander@27	1068	\|\| lval1->ident==iARRAY \|\| lval1->ident==iREFARRAY)
dvander@27	1069	{
dvander@27	1070	/* if indirect fetch: save PRI (cell address) */
dvander@27	1071	if (oper) {
dvander@27	1072	pushreg(sPRI);
dvander@27	1073	rvalue(lval1);
dvander@27	1074	} /* if */
dvander@27	1075	lval2.arrayidx=arrayidx2;
dvander@27	1076	plnge2(oper,hier14,lval1,&lval2);
dvander@27	1077	if (lval2.ident!=iARRAYCELL && lval2.ident!=iARRAYCHAR)
dvander@27	1078	lval2.arrayidx=NULL;
dvander@27	1079	if (oper)
dvander@27	1080	popreg(sALT);
dvander@27	1081	if (!oper && lval3.arrayidx!=NULL && lval2.arrayidx!=NULL
dvander@27	1082	&& lval3.ident==lval2.ident && lval3.sym==lval2.sym)
dvander@27	1083	{
dvander@27	1084	int same=TRUE;
dvander@27	1085	assert(lval2.arrayidx==arrayidx2);
dvander@27	1086	for (i=0; i<sDIMEN_MAX; i++)
dvander@27	1087	same=same && (lval3.arrayidx[i]==lval2.arrayidx[i]);
dvander@27	1088	if (same)
dvander@27	1089	error(226,lval3.sym->name); /* self-assignment */
dvander@27	1090	} /* if */
dvander@27	1091	} else {
dvander@27	1092	if (oper){
dvander@27	1093	rvalue(lval1);
dvander@27	1094	plnge2(oper,hier14,lval1,&lval2);
dvander@27	1095	} else {
dvander@27	1096	/* if direct fetch and simple assignment: no "push"
dvander@27	1097	* and "pop" needed -> call hier14() directly, */
dvander@27	1098	if (hier14(&lval2))
dvander@27	1099	rvalue(&lval2); /* instead of plnge2(). */
dvander@27	1100	else if (lval2.ident==iVARIABLE)
dvander@27	1101	lval2.ident=iEXPRESSION;/* mark as "rvalue" if it is not an "lvalue" */
dvander@27	1102	checkfunction(&lval2);
dvander@27	1103	/* check whether lval2 and lval3 (old lval1) refer to the same variable */
dvander@27	1104	if (lval2.ident==iVARIABLE && lval3.ident==lval2.ident && lval3.sym==lval2.sym) {
dvander@27	1105	assert(lval3.sym!=NULL);
dvander@27	1106	error(226,lval3.sym->name); /* self-assignment */
dvander@27	1107	} /* if */
dvander@27	1108	} /* if */
dvander@27	1109	} /* if */
dvander@27	1110	/* Array elements are sometimes considered as sub-arrays --when the
dvander@27	1111	* array index is an enumeration field and the enumeration size is greater
dvander@27	1112	* than 1. If the expression on the right side of the assignment is a cell,
dvander@27	1113	* or if an operation is in effect, this does not apply.
dvander@27	1114	*/
dvander@27	1115	leftarray= lval3.ident==iARRAY \|\| lval3.ident==iREFARRAY
dvander@27	1116	\|\| ((lval3.ident==iARRAYCELL \|\| lval3.ident==iARRAYCHAR)
dvander@27	1117	&& lval3.constval>1 && lval3.sym->dim.array.level==0
dvander@27	1118	&& !oper && (lval2.ident==iARRAY \|\| lval2.ident==iREFARRAY));
dvander@27	1119	if (leftarray) {
dvander@27	1120	/* Left operand is an array, right operand should be an array variable
dvander@27	1121	* of the same size and the same dimension, an array literal (of the
dvander@27	1122	* same size) or a literal string. For single-dimensional arrays without
dvander@27	1123	* tag for the index, it is permitted to assign a smaller array into a
dvander@27	1124	* larger one (without warning). This is to make it easier to work with
dvander@27	1125	* strings.
dvander@27	1126	*/
dvander@27	1127	int exactmatch=TRUE;
dvander@27	1128	int idxtag=0;
dvander@27	1129	int ltlength=(int)lval3.sym->dim.array.length;
dvander@27	1130	if ((lval3.ident==iARRAYCELL \|\| lval3.ident==iARRAYCHAR)
dvander@27	1131	&& lval3.constval>0 && lval3.sym->dim.array.level==0)
dvander@27	1132	{
dvander@27	1133	ltlength=(int)lval3.constval;
dvander@27	1134	} /* if */
dvander@27	1135	if (lval2.ident!=iARRAY && lval2.ident!=iREFARRAY
dvander@27	1136	&& (lval2.sym==NULL \|\| lval2.constval<=0))
dvander@27	1137	error(33,lval3.sym->name); /* array must be indexed */
dvander@27	1138	if (lval2.sym!=NULL) {
dvander@27	1139	if (lval2.constval==0) {
dvander@27	1140	val=lval2.sym->dim.array.length;/* array variable */
dvander@27	1141	} else {
dvander@27	1142	val=lval2.constval;
dvander@27	1143	if (lval2.sym->dim.array.level!=0)
dvander@27	1144	error(28,lval2.sym->name);
dvander@27	1145	} /* if */
dvander@27	1146	level=lval2.sym->dim.array.level;
dvander@27	1147	idxtag=lval2.sym->x.tags.index;
dvander@27	1148	if (level==0 && idxtag==0 && lval3.sym->x.tags.index==0)
dvander@27	1149	exactmatch=FALSE;
dvander@27	1150	} else {
dvander@27	1151	val=lval2.constval; /* literal array */
dvander@27	1152	level=0;
dvander@27	1153	/* If val is negative, it means that lval2 is a literal string.
dvander@27	1154	* The string array size may be smaller than the destination
dvander@27	1155	* array, provided that the destination array does not have an
dvander@27	1156	* index tag.
dvander@27	1157	*/
dvander@27	1158	if (val<0) {
dvander@27	1159	val=-val;
dvander@27	1160	if (lval3.sym->x.tags.index==0)
dvander@27	1161	exactmatch=FALSE;
dvander@27	1162	} /* if */
dvander@27	1163	} /* if */
dvander@27	1164	if (lval3.sym->dim.array.level!=level)
dvander@27	1165	return error(48); /* array dimensions must match */
dvander@27	1166	else if (ltlength<val \|\| exactmatch && ltlength>val \|\| val==0)
dvander@27	1167	return error(47); /* array sizes must match */
dvander@27	1168	else if (lval3.ident!=iARRAYCELL && !matchtag(lval3.sym->x.tags.index,idxtag,TRUE))
dvander@27	1169	error(229,(lval2.sym!=NULL) ? lval2.sym->name : lval3.sym->name); /* index tag mismatch */
dvander@27	1170	if (level>0) {
dvander@27	1171	/* check the sizes of all sublevels too */
dvander@27	1172	symbol *sym1 = lval3.sym;
dvander@27	1173	symbol *sym2 = lval2.sym;
dvander@27	1174	int i;
dvander@27	1175	assert(sym1!=NULL && sym2!=NULL);
dvander@27	1176	/* ^^^ sym2 must be valid, because only variables can be
dvander@27	1177	* multi-dimensional (there are no multi-dimensional literals),
dvander@27	1178	* sym1 must be valid because it must be an lvalue
dvander@27	1179	*/
dvander@27	1180	assert(exactmatch);
dvander@27	1181	for (i=0; i<level; i++) {
dvander@27	1182	sym1=finddepend(sym1);
dvander@27	1183	sym2=finddepend(sym2);
dvander@27	1184	assert(sym1!=NULL && sym2!=NULL);
dvander@27	1185	/* ^^^ both arrays have the same dimensions (this was checked
dvander@27	1186	* earlier) so the dependend should always be found
dvander@27	1187	*/
dvander@27	1188	if (sym1->dim.array.length!=sym2->dim.array.length)
dvander@27	1189	error(47); /* array sizes must match */
dvander@27	1190	else if (!matchtag(sym1->x.tags.index,sym2->x.tags.index,TRUE))
dvander@27	1191	error(229,sym2->name); /* index tag mismatch */
dvander@27	1192	} /* for */
dvander@27	1193	/* get the total size in cells of the multi-dimensional array */
dvander@27	1194	val=array_totalsize(lval3.sym);
dvander@27	1195	assert(val>0); /* already checked */
dvander@27	1196	} /* if */
dvander@27	1197	} else {
dvander@27	1198	/* left operand is not an array, right operand should then not be either */
dvander@27	1199	if (lval2.ident==iARRAY \|\| lval2.ident==iREFARRAY)
dvander@27	1200	error(6); /* must be assigned to an array */
dvander@27	1201	} /* if */
dvander@27	1202	if (leftarray) {
dvander@27	1203	memcopy(val*sizeof(cell));
dvander@27	1204	} else {
dvander@27	1205	check_userop(NULL,lval2.tag,lval3.tag,2,&lval3,&lval2.tag);
dvander@27	1206	store(&lval3); /* now, store the expression result */
dvander@27	1207	} /* if */
dvander@27	1208	if (!oper && !matchtag(lval3.tag,lval2.tag,TRUE))
dvander@27	1209	error(213); /* tagname mismatch (if "oper", warning already given in plunge2()) */
dvander@27	1210	if (lval3.sym)
dvander@27	1211	markusage(lval3.sym,uWRITTEN);
dvander@27	1212	sideeffect=TRUE;
dvander@27	1213	bitwise_opercount=bwcount;
dvander@27	1214	lval1->ident=iEXPRESSION;
dvander@27	1215	return FALSE; /* expression result is never an lvalue */
dvander@27	1216	}
dvander@27	1217
dvander@64	1218	/**
dvander@64	1219	* Sums up array usage in the current heap tracer and convert it into a dynamic array.
dvander@64	1220	* This is used for the ternary operator, which needs to convert its array usage into
dvander@64	1221	* something dynamically managed.
dvander@64	1222	* !Note:
dvander@64	1223	* This might break if expressions can ever return dynamic arrays.
dvander@64	1224	* Thus, we assert() if something is non-static here.
dvander@64	1225	* Right now, this poses no problem because this type of expression is impossible:
dvander@64	1226	* (a() ? return_array() : return_array()) ? return_array() : return_array()
dvander@64	1227	*/
dvander@64	1228
dvander@116	1229	void dynarray_from_heaplist(memuse_list_t *heap)
dvander@64	1230	{
dvander@116	1231	memuse_t *use=heap->head;
dvander@116	1232	memuse_t *tmp;
dvander@64	1233	long total=0;
dvander@64	1234	while (use) {
dvander@116	1235	assert(use->type==MEMUSE_STATIC);
dvander@64	1236	total+=use->size;
dvander@64	1237	tmp=use->prev;
dvander@64	1238	free(use);
dvander@64	1239	use=tmp;
dvander@64	1240	}
dvander@64	1241	free(heap);
dvander@64	1242	if (total)
dvander@65	1243	setheap_save(-total*sizeof(cell));
dvander@64	1244	}
dvander@64	1245
dvander@27	1246	static int hier13(value *lval)
dvander@27	1247	{
dvander@27	1248	int lvalue=plnge1(hier12,lval);
dvander@27	1249	if (matchtoken('?')) {
dvander@27	1250	int flab1=getlabel();
dvander@27	1251	int flab2=getlabel();
dvander@27	1252	value lval2={0};
dvander@27	1253	int array1,array2;
dvander@116	1254	memuse_list_t *heap;
dvander@64	1255
dvander@64	1256	pushheaplist();
dvander@27	1257	if (lvalue) {
dvander@27	1258	rvalue(lval);
dvander@27	1259	} else if (lval->ident==iCONSTEXPR) {
dvander@27	1260	ldconst(lval->constval,sPRI);
dvander@27	1261	error(lval->constval ? 206 : 205); /* redundant test */
dvander@27	1262	} /* if */
dvander@27	1263	jmp_eq0(flab1); /* go to second expression if primary register==0 */
dvander@27	1264	PUSHSTK_I(sc_allowtags);
dvander@27	1265	sc_allowtags=FALSE; /* do not allow tagnames here (colon is a special token) */
dvander@27	1266	if (hier13(lval))
dvander@27	1267	rvalue(lval);
dvander@27	1268	if (lval->ident==iCONSTEXPR) /* load constant here */
dvander@27	1269	ldconst(lval->constval,sPRI);
dvander@27	1270	sc_allowtags=(short)POPSTK_I(); /* restore */
dvander@64	1271	heap=popsaveheaplist();
dvander@64	1272	dynarray_from_heaplist(heap);
dvander@64	1273	pushheaplist();
dvander@65	1274	jumplabel(flab2);
dvander@65	1275	setlabel(flab1);
dvander@27	1276	needtoken(':');
dvander@27	1277	if (hier13(&lval2))
dvander@27	1278	rvalue(&lval2);
dvander@27	1279	if (lval2.ident==iCONSTEXPR) /* load constant here */
dvander@27	1280	ldconst(lval2.constval,sPRI);
dvander@27	1281	array1= (lval->ident==iARRAY \|\| lval->ident==iREFARRAY);
dvander@27	1282	array2= (lval2.ident==iARRAY \|\| lval2.ident==iREFARRAY);
dvander@27	1283	if (array1 && !array2) {
dvander@27	1284	char *ptr=(lval->sym->name!=NULL) ? lval->sym->name : "-unknown-";
dvander@27	1285	error(33,ptr); /* array must be indexed */
dvander@27	1286	} else if (!array1 && array2) {
dvander@27	1287	char *ptr=(lval2.sym->name!=NULL) ? lval2.sym->name : "-unknown-";
dvander@27	1288	error(33,ptr); /* array must be indexed */
dvander@27	1289	} /* if */
dvander@27	1290	/* ??? if both are arrays, should check dimensions */
dvander@27	1291	if (!matchtag(lval->tag,lval2.tag,FALSE))
dvander@27	1292	error(213); /* tagname mismatch ('true' and 'false' expressions) */
dvander@64	1293	heap=popsaveheaplist();
dvander@64	1294	dynarray_from_heaplist(heap);
dvander@65	1295	setlabel(flab2);
dvander@66	1296	if (array1 && array2) {
dvander@116	1297	markheap(MEMUSE_DYNAMIC, 0);
dvander@66	1298	}
dvander@27	1299	if (lval->ident==iARRAY)
dvander@27	1300	lval->ident=iREFARRAY; /* iARRAY becomes iREFARRAY */
dvander@27	1301	else if (lval->ident!=iREFARRAY)
dvander@27	1302	lval->ident=iEXPRESSION; /* iREFARRAY stays iREFARRAY, rest becomes iEXPRESSION */
dvander@27	1303	return FALSE; /* conditional expression is no lvalue */
dvander@27	1304	} else {
dvander@27	1305	return lvalue;
dvander@27	1306	} /* if */
dvander@27	1307	}
dvander@27	1308
dvander@27	1309	/* the order of the operators in these lists is important and must be
dvander@27	1310	* the same as the order of the operators in the array "op1"
dvander@27	1311	*/
dvander@27	1312	static int list3[] = {'*','/','%',0};
dvander@27	1313	static int list4[] = {'+','-',0};
dvander@27	1314	static int list5[] = {tSHL,tSHR,tSHRU,0};
dvander@27	1315	static int list6[] = {'&',0};
dvander@27	1316	static int list7[] = {'^',0};
dvander@27	1317	static int list8[] = {'\|',0};
dvander@27	1318	static int list9[] = {tlLE,tlGE,'<','>',0};
dvander@27	1319	static int list10[] = {tlEQ,tlNE,0};
dvander@27	1320	static int list11[] = {tlAND,0};
dvander@27	1321	static int list12[] = {tlOR,0};
dvander@27	1322
dvander@27	1323	static int hier12(value *lval)
dvander@27	1324	{
dvander@27	1325	return skim(list12,jmp_ne0,1,0,hier11,lval);
dvander@27	1326	}
dvander@27	1327
dvander@27	1328	static int hier11(value *lval)
dvander@27	1329	{
dvander@27	1330	return skim(list11,jmp_eq0,0,1,hier10,lval);
dvander@27	1331	}
dvander@27	1332
dvander@27	1333	static int hier10(value *lval)
dvander@27	1334	{ /* ==, != */
dvander@27	1335	return plnge(list10,15,hier9,lval,"bool",TRUE);
dvander@27	1336	} /* ^ this variable is the starting index in the op1[]
dvander@27	1337	* array of the operators of this hierarchy level */
dvander@27	1338
dvander@27	1339	static int hier9(value *lval)
dvander@27	1340	{ /* <=, >=, <, > */
dvander@27	1341	return plnge_rel(list9,11,hier8,lval);
dvander@27	1342	}
dvander@27	1343
dvander@27	1344	static int hier8(value *lval)
dvander@27	1345	{ /* \| */
dvander@27	1346	return plnge(list8,10,hier7,lval,NULL,FALSE);
dvander@27	1347	}
dvander@27	1348
dvander@27	1349	static int hier7(value *lval)
dvander@27	1350	{ /* ^ */
dvander@27	1351	return plnge(list7,9,hier6,lval,NULL,FALSE);
dvander@27	1352	}
dvander@27	1353
dvander@27	1354	static int hier6(value *lval)
dvander@27	1355	{ /* & */
dvander@27	1356	return plnge(list6,8,hier5,lval,NULL,FALSE);
dvander@27	1357	}
dvander@27	1358
dvander@27	1359	static int hier5(value *lval)
dvander@27	1360	{ /* <<, >>, >>> */
dvander@27	1361	return plnge(list5,5,hier4,lval,NULL,FALSE);
dvander@27	1362	}
dvander@27	1363
dvander@27	1364	static int hier4(value *lval)
dvander@27	1365	{ /* +, - */
dvander@27	1366	return plnge(list4,3,hier3,lval,NULL,FALSE);
dvander@27	1367	}
dvander@27	1368
dvander@27	1369	static int hier3(value *lval)
dvander@27	1370	{ /* , /, % /
dvander@27	1371	return plnge(list3,0,hier2,lval,NULL,FALSE);
dvander@27	1372	}
dvander@27	1373
dvander@27	1374	static int hier2(value *lval)
dvander@27	1375	{
dvander@27	1376	int lvalue,tok;
dvander@27	1377	int tag,paranthese;
dvander@27	1378	cell val;
dvander@27	1379	char *st;
dvander@27	1380	symbol *sym;
dvander@27	1381	int saveresult;
dvander@27	1382
dvander@27	1383	tok=lex(&val,&st);
dvander@27	1384	switch (tok) {
dvander@27	1385	case tINC: /* ++lval */
dvander@27	1386	if (!hier2(lval))
dvander@27	1387	return error(22); /* must be lvalue */
dvander@27	1388	assert(lval->sym!=NULL);
dvander@27	1389	if ((lval->sym->usage & uCONST)!=0)
dvander@27	1390	return error(22); /* assignment to const argument */
dvander@27	1391	if (!check_userop(user_inc,lval->tag,0,1,lval,&lval->tag))
dvander@27	1392	inc(lval); /* increase variable first */
dvander@27	1393	rvalue(lval); /* and read the result into PRI */
dvander@27	1394	sideeffect=TRUE;
dvander@27	1395	return FALSE; /* result is no longer lvalue */
dvander@27	1396	case tDEC: /* --lval */
dvander@27	1397	if (!hier2(lval))
dvander@27	1398	return error(22); /* must be lvalue */
dvander@27	1399	assert(lval->sym!=NULL);
dvander@27	1400	if ((lval->sym->usage & uCONST)!=0)
dvander@27	1401	return error(22); /* assignment to const argument */
dvander@27	1402	if (!check_userop(user_dec,lval->tag,0,1,lval,&lval->tag))
dvander@27	1403	dec(lval); /* decrease variable first */
dvander@27	1404	rvalue(lval); /* and read the result into PRI */
dvander@27	1405	sideeffect=TRUE;
dvander@27	1406	return FALSE; /* result is no longer lvalue */
dvander@27	1407	case '~': /* ~ (one's complement) */
dvander@27	1408	if (hier2(lval))
dvander@27	1409	rvalue(lval);
dvander@27	1410	invert(); /* bitwise NOT */
dvander@27	1411	lval->constval=~lval->constval;
dvander@27	1412	return FALSE;
dvander@27	1413	case '!': /* ! (logical negate) */
dvander@27	1414	if (hier2(lval))
dvander@27	1415	rvalue(lval);
dvander@27	1416	if (check_userop(lneg,lval->tag,0,1,NULL,&lval->tag)) {
dvander@27	1417	lval->ident=iEXPRESSION;
dvander@27	1418	lval->constval=0;
dvander@27	1419	} else {
dvander@27	1420	lneg(); /* 0 -> 1, !0 -> 0 */
dvander@27	1421	lval->constval=!lval->constval;
dvander@27	1422	lval->tag=pc_addtag("bool");
dvander@27	1423	} /* if */
dvander@27	1424	return FALSE;
dvander@27	1425	case '-': /* unary - (two's complement) */
dvander@27	1426	if (hier2(lval))
dvander@27	1427	rvalue(lval);
dvander@27	1428	/* make a special check for a constant expression with the tag of a
dvander@27	1429	* rational number, so that we can simple swap the sign of that constant.
dvander@27	1430	*/
dvander@27	1431	if (lval->ident==iCONSTEXPR && lval->tag==sc_rationaltag && sc_rationaltag!=0) {
dvander@27	1432	if (rational_digits==0) {
dvander@27	1433	#if PAWN_CELL_SIZE==32
dvander@27	1434	float f = (float )&lval->constval;
dvander@27	1435	#elif PAWN_CELL_SIZE==64
dvander@27	1436	double f = (double )&lval->constval;
dvander@27	1437	#else
dvander@27	1438	#error Unsupported cell size
dvander@27	1439	#endif
dvander@27	1440	f= - f; /* this modifies lval->constval */
dvander@27	1441	} else {
dvander@27	1442	/* the negation of a fixed point number is just an integer negation */
dvander@27	1443	lval->constval=-lval->constval;
dvander@27	1444	} /* if */
dvander@27	1445	} else if (check_userop(neg,lval->tag,0,1,NULL,&lval->tag)) {
dvander@27	1446	lval->ident=iEXPRESSION;
dvander@27	1447	lval->constval=0;
dvander@27	1448	} else {
dvander@27	1449	neg(); /* arithmic negation */
dvander@27	1450	lval->constval=-lval->constval;
dvander@27	1451	} /* if */
dvander@27	1452	return FALSE;
dvander@27	1453	case tLABEL: /* tagname override */
dvander@27	1454	tag=pc_addtag(st);
dvander@27	1455	lval->cmptag=tag;
dvander@27	1456	lvalue=hier2(lval);
dvander@27	1457	lval->tag=tag;
dvander@27	1458	return lvalue;
dvander@27	1459	case tDEFINED:
dvander@27	1460	paranthese=0;
dvander@27	1461	while (matchtoken('('))
dvander@27	1462	paranthese++;
dvander@27	1463	tok=lex(&val,&st);
dvander@27	1464	if (tok!=tSYMBOL)
dvander@27	1465	return error(20,st); /* illegal symbol name */
dvander@27	1466	sym=findloc(st);
dvander@27	1467	if (sym==NULL)
dvander@27	1468	sym=findglb(st,sSTATEVAR);
dvander@27	1469	if (sym!=NULL && sym->ident!=iFUNCTN && sym->ident!=iREFFUNC && (sym->usage & uDEFINE)==0)
dvander@27	1470	sym=NULL; /* symbol is not a function, it is in the table, but not "defined" */
dvander@27	1471	val= (sym!=NULL);
dvander@27	1472	if (!val && find_subst(st,strlen(st))!=NULL)
dvander@27	1473	val=1;
dvander@27	1474	clear_value(lval);
dvander@27	1475	lval->ident=iCONSTEXPR;
dvander@27	1476	lval->constval= val;
dvander@27	1477	lval->tag=pc_addtag("bool");
dvander@27	1478	ldconst(lval->constval,sPRI);
dvander@27	1479	while (paranthese--)
dvander@27	1480	needtoken(')');
dvander@27	1481	return FALSE;
dvander@27	1482	case tSIZEOF:
dvander@27	1483	paranthese=0;
dvander@27	1484	while (matchtoken('('))
dvander@27	1485	paranthese++;
dvander@27	1486	tok=lex(&val,&st);
dvander@27	1487	if (tok!=tSYMBOL)
dvander@27	1488	return error(20,st); /* illegal symbol name */
dvander@27	1489	sym=findloc(st);
dvander@27	1490	if (sym==NULL)
dvander@27	1491	sym=findglb(st,sSTATEVAR);
dvander@27	1492	if (sym==NULL)
dvander@27	1493	return error(17,st); /* undefined symbol */
dvander@27	1494	if (sym->ident==iCONSTEXPR)
dvander@27	1495	error(39); /* constant symbol has no size */
dvander@27	1496	else if (sym->ident==iFUNCTN \|\| sym->ident==iREFFUNC)
dvander@27	1497	error(72); /* "function" symbol has no size */
dvander@27	1498	else if ((sym->usage & uDEFINE)==0)
dvander@27	1499	return error(17,st); /* undefined symbol (symbol is in the table, but it is "used" only) */
dvander@27	1500	clear_value(lval);
dvander@27	1501	lval->ident=iCONSTEXPR;
dvander@27	1502	lval->constval=1; /* preset */
dvander@27	1503	if (sym->ident==iARRAY \|\| sym->ident==iREFARRAY) {
dvander@27	1504	int level;
dvander@27	1505	symbol *idxsym=NULL;
dvander@27	1506	symbol *subsym=sym;
dvander@27	1507	for (level=0; matchtoken('['); level++) {
dvander@27	1508	idxsym=NULL;
dvander@27	1509	if (subsym!=NULL && level==subsym->dim.array.level && matchtoken(tSYMBOL)) {
dvander@27	1510	char *idxname;
dvander@27	1511	int cmptag=subsym->x.tags.index;
dvander@27	1512	tokeninfo(&val,&idxname);
dvander@27	1513	if ((idxsym=findconst(idxname,&cmptag))==NULL)
dvander@27	1514	error(80,idxname); /* unknown symbol, or non-constant */
dvander@27	1515	else if (cmptag>1)
dvander@27	1516	error(91,idxname); /* ambiguous constant */
dvander@27	1517	} /* if */
dvander@27	1518	needtoken(']');
dvander@27	1519	if (subsym!=NULL)
dvander@27	1520	subsym=finddepend(subsym);
dvander@27	1521	} /* for */
dvander@27	1522	if (level>sym->dim.array.level+1)
dvander@27	1523	error(28,sym->name); /* invalid subscript */
dvander@27	1524	else if (level==sym->dim.array.level+1)
dvander@27	1525	lval->constval= (idxsym!=NULL && idxsym->dim.array.length>0) ? idxsym->dim.array.length : 1;
dvander@27	1526	else
dvander@27	1527	lval->constval=array_levelsize(sym,level);
dvander@27	1528	if (lval->constval==0 && strchr((char *)lptr,PREPROC_TERM)==NULL)
dvander@27	1529	error(224,st); /* indeterminate array size in "sizeof" expression */
dvander@27	1530	} /* if */
dvander@27	1531	ldconst(lval->constval,sPRI);
dvander@27	1532	while (paranthese--)
dvander@27	1533	needtoken(')');
dvander@27	1534	return FALSE;
dvander@27	1535	case tTAGOF:
dvander@27	1536	paranthese=0;
dvander@27	1537	while (matchtoken('('))
dvander@27	1538	paranthese++;
dvander@27	1539	tok=lex(&val,&st);
dvander@27	1540	if (tok!=tSYMBOL && tok!=tLABEL)
dvander@27	1541	return error(20,st); /* illegal symbol name */
dvander@27	1542	if (tok==tLABEL) {
dvander@27	1543	constvalue *tagsym=find_constval(&tagname_tab,st,0);
dvander@27	1544	tag=(int)((tagsym!=NULL) ? tagsym->value : 0);
dvander@27	1545	} else {
dvander@27	1546	sym=findloc(st);
dvander@27	1547	if (sym==NULL)
dvander@27	1548	sym=findglb(st,sSTATEVAR);
dvander@27	1549	if (sym==NULL)
dvander@27	1550	return error(17,st); /* undefined symbol */
dvander@27	1551	if ((sym->usage & uDEFINE)==0)
dvander@27	1552	return error(17,st); /* undefined symbol (symbol is in the table, but it is "used" only) */
dvander@27	1553	tag=sym->tag;
dvander@27	1554	} /* if */
dvander@27	1555	if (sym->ident==iARRAY \|\| sym->ident==iREFARRAY) {
dvander@27	1556	int level;
dvander@27	1557	symbol *idxsym=NULL;
dvander@27	1558	symbol *subsym=sym;
dvander@27	1559	for (level=0; matchtoken('['); level++) {
dvander@27	1560	idxsym=NULL;
dvander@27	1561	if (subsym!=NULL && level==subsym->dim.array.level && matchtoken(tSYMBOL)) {
dvander@27	1562	char *idxname;
dvander@27	1563	int cmptag=subsym->x.tags.index;
dvander@27	1564	tokeninfo(&val,&idxname);
dvander@27	1565	if ((idxsym=findconst(idxname,&cmptag))==NULL)
dvander@27	1566	error(80,idxname); /* unknown symbol, or non-constant */
dvander@27	1567	else if (cmptag>1)
dvander@27	1568	error(91,idxname); /* ambiguous constant */
dvander@27	1569	} /* if */
dvander@27	1570	needtoken(']');
dvander@27	1571	if (subsym!=NULL)
dvander@27	1572	subsym=finddepend(subsym);
dvander@27	1573	} /* for */
dvander@27	1574	if (level>sym->dim.array.level+1)
dvander@27	1575	error(28,sym->name); /* invalid subscript */
dvander@27	1576	else if (level==sym->dim.array.level+1 && idxsym!=NULL)
dvander@27	1577	tag= idxsym->x.tags.index;
dvander@27	1578	} /* if */
dvander@27	1579	exporttag(tag);
dvander@27	1580	clear_value(lval);
dvander@27	1581	lval->ident=iCONSTEXPR;
dvander@27	1582	lval->constval=tag \| PUBLICTAG;
dvander@27	1583	ldconst(lval->constval,sPRI);
dvander@27	1584	while (paranthese--)
dvander@27	1585	needtoken(')');
dvander@27	1586	return FALSE;
dvander@27	1587	case tSTATE: {
dvander@27	1588	constvalue *automaton;
dvander@27	1589	constvalue *state;
dvander@27	1590	if (sc_getstateid(&automaton,&state)) {
dvander@27	1591	assert(automaton!=NULL);
dvander@27	1592	assert(automaton->index==0 && automaton->name[0]=='\0' \|\| automaton->index>0);
dvander@27	1593	loadreg(automaton->value,sALT);
dvander@27	1594	assert(state!=NULL);
dvander@27	1595	ldconst(state->value,sPRI);
dvander@27	1596	ob_eq();
dvander@27	1597	clear_value(lval);
dvander@27	1598	lval->ident=iEXPRESSION;
dvander@27	1599	lval->tag=pc_addtag("bool");
dvander@27	1600	} /* if */
dvander@27	1601	return FALSE;
dvander@27	1602	} /* case */
dvander@27	1603	default:
dvander@27	1604	lexpush();
dvander@27	1605	lvalue=hier1(lval);
dvander@27	1606	/* check for postfix operators */
dvander@27	1607	if (matchtoken(';')) {
dvander@27	1608	/* Found a ';', do not look further for postfix operators */
dvander@27	1609	lexpush(); /* push ';' back after successful match */
dvander@27	1610	return lvalue;
dvander@27	1611	} else if (matchtoken(tTERM)) {
dvander@27	1612	/* Found a newline that ends a statement (this is the case when
dvander@27	1613	* semicolons are optional). Note that an explicit semicolon was
dvander@27	1614	* handled above. This case is similar, except that the token must
dvander@27	1615	* not be pushed back.
dvander@27	1616	*/
dvander@27	1617	return lvalue;
dvander@27	1618	} else {
dvander@27	1619	tok=lex(&val,&st);
dvander@27	1620	switch (tok) {
dvander@27	1621	case tINC: /* lval++ */
dvander@27	1622	if (!lvalue)
dvander@27	1623	return error(22); /* must be lvalue */
dvander@27	1624	assert(lval->sym!=NULL);
dvander@27	1625	if ((lval->sym->usage & uCONST)!=0)
dvander@27	1626	return error(22); /* assignment to const argument */
dvander@27	1627	/* on incrementing array cells, the address in PRI must be saved for
dvander@27	1628	* incremening the value, whereas the current value must be in PRI
dvander@27	1629	* on exit.
dvander@27	1630	*/
dvander@27	1631	saveresult= (lval->ident==iARRAYCELL \|\| lval->ident==iARRAYCHAR);
dvander@27	1632	if (saveresult)
dvander@27	1633	pushreg(sPRI); /* save address in PRI */
dvander@27	1634	rvalue(lval); /* read current value into PRI */
dvander@27	1635	if (saveresult)
dvander@27	1636	swap1(); /* save PRI on the stack, restore address in PRI */
dvander@27	1637	if (!check_userop(user_inc,lval->tag,0,1,lval,&lval->tag))
dvander@27	1638	inc(lval); /* increase variable afterwards */
dvander@27	1639	if (saveresult)
dvander@27	1640	popreg(sPRI); /* restore PRI (result of rvalue()) */
dvander@27	1641	sideeffect=TRUE;
dvander@27	1642	return FALSE; /* result is no longer lvalue */
dvander@27	1643	case tDEC: /* lval-- */
dvander@27	1644	if (!lvalue)
dvander@27	1645	return error(22); /* must be lvalue */
dvander@27	1646	assert(lval->sym!=NULL);
dvander@27	1647	if ((lval->sym->usage & uCONST)!=0)
dvander@27	1648	return error(22); /* assignment to const argument */
dvander@27	1649	saveresult= (lval->ident==iARRAYCELL \|\| lval->ident==iARRAYCHAR);
dvander@27	1650	if (saveresult)
dvander@27	1651	pushreg(sPRI); /* save address in PRI */
dvander@27	1652	rvalue(lval); /* read current value into PRI */
dvander@27	1653	if (saveresult)
dvander@27	1654	swap1(); /* save PRI on the stack, restore address in PRI */
dvander@27	1655	if (!check_userop(user_dec,lval->tag,0,1,lval,&lval->tag))
dvander@27	1656	dec(lval); /* decrease variable afterwards */
dvander@27	1657	if (saveresult)
dvander@27	1658	popreg(sPRI); /* restore PRI (result of rvalue()) */
dvander@27	1659	sideeffect=TRUE;
dvander@27	1660	return FALSE;
dvander@27	1661	case tCHAR: /* char (compute required # of cells */
dvander@27	1662	if (lval->ident==iCONSTEXPR) {
dvander@27	1663	lval->constval = sCHARBITS/8; / from char to bytes */
dvander@27	1664	lval->constval = (lval->constval + sizeof(cell)-1) / sizeof(cell);
dvander@27	1665	} else {
dvander@27	1666	if (lvalue)
dvander@27	1667	rvalue(lval); /* fetch value if not already in PRI */
dvander@27	1668	char2addr(); /* from characters to bytes */
dvander@27	1669	addconst(sizeof(cell)-1); /* make sure the value is rounded up */
dvander@27	1670	addr2cell(); /* truncate to number of cells */
dvander@27	1671	} /* if */
dvander@27	1672	return FALSE;
dvander@27	1673	default:
dvander@27	1674	lexpush();
dvander@27	1675	return lvalue;
dvander@27	1676	} /* switch */
dvander@27	1677	} /* if */
dvander@27	1678	} /* switch */
dvander@27	1679	}
dvander@27	1680
dvander@27	1681	/* hier1
dvander@27	1682	*
dvander@27	1683	* The highest hierarchy level: it looks for pointer and array indices
dvander@27	1684	* and function calls.
dvander@27	1685	* Generates code to fetch a pointer value if it is indexed and code to
dvander@27	1686	* add to the pointer value or the array address (the address is already
dvander@27	1687	* read at primary()). It also generates code to fetch a function address
dvander@27	1688	* if that hasn't already been done at primary() (check lval[4]) and calls
dvander@27	1689	* callfunction() to call the function.
dvander@27	1690	*/
dvander@27	1691	static int hier1(value *lval1)
dvander@27	1692	{
dvander@27	1693	int lvalue,index,tok,symtok;
dvander@27	1694	cell val,cidx;
dvander@27	1695	value lval2={0};
dvander@27	1696	char *st;
dvander@27	1697	char close;
dvander@27	1698	symbol *sym;
dvander@27	1699	symbol dummysymbol,cursym; / for changing the index tags in case of enumerated pseudo-arrays */
dvander@27	1700
dvander@27	1701	lvalue=primary(lval1);
dvander@27	1702	symtok=tokeninfo(&val,&st); /* get token read by primary() */
dvander@27	1703	cursym=lval1->sym;
dvander@27	1704	restart:
dvander@27	1705	sym=cursym;
dvander@27	1706	if (matchtoken('[') \|\| matchtoken('{') \|\| matchtoken('(')) {
dvander@27	1707	tok=tokeninfo(&val,&st); /* get token read by matchtoken() */
dvander@27	1708	if (sym==NULL && symtok!=tSYMBOL) {
dvander@27	1709	/* we do not have a valid symbol and we appear not to have read a valid
dvander@27	1710	* symbol name (so it is unlikely that we would have read a name of an
dvander@27	1711	* undefined symbol) */
dvander@27	1712	error(29); /* expression error, assumed 0 */
dvander@27	1713	lexpush(); /* analyse '(', '{' or '[' again later */
dvander@27	1714	return FALSE;
dvander@27	1715	} /* if */
dvander@27	1716	if (tok=='[' \|\| tok=='{') { /* subscript */
dvander@27	1717	close = (char)((tok=='[') ? ']' : '}');
dvander@27	1718	if (sym==NULL) { /* sym==NULL if lval is a constant or a literal */
dvander@27	1719	error(28,"<no variable>"); /* cannot subscript */
dvander@27	1720	needtoken(close);
dvander@27	1721	return FALSE;
dvander@27	1722	} else if (sym->ident!=iARRAY && sym->ident!=iREFARRAY){
dvander@27	1723	error(28,sym->name); /* cannot subscript, variable is not an array */
dvander@27	1724	needtoken(close);
dvander@27	1725	return FALSE;
dvander@27	1726	} else if (sym->dim.array.level>0 && close!=']') {
dvander@27	1727	error(51); /* invalid subscript, must use [ ] */
dvander@27	1728	needtoken(close);
dvander@27	1729	return FALSE;
dvander@27	1730	} /* if */
dvander@27	1731	/* set the tag to match (enumeration fields as indices) */
dvander@27	1732	lval2.cmptag=sym->x.tags.index;
dvander@27	1733	stgget(&index,&cidx); /* mark position in code generator */
dvander@27	1734	pushreg(sPRI); /* save base address of the array */
dvander@27	1735	if (hier14(&lval2)) /* create expression for the array index */
dvander@27	1736	rvalue(&lval2);
dvander@27	1737	if (lval2.ident==iARRAY \|\| lval2.ident==iREFARRAY)
dvander@27	1738	error(33,lval2.sym->name); /* array must be indexed */
dvander@27	1739	needtoken(close);
dvander@27	1740	if (!matchtag(sym->x.tags.index,lval2.tag,TRUE))
dvander@27	1741	error(213);
dvander@27	1742	if (lval2.ident==iCONSTEXPR) { /* constant expression */
dvander@27	1743	stgdel(index,cidx); /* scratch generated code */
dvander@27	1744	if (lval1->arrayidx!=NULL) { /* keep constant index, for checking */
dvander@27	1745	assert(sym->dim.array.level>=0 && sym->dim.array.level<sDIMEN_MAX);
dvander@27	1746	lval1->arrayidx[sym->dim.array.level]=lval2.constval;
dvander@27	1747	} /* if */
dvander@27	1748	if (close==']') {
dvander@27	1749	/* normal array index */
dvander@27	1750	if (lval2.constval<0 \|\| sym->dim.array.length!=0 && sym->dim.array.length<=lval2.constval)
dvander@27	1751	error(32,sym->name); /* array index out of bounds */
dvander@27	1752	if (lval2.constval!=0) {
dvander@27	1753	/* don't add offsets for zero subscripts */
dvander@27	1754	#if PAWN_CELL_SIZE==16
dvander@27	1755	ldconst(lval2.constval<<1,sALT);
dvander@27	1756	#elif PAWN_CELL_SIZE==32
dvander@27	1757	ldconst(lval2.constval<<2,sALT);
dvander@27	1758	#elif PAWN_CELL_SIZE==64
dvander@27	1759	ldconst(lval2.constval<<3,sALT);
dvander@27	1760	#else
dvander@27	1761	#error Unsupported cell size
dvander@27	1762	#endif
dvander@27	1763	ob_add();
dvander@27	1764	} /* if */
dvander@27	1765	} else {
dvander@27	1766	/* character index */
dvander@27	1767	if (lval2.constval<0 \|\| sym->dim.array.length!=0
dvander@27	1768	&& sym->dim.array.length((8sizeof(cell))/sCHARBITS)<=(ucell)lval2.constval)
dvander@27	1769	error(32,sym->name); /* array index out of bounds */
dvander@27	1770	if (lval2.constval!=0) {
dvander@27	1771	/* don't add offsets for zero subscripts */
dvander@27	1772	#if sCHARBITS==16
dvander@27	1773	ldconst(lval2.constval<<1,sALT);/* 16-bit character */
dvander@27	1774	#else
dvander@27	1775	ldconst(lval2.constval,sALT); /* 8-bit character */
dvander@27	1776	#endif
dvander@27	1777	ob_add();
dvander@27	1778	} /* if */
dvander@27	1779	charalign(); /* align character index into array */
dvander@27	1780	} /* if */
dvander@27	1781	/* if the array index is a field from an enumeration, get the tag name
dvander@27	1782	* from the field and save the size of the field too.
dvander@27	1783	*/
dvander@27	1784	assert(lval2.sym==NULL \|\| lval2.sym->dim.array.level==0);
dvander@27	1785	if (lval2.sym!=NULL && lval2.sym->dim.array.length>0 && sym->dim.array.level==0) {
dvander@27	1786	lval1->tag=lval2.sym->x.tags.index;
dvander@27	1787	lval1->constval=lval2.sym->dim.array.length;
dvander@27	1788	} /* if */
dvander@27	1789	} else {
dvander@27	1790	/* array index is not constant */
dvander@27	1791	lval1->arrayidx=NULL; /* reset, so won't be checked */
dvander@27	1792	if (close==']') {
dvander@27	1793	if (sym->dim.array.length!=0)
dvander@27	1794	ffbounds(sym->dim.array.length-1); /* run time check for array bounds */
dvander@27	1795	cell2addr(); /* normal array index */
dvander@27	1796	} else {
dvander@27	1797	if (sym->dim.array.length!=0)
dvander@27	1798	ffbounds(sym->dim.array.length*(32/sCHARBITS)-1);
dvander@27	1799	char2addr(); /* character array index */
dvander@27	1800	} /* if */
dvander@27	1801	popreg(sALT);
dvander@27	1802	ob_add(); /* base address was popped into secondary register */
dvander@27	1803	if (close!=']')
dvander@27	1804	charalign(); /* align character index into array */
dvander@27	1805	} /* if */
dvander@27	1806	/* the indexed item may be another array (multi-dimensional arrays) */
dvander@27	1807	assert(cursym==sym && sym!=NULL); /* should still be set */
dvander@27	1808	if (sym->dim.array.level>0) {
dvander@27	1809	assert(close==']'); /* checked earlier */
dvander@27	1810	assert(cursym==lval1->sym);
dvander@27	1811	/* read the offset to the subarray and add it to the current address */
dvander@27	1812	lval1->ident=iARRAYCELL;
dvander@27	1813	pushreg(sPRI); /* the optimizer makes this to a MOVE.alt */
dvander@27	1814	rvalue(lval1);
dvander@27	1815	popreg(sALT);
dvander@27	1816	ob_add();
dvander@27	1817	/* adjust the "value" structure and find the referenced array */
dvander@27	1818	lval1->ident=iREFARRAY;
dvander@27	1819	lval1->sym=finddepend(sym);
dvander@27	1820	assert(lval1->sym!=NULL);
dvander@27	1821	assert(lval1->sym->dim.array.level==sym->dim.array.level-1);
dvander@27	1822	cursym=lval1->sym;
dvander@27	1823	/* try to parse subsequent array indices */
dvander@27	1824	lvalue=FALSE; /* for now, a iREFARRAY is no lvalue */
dvander@27	1825	goto restart;
dvander@27	1826	} /* if */
dvander@27	1827	assert(sym->dim.array.level==0);
dvander@27	1828	/* set type to fetch... INDIRECTLY */
dvander@27	1829	lval1->ident= (char)((close==']') ? iARRAYCELL : iARRAYCHAR);
dvander@27	1830	/* if the array index is a field from an enumeration, get the tag name
dvander@27	1831	* from the field and save the size of the field too. Otherwise, the
dvander@27	1832	* tag is the one from the array symbol.
dvander@27	1833	*/
dvander@27	1834	if (lval2.ident==iCONSTEXPR && lval2.sym!=NULL
dvander@27	1835	&& lval2.sym->dim.array.length>0 && sym->dim.array.level==0)
dvander@27	1836	{
dvander@27	1837	lval1->tag=lval2.sym->x.tags.index;
dvander@27	1838	lval1->constval=lval2.sym->dim.array.length;
dvander@27	1839	if (lval2.tag==sym->x.tags.index && lval1->constval>1 && matchtoken('[')) {
dvander@27	1840	/* an array indexed with an enumeration field may be considered a sub-array */
dvander@27	1841	lexpush();
dvander@27	1842	lvalue=FALSE; /* for now, a iREFARRAY is no lvalue */
dvander@27	1843	lval1->ident=iREFARRAY;
dvander@27	1844	/* initialize a dummy symbol, which is a copy of the current symbol,
dvander@27	1845	* but with an adjusted index tag
dvander@27	1846	*/
dvander@27	1847	assert(sym!=NULL);
dvander@27	1848	dummysymbol=*sym;
dvander@27	1849	/* get the tag of the root of the enumeration */
dvander@27	1850	assert(lval2.sym!=NULL);
dvander@27	1851	dummysymbol.x.tags.index=lval2.sym->x.tags.field;
dvander@27	1852	dummysymbol.dim.array.length=lval2.sym->dim.array.length;
dvander@27	1853	cursym=&dummysymbol;
dvander@27	1854	/* recurse */
dvander@27	1855	goto restart;
dvander@27	1856	} /* if */
dvander@27	1857	} else {
dvander@27	1858	assert(sym!=NULL);
dvander@27	1859	if (cursym!=&dummysymbol)
dvander@27	1860	lval1->tag=sym->tag;
dvander@27	1861	lval1->constval=0;
dvander@27	1862	} /* if */
dvander@27	1863	/* a cell in an array is an lvalue, a character in an array is not
dvander@27	1864	* always a valid lvalue */
dvander@27	1865	return TRUE;
dvander@27	1866	} else { /* tok=='(' -> function(...) */
dvander@27	1867	assert(tok=='(');
dvander@27	1868	if (sym==NULL
dvander@27	1869	\|\| (sym->ident!=iFUNCTN && sym->ident!=iREFFUNC))
dvander@27	1870	{
dvander@27	1871	if (sym==NULL && sc_status==statFIRST) {
dvander@27	1872	/* could be a "use before declaration"; in that case, create a stub
dvander@27	1873	* function so that the usage can be marked.
dvander@27	1874	*/
dvander@27	1875	sym=fetchfunc(lastsymbol,0);
dvander@27	1876	if (sym==NULL)
dvander@27	1877	error(103); /* insufficient memory */
dvander@27	1878	markusage(sym,uREAD);
dvander@27	1879	} else {
dvander@27	1880	return error(12); /* invalid function call */
dvander@27	1881	} /* if */
dvander@27	1882	} else if ((sym->usage & uMISSING)!=0) {
dvander@27	1883	char symname[2sNAMEMAX+16]; / allow space for user defined operators */
dvander@27	1884	funcdisplayname(symname,sym->name);
dvander@27	1885	error(4,symname); /* function not defined */
dvander@27	1886	} /* if */
dvander@27	1887	callfunction(sym,lval1,TRUE);
dvander@27	1888	return FALSE; /* result of function call is no lvalue */
dvander@27	1889	} /* if */
dvander@27	1890	} /* if */
dvander@27	1891	if (sym!=NULL && lval1->ident==iFUNCTN) {
dvander@27	1892	assert(sym->ident==iFUNCTN);
dvander@27	1893	if (sc_allowproccall) {
dvander@27	1894	callfunction(sym,lval1,FALSE);
dvander@27	1895	} else {
dvander@132	1896	symbol *oldsym=sym;
dvander@27	1897	int n=-1,iter=0;
dvander@132	1898	int usage = ((sym->usage & uPUBLIC) == uPUBLIC) ? uPUBLIC : 0;
dvander@132	1899	cell code_addr=0;
dvander@27	1900	for (sym=glbtab.next; sym!=NULL; sym=sym->next) {
dvander@132	1901	if (sym->ident==iFUNCTN && sym->vclass == sGLOBAL && (!usage \|\| (sym->usage & usage)))
dvander@27	1902	{
dvander@27	1903	if (strcmp(sym->name, lval1->sym->name)==0) {
dvander@27	1904	n = iter;
dvander@132	1905	code_addr = sym->codeaddr;
dvander@27	1906	break;
dvander@27	1907	}
dvander@27	1908	iter++;
dvander@27	1909	}
dvander@27	1910	}
dvander@27	1911	if (n!=-1) {
dvander@132	1912	char faketag[sNAMEMAX+1];
dvander@27	1913	lval1->sym=NULL;
dvander@27	1914	lval1->ident=iCONSTEXPR;
dvander@132	1915	/* Generate a quick pseudo-tag! */
dvander@132	1916	if (usage == uPUBLIC) {
dvander@132	1917	lval1->constval=(n>>1)\|(1<<1);
dvander@132	1918	snprintf(faketag, sizeof(faketag)-1, "$Func@%d", n);
dvander@132	1919	} else {
dvander@132	1920	lval1->constval=(code_addr>>1)\|(1<<0);
dvander@132	1921	snprintf(faketag, sizeof(faketag)-1, "$Func!%d", code_addr);
dvander@132	1922	}
dvander@132	1923	lval1->tag=pc_addfunctag(faketag);
dvander@132	1924	oldsym->usage \|= uREAD;
dvander@27	1925	} else {
dvander@27	1926	error(76); /* invalid function call, or syntax error */
dvander@27	1927	} /* if */
dvander@27	1928	return FALSE;
dvander@27	1929	}
dvander@27	1930	} /* if */
dvander@27	1931	return lvalue;
dvander@27	1932	}
dvander@27	1933
dvander@27	1934	/* primary
dvander@27	1935	*
dvander@27	1936	* Returns 1 if the operand is an lvalue (everything except arrays, functions
dvander@27	1937	* constants and -of course- errors).
dvander@27	1938	* Generates code to fetch the address of arrays. Code for constants is
dvander@27	1939	* already generated by constant().
dvander@27	1940	* This routine first clears the entire lval array (all fields are set to 0).
dvander@27	1941	*
dvander@27	1942	* Global references: sc_intest (may be altered, but restored upon termination)
dvander@27	1943	*/
dvander@27	1944	static int primary(value *lval)
dvander@27	1945	{
dvander@27	1946	char *st;
dvander@27	1947	int lvalue,tok;
dvander@27	1948	cell val;
dvander@27	1949	symbol *sym;
dvander@27	1950
dvander@27	1951	if (matchtoken('(')){ /* sub-expression - (expression,...) */
dvander@27	1952	PUSHSTK_I(sc_intest);
dvander@27	1953	PUSHSTK_I(sc_allowtags);
dvander@27	1954
dvander@27	1955	sc_intest=FALSE; /* no longer in "test" expression */
dvander@27	1956	sc_allowtags=TRUE; /* allow tagnames to be used in parenthesized expressions */
dvander@27	1957	sc_allowproccall=FALSE;
dvander@27	1958	do
dvander@27	1959	lvalue=hier14(lval);
dvander@27	1960	while (matchtoken(','));
dvander@27	1961	needtoken(')');
dvander@27	1962	lexclr(FALSE); /* clear lex() push-back, it should have been
dvander@27	1963	* cleared already by needtoken() */
dvander@27	1964	sc_allowtags=(short)POPSTK_I();
dvander@27	1965	sc_intest=(short)POPSTK_I();
dvander@27	1966	return lvalue;
dvander@27	1967	} /* if */
dvander@27	1968
dvander@27	1969	clear_value(lval); /* clear lval */
dvander@27	1970	tok=lex(&val,&st);
dvander@27	1971	if (tok==tSYMBOL) {
dvander@27	1972	/* lastsymbol is char[sNAMEMAX+1], lex() should have truncated any symbol
dvander@27	1973	* to sNAMEMAX significant characters */
dvander@27	1974	assert(strlen(st)<sizeof lastsymbol);
dvander@27	1975	strcpy(lastsymbol,st);
dvander@27	1976	} /* if */
dvander@27	1977	if (tok==tSYMBOL && !findconst(st,NULL)) {
dvander@27	1978	/* first look for a local variable */
dvander@27	1979	if ((sym=findloc(st))!=0) {
dvander@27	1980	if (sym->ident==iLABEL) {
dvander@27	1981	error(29); /* expression error, assumed 0 */
dvander@27	1982	ldconst(0,sPRI); /* load 0 */
dvander@27	1983	return FALSE; /* return 0 for labels (expression error) */
dvander@27	1984	} /* if */
dvander@27	1985	lval->sym=sym;
dvander@27	1986	lval->ident=sym->ident;
dvander@27	1987	lval->tag=sym->tag;
dvander@27	1988	if (sym->ident==iARRAY \|\| sym->ident==iREFARRAY) {
dvander@27	1989	address(sym,sPRI); /* get starting address in primary register */
dvander@27	1990	return FALSE; /* return 0 for array (not lvalue) */
dvander@27	1991	} else {
dvander@27	1992	return TRUE; /* return 1 if lvalue (not label or array) */
dvander@27	1993	} /* if */
dvander@27	1994	} /* if */
dvander@27	1995	/* now try a global variable */
dvander@27	1996	if ((sym=findglb(st,sSTATEVAR))!=0) {
dvander@27	1997	if (sym->ident==iFUNCTN \|\| sym->ident==iREFFUNC) {
dvander@27	1998	/* if the function is only in the table because it was inserted as a
dvander@27	1999	* stub in the first pass (i.e. it was "used" but never declared or
dvander@27	2000	* implemented, issue an error
dvander@27	2001	*/
dvander@27	2002	if ((sym->usage & uPROTOTYPED)==0)
dvander@27	2003	error(17,st);
dvander@27	2004	} else {
dvander@27	2005	if ((sym->usage & uDEFINE)==0)
dvander@27	2006	error(17,st);
dvander@27	2007	lval->sym=sym;
dvander@27	2008	lval->ident=sym->ident;
dvander@27	2009	lval->tag=sym->tag;
dvander@27	2010	if (sym->ident==iARRAY \|\| sym->ident==iREFARRAY) {
dvander@27	2011	address(sym,sPRI); /* get starting address in primary register */
dvander@27	2012	return FALSE; /* return 0 for array (not lvalue) */
dvander@27	2013	} else {
dvander@27	2014	return TRUE; /* return 1 if lvalue (not function or array) */
dvander@27	2015	} /* if */
dvander@27	2016	} /* if */
dvander@27	2017	} else {
dvander@27	2018	if (!sc_allowproccall)
dvander@27	2019	return error(17,st); /* undefined symbol */
dvander@27	2020	/* an unknown symbol, but used in a way compatible with the "procedure
dvander@27	2021	* call" syntax. So assume that the symbol refers to a function.
dvander@27	2022	*/
dvander@27	2023	assert(sc_status==statFIRST);
dvander@27	2024	sym=fetchfunc(st,0);
dvander@27	2025	if (sym==NULL)
dvander@27	2026	error(103); /* insufficient memory */
dvander@27	2027	} /* if */
dvander@27	2028	assert(sym!=NULL);
dvander@27	2029	assert(sym->ident==iFUNCTN \|\| sym->ident==iREFFUNC);
dvander@27	2030	lval->sym=sym;
dvander@27	2031	lval->ident=sym->ident;
dvander@27	2032	lval->tag=sym->tag;
dvander@27	2033	return FALSE; /* return 0 for function (not an lvalue) */
dvander@27	2034	} /* if */
dvander@27	2035	lexpush(); /* push the token, it is analyzed by constant() */
dvander@27	2036	if (constant(lval)==0) {
dvander@27	2037	error(29); /* expression error, assumed 0 */
dvander@27	2038	ldconst(0,sPRI); /* load 0 */
dvander@27	2039	} /* if */
dvander@27	2040	return FALSE; /* return 0 for constants (or errors) */
dvander@27	2041	}
dvander@27	2042
dvander@27	2043	static void clear_value(value *lval)
dvander@27	2044	{
dvander@27	2045	lval->sym=NULL;
dvander@27	2046	lval->constval=0L;
dvander@27	2047	lval->tag=0;
dvander@27	2048	lval->ident=0;
dvander@27	2049	lval->boolresult=FALSE;
dvander@27	2050	/* do not clear lval->arrayidx, it is preset in hier14() */
dvander@27	2051	/* do not clear lval->cmptag */
dvander@27	2052	}
dvander@27	2053
dvander@27	2054	static void setdefarray(cell string,cell size,cell array_sz,cell dataaddr,int fconst)
dvander@27	2055	{
dvander@27	2056	/* The routine must copy the default array data onto the heap, as to avoid
dvander@27	2057	* that a function can change the default value. An optimization is that
dvander@27	2058	* the default array data is "dumped" into the data segment only once (on the
dvander@27	2059	* first use).
dvander@27	2060	*/
dvander@27	2061	assert(string!=NULL);
dvander@27	2062	assert(size>0);
dvander@27	2063	/* check whether to dump the default array */
dvander@27	2064	assert(dataaddr!=NULL);
dvander@27	2065	if (sc_status==statWRITE && *dataaddr<0) {
dvander@27	2066	int i;
dvander@27	2067	dataaddr=(litidx+glb_declared)sizeof(cell);
dvander@27	2068	for (i=0; i<size; i++)
dvander@27	2069	litadd(*string++);
dvander@27	2070	} /* if */
dvander@27	2071
dvander@27	2072	/* if the function is known not to modify the array (meaning that it also
dvander@27	2073	* does not modify the default value), directly pass the address of the
dvander@27	2074	* array in the data segment.
dvander@27	2075	*/
dvander@27	2076	if (fconst) {
dvander@27	2077	ldconst(*dataaddr,sPRI);
dvander@27	2078	} else {
dvander@27	2079	/* Generate the code:
dvander@27	2080	* CONST.pri dataaddr ;address of the default array data
dvander@27	2081	* HEAP array_sz*sizeof(cell) ;heap address in ALT
dvander@27	2082	* MOVS size*sizeof(cell) ;copy data from PRI to ALT
dvander@27	2083	* MOVE.PRI ;PRI = address on the heap
dvander@27	2084	*/
dvander@27	2085	ldconst(*dataaddr,sPRI);
dvander@27	2086	/* "array_sz" is the size of the argument (the value between the brackets
dvander@27	2087	* in the declaration), "size" is the size of the default array data.
dvander@27	2088	*/
dvander@27	2089	assert(array_sz>=size);
dvander@27	2090	modheap((int)array_sz*sizeof(cell));
dvander@116	2091	markheap(MEMUSE_STATIC, array_sz);
dvander@27	2092	/* ??? should perhaps fill with zeros first */
dvander@27	2093	memcopy(size*sizeof(cell));
dvander@27	2094	moveto1();
dvander@27	2095	} /* if */
dvander@27	2096	}
dvander@27	2097
dvander@27	2098	static int findnamedarg(arginfo arg,char name)
dvander@27	2099	{
dvander@27	2100	int i;
dvander@27	2101
dvander@27	2102	for (i=0; arg[i].ident!=0 && arg[i].ident!=iVARARGS; i++)
dvander@27	2103	if (strcmp(arg[i].name,name)==0)
dvander@27	2104	return i;
dvander@27	2105	return -1;
dvander@27	2106	}
dvander@27	2107
dvander@27	2108	static int checktag(int tags[],int numtags,int exprtag)
dvander@27	2109	{
dvander@27	2110	int i;
dvander@27	2111
dvander@27	2112	assert(tags!=0);
dvander@27	2113	assert(numtags>0);
dvander@27	2114	for (i=0; i<numtags; i++)
dvander@27	2115	if (matchtag(tags[i],exprtag,TRUE))
dvander@27	2116	return TRUE; /* matching tag */
dvander@27	2117	return FALSE; /* no tag matched */
dvander@27	2118	}
dvander@27	2119
dvander@27	2120	enum {
dvander@27	2121	ARG_UNHANDLED,
dvander@27	2122	ARG_IGNORED,
dvander@27	2123	ARG_DONE,
dvander@27	2124	};
dvander@27	2125
dvander@27	2126	/* callfunction
dvander@27	2127	*
dvander@27	2128	* Generates code to call a function. This routine handles default arguments
dvander@27	2129	* and positional as well as named parameters.
dvander@27	2130	*/
dvander@27	2131	static void callfunction(symbol sym,value lval_result,int matchparanthesis)
dvander@27	2132	{
dvander@27	2133	static long nest_stkusage=0L;
dvander@27	2134	static int nesting=0;
dvander@27	2135	int close,lvalue;
dvander@27	2136	int argpos; /* index in the output stream (argpos==nargs if positional parameters) */
dvander@27	2137	int argidx=0; /* index in "arginfo" list */
dvander@27	2138	int nargs=0; /* number of arguments */
dvander@27	2139	int heapalloc=0;
dvander@27	2140	int namedparams=FALSE;
dvander@27	2141	value lval = {0};
dvander@27	2142	arginfo *arg;
dvander@27	2143	char arglist[sMAXARGS];
dvander@27	2144	constvalue arrayszlst = { NULL, "", 0, 0};/* array size list starts empty */
dvander@27	2145	constvalue taglst = { NULL, "", 0, 0}; /* tag list starts empty */
dvander@27	2146	symbol *symret;
dvander@27	2147	cell lexval;
dvander@27	2148	char *lexstr;
dvander@27	2149
dvander@27	2150	assert(sym!=NULL);
dvander@27	2151	lval_result->ident=iEXPRESSION; /* preset, may be changed later */
dvander@27	2152	lval_result->constval=0;
dvander@27	2153	lval_result->tag=sym->tag;
dvander@27	2154	/* check whether this is a function that returns an array */
dvander@27	2155	symret=finddepend(sym);
dvander@27	2156	assert(symret==NULL \|\| symret->ident==iREFARRAY);
dvander@27	2157	if (symret!=NULL) {
dvander@27	2158	int retsize;
dvander@27	2159	/* allocate space on the heap for the array, and pass the pointer to the
dvander@27	2160	* reserved memory block as a hidden parameter
dvander@27	2161	*/
dvander@27	2162	retsize=(int)array_totalsize(symret);
dvander@27	2163	assert(retsize>0);
dvander@27	2164	modheap(retsizesizeof(cell));/ address is in ALT */
dvander@27	2165	pushreg(sALT); /* pass ALT as the last (hidden) parameter */
dvander@116	2166	markheap(MEMUSE_STATIC, retsize);
dvander@27	2167	/* also mark the ident of the result as "array" */
dvander@27	2168	lval_result->ident=iREFARRAY;
dvander@27	2169	lval_result->sym=symret;
dvander@27	2170	} /* if */
dvander@64	2171	pushheaplist();
dvander@27	2172
dvander@27	2173	nesting++;
dvander@27	2174	assert(nest_stkusage>=0);
dvander@27	2175	#if !defined NDEBUG
dvander@27	2176	if (nesting==1)
dvander@27	2177	assert(nest_stkusage==0);
dvander@27	2178	#endif
dvander@27	2179	sc_allowproccall=FALSE; /* parameters may not use procedure call syntax */
dvander@27	2180
ds@52	2181	if ((sym->flags & flgDEPRECATED)!=0) {
dvander@27	2182	char *ptr= (sym->documentation!=NULL) ? sym->documentation : "";
ds@52	2183	error(234,sym->name,ptr); /* deprecated (probably a native function) */
dvander@27	2184	} /* if */
dvander@27	2185
dvander@27	2186	/* run through the arguments */
dvander@27	2187	arg=sym->dim.arglist;
dvander@27	2188	assert(arg!=NULL);
dvander@27	2189	stgmark(sSTARTREORDER);
dvander@27	2190	memset(arglist,ARG_UNHANDLED,sizeof arglist);
dvander@27	2191	if (matchparanthesis) {
dvander@27	2192	/* Opening brace was already parsed, if closing brace follows, this
dvander@27	2193	* call passes no parameters.
dvander@27	2194	*/
dvander@27	2195	close=matchtoken(')');
dvander@27	2196	} else {
dvander@27	2197	/* When we find an end of line here, it may be a function call passing
dvander@27	2198	* no parameters, or it may be that the first parameter is on a line
dvander@27	2199	* below. But as a parameter can be anything, this is difficult to check.
dvander@27	2200	* The only simple check that we have is the use of "named parameters".
dvander@27	2201	*/
dvander@27	2202	close=matchtoken(tTERM);
dvander@27	2203	if (close) {
dvander@27	2204	close=!matchtoken('.');
dvander@27	2205	if (!close)
dvander@27	2206	lexpush(); /* reset the '.' */
dvander@27	2207	} /* if */
dvander@27	2208	} /* if */
dvander@27	2209	if (!close) {
dvander@27	2210	do {
dvander@27	2211	if (matchtoken('.')) {
dvander@27	2212	namedparams=TRUE;
dvander@27	2213	if (needtoken(tSYMBOL))
dvander@27	2214	tokeninfo(&lexval,&lexstr);
dvander@27	2215	else
dvander@27	2216	lexstr="";
dvander@27	2217	argpos=findnamedarg(arg,lexstr);
dvander@27	2218	if (argpos<0) {
dvander@27	2219	error(17,lexstr); /* undefined symbol */
dvander@27	2220	break; /* exit loop, argpos is invalid */
dvander@27	2221	} /* if */
dvander@27	2222	needtoken('=');
dvander@27	2223	argidx=argpos;
dvander@27	2224	} else {
dvander@27	2225	if (namedparams)
dvander@27	2226	error(44); /* positional parameters must precede named parameters */
dvander@27	2227	argpos=nargs;
dvander@27	2228	} /* if */
dvander@27	2229	/* the number of arguments this was already checked at the declaration
dvander@27	2230	* of the function; check it again for functions with a variable
dvander@27	2231	* argument list
dvander@27	2232	*/
dvander@27	2233	if (argpos>=sMAXARGS)
dvander@27	2234	error(45); /* too many function arguments */
dvander@27	2235	stgmark((char)(sEXPRSTART+argpos));/* mark beginning of new expression in stage */
dvander@27	2236	if (arglist[argpos]!=ARG_UNHANDLED)
dvander@27	2237	error(58); /* argument already set */
dvander@27	2238	if (matchtoken('_')) {
dvander@27	2239	arglist[argpos]=ARG_IGNORED; /* flag argument as "present, but ignored" */
dvander@27	2240	if (arg[argidx].ident==0 \|\| arg[argidx].ident==iVARARGS) {
dvander@27	2241	error(92); /* argument count mismatch */
dvander@27	2242	} else if (!arg[argidx].hasdefault) {
dvander@27	2243	error(34,nargs+1); /* argument has no default value */
dvander@27	2244	} /* if */
dvander@27	2245	if (arg[argidx].ident!=0 && arg[argidx].ident!=iVARARGS)
dvander@27	2246	argidx++;
dvander@27	2247	/* The rest of the code to handle default values is at the bottom
dvander@27	2248	* of this routine where default values for unspecified parameters
dvander@27	2249	* are (also) handled. Note that above, the argument is flagged as
dvander@27	2250	* ARG_IGNORED.
dvander@27	2251	*/
dvander@27	2252	} else {
dvander@27	2253	arglist[argpos]=ARG_DONE; /* flag argument as "present" */
dvander@27	2254	if (arg[argidx].numtags==1) /* set the expected tag, if any */
dvander@27	2255	lval.cmptag=arg[argidx].tags[0];
dvander@27	2256	lvalue=hier14(&lval);
dvander@27	2257	assert(sc_status==statFIRST \|\| arg[argidx].tags!=NULL);
dvander@27	2258	switch (arg[argidx].ident) {
dvander@27	2259	case 0:
dvander@27	2260	error(92); /* argument count mismatch */
dvander@27	2261	break;
dvander@27	2262	case iVARARGS:
dvander@27	2263	/* always pass by reference */
dvander@27	2264	if (lval.ident==iVARIABLE \|\| lval.ident==iREFERENCE) {
dvander@27	2265	assert(lval.sym!=NULL);
dvander@27	2266	if ((lval.sym->usage & uCONST)!=0 && (arg[argidx].usage & uCONST)==0) {
dvander@27	2267	/* treat a "const" variable passed to a function with a non-const
dvander@27	2268	* "variable argument list" as a constant here */
dvander@27	2269	if (!lvalue) {
dvander@27	2270	error(22); /* need lvalue */
dvander@27	2271	} else {
dvander@27	2272	rvalue(&lval); /* get value in PRI */
dvander@27	2273	setheap_pri(); /* address of the value on the heap in PRI */
dvander@116	2274	heapalloc+=markheap(MEMUSE_STATIC, 1);
dvander@27	2275	nest_stkusage++;
dvander@27	2276	} /* if */
dvander@27	2277	} else if (lvalue) {
dvander@27	2278	address(lval.sym,sPRI);
dvander@27	2279	} else {
dvander@27	2280	setheap_pri(); /* address of the value on the heap in PRI */
dvander@116	2281	heapalloc+=markheap(MEMUSE_STATIC, 1);
dvander@27	2282	nest_stkusage++;
dvander@27	2283	} /* if */
dvander@27	2284	} else if (lval.ident==iCONSTEXPR \|\| lval.ident==iEXPRESSION
dvander@27	2285	\|\| lval.ident==iARRAYCHAR)
dvander@27	2286	{
dvander@27	2287	/* fetch value if needed */
dvander@27	2288	if (lval.ident==iARRAYCHAR)
dvander@27	2289	rvalue(&lval);
dvander@27	2290	/* allocate a cell on the heap and store the
dvander@27	2291	* value (already in PRI) there */
dvander@27	2292	setheap_pri(); /* address of the value on the heap in PRI */
dvander@116	2293	heapalloc+=markheap(MEMUSE_STATIC, 1);
dvander@27	2294	nest_stkusage++;
dvander@27	2295	} /* if */
dvander@27	2296	/* ??? handle const array passed by reference */
dvander@27	2297	/* otherwise, the address is already in PRI */
dvander@27	2298	if (lval.sym!=NULL)
dvander@27	2299	markusage(lval.sym,uWRITTEN);
dvander@27	2300	if (!checktag(arg[argidx].tags,arg[argidx].numtags,lval.tag))
dvander@27	2301	error(213);
dvander@27	2302	if (lval.tag!=0)
dvander@27	2303	append_constval(&taglst,arg[argidx].name,lval.tag,0);
dvander@27	2304	break;
dvander@27	2305	case iVARIABLE:
dvander@27	2306	if (lval.ident==iLABEL \|\| lval.ident==iFUNCTN \|\| lval.ident==iREFFUNC
dvander@27	2307	\|\| lval.ident==iARRAY \|\| lval.ident==iREFARRAY)
dvander@27	2308	error(35,argidx+1); /* argument type mismatch */
dvander@27	2309	if (lvalue)
dvander@27	2310	rvalue(&lval); /* get value (direct or indirect) */
dvander@27	2311	/* otherwise, the expression result is already in PRI */
dvander@27	2312	assert(arg[argidx].numtags>0);
dvander@27	2313	check_userop(NULL,lval.tag,arg[argidx].tags[0],2,NULL,&lval.tag);
dvander@27	2314	if (!checktag(arg[argidx].tags,arg[argidx].numtags,lval.tag))
dvander@27	2315	error(213);
dvander@27	2316	if (lval.tag!=0)
dvander@27	2317	append_constval(&taglst,arg[argidx].name,lval.tag,0);
dvander@27	2318	argidx++; /* argument done */
dvander@27	2319	break;
dvander@27	2320	case iREFERENCE:
dvander@27	2321	if (!lvalue \|\| lval.ident==iARRAYCHAR)
dvander@27	2322	error(35,argidx+1); /* argument type mismatch */
dvander@27	2323	if (lval.sym!=NULL && (lval.sym->usage & uCONST)!=0 && (arg[argidx].usage & uCONST)==0)
dvander@27	2324	error(35,argidx+1); /* argument type mismatch */
dvander@27	2325	if (lval.ident==iVARIABLE \|\| lval.ident==iREFERENCE) {
dvander@27	2326	if (lvalue) {
dvander@27	2327	assert(lval.sym!=NULL);
dvander@27	2328	address(lval.sym,sPRI);
dvander@27	2329	} else {
dvander@27	2330	setheap_pri(); /* address of the value on the heap in PRI */
dvander@116	2331	heapalloc+=markheap(MEMUSE_STATIC, 1);
dvander@27	2332	nest_stkusage++;
dvander@27	2333	} /* if */
dvander@27	2334	} /* if */
dvander@27	2335	/* otherwise, the address is already in PRI */
dvander@27	2336	if (!checktag(arg[argidx].tags,arg[argidx].numtags,lval.tag))
dvander@27	2337	error(213);
dvander@27	2338	if (lval.tag!=0)
dvander@27	2339	append_constval(&taglst,arg[argidx].name,lval.tag,0);
dvander@27	2340	argidx++; /* argument done */
dvander@27	2341	if (lval.sym!=NULL)
dvander@27	2342	markusage(lval.sym,uWRITTEN);
dvander@27	2343	break;
dvander@27	2344	case iREFARRAY:
dvander@27	2345	if (lval.ident!=iARRAY && lval.ident!=iREFARRAY
dvander@27	2346	&& lval.ident!=iARRAYCELL)
dvander@27	2347	{
dvander@27	2348	error(35,argidx+1); /* argument type mismatch */
dvander@27	2349	break;
dvander@27	2350	} /* if */
dvander@27	2351	if (lval.sym!=NULL && (lval.sym->usage & uCONST)!=0 && (arg[argidx].usage & uCONST)==0)
dvander@27	2352	error(35,argidx+1); /* argument type mismatch */
dvander@27	2353	/* Verify that the dimensions match with those in arg[argidx].
dvander@27	2354	* A literal array always has a single dimension.
dvander@27	2355	* An iARRAYCELL parameter is also assumed to have a single dimension.
dvander@27	2356	*/
dvander@27	2357	if (lval.sym==NULL \|\| lval.ident==iARRAYCELL) {
dvander@27	2358	if (arg[argidx].numdim!=1) {
dvander@27	2359	error(48); /* array dimensions must match */
dvander@27	2360	} else if (arg[argidx].dim[0]!=0) {
dvander@27	2361	assert(arg[argidx].dim[0]>0);
dvander@27	2362	if (lval.ident==iARRAYCELL) {
dvander@27	2363	error(47); /* array sizes must match */
dvander@27	2364	} else {
dvander@27	2365	assert(lval.constval!=0); /* literal array must have a size */
dvander@27	2366	/* A literal array must have exactly the same size as the
dvander@27	2367	* function argument; a literal string may be smaller than
dvander@27	2368	* the function argument.
dvander@27	2369	*/
dvander@27	2370	if (lval.constval>0 && arg[argidx].dim[0]!=lval.constval
dvander@27	2371	\|\| lval.constval<0 && arg[argidx].dim[0] < -lval.constval)
dvander@27	2372	error(47); /* array sizes must match */
dvander@27	2373	} /* if */
dvander@27	2374	} /* if */
dvander@27	2375	if (lval.ident!=iARRAYCELL) {
dvander@27	2376	/* save array size, for default values with uSIZEOF flag */
dvander@27	2377	cell array_sz=lval.constval;
dvander@27	2378	assert(array_sz!=0);/* literal array must have a size */
dvander@27	2379	if (array_sz<0)
dvander@27	2380	array_sz= -array_sz;
dvander@27	2381	append_constval(&arrayszlst,arg[argidx].name,array_sz,0);
dvander@27	2382	} /* if */
dvander@27	2383	} else {
dvander@27	2384	symbol *sym=lval.sym;
dvander@27	2385	short level=0;
dvander@27	2386	assert(sym!=NULL);
dvander@27	2387	if (sym->dim.array.level+1!=arg[argidx].numdim)
dvander@27	2388	error(48); /* array dimensions must match */
dvander@27	2389	/* the lengths for all dimensions must match, unless the dimension
dvander@27	2390	* length was defined at zero (which means "undefined")
dvander@27	2391	*/
dvander@27	2392	while (sym->dim.array.level>0) {
dvander@27	2393	assert(level<sDIMEN_MAX);
dvander@27	2394	if (arg[argidx].dim[level]!=0 && sym->dim.array.length!=arg[argidx].dim[level])
dvander@27	2395	error(47); /* array sizes must match */
dvander@27	2396	else if (!matchtag(arg[argidx].idxtag[level],sym->x.tags.index,TRUE))
dvander@27	2397	error(229,sym->name); /* index tag mismatch */
dvander@27	2398	append_constval(&arrayszlst,arg[argidx].name,sym->dim.array.length,level);
dvander@27	2399	sym=finddepend(sym);
dvander@27	2400	assert(sym!=NULL);
dvander@27	2401	level++;
dvander@27	2402	} /* if */
dvander@27	2403	/* the last dimension is checked too, again, unless it is zero */
dvander@27	2404	assert(level<sDIMEN_MAX);
dvander@27	2405	assert(sym!=NULL);
dvander@27	2406	if (arg[argidx].dim[level]!=0 && sym->dim.array.length!=arg[argidx].dim[level])
dvander@27	2407	error(47); /* array sizes must match */
dvander@27	2408	else if (!matchtag(arg[argidx].idxtag[level],sym->x.tags.index,TRUE))
dvander@27	2409	error(229,sym->name); /* index tag mismatch */
dvander@27	2410	append_constval(&arrayszlst,arg[argidx].name,sym->dim.array.length,level);
dvander@27	2411	} /* if */
dvander@27	2412	/* address already in PRI */
dvander@27	2413	if (!checktag(arg[argidx].tags,arg[argidx].numtags,lval.tag))
dvander@27	2414	error(213);
dvander@27	2415	if (lval.tag!=0)
dvander@27	2416	append_constval(&taglst,arg[argidx].name,lval.tag,0);
dvander@27	2417	// ??? set uWRITTEN?
dvander@27	2418	argidx++; /* argument done */
dvander@27	2419	break;
dvander@27	2420	} /* switch */
dvander@27	2421	pushreg(sPRI); /* store the function argument on the stack */
dvander@27	2422	markexpr(sPARM,NULL,0); /* mark the end of a sub-expression */
dvander@27	2423	nest_stkusage++;
dvander@27	2424	} /* if */
dvander@27	2425	assert(arglist[argpos]!=ARG_UNHANDLED);
dvander@27	2426	nargs++;
dvander@27	2427	if (matchparanthesis) {
dvander@27	2428	close=matchtoken(')');
dvander@27	2429	if (!close) /* if not paranthese... */
dvander@27	2430	if (!needtoken(',')) /* ...should be comma... */
dvander@27	2431	break; /* ...but abort loop if neither */
dvander@27	2432	} else {
dvander@27	2433	close=!matchtoken(',');
dvander@27	2434	if (close) { /* if not comma... */
dvander@27	2435	if (needtoken(tTERM)==1)/* ...must be end of statement */
dvander@27	2436	lexpush(); /* push again, because end of statement is analised later */
dvander@27	2437	} /* if */
dvander@27	2438	} /* if */
dvander@27	2439	} while (!close && freading && !matchtoken(tENDEXPR)); /* do */
dvander@27	2440	} /* if */
dvander@27	2441	/* check remaining function arguments (they may have default values) */
dvander@27	2442	for (argidx=0; arg[argidx].ident!=0 && arg[argidx].ident!=iVARARGS; argidx++) {
dvander@27	2443	if (arglist[argidx]==ARG_DONE)
dvander@27	2444	continue; /* already seen and handled this argument */
dvander@27	2445	/* in this first stage, we also skip the arguments with uSIZEOF and uTAGOF;
dvander@27	2446	* these are handled last
dvander@27	2447	*/
dvander@27	2448	if ((arg[argidx].hasdefault & uSIZEOF)!=0 \|\| (arg[argidx].hasdefault & uTAGOF)!=0) {
dvander@27	2449	assert(arg[argidx].ident==iVARIABLE);
dvander@27	2450	continue;
dvander@27	2451	} /* if */
dvander@27	2452	stgmark((char)(sEXPRSTART+argidx));/* mark beginning of new expression in stage */
dvander@27	2453	if (arg[argidx].hasdefault) {
dvander@27	2454	if (arg[argidx].ident==iREFARRAY) {
dvander@27	2455	short level;
dvander@27	2456	setdefarray(arg[argidx].defvalue.array.data,
dvander@27	2457	arg[argidx].defvalue.array.size,
dvander@27	2458	arg[argidx].defvalue.array.arraysize,
dvander@27	2459	&arg[argidx].defvalue.array.addr,
dvander@27	2460	(arg[argidx].usage & uCONST)!=0);
dvander@27	2461	if ((arg[argidx].usage & uCONST)==0) {
dvander@27	2462	heapalloc+=arg[argidx].defvalue.array.arraysize;
dvander@27	2463	nest_stkusage+=arg[argidx].defvalue.array.arraysize;
dvander@27	2464	} /* if */
dvander@27	2465	/* keep the lengths of all dimensions of a multi-dimensional default array */
dvander@27	2466	assert(arg[argidx].numdim>0);
dvander@27	2467	if (arg[argidx].numdim==1) {
dvander@27	2468	append_constval(&arrayszlst,arg[argidx].name,arg[argidx].defvalue.array.arraysize,0);
dvander@27	2469	} else {
dvander@27	2470	for (level=0; level<arg[argidx].numdim; level++) {
dvander@27	2471	assert(level<sDIMEN_MAX);
dvander@27	2472	append_constval(&arrayszlst,arg[argidx].name,arg[argidx].dim[level],level);
dvander@27	2473	} /* for */
dvander@27	2474	} /* if */
dvander@27	2475	} else if (arg[argidx].ident==iREFERENCE) {
dvander@27	2476	setheap(arg[argidx].defvalue.val);
dvander@27	2477	/* address of the value on the heap in PRI */
dvander@116	2478	heapalloc+=markheap(MEMUSE_STATIC, 1);
dvander@27	2479	nest_stkusage++;
dvander@27	2480	} else {
dvander@27	2481	int dummytag=arg[argidx].tags[0];
dvander@27	2482	ldconst(arg[argidx].defvalue.val,sPRI);
dvander@27	2483	assert(arg[argidx].numtags>0);
dvander@27	2484	check_userop(NULL,arg[argidx].defvalue_tag,arg[argidx].tags[0],2,NULL,&dummytag);
dvander@27	2485	assert(dummytag==arg[argidx].tags[0]);
dvander@27	2486	} /* if */
dvander@27	2487	pushreg(sPRI); /* store the function argument on the stack */
dvander@27	2488	markexpr(sPARM,NULL,0); /* mark the end of a sub-expression */
dvander@27	2489	nest_stkusage++;
dvander@27	2490	} else {
dvander@103	2491	error(92,argidx); /* argument count mismatch */
dvander@27	2492	} /* if */
dvander@27	2493	if (arglist[argidx]==ARG_UNHANDLED)
dvander@27	2494	nargs++;
dvander@27	2495	arglist[argidx]=ARG_DONE;
dvander@27	2496	} /* for */
dvander@27	2497	/* now a second loop to catch the arguments with default values that are
dvander@27	2498	* the "sizeof" or "tagof" of other arguments
dvander@27	2499	*/
dvander@27	2500	for (argidx=0; arg[argidx].ident!=0 && arg[argidx].ident!=iVARARGS; argidx++) {
dvander@27	2501	constvalue *asz;
dvander@27	2502	cell array_sz;
dvander@27	2503	if (arglist[argidx]==ARG_DONE)
dvander@27	2504	continue; /* already seen and handled this argument */
dvander@27	2505	stgmark((char)(sEXPRSTART+argidx));/* mark beginning of new expression in stage */
dvander@27	2506	assert(arg[argidx].ident==iVARIABLE); /* if "sizeof", must be single cell */
dvander@27	2507	/* if unseen, must be "sizeof" or "tagof" */
dvander@27	2508	assert((arg[argidx].hasdefault & uSIZEOF)!=0 \|\| (arg[argidx].hasdefault & uTAGOF)!=0);
dvander@27	2509	if ((arg[argidx].hasdefault & uSIZEOF)!=0) {
dvander@27	2510	/* find the argument; if it isn't found, the argument's default value
dvander@27	2511	* was a "sizeof" of a non-array (a warning for this was already given
dvander@27	2512	* when declaring the function)
dvander@27	2513	*/
dvander@27	2514	asz=find_constval(&arrayszlst,arg[argidx].defvalue.size.symname,
dvander@27	2515	arg[argidx].defvalue.size.level);
dvander@27	2516	if (asz!=NULL) {
dvander@27	2517	array_sz=asz->value;
dvander@27	2518	if (array_sz==0)
dvander@27	2519	error(224,arg[argidx].name); /* indeterminate array size in "sizeof" expression */
dvander@27	2520	} else {
dvander@27	2521	array_sz=1;
dvander@27	2522	} /* if */
dvander@27	2523	} else {
dvander@27	2524	asz=find_constval(&taglst,arg[argidx].defvalue.size.symname,
dvander@27	2525	arg[argidx].defvalue.size.level);
dvander@27	2526	if (asz != NULL) {
dvander@27	2527	exporttag(asz->value);
dvander@27	2528	array_sz=asz->value \| PUBLICTAG; /* must be set, because it just was exported */
dvander@27	2529	} else {
dvander@27	2530	array_sz=0;
dvander@27	2531	} /* if */
dvander@27	2532	} /* if */
dvander@27	2533	ldconst(array_sz,sPRI);
dvander@27	2534	pushreg(sPRI); /* store the function argument on the stack */
dvander@27	2535	markexpr(sPARM,NULL,0);
dvander@27	2536	nest_stkusage++;
dvander@27	2537	if (arglist[argidx]==ARG_UNHANDLED)
dvander@27	2538	nargs++;
dvander@27	2539	arglist[argidx]=ARG_DONE;
dvander@27	2540	} /* for */
dvander@27	2541	stgmark(sENDREORDER); /* mark end of reversed evaluation */
dvander@101	2542	pushval((cell)nargs /* sizeof(cell)/ );
dvander@27	2543	nest_stkusage++;
dvander@27	2544	ffcall(sym,NULL,nargs);
dvander@27	2545	if (sc_status!=statSKIP)
dvander@27	2546	markusage(sym,uREAD); /* do not mark as "used" when this call itself is skipped */
dvander@27	2547	if ((sym->usage & uNATIVE)!=0 &&sym->x.lib!=NULL)
dvander@27	2548	sym->x.lib->value += 1; /* increment "usage count" of the library */
dvander@27	2549	if (symret!=NULL)
dvander@27	2550	popreg(sPRI); /* pop hidden parameter as function result */
dvander@27	2551	sideeffect=TRUE; /* assume functions carry out a side-effect */
dvander@27	2552	delete_consttable(&arrayszlst); /* clear list of array sizes */
dvander@27	2553	delete_consttable(&taglst); /* clear list of parameter tags */
dvander@27	2554
dvander@27	2555	/* maintain max. amount of memory used */
dvander@27	2556	{
dvander@27	2557	long totalsize;
dvander@64	2558	totalsize=declared+heapalloc+1; /* local variables & return value size,
dvander@27	2559	* +1 for PROC opcode */
dvander@27	2560	if (lval_result->ident==iREFARRAY)
dvander@27	2561	totalsize++; /* add hidden parameter (on the stack) */
dvander@27	2562	if ((sym->usage & uNATIVE)==0)
dvander@27	2563	totalsize++; /* add "call" opcode */
dvander@27	2564	totalsize+=nest_stkusage;
dvander@27	2565	assert(curfunc!=NULL);
dvander@27	2566	if (curfunc->x.stacksize<totalsize)
dvander@27	2567	curfunc->x.stacksize=totalsize;
dvander@27	2568	nest_stkusage-=nargs+heapalloc+1; /* stack/heap space, +1 for argcount param */
dvander@27	2569	/* if there is a syntax error in the script, the stack calculation is
dvander@27	2570	* probably incorrect; but we may not allow it to drop below zero
dvander@27	2571	*/
dvander@27	2572	if (nest_stkusage<0)
dvander@27	2573	nest_stkusage=0;
dvander@27	2574	}
dvander@27	2575
dvander@27	2576	/* scrap any arrays left on the heap, with the exception of the array that
dvander@27	2577	* this function has as a result (in other words, scrap all arrays on the
dvander@27	2578	* heap that caused by expressions in the function arguments)
dvander@27	2579	*/
dvander@64	2580	popheaplist();
dvander@27	2581	nesting--;
dvander@27	2582	}
dvander@27	2583
dvander@27	2584	/* dbltest
dvander@27	2585	*
dvander@27	2586	* Returns a non-zero value if lval1 an array and lval2 is not an array and
dvander@27	2587	* the operation is addition or subtraction.
dvander@27	2588	*
dvander@27	2589	* Returns the "shift" count (1 for 16-bit, 2 for 32-bit) to align a cell
dvander@27	2590	* to an array offset.
dvander@27	2591	*/
dvander@27	2592	static int dbltest(void (oper)(),value lval1,value *lval2)
dvander@27	2593	{
dvander@27	2594	if ((oper!=ob_add) && (oper!=ob_sub))
dvander@27	2595	return 0;
dvander@27	2596	if (lval1->ident!=iARRAY)
dvander@27	2597	return 0;
dvander@27	2598	if (lval2->ident==iARRAY)
dvander@27	2599	return 0;
dvander@27	2600	return sizeof(cell)/2; /* 1 for 16-bit, 2 for 32-bit */
dvander@27	2601	}
dvander@27	2602
dvander@27	2603	/* commutative
dvander@27	2604	*
dvander@27	2605	* Test whether an operator is commutative, i.e. x oper y == y oper x.
dvander@27	2606	* Commutative operators are: + (addition)
dvander@27	2607	* * (multiplication)
dvander@27	2608	* == (equality)
dvander@27	2609	* != (inequality)
dvander@27	2610	* & (bitwise and)
dvander@27	2611	* ^ (bitwise xor)
dvander@27	2612	* \| (bitwise or)
dvander@27	2613	*
dvander@27	2614	* If in an expression, code for the left operand has been generated and
dvander@27	2615	* the right operand is a constant and the operator is commutative, the
dvander@27	2616	* precautionary "push" of the primary register is scrapped and the constant
dvander@27	2617	* is read into the secondary register immediately.
dvander@27	2618	*/
dvander@27	2619	static int commutative(void (*oper)())
dvander@27	2620	{
dvander@27	2621	return oper==ob_add \|\| oper==os_mult
dvander@27	2622	\|\| oper==ob_eq \|\| oper==ob_ne
dvander@27	2623	\|\| oper==ob_and \|\| oper==ob_xor \|\| oper==ob_or;
dvander@27	2624	}
dvander@27	2625
dvander@27	2626	/* constant
dvander@27	2627	*
dvander@27	2628	* Generates code to fetch a number, a literal character (which is returned
dvander@27	2629	* by lex() as a number as well) or a literal string (lex() stores the
dvander@27	2630	* strings in the literal queue). If the operand was a number, it is stored
dvander@27	2631	* in lval->constval.
dvander@27	2632	*
dvander@27	2633	* The function returns 1 if the token was a constant or a string, 0
dvander@27	2634	* otherwise.
dvander@27	2635	*/
dvander@27	2636	static int constant(value *lval)
dvander@27	2637	{
dvander@27	2638	int tok,index,ident;
dvander@27	2639	cell val,item,cidx;
dvander@27	2640	char *st;
dvander@27	2641	symbol *sym;
dvander@27	2642	int cmptag=lval->cmptag;
dvander@27	2643
dvander@27	2644	tok=lex(&val,&st);
dvander@27	2645	if (tok==tSYMBOL && (sym=findconst(st,&cmptag))!=0) {
dvander@27	2646	if (cmptag>1)
dvander@27	2647	error(91,sym->name); /* ambiguity: multiple matching constants (different tags) */
dvander@27	2648	lval->constval=sym->addr;
dvander@27	2649	ldconst(lval->constval,sPRI);
dvander@27	2650	lval->ident=iCONSTEXPR;
dvander@27	2651	lval->tag=sym->tag;
dvander@27	2652	lval->sym=sym;
dvander@27	2653	markusage(sym,uREAD);
dvander@27	2654	} else if (tok==tNUMBER) {
dvander@27	2655	lval->constval=val;
dvander@27	2656	ldconst(lval->constval,sPRI);
dvander@27	2657	lval->ident=iCONSTEXPR;
dvander@27	2658	} else if (tok==tRATIONAL) {
dvander@27	2659	lval->constval=val;
dvander@27	2660	ldconst(lval->constval,sPRI);
dvander@27	2661	lval->ident=iCONSTEXPR;
dvander@27	2662	lval->tag=sc_rationaltag;
dvander@27	2663	} else if (tok==tSTRING) {
dvander@27	2664	/* lex() stores starting index of string in the literal table in 'val' */
dvander@27	2665	ldconst((val+glb_declared)*sizeof(cell),sPRI);
dvander@27	2666	lval->ident=iARRAY; /* pretend this is a global array */
dvander@27	2667	lval->constval=val-litidx; /* constval == the negative value of the
dvander@27	2668	* size of the literal array; using a negative
dvander@27	2669	* value distinguishes between literal arrays
dvander@27	2670	* and literal strings (this was done for
dvander@27	2671	* array assignment). */
dvander@27	2672	} else if (tok=='{') {
dvander@27	2673	int tag,lasttag=-1;
dvander@27	2674	val=litidx;
dvander@27	2675	do {
dvander@27	2676	/* cannot call constexpr() here, because "staging" is already turned
dvander@27	2677	* on at this point */
dvander@27	2678	assert(staging);
dvander@27	2679	stgget(&index,&cidx); /* mark position in code generator */
dvander@27	2680	ident=expression(&item,&tag,NULL,FALSE);
dvander@27	2681	stgdel(index,cidx); /* scratch generated code */
dvander@27	2682	if (ident!=iCONSTEXPR)
dvander@27	2683	error(8); /* must be constant expression */
dvander@27	2684	if (lasttag<0)
dvander@27	2685	lasttag=tag;
dvander@27	2686	else if (!matchtag(lasttag,tag,FALSE))
dvander@27	2687	error(213); /* tagname mismatch */
dvander@27	2688	litadd(item); /* store expression result in literal table */
dvander@27	2689	} while (matchtoken(','));
dvander@27	2690	if (!needtoken('}'))
dvander@27	2691	lexclr(FALSE);
dvander@27	2692	ldconst((val+glb_declared)*sizeof(cell),sPRI);
dvander@27	2693	lval->ident=iARRAY; /* pretend this is a global array */
dvander@27	2694	lval->constval=litidx-val; /* constval == the size of the literal array */
dvander@27	2695	} else {
dvander@27	2696	return FALSE; /* no, it cannot be interpreted as a constant */
dvander@27	2697	} /* if */
dvander@27	2698	return TRUE; /* yes, it was a constant value */
dvander@27	2699	}
dvander@27	2700

author	David Anderson <dvander@alliedmods.net>
	Fri Nov 03 06:14:43 2006 +0000 (2006-11-03)
changeset 132	dabef847cd2c
parent 116	4965c485f121
child 151	00a6126f837c
permissions	-rw-r--r--