Subversion Repositories tendra.SVN

/*

 * Copyright (c) 2002-2006 The TenDRA Project <http://www.tendra.org/>.

 * All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions are met:

 *

 * 1. Redistributions of source code must retain the above copyright notice,

 *    this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright notice,

 *    this list of conditions and the following disclaimer in the documentation

 *    and/or other materials provided with the distribution.

 * 3. Neither the name of The TenDRA Project nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific, prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS

 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR

 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

 * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;

 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,

 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR

 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF

 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 *

 * $Id$

 */

/*

    		 Crown Copyright (c) 1997, 1998

    This TenDRA(r) Computer Program is subject to Copyright

    owned by the United Kingdom Secretary of State for Defence

    acting through the Defence Evaluation and Research Agency

    (DERA).  It is made available to Recipients with a

    royalty-free licence for its use, reproduction, transfer

    to other parties and amendment for any purpose not excluding

    product development provided that any such use et cetera

    shall be deemed to be acceptance of the following conditions:-

        (1) Its Recipients shall ensure that this Notice is

        reproduced upon any copies or amended versions of it;

        (2) Any amended version of it shall be clearly marked to

        show both the nature of and the organisation responsible

        for the relevant amendment or amendments;

        (3) Its onward transfer from a recipient to another

        party shall be deemed to be that party's acceptance of

        these conditions;

        (4) DERA gives no warranty or assurance as to its

        quality or suitability for any purpose and DERA accepts

        no liability whatsoever in relation to any use to which

        it may be put.

*/

#include "config.h"

#include "c_types.h"

#include "ctype_ops.h"

#include "exp_ops.h"

#include "id_ops.h"

#include "hashid_ops.h"

#include "member_ops.h"

#include "nspace_ops.h"

#include "tok_ops.h"

#include "type_ops.h"

#include "error.h"

#include "catalog.h"

#include "access.h"

#include "basetype.h"

#include "class.h"

#include "constant.h"

#include "construct.h"

#include "convert.h"

#include "declare.h"

#include "derive.h"

#include "dump.h"

#include "exception.h"

#include "expression.h"

#include "file.h"

#include "function.h"

#include "hash.h"

#include "identifier.h"

#include "initialise.h"

#include "instance.h"

#include "namespace.h"

#include "option.h"

#include "parse.h"

#include "predict.h"

#include "redeclare.h"

#include "syntax.h"

#include "template.h"

#include "tok.h"

#include "token.h"

/*

    USAGE SUPPRESSION FLAG

    This flag may be set to true to indicate that the parser is in a sizeof

    expression or similar so that any usages should not be included.

*/

int suppress_usage = 0;

/*

    MARK AN IDENTIFIER AS BEING USED

    This routine marks the identifier id as having been used and checks

    any access controls.

*/

void

use_id(IDENTIFIER id, int suppress)

{

	DECL_SPEC ds = DEREF_dspec(id_storage(id));

	DECL_SPEC acc = (ds & dspec_access);

	if (acc)check_access(id, acc);

	/* Check usage */

	if (ds & dspec_main) {

		HASHID nm = DEREF_hashid(id_name(id));

		switch (TAG_hashid(nm)) {

		case hashid_name_tag:

			/* Can't take the address of 'main' */

			report(crt_loc, ERR_basic_start_main_addr(id));

			break;

		case hashid_constr_tag:

			/* Can't take the address of a constructor */

			report(crt_loc, ERR_class_ctor_addr(id));

			break;

		case hashid_destr_tag:

			/* Can't take the address of a destructor */

			report(crt_loc, ERR_class_dtor_addr(id));

			break;

		}

	}

	/* Mark use */

	if (!(ds & dspec_used)) {

		if (!suppress) {

			ds |= dspec_used;

			COPY_dspec(id_storage(id), ds);

		}

		if (ds & (dspec_inherit | dspec_alias | dspec_extern)) {

			/* Check for inheritance */

			IDENTIFIER uid = DEREF_id(id_alias(id));

			if (!EQ_id(uid, id)) {

				ds = DEREF_dspec(id_storage(uid));

				if (ds & dspec_used) {

					if (do_usage) {

						dump_use(id, &crt_loc, 1);

					}

					return;

				}

				if (!suppress) {

					ds |= dspec_used;

					COPY_dspec(id_storage(uid), ds);

				}

			}

		}

		if (!(ds & dspec_defn) && (ds & dspec_instance)) {

			/* Define template instance */

			if (!suppress) {

				define_template(id, 0);

			}

		}

	}

	if (do_usage) {

		dump_use(id, &crt_loc, 1);

	}

	return;

}

