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

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

author	David Anderson <dvander@alliedmods.net>
	Thu Mar 13 17:04:25 2008 +0000 (2008-03-13)
branch	sourcemod-1.1.0
changeset 1930	12f08d51439c
parent 1044	ff0047e53c65
permissions	-rw-r--r--