/*Build expressions with Pascal type checking.

  Copyright (C) 1987-2004 Free Software Foundation, Inc.

  Authors: Jukka Virtanen <jtv@hut.fi>
           Peter Gerwinski <peter@gerwinski.de>
           Frank Heckenbach <frank@pascal.gnu.de>
           Waldek Hebisch <hebisch@math.uni.wroc.pl>

  Parts of this file were originally derived from GCC's `c-typeck.c'.

  This file is part of GNU Pascal.

  GNU Pascal is free software; you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published
  by the Free Software Foundation; either version 2, or (at your
  option) any later version.

  GNU Pascal is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with GNU Pascal; see the file COPYING. If not, write to the
  Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
  02111-1307, USA. */

#include "gpc.h"

static int compatible_assignment_p PARAMS ((tree, tree));
static tree decl_constant_value PARAMS ((tree));
static int is_discriminant_of PARAMS ((tree, tree));
static tree fold_b PARAMS ((tree));
static tree re_fold PARAMS ((tree, tree, int *));
static tree re_layout_type PARAMS ((tree, tree));
static void assignment_error_or_warning PARAMS ((const char *, const char *, tree, int, int));
static void push_string PARAMS ((const char *));
static void push_member_name PARAMS ((tree));
static void push_array_index PARAMS ((int));
static char *print_spelling PARAMS ((void));
static const char *get_spelling PARAMS ((const char *));
static void initializer_error PARAMS ((const char *, const char *));
static void process_init_list PARAMS ((tree));
static void really_start_incremental_init PARAMS ((tree));
static void push_init_level PARAMS ((void));
static tree build_bitfields_type PARAMS ((tree, int));
static tree do_build_constructor_rev PARAMS ((tree, tree));
static tree fill_one_record PARAMS ((tree *, tree, tree, tree *, HOST_WIDE_INT, HOST_WIDE_INT *));
static tree fake_packed_array_constructor PARAMS ((void));
static tree pop_init_level PARAMS ((void));
static void set_init_index PARAMS ((tree, tree, tree));
static void set_init_label PARAMS ((tree));
static void set_init_variant PARAMS ((tree));
static void process_otherwise PARAMS ((tree));
static void output_init_element PARAMS ((tree, tree, tree, int));
static void output_pending_init_elements PARAMS ((int));
static void process_init_element PARAMS ((tree));

void
cstring_inform ()
{
  static int informed = 0;
  if (!informed)
    {
      informed = 1;
      error (" (Use `--cstrings-as-strings' to treat `CString' as a string.)");
    }
}

void
ptrarith_inform ()
{
  static int informed = 0;
  if (!informed)
    {
      informed = 1;
      error (" (Use `--pointer-arithmetic' to enable pointer arithmetic.)");
    }
}

/* Do `exp = require_complete_type (exp);' to make sure exp
   does not have an incomplete type. (That includes void types.) */
tree
require_complete_type (value)
     tree value;
{
  tree type = TREE_TYPE (value);
  CHK_EM (type);
  /* First, detect a valid value with a complete type. */
  if (TYPE_SIZE (type) && TREE_CODE (type) != VOID_TYPE)
    return value;
  incomplete_type_error (value, type);
  return error_mark_node;
}

/* Print an error message for invalid use of an incomplete type.
   VALUE is the expression that was used (or 0 if that isn't known)
   and TYPE is the type that was invalid. */
void
incomplete_type_error (value, type)
     tree value;
     tree type;
{
  /* Avoid duplicate error message. */
  if (EM (type))
    return;
  while (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
    type = TREE_TYPE (type);
  if (value && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == PARM_DECL))
    error ("`%s' has an incomplete type", IDENTIFIER_NAME (DECL_NAME (value)));
  else if (TREE_CODE (type) == VOID_TYPE)
    error ("invalid use of void expression");
  else if (TREE_CODE (type) == ARRAY_TYPE)
    error ("invalid use of array with unspecified bounds");
  else if (TREE_CODE (type) == LANG_TYPE)
    error ("invalid use of forward declared type");
  else
    assert (0);
}

/* Return the common type of two types.
   We assume that comptypes has already been done and returned 1;
   if that isn't so, this may crash. In particular, we assume that qualifiers match.
   This is the type for the result of most arithmetic operations
   if the operands have the given two types. */
tree
common_type (t1, t2)
     tree t1, t2;
{
  enum tree_code code1, code2;
  tree attributes, tmp;
  int prec;

  /* Extend subranges of ordinal types to their full types.
     Otherwise, operations leaving the range won't work. */
  while (ORDINAL_TYPE (TREE_CODE (t1)) && TREE_TYPE (t1))
    t1 = TREE_TYPE (t1);
  while (ORDINAL_TYPE (TREE_CODE (t2)) && TREE_TYPE (t2))
    t2 = TREE_TYPE (t2);

  /* Save time if the two types are the same. */
  if (t1 == t2)
    return t1;

  /* If one type is nonsense, use the other. */
  if (EM (t1))
    return t2;
  if (EM (t2))
    return t1;

  /* Merge the attributes */
  attributes = merge_attributes (TYPE_ATTRIBUTES (t1), TYPE_ATTRIBUTES (t2));

  /* Treat an enum type as the unsigned integer type of the same width. */
  if (TREE_CODE (t1) == ENUMERAL_TYPE)
    t1 = type_for_size (TYPE_PRECISION (t1), 1);
  if (TREE_CODE (t2) == ENUMERAL_TYPE)
    t2 = type_for_size (TYPE_PRECISION (t2), 1);

  code1 = TREE_CODE (t1);
  code2 = TREE_CODE (t2);

  /* If one type is complex, form the common type of the non-complex
     components, then make that complex. Use T1 or T2 if it is the
     required type. */
  if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
    {
      tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
      tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
      tree subtype = common_type (subtype1, subtype2);

      if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
        return build_type_attribute_variant (t1, attributes);
      else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
        return build_type_attribute_variant (t2, attributes);
      else
        return build_type_attribute_variant (build_complex_type (subtype), attributes);
    }

  switch (code1)
  {
    case INTEGER_TYPE:
    case REAL_TYPE:
      /* If only one is complex, use that for the result type */
      if (code2 == COMPLEX_TYPE)
        return build_type_attribute_variant (t2, attributes);

      /* If only one is real, use it as the result. */
      if (code1 == REAL_TYPE && code2 != REAL_TYPE)
        return build_type_attribute_variant (t1, attributes);
      if (code2 == REAL_TYPE && code1 != REAL_TYPE)
        return build_type_attribute_variant (t2, attributes);

      /* Both real or both integers; use the one with greater precision if signedness allows. */
      if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
        {
          tmp = t1;
          t1 = t2;
          t2 = tmp;
        }
      if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
        {
          if (code1 != REAL_TYPE  /* no sign issues with reals */
              && !TREE_UNSIGNED (t1)  /* small unsigned fits in larger signed or unsigned */
              && TREE_UNSIGNED (t2)  /* small signed or unsigned fits in larger signed */
              && TYPE_PRECISION (t2) < TYPE_PRECISION (long_long_integer_type_node))  /* no way to get larger */
            {
              for (prec = BITS_PER_UNIT; prec <= TYPE_PRECISION (t2); prec *= 2) ;
              t2 = make_signed_type (prec);
            }
          return build_type_attribute_variant (t2, attributes);
        }

      /* Same precision, different signedness */
      if (TREE_UNSIGNED (t1) != TREE_UNSIGNED (t2))
        {
          if (TYPE_PRECISION (t1) == TYPE_PRECISION (long_long_unsigned_type_node))
            return build_type_attribute_variant (long_long_unsigned_type_node, attributes);
          else
            {
              for (prec = BITS_PER_UNIT; prec <= TYPE_PRECISION (t2); prec *= 2) ;
              return build_type_attribute_variant (make_signed_type (prec), attributes);
            }
        }

      /* Same precision. Prefer longs to ints even when same size. */
      if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
          || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
        return build_type_attribute_variant (long_unsigned_type_node, attributes);

      if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
          || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
        {
          /* But preserve unsignedness from the other type,
             since long cannot hold all the values of an unsigned int. */
          if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
             t1 = long_unsigned_type_node;
          else
             t1 = long_integer_type_node;
          return build_type_attribute_variant (t1, attributes);
        }

      /* Likewise, prefer long double to double even if same size. */
      if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
          || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
        return build_type_attribute_variant (long_double_type_node, attributes);

      /* Otherwise prefer the unsigned one. */

      if (TREE_UNSIGNED (t1))
        return build_type_attribute_variant (t1, attributes);
      else
        return build_type_attribute_variant (t2, attributes);

    /* Since comptypes checks that code2 is ok, return this. */
    case COMPLEX_TYPE:
      return build_type_attribute_variant (t1, attributes);

    case SET_TYPE:
      return build_type_attribute_variant (t1, attributes);

    case POINTER_TYPE:
      /* For two pointers, do this recursively on the target type,
         and combine the qualifiers of the two types' targets. */
      {
        tree target = common_type (TYPE_MAIN_VARIANT (TREE_TYPE (t1)), TYPE_MAIN_VARIANT (TREE_TYPE (t2)));
        int constp = TYPE_READONLY (TREE_TYPE (t1)) || TYPE_READONLY (TREE_TYPE (t2));
        int volatilep = TYPE_VOLATILE (TREE_TYPE (t1)) || TYPE_VOLATILE (TREE_TYPE (t2));
        t1 = build_pointer_type (c_build_type_variant (target, constp, volatilep));
        return build_type_attribute_variant (t1, attributes);
      }

    case ARRAY_TYPE:
      {
        tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
        /* Save space: see if the result is identical to one of the args. */
        if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
          return build_type_attribute_variant (t1, attributes);
        if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
          return build_type_attribute_variant (t2, attributes);
        /* Merge the element types, and have a size if either arg has one. */
        t1 = build_simple_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
        return build_type_attribute_variant (t1, attributes);
      }

    case FUNCTION_TYPE:
      /* Function types: merge the arg types and result types. */
      {
        tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
        tree p1 = TYPE_ARG_TYPES (t1);
        tree p2 = TYPE_ARG_TYPES (t2);
        tree newargs, n;
        int len, i;
        assert (p1 && p2);

        /* Save space: see if the result is identical to one of the args. */
        if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
          return build_type_attribute_variant (t1, attributes);
        if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
          return build_type_attribute_variant (t2, attributes);

        /* If both args specify argument types, we must merge the two
           lists, argument by argument. */
        len = list_length (p1);
        newargs = 0;
        for (i = 0; i < len; i++)
          newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);

        n = newargs;

        for (; p1; p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
          {
            /* In Pascal, both types must have been specified. */
            assert (TREE_VALUE (p1) && TREE_VALUE (p2));

            /* Take the first type and avoid a recursive call to common_type() which does too much.
               For compatible function types, these must match anyway. @@ re-check it here
               (@@ Maybe it would be better to let common_type() do less?) */
            TREE_VALUE (n) = TREE_VALUE (p1);
          }

        t1 = build_function_type (valtype, newargs);
        /* FALLTHROUGH */
      }

    default:
      return build_type_attribute_variant (t1, attributes);
  }

}

/* Return 1 if TYPE1 and TYPE2 are compatible for some operations. */
int
comptypes (t1, t2)
     tree t1, t2;
{
  tree base1, base2;

  if (t1 == t2 || EM (t1) || EM (t2))
    return 1;

  /* Different classes of types can't be compatible. */
  if (TREE_CODE (t1) != TREE_CODE (t2))
    return 0;

  if ((TREE_CODE (t1) == ARRAY_TYPE || TREE_CODE (t1) == RECORD_TYPE)
      && PASCAL_TYPE_PACKED (t1) != PASCAL_TYPE_PACKED (t2))
    return 0;

  /* Qualifiers must match. */
#if 0  /* Nope -- only target (if assignment) must not be readonly, but
          this should have been checked elsewhere. -- Frank */
  if (TYPE_READONLY (t1) != TYPE_READONLY (t2))
    return 0;
#endif
  if (TYPE_VOLATILE (t1) != TYPE_VOLATILE (t2))
    return 0;

  if ((PASCAL_TYPE_STRING (t1) || PASCAL_TYPE_SCHEMA (t1)) && TYPE_LANG_BASE (t1))
    base1 = TYPE_MAIN_VARIANT (TYPE_LANG_BASE (t1));
  else
    base1 = base_type (t1);
  if ((PASCAL_TYPE_STRING (t2) || PASCAL_TYPE_SCHEMA (t2)) && TYPE_LANG_BASE (t2))
    base2 = TYPE_MAIN_VARIANT (TYPE_LANG_BASE (t2));
  else
    base2 = base_type (t2);
  if (base1 == base2)
    return 1;

  switch (TREE_CODE (t1))
  {
    case INTEGER_TYPE:  /* All integer types are compatible. */
    case CHAR_TYPE:     /* All char types are compatible. */
    case BOOLEAN_TYPE:  /* All Boolean types are compatible. */
      return 1;

    /* @@@@ Check sets more. */
    case SET_TYPE:
      return TREE_TYPE (t1) == TREE_TYPE (t2)
             || t1 == empty_set_type_node
             || t2 == empty_set_type_node
             || comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (t1)), TYPE_MAIN_VARIANT (TREE_TYPE (t2)));

    case POINTER_TYPE:
    case REFERENCE_TYPE:
      return TREE_TYPE (t1) == TREE_TYPE (t2)
             || TREE_TYPE (t1) == void_type_node
             || TREE_TYPE (t2) == void_type_node
             || comptypes (TREE_TYPE (t1), TREE_TYPE (t2));

    case FUNCTION_TYPE:
      {
        tree args1, args2;
        if (!strictly_comp_types (TREE_TYPE (t1), TREE_TYPE (t2)))
          return 0;
        for (args1 = TYPE_ARG_TYPES (t1), args2 = TYPE_ARG_TYPES (t2); args1 && args2;
             args1 = TREE_CHAIN (args1), args2 = TREE_CHAIN (args2))
          {
            /* @@ Should probably be done in strictly_compare_types (see comment there). */
            if (   TREE_CODE (TREE_VALUE (args1)) == REFERENCE_TYPE
                && TREE_CODE (TREE_VALUE (args2)) == REFERENCE_TYPE
                && TYPE_READONLY (TREE_TYPE (TREE_VALUE (args1))) != TYPE_READONLY (TREE_TYPE (TREE_VALUE (args2))))
              return 0;
            if (!strictly_comp_types (TREE_VALUE (args1), TREE_VALUE (args2)))
              return 0;
          }
        return !args1 && !args2;
      }

    case RECORD_TYPE:
      return (   (TREE_CODE (t1) == CHAR_TYPE || is_of_string_type (t1, 1))
              && (TREE_CODE (t2) == CHAR_TYPE || is_of_string_type (t2, 1)))
             || (PASCAL_TYPE_ANYFILE (t1) && PASCAL_TYPE_FILE (t2));

    default:
      break;
  }
  return 0;
}

/* Return 1 if TYPE1 and TYPE2 are equivalent types, ignoring their qualifiers. */
int
strictly_comp_types (type1, type2)
     tree type1, type2;
{
  tree base1, base2;

  if (type1 == type2 || EM (type1) || EM (type2))
    return 1;

  if (TREE_CODE (type1) != TREE_CODE (type2))
    return 0;

  /* Qualifiers must match. */
#if 0
  /* @@ Hmm ... well, this depends. For formal and actual arguments,
        readonlyness does not have to match, but for comparing pointer
        types, it should. This whole type-checking must be completely
        reorganized. -- Frank */
  if (TYPE_READONLY (type1) != TYPE_READONLY (type2))
    return 0;
#endif

  /* In FUNCTION_TYPES, TYPE_VOLATILE has a different meaning. @@ Must check this better. */
  if (TREE_CODE (type1) != FUNCTION_TYPE && TYPE_VOLATILE (type1) != TYPE_VOLATILE (type2))
    return 0;

  /* Conformant and open arrays */
  if (TREE_CODE (type1) == ARRAY_TYPE
      /* @@ Ignore packing for char arrays (where it has no real effect,
            anyway), so string constants are compatible with unpacked
            arrays of char (fjf655b.pas). Maybe this is too general, but
            the information if this is a string constant is not available
            here I think since we only have the types. -- Frank */
      && (PASCAL_TYPE_PACKED (type1) == PASCAL_TYPE_PACKED (type2)
          || TREE_CODE (TREE_TYPE (type1)) == CHAR_TYPE)
      && (PASCAL_TYPE_OPEN_ARRAY (type1)
          || PASCAL_TYPE_OPEN_ARRAY (type2)
          || (PASCAL_TYPE_CONFORMANT_ARRAY (type1)
              && comptypes (TYPE_DOMAIN (type1), TREE_TYPE (TYPE_MIN_VALUE (TYPE_DOMAIN (type2)))))
          || (PASCAL_TYPE_CONFORMANT_ARRAY (type2)
              && comptypes (TYPE_DOMAIN (type2), TREE_TYPE (TYPE_MIN_VALUE (TYPE_DOMAIN (type1))))))
      && strictly_comp_types (TREE_TYPE (type1), TREE_TYPE (type2)))
    return 1;

  base1 = type1;
  base2 = type2;
  /* An undiscriminated schema or string is compatible with both an
     undiscriminated and a discriminated one of the same base type,
     but two discriminated ones are generally not compatible. */
  if (   (PASCAL_TYPE_STRING (type1) && PASCAL_TYPE_STRING (type2)
          && !(PASCAL_TYPE_DISCRIMINATED_STRING (type1) || PASCAL_TYPE_DISCRIMINATED_STRING (type2)))
      || (PASCAL_TYPE_SCHEMA (type1) && PASCAL_TYPE_SCHEMA (type2)
          && !(PASCAL_TYPE_DISCRIMINATED_SCHEMA (type1) || PASCAL_TYPE_DISCRIMINATED_SCHEMA (type2))))
    {
      if (TYPE_LANG_BASE (type1))
        base1 = TYPE_LANG_BASE (type1);
      if (TYPE_LANG_BASE (type2))
        base2 = TYPE_LANG_BASE (type2);
    }

  base1 = TYPE_MAIN_VARIANT (base1);
  base2 = TYPE_MAIN_VARIANT (base2);
  if (base1 == base2)
    return 1;
  if ((TREE_CODE (type1) == REFERENCE_TYPE)
      /* @@ The following case occurs (e.g.?) when comparing the
            argument lists of functions (forward declarations etc.)
            which contain a pointer to an undiscriminated schema
            type (fjf604.pas). It might seem somewhat kludgy having
            to handle this here, but I'm not sure ...
            Note, don't call this function recursively for *all*
            pointers! This might lead to endless loops with recursive
            types, and result in too weak pointer type checking. For
            references (above) it doesn't seem an issue because there
            are no nested references in Pascal (AFAIK). -- Frank */
      || (   TREE_CODE (type1) == POINTER_TYPE
          && TREE_CODE (type2) == POINTER_TYPE
          && PASCAL_TYPE_SCHEMA (TREE_TYPE (type1))
          && PASCAL_TYPE_SCHEMA (TREE_TYPE (type2))))
    return strictly_comp_types (TREE_TYPE (type1), TREE_TYPE (type2));
  return TREE_CODE (base1) == FUNCTION_TYPE && comptypes (base1, base2);
}