/*

    MARK A FUNCTION IDENTIFIER AS BEING USED

    This routine marks the function identifier id as having been called

    and checks any access controls.  In addition certain checks are applied

    to the first call of an identifier.  expl is true for explicit calls.

*/

void

use_func_id(IDENTIFIER id, int expl, int suppress)

{

	DECL_SPEC ds = DEREF_dspec(id_storage(id));

	DECL_SPEC acc = (ds & dspec_access);

	if (acc) {

		check_access(id, acc);

	}

	if (!(ds & dspec_called)) {

		/* Mark use */

		if (!suppress) {

			if (!(ds & dspec_virtual)) {

				ds |= dspec_used;

			}

			ds |= dspec_called;

			COPY_dspec(id_storage(id), ds);

		}

		/* Check for inheritance */

		if (ds & (dspec_inherit | dspec_alias | dspec_extern)) {

			IDENTIFIER uid = DEREF_id(id_alias(id));

			if (!EQ_id(uid, id)) {

				ds = DEREF_dspec(id_storage(uid));

				if (ds & dspec_called) {

					if (do_usage) {

						dump_call(id, &crt_loc, expl);

					}

					return;

				}

				if (!suppress) {

					if (!(ds & dspec_virtual)) {

						ds |= dspec_used;

					}

					ds |= dspec_called;

					COPY_dspec(id_storage(uid), ds);

				}

			}

		}

		/* Check usage */

		if (ds & dspec_main) {

			HASHID nm = DEREF_hashid(id_name(id));

			if (IS_hashid_name(nm)) {

				/* Can't call 'main' */

				report(crt_loc, ERR_basic_start_main_call(id));

			}

		}

		if (!(ds & dspec_defn) && !suppress) {

			if (ds & dspec_implicit) {

				/* Define implicitly declared function */

				implicit_defn(id, DEFAULT_USR);

				ds = DEREF_dspec(id_storage(id));

			} else if (ds & dspec_instance) {

				/* Define template function */

				if (!(ds & dspec_virtual)) {

					define_template(id, 0);

					ds = DEREF_dspec(id_storage(id));

				}

			}

			if ((ds & dspec_inline) && !(ds & dspec_defn)) {

				/* An inline function called before it is

				 * defined */

				report(crt_loc,

				       ERR_dcl_fct_spec_inline_call(id));

			}

		}

	}

	if (do_usage) {

		dump_call(id, &crt_loc, expl);

	}

	return;

}

/*

    MARK A VIRTUAL FUNCTION AS BEING USED

    Note that use_func_id does not mark virtual functions as having been

    used because the actual function called can only be determined at

    run-time.  If subsequently it is found that the function called can

    be determined statically then this routine is called to mark that

    function as having been used.  It is also used in certain similar

    situations.

*/

void

reuse_id(IDENTIFIER id, int suppress)

{

	DECL_SPEC ds = DEREF_dspec(id_storage(id));

	if (!(ds & dspec_used) && !suppress) {

		ds |= dspec_used;

		COPY_dspec(id_storage(id), ds);

		if (!(ds & dspec_defn)) {

			if (ds & dspec_implicit) {

				/* Define implicitly declared function */

				implicit_defn(id, DEFAULT_USR);

			} else if (ds & dspec_instance) {

				/* Instantiate template functions */

				define_template(id, 0);

			}

		}

	}

	return;

}

/*

    DEFINE AN IDENTIFIER ALIAS

    This routine is called if the function or variable id is defined

    (excluding tentative definitions).  It passes the definition on to

    any alias of id.

*/

void

define_id(IDENTIFIER id)

