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

author	David Anderson <dvander@alliedmods.net>
	Wed Jul 19 09:58:18 2006 +0000 (2006-07-19)
changeset 31	071b73cfcc65
parent 27	764c6dd3dc25
child 52	97bdc78041aa
permissions	-rw-r--r--