/* Return 1 if TTL and TTR are pointers to types that are equivalent,
   ignoring their qualifiers. */
int
comp_target_types (ttl, ttr)
     tree ttl, ttr;
{
  return TYPE_MAIN_VARIANT (ttl) == TYPE_MAIN_VARIANT (ttr)
         || (PASCAL_TYPE_ANYFILE (TREE_TYPE (ttl))
             && PASCAL_TYPE_FILE (TREE_TYPE (ttr)))
         || strictly_comp_types (TREE_TYPE (ttl), TREE_TYPE (ttr));
}

/* Return 1 if two pointers to objects are assignment compatible;
   This is the case if rhs has the same type as lhs or if it
   has the type of lhs as a parent type. Otherwise return 0. */
int
comp_object_or_schema_pointer_types (lhs, rhs)
     tree lhs, rhs;
{
  tree r;
  if (lhs == rhs || EM (lhs) || EM (rhs))
    return 1;
  else if ((PASCAL_TYPE_DISCRIMINATED_STRING (lhs) && PASCAL_TYPE_DISCRIMINATED_STRING (rhs))
           || (PASCAL_TYPE_DISCRIMINATED_SCHEMA (lhs) && PASCAL_TYPE_DISCRIMINATED_SCHEMA (rhs)))
    {
      if (TYPE_MAIN_VARIANT (lhs) == TYPE_MAIN_VARIANT (rhs))
        return 1;
    }
  else if ((PASCAL_TYPE_STRING (lhs) && PASCAL_TYPE_STRING (rhs))
           || (PASCAL_TYPE_SCHEMA (lhs) && PASCAL_TYPE_SCHEMA (rhs)))
    {
      if (TYPE_LANG_BASE (lhs))
        lhs = TYPE_LANG_BASE (lhs);
      if (TYPE_LANG_BASE (rhs))
        rhs = TYPE_LANG_BASE (rhs);
      if (TYPE_MAIN_VARIANT (lhs) == TYPE_MAIN_VARIANT (rhs))
        return 1;
    }
  else if (PASCAL_TYPE_OBJECT (lhs) && PASCAL_TYPE_OBJECT (rhs))
    for (r = rhs; r; r = TYPE_LANG_BASE (r))
      if (TYPE_MAIN_VARIANT (lhs) == TYPE_MAIN_VARIANT (r))
        return 1;
  return 0;
}

/* Return either DECL or its known constant value (if it has one). */
static tree
decl_constant_value (decl)
     tree decl;
{
  if (/* Don't change a variable array bound or initial value to a constant
         in a place where a variable is invalid. */
      current_function_decl
      && !TREE_THIS_VOLATILE (decl)
      && TREE_READONLY (decl)
      && DECL_INITIAL (decl)
      && !EM (DECL_INITIAL (decl))
      /* This is invalid if initial value is not constant.
         If it has either a function call, a memory reference,
         or a variable, then re-evaluating it could give different results. */
      && TREE_CONSTANT (DECL_INITIAL (decl))
      /* Check for cases where this is sub-optimal, even though valid. */
      && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR
      && DECL_MODE (decl) != BLKmode)
    return DECL_INITIAL (decl);
  return decl;
}

/* Perform default promotions for values used in expressions.
   Ordinal values are converted to integer. */