{

	IDENTIFIER lid = DEREF_id(id_alias(id));

	if (!EQ_id(lid, id)) {

		/* Check for previous definition */

		LOCATION loc;

		DECL_SPEC ds;

		DEREF_loc(id_loc(id), loc);

		ds = DEREF_dspec(id_storage(lid));

		if (ds & dspec_defn) {

			EXP e = DEREF_exp(id_variable_etc_init(lid));

			if (IS_NULL_exp(e) || !IS_exp_zero(e)) {

				/* Exclude previous tentative definitions */

				PTR(LOCATION)ploc = id_loc(lid);

				ERROR err = ERR_basic_odr_def(lid, ploc);

				if (ds & dspec_c) {

					/* Explain C linkage identifications */

					HASHID nm = DEREF_hashid(id_name(lid));

					ERROR err2 =

					    ERR_dcl_link_redecl(nm, ploc);

					err = concat_error(err, err2);

				}

				report(loc, err);

			}

		}

		/* Copy definition */

		if (IS_id_function_etc(id)) {

			EXP e = DEREF_exp(id_function_etc_defn(id));

			COPY_exp(id_function_etc_defn(lid), e);

		} else if (IS_id_variable_etc(id)) {

			TYPE t = DEREF_type(id_variable_etc_type(id));

			EXP e = DEREF_exp(id_variable_etc_init(id));

			EXP d = DEREF_exp(id_variable_etc_term(id));

			COPY_exp(id_variable_etc_init(lid), e);

			COPY_exp(id_variable_etc_term(lid), d);

			COPY_type(id_variable_etc_type(lid), t);

		}

		/* Record definition */

		ds |= dspec_defn;

		COPY_dspec(id_storage(lid), ds);

		DEREF_loc(id_loc(lid), loc);

	}

	return;

}

/*

    FIND THE END OF A LIST OF IDENTIFIER ALIASES

    In most cases the alias of an identifier is its underlying meaning,

    however for function parameters it is possible to have vast lists

    of identifiers arising from redeclarations all linked by their alias

    field.  This routine scans down such a list until it finds an identifier

    which is its own alias.

*/

IDENTIFIER

chase_alias(IDENTIFIER id)

{

	while (!IS_NULL_id(id)) {

		IDENTIFIER lid = DEREF_id(id_alias(id));

		if (EQ_id(lid, id)) {

			break;

		}

		id = lid;

	}

	return (id);

}

/*

    CURRENT IDENTIFIER QUALIFIER

    This variable is set to describe how the current identifier is

    qualified.

*/

QUALIFIER crt_id_qualifier = qual_none;

int crt_templ_qualifier = 0;

/*

    CHECK AN IDENTIFIER NAME

    This routine checks whether the identifier name id is suitable for use

    in the context given by loc.  The namespace qualifiers used in describing

    id will be given by crt_id_qualifier.  The routine returns true for

    legal identifiers.

*/

ERROR

check_id_name(IDENTIFIER id, int loc)

{

	/* Check on namespace component */

	ERROR err = NULL_err;

	QUALIFIER cq = crt_id_qualifier;

	switch (cq) {

	case qual_none: {

		/* No namespace specifier */

		if (in_template_decl && is_templ_alias(id)) {

			/* Check for hiding of template parameters */

			err = ERR_temp_local_hide(id);

			if (!IS_NULL_err(err)) {

				return (err);

			}

		}

		if (crt_templ_qualifier) {

			goto qualifier_lab;

		}

		break;

	}

	case qual_nested:

qualifier_lab:

		/* Nested namespace specifier */

		if (loc == CONTEXT_PARAMETER || loc == CONTEXT_TEMPL_PARAM) {

			err = ERR_dcl_meaning_id(cq, id);

			if (!IS_NULL_err(err)) {

				return (err);

			}

		}

		break;

	case qual_full:

	case qual_top:

		/* Namespace specifier beginning with '::' */

		err = ERR_dcl_meaning_full(cq, id);

		if (!IS_NULL_err(err)) {

			return (err);

		}

		goto qualifier_lab;

	}

	/* Check on name component */

	if (loc != CONTEXT_FUNCTION && loc != CONTEXT_FUNC_MEMBER) {

		HASHID nm = DEREF_hashid(id_name(id));

		switch (TAG_hashid(nm)) {

		case hashid_constr_tag:

			/* A constructor must be a member function */

			err = ERR_class_mem_ctor(id);

			break;

		case hashid_destr_tag:

			/* A destructor must be a member function */

			err = ERR_class_dtor_func(nm);

			break;

		case hashid_conv_tag:

		case hashid_op_tag:

			/* These must be functions */

			err = ERR_dcl_meaning_id(cq, id);

			break;

		}

	}

	return (err);

}