tree
default_conversion (exp)
     tree exp;
{
  tree type = TREE_TYPE (exp), orig_exp;
  enum tree_code code = TREE_CODE (type);

  /* CONST_DECLs shouldn't get here */
  assert (TREE_CODE (exp) != CONST_DECL);
#if 0
  /* Constants can be used directly. */
  if (TREE_CODE (exp) == CONST_DECL)
    exp = DECL_INITIAL (exp);
  else
#endif

  /* Replace a nonvolatile const static variable with its value unless
     it is an array, in which case we must be sure that taking the
     address of the array produces consistent results.
     @@ Why only for arrays? -- Frank */
  if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
    {
      exp = decl_constant_value (exp);
      type = TREE_TYPE (exp);
    }

  /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as an lvalue.
     Do not use STRIP_NOPS here! It will remove conversions from pointer
     to integer and cause infinite recursion. */
  orig_exp = exp;
  while (TREE_CODE (exp) == NON_LVALUE_EXPR
         || (TREE_CODE (exp) == NOP_EXPR && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
    exp = TREE_OPERAND (exp, 0);
  if (HAS_EXP_ORIGINAL_CODE_FIELD (orig_exp) && HAS_EXP_ORIGINAL_CODE_FIELD (exp))
    SET_EXP_ORIGINAL_CODE (exp, EXP_ORIGINAL_CODE (orig_exp));

  /* Normally convert enums to integer, but convert wide enums to something wider. */
  if (ORDINAL_TYPE (code))
    return convert (type_for_size (MAX (TYPE_PRECISION (type), TYPE_PRECISION (pascal_integer_type_node)),
      (TYPE_PRECISION (type) >= TYPE_PRECISION (pascal_integer_type_node) && TREE_UNSIGNED (type))), exp);

  if (code == VOID_TYPE)
    {
      error ("statement used as an expression");
      return error_mark_node;
    }
  /* @@@ Note: Now that the reference type works in the backend,
     maybe I should re-implement var parameter code once more. */
  /* Get rid of var parameter REFERENCE_TYPE */
  if (code == REFERENCE_TYPE)
    return convert (build_pointer_type (TREE_TYPE (type)), exp);
  return exp;
}

/* Convert ARRAY_TYPE to POINTER_TYPE.
   This code is equivalent to the code for C-arrays in default_conversion () above. */
tree
convert_array_to_pointer (exp)
     tree exp;
{
  tree type = TREE_TYPE (exp), adr, ptrtype, restype = TREE_TYPE (type);
  int constp = TYPE_READONLY (type), volatilep = TYPE_VOLATILE (type);
  assert (TREE_CODE (type) == ARRAY_TYPE);

  if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp))
    {
      constp |= TREE_READONLY (exp);
      volatilep |= TREE_THIS_VOLATILE (exp);
    }

  if (constp || volatilep)
    restype = c_build_type_variant (restype, constp, volatilep);

  ptrtype = build_pointer_type (restype);

  if (TREE_CODE (exp) == INDIRECT_REF)
    return convert (ptrtype, TREE_OPERAND (exp, 0));

  if (TREE_CODE (exp) == COMPOUND_EXPR)
    {
      tree op1 = default_conversion (TREE_OPERAND (exp, 1));
      return build (COMPOUND_EXPR, TREE_TYPE (op1), TREE_OPERAND (exp, 0), op1);
    }

  if (!lvalue_p (exp) && !(TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
    {
      error ("invalid use of non-lvalue array");
      return error_mark_node;
    }

  if (TREE_CODE (exp) == VAR_DECL)
    {
      /* @@ This is not really quite correct in that the type of the
            operand of ADDR_EXPR is not the target type of the type
            of the ADDR_EXPR itself.
            Question is, can this lossage be avoided? */
      adr = build1 (ADDR_EXPR, ptrtype, exp);
      if (!mark_addressable (exp))
        return error_mark_node;
      TREE_CONSTANT (adr) = staticp (exp);
      TREE_SIDE_EFFECTS (adr) = 0;  /* Default would be, same as EXP. */
      return adr;
    }
  /* This way is better for a COMPONENT_REF since it can
     simplify the offset for a component. */
  return convert (ptrtype, build_unary_op (ADDR_EXPR, exp, 1));
}

static int
compatible_assignment_p (type0, type1)
    tree type0, type1;
{
  enum tree_code code0 = TREE_CODE (type0), code1;
  /* For things like fjf750a.pas. */
  while (PASCAL_TYPE_SCHEMA (type1))
    type1 = TREE_TYPE (TREE_VALUE (find_field (type1, schema_id, 1)));
  code1 = TREE_CODE (type1);
  if (code0 == ENUMERAL_TYPE || code1 == ENUMERAL_TYPE)
    return comptypes (type0, type1);
  else if (TYPE_MAIN_VARIANT (type0) == cstring_type_node && is_of_string_type (type1, 0))
    return 1;
  else
    return code0 == code1
           || (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
           || (code0 == COMPLEX_TYPE && (code1 == REAL_TYPE || code1 == INTEGER_TYPE));
}

/* Convert the argument expressions in the list VALUES
   to the types in the list TYPELIST. The result is a list of converted
   argument expressions. This is also where warnings about wrong number
   of args are generated.

   Pascal conformant array convention:

   An even number of array bounds are passed immediately preceding the
   conformant array parameter.
   The formal parameter decl TYPE nodes have the flag PASCAL_TYPE_CONFORMANT
   set if they are part of a conformant array parameter. One conformant array
   parameter consists of the indices, followed by one or more array_type
   parameters (value/var) that have the same indices and the same type.

   It is an error if the PASCAL_TYPE_CONFORMANT is set for other parameters
   or if the array parameter with this bit set is not preceded by
   another array with this bit set, or an even number of indices with
   this bit set. */
tree
convert_arguments (typelist, values, fundecl)
     tree typelist, values, fundecl;
{
  tree typetail, valtail, result = NULL_TREE, keep_this_val = NULL_TREE, kept_length = NULL_TREE;
  int parmnum, conf_array_bounds = 0;

  /* Scan the given expressions and types, producing individual
     converted arguments and pushing them on RESULT in reverse order. */
  for (valtail = values, typetail = typelist, parmnum = !(fundecl && PASCAL_METHOD (fundecl));
       valtail;
       valtail = keep_this_val ? valtail : TREE_CHAIN (valtail), parmnum += !keep_this_val)
    {
      tree type = typetail ? TREE_VALUE (typetail) : 0;
      tree val = TREE_VALUE (valtail);
      int const_parm = type && PASCAL_CONST_PARM (type);

      if (type && EM (type))
        return error_mark_node;
      if (type == void_type_node)
        {
          if (fundecl && DECL_NAME (fundecl))
            {
              error ("too many arguments to routine `%s'", IDENTIFIER_NAME (DECL_NAME (fundecl)));
              error_with_decl (fundecl, " routine declaration");
            }
          else
            error ("too many arguments to routine");
          break;
        }

      /* Strip NON_LVALUE_EXPRs unless this is a `var' parameter. */
      if (TREE_CODE (val) == NON_LVALUE_EXPR && (!type || TREE_CODE (type) != REFERENCE_TYPE))
        val = TREE_OPERAND (val, 0);

      /* Passing a function/procedure as a parameter?
         This is more fun in Pascal, since we have to know if we
         are passing a function or the result of the function that
         has no parameters. This requires knowledge of the formal
         parameter types of the called function. */
      if (TREE_CODE (val) == FUNCTION_DECL  /* Passed arg is a function. */
          || PASCAL_PROCEDURAL_TYPE (TREE_TYPE (val)))
        {
          tree fun_type = TREE_TYPE (val);
          while (TREE_CODE (fun_type) == FUNCTION_TYPE || TREE_CODE (fun_type) == REFERENCE_TYPE)
            fun_type = TREE_TYPE (fun_type);
          if (fun_type != void_type_node  /* Procedure. Pass -- don't call. */
              && (!type  /* Varargs. Call the function. */
                  /* Call the function if its result type is compatible to the parameter wanted by
                     this function. (If the routine has parameters, it will never come here if it
                     needs evaluation because it has the parenthesized argument list then.) */
                  || compatible_assignment_p (type, fun_type)))
            val = build_routine_call (val, NULL_TREE);
        }

      /* Set types. */
      else if (type && TREE_CODE (type) == SET_TYPE)
        {
          if (TREE_CODE (val) == CONSTRUCTOR && TREE_CODE (TREE_TYPE (val)) == SET_TYPE)
            /* Convert the set constructor to the corresponding set type */
#if 0
            val = construct_set (val, type, 2);
#else
            /* fjf880.pas */
            {
              tree temp = make_new_variable ("set_parameter", TYPE_MAIN_VARIANT (type));
              if (!CONSTRUCTOR_ELTS (val))
                {
                  construct_set (val, temp, 0);
                  val = temp;
                }
              else
                val = build (COMPOUND_EXPR, type, assign_set (temp, construct_set (val, temp, 0)), temp);
            }
#endif
          else
            {
              tree domain_a = TYPE_DOMAIN (TREE_TYPE (val)), domain_f = TYPE_DOMAIN (type);
              if (!tree_int_cst_equal (TYPE_MIN_VALUE (domain_a), TYPE_MIN_VALUE (domain_f))
                  || !tree_int_cst_equal (TYPE_MAX_VALUE (domain_a), TYPE_MAX_VALUE (domain_f)))
                {
                  tree temp = make_new_variable ("set_parameter", TYPE_MAIN_VARIANT (type));
                  val = build (COMPOUND_EXPR, type, assign_set (temp, val), temp);
                }
            }
        }

      /* Chars. */
      else if (type && TREE_CODE (type) == CHAR_TYPE)
        {
          val = string_may_be_char (val, 1);
          if (is_string_type (val, 0))
            {
              tree string_val = val;
              /* Formal type `Char' must accept string values.
                 Assign the string to a temporary char variable and pass that. */
              val = make_new_variable ("char_parm", type);
              expand_expr_stmt (assign_string (val, string_val));
            }
        }

      /* Strings. */
      else if (type
               && (is_string_compatible_type (val, 0))
               && (is_of_string_type (type, 0)
                   || (TREE_CODE (type) == REFERENCE_TYPE && PASCAL_TYPE_STRING (TREE_TYPE (type)))))
        {
          int varparm = 0, val_ref_parm = 0, conforming, is_readonly, is_volatile;

          if (TREE_CODE (type) == REFERENCE_TYPE)
            {
              varparm = 1;
              val_ref_parm = PASCAL_TYPE_VAL_REF_PARM (type);
              is_readonly = TYPE_READONLY (TREE_TYPE (type));
              is_volatile = TYPE_VOLATILE (TREE_TYPE (type));
            }
          else
            {
              is_readonly = TYPE_READONLY (type);
              is_volatile = TYPE_VOLATILE (type);
            }

          /* should not happen: always passed by reference */
          assert (!PASCAL_TYPE_UNDISCRIMINATED_STRING (type));

          /* If the type is `String (X)' do not convert type, but still
             convert the CHAR or fixed-string to a new schema variable. */
          conforming = (varparm
                        && (PASCAL_TYPE_UNDISCRIMINATED_STRING (TREE_TYPE (type))
                            || PASCAL_TYPE_PREDISCRIMINATED_STRING (TREE_TYPE (type))))
                       || PASCAL_TYPE_PREDISCRIMINATED_STRING (type);

          /* See if the actual parameter is a variable length string
             and the formal is an undiscriminated string schema -> use
             type of actual parameter.
             If actual is not a variable-string, create a new variable string
             type with the proper length and use the new type. */
          if (conforming)
            {
              if (is_variable_string_type (TREE_TYPE (val)))
                type = TREE_TYPE (val);
              else if (!varparm)
                type = build_pascal_string_schema (PASCAL_STRING_LENGTH (val));
              if (is_readonly != TYPE_READONLY (type) || is_volatile != TYPE_VOLATILE (type))
                type = p_build_type_variant (type, is_readonly, is_volatile);
              if (varparm && TREE_CODE (type) != REFERENCE_TYPE)
                {
                  type = build_type_copy (build_reference_type (type));
                  PASCAL_TYPE_VAL_REF_PARM (type) = val_ref_parm;
                }
            }

          /* Take care of value parameter type conversions/blank paddings. */
          if (!varparm)
            {
              /* Ugh, the actual parameter is an ARRAY_TYPE or a CHAR_TYPE;
                 the formal parameter is a string schema. So, create a new
                 schema and copy VAL there and pass that.

                 If the formal paramater is already discriminated use that type,
                 otherwise create a new type with capacity equal to LENGTH (val).

                 @@ Creates a new copy of string, but the size is now the same
                 as the formal parameters size, padding the value parameter with
                 spaces if necessary.

                 The result is then *again* copied to the stack as a value parameter.

                 The first copy can be avoided if the formal and actual parameters
                 are of same size. Now avoided if the types are equal. */
              if (TREE_TYPE (val) != type)
                val = new_string_by_model (type, val, 1);
            }
        }

      /* Conformant arrays. */
      else if (!conf_array_bounds)
        /* Clear keep_this_val when all conformant indices have been passed
           and the array itself is in turn. */
        keep_this_val = kept_length = NULL_TREE;

      /* For conformant array formal parameters we have first the bounds that
         are missing from the actual parameter list. Insert them now. */
      if (type && PASCAL_TYPE_CONFORMANT_BOUND (type))
        {
          if (PASCAL_TYPE_STRING (TREE_TYPE (val)))
            {
              kept_length = PASCAL_STRING_LENGTH (val);
              TREE_VALUE (valtail) = val = PASCAL_STRING_VALUE (val);
            }
          if (TREE_CODE (TREE_TYPE (val)) != ARRAY_TYPE && TREE_CODE (TREE_TYPE (val)) != VOID_TYPE)
            error ("argument does not match conformant array formal parameter");
          else if (!keep_this_val)
            {
              tree type_scan = typetail;
              while (type_scan)
                {
                  tree ttype = TREE_VALUE (type_scan);

                  if (TREE_CODE (ttype) == ARRAY_TYPE ||
                      (TREE_CODE (ttype) == REFERENCE_TYPE && TREE_CODE (TREE_TYPE (ttype)) == ARRAY_TYPE))
                    break;

                  /* @@ Could check that PASCAL_TYPE_CONFORMANT_BOUND is set for all bounds */
                  conf_array_bounds++;
                  type_scan = TREE_CHAIN (type_scan);
                }
              assert (type_scan && !(conf_array_bounds & 1));
              keep_this_val = val;
            }
        }

      if (conf_array_bounds > 0)
        {
          tree atype = TREE_TYPE (keep_this_val);
          if (TREE_CODE (atype) == VOID_TYPE)
            val = TYPE_MIN_VALUE (type);
          else
            {
              assert (TREE_CODE (atype) == ARRAY_TYPE);
              if (conf_array_bounds & 1)
                {
                  val = kept_length ? kept_length : TYPE_MAX_VALUE (TYPE_DOMAIN (atype));
                  keep_this_val = TREE_TYPE (keep_this_val);
                }
              else
                val = TYPE_MIN_VALUE (TYPE_DOMAIN (atype));

              /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
              if (TREE_CODE (val) == NON_LVALUE_EXPR)
                val = TREE_OPERAND (val, 0);

              val = convert (TYPE_DOMAIN (atype), val);
            }

          /* Used one index */
          conf_array_bounds--;
        }

      /* Open arrays.
         For open array formal parameters we have first the length of
         the array which is missing from the actual parameter list.
         => We must insert it now. */
      if (type && PASCAL_TYPE_OPEN_ARRAY (type))
        {
          if (PASCAL_TYPE_STRING (TREE_TYPE (val)))
            {
              kept_length = PASCAL_STRING_LENGTH (val);
              TREE_VALUE (valtail) = val = PASCAL_STRING_VALUE (val);
            }
          if (TREE_CODE (TREE_TYPE (val)) != ARRAY_TYPE
              && TREE_CODE (TREE_TYPE (val)) != VOID_TYPE)
            error ("argument does not match open array formal parameter");
          else if (TREE_CODE (type) == INTEGER_TYPE)
            {
              /* Pass the length of the array. */
              tree atype = TREE_TYPE (val);
              keep_this_val = val;
              if (TREE_CODE (atype) == VOID_TYPE)
                val = integer_zero_node;  /* Passing `Null' as an open array */
              else
                val = kept_length ? build_binary_op (MINUS_EXPR, kept_length, integer_one_node, 0)
                      : build_pascal_binary_op (MINUS_EXPR,
                          convert (pascal_integer_type_node, TYPE_MAX_VALUE (TYPE_DOMAIN (atype))),
                          convert (pascal_integer_type_node, TYPE_MIN_VALUE (TYPE_DOMAIN (atype))));
            }
          else
            assert (TREE_CODE (type) == ARRAY_TYPE);
            /* Pass the array itself. No special action required here. */
        }

      /* If formal reference parameter is a schema, undo a possible
         implicit schema dereference of VAL. */
      if (type
          && TREE_CODE (type) == REFERENCE_TYPE
          && PASCAL_TYPE_SCHEMA (TREE_TYPE (type)))
        val = undo_schema_dereference (val);

      /* Actual CONST parameters may be constant values, although
         they are passed by reference. Create a temporary variable.
         The same has to be done for other value parameters passed
         by reference, e.g. schemata without specified discriminants. */
      if (type
          && TREE_CODE (type) == REFERENCE_TYPE
          && ((TYPE_READONLY (TREE_TYPE (type))
               && (TREE_CODE (val) == STRING_CST
                   || TREE_CODE (val) == CONSTRUCTOR
                   || !lvalue_p (val)
                   || ((PASCAL_TYPE_STRING (TREE_TYPE (type)) || TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
                       && (TREE_CODE (TREE_TYPE (val)) == CHAR_TYPE
                           || (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
                               && TREE_CODE (TREE_TYPE (TREE_TYPE (val))) == CHAR_TYPE)))))
              || PASCAL_TYPE_VAL_REF_PARM (type)))
        {
          if ((TREE_CODE (val) == STRING_CST
               || TREE_CODE (TREE_TYPE (val)) == CHAR_TYPE
               || (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
                   && TREE_CODE (TREE_TYPE (TREE_TYPE (val))) == CHAR_TYPE))
              && PASCAL_TYPE_STRING (TREE_TYPE (type))
              && PASCAL_TYPE_VAL_REF_PARM (type))
            {
              val = new_string_by_model (NULL_TREE, val, 1);

              /* Avoid "incompatible pointer type" warning ... */
              type = build_reference_type (p_build_type_variant (TREE_TYPE (val),
                       TYPE_READONLY (TREE_TYPE (type)),
                       TYPE_VOLATILE (TREE_TYPE (type))));
            }
          else if (TREE_CODE (val) == CONSTRUCTOR && TREE_CODE (TREE_TYPE (val)) == SET_TYPE)
            val = construct_set (val, NULL_TREE, 0);
          else if (TREE_CODE (val) == FUNCTION_DECL)
            val = build_routine_call (val, NULL_TREE);
          /* `const' string (or untyped) parameters are different from both
             `protected var' (they must accept values) and `protected' (they
             should be passed by reference if possible). */
          else if (PASCAL_TYPE_VAL_REF_PARM (type) && (!const_parm || !lvalue_p (val)))
            {
              /* Accept structured values like in CONST decls here?
                 @@@ Yes, according to some informal standard clarifications.
                 BTW, what kind of standard clarifications? `const' parameters
                 are non-standard, BP!? Or was this a comment from GCC,
                 referring to the C standard? But I don't find anything in GCC
                 that resembles this code. -- Frank */
              tree temp_val = make_new_variable ("val_parm",
                     PASCAL_TYPE_STRING (TREE_TYPE (val))
                     ? (PASCAL_TYPE_DISCRIMINATED_STRING (TREE_TYPE (type)) ? TYPE_MAIN_VARIANT (TREE_TYPE (type)) : build_pascal_string_schema (PASCAL_STRING_LENGTH (val)))  /* @@ kludge */
                     : TYPE_MAIN_VARIANT (TREE_TYPE (val)));
              if (is_string_type (val, 0))
                expand_expr_stmt (assign_string (temp_val, val));
              else
                expand_expr_stmt (build_modify_expr (temp_val, INIT_EXPR, val));
              if (TREE_CODE (val) == STRING_CST
                  && TREE_CODE (TREE_TYPE (type)) == ARRAY_TYPE
                  && TREE_CODE (TREE_TYPE (TREE_TYPE (type))) == CHAR_TYPE
                  && TREE_CODE (TYPE_SIZE (TREE_TYPE (type))) != INTEGER_CST)
                {
                  /* This is a string constant being passed to an "array of char" parameter of
                     variable size. Avoid "incompatible pointer type" warning ... */
                  type = build_reference_type (p_build_type_variant (TREE_TYPE (val),
                           TYPE_READONLY (TREE_TYPE (type)),
                           TYPE_VOLATILE (TREE_TYPE (type))));
                }
              val = temp_val;
            }
        }

      /* `var' parameters don't require a complete type. They may even be explicitly untyped. */
      if (!type || TREE_CODE (type) != REFERENCE_TYPE)
        val = require_complete_type (val);

      if (type)
        {
          tree parmval;

          if (!TYPE_SIZE (type) && TREE_CODE (type) != VOID_TYPE)
            {
              error ("type of formal parameter %d is incomplete", parmnum);
              parmval = val;
            }
          else
            {
              if (TREE_CODE (type) == REFERENCE_TYPE)  /* `var' parameter */
                {
                  /* Do about the same type checking like for pointers in convert_for_assignment(),
                     but produce an error message instead of a warning. */
                  int is_readonly = TYPE_READONLY (TREE_TYPE (type));
                  int val_ref_parm = PASCAL_TYPE_VAL_REF_PARM (type);
                  tree ttl = TREE_TYPE (type);
                  tree ttr = TREE_TYPE (val);
#undef SIMPLIFY_REFERENCES  /* Peter suggested this to simplify things, but it doesn't seem to work so easily. -- Frank */
#ifndef SIMPLIFY_REFERENCES
                  type = build_pointer_type (ttl);
#endif
                  if (is_packed_field (val))
                    {
                      error ("packed fields may not be used as `var' parameters");
                      return error_mark_node;
                    }
                  if (!(EM (ttr)
                        || TREE_CODE (ttr) == REFERENCE_TYPE
                        || TYPE_MAIN_VARIANT (ttl) == void_type_node
                        || TYPE_MAIN_VARIANT (ttr) == void_type_node
                        || (TYPE_MAIN_VARIANT (ttl) == ptr_type_node && TREE_CODE (ttr) == POINTER_TYPE)
                        || (TYPE_MAIN_VARIANT (ttr) == ptr_type_node && TREE_CODE (ttl) == POINTER_TYPE)
                        || (TREE_CODE (ttl) == FUNCTION_TYPE
                            && TYPE_MAIN_VARIANT (ttr) == ptr_type_node && integer_zerop (val))
                        || comp_target_types (type, build_pointer_type (ttr))
                        || comp_object_or_schema_pointer_types (ttl, ttr)))
                    {
                      if (!lvalue_p (val))
                        error ("reference expected, value given");
                      else if (fundecl)
                        {
                          error ("type mismatch in argument %d of `%s'", parmnum,
                                 IDENTIFIER_NAME (DECL_NAME (fundecl)));
                          error_with_decl (fundecl, " routine declaration");
                        }
                      else
                        error ("type mismatch in argument %d of indirect function call", parmnum);
                      /* Avoid further warnings. */
                      return error_mark_node;
                    }

                  /* Passing a function result variable as a `var' parameter
                     (not `protected'/`const') can assign a value to it, so do
                     not warn about uninitialized function results afterwards.
                     (Not for procedural parameters -- these are represented
                     as REFERENCE_TYPE, but are like value parameters.)
                     `const' accepts values, `protected var' does not. */
                  if (!const_parm && TREE_CODE (ttl) != FUNCTION_TYPE && !check_reference_parameter (val, is_readonly))
                    return error_mark_node;

                  /* For untyped parameters, pass schemata including the discriminants. */
                  if (TREE_CODE (ttl) == VOID_TYPE)
                    val = undo_schema_dereference (val);

                  /* If the parameter is of REFERENCE_TYPE, we must
                     take the address of the actual parameter. */
#ifndef SIMPLIFY_REFERENCES
                  if (TREE_CODE (TREE_TYPE (val)) == REFERENCE_TYPE
                      && (comptypes (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (val)))))
                    {
                      /* The parameter already is a reference type of
                         the correct type. Don't do anything serious. */
                      val = convert (type, val);
                    }
                  else if (TREE_CODE (ttl) == FUNCTION_TYPE
                           && TYPE_MAIN_VARIANT (ttr) == ptr_type_node
                           && integer_zerop (val))
                    {
                      chk_dialect ("passing `nil' as an actual parameter of procedural type is", B_D_M_PASCAL);
                      val = convert (type, val);
                    }
                  else
#endif
                    {
                      /* We have to take some effort to allow certain non-lvalues
                         (e.g. function results of string type) *if* the parameter
                         allows it (i.e., value or const/protected). */
                      if (const_parm || val_ref_parm)
                        {
                          tree stmts = NULL_TREE;
                          while (1)
                            if (TREE_CODE (val) == NOP_EXPR
                                || TREE_CODE (val) == CONVERT_EXPR
                                || TREE_CODE (val) == NON_LVALUE_EXPR)
                              val = TREE_OPERAND (val, 0);
                            else if (TREE_CODE (val) == COMPOUND_EXPR)
                              {
                                if (stmts)
                                  stmts = build (COMPOUND_EXPR, void_type_node, TREE_OPERAND (val, 0), stmts);
                                else
                                  stmts = TREE_OPERAND (val, 0);
                                val = TREE_OPERAND (val, 1);
                              }
                            else
                              break;
                          if (TREE_CODE (val) == CALL_EXPR && mark_addressable (val))  /* fjf806e.pas */
                            val = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (val)), val);
                          else
                            val = build_unary_op (ADDR_EXPR, val, 0);
                          if (stmts)
                            val = build (COMPOUND_EXPR, TREE_TYPE (val), stmts, val);
                        }
                      else
                        val = build_unary_op (ADDR_EXPR, val, 0);
#ifndef SIMPLIFY_REFERENCES
                      if (TREE_CODE (TREE_TYPE (type)) == POINTER_TYPE
                          && TREE_CODE (TREE_TYPE (TREE_TYPE (type))) == VOID_TYPE)
                        {
                          /* This is an untyped pointer reference parameter. */
                          if (TREE_CODE (TREE_TYPE (TREE_TYPE (val))) == POINTER_TYPE)
                            type = TREE_TYPE (val);
                        }
#endif
                    }
                }
#ifndef SIMPLIFY_REFERENCES
              else if (TREE_CODE (type) == POINTER_TYPE
                       && TYPE_MAIN_VARIANT (TREE_TYPE (type)) == void_type_node)
                {
                  /* Untyped pointer parameter (BP), accepts any pointer value as actual parameter. */
                  if (TREE_CODE (TREE_TYPE (val)) == POINTER_TYPE)
                    type = TREE_TYPE (val);
                }
#endif
              else if (TYPE_MAIN_VARIANT (type) == cstring_type_node)
                {
                  /* This is a CString parameter, which is a GPC extension
                     to make it easier to pass string types to C routines.
                     It accepts any string-type value as a parameter.

                     If the actual parameter is a STRING-TYPE value parameter (it cannot
                     be a CHAR_TYPE) the address of the string is passed, not the value!
                     Also, if it is of string schema type, the address of the character
                     store is passed, not the address of the string schema object. */
                  val = char_may_be_string (val);
                  if (is_string_type (val, 1))
                    val = convert_to_cstring (val);
                }
              else if (PASCAL_TYPE_OBJECT (type) && PASCAL_TYPE_OBJECT (TREE_TYPE (val))
                       && TYPE_MAIN_VARIANT (type) != TYPE_MAIN_VARIANT (TREE_TYPE (val)))
                {
                  /* Passing an object to a formal value parameter of parent type. */
                  tree temp_val = make_new_variable ("object_val_parm", TYPE_MAIN_VARIANT (type));
                  expand_expr_stmt (build_modify_expr (temp_val, INIT_EXPR, val));
                  val = temp_val;
                }

              parmval = convert_for_assignment (type, val, NULL, /* arg passing */ fundecl, parmnum);

              if (PROMOTE_PROTOTYPES && ORDINAL_TYPE (TREE_CODE (type))
                  && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
                parmval = default_conversion (parmval);
            }
          result = tree_cons (NULL_TREE, parmval, result);
        }
      else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
               && (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (double_type_node)))
        /* Convert `float' to `double'. */
        result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
      else
        /* Varargs.
           Convert ordinal constants to integers.
           Convert short integers and fresh integer constants
           (returned as `LongestCard' by the lexer) to `CInteger'(@@ ?). */
        {
          val = string_may_be_char (val, 1);
          if (TREE_CODE (val) == INTEGER_CST)
            {
              if (TREE_CODE (TREE_TYPE (val)) == INTEGER_TYPE && PASCAL_TREE_FRESH_CST (val))
                val = convert (select_integer_type (val, integer_zero_node, NOP_EXPR), val);
              if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (integer_type_node))
                result = tree_cons (NULL_TREE, convert (integer_type_node, val), result);
              else
                result = tree_cons (NULL_TREE, val, result);
            }
          else if (TREE_CODE (val) == STRING_CST)
            result = tree_cons (NULL_TREE, build_pascal_unary_op (ADDR_EXPR, val), result);
          else
            result = tree_cons (NULL_TREE, default_conversion (val), result);
        }
      CHK_EM (TREE_VALUE (result));
      if (typetail)
        typetail = TREE_CHAIN (typetail);
    }

#if 0
  /* Trying to implement optional (initialized) parameters ...

     This does not work like this.
     When the function is called, the info about the argument types is gone.
     In order to handle initialized types in parameter lists we need the
     initial value in the type node, perhaps in TYPE_LANG_SPECIFIC. (For a
     more rigorous type checking, it would be desirable anyway to have the
     whole TYPE_DECL available.)
     This would be DECL_LANG_PARMS now, AFAICS. -- Frank */
  if (typetail && TREE_VALUE (typetail) != void_type_node)
    {
      int opt_parm_count = 0;
      /* Too few actual parameters, but the remaining formal parameters
         might be optional (= initialized). Check it here. */
      tree t, parm = DECL_ARGUMENTS (fundecl);

      /* Now we need the PARM_DECLs, too. Pick up the decl corresponding to TYPETAIL. */
      for (t = typelist; t != typetail && parm; t = TREE_CHAIN (t))
        parm = TREE_CHAIN (parm);
      assert (parm);
      while (typetail && parm && TREE_VALUE (typetail) != void_type_node
             && DECL_INITIAL (TREE_VALUE (parm)))
        {
          /* These are initialized types for parameters which indicate
             optional parameters. Pass the initial values. */
          result = tree_cons (NULL_TREE, TYPE_GET_INITIALIZER (TREE_VALUE (typetail)), result);
          typetail = TREE_CHAIN (typetail);
          parm = TREE_CHAIN (parm);
          opt_parm_count++;
        }
      if (pedantic && opt_parm_count)
        {
          if (opt_parm_count == 1)
            pedwarn ("missing parameter; passing initial value");
          else
            pedwarn ("%d missing parameters; passing initial values", opt_parm_count);
        }
    }
#endif

  if (typetail && TREE_VALUE (typetail) != void_type_node)
    {
      if (fundecl && DECL_NAME (fundecl))
        {
          error ("too few arguments to function `%s'", IDENTIFIER_NAME (DECL_NAME (fundecl)));
          error_with_decl (fundecl, " routine declaration");
        }
      else
        error ("too few arguments to function");
    }

  return nreverse (result);
}

/* For Pascal initialized variables and constants: Return 0 if the
   type of the initializer in INIT matches TYPE, nonzero if invalid.

   In fact the initializer is not only checked, but some conversions
   are done as well.

   The TREE_VALUEs in INIT are the initializers, while the
   TREE_PURPOSEs are array indices or field names. */
int
check_pascal_initializer (type, init)
     tree type, init;
{
  tree link, field;

  if (!init || EM (init) || EM (type))
    return 0;  /* avoid further error messages */

  if (TREE_CODE (init) != TREE_LIST)
    return 1;

  while (PASCAL_TYPE_SCHEMA (type))
    type = TREE_TYPE (simple_get_field (schema_id, type, NULL));

  if (!TREE_VALUE (init))  /* empty initializer `()' */
    return !STRUCTURED_TYPE (TREE_CODE (type));

  if (TREE_CODE (TREE_VALUE (init)) == TREE_LIST)
    {
      int bp_init = 0;
      /* The parser can't check this because it might be an expression in `()'. */
      if (STRUCTURED_TYPE (TREE_CODE (type))
          && PASCAL_BP_INITIALIZER_LIST (TREE_VALUE (init)))
        {
          chk_dialect ("initializers in `()' are", B_D_M_PASCAL);
          bp_init = 1;
        }
      /* Structured initializer. */
      if (TREE_CODE (type) == ARRAY_TYPE)
        {
          tree t;
          if (!bp_init && !TREE_PURPOSE (TREE_VALUE (init)))
            chk_dialect ("omitting indices in initializers is", GNU_PASCAL);
          for (link = TREE_VALUE (init); link; link = TREE_CHAIN (link))
            {
              tree index = TREE_PURPOSE (link);
              if (index && !TREE_PURPOSE (index) && TREE_VALUE (index))
                {
                  error ("`case' in array initializer");
                  return 1;
                }
              while (index)
                {
                  tree t = TREE_PURPOSE (index);
                  if (t && TREE_CODE (t) == IDENTIFIER_NODE)
                    TREE_PURPOSE (index) = check_identifier (t);
                  t = TREE_VALUE (index);
                  if (t && TREE_CODE (t) == IDENTIFIER_NODE)
                    TREE_VALUE (index) = check_identifier (t);
                  index = TREE_CHAIN (index);
                }
              if (check_pascal_initializer (TREE_TYPE (type), link) != 0)
                return 1;
            }
          t = fold (build_binary_op (PLUS_EXPR, build_binary_op (MINUS_EXPR,
                convert (pascal_integer_type_node, TYPE_MAX_VALUE (TYPE_DOMAIN (type))),
                convert (pascal_integer_type_node, TYPE_MIN_VALUE (TYPE_DOMAIN (type))), 0), integer_one_node, 0));
          return 0;
        }
      /* Don't let strings be initialized field by field (Capacity, ...) */
      if (RECORD_OR_UNION (TREE_CODE (type)) && !PASCAL_TYPE_STRING (type))
        {
          if (!TREE_CHAIN (TREE_VALUE (init)) && !TREE_PURPOSE (TREE_VALUE (init)))
            chk_dialect ("initializers in `()' are", B_D_M_PASCAL);
          /* Insert `nil' for the VMT pointer (will be initialized, anyway). */
          if (PASCAL_TYPE_OBJECT (type))
            TREE_VALUE (init) = tree_cons (NULL_TREE, convert (ptr_type_node, integer_zero_node), TREE_VALUE (init));
          for (link = TREE_VALUE (init), field = TYPE_FIELDS (type);
               link;
               link = TREE_CHAIN (link), field = TREE_CHAIN (field))
            {
              tree fieldtag = TREE_PURPOSE (link);
              if (fieldtag)
                {
                  tree ftype = NULL_TREE;
                  if (!TREE_PURPOSE (fieldtag))
                    {
                      if (!TREE_VALUE (fieldtag))
                        {
                          error ("`otherwise' in record initializer");
                          return 1;
                        }
                      /* @@@@ Check variant */
                      assert (TREE_VALUE (fieldtag) == integer_zero_node
                              || TREE_CODE (TREE_VALUE (fieldtag)) == IDENTIFIER_NODE);
                      continue;
                    }
                  while (fieldtag)
                    {
                      if (TREE_VALUE (fieldtag))
                        return 1;
                      if (TREE_CODE (TREE_PURPOSE (fieldtag)) != IDENTIFIER_NODE)
                        return 1;
                      field = find_field (type, TREE_PURPOSE (fieldtag), 2);
                      if (!field || (ftype && ftype != TYPE_MAIN_VARIANT (TREE_TYPE (field))))
                        return 1;
                      ftype = TYPE_MAIN_VARIANT (TREE_TYPE (field));
                      fieldtag = TREE_CHAIN (fieldtag);
                    }
                }
              else
                chk_dialect ("omitting field names in initializers is", GNU_PASCAL);
              if (!field || check_pascal_initializer (TREE_TYPE (field), link) != 0)
                return 1;
            }
          return 0;
        }

      if (TREE_CODE (type) == SET_TYPE && !PASCAL_BP_INITIALIZER_LIST (TREE_VALUE (init)))
        {
          tree t = build_iso_set_constructor (type, TREE_VALUE (init), 1);
          if (EM (t))
            return 1;
          TREE_VALUE (init) = save_expr (t);
          return 0;
        }

      /* Simple type, structured initializer, wrong. */
      if (TREE_CHAIN (TREE_VALUE (init)) || TREE_PURPOSE (TREE_VALUE (init))
          || !PASCAL_BP_INITIALIZER_LIST (TREE_VALUE (init)))
        return 1;

      /* Simple type with initializer in parentheses. Note: we get here only
         if PASCAL_BP_INITIALIZER_LIST is set (not for EP initializers
         with `[]'). Remove the parentheses and check again. */
      TREE_VALUE (init) = TREE_VALUE (TREE_VALUE (init));
      return check_pascal_initializer (type, init);
    }
  else
    {
      /* Simple initializer. */

      /* Call functions without parameters. */
      TREE_VALUE (init) = probably_call_function (TREE_VALUE (init));

      /* Char constants. */
      if (TREE_CODE (type) == CHAR_TYPE)
        TREE_VALUE (init) = string_may_be_char (TREE_VALUE (init), 1);

      /* Ordinal types. Do some trivial range checking. */
      if (ORDINAL_TYPE (TREE_CODE (type)) && TREE_CODE (TREE_VALUE (init)) == INTEGER_CST)
        {
          tree lo = TYPE_MIN_VALUE (type);
          tree hi = TYPE_MAX_VALUE (type);
          tree val = TREE_VALUE (init);
          if ((lo && int_cst_lt_always (val, lo)) || (hi && int_cst_lt_always (hi, val)))
            {
              error ("constant out of range");
              TREE_VALUE (init) = integer_zero_node;
            }
        }

      /* Strings. */
      if (PASCAL_TYPE_STRING (type)
          && (TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == CHAR_TYPE
              || (TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE
                  && TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_VALUE (init)))) == CHAR_TYPE)))
        {
          tree capacity = TYPE_LANG_DECLARED_CAPACITY (type);
          tree string_length = PASCAL_STRING_LENGTH (TREE_VALUE (init));

          if (!capacity || TREE_CODE (capacity) != INTEGER_CST)
            {
              error ("string capacity is not constant");
              TREE_VALUE (init) = error_mark_node;
              return 1;
            }

          /* Do some trivial range checking. */
          if (TREE_CODE (string_length) == INTEGER_CST && int_cst_lt_always (capacity, string_length))
            {
              if (co->truncate_strings)
                pedwarn ("string constant exceeds capacity -- truncated");
              else
                error ("string constant exceeds capacity");
              /* Truncate the string. */
              if (integer_zerop (capacity))
                TREE_VALUE (init) = empty_string_node;
              else if (TREE_CODE (TREE_VALUE (init)) == STRING_CST)
                {
                  int string_capacity = TREE_INT_CST_LOW (capacity);
                  char *s = alloca (string_capacity + 1);
                  memcpy (s, TREE_STRING_POINTER (TREE_VALUE (init)), string_capacity);
                  s[string_capacity] = 0;
                  TREE_VALUE (init) = build_string_constant (s, string_capacity, PASCAL_TREE_FRESH_CST (TREE_VALUE (init)));
                }
              else
                {
                  /* We can't get here with char constants! */
                  tree min = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (TREE_VALUE (init))));
                  TREE_VALUE (init) = build_array_slice_ref (TREE_VALUE (init), min,
                    fold (build_binary_op (MINUS_EXPR,
                    build_binary_op (PLUS_EXPR, min, capacity, 0), integer_one_node, 0)));
                }
              string_length = capacity;
            }
          else if (TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == CHAR_TYPE)
            /* convert char to string: [1: char-value; 2 .. Capacity + 1: Chr (0)] */
            TREE_VALUE (init) = tree_cons (build_tree_list (integer_one_node, NULL_TREE), TREE_VALUE (init),
              build_tree_list (build_tree_list (build_int_2 (2, 0),
                fold (build_binary_op (PLUS_EXPR, capacity, integer_one_node, 0))),
                convert (char_type_node, integer_zero_node)));

          /* @@ backend doesn't like array slices, so initialize char by char (gross!) */
          if (TREE_CODE (TREE_VALUE (init)) != TREE_LIST
              && TREE_CODE (TREE_VALUE (init)) != STRING_CST
              && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) != CHAR_TYPE)
            {
              tree t = NULL_TREE, v = save_expr (TREE_VALUE (init));
              unsigned int i;
              for (i = TREE_INT_CST_LOW (capacity) + 1; i >= 1; i--)
                t = tree_cons (build_tree_list (build_int_2 (i, 0), NULL_TREE),
                  i == TREE_INT_CST_LOW (capacity) + 1 ? convert (char_type_node, integer_zero_node)
                  : build_array_ref (v, fold (build_binary_op (PLUS_EXPR,
                  TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (v))), build_int_2 (i - 1, 0), 0))), t);
              TREE_VALUE (init) = t;
            }

          /* A string schema is a record. Initialize it as such. */
          TREE_VALUE (init) = tree_cons (NULL_TREE, capacity,
            tree_cons (NULL_TREE, string_length,
            build_tree_list (NULL_TREE, TREE_VALUE (init))));
          return 0;
        }

      if (TREE_CODE (type) == ARRAY_TYPE
          && TYPE_MAIN_VARIANT (TREE_TYPE (type)) == char_type_node
          && TREE_CODE (TREE_VALUE (init)) == STRING_CST)
        {
          /* Initializing an array of char with a string constant.
             Make the length match by either cutting or padding with blanks.
             @@ Or else we can append a `Chr (0)' => ternary switch. */
          tree upper_bound = convert (pascal_integer_type_node, TYPE_MAX_VALUE (TYPE_DOMAIN (type)));
          tree lower_bound = convert (pascal_integer_type_node, TYPE_MIN_VALUE (TYPE_DOMAIN (type)));
          tree capacity = fold (build_binary_op (PLUS_EXPR,
                 build_binary_op (MINUS_EXPR, upper_bound, lower_bound, 0), integer_one_node, 0));
          if (TREE_CODE (capacity) == INTEGER_CST)
            {
              if ((unsigned) TREE_STRING_LENGTH (TREE_VALUE (init))
                  <= (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (capacity))
                {
                  char *buffer = alloca (TREE_INT_CST_LOW (capacity) + 15), *p;
                  unsigned len = TREE_STRING_LENGTH (TREE_VALUE (init)) - 1, i;
                  memcpy (buffer, TREE_STRING_POINTER (TREE_VALUE (init)), len);
                  p = buffer + len;
                  for (i = len; i < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (capacity); i++)
                    {
                      *p = ' ';
                      p++;
                    }
                  *p = 0;
                  TREE_VALUE (init) = build_string (TREE_INT_CST_LOW (capacity), buffer);
                  TREE_TYPE (TREE_VALUE (init)) = type;
                }
              else
                {
                  if ((unsigned) TREE_STRING_LENGTH (TREE_VALUE (init)) - 1
                      > (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (capacity))
                    {
                      if (co->truncate_strings)
                        pedwarn ("string constant exceeds capacity -- truncated");
                      else
                        error ("string constant exceeds capacity");
                    }
                  TREE_VALUE (init) = copy_node (TREE_VALUE (init));
                  TREE_STRING_LENGTH (TREE_VALUE (init)) = TREE_INT_CST_LOW (capacity);
                }
            }
          return 0;
        }

      if (TYPE_MAIN_VARIANT (type) == cstring_type_node)
        {
          TREE_VALUE (init) = char_may_be_string (TREE_VALUE (init));
          if (is_string_type (TREE_VALUE (init), 0))
            {
              /* Initializing a `CString' with a string value. Let the `CString' variable point to it. */
              TREE_VALUE (init) = convert (cstring_type_node,
                build_pascal_unary_op (ADDR_EXPR, PASCAL_STRING_VALUE (TREE_VALUE (init))));
              return 0;
            }
          /* Pointers to strings used as CStrings. */
          if (TREE_CODE (TREE_VALUE (init)) == ADDR_EXPR
              && TREE_CODE (TREE_OPERAND (TREE_VALUE (init), 0)) == CONSTRUCTOR
              && PASCAL_TYPE_DISCRIMINATED_STRING (TREE_TYPE (TREE_OPERAND (TREE_VALUE (init), 0))))
            {
              int constant = TREE_CONSTANT (TREE_VALUE (init));
              TREE_VALUE (init) = build1 (ADDR_EXPR, cstring_type_node, TREE_VALUE (
                TREE_CHAIN (TREE_CHAIN (TREE_OPERAND (TREE_OPERAND (TREE_VALUE (init), 0), 1)))));
              TREE_CONSTANT (TREE_VALUE (init)) = constant;
              return 0;
            }
        }

      /* Procedural variables.
         (Pointers to procedures do not cause problems (I hope at least;-).) */
      if (TREE_CODE (type) == REFERENCE_TYPE
          && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
          && TREE_CODE (TREE_VALUE (init)) == CALL_EXPR)
        {
          tree op = TREE_OPERAND (TREE_VALUE (init), 0);
          if (TREE_CODE (op) == ADDR_EXPR)
            /* Set TREE_CONSTANT correctly, mark_addressable, etc. */
            op = build_pascal_address_expression (TREE_OPERAND (op, 0), 0);
          TREE_VALUE (init) = convert (type, op);
          return 0;
        }

      /* Sets. */
      if (TREE_CODE (TREE_VALUE (init)) == CONSTRUCTOR
          && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == SET_TYPE
          && TREE_CODE (type) == SET_TYPE
          && TREE_TYPE (TREE_VALUE (init)) == empty_set_type_node)
        {
          /* The type of the set constructor was not known to the parser.
             Specify it now, but check it first. */
          tree elements = CONSTRUCTOR_ELTS (TREE_VALUE (init));
          if (elements && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_PURPOSE (elements))),
                                      TYPE_MAIN_VARIANT (TREE_TYPE (type))))
            return 1;
          TREE_VALUE (init) = copy_node (TREE_VALUE (init));
          TREE_TYPE (TREE_VALUE (init)) = type;
          return 0;
        }

      /* Conformant arrays. */
      if (PASCAL_TYPE_CONFORMANT_ARRAY (type) && comptypes (type, TREE_VALUE (init)))
        return 0;

      /* Normal initialization. This is just a special case of an assignment. */
      TREE_VALUE (init) = convert_for_assignment (type, TREE_VALUE (init), "initialization", NULL_TREE, 0);
      return (TREE_CODE (TREE_TYPE (TREE_VALUE (init))) != TREE_CODE (type));
    }
  assert (0);
}

/* Returns 1 if expr is the CONVERT_EXPR representing an unresolved
   schema discriminant belonging to one of the given fields. */
static int
is_discriminant_of (expr, fields)
     tree expr, fields;
{
  tree field, fix;
  for (field = fields; field; field = TREE_CHAIN (field))
    if (PASCAL_TREE_DISCRIMINANT (field))
      for (fix = DECL_LANG_FIXUPLIST (field); fix; fix = TREE_CHAIN (fix))
        if (TREE_VALUE (fix) == expr)
          return 1;
  return 0;
}

/* Returns 1 if type_or_expr contains somewhere in it an unresolved
   schema discriminant. If fields is NULL, any discriminant is
   recognized, otherwise only those belonging to the given fields. */
int
contains_discriminant (type_or_expr, fields)
     tree type_or_expr, fields;
{
  enum tree_code code = TREE_CODE (type_or_expr);
  switch (code)
  {
    case ERROR_MARK:
      return 0;

    case CONVERT_EXPR:
      if (PASCAL_TREE_DISCRIMINANT (type_or_expr)
          && (!fields || is_discriminant_of (type_or_expr, fields)))
        return 1;
      break;  /* Check operand below */

    case BOOLEAN_TYPE:
    case CHAR_TYPE:
    case ENUMERAL_TYPE:
    case INTEGER_TYPE:
      return    contains_discriminant (TYPE_MIN_VALUE (type_or_expr), fields)
             || contains_discriminant (TYPE_MAX_VALUE (type_or_expr), fields)
             || (TREE_TYPE (type_or_expr) && contains_discriminant (TREE_TYPE (type_or_expr), fields));

    case ARRAY_TYPE:
      return    contains_discriminant (TYPE_DOMAIN (type_or_expr), fields)
             || contains_discriminant (TREE_TYPE (type_or_expr), fields);

    case RECORD_TYPE:
    case UNION_TYPE:
      if (PASCAL_TYPE_STRING (type_or_expr) && TYPE_LANG_DECLARED_CAPACITY (type_or_expr))
        return contains_discriminant (TYPE_LANG_DECLARED_CAPACITY (type_or_expr), fields);
      else
        {
          tree field;
          for (field = TYPE_FIELDS (type_or_expr); field; field = TREE_CHAIN (field))
            if (contains_discriminant (TREE_TYPE (field), fields))
              return 1;
            /* If this field *is* a discriminant, that's no reason by itself to return 1.
               But if it has been discriminated, and the actual discriminant is another
               discriminant (of an outer schema), we have to detect this. (emil19.pas) */
            else if (PASCAL_TREE_DISCRIMINANT (field)
                     && DECL_LANG_FIXUPLIST (field)
                     && TREE_CODE (DECL_LANG_FIXUPLIST (field)) != TREE_LIST
                     && contains_discriminant (DECL_LANG_FIXUPLIST (field), fields))
              return 1;
        }
      break;

    case CALL_EXPR:
      {
        tree t;
        if (contains_discriminant (TREE_OPERAND (type_or_expr, 0), fields))
          return 1;
        for (t = TREE_OPERAND (type_or_expr, 1); t; t = TREE_CHAIN (t))
          if (contains_discriminant (TREE_VALUE (t), fields))
            return 1;
        return 0;
      }

    case RTL_EXPR:
      return 0;

    case TREE_LIST:
      {
        tree t;
        for (t = type_or_expr; t; t = TREE_CHAIN (t))
          if (contains_discriminant (TREE_VALUE (t), fields))
            return 1;
        return 0;
      }

    default:
      break;
  }

  if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)) || TREE_CODE_CLASS (code) == '3')
    {
      int i = 0, l = NUMBER_OF_OPERANDS (code);
      if (code == CONSTRUCTOR)
        i = 1 + !TREE_OPERAND (type_or_expr, 1);
      for (; i < l; i++)
        if (contains_discriminant (TREE_OPERAND (type_or_expr, i), fields))
          return 1;
    }
  return 0;
}

/* fold() doesn't know about our Boolean constants :-(
   Important: Do this *after* folding the operands! */
static tree
fold_b (expr)
     tree expr;
{
  enum tree_code code = TREE_CODE (expr);
  if ((code == NON_LVALUE_EXPR || code == CONVERT_EXPR || code == NOP_EXPR)
      && TREE_CODE (TREE_TYPE (expr)) == BOOLEAN_TYPE)
    {
      tree op = TREE_OPERAND (expr, 0);
      if (integer_zerop (op))
        return boolean_false_node;
      else if (integer_onep (op))
        return boolean_true_node;
    }
  return fold (expr);
}