/*

    DECLARE AN IMPLICIT FUNCTION

    This routine declares a function named id in the current scope with

    declaration specifiers ds, return type ret (which may be the null type),

    parameter types p (terminated by the null type), and function kind ell.

    It is used to declare implicit functions.

*/

IDENTIFIER

declare_func(DECL_SPEC ds, IDENTIFIER id, TYPE ret, TYPE *p, int ell,

	     LIST(TYPE) ex)

{

	/* Save certain information */

	TYPE t;

	CV_SPEC cv;

	DECL_SPEC acc = crt_access;

	int td = have_type_declaration;

	QUALIFIER cq = crt_id_qualifier;

	int tq = crt_templ_qualifier;

	crt_access = dspec_public;

	crt_id_qualifier = qual_none;

	crt_templ_qualifier = 0;

	have_type_declaration = TYPE_DECL_NONE;

	/* Declare parameters */

	decl_loc = crt_loc;

	begin_param(id);

	while (!IS_NULL_type(*p)) {

		HASHID nm = lookup_anon();

		IDENTIFIER pid = DEREF_id(hashid_id(nm));

		pid = make_param_decl(dspec_none, *p, pid, CONTEXT_PARAMETER);

		init_param(pid, NULL_exp);

		p++;

	}

	if (IS_NULL_type(ret)) {

		ret = type_inferred;

	}

	cv = func_linkage(cv_none);

	t = make_func_type(ret, ell, cv, ex);

	end_param();

	/* Declare the function */

	if (in_class_defn) {

#if LANGUAGE_CPP

		if (ds & dspec_friend) {

			id = make_friend_decl(ds, t, id, 0, 1);

		} else {

			id = make_func_mem_decl(ds, t, id, 0);

		}

#else

		id = make_member_decl(ds, t, id, 0);

#endif

	} else {

		id = make_func_decl(ds, t, id, 0);

	}

	if (do_dump) {

		dump_implicit = 1;

		dump_declare(id, &decl_loc, 0);

	}

	have_type_declaration = td;

	crt_templ_qualifier = tq;

	crt_id_qualifier = cq;

	crt_access = acc;

	return (id);

}

/*

    IMPLICITLY DECLARE AN IDENTIFIER

    This routine implicitly declares an identifier id, either as a local

    variable, if fn is false, or as a function.  fn will be 2 in the cases

    where C allows an implicit function declaration.  The routine returns

    the corresponding identifier expression.

*/

EXP

implicit_id_exp(IDENTIFIER id, int fn)