/* fold() doesn't fold constants below (one or several) CONVERT_EXPR's
   and NOP_EXPR's that actually change the type. I guess that's because
   this normally never occurs because they're avoided during the
   construction. But it does happen if build_discriminated_schema_type()
   puts the actual discriminant values in the middle of an already
   constructed expression. So we must call fold() on each part of the
   expression, and we must do the folding "bottom up", i.e. call fold() at
   the end, not at the beginning. @@ That's kind of a kludge. -- Frank
   p_foreign_discr is used to pass information about foreign discriminants
   up the recursion levels (but not down -- the local variable foreign_discr
   prevents this!). p_foreign_discr can be NULL, otherwise the variable it
   points to must have been initialized.
   This function is slightly tricky. ;-) */
static tree
re_fold (expr, fields, p_foreign_discr)
     tree expr, fields;
     int *p_foreign_discr;
{
  enum tree_code code = TREE_CODE (expr);
  int foreign_discr = 0;
  CHK_EM (expr);
  if (code == CONVERT_EXPR && PASCAL_TREE_DISCRIMINANT (expr))
    {
      if (!is_discriminant_of (expr, fields))
        /* The expr is a "foreign" discriminant (of an outer schema type).
           Don't fold it, which would destroy its "0" placeholder. Also
           don't fold the expressions containing it. */
        foreign_discr = 1;
      else
        {
          /* This is our discriminant. */
          expr = copy_node (expr);
          TREE_OPERAND (expr, 0) = re_fold (TREE_OPERAND (expr, 0), fields, &foreign_discr);
          /* Don't fold it if it contains a foreign discriminant. But
             clear the PASCAL_TREE_DISCRIMINANT flag to signal that our
             discrimination is done, so that the discrimination of the
             outer schema will not be stopped by *this* one. (Clear the
             flag in any case -- if there's no foreign discriminant,
             fold_b() will probably throw away this CONVERT_EXPR, anyway,
             but if not, it's not a discriminant anymore.) */
          PASCAL_TREE_DISCRIMINANT (expr) = 0;
          if (!foreign_discr)
            return fold_b (expr);
        }
    }
  else if (code == CALL_EXPR)
    {
      tree t;
      expr = copy_node (expr);
      TREE_OPERAND (expr, 0) = re_fold (TREE_OPERAND (expr, 0), fields, &foreign_discr);
      for (t = TREE_OPERAND (expr, 0); t; t = TREE_CHAIN (t))
        TREE_VALUE (t) = re_fold (TREE_VALUE (t), fields, &foreign_discr);
      if (!foreign_discr)
        return fold (expr);
    }
  else if (code == SAVE_EXPR)
    /* Copying a SAVE_EXPR is no good idea. ;-) Therefore, we can't
       modify its fields, i.e., we can't fold below it. This should only
       happen in `New' (hopefully) when it doesn't matter that the type
       can't be folded completely. */
    ;
  else if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)) || TREE_CODE_CLASS (code) == '3')
    {
      int i = 0, l = tree_code_length[(int) code];
      expr = copy_node (expr);
      if (code == METHOD_CALL_EXPR)
        l = 3;
      else if (code == CONSTRUCTOR)
        i = 1 + !TREE_OPERAND (expr, 1);
      for (; i < l; i++)
        TREE_OPERAND (expr, i) = re_fold (TREE_OPERAND (expr, i), fields, &foreign_discr);
      if (!foreign_discr)
        return fold_b (expr);
    }
  else if (code == TREE_LIST)
    {
      tree t;
      expr = copy_list (expr);
      for (t = expr; t; t = TREE_CHAIN (t))
        {
          if (TREE_VALUE (t))
            TREE_VALUE (t) = re_fold (TREE_VALUE (t), fields, &foreign_discr);
          if (TREE_PURPOSE (t))
            TREE_PURPOSE (t) = re_fold (TREE_PURPOSE (t), fields, &foreign_discr);
        }
    }
  if (foreign_discr && p_foreign_discr)
    *p_foreign_discr = 1;
  return expr;
}

/* Recursive subroutine of build_discriminated_schema_type:
   Re-build a type with actual discriminants replacing the formal ones. */
static tree
re_layout_type (type, fields)
     tree type, fields;
{
  int was_packed = PASCAL_TYPE_PACKED (type);

  /* This check (to avoid re-layouting those parts of a schema type
     that don't depend on the discriminants) is not only made for
     efficiency, it also prevents the creation of incompatible types
     (fjf590.pas). */
  if (!contains_discriminant (type, fields))
    return build_type_copy (type);

  CHK_EM (type);
  switch (TREE_CODE (type))
  {
    case BOOLEAN_TYPE:
    case CHAR_TYPE:
    case ENUMERAL_TYPE:
    case INTEGER_TYPE:
      {
        int foreign_discr_min = 0, foreign_discr_max = 0;
        type = build_type_copy (type);
        copy_type_lang_specific (type);
        new_main_variant (type);

        TYPE_MIN_VALUE (type) = re_fold (TYPE_MIN_VALUE (type), fields, &foreign_discr_min);
        TYPE_MAX_VALUE (type) = re_fold (TYPE_MAX_VALUE (type), fields, &foreign_discr_max);

        /* size_volatile >= 2: prediscriminating (kludge?) */
        if (size_volatile < 2 && !foreign_discr_min && !foreign_discr_max && !check_subrange (TYPE_MIN_VALUE (type), TYPE_MAX_VALUE (type)))
          {
            error (" actual schema discriminant has invalid value");
            return error_mark_node;
          }

        /* Convert the min and max values to their actual type (so, e.g.,
           the size won't change), but not if they still contain another
           discriminant because converting might lose it. */
        if (!foreign_discr_min)
          TYPE_MIN_VALUE (type) = convert (type, TYPE_MIN_VALUE (type));
        if (!foreign_discr_max)
          TYPE_MAX_VALUE (type) = convert (type, TYPE_MAX_VALUE (type));

        /* Subrange type. */
        if (TREE_TYPE (type))
          TREE_TYPE (type) = re_layout_type (TREE_TYPE (type), fields);
        CHK_EM (TREE_TYPE (type));

        if (TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (TYPE_MAX_VALUE (type))))
          TYPE_PRECISION (type) = TYPE_PRECISION (TREE_TYPE (TYPE_MAX_VALUE (type)));
        if (TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (TYPE_MIN_VALUE (type))))
          TYPE_PRECISION (type) = TYPE_PRECISION (TREE_TYPE (TYPE_MIN_VALUE (type)));
        break;
      }
    case ARRAY_TYPE:
      type = build_simple_array_type (re_layout_type (TREE_TYPE (type), fields),
                                      re_layout_type (TYPE_DOMAIN (type), fields));
      CHK_EM (type);
      break;
    case RECORD_TYPE:
    case UNION_TYPE:
      if (PASCAL_TYPE_STRING (type))
        {
          tree capacity = TYPE_LANG_DECLARED_CAPACITY (type);
          if (capacity)
            type = build_pascal_string_schema (re_fold (capacity, fields, NULL));
          break;
        }
      else
        {
          tree field, new_field, old_fields = TYPE_FIELDS (type), new_fields = NULL_TREE;
          struct lang_type *lang_specific = TYPE_LANG_SPECIFIC (type);
#ifndef EGCS97
          int mom = suspend_momentary ();
#endif
          int save_defining_packed_type;
          for (field = old_fields; field; field = TREE_CHAIN (field))
            {
              tree f = build_field (DECL_NAME (field), re_layout_type (TREE_TYPE (field), fields));
              CHK_EM (f);
              new_fields = chainon (new_fields, f);
            }
#ifndef EGCS97
          resume_momentary (mom);
#endif
          save_defining_packed_type = defining_packed_type;
          defining_packed_type = TYPE_PACKED (type);
          type = finish_struct (start_struct (TREE_CODE (type)), new_fields, 1);
          defining_packed_type = save_defining_packed_type;
          TYPE_LANG_SPECIFIC (type) = lang_specific;
          copy_type_lang_specific (type);
          sort_fields (type);

          /* Care for possible actual discriminants of inner schema types
             which are (expressions containing) this schema's formal
             discriminants. @@ Top-level discriminants seem to be destroyed
             here and restored later in build_discriminated_schema_type() --
             is this good?
             First check whether we're at the main schema's record or a field
             which is a schema. @@ This check is a little dirty because it
             compares old_fields (former TYPE_FIELDS of the current type) with
             the fields parameter which refers to the main record's fields,
             but is actually passed for other purposes. But doing it like this
             saves us from passing another parameter through the recursion. */
          if (old_fields != fields && PASCAL_TYPE_SCHEMA (type))
            for (field = old_fields, new_field = TYPE_FIELDS (type);
                 field && new_field;
                 field = TREE_CHAIN (field), new_field = TREE_CHAIN (new_field))
              if (PASCAL_TREE_DISCRIMINANT (field))
                {
                  /* Inner schema must have been (formally) discriminated
                     before, i.e. PASCAL_TREE_DISCRIMINANT contains the
                     discriminant's initializer now. */
                  tree fixup = DECL_LANG_FIXUPLIST (field);
                  assert (fixup && TREE_CODE (fixup) != TREE_LIST);
                  PASCAL_TREE_DISCRIMINANT (new_field) = 1;
                  DECL_LANG_SPECIFIC (new_field) = allocate_decl_lang_specific ();
                  DECL_LANG_FIXUPLIST (new_field) = re_fold (fixup, fields, NULL);
                }
          break;
        }

    default:
      /* Nothing to re-layout (yet).
         (No need to re-layout a pointer or reference target.)
         contains_discriminant() should not have found such types */
      assert (0);
      break;
  }

  TYPE_SIZE (type) = NULL_TREE;
  layout_type (type);

  if (was_packed)
    type = pack_type (type);

  return type;
}

/* Return a discriminated schema type derived from TYPE (which must
   be a schema type as returned by build_schema_type) using the
   actual discriminants held in the tree list DISCRIMINANTS. */
tree
build_discriminated_schema_type (type, discriminants)
     tree type, discriminants;
{
  tree type_template = type, field, disc, fix;
#ifndef EGCS97
  struct obstack *ambient_obstack;
#endif

  CHK_EM (type);
  if (PASCAL_TYPE_UNDISCRIMINATED_STRING (type))
    {
      /* Strings are a special case. */
      if (TREE_CHAIN (discriminants))
        error ("too many discriminants for string schema");
      if (TREE_CODE (TREE_VALUE (discriminants)) == INTEGER_CST
          && !INT_CST_LT (integer_zero_node, TREE_VALUE (discriminants)))
        error ("string capacity must be > 0");
      return build_pascal_string_schema (TREE_VALUE (discriminants));
    }
  else if (!PASCAL_TYPE_UNDISCRIMINATED_SCHEMA (type))
    {
      error ("discriminated type is not a schema or string");
      return type;
    }

#ifndef EGCS97
  ambient_obstack = current_obstack;
  current_obstack = TYPE_OBSTACK (type);
#endif

  size_volatile++;

  for (field = TYPE_FIELDS (type_template), disc = discriminants;
       field && disc;
       field = TREE_CHAIN (field), disc = TREE_CHAIN (disc))
    {
      tree val = TREE_VALUE (disc) = string_may_be_char (TREE_VALUE (disc), 0);
      val = convert_for_assignment (TREE_TYPE (field), val, "schema discrimination", NULL_TREE, 0);
      for (fix = DECL_LANG_FIXUPLIST (field); fix; fix = TREE_CHAIN (fix))
        {
          tree target = TREE_VALUE (fix);
          /* @@@@ We do all changes on the type template, lay out a copy,
             and finally restore the template. This is a kludge.
             It would be better to create the copy *without* modifying
             the template.
             Remember the old value of this to set it back after
             re_layout_type() has done its job. */
          assert (TREE_CODE (target) == CONVERT_EXPR && PASCAL_TREE_DISCRIMINANT (target));
          TREE_PURPOSE (fix) = TREE_OPERAND (target, 0);
          TREE_OPERAND (target, 0) = val;
        }
    }
  if (!field || DECL_NAME (field) != schema_id || disc)
    error ("number of discriminants does not match schema declaration");

  type = re_layout_type (type, TYPE_FIELDS (type));
  CHK_EM (type);

  TYPE_LANG_SPECIFIC (type) = TYPE_LANG_SPECIFIC (type_template);
  copy_type_lang_specific (type);
  sort_fields (type);

  if (TYPE_LANG_INITIAL (type))
    {
      tree t = re_fold (TYPE_LANG_INITIAL (type), TYPE_FIELDS (type_template), NULL);
      if (check_pascal_initializer (type, t))
        {
          error ("initial value of discriminated schema type is of wrong type");
          t = error_mark_node;
        }
      TYPE_LANG_INITIAL (type) = t;
    }

  /* If the schema depends on the discriminants only to a small
     extent or not at all, re_layout_type() may have gotten away
     with build_type_copy() only, and this doesn't change
     TYPE_MAIN_VARIANT, so we change it explicitly. */
  if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (type_template))
    new_main_variant (type);

  /* Restore the type template for future use. */
  for (field = TYPE_FIELDS (type_template); field; field = TREE_CHAIN (field))
    if (PASCAL_TREE_DISCRIMINANT (field))
      for (fix = DECL_LANG_FIXUPLIST (field); fix; fix = TREE_CHAIN (fix))
        {
          TREE_OPERAND (TREE_VALUE (fix), 0) = TREE_PURPOSE (fix);
          TREE_PURPOSE (fix) = NULL_TREE;
        }

  CHK_EM (type);

  /* Store the values in the new type instead of the fixup-list.
     This is needed in init_any() to initialize these fields. But copy
     the list first, otherwise we'd overwrite it in the template. */
  TYPE_FIELDS (type) = copy_list (TYPE_FIELDS (type));
  for (field = TYPE_FIELDS (type), disc = discriminants;
       field && disc;
       field = TREE_CHAIN (field), disc = TREE_CHAIN (disc))
    {
      PASCAL_TREE_DISCRIMINANT (field) = 1;
      DECL_LANG_SPECIFIC (field) = allocate_decl_lang_specific ();
      DECL_LANG_FIXUPLIST (field) = TREE_VALUE (disc);
    }

  /* Store TYPE_TEMPLATE in TYPE_LANG_SPECIFIC to allow for pointer
     compatibility checks. Do not use TYPE_MAIN_VARIANT because the
     size of schemata varies. */
  TYPE_LANG_CODE (type) = PASCAL_LANG_DISCRIMINATED_SCHEMA;
  TYPE_LANG_BASE (type) = type_template;  /* base type */

  /* Preserve unused flag, volatility and readonlyness. */
  TREE_USED (type) = TREE_USED (type_template);
  TYPE_READONLY (type) = TYPE_READONLY (type_template);
  TYPE_VOLATILE (type) = TYPE_VOLATILE (type_template);

#ifndef EGCS97
  current_obstack = ambient_obstack;
#endif
  size_volatile--;
  return type;
}

/* Return nonzero if REF is an lvalue valid for this language.
   Lvalues can be assigned, unless their type has TYPE_READONLY.
   Lvalues can have their address taken, unless they have DECL_REGISTER. */
int
lvalue_p (ref)
     tree ref;
{
  switch (TREE_CODE (ref))
  {
    case COMPONENT_REF:
    case BIT_FIELD_REF:
      return lvalue_p (TREE_OPERAND (ref, 0));

    case COMPOUND_EXPR:
      return lvalue_p (TREE_OPERAND (ref, 1));

    /* Special case: a reference which has been converted to a pointer using `@' is an lvalue. */
    case CONVERT_EXPR:
      return TREE_CODE (TREE_TYPE (ref)) == POINTER_TYPE
             && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0))) == REFERENCE_TYPE;

    case INDIRECT_REF:
    case ARRAY_REF:
    case VAR_DECL:
    case PARM_DECL:
    case RESULT_DECL:
    case ERROR_MARK:
      return TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE;

    case BIND_EXPR:
    case RTL_EXPR:
      return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;

    default:
      return 0;
  }
}

/* Return nonzero if REF is an lvalue valid for this language;
   otherwise, print an error message and return zero. */
#ifdef EGCS
int
lvalue_or_else (ref, string)
     tree ref;
     const char *string;
#else
int
lvalue_or_else (ref, string)
     tree ref;
     char *string;
#endif
{
  int win = lvalue_p (ref);
  if (!win)
    error ("invalid lvalue in %s", string);
  return win;
}

/* Mark EXP saying that we need to be able to take the
   address of it; it should not be allocated in a register.
   Value is 1 if successful. */
#ifdef GCC_3_3
bool
#else
int
#endif
mark_addressable (exp)
     tree exp;
{
  return mark_addressable2 (exp, 0);
}

#ifdef GCC_3_3
bool
#else
int
#endif
mark_addressable2 (exp, allow_packed)
     tree exp;
     int allow_packed;
{
  tree x = exp;
  while (1)
    switch (TREE_CODE (x))
    {
      case COMPONENT_REF:
        if (DECL_PACKED_FIELD (TREE_OPERAND (x, 1)) && !allow_packed)
          {
            error ("cannot take address of packed record field `%s'",
                   IDENTIFIER_NAME (DECL_NAME (TREE_OPERAND (x, 1))));
            return 0;
          }
        /* FALLTHROUGH */

      case ADDR_EXPR:
      case ARRAY_REF:
      case REALPART_EXPR:
      case IMAGPART_EXPR:
        x = TREE_OPERAND (x, 0);
        break;

      case CONSTRUCTOR:
        TREE_ADDRESSABLE (x) = 1;
        return 1;

      case VAR_DECL:
      case PARM_DECL:
      case RESULT_DECL:
        if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x) && DECL_NONLOCAL (x))
          {
            if (TREE_PUBLIC (x))
              {
                error ("global register variable `%s' used in local function",
                       IDENTIFIER_NAME (DECL_NAME (x)));
                return 0;
              }
            pedwarn ("register variable `%s' used in local function",
                     IDENTIFIER_NAME (DECL_NAME (x)));
          }
        else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
          {
            error ("address of register variable `%s' requested", IDENTIFIER_NAME (DECL_NAME (x)));
            return 0;
          }
#ifdef GCC_3_3
        put_var_into_stack (x, true);
#else
        put_var_into_stack (x);
#endif
        /* FALLTHROUGH */
      case FUNCTION_DECL:
        TREE_ADDRESSABLE (x) = 1;
        return 1;

      case CONST_DECL:
        assert (0);  /* shouldn't get here */

      default:
        return 1;
    }
}

/* Convert value RHS to type TYPE as preparation for an assignment to an lvalue of type TYPE.
   The real work of conversion is done by `convert'.
   The purpose of this function is to generate error messages for assignments that are not allowed in Pascal.
   ERRTYPE is a string to use in error messages:
   "assignment", "return", etc. If it is null, this is parameter passing for a function
   call (and different error messages are output). Otherwise, it may be a name stored
   in the spelling stack and interpreted by get_spelling.
   FUNDECL is the declaration of the function being called or null.
   PARMNUM is the number of the argument, for printing in error messages. */
tree
convert_for_assignment (type, rhs, errtype, fundecl, parmnum)
     tree type, rhs;
     const char *errtype;
     tree fundecl;
     int parmnum;
{
  enum tree_code codel = TREE_CODE (type), coder;
  tree rhstype;

  /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue.
     Do not use STRIP_NOPS here. We do not want an enumerator
     whose value is 0 to count as a null pointer constant. */
  if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
    rhs = TREE_OPERAND (rhs, 0);

  /* default_conversion() does not convert array and function types in GPC. */
  if (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
    {
      rhs = build_unary_op (ADDR_EXPR, rhs, 0);
      /* Create a reference rather than a pointer. */
      rhs = convert (build_reference_type (TREE_TYPE (TREE_TYPE (rhs))), rhs);
    }
  else if (optimize && TREE_CODE (rhs) == VAR_DECL)
    rhs = decl_constant_value (rhs);

  rhstype = TREE_TYPE (rhs);
  coder = TREE_CODE (rhstype);
  CHK_EM (rhstype);

  /* File assignments are never allowed.
     Exceptions: RTS parameters which are internally value file parameters.
     User-declared routines reject value file parameters on declaration,
     so we can accept all parameters here. */
  if (!parmnum && (contains_file_p (type) || contains_file_p (rhstype)))
    {
      error ("invalid assignment between files");
      return error_mark_node;
    }

  if (coder == VOID_TYPE)
    {
      error ("void value not ignored as it ought to be");
      return error_mark_node;
    }

  if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
    return (convert_and_check (type, rhs));

  /* Assignments of different object types must have been handled before. */
  if (PASCAL_TYPE_OBJECT (type) || PASCAL_TYPE_OBJECT (rhstype))
    {
      error ("invalid object assignment");
      return error_mark_node;
    }

  /* Check if lhs is a subrange
     @@ Is it possible that non-integer type subranges should have size conversions?
     If so, we should construct a limited type from the correct type in
     the first place, not by having to use INTEGER_TYPE node as a range specifier. */
  codel = TREE_CODE (type);
  coder = TREE_CODE (rhstype);

  if (ORDINAL_REAL_OR_COMPLEX_TYPE (codel) && compatible_assignment_p (type, rhstype))
    return convert_and_check (type, rhs);

  /* Assignments of procedural variables. */
  else if (codel == REFERENCE_TYPE && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
    {
      if (coder == REFERENCE_TYPE
          && TREE_CODE (TREE_TYPE (rhstype)) == FUNCTION_TYPE
          && comp_target_types (type, rhstype))
        return convert (type, rhs);
      if (coder == POINTER_TYPE && integer_zerop (rhs))
        return convert (type, rhs);
    }

  else if (codel != coder)
    ;

  /* Conversions among pointers */
  else if (codel == POINTER_TYPE)
    {
      tree ttl = TREE_TYPE (type);
      tree ttr = TREE_TYPE (rhstype);
      CHK_EM (ttl);
      CHK_EM (ttr);

      /* Any non-function converts to an untyped pointer and vice versa;
         otherwise, targets must be the same.
         Meanwhile, the lhs target must have all the qualifiers of the rhs. */
      if (TYPE_MAIN_VARIANT (ttl) == void_type_node
          || TYPE_MAIN_VARIANT (ttr) == void_type_node
          || comp_target_types (type, rhstype)
          || comp_object_or_schema_pointer_types (ttl, ttr))
        {
          /* Const and volatile mean something different for function types,
             so the usual warnings are not appropriate. */
          if (TREE_CODE (ttr) != FUNCTION_TYPE && TREE_CODE (ttl) != FUNCTION_TYPE)
            {
              if (!TYPE_READONLY (ttl) && TYPE_READONLY (ttr))
                assignment_error_or_warning ("%s discards `const' from pointer target type",
                                             errtype, fundecl, parmnum, 0);
              else if (!TYPE_VOLATILE (ttl) && TYPE_VOLATILE (ttr))
                assignment_error_or_warning ("%s discards `volatile' from pointer target type",
                                             errtype, fundecl, parmnum, 0);
              else if (TREE_CODE (ttl) == INTEGER_TYPE && TREE_CODE (ttr) == INTEGER_TYPE)
                {
                  if (TREE_UNSIGNED (ttl) != TREE_UNSIGNED (ttr))
                    {
                      if (TYPE_PRECISION (ttl) != TYPE_PRECISION (ttr))
                        assignment_error_or_warning ("pointer targets in %s differ in size and signedness",
                                                     errtype, fundecl, parmnum, 1);
                      else
                        assignment_error_or_warning ("pointer targets in %s differ in signedness",
                                                     errtype, fundecl, parmnum, 1);
                    }
                  else if (TYPE_PRECISION (ttl) != TYPE_PRECISION (ttr))
                    assignment_error_or_warning ("pointer targets in %s differ in size",
                                                 errtype, fundecl, parmnum, 1);
                }
            }
          else if (TREE_CODE (ttl) == FUNCTION_TYPE && TREE_CODE (ttr) == FUNCTION_TYPE)
            {
              /* Because const and volatile on functions are restrictions
                 that say the function will not do certain things,
                 it is okay to use a const or volatile function
                 where an ordinary one is wanted, but not vice-versa. */
              if (TYPE_READONLY (ttl) && !TYPE_READONLY (ttr))
                assignment_error_or_warning ("%s makes const function pointer from non-const",
                                             errtype, fundecl, parmnum, 0);
              if (TYPE_VOLATILE (ttl) && !TYPE_VOLATILE (ttr))
                assignment_error_or_warning ("%s makes volatile function pointer from non-volatile",
                                             errtype, fundecl, parmnum, 0);
            }
        }
      else
        assignment_error_or_warning ("%s from incompatible pointer type", errtype, fundecl, parmnum, 1);
      return convert (type, rhs);
    }
  /* Array assignments. */
  else if (codel == ARRAY_TYPE)
    {
      if (!comptypes (type, rhstype))
        {
          if (errtype)
            error ("type mismatch in array %s", get_spelling (errtype));
          else if (fundecl && DECL_NAME (fundecl))
            {
              error ("passing arg %d of `%s' from incompatible array", parmnum, IDENTIFIER_NAME (DECL_NAME (fundecl)));
              error_with_decl (fundecl, " routine declaration");
            }
          else
            error ("passing arg %d from incompatible array", parmnum);
          return error_mark_node;
        }
      return rhs;  /* No conversion */
    }
  /* Record assignments. */
  else if (codel == RECORD_TYPE)
    {
      if (!comptypes (type, rhstype))
        {
          if (errtype)
            error ("type mismatch in record %s", get_spelling (errtype));
          else if (fundecl && DECL_NAME (fundecl))
            {
              error ("passing arg %d of `%s' from incompatible record or schema",
                     parmnum, IDENTIFIER_NAME (DECL_NAME (fundecl)));
              error_with_decl (fundecl, " routine declaration");
            }
          else
            error ("passing arg %d from incompatible record or schema", parmnum);
          return error_mark_node;
        }
      else
        return rhs;
    }
  /* Set assignments. */
  else if (codel == SET_TYPE && rhstype == empty_set_type_node)
    return rhs;
  else if (codel == SET_TYPE)
    {
      if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (rhstype)), TYPE_MAIN_VARIANT (TREE_TYPE (type))))
        {
          tree lhs_domain = TYPE_DOMAIN (type);
          tree rhs_domain = TYPE_DOMAIN (rhstype);
          if (TYPE_MIN_VALUE (lhs_domain) == TYPE_MIN_VALUE (rhs_domain)
              && TYPE_MAX_VALUE (lhs_domain) == TYPE_MAX_VALUE (rhs_domain))
            return rhs;  /* No conversions */
          else
            return convert (type, rhs);
        }
    }
  /* Complex assignments. */
  else if (codel == COMPLEX_TYPE)
    {
      /* @@@@ Take care of ARG!!! */
      if (TREE_CODE (rhs) == REALPART_EXPR || TREE_CODE (rhs) == IMAGPART_EXPR)
        return rhs;
    }
  if (errtype)
    error ("incompatible types in %s", get_spelling (errtype));
  else if (fundecl && DECL_NAME (fundecl))
    {
      error ("incompatible type for argument %d of `%s'", parmnum, IDENTIFIER_NAME (DECL_NAME (fundecl)));
      error_with_decl (fundecl, " routine declaration");
    }
  else
    error ("incompatible type for argument %d of indirect function call", parmnum);
  return error_mark_node;
}

/* Same as warn_for_assignment(), but as an error message. */
static void
assignment_error_or_warning (msg, errtype, fundecl, argnum, error_flag)
     const char *msg, *errtype;
     tree fundecl;
     int argnum, error_flag;
{
  static const char *const argstring = "passing arg %d of `%s'";
  static const char *const argnofun = "passing arg %d";
  const char *opname = get_spelling (errtype);
  tree name = fundecl ? DECL_NAME (fundecl) : NULL_TREE;
  if (!opname)
    {
      char *p;
      if (name)
        {
          /* Routine name is known; supply it. */
          p = (char *) alloca (strlen (IDENTIFIER_NAME (name)) + sizeof (argstring) + 25 /*%d*/ + 1);
          sprintf (p, argstring, argnum, IDENTIFIER_NAME (name));
        }
      else
        {
          /* Routine name unknown (call through ptr); just give arg number. */
          p = (char *) alloca (sizeof (argnofun) + 25 /*%d*/ + 1);
          sprintf (p, argnofun, argnum);
        }
      opname = p;
    }
  if (error_flag)
    {
      error (msg, opname);
      if (name)
        error_with_decl (fundecl, " routine declaration");
    }
  else
    {
      warning (msg, opname);
      if (name)
        warning_with_decl (fundecl, " routine declaration");
    }
}

#ifndef EGCS97
/* Return nonzero if VALUE is a valid constant-valued expression
   for use in initializing a static variable; one that can be an
   element of a "constant" initializer.
   Return null_pointer_node if the value is absolute;
   if it is relocatable, return the variable that determines the relocation.
   We assume that VALUE has been folded as much as possible; therefore, we
   do not need to check for such things as arithmetic-combinations of integers. */
tree
initializer_constant_valid_p (value, endtype)
     tree value;
     tree endtype;
{
  switch (TREE_CODE (value))
  {
    case CONSTRUCTOR:
      if (RECORD_OR_UNION (TREE_CODE (TREE_TYPE (value)))
          && TREE_CONSTANT (value)
          && CONSTRUCTOR_ELTS (value))
        return initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)), endtype);

      return TREE_STATIC (value) ? null_pointer_node : 0;

    case INTEGER_CST:
    case REAL_CST:
    case STRING_CST:
    case COMPLEX_CST:
      return null_pointer_node;

    case ADDR_EXPR:
      return TREE_OPERAND (value, 0);

    case NON_LVALUE_EXPR:
      return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);

    case CONVERT_EXPR:
    case NOP_EXPR:
      /* Allow conversions between reference and pointer types. */
      if ((TREE_CODE (TREE_TYPE (value)) == POINTER_TYPE
           || TREE_CODE (TREE_TYPE (value)) == REFERENCE_TYPE)
          && (TREE_CODE (TREE_TYPE (TREE_OPERAND (value, 0))) == POINTER_TYPE
              || TREE_CODE (TREE_TYPE (TREE_OPERAND (value, 0))) == REFERENCE_TYPE))
        return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);

      /* Allow conversions between real types. */
      if (TREE_CODE (TREE_TYPE (value)) == REAL_TYPE
          && TREE_CODE (TREE_TYPE (TREE_OPERAND (value, 0))) == REAL_TYPE)
        return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);

      /* Allow length-preserving conversions between integer types. */
      if (TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
          && TREE_CODE (TREE_TYPE (TREE_OPERAND (value, 0))) == INTEGER_TYPE
          && (TYPE_PRECISION (TREE_TYPE (value)) == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
        return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);

      /* Allow conversions between other integer types only if explicit value. */
      if (TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
          && TREE_CODE (TREE_TYPE (TREE_OPERAND (value, 0))) == INTEGER_TYPE)
        {
          tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
          if (inner == null_pointer_node)
            return null_pointer_node;
          return 0;
        }

      /* Allow (int) &foo provided int is as wide as a pointer. */
      if (TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
          && TREE_CODE (TREE_TYPE (TREE_OPERAND (value, 0))) == POINTER_TYPE
          && (TYPE_PRECISION (TREE_TYPE (value)) >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
        return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);

      /* Likewise conversions from int to pointers. */
      if (TREE_CODE (TREE_TYPE (value)) == POINTER_TYPE
          && TREE_CODE (TREE_TYPE (TREE_OPERAND (value, 0))) == INTEGER_TYPE
          && (TYPE_PRECISION (TREE_TYPE (value)) <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
        return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);

      /* Allow conversion to array type (for packed arrays) */
      if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE)
        return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);

      return 0;

    case PLUS_EXPR:
      if (TREE_CODE (endtype) == INTEGER_TYPE
          && TYPE_PRECISION (endtype) < POINTER_SIZE)
        return 0;
      {
        tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
        tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1), endtype);
        /* If either term is absolute, use the other terms relocation. */
        if (valid0 == null_pointer_node)
          return valid1;
        if (valid1 == null_pointer_node)
          return valid0;
        return 0;
      }

    case MINUS_EXPR:
      if (TREE_CODE (endtype) == INTEGER_TYPE
          && TYPE_PRECISION (endtype) < POINTER_SIZE)
        return 0;
      {
        tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
        tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1), endtype);
        /* Win if second argument is absolute. */
        if (valid1 == null_pointer_node)
          return valid0;
        /* Win if both arguments have the same relocation.
           Then the value is absolute. */
        if (valid0 == valid1)
          return null_pointer_node;
        return 0;
      }

    default:
      return 0;
  }
}
#endif

/* Methods for storing and printing names for error messages. */

/* Implement a spelling stack that allows components of a name to be pushed
   and popped. Each element on the stack is this structure. */
struct spelling
{
  int kind;
  union
  {
    int i;
    const char *s;
  } u;
};

#define SPELLING_STRING 1
#define SPELLING_MEMBER 2
#define SPELLING_INDEX 3

static struct spelling *spelling;       /* Next stack element (unused). */
static struct spelling *spelling_base;  /* Spelling stack base. */
static int spelling_size;               /* Size of the spelling stack. */

/* Macros to save and restore the spelling stack around push_... functions.
   Alternative to SAVE_SPELLING_STACK. */
#define SPELLING_DEPTH() (spelling - spelling_base)
#define RESTORE_SPELLING_DEPTH(depth) (spelling = spelling_base + depth)

/* Save and restore the spelling stack around arbitrary C code. */
#define SAVE_SPELLING_DEPTH(code) \
{ \
  int __depth = SPELLING_DEPTH (); \
  code; \
  RESTORE_SPELLING_DEPTH (__depth); \
}

/* Push an element on the spelling stack with type KIND and assign VALUE to MEMBER. */
#define PUSH_SPELLING(KIND, VALUE, MEMBER) \
{ \
  int depth = SPELLING_DEPTH (); \
  if (depth >= spelling_size) \
    { \
      spelling_size += 10; \
      if (!spelling_base) \
        spelling_base = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
      else  \
        spelling_base \
          = (struct spelling *) xrealloc (spelling_base, spelling_size * sizeof (struct spelling)); \
      RESTORE_SPELLING_DEPTH (depth); \
    } \
  spelling->kind = (KIND); \
  spelling->MEMBER = (VALUE); \
  spelling++; \
}

/* Push STRING on the stack. Printed literally. */
static void
push_string (string)
     const char *string;
{
  PUSH_SPELLING (SPELLING_STRING, string, u.s);
}

/* Push a member name on the stack. Printed as '.' STRING. */
static void
push_member_name (decl)
     tree decl;
{
  const char *string = DECL_NAME (decl) ? IDENTIFIER_NAME (DECL_NAME (decl)) : "<anonymous>";
  PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
}

/* Push an array index on the stack. Printed as [index]. */
static void
push_array_index (index)
     int index;
{
  PUSH_SPELLING (SPELLING_INDEX, index, u.i);
}

/* Print the spelling to BUFFER and return it. */
static char *
print_spelling ()
{
  char *buffer, *d;
  const char *s;
  int size = 0;
  struct spelling *p;
  for (p = spelling_base; p < spelling; p++)
    if (p->kind == SPELLING_INDEX)
      size += 25;
    else
      size += strlen (p->u.s) + 1;
  d = buffer = (char *) xmalloc (size + 1);
  for (p = spelling_base; p < spelling; p++)
    if (p->kind == SPELLING_INDEX)
      {
        sprintf (d, "[%d]", p->u.i);
        d += strlen (d);
      }
    else
      {
        if (p->kind == SPELLING_MEMBER)
          *d++ = '.';
        for (s = p->u.s; (*d = *s++); d++)
          ;
      }
  *d++ = 0;
  return buffer;
}

/* Provide a means to pass component names derived from the spelling stack. */
char initialization_message;

/* Interpret the spelling of the given ERRTYPE message. */
static const char *
get_spelling (errtype)
     const char *errtype;
{
  if (errtype == &initialization_message)
    return concat ("initialization of `", print_spelling (), "'", NULL);
  return errtype;
}

/* Issue an error message for a bad initializer component.
   FORMAT describes the message. OFWHAT is the name for the component.
   LOCAL is a format string for formatting the insertion of the name
   into the message.

   If OFWHAT is null, the component name is stored on the spelling stack.
   If the component name is a null string, then LOCAL is omitted entirely. */
static void
initializer_error (format, local)
     const char *format, *local;
{
  char *ofwhat = print_spelling ();
  if (*ofwhat)
    {
      char *buffer = (char *) alloca (strlen (local) + strlen (ofwhat) + 2);
      sprintf (buffer, local, ofwhat);
      error (format, buffer);
    }
  else
    error (format, "");
  free (ofwhat);
}

/* Digest parser output as an initializer for `type'. Return an expression of
   that type to represent the initial value. Setting require_constant requests
   errors if non-constant initializers or elements are seen. */