{

	EXP e;

	ERROR err;

	LOCATION loc;

	DECL_SPEC ds;

	IDENTIFIER pid;

	DECL_SPEC cl = crt_linkage;

	QUALIFIER cq = crt_id_qualifier;

	int tq = crt_templ_qualifier;

	NAMESPACE cns = crt_namespace;

	HASHID nm = DEREF_hashid(id_name(id));

	NAMESPACE ns = DEREF_nspace(id_parent(id));

	/* Check for implicit function declarations */

	if (fn == 2 && option(OPT_func_impl) == OPTION_DISALLOW) {

		fn = 1;

	}

	/* Allow for template dependent declarations */

	if (in_template_decl && is_templ_nspace(cns)) {

		int opt = OPT_templ_undecl;

		OPTION sev = option(opt);

		if (sev != OPTION_ALLOW) {

			/* Implicit declarations for dependent identifiers */

			if (dependent_id(id)) {

				opt = OPT_none;

				sev = OPTION_ALLOW;

			}

		}

		if (sev != OPTION_DISALLOW) {

			if (sev != OPTION_ALLOW && fn != 2) {

				if (cq == qual_none) {

					err = ERR_lookup_unqual_undef(nm);

				} else {

					err = ERR_lookup_qual_undef(nm, ns);

				}

				err = set_severity(err, opt, 0);

				report(crt_loc, err);

			}

			MAKE_exp_undeclared(type_templ_param, id, cq, e);

			return (e);

		}

		if (cq == qual_none) {

			ns = NULL_nspace;

		}

	}

	/* Check for previous declaration */

	if (IS_NULL_nspace(ns)) {

		OPTION sev = option(OPT_decl_unify);

		if (sev != OPTION_OFF) {

			LIST(IDENTIFIER)p;

			NAMESPACE pns = nonblock_namespace;

			p = DEREF_list(nspace_named_etc_extra(pns));

			pid = unify_extern(id, NULL_type, pns, p);

			if (!IS_NULL_id(pid)) {

				if (sev != OPTION_ON) {

					err = ERR_lookup_unqual_vis(pid);

					err = set_severity(err, OPT_decl_unify,

							   0);

					report(crt_loc, err);

				}

				e = make_id_exp(pid);

				return (e);

			}

		}

		ns = cns;

	}

	/* Rescan identifier */

	pid = search_id(ns, nm, 0, 0);

	if (!IS_NULL_id(pid)) {

		switch (TAG_id(pid)) {

		case id_variable_tag:

		case id_function_tag: {

			e = make_id_exp(pid);

			return (e);

		}

		}

	}

	/* Find namespace for declaration */

	crt_linkage = dspec_c;

	crt_id_qualifier = qual_none;

	crt_templ_qualifier = 0;

	push_namespace(ns);

	bad_crt_loc++;

	loc = crt_loc;

	if (crt_state_depth == 0) {

		/* Find identifier location */

		IDENTIFIER uid = underlying_id(id);

		DEREF_loc(id_loc(uid), crt_loc);

	}

	if (fn) {

		/* Implicit functions declarations */

		int ell;

		TYPE ret = type_sint;

		TYPE pars = NULL_type;

#if LANGUAGE_CPP

		/* Type is 'int ( ... )' in C++ */

		ell = FUNC_ELLIPSIS;

		if (fn == 1) {

			ret = type_error;

		}

#else

		/* Type is 'int ()' in C */

		ell = FUNC_NO_PARAMS;

#endif

		ds = (dspec_extern | dspec_ignore);

		id = declare_func(ds, id, ret, &pars, ell, empty_type_set);

	} else {

		/* Other implicit declarations */

		decl_loc = crt_loc;

		id = make_object_decl(dspec_none, type_error, id, 0);

		IGNORE init_object(id, NULL_exp);

	}

	/* Report error */

	crt_linkage = cl;

	crt_templ_qualifier = tq;

	crt_id_qualifier = cq;

	if (fn == 2) {

		pid = DEREF_id(id_alias(id));

		ds = DEREF_dspec(id_storage(pid));

		if (ds & dspec_temp) {

			/* Implicit declaration already reported */

			err = NULL_err;

		} else {

			err = ERR_expr_call_undecl(id);

			if (!IS_NULL_err(err)) {

				ds |= dspec_temp;

				COPY_dspec(id_storage(pid), ds);

			}

		}

	} else if (cq == qual_none) {

		err = ERR_lookup_unqual_undef(nm);

	} else {

		err = ERR_lookup_qual_undef(nm, ns);

	}

	report(crt_loc, err);

	/* Construct the result */

	crt_loc = loc;

	bad_crt_loc--;

	IGNORE pop_namespace();

	e = make_id_exp(id);

	return (e);

}

/*

    LIST OF MEANINGS

    This list is built up by list_ambiguous to give all the meanings of

    its ambiguous identifier which match its type argument.

*/

static LIST(IDENTIFIER) ambig_meanings = NULL_list(IDENTIFIER);

/*

    LIST MEANINGS OF AN AMBIGUOUS IDENTIFIER

    This routine adds all meanings of the ambiguous identifier id to the

    error list err.

*/

static unsigned

list_ambiguous(IDENTIFIER id, unsigned n, ERROR *err, int type, int rec)

{

	if (!IS_NULL_id(id)) {

		switch (TAG_id(id)) {

		case id_ambig_tag: {

			/* Ambiguous identifiers */

			LIST(IDENTIFIER) p = DEREF_list(id_ambig_ids(id));

			rec = DEREF_int(id_ambig_over(id));

			while (!IS_NULL_list(p)) {

				id = DEREF_id(HEAD_list(p));

				n = list_ambiguous(id, n, err, type, rec);

				p = TAIL_list(p);

			}

			break;

		}

		case id_function_tag:

		case id_mem_func_tag:

		case id_stat_mem_func_tag: {

			/* Functions */

			if (rec) {

				IDENTIFIER over;

				over = DEREF_id(id_function_etc_over(id));

				n = list_ambiguous(over, n, err, type, rec);

			}

			goto default_lab;

		}

		case id_class_name_tag:

		case id_class_alias_tag:

		case id_enum_name_tag:

		case id_enum_alias_tag:

		case id_type_alias_tag: {

			/* Types */

			type = 0;

			goto default_lab;

		}

		default:

default_lab: {

		     /* Other identifiers */

		     PTR(LOCATION) loc = id_loc(id);

		     n++;

		     add_error(err, ERR_fail_list_item(n, id, loc));

		     break;

	     }

		}

		if (type == 0) {

			/* Add to list of meanings */

			CONS_id(id, ambig_meanings, ambig_meanings);

		}

	}

	return (n);

}

/*

    REPORT AN AMBIGUOUS IDENTIFIER

    This routine reports the identifier id as being ambiguous.  Overloaded

    functions count as a single identifier unless rec is true.  It returns

    one of the possible meanings.  Only types are considered if type is

    true.  If there is exactly one possible meaning or force is true the

    first meaning is returned.  Otherwise the null identifier is returned.

*/

IDENTIFIER

report_ambiguous(IDENTIFIER id, int type, int rec, int force)

{

	ERROR err, err2;

	LIST(IDENTIFIER) p;

	NAMESPACE ns = DEREF_nspace(id_parent(id));

	/* List all meanings */

	if (!IS_NULL_nspace(ns) && IS_nspace_ctype(ns)) {

		err = ERR_lookup_ambig_mem(id);

	} else {

		err = ERR_lookup_ambig_id(id);

	}

	err2 = ERR_lookup_ambig_list();

	if (!IS_NULL_err(err2)) {

		unsigned n = 0;

		err = concat_error(err, err2);

		n = list_ambiguous(id, n, &err, type, rec);

		err = concat_error(err, ERR_fail_list_end(n));

	}

	report(crt_loc, err);

	/* Check for resolved meaning */

	id = NULL_id;

	p = ambig_meanings;

	if (!IS_NULL_list(p)) {

		if (IS_NULL_list(TAIL_list(p)) || force) {

			id = DEREF_id(HEAD_list(p));

		}

		DESTROY_list(p, SIZE_id);

		ambig_meanings = NULL_list(IDENTIFIER);

	}

	return (id);

}

/*

    FIND THE DECLARATION SPECIFIER FOR AN AMBIGUOUS IDENTIFIER

    This routine finds the declaration specifier for an ambiguous identifier

    given by the list of cases pids.  This consists of various properties

    which all the cases share.

*/

DECL_SPEC

find_ambig_dspec(LIST(IDENTIFIER) pids)

{

	DECL_SPEC ds = (dspec_implicit | dspec_template);

	while (!IS_NULL_list(pids)) {

		IDENTIFIER pid = DEREF_id(HEAD_list(pids));

		if (!IS_NULL_id(pid)) {

			DECL_SPEC pds = DEREF_dspec(id_storage(pid));

			ds &= pds;

		}

		pids = TAIL_list(pids);

	}

	return (ds);

}

/*

    CREATE AN IDENTIFIER EXPRESSION

    This routine creates an expression corresponding to the identifier id.

    Note that static member functions are identifier expressions if they

    are not overloaded, but member expression otherwise.  They are sorted

    out properly during overload resolution (see resolve_cast).

*/

EXP

make_id_exp(IDENTIFIER id)

{

	EXP e;

	unsigned tag = TAG_id(id);

	QUALIFIER cq = crt_id_qualifier;

	switch (tag) {

	case id_variable_tag:

	case id_parameter_tag: {

		/* Variables and parameters */