tree
digest_init (type, init, require_constant)
     tree type, init;
     int require_constant;
{
  enum tree_code code = TREE_CODE (type);
  tree inside_init = init;
  CHK_EM (init);

  /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
  /* Do not use STRIP_NOPS here. We do not want an enumerator
     whose value is 0 to count as a null pointer constant. */
  if (TREE_CODE (init) == NON_LVALUE_EXPR)
    inside_init = TREE_OPERAND (init, 0);

  /* Initialization of an array of chars from a string constant
     optionally enclosed in braces. */

  if (code == ARRAY_TYPE)
    {
      tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
      if ((typ1 == char_type_node || typ1 == wchar_type_node)
          && ((inside_init && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)))
        {
          if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)), TYPE_MAIN_VARIANT (type)))
            return inside_init;

          if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init))) != char_type_node)
              && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
            {
              initializer_error ("char-array%s initialized from wide string", " `%s'");
              return error_mark_node;
            }
          if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init))) == char_type_node)
              && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
            {
              initializer_error ("wide-char array%s initialized from non-wide string", " `%s'");
              return error_mark_node;
            }

          if (TREE_CODE (inside_init) == STRING_CST)
            {
              TREE_TYPE (inside_init) = type;
              if (TYPE_DOMAIN (type) && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST)
                {
                  int size = TREE_INT_CST_LOW (TYPE_SIZE (type));
                  size = (size + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
                  /* Subtract 1 (or sizeof (wchar_t)) to ignore the terminating
                     null char that is counted in the length of the constant. */
                  if (size < TREE_STRING_LENGTH (inside_init)
                      - (TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node)
                         ? TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT : 1))
                    initializer_error ("initializer-string for array of chars%s is too long", " `%s'");
                }
            }
          return inside_init;
        }
    }

  /* Any type can be initialized
     from an expression of the same type, optionally with braces. */

  if (inside_init && TREE_TYPE (inside_init)
      && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)), TYPE_MAIN_VARIANT (type))
          || (code == ARRAY_TYPE && comptypes (TREE_TYPE (inside_init), type))
          || (code == SET_TYPE && comptypes (TREE_TYPE (inside_init), type))
          || (code == POINTER_TYPE
              && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
                  || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE)
              && comptypes (TREE_TYPE (TREE_TYPE (inside_init)), TREE_TYPE (type)))))
    {
      if (code == POINTER_TYPE
          && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
              || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE))
        inside_init = default_conversion (inside_init);

      if (optimize && TREE_CODE (inside_init) == VAR_DECL)
        inside_init = decl_constant_value (inside_init);

      if (require_constant && !TREE_CONSTANT (inside_init))
        {
          initializer_error ("initializer element%s is not constant", " for `%s'");
          inside_init = error_mark_node;
        }
      else if (require_constant && !initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)))
        {
          initializer_error ("initializer element%s is not computable at load time", " for `%s'");
          inside_init = error_mark_node;
        }

      return inside_init;
    }

  /* Handle scalar types, including conversions. */
  if (SCALAR_TYPE (code))
    {
      /* Note that convert_for_assignment calls default_conversion
         for arrays and functions. We must not call it in the
         case where inside_init is a null pointer constant. */
      inside_init = convert_for_assignment (type, init, "initialization", NULL_TREE, 0);

      if (EM (inside_init))
        ;
      else if (require_constant && !TREE_CONSTANT (inside_init))
        {
          initializer_error ("initializer element%s is not constant", " for `%s'");
          inside_init = error_mark_node;
        }
      else if (require_constant && !initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)))
        {
          initializer_error ("initializer element%s is not computable at load time", " for `%s'");
          inside_init = error_mark_node;
        }
      return inside_init;
    }

  /* Come here only for records and arrays. */
  if (TYPE_SIZE (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
    {
      initializer_error ("variable-sized object%s may not be initialized", " `%s'");
      return error_mark_node;
    }
  initializer_error ("invalid initializer%s", " for `%s'");
  return error_mark_node;
}

/* Handle initializers that use braces. */

/* Type of object we are accumulating a constructor for.
   This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
static tree constructor_type;

/* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields left to fill. */
static tree constructor_fields;

/* For an ARRAY_TYPE, this is the specified index
   at which to store the next element we get. */
static tree constructor_index;

/* For an ARRAY_TYPE, this is the end index of the range
   to initialize with the next element, or NULL in the ordinary case
   where the element is used just once. */
static tree constructor_range_end;

/* For an ARRAY_TYPE, this is the maximum index. */
static tree constructor_max_index;

/* For a RECORD_TYPE, this is the first field not yet written out. */
static tree constructor_unfilled_fields;

/* For an ARRAY_TYPE, this is the index of the first element
   not yet written out. */
static tree constructor_unfilled_index;

/* If we are saving up the elements rather than allocating them,
   this is the list of elements so far (in reverse order,
   most recent first). */
static tree constructor_elements;

/* 1 if so far this constructor's elements are all compile-time constants. */
static int constructor_constant;

/* 1 if so far this constructor's elements are all valid address constants. */
static int constructor_simple;

/* 1 if this constructor is erroneous so far. */
static int constructor_erroneous;

/* List of pending elements at this constructor level.
   These are elements encountered out of order which belong at
   places we haven't reached yet in actually writing the output. */
static tree constructor_pending_elts;

/* The SPELLING_DEPTH of this constructor. */
static int constructor_depth;

static int require_constant_value;
static int require_constant_elements;

/* This stack has a level for each structure level in the initializer, including
   the outermost one. It saves the values of most of the variables above. */
struct constructor_stack
{
  struct constructor_stack *next;
  tree type;
  tree fields;
  tree index;
  tree range_end;
  tree max_index;
  tree unfilled_index;
  tree unfilled_fields;
  tree elements;
  int offset;
  tree pending_elts;
  int depth;
  /* If nonzero, this value should replace the entire constructor at this level. */
  tree replacement_value;
  char constant;
  char simple;
  char erroneous;
  char outer;
};

struct constructor_stack *constructor_stack;

/* Recursive subroutine of build_pascal_initializer():
   Process one level (array or record) of a structured initializer. */
static void
process_init_list (init)
     tree init;
{
  /* Do not crash on errors */
  if (!constructor_type)
    return;
  if (PASCAL_TYPE_SCHEMA (constructor_type))
    {
      set_init_label (schema_id);
      push_init_level ();
      process_init_list (init);
      process_init_element (pop_init_level ());
      return;
    }
  for (; init; init = TREE_CHAIN (init))
    {
      tree ninit, field = TREE_PURPOSE (init);
      if (field)
        {
          if (TREE_CODE (constructor_type) == UNION_TYPE)
            {
              set_init_variant (TREE_PURPOSE (field));
              push_init_level ();
              process_init_list (init);
              process_init_element (pop_init_level ());
              return;
            }
          else if (TREE_CODE (constructor_type) == RECORD_TYPE)
            {
              tree cuf = constructor_unfilled_fields;
              if (!TREE_PURPOSE (field) && TREE_VALUE (field))
                {
                  if (TREE_VALUE (field) != integer_zero_node)
                    {
                      set_init_label (TREE_VALUE (field));
                      process_init_element (TREE_VALUE (init));
                    }
                  init = TREE_CHAIN (init);
                  while (cuf && DECL_NAME (cuf))
                    cuf = TREE_CHAIN (cuf);
                  if (!cuf)
                    {
                      error ("record has no variant part");
                      return;
                    }
                }
              if (!DECL_NAME (cuf))
                {
                  assert (TREE_CODE (TREE_TYPE (cuf)) == UNION_TYPE);
                  constructor_fields = cuf;
                  push_init_level ();
                  process_init_list (init);
                  process_init_element (pop_init_level ());
                  return;
                }
              else
                {
                  assert (!TREE_VALUE (field));
                  set_init_label (TREE_PURPOSE (field));
                }
             }
          else
            {
              assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
              if (!TREE_PURPOSE (field) && !TREE_VALUE (field))
                {
                  tree value;
                  assert (!TREE_CHAIN (init) && TREE_VALUE (init));
                  if (TREE_CODE (TREE_VALUE (init)) == TREE_LIST)
                    {
                      push_init_level ();
                      process_init_list (TREE_VALUE (init));
                      value = pop_init_level ();
                    }
                  else
                    value = TREE_VALUE (init);
                  value = save_expr (value);
                  process_otherwise (value);
                  return;
                }
              else
                set_init_index (TYPE_DOMAIN (constructor_type), TREE_PURPOSE (field), TREE_VALUE (field));
            }
        }
      if (!TREE_VALUE (init) || TREE_CODE (TREE_VALUE (init)) == TREE_LIST)
        {
          push_init_level ();
          process_init_list (TREE_VALUE (init));
          ninit = pop_init_level ();
        }
      else
        ninit = TREE_VALUE (init);
      if (field && TREE_CHAIN (field))
        {
          tree value = save_expr (ninit);
          while (1)
            {
              process_init_element (value);
              field = TREE_CHAIN (field);
              if (!field)
                break;
              if (TREE_CODE (constructor_type) == RECORD_TYPE)
                {
                  assert (!TREE_VALUE (field));
                  set_init_label (TREE_PURPOSE (field));
                }
              else
                {
                  assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
                  set_init_index (TYPE_DOMAIN (constructor_type),
                                  TREE_PURPOSE (field),
                                  TREE_VALUE (field));
                }
            }
        }
      else
        process_init_element (ninit);
    }
}

/* Build the actual constructor for the variable declaration DECL out of
   the tree list INIT. It is assumed that check_pascal_initializer()
   already has been called for INIT and returned 0; otherwise this may crash. */
tree
build_pascal_initializer (decl, type, init)
     tree decl, type, init;
{
  if ((decl && EM (decl)) || !init || EM (init))
    return NULL_TREE;  /* avoid further error messages */
  assert (TREE_CODE (init) == TREE_LIST);

  constructor_elements = NULL_TREE;
  constructor_stack = 0;
  spelling_base = 0;
  spelling_size = 0;
  RESTORE_SPELLING_DEPTH (0);
  if (decl)
    {
      require_constant_value = TREE_STATIC (decl);
      require_constant_elements = TREE_STATIC (decl)
        /* For a scalar, you can always use any value to initialize, even within braces. */
        && STRUCTURED_TYPE (TREE_CODE (type));
      push_string (IDENTIFIER_NAME (DECL_NAME (decl)));
    }
  else
    {
      require_constant_value = 0;
      require_constant_elements = 0;
      push_string ("(anonymous)");
    }

  if (!TREE_VALUE (init) || TREE_CODE (TREE_VALUE (init)) == TREE_LIST)
    {
      really_start_incremental_init (type);
      process_init_list (TREE_VALUE (init));
      init = pop_init_level ();
    }
  else if (PASCAL_TYPE_SCHEMA (type))
    {
      really_start_incremental_init (type);
      set_init_label (schema_id);
      process_init_element (TREE_VALUE (init));
      init = pop_init_level ();
    }
  else
    init = TREE_VALUE (init);
  /* Free the whole constructor stack of this initializer. */
  while (constructor_stack)
    {
      struct constructor_stack *q = constructor_stack;
      constructor_stack = q->next;
      free (q);
    }
  return init;
}

/* Call here when we see the initializer is surrounded by braces.
   This is instead of a call to push_init_level;
   it is matched by a call to pop_init_level. */
static void
really_start_incremental_init (type)
     tree type;
{
  struct constructor_stack *p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
  p->type = constructor_type;
  p->fields = constructor_fields;
  p->index = constructor_index;
  p->range_end = constructor_range_end;
  p->max_index = constructor_max_index;
  p->unfilled_index = constructor_unfilled_index;
  p->unfilled_fields = constructor_unfilled_fields;
  p->elements = constructor_elements;
  p->constant = constructor_constant;
  p->simple = constructor_simple;
  p->erroneous = constructor_erroneous;
  p->pending_elts = constructor_pending_elts;
  p->depth = constructor_depth;
  p->replacement_value = 0;
  p->outer = 0;
  p->next = 0;
  constructor_stack = p;

  constructor_constant = 1;
  constructor_simple = 1;
  constructor_depth = SPELLING_DEPTH ();
  constructor_elements = NULL_TREE;
  constructor_pending_elts = NULL_TREE;
  constructor_type = type;

  if (PASCAL_TYPE_FILE (constructor_type))
    error ("file variables cannot have an initializer");

  if (RECORD_OR_UNION (TREE_CODE (constructor_type)))
    {
      constructor_fields = TYPE_FIELDS (constructor_type);
      constructor_unfilled_fields = constructor_fields;
    }
  else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
    {
      constructor_range_end = NULL_TREE;
      assert (TYPE_DOMAIN (constructor_type));
      constructor_max_index = convert (ssizetype, TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)));
      constructor_index = convert (ssizetype, TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
      constructor_unfilled_index = constructor_index;
    }
  else
    {
      /* Handle the case of int x = { 5 }; */
      constructor_fields = constructor_type;
      constructor_unfilled_fields = constructor_type;
    }
}

/* Push down into a subobject, for initialization. */
static void
push_init_level ()
{
  struct constructor_stack *p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
  p->type = constructor_type;
  p->fields = constructor_fields;
  p->index = constructor_index;
  p->range_end = constructor_range_end;
  p->max_index = constructor_max_index;
  p->unfilled_index = constructor_unfilled_index;
  p->unfilled_fields = constructor_unfilled_fields;
  p->elements = constructor_elements;
  p->constant = constructor_constant;
  p->simple = constructor_simple;
  p->erroneous = constructor_erroneous;
  p->pending_elts = constructor_pending_elts;
  p->depth = constructor_depth;
  p->replacement_value = NULL_TREE;
  p->outer = 0;
  p->next = constructor_stack;
  constructor_stack = p;

  constructor_constant = 1;
  constructor_simple = 1;
  constructor_depth = SPELLING_DEPTH ();
  constructor_elements = NULL_TREE;
  constructor_pending_elts = NULL_TREE;

  /* Don't die if an entire brace-pair level is superfluous in the containing level. */
  if (!constructor_type)
    ;
  else if (RECORD_OR_UNION (TREE_CODE (constructor_type)))
    {
      /* Don't die if there are extra init elts at the end. */
      if (!constructor_fields)
        constructor_type = 0;
      else
        {
          constructor_type = TREE_TYPE (constructor_fields);
          push_member_name (constructor_fields);
          constructor_depth++;
        }
    }
  else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
    {
      constructor_type = TREE_TYPE (constructor_type);
      push_array_index (tree_low_cst (constructor_index, 0));
      constructor_depth++;
    }

  if (!constructor_type)
    {
      initializer_error ("extra parenthesized group at end of initializer%s", " for `%s'");
      constructor_fields = NULL_TREE;
      constructor_unfilled_fields = NULL_TREE;
      return;
    }

  if (RECORD_OR_UNION (TREE_CODE (constructor_type)))
    {
      constructor_fields = TYPE_FIELDS (constructor_type);
      constructor_unfilled_fields = constructor_fields;
    }
  else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
    {
      constructor_range_end = NULL_TREE;
      assert (TYPE_DOMAIN (constructor_type));
      constructor_max_index = convert (ssizetype, TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)));
      constructor_index = convert (ssizetype, TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
      constructor_unfilled_index = constructor_index;
    }
  else
    {
      initializer_error ("invalid initializer%s", " for `%s'");
      constructor_type = NULL_TREE;
      constructor_fields = NULL_TREE;
      constructor_unfilled_fields = NULL_TREE;
      return;
    }

  if (PASCAL_TYPE_FILE (constructor_type))
    error ("file variables cannot have an initializer");
}

static tree
build_bitfields_type (ftype, fcnt)
     tree ftype;
     int fcnt;
{
  tree fields = NULL_TREE, type;
  int save_defining_packed_type = defining_packed_type;
  defining_packed_type = 1;
  while (fcnt--)
    {
      tree t;
      char namestr[20];
      sprintf (namestr, "f%d", fcnt);
      t = build_field (get_identifier (namestr), ftype);
      TREE_CHAIN (t) = fields;
      fields = t;
    }
  type = finish_struct (start_struct (RECORD_TYPE), fields, 1);
  defining_packed_type = save_defining_packed_type;
  return type;
}

static tree
do_build_constructor_rev (type, el)
     tree type, el;
{
  tree constructor = build_constructor (type, nreverse (el));
  if (constructor_constant)
    TREE_CONSTANT (constructor) = 1;
  if (constructor_constant && constructor_simple)
    TREE_STATIC (constructor) = 1;
  return constructor;
}

static tree
fill_one_record (pel, min, ptype, fields, maxnr, pnr)
     tree *pel, min, ptype, *fields;
     HOST_WIDE_INT maxnr, *pnr;
{
  tree prl = NULL_TREE;
  tree el = *pel;
  HOST_WIDE_INT oanr = 0;
  int first = 1;
  while (el)
    {
      tree tnr = size_binop (MINUS_EXPR,
                   convert (sbitsizetype, TREE_PURPOSE (el)),
                   convert (sbitsizetype, min));
      HOST_WIDE_INT nr = TREE_INT_CST_LOW (tnr);
      HOST_WIDE_INT anr = nr / BITS_PER_UNIT;
      nr = nr % BITS_PER_UNIT;
      if (first)
        {
          if (anr >= maxnr)
            return NULL_TREE;
          *pnr = oanr = anr;
          first = 0;
        }
      if (anr != oanr)
        break;
      prl = tree_cons (fields[nr], TREE_VALUE (el), prl);
      el = TREE_CHAIN (el);
      *pel = el;
    }
  return prl ? do_build_constructor_rev (ptype, prl) : NULL_TREE;
}

static tree
fake_packed_array_constructor ()
{
  tree rtype = NULL_TREE, rfields = NULL_TREE, rl = NULL_TREE;
  tree type = constructor_type, el = nreverse (constructor_elements);
  tree tsize = pascal_array_type_nelts (type);
  HOST_WIDE_INT size = TREE_INT_CST_LOW (tsize), asize = size / BITS_PER_UNIT;
  int psize = size % BITS_PER_UNIT;
  if (size <= 0 || TREE_INT_CST_HIGH (tsize))
    {
      error ("array too large");
      return error_mark_node;
    }
  if (asize)
    {
      tree ptype = build_bitfields_type (TREE_TYPE (type), BITS_PER_UNIT);
      tree fields[BITS_PER_UNIT];
      tree atype, arfield, al = NULL_TREE, t;
      int i;
      for (i = 0, t = TYPE_FIELDS (ptype); i < BITS_PER_UNIT; i++, t = TREE_CHAIN (t))
        fields[i] = t;
      atype = build_simple_array_type (ptype,
        build_pascal_range_type (integer_zero_node, build_int_2 (asize - 1, 0)));
      rfields = arfield = build_field (get_identifier ("array"), atype);
      while (el)
        {
          HOST_WIDE_INT anr;
          tree br = fill_one_record (&el, TYPE_MIN_VALUE (TYPE_DOMAIN (type)), ptype, fields, asize, &anr);
          if (!br)
            break;
          al = tree_cons (build_int_2 (anr, 0), br, al);
        }
      if (al)
        rl = build_tree_list (arfield, do_build_constructor_rev (atype, al));
    }
  if (psize)
    {
      tree ptype1 = build_bitfields_type (TREE_TYPE (type), psize);
      tree *fields1 = alloca (psize * sizeof (*fields1));
      tree prfield, t;
      int i;
      for (i = 0, t = TYPE_FIELDS (ptype1); i < psize; i++, t = TREE_CHAIN (t))
        fields1[i] = t;
      prfield = build_field (get_identifier ("pad"), ptype1);
      if (rfields)
        TREE_CHAIN (rfields) = prfield;
      else
        rfields = prfield;
      if (el)
        {
          HOST_WIDE_INT anr;
          tree pr1 = fill_one_record (&el, TYPE_MIN_VALUE (TYPE_DOMAIN (type)), ptype1, fields1, asize + 1, &anr);
          if (pr1)
            rl = tree_cons (prfield, pr1, rl);
        }
    }
  assert (!el);
  rtype = finish_struct (start_struct (RECORD_TYPE), rfields, 1);
  return build1 (NOP_EXPR, constructor_type, do_build_constructor_rev (rtype, rl));
}

/* Finish up at the end of a structure level of constructor.
   If we were outputting the elements as they are read, return 0
   from inner levels (process_init_element ignores that),
   but return error_mark_node from the outermost level
   (that's what we want to put in DECL_INITIAL).
   Otherwise, return a CONSTRUCTOR expression. */
static tree
pop_init_level ()
{
  struct constructor_stack *p;
  tree constructor = NULL_TREE;

  p = constructor_stack;

  /* Warn when some struct elements are implicitly initialized to zero. */
  if (extra_warnings
      && constructor_type
      && TREE_CODE (constructor_type) == RECORD_TYPE
      && constructor_unfilled_fields)
    {
      push_member_name (constructor_unfilled_fields);
      RESTORE_SPELLING_DEPTH (constructor_depth);
    }

  /* Now output all pending elements. */
  output_pending_init_elements (1);

  /* Pad out the end of the structure. */

  if (p->replacement_value)
    /* If this closes a superfluous brace pair, just pass out the element between them. */
    constructor = p->replacement_value;
  else if (!constructor_type)
    ;
  else if (!STRUCTURED_TYPE (TREE_CODE (constructor_type)))
    {
      /* A scalar initializer -- just return the element, after
         verifying there is just one. */
      assert (constructor_elements && !TREE_CHAIN (constructor_elements));
      constructor = TREE_VALUE (constructor_elements);
    }
  else
    {
      if (constructor_erroneous)
        constructor = error_mark_node;
      else
        {
#ifndef EGCS97
          int momentary = suspend_momentary ();
#endif
          if (TREE_CODE (constructor_type) == ARRAY_TYPE
              && constructor_max_index
              && TREE_CODE (constructor_max_index) == INTEGER_CST
              && !tree_int_cst_lt (constructor_max_index, constructor_unfilled_index))
            error_or_warning (co->pascal_dialect & E_O_PASCAL, "too few initializers for array");
          if (TREE_CODE (constructor_type) == ARRAY_TYPE
               && PASCAL_TYPE_PACKED (constructor_type)
               && !is_string_compatible_type (constructor_type, 0)
               && count_bits (TREE_TYPE (constructor_type)))
            constructor = fake_packed_array_constructor ();
          else
            constructor = build_constructor (constructor_type, nreverse (constructor_elements));
          if (constructor_constant)
            TREE_CONSTANT (constructor) = 1;
          if (constructor_constant && constructor_simple)
            TREE_STATIC (constructor) = 1;
#ifndef EGCS97
          resume_momentary (momentary);
#endif
        }
    }

  constructor_type = p->type;
  constructor_fields = p->fields;
  constructor_index = p->index;
  constructor_range_end = p->range_end;
  constructor_max_index = p->max_index;
  constructor_unfilled_index = p->unfilled_index;
  constructor_unfilled_fields = p->unfilled_fields;
  constructor_elements = p->elements;
  constructor_constant = p->constant;
  constructor_simple = p->simple;
  constructor_erroneous = p->erroneous;
  constructor_pending_elts = p->pending_elts;
  constructor_depth = p->depth;
  RESTORE_SPELLING_DEPTH (constructor_depth);

  constructor_stack = p->next;
  free (p);

  if (constructor)
    return constructor;
  assert (!constructor_stack);
  return error_mark_node;
}

/* Within an array initializer, specify the next index to be initialized.
   FIRST is that index. If LAST is nonzero, then initialize a range of
   indices, running from FIRST through LAST. */
static void
set_init_index (domain, first, last)
     tree domain, first, last;
{
  first = convert_for_assignment (domain, first, "array initializer index", NULL_TREE, 0);
  STRIP_NOPS (first);
  if (last)
    {
      last = convert_for_assignment (domain, last, "array initializer index upper bound", NULL_TREE, 0);
      STRIP_NOPS (last);
    }
  if (EM (first) || (last && EM (last)))
    return;
  assert (constructor_unfilled_index);
  if (TREE_CODE (first) != INTEGER_CST)
    initializer_error ("nonconstant array index in initializer%s", " for `%s'");
  else if (last && TREE_CODE (last) != INTEGER_CST)
    initializer_error ("nonconstant array index in initializer%s", " for `%s'");
  else if (tree_int_cst_lt (first, constructor_unfilled_index))
    initializer_error ("duplicate array index in initializer%s", " for `%s'");
  else
    {
      constructor_index = convert (ssizetype, first);
      if (last && tree_int_cst_lt (last, first))
        initializer_error ("empty index range in initializer%s", " for `%s'");
      else
        constructor_range_end = last;
    }
}

/* Within a struct initializer, specify the next field to be initialized. */
static void
set_init_label (fieldname)
     tree fieldname;
{
  tree tail;
  int passed = 0;
  assert (constructor_type);
  for (tail = TYPE_FIELDS (constructor_type); tail; tail = TREE_CHAIN (tail))
    {
      if (tail == constructor_unfilled_fields)
        passed = 1;
      if (DECL_NAME (tail) == fieldname)
        break;
    }
  if (!tail)
    error ("unknown field `%s' specified in initializer", IDENTIFIER_NAME (fieldname));
  else if (!passed)
    error ("field `%s' already initialized", IDENTIFIER_NAME (fieldname));
  else
    constructor_fields = tail;
}

static void
set_init_variant (fieldname)
     tree fieldname;
{
  tree fieldlst = find_field (constructor_type, fieldname, 0);
  if (!fieldlst)
    error ("unknown field `%s' specified in initializer", IDENTIFIER_NAME (fieldname));
  else
    constructor_fields = TREE_VALUE (fieldlst);
}

static void
process_otherwise (value)
     tree value;
{
  while (!tree_int_cst_lt (constructor_max_index, constructor_unfilled_index))
    {
      constructor_index = constructor_unfilled_index;
      push_array_index (TREE_INT_CST_LOW (constructor_index));
      output_init_element (value, TREE_TYPE (constructor_type), constructor_index, 1);
      RESTORE_SPELLING_DEPTH (constructor_depth);
    }
}

/* Collect the next constructor element in a list from which we will make a CONSTRUCTOR.
   TYPE is the data type that the containing data type wants here.
   FIELD is the field (a FIELD_DECL) or the index that this element fills.
   PENDING if non-zero means output pending elements that belong
   right after this element. (PENDING is normally 1;
   it is 0 while outputting pending elements, to avoid recursion.) */
static void
output_init_element (value, type, field, pending)
     tree value, type, field;
     int pending;
{
  int duplicate = 0;

  if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
      || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
          && !(TREE_CODE (value) == STRING_CST
               && TREE_CODE (type) == ARRAY_TYPE
               && TREE_CODE (TREE_TYPE (type)) == CHAR_TYPE)
          && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)), TYPE_MAIN_VARIANT (type))))
    value = default_conversion (value);

  if (EM (value))
    constructor_erroneous = 1;
  else if (!TREE_CONSTANT (value))
    constructor_constant = 0;
  else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
           || (RECORD_OR_UNION (TREE_CODE (constructor_type))
               && DECL_PACKED_FIELD (field)
               && TREE_CODE (value) != INTEGER_CST))
    constructor_simple = 0;

  if (EM (value))
    ;
  else if (require_constant_value && !TREE_CONSTANT (value))
    {
      initializer_error ("initializer element%s is not constant", " for `%s'");
      value = error_mark_node;
    }
  else if (require_constant_elements
           && !initializer_constant_valid_p (value, TREE_TYPE (value)))
    {
      initializer_error ("initializer element%s is not computable at load time", " for `%s'");
      value = error_mark_node;
    }

  /* If this element duplicates one on constructor_pending_elts, print a
     message and ignore it. Don't do this when we're processing elements taken
     off constructor_pending_elts, because we'd always get spurious errors. */
  if (pending)
    {
      if (RECORD_OR_UNION (TREE_CODE (constructor_type))
          && purpose_member (field, constructor_pending_elts))
        {
          initializer_error ("duplicate initializer%s", " for `%s'");
          duplicate = 1;
        }
      if (TREE_CODE (constructor_type) == ARRAY_TYPE)
        {
          tree tail;
          for (tail = constructor_pending_elts; tail; tail = TREE_CHAIN (tail))
            if (TREE_PURPOSE (tail)
                && TREE_CODE (TREE_PURPOSE (tail)) == INTEGER_CST
                && tree_int_cst_equal (TREE_PURPOSE (tail), constructor_index))
              break;

          if (tail)
            {
              initializer_error ("duplicate initializer%s", " for `%s'");
              duplicate = 1;
            }
        }
    }

  /* If this element doesn't come next in sequence,
     put it on constructor_pending_elts. */
  if (TREE_CODE (constructor_type) == ARRAY_TYPE
      && !tree_int_cst_equal (field, constructor_unfilled_index))
    {
      if (!duplicate)
        constructor_pending_elts = tree_cons (field,
          digest_init (type, value, require_constant_value), constructor_pending_elts);
    }
  else if (TREE_CODE (constructor_type) == RECORD_TYPE && field != constructor_unfilled_fields)
    {
      /* We do this for records but not for unions. In a union,
         no matter which field is specified, it can be initialized
         right away since it starts at the beginning of the union. */
      if (!duplicate)
        constructor_pending_elts = tree_cons (field,
          digest_init (type, value, require_constant_value), constructor_pending_elts);
    }
  else
    {
      /* Otherwise, output this element to constructor_elements. */
      if (!duplicate)
        constructor_elements = tree_cons (field,
          digest_init (type, value, require_constant_value), constructor_elements);

      /* Advance the variable that indicates sequential elements output. */
      if (TREE_CODE (constructor_type) == ARRAY_TYPE)
        constructor_unfilled_index = size_binop (PLUS_EXPR, constructor_unfilled_index, ssize_int (1));
      else if (TREE_CODE (constructor_type) == RECORD_TYPE)
        constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
      else if (TREE_CODE (constructor_type) == UNION_TYPE)
        constructor_unfilled_fields = 0;

      /* Now output any pending elements which have become next. */
      if (pending)
        output_pending_init_elements (0);
    }
}

/* Output any pending elements which have become next.
   As we output elements, constructor_unfilled_{fields,index}
   advances, which may cause other elements to become next;
   if so, they too are output.

   If ALL is 0, we return when there are no more pending elements
   to output now.

   If ALL is 1, we output space as necessary so that
   we can output all the pending elements. */
static void
output_pending_init_elements (all)
     int all;
{
  tree tail, next;

 retry:

  /* Look thru the whole pending list. If we find an element that
     should be output now, output it. Otherwise, set NEXT to the
     element that comes first among those still pending. */

  next = 0;
  for (tail = constructor_pending_elts; tail; tail = TREE_CHAIN (tail))
    {
      if (TREE_CODE (constructor_type) == ARRAY_TYPE)
        {
          if (tree_int_cst_equal (TREE_PURPOSE (tail), constructor_unfilled_index))
            {
              output_init_element (TREE_VALUE (tail),
                                   TREE_TYPE (constructor_type),
                                   constructor_unfilled_index, 0);
              goto retry;
            }
          else if (tree_int_cst_lt (TREE_PURPOSE (tail), constructor_unfilled_index))
            ;
          else if (!next || tree_int_cst_lt (TREE_PURPOSE (tail), next))
            next = TREE_PURPOSE (tail);
        }
      else if (RECORD_OR_UNION (TREE_CODE (constructor_type)))
        {
          if (TREE_PURPOSE (tail) == constructor_unfilled_fields)
            {
              output_init_element (TREE_VALUE (tail), TREE_TYPE (constructor_unfilled_fields),
                                   constructor_unfilled_fields, 0);
              goto retry;
            }
          else if (!constructor_unfilled_fields
                   || tree_int_cst_lt (bit_position (TREE_PURPOSE (tail)),
                                       bit_position (constructor_unfilled_fields)))
            ;
          else if (!next || tree_int_cst_lt (bit_position (TREE_PURPOSE (tail)), bit_position (next)))
            next = TREE_PURPOSE (tail);

        }
    }

  /* Ordinarily return, but not if we want to output all
     and there are elements left. */
  if (!(all && next))
    return;

  if (TREE_CODE (constructor_type) == ARRAY_TYPE
      && constructor_max_index
      && TREE_CODE (constructor_max_index) == INTEGER_CST
      && !tree_int_cst_lt (constructor_max_index, constructor_unfilled_index))
    error_or_warning (co->pascal_dialect & E_O_PASCAL, "too few initializers for array");
  /* Just skip over the gap, so that after
     jumping to retry we will output the next successive element. */
  if (RECORD_OR_UNION (TREE_CODE (constructor_type)))
    constructor_unfilled_fields = next;
  else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
    constructor_unfilled_index = convert (ssizetype, next);

  goto retry;
}

/* Add one non-braced element to the current constructor level.
   This adjusts the current position within the constructor's type.

   Once this has found the correct level for the new element,
   it calls output_init_element. */
static void
process_init_element (value)
     tree value;
{
  tree orig_value = value;
  int string_flag = TREE_CODE (value) == STRING_CST;

  /* Handle superfluous braces around string cst as in `char x[] = { "foo" };' */
  if (string_flag
      && constructor_type
      && TREE_CODE (constructor_type) == ARRAY_TYPE
      && TREE_CODE (TREE_TYPE (constructor_type)) == CHAR_TYPE
      && integer_zerop (constructor_unfilled_index))
    {
      constructor_stack->replacement_value = value;
      return;
    }

  if (constructor_stack->replacement_value)
    {
      initializer_error ("excess elements in record initializer%s", " after `%s'");
      return;
    }

  /* Ignore elements of a brace group if it is entirely superfluous
     and has already been diagnosed. */
  if (!constructor_type)
    return;

  while (1)
    {
      assert (value);
      if (TREE_CODE (constructor_type) == RECORD_TYPE)
        {
          tree fieldtype;
          enum tree_code fieldcode;

          if (!constructor_fields)
            {
              initializer_error ("excess elements in record initializer%s", " after `%s'");
              break;
            }

          fieldtype = TREE_TYPE (constructor_fields);
          if (!EM (fieldtype))
            fieldtype = TYPE_MAIN_VARIANT (fieldtype);
          fieldcode = TREE_CODE (fieldtype);

          /* Accept a string constant to initialize a subarray. */
          if (fieldcode == ARRAY_TYPE && TREE_CODE (TREE_TYPE (fieldtype)) == CHAR_TYPE && string_flag)
            value = orig_value;

          push_member_name (constructor_fields);
          output_init_element (value, fieldtype, constructor_fields, 1);
          RESTORE_SPELLING_DEPTH (constructor_depth);

          constructor_fields = TREE_CHAIN (constructor_fields);
          break;
        }
      if (TREE_CODE (constructor_type) == UNION_TYPE)
        {
          tree fieldtype;
          enum tree_code fieldcode;

          if (!constructor_fields)
            {
              initializer_error ("excess elements in variant record initializer%s", " after `%s'");
              break;
            }

          fieldtype = TREE_TYPE (constructor_fields);
          if (!EM (fieldtype))
            fieldtype = TYPE_MAIN_VARIANT (fieldtype);
          fieldcode = TREE_CODE (fieldtype);

          /* Accept a string constant to initialize a subarray. */
          if (fieldcode == ARRAY_TYPE && TREE_CODE (TREE_TYPE (fieldtype)) == CHAR_TYPE && string_flag)
            value = orig_value;

          push_member_name (constructor_fields);
          output_init_element (value, fieldtype, constructor_fields, 1);
          RESTORE_SPELLING_DEPTH (constructor_depth);

          constructor_fields = 0;
          break;
        }
      if (TREE_CODE (constructor_type) == ARRAY_TYPE)
        {
          tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
          enum tree_code eltcode = TREE_CODE (elttype);

          /* Accept a string constant to initialize a subarray. */
          if (eltcode == ARRAY_TYPE && TREE_CODE (TREE_TYPE (elttype)) == CHAR_TYPE && string_flag)
            value = orig_value;

          if (constructor_max_index && tree_int_cst_lt (constructor_max_index, constructor_index))
            {
              initializer_error ("excess elements in array initializer%s", " after `%s'");
              break;
            }

          /* In the case of [LO .. HI] = VALUE, only evaluate VALUE once. */
          if (constructor_range_end)
            {
              if (constructor_max_index && tree_int_cst_lt (constructor_max_index, constructor_range_end))
                {
                  initializer_error ("excess elements in array initializer%s", " after `%s'");
                  constructor_range_end = constructor_max_index;
                }
              value = save_expr (value);
            }

          /* Now output the actual element. Ordinarily, output once.
             If there is a range, repeat it till we advance past the range. */
          do
            {
              push_array_index (TREE_INT_CST_LOW (constructor_index));
              output_init_element (value, elttype, constructor_index, 1);
              RESTORE_SPELLING_DEPTH (constructor_depth);
              constructor_index = size_binop (PLUS_EXPR, constructor_index, ssize_int (1));
            }
          while (constructor_range_end && !tree_int_cst_lt (constructor_range_end, constructor_index));
          break;
        }

      /* Handle the sole element allowed in a braced initializer for a scalar variable. */
      if (!constructor_fields)
        {
          initializer_error ("excess elements in scalar initializer%s", " after `%s'");
          break;
        }

      output_init_element (value, constructor_type, NULL_TREE, 1);
      constructor_fields = 0;
      break;
    }
}
