gcc/c-typeck.c

   1 /* Build expressions with type checking for C compiler.
   2    Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
   3    1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
   4    Free Software Foundation, Inc.
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify it under
   9 the terms of the GNU General Public License as published by the Free
  10 Software Foundation; either version 3, or (at your option) any later
  11 version.
  12
  13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  15 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  16 for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22
  23 /* This file is part of the C front end.
  24    It contains routines to build C expressions given their operands,
  25    including computing the types of the result, C-specific error checks,
  26    and some optimization.  */
  27
  28 #include "config.h"
  29 #include "system.h"
  30 #include "coretypes.h"
  31 #include "tm.h"
  32 #include "tree.h"
  33 #include "langhooks.h"
  34 #include "c-tree.h"
  35 #include "c-lang.h"
  36 #include "flags.h"
  37 #include "output.h"
  38 #include "intl.h"
  39 #include "target.h"
  40 #include "tree-iterator.h"
  41 #include "bitmap.h"
  42 #include "gimple.h"
  43 #include "c-family/c-objc.h"
  44
  45 /* Possible cases of implicit bad conversions.  Used to select
  46    diagnostic messages in convert_for_assignment.  */
  47 enum impl_conv {
  48   ic_argpass,
  49   ic_assign,
  50   ic_init,
  51   ic_return
  52 };
  53
  54 /* The level of nesting inside "__alignof__".  */
  55 int in_alignof;
  56
  57 /* The level of nesting inside "sizeof".  */
  58 int in_sizeof;
  59
  60 /* The level of nesting inside "typeof".  */
  61 int in_typeof;
  62
  63 /* Nonzero if we've already printed a "missing braces around initializer"
  64    message within this initializer.  */
  65 static int missing_braces_mentioned;
  66
  67 static int require_constant_value;
  68 static int require_constant_elements;
  69
  70 static bool null_pointer_constant_p (const_tree);
  71 static tree qualify_type (tree, tree);
  72 static int tagged_types_tu_compatible_p (const_tree, const_tree, bool *,
  73                                          bool *);
  74 static int comp_target_types (location_t, tree, tree);
  75 static int function_types_compatible_p (const_tree, const_tree, bool *,
  76                                         bool *);
  77 static int type_lists_compatible_p (const_tree, const_tree, bool *, bool *);
  78 static tree lookup_field (tree, tree);
  79 static int convert_arguments (tree, VEC(tree,gc) *, VEC(tree,gc) *, tree,
  80                               tree);
  81 static tree pointer_diff (location_t, tree, tree);
  82 static tree convert_for_assignment (location_t, tree, tree, tree,
  83                                     enum impl_conv, bool, tree, tree, int);
  84 static tree valid_compound_expr_initializer (tree, tree);
  85 static void push_string (const char *);
  86 static void push_member_name (tree);
  87 static int spelling_length (void);
  88 static char *print_spelling (char *);
  89 static void warning_init (int, const char *);
  90 static tree digest_init (location_t, tree, tree, tree, bool, bool, int);
  91 static void output_init_element (tree, tree, bool, tree, tree, int, bool,
  92                                  struct obstack *);
  93 static void output_pending_init_elements (int, struct obstack *);
  94 static int set_designator (int, struct obstack *);
  95 static void push_range_stack (tree, struct obstack *);
  96 static void add_pending_init (tree, tree, tree, bool, struct obstack *);
  97 static void set_nonincremental_init (struct obstack *);
  98 static void set_nonincremental_init_from_string (tree, struct obstack *);
  99 static tree find_init_member (tree, struct obstack *);
 100 static void readonly_warning (tree, enum lvalue_use);
 101 static int lvalue_or_else (location_t, const_tree, enum lvalue_use);
 102 static void record_maybe_used_decl (tree);
 103 static int comptypes_internal (const_tree, const_tree, bool *, bool *);
 104 \f
 105 /* Return true if EXP is a null pointer constant, false otherwise.  */
 106
 107 static bool
 108 null_pointer_constant_p (const_tree expr)
 109 {
 110   /* This should really operate on c_expr structures, but they aren't
 111      yet available everywhere required.  */
 112   tree type = TREE_TYPE (expr);
 113   return (TREE_CODE (expr) == INTEGER_CST
 114           && !TREE_OVERFLOW (expr)
 115           && integer_zerop (expr)
 116           && (INTEGRAL_TYPE_P (type)
 117               || (TREE_CODE (type) == POINTER_TYPE
 118                   && VOID_TYPE_P (TREE_TYPE (type))
 119                   && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
 120 }
 121
 122 /* EXPR may appear in an unevaluated part of an integer constant
 123    expression, but not in an evaluated part.  Wrap it in a
 124    C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
 125    INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR.  */
 126
 127 static tree
 128 note_integer_operands (tree expr)
 129 {
 130   tree ret;
 131   if (TREE_CODE (expr) == INTEGER_CST && in_late_binary_op)
 132     {
 133       ret = copy_node (expr);
 134       TREE_OVERFLOW (ret) = 1;
 135     }
 136   else
 137     {
 138       ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL_TREE, expr);
 139       C_MAYBE_CONST_EXPR_INT_OPERANDS (ret) = 1;
 140     }
 141   return ret;
 142 }
 143
 144 /* Having checked whether EXPR may appear in an unevaluated part of an
 145    integer constant expression and found that it may, remove any
 146    C_MAYBE_CONST_EXPR noting this fact and return the resulting
 147    expression.  */
 148
 149 static inline tree
 150 remove_c_maybe_const_expr (tree expr)
 151 {
 152   if (TREE_CODE (expr) == C_MAYBE_CONST_EXPR)
 153     return C_MAYBE_CONST_EXPR_EXPR (expr);
 154   else
 155     return expr;
 156 }
 157
 158 \f/* This is a cache to hold if two types are compatible or not.  */
 159
 160 struct tagged_tu_seen_cache {
 161   const struct tagged_tu_seen_cache * next;
 162   const_tree t1;
 163   const_tree t2;
 164   /* The return value of tagged_types_tu_compatible_p if we had seen
 165      these two types already.  */
 166   int val;
 167 };
 168
 169 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
 170 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
 171
 172 /* Do `exp = require_complete_type (exp);' to make sure exp
 173    does not have an incomplete type.  (That includes void types.)  */
 174
 175 tree
 176 require_complete_type (tree value)
 177 {
 178   tree type = TREE_TYPE (value);
 179
 180   if (value == error_mark_node || type == error_mark_node)
 181     return error_mark_node;
 182
 183   /* First, detect a valid value with a complete type.  */
 184   if (COMPLETE_TYPE_P (type))
 185     return value;
 186
 187   c_incomplete_type_error (value, type);
 188   return error_mark_node;
 189 }
 190
 191 /* Print an error message for invalid use of an incomplete type.
 192    VALUE is the expression that was used (or 0 if that isn't known)
 193    and TYPE is the type that was invalid.  */
 194
 195 void
 196 c_incomplete_type_error (const_tree value, const_tree type)
 197 {
 198   const char *type_code_string;
 199
 200   /* Avoid duplicate error message.  */
 201   if (TREE_CODE (type) == ERROR_MARK)
 202     return;
 203
 204   if (value != 0 && (TREE_CODE (value) == VAR_DECL
 205                      || TREE_CODE (value) == PARM_DECL))
 206     error ("%qD has an incomplete type", value);
 207   else
 208     {
 209     retry:
 210       /* We must print an error message.  Be clever about what it says.  */
 211
 212       switch (TREE_CODE (type))
 213         {
 214         case RECORD_TYPE:
 215           type_code_string = "struct";
 216           break;
 217
 218         case UNION_TYPE:
 219           type_code_string = "union";
 220           break;
 221
 222         case ENUMERAL_TYPE:
 223           type_code_string = "enum";
 224           break;
 225
 226         case VOID_TYPE:
 227           error ("invalid use of void expression");
 228           return;
 229
 230         case ARRAY_TYPE:
 231           if (TYPE_DOMAIN (type))
 232             {
 233               if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
 234                 {
 235                   error ("invalid use of flexible array member");
 236                   return;
 237                 }
 238               type = TREE_TYPE (type);
 239               goto retry;
 240             }
 241           error ("invalid use of array with unspecified bounds");
 242           return;
 243
 244         default:
 245           gcc_unreachable ();
 246         }
 247
 248       if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
 249         error ("invalid use of undefined type %<%s %E%>",
 250                type_code_string, TYPE_NAME (type));
 251       else
 252         /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL.  */
 253         error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
 254     }
 255 }
 256
 257 /* Given a type, apply default promotions wrt unnamed function
 258    arguments and return the new type.  */
 259
 260 tree
 261 c_type_promotes_to (tree type)
 262 {
 263   if (TYPE_MAIN_VARIANT (type) == float_type_node)
 264     return double_type_node;
 265
 266   if (c_promoting_integer_type_p (type))
 267     {
 268       /* Preserve unsignedness if not really getting any wider.  */
 269       if (TYPE_UNSIGNED (type)
 270           && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
 271         return unsigned_type_node;
 272       return integer_type_node;
 273     }
 274
 275   return type;
 276 }
 277
 278 /* Return true if between two named address spaces, whether there is a superset
 279    named address space that encompasses both address spaces.  If there is a
 280    superset, return which address space is the superset.  */
 281
 282 static bool
 283 addr_space_superset (addr_space_t as1, addr_space_t as2, addr_space_t *common)
 284 {
 285   if (as1 == as2)
 286     {
 287       *common = as1;
 288       return true;
 289     }
 290   else if (targetm.addr_space.subset_p (as1, as2))
 291     {
 292       *common = as2;
 293       return true;
 294     }
 295   else if (targetm.addr_space.subset_p (as2, as1))
 296     {
 297       *common = as1;
 298       return true;
 299     }
 300   else
 301     return false;
 302 }
 303
 304 /* Return a variant of TYPE which has all the type qualifiers of LIKE
 305    as well as those of TYPE.  */
 306
 307 static tree
 308 qualify_type (tree type, tree like)
 309 {
 310   addr_space_t as_type = TYPE_ADDR_SPACE (type);
 311   addr_space_t as_like = TYPE_ADDR_SPACE (like);
 312   addr_space_t as_common;
 313
 314   /* If the two named address spaces are different, determine the common
 315      superset address space.  If there isn't one, raise an error.  */
 316   if (!addr_space_superset (as_type, as_like, &as_common))
 317     {
 318       as_common = as_type;
 319       error ("%qT and %qT are in disjoint named address spaces",
 320              type, like);
 321     }
 322
 323   return c_build_qualified_type (type,
 324                                  TYPE_QUALS_NO_ADDR_SPACE (type)
 325                                  | TYPE_QUALS_NO_ADDR_SPACE (like)
 326                                  | ENCODE_QUAL_ADDR_SPACE (as_common));
 327 }
 328
 329 /* Return true iff the given tree T is a variable length array.  */
 330
 331 bool
 332 c_vla_type_p (const_tree t)
 333 {
 334   if (TREE_CODE (t) == ARRAY_TYPE
 335       && C_TYPE_VARIABLE_SIZE (t))
 336     return true;
 337   return false;
 338 }
 339 \f
 340 /* Return the composite type of two compatible types.
 341
 342    We assume that comptypes has already been done and returned
 343    nonzero; if that isn't so, this may crash.  In particular, we
 344    assume that qualifiers match.  */
 345
 346 tree
 347 composite_type (tree t1, tree t2)
 348 {
 349   enum tree_code code1;
 350   enum tree_code code2;
 351   tree attributes;
 352
 353   /* Save time if the two types are the same.  */
 354
 355   if (t1 == t2) return t1;
 356
 357   /* If one type is nonsense, use the other.  */
 358   if (t1 == error_mark_node)
 359     return t2;
 360   if (t2 == error_mark_node)
 361     return t1;
 362
 363   code1 = TREE_CODE (t1);
 364   code2 = TREE_CODE (t2);
 365
 366   /* Merge the attributes.  */
 367   attributes = targetm.merge_type_attributes (t1, t2);
 368
 369   /* If one is an enumerated type and the other is the compatible
 370      integer type, the composite type might be either of the two
 371      (DR#013 question 3).  For consistency, use the enumerated type as
 372      the composite type.  */
 373
 374   if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
 375     return t1;
 376   if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
 377     return t2;
 378
 379   gcc_assert (code1 == code2);
 380
 381   switch (code1)
 382     {
 383     case POINTER_TYPE:
 384       /* For two pointers, do this recursively on the target type.  */
 385       {
 386         tree pointed_to_1 = TREE_TYPE (t1);
 387         tree pointed_to_2 = TREE_TYPE (t2);
 388         tree target = composite_type (pointed_to_1, pointed_to_2);
 389         t1 = build_pointer_type (target);
 390         t1 = build_type_attribute_variant (t1, attributes);
 391         return qualify_type (t1, t2);
 392       }
 393
 394     case ARRAY_TYPE:
 395       {
 396         tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
 397         int quals;
 398         tree unqual_elt;
 399         tree d1 = TYPE_DOMAIN (t1);
 400         tree d2 = TYPE_DOMAIN (t2);
 401         bool d1_variable, d2_variable;
 402         bool d1_zero, d2_zero;
 403         bool t1_complete, t2_complete;
 404
 405         /* We should not have any type quals on arrays at all.  */
 406         gcc_assert (!TYPE_QUALS_NO_ADDR_SPACE (t1)
 407                     && !TYPE_QUALS_NO_ADDR_SPACE (t2));
 408
 409         t1_complete = COMPLETE_TYPE_P (t1);
 410         t2_complete = COMPLETE_TYPE_P (t2);
 411
 412         d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
 413         d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
 414
 415         d1_variable = (!d1_zero
 416                        && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
 417                            || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
 418         d2_variable = (!d2_zero
 419                        && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
 420                            || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
 421         d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
 422         d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
 423
 424         /* Save space: see if the result is identical to one of the args.  */
 425         if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
 426             && (d2_variable || d2_zero || !d1_variable))
 427           return build_type_attribute_variant (t1, attributes);
 428         if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
 429             && (d1_variable || d1_zero || !d2_variable))
 430           return build_type_attribute_variant (t2, attributes);
 431
 432         if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
 433           return build_type_attribute_variant (t1, attributes);
 434         if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
 435           return build_type_attribute_variant (t2, attributes);
 436
 437         /* Merge the element types, and have a size if either arg has
 438            one.  We may have qualifiers on the element types.  To set
 439            up TYPE_MAIN_VARIANT correctly, we need to form the
 440            composite of the unqualified types and add the qualifiers
 441            back at the end.  */
 442         quals = TYPE_QUALS (strip_array_types (elt));
 443         unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
 444         t1 = build_array_type (unqual_elt,
 445                                TYPE_DOMAIN ((TYPE_DOMAIN (t1)
 446                                              && (d2_variable
 447                                                  || d2_zero
 448                                                  || !d1_variable))
 449                                             ? t1
 450                                             : t2));
 451         /* Ensure a composite type involving a zero-length array type
 452            is a zero-length type not an incomplete type.  */
 453         if (d1_zero && d2_zero
 454             && (t1_complete || t2_complete)
 455             && !COMPLETE_TYPE_P (t1))
 456           {
 457             TYPE_SIZE (t1) = bitsize_zero_node;
 458             TYPE_SIZE_UNIT (t1) = size_zero_node;
 459           }
 460         t1 = c_build_qualified_type (t1, quals);
 461         return build_type_attribute_variant (t1, attributes);
 462       }
 463
 464     case ENUMERAL_TYPE:
 465     case RECORD_TYPE:
 466     case UNION_TYPE:
 467       if (attributes != NULL)
 468         {
 469           /* Try harder not to create a new aggregate type.  */
 470           if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
 471             return t1;
 472           if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
 473             return t2;
 474         }
 475       return build_type_attribute_variant (t1, attributes);
 476
 477     case FUNCTION_TYPE:
 478       /* Function types: prefer the one that specified arg types.
 479          If both do, merge the arg types.  Also merge the return types.  */
 480       {
 481         tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
 482         tree p1 = TYPE_ARG_TYPES (t1);
 483         tree p2 = TYPE_ARG_TYPES (t2);
 484         int len;
 485         tree newargs, n;
 486         int i;
 487
 488         /* Save space: see if the result is identical to one of the args.  */
 489         if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
 490           return build_type_attribute_variant (t1, attributes);
 491         if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
 492           return build_type_attribute_variant (t2, attributes);
 493
 494         /* Simple way if one arg fails to specify argument types.  */
 495         if (TYPE_ARG_TYPES (t1) == 0)
 496          {
 497             t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
 498             t1 = build_type_attribute_variant (t1, attributes);
 499             return qualify_type (t1, t2);
 500          }
 501         if (TYPE_ARG_TYPES (t2) == 0)
 502          {
 503            t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
 504            t1 = build_type_attribute_variant (t1, attributes);
 505            return qualify_type (t1, t2);
 506          }
 507
 508         /* If both args specify argument types, we must merge the two
 509            lists, argument by argument.  */
 510         /* Tell global_bindings_p to return false so that variable_size
 511            doesn't die on VLAs in parameter types.  */
 512         c_override_global_bindings_to_false = true;
 513
 514         len = list_length (p1);
 515         newargs = 0;
 516
 517         for (i = 0; i < len; i++)
 518           newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
 519
 520         n = newargs;
 521
 522         for (; p1;
 523              p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
 524           {
 525             /* A null type means arg type is not specified.
 526                Take whatever the other function type has.  */
 527             if (TREE_VALUE (p1) == 0)
 528               {
 529                 TREE_VALUE (n) = TREE_VALUE (p2);
 530                 goto parm_done;
 531               }
 532             if (TREE_VALUE (p2) == 0)
 533               {
 534                 TREE_VALUE (n) = TREE_VALUE (p1);
 535                 goto parm_done;
 536               }
 537
 538             /* Given  wait (union {union wait *u; int *i} *)
 539                and  wait (union wait *),
 540                prefer  union wait *  as type of parm.  */
 541             if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
 542                 && TREE_VALUE (p1) != TREE_VALUE (p2))
 543               {
 544                 tree memb;
 545                 tree mv2 = TREE_VALUE (p2);
 546                 if (mv2 && mv2 != error_mark_node
 547                     && TREE_CODE (mv2) != ARRAY_TYPE)
 548                   mv2 = TYPE_MAIN_VARIANT (mv2);
 549                 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
 550                      memb; memb = DECL_CHAIN (memb))
 551                   {
 552                     tree mv3 = TREE_TYPE (memb);
 553                     if (mv3 && mv3 != error_mark_node
 554                         && TREE_CODE (mv3) != ARRAY_TYPE)
 555                       mv3 = TYPE_MAIN_VARIANT (mv3);
 556                     if (comptypes (mv3, mv2))
 557                       {
 558                         TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
 559                                                          TREE_VALUE (p2));
 560                         pedwarn (input_location, OPT_pedantic,
 561                                  "function types not truly compatible in ISO C");
 562                         goto parm_done;
 563                       }
 564                   }
 565               }
 566             if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
 567                 && TREE_VALUE (p2) != TREE_VALUE (p1))
 568               {
 569                 tree memb;
 570                 tree mv1 = TREE_VALUE (p1);
 571                 if (mv1 && mv1 != error_mark_node
 572                     && TREE_CODE (mv1) != ARRAY_TYPE)
 573                   mv1 = TYPE_MAIN_VARIANT (mv1);
 574                 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
 575                      memb; memb = DECL_CHAIN (memb))
 576                   {
 577                     tree mv3 = TREE_TYPE (memb);
 578                     if (mv3 && mv3 != error_mark_node
 579                         && TREE_CODE (mv3) != ARRAY_TYPE)
 580                       mv3 = TYPE_MAIN_VARIANT (mv3);
 581                     if (comptypes (mv3, mv1))
 582                       {
 583                         TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
 584                                                          TREE_VALUE (p1));
 585                         pedwarn (input_location, OPT_pedantic,
 586                                  "function types not truly compatible in ISO C");
 587                         goto parm_done;
 588                       }
 589                   }
 590               }
 591             TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
 592           parm_done: ;
 593           }
 594
 595         c_override_global_bindings_to_false = false;
 596         t1 = build_function_type (valtype, newargs);
 597         t1 = qualify_type (t1, t2);
 598         /* ... falls through ...  */
 599       }
 600
 601     default:
 602       return build_type_attribute_variant (t1, attributes);
 603     }
 604
 605 }
 606
 607 /* Return the type of a conditional expression between pointers to
 608    possibly differently qualified versions of compatible types.
 609
 610    We assume that comp_target_types has already been done and returned
 611    nonzero; if that isn't so, this may crash.  */
 612
 613 static tree
 614 common_pointer_type (tree t1, tree t2)
 615 {
 616   tree attributes;
 617   tree pointed_to_1, mv1;
 618   tree pointed_to_2, mv2;
 619   tree target;
 620   unsigned target_quals;
 621   addr_space_t as1, as2, as_common;
 622   int quals1, quals2;
 623
 624   /* Save time if the two types are the same.  */
 625
 626   if (t1 == t2) return t1;
 627
 628   /* If one type is nonsense, use the other.  */
 629   if (t1 == error_mark_node)
 630     return t2;
 631   if (t2 == error_mark_node)
 632     return t1;
 633
 634   gcc_assert (TREE_CODE (t1) == POINTER_TYPE
 635               && TREE_CODE (t2) == POINTER_TYPE);
 636
 637   /* Merge the attributes.  */
 638   attributes = targetm.merge_type_attributes (t1, t2);
 639
 640   /* Find the composite type of the target types, and combine the
 641      qualifiers of the two types' targets.  Do not lose qualifiers on
 642      array element types by taking the TYPE_MAIN_VARIANT.  */
 643   mv1 = pointed_to_1 = TREE_TYPE (t1);
 644   mv2 = pointed_to_2 = TREE_TYPE (t2);
 645   if (TREE_CODE (mv1) != ARRAY_TYPE)
 646     mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
 647   if (TREE_CODE (mv2) != ARRAY_TYPE)
 648     mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
 649   target = composite_type (mv1, mv2);
 650
 651   /* For function types do not merge const qualifiers, but drop them
 652      if used inconsistently.  The middle-end uses these to mark const
 653      and noreturn functions.  */
 654   quals1 = TYPE_QUALS_NO_ADDR_SPACE (pointed_to_1);
 655   quals2 = TYPE_QUALS_NO_ADDR_SPACE (pointed_to_2);
 656
 657   if (TREE_CODE (pointed_to_1) == FUNCTION_TYPE)
 658     target_quals = (quals1 & quals2);
 659   else
 660     target_quals = (quals1 | quals2);
 661
 662   /* If the two named address spaces are different, determine the common
 663      superset address space.  This is guaranteed to exist due to the
 664      assumption that comp_target_type returned non-zero.  */
 665   as1 = TYPE_ADDR_SPACE (pointed_to_1);
 666   as2 = TYPE_ADDR_SPACE (pointed_to_2);
 667   if (!addr_space_superset (as1, as2, &as_common))
 668     gcc_unreachable ();
 669
 670   target_quals |= ENCODE_QUAL_ADDR_SPACE (as_common);
 671
 672   t1 = build_pointer_type (c_build_qualified_type (target, target_quals));
 673   return build_type_attribute_variant (t1, attributes);
 674 }
 675
 676 /* Return the common type for two arithmetic types under the usual
 677    arithmetic conversions.  The default conversions have already been
 678    applied, and enumerated types converted to their compatible integer
 679    types.  The resulting type is unqualified and has no attributes.
 680
 681    This is the type for the result of most arithmetic operations
 682    if the operands have the given two types.  */
 683
 684 static tree
 685 c_common_type (tree t1, tree t2)
 686 {
 687   enum tree_code code1;
 688   enum tree_code code2;
 689
 690   /* If one type is nonsense, use the other.  */
 691   if (t1 == error_mark_node)
 692     return t2;
 693   if (t2 == error_mark_node)
 694     return t1;
 695
 696   if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
 697     t1 = TYPE_MAIN_VARIANT (t1);
 698
 699   if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
 700     t2 = TYPE_MAIN_VARIANT (t2);
 701
 702   if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
 703     t1 = build_type_attribute_variant (t1, NULL_TREE);
 704
 705   if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
 706     t2 = build_type_attribute_variant (t2, NULL_TREE);
 707
 708   /* Save time if the two types are the same.  */
 709
 710   if (t1 == t2) return t1;
 711
 712   code1 = TREE_CODE (t1);
 713   code2 = TREE_CODE (t2);
 714
 715   gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
 716               || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
 717               || code1 == INTEGER_TYPE);
 718   gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
 719               || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
 720               || code2 == INTEGER_TYPE);
 721
 722   /* When one operand is a decimal float type, the other operand cannot be
 723      a generic float type or a complex type.  We also disallow vector types
 724      here.  */
 725   if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
 726       && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
 727     {
 728       if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
 729         {
 730           error ("can%'t mix operands of decimal float and vector types");
 731           return error_mark_node;
 732         }
 733       if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
 734         {
 735           error ("can%'t mix operands of decimal float and complex types");
 736           return error_mark_node;
 737         }
 738       if (code1 == REAL_TYPE && code2 == REAL_TYPE)
 739         {
 740           error ("can%'t mix operands of decimal float and other float types");
 741           return error_mark_node;
 742         }
 743     }
 744
 745   /* If one type is a vector type, return that type.  (How the usual
 746      arithmetic conversions apply to the vector types extension is not
 747      precisely specified.)  */
 748   if (code1 == VECTOR_TYPE)
 749     return t1;
 750
 751   if (code2 == VECTOR_TYPE)
 752     return t2;
 753
 754   /* If one type is complex, form the common type of the non-complex
 755      components, then make that complex.  Use T1 or T2 if it is the
 756      required type.  */
 757   if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
 758     {
 759       tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
 760       tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
 761       tree subtype = c_common_type (subtype1, subtype2);
 762
 763       if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
 764         return t1;
 765       else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
 766         return t2;
 767       else
 768         return build_complex_type (subtype);
 769     }
 770
 771   /* If only one is real, use it as the result.  */
 772
 773   if (code1 == REAL_TYPE && code2 != REAL_TYPE)
 774     return t1;
 775
 776   if (code2 == REAL_TYPE && code1 != REAL_TYPE)
 777     return t2;
 778
 779   /* If both are real and either are decimal floating point types, use
 780      the decimal floating point type with the greater precision. */
 781
 782   if (code1 == REAL_TYPE && code2 == REAL_TYPE)
 783     {
 784       if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
 785           || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
 786         return dfloat128_type_node;
 787       else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
 788                || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
 789         return dfloat64_type_node;
 790       else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
 791                || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
 792         return dfloat32_type_node;
 793     }
 794
 795   /* Deal with fixed-point types.  */
 796   if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
 797     {
 798       unsigned int unsignedp = 0, satp = 0;
 799       enum machine_mode m1, m2;
 800       unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
 801
 802       m1 = TYPE_MODE (t1);
 803       m2 = TYPE_MODE (t2);
 804
 805       /* If one input type is saturating, the result type is saturating.  */
 806       if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
 807         satp = 1;
 808
 809       /* If both fixed-point types are unsigned, the result type is unsigned.
 810          When mixing fixed-point and integer types, follow the sign of the
 811          fixed-point type.
 812          Otherwise, the result type is signed.  */
 813       if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
 814            && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
 815           || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
 816               && TYPE_UNSIGNED (t1))
 817           || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
 818               && TYPE_UNSIGNED (t2)))
 819         unsignedp = 1;
 820
 821       /* The result type is signed.  */
 822       if (unsignedp == 0)
 823         {
 824           /* If the input type is unsigned, we need to convert to the
 825              signed type.  */
 826           if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
 827             {
 828               enum mode_class mclass = (enum mode_class) 0;
 829               if (GET_MODE_CLASS (m1) == MODE_UFRACT)
 830                 mclass = MODE_FRACT;
 831               else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
 832                 mclass = MODE_ACCUM;
 833               else
 834                 gcc_unreachable ();
 835               m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
 836             }
 837           if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
 838             {
 839               enum mode_class mclass = (enum mode_class) 0;
 840               if (GET_MODE_CLASS (m2) == MODE_UFRACT)
 841                 mclass = MODE_FRACT;
 842               else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
 843                 mclass = MODE_ACCUM;
 844               else
 845                 gcc_unreachable ();
 846               m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
 847             }
 848         }
 849
 850       if (code1 == FIXED_POINT_TYPE)
 851         {
 852           fbit1 = GET_MODE_FBIT (m1);
 853           ibit1 = GET_MODE_IBIT (m1);
 854         }
 855       else
 856         {
 857           fbit1 = 0;
 858           /* Signed integers need to subtract one sign bit.  */
 859           ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
 860         }
 861
 862       if (code2 == FIXED_POINT_TYPE)
 863         {
 864           fbit2 = GET_MODE_FBIT (m2);
 865           ibit2 = GET_MODE_IBIT (m2);
 866         }
 867       else
 868         {
 869           fbit2 = 0;
 870           /* Signed integers need to subtract one sign bit.  */
 871           ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
 872         }
 873
 874       max_ibit = ibit1 >= ibit2 ?  ibit1 : ibit2;
 875       max_fbit = fbit1 >= fbit2 ?  fbit1 : fbit2;
 876       return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
 877                                                  satp);
 878     }
 879
 880   /* Both real or both integers; use the one with greater precision.  */
 881
 882   if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
 883     return t1;
 884   else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
 885     return t2;
 886
 887   /* Same precision.  Prefer long longs to longs to ints when the
 888      same precision, following the C99 rules on integer type rank
 889      (which are equivalent to the C90 rules for C90 types).  */
 890
 891   if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
 892       || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
 893     return long_long_unsigned_type_node;
 894
 895   if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
 896       || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
 897     {
 898       if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
 899         return long_long_unsigned_type_node;
 900       else
 901         return long_long_integer_type_node;
 902     }
 903
 904   if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
 905       || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
 906     return long_unsigned_type_node;
 907
 908   if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
 909       || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
 910     {
 911       /* But preserve unsignedness from the other type,
 912          since long cannot hold all the values of an unsigned int.  */
 913       if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
 914         return long_unsigned_type_node;
 915       else
 916         return long_integer_type_node;
 917     }
 918
 919   /* Likewise, prefer long double to double even if same size.  */
 920   if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
 921       || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
 922     return long_double_type_node;
 923
 924   /* Otherwise prefer the unsigned one.  */
 925
 926   if (TYPE_UNSIGNED (t1))
 927     return t1;
 928   else
 929     return t2;
 930 }
 931 \f
 932 /* Wrapper around c_common_type that is used by c-common.c and other
 933    front end optimizations that remove promotions.  ENUMERAL_TYPEs
 934    are allowed here and are converted to their compatible integer types.
 935    BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
 936    preferably a non-Boolean type as the common type.  */
 937 tree
 938 common_type (tree t1, tree t2)
 939 {
 940   if (TREE_CODE (t1) == ENUMERAL_TYPE)
 941     t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
 942   if (TREE_CODE (t2) == ENUMERAL_TYPE)
 943     t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
 944
 945   /* If both types are BOOLEAN_TYPE, then return boolean_type_node.  */
 946   if (TREE_CODE (t1) == BOOLEAN_TYPE
 947       && TREE_CODE (t2) == BOOLEAN_TYPE)
 948     return boolean_type_node;
 949
 950   /* If either type is BOOLEAN_TYPE, then return the other.  */
 951   if (TREE_CODE (t1) == BOOLEAN_TYPE)
 952     return t2;
 953   if (TREE_CODE (t2) == BOOLEAN_TYPE)
 954     return t1;
 955
 956   return c_common_type (t1, t2);
 957 }
 958
 959 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
 960    or various other operations.  Return 2 if they are compatible
 961    but a warning may be needed if you use them together.  */
 962
 963 int
 964 comptypes (tree type1, tree type2)
 965 {
 966   const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
 967   int val;
 968
 969   val = comptypes_internal (type1, type2, NULL, NULL);
 970   free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
 971
 972   return val;
 973 }
 974
 975 /* Like comptypes, but if it returns non-zero because enum and int are
 976    compatible, it sets *ENUM_AND_INT_P to true.  */
 977
 978 static int
 979 comptypes_check_enum_int (tree type1, tree type2, bool *enum_and_int_p)
 980 {
 981   const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
 982   int val;
 983
 984   val = comptypes_internal (type1, type2, enum_and_int_p, NULL);
 985   free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
 986
 987   return val;
 988 }
 989
 990 /* Like comptypes, but if it returns nonzero for different types, it
 991    sets *DIFFERENT_TYPES_P to true.  */
 992
 993 int
 994 comptypes_check_different_types (tree type1, tree type2,
 995                                  bool *different_types_p)
 996 {
 997   const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
 998   int val;
 999
1000   val = comptypes_internal (type1, type2, NULL, different_types_p);
1001   free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
1002
1003   return val;
1004 }
1005 \f
1006 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1007    or various other operations.  Return 2 if they are compatible
1008    but a warning may be needed if you use them together.  If
1009    ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1010    compatible integer type, then this sets *ENUM_AND_INT_P to true;
1011    *ENUM_AND_INT_P is never set to false.  If DIFFERENT_TYPES_P is not
1012    NULL, and the types are compatible but different enough not to be
1013    permitted in C1X typedef redeclarations, then this sets
1014    *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1015    false, but may or may not be set if the types are incompatible.
1016    This differs from comptypes, in that we don't free the seen
1017    types.  */
1018
1019 static int
1020 comptypes_internal (const_tree type1, const_tree type2, bool *enum_and_int_p,
1021                     bool *different_types_p)
1022 {
1023   const_tree t1 = type1;
1024   const_tree t2 = type2;
1025   int attrval, val;
1026
1027   /* Suppress errors caused by previously reported errors.  */
1028
1029   if (t1 == t2 || !t1 || !t2
1030       || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
1031     return 1;
1032
1033   /* Enumerated types are compatible with integer types, but this is
1034      not transitive: two enumerated types in the same translation unit
1035      are compatible with each other only if they are the same type.  */
1036
1037   if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
1038     {
1039       t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
1040       if (TREE_CODE (t2) != VOID_TYPE)
1041         {
1042           if (enum_and_int_p != NULL)
1043             *enum_and_int_p = true;
1044           if (different_types_p != NULL)
1045             *different_types_p = true;
1046         }
1047     }
1048   else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
1049     {
1050       t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
1051       if (TREE_CODE (t1) != VOID_TYPE)
1052         {
1053           if (enum_and_int_p != NULL)
1054             *enum_and_int_p = true;
1055           if (different_types_p != NULL)
1056             *different_types_p = true;
1057         }
1058     }
1059
1060   if (t1 == t2)
1061     return 1;
1062
1063   /* Different classes of types can't be compatible.  */
1064
1065   if (TREE_CODE (t1) != TREE_CODE (t2))
1066     return 0;
1067
1068   /* Qualifiers must match. C99 6.7.3p9 */
1069
1070   if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
1071     return 0;
1072
1073   /* Allow for two different type nodes which have essentially the same
1074      definition.  Note that we already checked for equality of the type
1075      qualifiers (just above).  */
1076
1077   if (TREE_CODE (t1) != ARRAY_TYPE
1078       && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1079     return 1;
1080
1081   /* 1 if no need for warning yet, 2 if warning cause has been seen.  */
1082   if (!(attrval = comp_type_attributes (t1, t2)))
1083      return 0;
1084
1085   /* 1 if no need for warning yet, 2 if warning cause has been seen.  */
1086   val = 0;
1087
1088   switch (TREE_CODE (t1))
1089     {
1090     case POINTER_TYPE:
1091       /* Do not remove mode or aliasing information.  */
1092       if (TYPE_MODE (t1) != TYPE_MODE (t2)
1093           || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
1094         break;
1095       val = (TREE_TYPE (t1) == TREE_TYPE (t2)
1096              ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2),
1097                                        enum_and_int_p, different_types_p));
1098       break;
1099
1100     case FUNCTION_TYPE:
1101       val = function_types_compatible_p (t1, t2, enum_and_int_p,
1102                                          different_types_p);
1103       break;
1104
1105     case ARRAY_TYPE:
1106       {
1107         tree d1 = TYPE_DOMAIN (t1);
1108         tree d2 = TYPE_DOMAIN (t2);
1109         bool d1_variable, d2_variable;
1110         bool d1_zero, d2_zero;
1111         val = 1;
1112
1113         /* Target types must match incl. qualifiers.  */
1114         if (TREE_TYPE (t1) != TREE_TYPE (t2)
1115             && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2),
1116                                                enum_and_int_p,
1117                                                different_types_p)))
1118           return 0;
1119
1120         if (different_types_p != NULL
1121             && (d1 == 0) != (d2 == 0))
1122           *different_types_p = true;
1123         /* Sizes must match unless one is missing or variable.  */
1124         if (d1 == 0 || d2 == 0 || d1 == d2)
1125           break;
1126
1127         d1_zero = !TYPE_MAX_VALUE (d1);
1128         d2_zero = !TYPE_MAX_VALUE (d2);
1129
1130         d1_variable = (!d1_zero
1131                        && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
1132                            || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
1133         d2_variable = (!d2_zero
1134                        && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
1135                            || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
1136         d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
1137         d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
1138
1139         if (different_types_p != NULL
1140             && d1_variable != d2_variable)
1141           *different_types_p = true;
1142         if (d1_variable || d2_variable)
1143           break;
1144         if (d1_zero && d2_zero)
1145           break;
1146         if (d1_zero || d2_zero
1147             || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
1148             || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
1149           val = 0;
1150
1151         break;
1152       }
1153
1154     case ENUMERAL_TYPE:
1155     case RECORD_TYPE:
1156     case UNION_TYPE:
1157       if (val != 1 && !same_translation_unit_p (t1, t2))
1158         {
1159           tree a1 = TYPE_ATTRIBUTES (t1);
1160           tree a2 = TYPE_ATTRIBUTES (t2);
1161
1162           if (! attribute_list_contained (a1, a2)
1163               && ! attribute_list_contained (a2, a1))
1164             break;
1165
1166           if (attrval != 2)
1167             return tagged_types_tu_compatible_p (t1, t2, enum_and_int_p,
1168                                                  different_types_p);
1169           val = tagged_types_tu_compatible_p (t1, t2, enum_and_int_p,
1170                                               different_types_p);
1171         }
1172       break;
1173
1174     case VECTOR_TYPE:
1175       val = (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1176              && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2),
1177                                     enum_and_int_p, different_types_p));
1178       break;
1179
1180     default:
1181       break;
1182     }
1183   return attrval == 2 && val == 1 ? 2 : val;
1184 }
1185
1186 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1187    their qualifiers, except for named address spaces.  If the pointers point to
1188    different named addresses, then we must determine if one address space is a
1189    subset of the other.  */
1190
1191 static int
1192 comp_target_types (location_t location, tree ttl, tree ttr)
1193 {
1194   int val;
1195   tree mvl = TREE_TYPE (ttl);
1196   tree mvr = TREE_TYPE (ttr);
1197   addr_space_t asl = TYPE_ADDR_SPACE (mvl);
1198   addr_space_t asr = TYPE_ADDR_SPACE (mvr);
1199   addr_space_t as_common;
1200   bool enum_and_int_p;
1201
1202   /* Fail if pointers point to incompatible address spaces.  */
1203   if (!addr_space_superset (asl, asr, &as_common))
1204     return 0;
1205
1206   /* Do not lose qualifiers on element types of array types that are
1207      pointer targets by taking their TYPE_MAIN_VARIANT.  */
1208   if (TREE_CODE (mvl) != ARRAY_TYPE)
1209     mvl = TYPE_MAIN_VARIANT (mvl);
1210   if (TREE_CODE (mvr) != ARRAY_TYPE)
1211     mvr = TYPE_MAIN_VARIANT (mvr);
1212   enum_and_int_p = false;
1213   val = comptypes_check_enum_int (mvl, mvr, &enum_and_int_p);
1214
1215   if (val == 2)
1216     pedwarn (location, OPT_pedantic, "types are not quite compatible");
1217
1218   if (val == 1 && enum_and_int_p && warn_cxx_compat)
1219     warning_at (location, OPT_Wc___compat,
1220                 "pointer target types incompatible in C++");
1221
1222   return val;
1223 }
1224 \f
1225 /* Subroutines of `comptypes'.  */
1226
1227 /* Determine whether two trees derive from the same translation unit.
1228    If the CONTEXT chain ends in a null, that tree's context is still
1229    being parsed, so if two trees have context chains ending in null,
1230    they're in the same translation unit.  */
1231 int
1232 same_translation_unit_p (const_tree t1, const_tree t2)
1233 {
1234   while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1235     switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1236       {
1237       case tcc_declaration:
1238         t1 = DECL_CONTEXT (t1); break;
1239       case tcc_type:
1240         t1 = TYPE_CONTEXT (t1); break;
1241       case tcc_exceptional:
1242         t1 = BLOCK_SUPERCONTEXT (t1); break;  /* assume block */
1243       default: gcc_unreachable ();
1244       }
1245
1246   while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1247     switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1248       {
1249       case tcc_declaration:
1250         t2 = DECL_CONTEXT (t2); break;
1251       case tcc_type:
1252         t2 = TYPE_CONTEXT (t2); break;
1253       case tcc_exceptional:
1254         t2 = BLOCK_SUPERCONTEXT (t2); break;  /* assume block */
1255       default: gcc_unreachable ();
1256       }
1257
1258   return t1 == t2;
1259 }
1260
1261 /* Allocate the seen two types, assuming that they are compatible. */
1262
1263 static struct tagged_tu_seen_cache *
1264 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1265 {
1266   struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1267   tu->next = tagged_tu_seen_base;
1268   tu->t1 = t1;
1269   tu->t2 = t2;
1270
1271   tagged_tu_seen_base = tu;
1272
1273   /* The C standard says that two structures in different translation
1274      units are compatible with each other only if the types of their
1275      fields are compatible (among other things).  We assume that they
1276      are compatible until proven otherwise when building the cache.
1277      An example where this can occur is:
1278      struct a
1279      {
1280        struct a *next;
1281      };
1282      If we are comparing this against a similar struct in another TU,
1283      and did not assume they were compatible, we end up with an infinite
1284      loop.  */
1285   tu->val = 1;
1286   return tu;
1287 }
1288
1289 /* Free the seen types until we get to TU_TIL. */
1290
1291 static void
1292 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1293 {
1294   const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1295   while (tu != tu_til)
1296     {
1297       const struct tagged_tu_seen_cache *const tu1
1298         = (const struct tagged_tu_seen_cache *) tu;
1299       tu = tu1->next;
1300       free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1301     }
1302   tagged_tu_seen_base = tu_til;
1303 }
1304
1305 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1306    compatible.  If the two types are not the same (which has been
1307    checked earlier), this can only happen when multiple translation
1308    units are being compiled.  See C99 6.2.7 paragraph 1 for the exact
1309    rules.  ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1310    comptypes_internal.  */
1311
1312 static int
1313 tagged_types_tu_compatible_p (const_tree t1, const_tree t2,
1314                               bool *enum_and_int_p, bool *different_types_p)
1315 {
1316   tree s1, s2;
1317   bool needs_warning = false;
1318
1319   /* We have to verify that the tags of the types are the same.  This
1320      is harder than it looks because this may be a typedef, so we have
1321      to go look at the original type.  It may even be a typedef of a
1322      typedef...
1323      In the case of compiler-created builtin structs the TYPE_DECL
1324      may be a dummy, with no DECL_ORIGINAL_TYPE.  Don't fault.  */
1325   while (TYPE_NAME (t1)
1326          && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1327          && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1328     t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1329
1330   while (TYPE_NAME (t2)
1331          && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1332          && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1333     t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1334
1335   /* C90 didn't have the requirement that the two tags be the same.  */
1336   if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1337     return 0;
1338
1339   /* C90 didn't say what happened if one or both of the types were
1340      incomplete; we choose to follow C99 rules here, which is that they
1341      are compatible.  */
1342   if (TYPE_SIZE (t1) == NULL
1343       || TYPE_SIZE (t2) == NULL)
1344     return 1;
1345
1346   {
1347     const struct tagged_tu_seen_cache * tts_i;
1348     for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1349       if (tts_i->t1 == t1 && tts_i->t2 == t2)
1350         return tts_i->val;
1351   }
1352
1353   switch (TREE_CODE (t1))
1354     {
1355     case ENUMERAL_TYPE:
1356       {
1357         struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1358         /* Speed up the case where the type values are in the same order.  */
1359         tree tv1 = TYPE_VALUES (t1);
1360         tree tv2 = TYPE_VALUES (t2);
1361
1362         if (tv1 == tv2)
1363           {
1364             return 1;
1365           }
1366
1367         for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1368           {
1369             if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1370               break;
1371             if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1372               {
1373                 tu->val = 0;
1374                 return 0;
1375               }
1376           }
1377
1378         if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1379           {
1380             return 1;
1381           }
1382         if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1383           {
1384             tu->val = 0;
1385             return 0;
1386           }
1387
1388         if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1389           {
1390             tu->val = 0;
1391             return 0;
1392           }
1393
1394         for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1395           {
1396             s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1397             if (s2 == NULL
1398                 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1399               {
1400                 tu->val = 0;
1401                 return 0;
1402               }
1403           }
1404         return 1;
1405       }
1406
1407     case UNION_TYPE:
1408       {
1409         struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1410         if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1411           {
1412             tu->val = 0;
1413             return 0;
1414           }
1415
1416         /*  Speed up the common case where the fields are in the same order. */
1417         for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1418              s1 = DECL_CHAIN (s1), s2 = DECL_CHAIN (s2))
1419           {
1420             int result;
1421
1422             if (DECL_NAME (s1) != DECL_NAME (s2))
1423               break;
1424             result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2),
1425                                          enum_and_int_p, different_types_p);
1426
1427             if (result != 1 && !DECL_NAME (s1))
1428               break;
1429             if (result == 0)
1430               {
1431                 tu->val = 0;
1432                 return 0;
1433               }
1434             if (result == 2)
1435               needs_warning = true;
1436
1437             if (TREE_CODE (s1) == FIELD_DECL
1438                 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1439                                      DECL_FIELD_BIT_OFFSET (s2)) != 1)
1440               {
1441                 tu->val = 0;
1442                 return 0;
1443               }
1444           }
1445         if (!s1 && !s2)
1446           {
1447             tu->val = needs_warning ? 2 : 1;
1448             return tu->val;
1449           }
1450
1451         for (s1 = TYPE_FIELDS (t1); s1; s1 = DECL_CHAIN (s1))
1452           {
1453             bool ok = false;
1454
1455             for (s2 = TYPE_FIELDS (t2); s2; s2 = DECL_CHAIN (s2))
1456               if (DECL_NAME (s1) == DECL_NAME (s2))
1457                 {
1458                   int result;
1459
1460                   result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2),
1461                                                enum_and_int_p,
1462                                                different_types_p);
1463
1464                   if (result != 1 && !DECL_NAME (s1))
1465                     continue;
1466                   if (result == 0)
1467                     {
1468                       tu->val = 0;
1469                       return 0;
1470                     }
1471                   if (result == 2)
1472                     needs_warning = true;
1473
1474                   if (TREE_CODE (s1) == FIELD_DECL
1475                       && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1476                                            DECL_FIELD_BIT_OFFSET (s2)) != 1)
1477                     break;
1478
1479                   ok = true;
1480                   break;
1481                 }
1482             if (!ok)
1483               {
1484                 tu->val = 0;
1485                 return 0;
1486               }
1487           }
1488         tu->val = needs_warning ? 2 : 10;
1489         return tu->val;
1490       }
1491
1492     case RECORD_TYPE:
1493       {
1494         struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1495
1496         for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1497              s1 && s2;
1498              s1 = DECL_CHAIN (s1), s2 = DECL_CHAIN (s2))
1499           {
1500             int result;
1501             if (TREE_CODE (s1) != TREE_CODE (s2)
1502                 || DECL_NAME (s1) != DECL_NAME (s2))
1503               break;
1504             result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2),
1505                                          enum_and_int_p, different_types_p);
1506             if (result == 0)
1507               break;
1508             if (result == 2)
1509               needs_warning = true;
1510
1511             if (TREE_CODE (s1) == FIELD_DECL
1512                 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1513                                      DECL_FIELD_BIT_OFFSET (s2)) != 1)
1514               break;
1515           }
1516         if (s1 && s2)
1517           tu->val = 0;
1518         else
1519           tu->val = needs_warning ? 2 : 1;
1520         return tu->val;
1521       }
1522
1523     default:
1524       gcc_unreachable ();
1525     }
1526 }
1527
1528 /* Return 1 if two function types F1 and F2 are compatible.
1529    If either type specifies no argument types,
1530    the other must specify a fixed number of self-promoting arg types.
1531    Otherwise, if one type specifies only the number of arguments,
1532    the other must specify that number of self-promoting arg types.
1533    Otherwise, the argument types must match.
1534    ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal.  */
1535
1536 static int
1537 function_types_compatible_p (const_tree f1, const_tree f2,
1538                              bool *enum_and_int_p, bool *different_types_p)
1539 {
1540   tree args1, args2;
1541   /* 1 if no need for warning yet, 2 if warning cause has been seen.  */
1542   int val = 1;
1543   int val1;
1544   tree ret1, ret2;
1545
1546   ret1 = TREE_TYPE (f1);
1547   ret2 = TREE_TYPE (f2);
1548
1549   /* 'volatile' qualifiers on a function's return type used to mean
1550      the function is noreturn.  */
1551   if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1552     pedwarn (input_location, 0, "function return types not compatible due to %<volatile%>");
1553   if (TYPE_VOLATILE (ret1))
1554     ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1555                                  TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1556   if (TYPE_VOLATILE (ret2))
1557     ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1558                                  TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1559   val = comptypes_internal (ret1, ret2, enum_and_int_p, different_types_p);
1560   if (val == 0)
1561     return 0;
1562
1563   args1 = TYPE_ARG_TYPES (f1);
1564   args2 = TYPE_ARG_TYPES (f2);
1565
1566   if (different_types_p != NULL
1567       && (args1 == 0) != (args2 == 0))
1568     *different_types_p = true;
1569
1570   /* An unspecified parmlist matches any specified parmlist
1571      whose argument types don't need default promotions.  */
1572
1573   if (args1 == 0)
1574     {
1575       if (!self_promoting_args_p (args2))
1576         return 0;
1577       /* If one of these types comes from a non-prototype fn definition,
1578          compare that with the other type's arglist.
1579          If they don't match, ask for a warning (but no error).  */
1580       if (TYPE_ACTUAL_ARG_TYPES (f1)
1581           && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1),
1582                                            enum_and_int_p, different_types_p))
1583         val = 2;
1584       return val;
1585     }
1586   if (args2 == 0)
1587     {
1588       if (!self_promoting_args_p (args1))
1589         return 0;
1590       if (TYPE_ACTUAL_ARG_TYPES (f2)
1591           && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2),
1592                                            enum_and_int_p, different_types_p))
1593         val = 2;
1594       return val;
1595     }
1596
1597   /* Both types have argument lists: compare them and propagate results.  */
1598   val1 = type_lists_compatible_p (args1, args2, enum_and_int_p,
1599                                   different_types_p);
1600   return val1 != 1 ? val1 : val;
1601 }
1602
1603 /* Check two lists of types for compatibility, returning 0 for
1604    incompatible, 1 for compatible, or 2 for compatible with
1605    warning.  ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1606    comptypes_internal.  */
1607
1608 static int
1609 type_lists_compatible_p (const_tree args1, const_tree args2,
1610                          bool *enum_and_int_p, bool *different_types_p)
1611 {
1612   /* 1 if no need for warning yet, 2 if warning cause has been seen.  */
1613   int val = 1;
1614   int newval = 0;
1615
1616   while (1)
1617     {
1618       tree a1, mv1, a2, mv2;
1619       if (args1 == 0 && args2 == 0)
1620         return val;
1621       /* If one list is shorter than the other,
1622          they fail to match.  */
1623       if (args1 == 0 || args2 == 0)
1624         return 0;
1625       mv1 = a1 = TREE_VALUE (args1);
1626       mv2 = a2 = TREE_VALUE (args2);
1627       if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1628         mv1 = TYPE_MAIN_VARIANT (mv1);
1629       if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1630         mv2 = TYPE_MAIN_VARIANT (mv2);
1631       /* A null pointer instead of a type
1632          means there is supposed to be an argument
1633          but nothing is specified about what type it has.
1634          So match anything that self-promotes.  */
1635       if (different_types_p != NULL
1636           && (a1 == 0) != (a2 == 0))
1637         *different_types_p = true;
1638       if (a1 == 0)
1639         {
1640           if (c_type_promotes_to (a2) != a2)
1641             return 0;
1642         }
1643       else if (a2 == 0)
1644         {
1645           if (c_type_promotes_to (a1) != a1)
1646             return 0;
1647         }
1648       /* If one of the lists has an error marker, ignore this arg.  */
1649       else if (TREE_CODE (a1) == ERROR_MARK
1650                || TREE_CODE (a2) == ERROR_MARK)
1651         ;
1652       else if (!(newval = comptypes_internal (mv1, mv2, enum_and_int_p,
1653                                               different_types_p)))
1654         {
1655           if (different_types_p != NULL)
1656             *different_types_p = true;
1657           /* Allow  wait (union {union wait *u; int *i} *)
1658              and  wait (union wait *)  to be compatible.  */
1659           if (TREE_CODE (a1) == UNION_TYPE
1660               && (TYPE_NAME (a1) == 0
1661                   || TYPE_TRANSPARENT_AGGR (a1))
1662               && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1663               && tree_int_cst_equal (TYPE_SIZE (a1),
1664                                      TYPE_SIZE (a2)))
1665             {
1666               tree memb;
1667               for (memb = TYPE_FIELDS (a1);
1668                    memb; memb = DECL_CHAIN (memb))
1669                 {
1670                   tree mv3 = TREE_TYPE (memb);
1671                   if (mv3 && mv3 != error_mark_node
1672                       && TREE_CODE (mv3) != ARRAY_TYPE)
1673                     mv3 = TYPE_MAIN_VARIANT (mv3);
1674                   if (comptypes_internal (mv3, mv2, enum_and_int_p,
1675                                           different_types_p))
1676                     break;
1677                 }
1678               if (memb == 0)
1679                 return 0;
1680             }
1681           else if (TREE_CODE (a2) == UNION_TYPE
1682                    && (TYPE_NAME (a2) == 0
1683                        || TYPE_TRANSPARENT_AGGR (a2))
1684                    && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1685                    && tree_int_cst_equal (TYPE_SIZE (a2),
1686                                           TYPE_SIZE (a1)))
1687             {
1688               tree memb;
1689               for (memb = TYPE_FIELDS (a2);
1690                    memb; memb = DECL_CHAIN (memb))
1691                 {
1692                   tree mv3 = TREE_TYPE (memb);
1693                   if (mv3 && mv3 != error_mark_node
1694                       && TREE_CODE (mv3) != ARRAY_TYPE)
1695                     mv3 = TYPE_MAIN_VARIANT (mv3);
1696                   if (comptypes_internal (mv3, mv1, enum_and_int_p,
1697                                           different_types_p))
1698                     break;
1699                 }
1700               if (memb == 0)
1701                 return 0;
1702             }
1703           else
1704             return 0;
1705         }
1706
1707       /* comptypes said ok, but record if it said to warn.  */
1708       if (newval > val)
1709         val = newval;
1710
1711       args1 = TREE_CHAIN (args1);
1712       args2 = TREE_CHAIN (args2);
1713     }
1714 }
1715 \f
1716 /* Compute the size to increment a pointer by.  */
1717
1718 static tree
1719 c_size_in_bytes (const_tree type)
1720 {
1721   enum tree_code code = TREE_CODE (type);
1722
1723   if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1724     return size_one_node;
1725
1726   if (!COMPLETE_OR_VOID_TYPE_P (type))
1727     {
1728       error ("arithmetic on pointer to an incomplete type");
1729       return size_one_node;
1730     }
1731
1732   /* Convert in case a char is more than one unit.  */
1733   return size_binop_loc (input_location, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1734                          size_int (TYPE_PRECISION (char_type_node)
1735                                    / BITS_PER_UNIT));
1736 }
1737 \f
1738 /* Return either DECL or its known constant value (if it has one).  */
1739
1740 tree
1741 decl_constant_value (tree decl)
1742 {
1743   if (/* Don't change a variable array bound or initial value to a constant
1744          in a place where a variable is invalid.  Note that DECL_INITIAL
1745          isn't valid for a PARM_DECL.  */
1746       current_function_decl != 0
1747       && TREE_CODE (decl) != PARM_DECL
1748       && !TREE_THIS_VOLATILE (decl)
1749       && TREE_READONLY (decl)
1750       && DECL_INITIAL (decl) != 0
1751       && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1752       /* This is invalid if initial value is not constant.
1753          If it has either a function call, a memory reference,
1754          or a variable, then re-evaluating it could give different results.  */
1755       && TREE_CONSTANT (DECL_INITIAL (decl))
1756       /* Check for cases where this is sub-optimal, even though valid.  */
1757       && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1758     return DECL_INITIAL (decl);
1759   return decl;
1760 }
1761
1762 /* Convert the array expression EXP to a pointer.  */
1763 static tree
1764 array_to_pointer_conversion (location_t loc, tree exp)
1765 {
1766   tree orig_exp = exp;
1767   tree type = TREE_TYPE (exp);
1768   tree adr;
1769   tree restype = TREE_TYPE (type);
1770   tree ptrtype;
1771
1772   gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1773
1774   STRIP_TYPE_NOPS (exp);
1775
1776   if (TREE_NO_WARNING (orig_exp))
1777     TREE_NO_WARNING (exp) = 1;
1778
1779   ptrtype = build_pointer_type (restype);
1780
1781   if (TREE_CODE (exp) == INDIRECT_REF)
1782     return convert (ptrtype, TREE_OPERAND (exp, 0));
1783
1784   adr = build_unary_op (loc, ADDR_EXPR, exp, 1);
1785   return convert (ptrtype, adr);
1786 }
1787
1788 /* Convert the function expression EXP to a pointer.  */
1789 static tree
1790 function_to_pointer_conversion (location_t loc, tree exp)
1791 {
1792   tree orig_exp = exp;
1793
1794   gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1795
1796   STRIP_TYPE_NOPS (exp);
1797
1798   if (TREE_NO_WARNING (orig_exp))
1799     TREE_NO_WARNING (exp) = 1;
1800
1801   return build_unary_op (loc, ADDR_EXPR, exp, 0);
1802 }
1803
1804 /* Mark EXP as read, not just set, for set but not used -Wunused
1805    warning purposes.  */
1806
1807 void
1808 mark_exp_read (tree exp)
1809 {
1810   switch (TREE_CODE (exp))
1811     {
1812     case VAR_DECL:
1813     case PARM_DECL:
1814       DECL_READ_P (exp) = 1;
1815       break;
1816     case ARRAY_REF:
1817     case COMPONENT_REF:
1818     case MODIFY_EXPR:
1819     case REALPART_EXPR:
1820     case IMAGPART_EXPR:
1821     CASE_CONVERT:
1822     case ADDR_EXPR:
1823       mark_exp_read (TREE_OPERAND (exp, 0));
1824       break;
1825     case COMPOUND_EXPR:
1826     case C_MAYBE_CONST_EXPR:
1827       mark_exp_read (TREE_OPERAND (exp, 1));
1828       break;
1829     default:
1830       break;
1831     }
1832 }
1833
1834 /* Perform the default conversion of arrays and functions to pointers.
1835    Return the result of converting EXP.  For any other expression, just
1836    return EXP.
1837
1838    LOC is the location of the expression.  */
1839
1840 struct c_expr
1841 default_function_array_conversion (location_t loc, struct c_expr exp)
1842 {
1843   tree orig_exp = exp.value;
1844   tree type = TREE_TYPE (exp.value);
1845   enum tree_code code = TREE_CODE (type);
1846
1847   switch (code)
1848     {
1849     case ARRAY_TYPE:
1850       {
1851         bool not_lvalue = false;
1852         bool lvalue_array_p;
1853
1854         while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1855                 || CONVERT_EXPR_P (exp.value))
1856                && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1857           {
1858             if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1859               not_lvalue = true;
1860             exp.value = TREE_OPERAND (exp.value, 0);
1861           }
1862
1863         if (TREE_NO_WARNING (orig_exp))
1864           TREE_NO_WARNING (exp.value) = 1;
1865
1866         lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1867         if (!flag_isoc99 && !lvalue_array_p)
1868           {
1869             /* Before C99, non-lvalue arrays do not decay to pointers.
1870                Normally, using such an array would be invalid; but it can
1871                be used correctly inside sizeof or as a statement expression.
1872                Thus, do not give an error here; an error will result later.  */
1873             return exp;
1874           }
1875
1876         exp.value = array_to_pointer_conversion (loc, exp.value);
1877       }
1878       break;
1879     case FUNCTION_TYPE:
1880       exp.value = function_to_pointer_conversion (loc, exp.value);
1881       break;
1882     default:
1883       break;
1884     }
1885
1886   return exp;
1887 }
1888
1889 struct c_expr
1890 default_function_array_read_conversion (location_t loc, struct c_expr exp)
1891 {
1892   mark_exp_read (exp.value);
1893   return default_function_array_conversion (loc, exp);
1894 }
1895
1896 /* EXP is an expression of integer type.  Apply the integer promotions
1897    to it and return the promoted value.  */
1898
1899 tree
1900 perform_integral_promotions (tree exp)
1901 {
1902   tree type = TREE_TYPE (exp);
1903   enum tree_code code = TREE_CODE (type);
1904
1905   gcc_assert (INTEGRAL_TYPE_P (type));
1906
1907   /* Normally convert enums to int,
1908      but convert wide enums to something wider.  */
1909   if (code == ENUMERAL_TYPE)
1910     {
1911       type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1912                                           TYPE_PRECISION (integer_type_node)),
1913                                      ((TYPE_PRECISION (type)
1914                                        >= TYPE_PRECISION (integer_type_node))
1915                                       && TYPE_UNSIGNED (type)));
1916
1917       return convert (type, exp);
1918     }
1919
1920   /* ??? This should no longer be needed now bit-fields have their
1921      proper types.  */
1922   if (TREE_CODE (exp) == COMPONENT_REF
1923       && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1924       /* If it's thinner than an int, promote it like a
1925          c_promoting_integer_type_p, otherwise leave it alone.  */
1926       && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1927                                TYPE_PRECISION (integer_type_node)))
1928     return convert (integer_type_node, exp);
1929
1930   if (c_promoting_integer_type_p (type))
1931     {
1932       /* Preserve unsignedness if not really getting any wider.  */
1933       if (TYPE_UNSIGNED (type)
1934           && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1935         return convert (unsigned_type_node, exp);
1936
1937       return convert (integer_type_node, exp);
1938     }
1939
1940   return exp;
1941 }
1942
1943
1944 /* Perform default promotions for C data used in expressions.
1945    Enumeral types or short or char are converted to int.
1946    In addition, manifest constants symbols are replaced by their values.  */
1947
1948 tree
1949 default_conversion (tree exp)
1950 {
1951   tree orig_exp;
1952   tree type = TREE_TYPE (exp);
1953   enum tree_code code = TREE_CODE (type);
1954   tree promoted_type;
1955
1956   mark_exp_read (exp);
1957
1958   /* Functions and arrays have been converted during parsing.  */
1959   gcc_assert (code != FUNCTION_TYPE);
1960   if (code == ARRAY_TYPE)
1961     return exp;
1962
1963   /* Constants can be used directly unless they're not loadable.  */
1964   if (TREE_CODE (exp) == CONST_DECL)
1965     exp = DECL_INITIAL (exp);
1966
1967   /* Strip no-op conversions.  */
1968   orig_exp = exp;
1969   STRIP_TYPE_NOPS (exp);
1970
1971   if (TREE_NO_WARNING (orig_exp))
1972     TREE_NO_WARNING (exp) = 1;
1973
1974   if (code == VOID_TYPE)
1975     {
1976       error ("void value not ignored as it ought to be");
1977       return error_mark_node;
1978     }
1979
1980   exp = require_complete_type (exp);
1981   if (exp == error_mark_node)
1982     return error_mark_node;
1983
1984   promoted_type = targetm.promoted_type (type);
1985   if (promoted_type)
1986     return convert (promoted_type, exp);
1987
1988   if (INTEGRAL_TYPE_P (type))
1989     return perform_integral_promotions (exp);
1990
1991   return exp;
1992 }
1993 \f
1994 /* Look up COMPONENT in a structure or union TYPE.
1995
1996    If the component name is not found, returns NULL_TREE.  Otherwise,
1997    the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1998    stepping down the chain to the component, which is in the last
1999    TREE_VALUE of the list.  Normally the list is of length one, but if
2000    the component is embedded within (nested) anonymous structures or
2001    unions, the list steps down the chain to the component.  */
2002
2003 static tree
2004 lookup_field (tree type, tree component)
2005 {
2006   tree field;
2007
2008   /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2009      to the field elements.  Use a binary search on this array to quickly
2010      find the element.  Otherwise, do a linear search.  TYPE_LANG_SPECIFIC
2011      will always be set for structures which have many elements.  */
2012
2013   if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
2014     {
2015       int bot, top, half;
2016       tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
2017
2018       field = TYPE_FIELDS (type);
2019       bot = 0;
2020       top = TYPE_LANG_SPECIFIC (type)->s->len;
2021       while (top - bot > 1)
2022         {
2023           half = (top - bot + 1) >> 1;
2024           field = field_array[bot+half];
2025
2026           if (DECL_NAME (field) == NULL_TREE)
2027             {
2028               /* Step through all anon unions in linear fashion.  */
2029               while (DECL_NAME (field_array[bot]) == NULL_TREE)
2030                 {
2031                   field = field_array[bot++];
2032                   if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
2033                       || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
2034                     {
2035                       tree anon = lookup_field (TREE_TYPE (field), component);
2036
2037                       if (anon)
2038                         return tree_cons (NULL_TREE, field, anon);
2039
2040                       /* The Plan 9 compiler permits referring
2041                          directly to an anonymous struct/union field
2042                          using a typedef name.  */
2043                       if (flag_plan9_extensions
2044                           && TYPE_NAME (TREE_TYPE (field)) != NULL_TREE
2045                           && (TREE_CODE (TYPE_NAME (TREE_TYPE (field)))
2046                               == TYPE_DECL)
2047                           && (DECL_NAME (TYPE_NAME (TREE_TYPE (field)))
2048                               == component))
2049                         break;
2050                     }
2051                 }
2052
2053               /* Entire record is only anon unions.  */
2054               if (bot > top)
2055                 return NULL_TREE;
2056
2057               /* Restart the binary search, with new lower bound.  */
2058               continue;
2059             }
2060
2061           if (DECL_NAME (field) == component)
2062             break;
2063           if (DECL_NAME (field) < component)
2064             bot += half;
2065           else
2066             top = bot + half;
2067         }
2068
2069       if (DECL_NAME (field_array[bot]) == component)
2070         field = field_array[bot];
2071       else if (DECL_NAME (field) != component)
2072         return NULL_TREE;
2073     }
2074   else
2075     {
2076       for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2077         {
2078           if (DECL_NAME (field) == NULL_TREE
2079               && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
2080                   || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
2081             {
2082               tree anon = lookup_field (TREE_TYPE (field), component);
2083
2084               if (anon)
2085                 return tree_cons (NULL_TREE, field, anon);
2086
2087               /* The Plan 9 compiler permits referring directly to an
2088                  anonymous struct/union field using a typedef
2089                  name.  */
2090               if (flag_plan9_extensions
2091                   && TYPE_NAME (TREE_TYPE (field)) != NULL_TREE
2092                   && TREE_CODE (TYPE_NAME (TREE_TYPE (field))) == TYPE_DECL
2093                   && (DECL_NAME (TYPE_NAME (TREE_TYPE (field)))
2094                       == component))
2095                 break;
2096             }
2097
2098           if (DECL_NAME (field) == component)
2099             break;
2100         }
2101
2102       if (field == NULL_TREE)
2103         return NULL_TREE;
2104     }
2105
2106   return tree_cons (NULL_TREE, field, NULL_TREE);
2107 }
2108
2109 /* Make an expression to refer to the COMPONENT field of structure or
2110    union value DATUM.  COMPONENT is an IDENTIFIER_NODE.  LOC is the
2111    location of the COMPONENT_REF.  */
2112
2113 tree
2114 build_component_ref (location_t loc, tree datum, tree component)
2115 {
2116   tree type = TREE_TYPE (datum);
2117   enum tree_code code = TREE_CODE (type);
2118   tree field = NULL;
2119   tree ref;
2120   bool datum_lvalue = lvalue_p (datum);
2121
2122   if (!objc_is_public (datum, component))
2123     return error_mark_node;
2124
2125   /* Detect Objective-C property syntax object.property.  */
2126   if (c_dialect_objc ()
2127       && (ref = objc_maybe_build_component_ref (datum, component)))
2128     return ref;
2129
2130   /* See if there is a field or component with name COMPONENT.  */
2131
2132   if (code == RECORD_TYPE || code == UNION_TYPE)
2133     {
2134       if (!COMPLETE_TYPE_P (type))
2135         {
2136           c_incomplete_type_error (NULL_TREE, type);
2137           return error_mark_node;
2138         }
2139
2140       field = lookup_field (type, component);
2141
2142       if (!field)
2143         {
2144           error_at (loc, "%qT has no member named %qE", type, component);
2145           return error_mark_node;
2146         }
2147
2148       /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2149          This might be better solved in future the way the C++ front
2150          end does it - by giving the anonymous entities each a
2151          separate name and type, and then have build_component_ref
2152          recursively call itself.  We can't do that here.  */
2153       do
2154         {
2155           tree subdatum = TREE_VALUE (field);
2156           int quals;
2157           tree subtype;
2158           bool use_datum_quals;
2159
2160           if (TREE_TYPE (subdatum) == error_mark_node)
2161             return error_mark_node;
2162
2163           /* If this is an rvalue, it does not have qualifiers in C
2164              standard terms and we must avoid propagating such
2165              qualifiers down to a non-lvalue array that is then
2166              converted to a pointer.  */
2167           use_datum_quals = (datum_lvalue
2168                              || TREE_CODE (TREE_TYPE (subdatum)) != ARRAY_TYPE);
2169
2170           quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
2171           if (use_datum_quals)
2172             quals |= TYPE_QUALS (TREE_TYPE (datum));
2173           subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
2174
2175           ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
2176                         NULL_TREE);
2177           SET_EXPR_LOCATION (ref, loc);
2178           if (TREE_READONLY (subdatum)
2179               || (use_datum_quals && TREE_READONLY (datum)))
2180             TREE_READONLY (ref) = 1;
2181           if (TREE_THIS_VOLATILE (subdatum)
2182               || (use_datum_quals && TREE_THIS_VOLATILE (datum)))
2183             TREE_THIS_VOLATILE (ref) = 1;
2184
2185           if (TREE_DEPRECATED (subdatum))
2186             warn_deprecated_use (subdatum, NULL_TREE);
2187
2188           datum = ref;
2189
2190           field = TREE_CHAIN (field);
2191         }
2192       while (field);
2193
2194       return ref;
2195     }
2196   else if (code != ERROR_MARK)
2197     error_at (loc,
2198               "request for member %qE in something not a structure or union",
2199               component);
2200
2201   return error_mark_node;
2202 }
2203 \f
2204 /* Given an expression PTR for a pointer, return an expression
2205    for the value pointed to.
2206    ERRORSTRING is the name of the operator to appear in error messages.
2207
2208    LOC is the location to use for the generated tree.  */
2209
2210 tree
2211 build_indirect_ref (location_t loc, tree ptr, ref_operator errstring)
2212 {
2213   tree pointer = default_conversion (ptr);
2214   tree type = TREE_TYPE (pointer);
2215   tree ref;
2216
2217   if (TREE_CODE (type) == POINTER_TYPE)
2218     {
2219       if (CONVERT_EXPR_P (pointer)
2220           || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
2221         {
2222           /* If a warning is issued, mark it to avoid duplicates from
2223              the backend.  This only needs to be done at
2224              warn_strict_aliasing > 2.  */
2225           if (warn_strict_aliasing > 2)
2226             if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
2227                                          type, TREE_OPERAND (pointer, 0)))
2228               TREE_NO_WARNING (pointer) = 1;
2229         }
2230
2231       if (TREE_CODE (pointer) == ADDR_EXPR
2232           && (TREE_TYPE (TREE_OPERAND (pointer, 0))
2233               == TREE_TYPE (type)))
2234         {
2235           ref = TREE_OPERAND (pointer, 0);
2236           protected_set_expr_location (ref, loc);
2237           return ref;
2238         }
2239       else
2240         {
2241           tree t = TREE_TYPE (type);
2242
2243           ref = build1 (INDIRECT_REF, t, pointer);
2244
2245           if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2246             {
2247               error_at (loc, "dereferencing pointer to incomplete type");
2248               return error_mark_node;
2249             }
2250           if (VOID_TYPE_P (t) && c_inhibit_evaluation_warnings == 0)
2251             warning_at (loc, 0, "dereferencing %<void *%> pointer");
2252
2253           /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2254              so that we get the proper error message if the result is used
2255              to assign to.  Also, &* is supposed to be a no-op.
2256              And ANSI C seems to specify that the type of the result
2257              should be the const type.  */
2258           /* A de-reference of a pointer to const is not a const.  It is valid
2259              to change it via some other pointer.  */
2260           TREE_READONLY (ref) = TYPE_READONLY (t);
2261           TREE_SIDE_EFFECTS (ref)
2262             = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2263           TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2264           protected_set_expr_location (ref, loc);
2265           return ref;
2266         }
2267     }
2268   else if (TREE_CODE (pointer) != ERROR_MARK)
2269     invalid_indirection_error (loc, type, errstring);
2270
2271   return error_mark_node;
2272 }
2273
2274 /* This handles expressions of the form "a[i]", which denotes
2275    an array reference.
2276
2277    This is logically equivalent in C to *(a+i), but we may do it differently.
2278    If A is a variable or a member, we generate a primitive ARRAY_REF.
2279    This avoids forcing the array out of registers, and can work on
2280    arrays that are not lvalues (for example, members of structures returned
2281    by functions).
2282
2283    For vector types, allow vector[i] but not i[vector], and create
2284    *(((type*)&vectortype) + i) for the expression.
2285
2286    LOC is the location to use for the returned expression.  */
2287
2288 tree
2289 build_array_ref (location_t loc, tree array, tree index)
2290 {
2291   tree ret;
2292   bool swapped = false;
2293   if (TREE_TYPE (array) == error_mark_node
2294       || TREE_TYPE (index) == error_mark_node)
2295     return error_mark_node;
2296
2297   if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2298       && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE
2299       /* Allow vector[index] but not index[vector].  */
2300       && TREE_CODE (TREE_TYPE (array)) != VECTOR_TYPE)
2301     {
2302       tree temp;
2303       if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2304           && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2305         {
2306           error_at (loc,
2307             "subscripted value is neither array nor pointer nor vector");
2308
2309           return error_mark_node;
2310         }
2311       temp = array;
2312       array = index;
2313       index = temp;
2314       swapped = true;
2315     }
2316
2317   if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2318     {
2319       error_at (loc, "array subscript is not an integer");
2320       return error_mark_node;
2321     }
2322
2323   if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2324     {
2325       error_at (loc, "subscripted value is pointer to function");
2326       return error_mark_node;
2327     }
2328
2329   /* ??? Existing practice has been to warn only when the char
2330      index is syntactically the index, not for char[array].  */
2331   if (!swapped)
2332      warn_array_subscript_with_type_char (index);
2333
2334   /* Apply default promotions *after* noticing character types.  */
2335   index = default_conversion (index);
2336
2337   gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2338
2339   /* For vector[index], convert the vector to a
2340      pointer of the underlying type.  */
2341   if (TREE_CODE (TREE_TYPE (array)) == VECTOR_TYPE)
2342     {
2343       tree type = TREE_TYPE (array);
2344       tree type1;
2345
2346       if (TREE_CODE (index) == INTEGER_CST)
2347         if (!host_integerp (index, 1)
2348             || ((unsigned HOST_WIDE_INT) tree_low_cst (index, 1)
2349                >= TYPE_VECTOR_SUBPARTS (TREE_TYPE (array))))
2350           warning_at (loc, OPT_Warray_bounds, "index value is out of bound");
2351
2352       c_common_mark_addressable_vec (array);
2353       type = build_qualified_type (TREE_TYPE (type), TYPE_QUALS (type));
2354       type = build_pointer_type (type);
2355       type1 = build_pointer_type (TREE_TYPE (array));
2356       array = build1 (ADDR_EXPR, type1, array);
2357       array = convert (type, array);
2358     }
2359
2360   if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2361     {
2362       tree rval, type;
2363
2364       /* An array that is indexed by a non-constant
2365          cannot be stored in a register; we must be able to do
2366          address arithmetic on its address.
2367          Likewise an array of elements of variable size.  */
2368       if (TREE_CODE (index) != INTEGER_CST
2369           || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2370               && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2371         {
2372           if (!c_mark_addressable (array))
2373             return error_mark_node;
2374         }
2375       /* An array that is indexed by a constant value which is not within
2376          the array bounds cannot be stored in a register either; because we
2377          would get a crash in store_bit_field/extract_bit_field when trying
2378          to access a non-existent part of the register.  */
2379       if (TREE_CODE (index) == INTEGER_CST
2380           && TYPE_DOMAIN (TREE_TYPE (array))
2381           && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2382         {
2383           if (!c_mark_addressable (array))
2384             return error_mark_node;
2385         }
2386
2387       if (pedantic)
2388         {
2389           tree foo = array;
2390           while (TREE_CODE (foo) == COMPONENT_REF)
2391             foo = TREE_OPERAND (foo, 0);
2392           if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2393             pedwarn (loc, OPT_pedantic,
2394                      "ISO C forbids subscripting %<register%> array");
2395           else if (!flag_isoc99 && !lvalue_p (foo))
2396             pedwarn (loc, OPT_pedantic,
2397                      "ISO C90 forbids subscripting non-lvalue array");
2398         }
2399
2400       type = TREE_TYPE (TREE_TYPE (array));
2401       rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2402       /* Array ref is const/volatile if the array elements are
2403          or if the array is.  */
2404       TREE_READONLY (rval)
2405         |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2406             | TREE_READONLY (array));
2407       TREE_SIDE_EFFECTS (rval)
2408         |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2409             | TREE_SIDE_EFFECTS (array));
2410       TREE_THIS_VOLATILE (rval)
2411         |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2412             /* This was added by rms on 16 Nov 91.
2413                It fixes  vol struct foo *a;  a->elts[1]
2414                in an inline function.
2415                Hope it doesn't break something else.  */
2416             | TREE_THIS_VOLATILE (array));
2417       ret = require_complete_type (rval);
2418       protected_set_expr_location (ret, loc);
2419       return ret;
2420     }
2421   else
2422     {
2423       tree ar = default_conversion (array);
2424
2425       if (ar == error_mark_node)
2426         return ar;
2427
2428       gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2429       gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2430
2431       return build_indirect_ref
2432         (loc, build_binary_op (loc, PLUS_EXPR, ar, index, 0),
2433          RO_ARRAY_INDEXING);
2434     }
2435 }
2436 \f
2437 /* Build an external reference to identifier ID.  FUN indicates
2438    whether this will be used for a function call.  LOC is the source
2439    location of the identifier.  This sets *TYPE to the type of the
2440    identifier, which is not the same as the type of the returned value
2441    for CONST_DECLs defined as enum constants.  If the type of the
2442    identifier is not available, *TYPE is set to NULL.  */
2443 tree
2444 build_external_ref (location_t loc, tree id, int fun, tree *type)
2445 {
2446   tree ref;
2447   tree decl = lookup_name (id);
2448
2449   /* In Objective-C, an instance variable (ivar) may be preferred to
2450      whatever lookup_name() found.  */
2451   decl = objc_lookup_ivar (decl, id);
2452
2453   *type = NULL;
2454   if (decl && decl != error_mark_node)
2455     {
2456       ref = decl;
2457       *type = TREE_TYPE (ref);
2458     }
2459   else if (fun)
2460     /* Implicit function declaration.  */
2461     ref = implicitly_declare (loc, id);
2462   else if (decl == error_mark_node)
2463     /* Don't complain about something that's already been
2464        complained about.  */
2465     return error_mark_node;
2466   else
2467     {
2468       undeclared_variable (loc, id);
2469       return error_mark_node;
2470     }
2471
2472   if (TREE_TYPE (ref) == error_mark_node)
2473     return error_mark_node;
2474
2475   if (TREE_DEPRECATED (ref))
2476     warn_deprecated_use (ref, NULL_TREE);
2477
2478   /* Recursive call does not count as usage.  */
2479   if (ref != current_function_decl)
2480     {
2481       TREE_USED (ref) = 1;
2482     }
2483
2484   if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2485     {
2486       if (!in_sizeof && !in_typeof)
2487         C_DECL_USED (ref) = 1;
2488       else if (DECL_INITIAL (ref) == 0
2489                && DECL_EXTERNAL (ref)
2490                && !TREE_PUBLIC (ref))
2491         record_maybe_used_decl (ref);
2492     }
2493
2494   if (TREE_CODE (ref) == CONST_DECL)
2495     {
2496       used_types_insert (TREE_TYPE (ref));
2497
2498       if (warn_cxx_compat
2499           && TREE_CODE (TREE_TYPE (ref)) == ENUMERAL_TYPE
2500           && C_TYPE_DEFINED_IN_STRUCT (TREE_TYPE (ref)))
2501         {
2502           warning_at (loc, OPT_Wc___compat,
2503                       ("enum constant defined in struct or union "
2504                        "is not visible in C++"));
2505           inform (DECL_SOURCE_LOCATION (ref), "enum constant defined here");
2506         }
2507
2508       ref = DECL_INITIAL (ref);
2509       TREE_CONSTANT (ref) = 1;
2510     }
2511   else if (current_function_decl != 0
2512            && !DECL_FILE_SCOPE_P (current_function_decl)
2513            && (TREE_CODE (ref) == VAR_DECL
2514                || TREE_CODE (ref) == PARM_DECL
2515                || TREE_CODE (ref) == FUNCTION_DECL))
2516     {
2517       tree context = decl_function_context (ref);
2518
2519       if (context != 0 && context != current_function_decl)
2520         DECL_NONLOCAL (ref) = 1;
2521     }
2522   /* C99 6.7.4p3: An inline definition of a function with external
2523      linkage ... shall not contain a reference to an identifier with
2524      internal linkage.  */
2525   else if (current_function_decl != 0
2526            && DECL_DECLARED_INLINE_P (current_function_decl)
2527            && DECL_EXTERNAL (current_function_decl)
2528            && VAR_OR_FUNCTION_DECL_P (ref)
2529            && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2530            && ! TREE_PUBLIC (ref)
2531            && DECL_CONTEXT (ref) != current_function_decl)
2532     record_inline_static (loc, current_function_decl, ref,
2533                           csi_internal);
2534
2535   return ref;
2536 }
2537
2538 /* Record details of decls possibly used inside sizeof or typeof.  */
2539 struct maybe_used_decl
2540 {
2541   /* The decl.  */
2542   tree decl;
2543   /* The level seen at (in_sizeof + in_typeof).  */
2544   int level;
2545   /* The next one at this level or above, or NULL.  */
2546   struct maybe_used_decl *next;
2547 };
2548
2549 static struct maybe_used_decl *maybe_used_decls;
2550
2551 /* Record that DECL, an undefined static function reference seen
2552    inside sizeof or typeof, might be used if the operand of sizeof is
2553    a VLA type or the operand of typeof is a variably modified
2554    type.  */
2555
2556 static void
2557 record_maybe_used_decl (tree decl)
2558 {
2559   struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2560   t->decl = decl;
2561   t->level = in_sizeof + in_typeof;
2562   t->next = maybe_used_decls;
2563   maybe_used_decls = t;
2564 }
2565
2566 /* Pop the stack of decls possibly used inside sizeof or typeof.  If
2567    USED is false, just discard them.  If it is true, mark them used
2568    (if no longer inside sizeof or typeof) or move them to the next
2569    level up (if still inside sizeof or typeof).  */
2570
2571 void
2572 pop_maybe_used (bool used)
2573 {
2574   struct maybe_used_decl *p = maybe_used_decls;
2575   int cur_level = in_sizeof + in_typeof;
2576   while (p && p->level > cur_level)
2577     {
2578       if (used)
2579         {
2580           if (cur_level == 0)
2581             C_DECL_USED (p->decl) = 1;
2582           else
2583             p->level = cur_level;
2584         }
2585       p = p->next;
2586     }
2587   if (!used || cur_level == 0)
2588     maybe_used_decls = p;
2589 }
2590
2591 /* Return the result of sizeof applied to EXPR.  */
2592
2593 struct c_expr
2594 c_expr_sizeof_expr (location_t loc, struct c_expr expr)
2595 {
2596   struct c_expr ret;
2597   if (expr.value == error_mark_node)
2598     {
2599       ret.value = error_mark_node;
2600       ret.original_code = ERROR_MARK;
2601       ret.original_type = NULL;
2602       pop_maybe_used (false);
2603     }
2604   else
2605     {
2606       bool expr_const_operands = true;
2607       tree folded_expr = c_fully_fold (expr.value, require_constant_value,
2608                                        &expr_const_operands);
2609       ret.value = c_sizeof (loc, TREE_TYPE (folded_expr));
2610       ret.original_code = ERROR_MARK;
2611       ret.original_type = NULL;
2612       if (c_vla_type_p (TREE_TYPE (folded_expr)))
2613         {
2614           /* sizeof is evaluated when given a vla (C99 6.5.3.4p2).  */
2615           ret.value = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret.value),
2616                               folded_expr, ret.value);
2617           C_MAYBE_CONST_EXPR_NON_CONST (ret.value) = !expr_const_operands;
2618           SET_EXPR_LOCATION (ret.value, loc);
2619         }
2620       pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (folded_expr)));
2621     }
2622   return ret;
2623 }
2624
2625 /* Return the result of sizeof applied to T, a structure for the type
2626    name passed to sizeof (rather than the type itself).  LOC is the
2627    location of the original expression.  */
2628
2629 struct c_expr
2630 c_expr_sizeof_type (location_t loc, struct c_type_name *t)
2631 {
2632   tree type;
2633   struct c_expr ret;
2634   tree type_expr = NULL_TREE;
2635   bool type_expr_const = true;
2636   type = groktypename (t, &type_expr, &type_expr_const);
2637   ret.value = c_sizeof (loc, type);
2638   ret.original_code = ERROR_MARK;
2639   ret.original_type = NULL;
2640   if ((type_expr || TREE_CODE (ret.value) == INTEGER_CST)
2641       && c_vla_type_p (type))
2642     {
2643       /* If the type is a [*] array, it is a VLA but is represented as
2644          having a size of zero.  In such a case we must ensure that
2645          the result of sizeof does not get folded to a constant by
2646          c_fully_fold, because if the size is evaluated the result is
2647          not constant and so constraints on zero or negative size
2648          arrays must not be applied when this sizeof call is inside
2649          another array declarator.  */
2650       if (!type_expr)
2651         type_expr = integer_zero_node;
2652       ret.value = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret.value),
2653                           type_expr, ret.value);
2654       C_MAYBE_CONST_EXPR_NON_CONST (ret.value) = !type_expr_const;
2655     }
2656   pop_maybe_used (type != error_mark_node
2657                   ? C_TYPE_VARIABLE_SIZE (type) : false);
2658   return ret;
2659 }
2660
2661 /* Build a function call to function FUNCTION with parameters PARAMS.
2662    The function call is at LOC.
2663    PARAMS is a list--a chain of TREE_LIST nodes--in which the
2664    TREE_VALUE of each node is a parameter-expression.
2665    FUNCTION's data type may be a function type or a pointer-to-function.  */
2666
2667 tree
2668 build_function_call (location_t loc, tree function, tree params)
2669 {
2670   VEC(tree,gc) *vec;
2671   tree ret;
2672
2673   vec = VEC_alloc (tree, gc, list_length (params));
2674   for (; params; params = TREE_CHAIN (params))
2675     VEC_quick_push (tree, vec, TREE_VALUE (params));
2676   ret = build_function_call_vec (loc, function, vec, NULL);
2677   VEC_free (tree, gc, vec);
2678   return ret;
2679 }
2680
2681 /* Build a function call to function FUNCTION with parameters PARAMS.
2682    ORIGTYPES, if not NULL, is a vector of types; each element is
2683    either NULL or the original type of the corresponding element in
2684    PARAMS.  The original type may differ from TREE_TYPE of the
2685    parameter for enums.  FUNCTION's data type may be a function type
2686    or pointer-to-function.  This function changes the elements of
2687    PARAMS.  */
2688
2689 tree
2690 build_function_call_vec (location_t loc, tree function, VEC(tree,gc) *params,
2691                          VEC(tree,gc) *origtypes)
2692 {
2693   tree fntype, fundecl = 0;
2694   tree name = NULL_TREE, result;
2695   tree tem;
2696   int nargs;
2697   tree *argarray;
2698
2699
2700   /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue.  */
2701   STRIP_TYPE_NOPS (function);
2702
2703   /* Convert anything with function type to a pointer-to-function.  */
2704   if (TREE_CODE (function) == FUNCTION_DECL)
2705     {
2706       /* Implement type-directed function overloading for builtins.
2707          resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2708          handle all the type checking.  The result is a complete expression
2709          that implements this function call.  */
2710       tem = resolve_overloaded_builtin (loc, function, params);
2711       if (tem)
2712         return tem;
2713
2714       name = DECL_NAME (function);
2715       fundecl = function;
2716     }
2717   if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2718     function = function_to_pointer_conversion (loc, function);
2719
2720   /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2721      expressions, like those used for ObjC messenger dispatches.  */
2722   if (!VEC_empty (tree, params))
2723     function = objc_rewrite_function_call (function,
2724                                            VEC_index (tree, params, 0));
2725
2726   function = c_fully_fold (function, false, NULL);
2727
2728   fntype = TREE_TYPE (function);
2729
2730   if (TREE_CODE (fntype) == ERROR_MARK)
2731     return error_mark_node;
2732
2733   if (!(TREE_CODE (fntype) == POINTER_TYPE
2734         && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2735     {
2736       error_at (loc, "called object %qE is not a function", function);
2737       return error_mark_node;
2738     }
2739
2740   if (fundecl && TREE_THIS_VOLATILE (fundecl))
2741     current_function_returns_abnormally = 1;
2742
2743   /* fntype now gets the type of function pointed to.  */
2744   fntype = TREE_TYPE (fntype);
2745
2746   /* Convert the parameters to the types declared in the
2747      function prototype, or apply default promotions.  */
2748
2749   nargs = convert_arguments (TYPE_ARG_TYPES (fntype), params, origtypes,
2750                              function, fundecl);
2751   if (nargs < 0)
2752     return error_mark_node;
2753
2754   /* Check that the function is called through a compatible prototype.
2755      If it is not, replace the call by a trap, wrapped up in a compound
2756      expression if necessary.  This has the nice side-effect to prevent
2757      the tree-inliner from generating invalid assignment trees which may
2758      blow up in the RTL expander later.  */
2759   if (CONVERT_EXPR_P (function)
2760       && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2761       && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2762       && !comptypes (fntype, TREE_TYPE (tem)))
2763     {
2764       tree return_type = TREE_TYPE (fntype);
2765       tree trap = build_function_call (loc, built_in_decls[BUILT_IN_TRAP],
2766                                        NULL_TREE);
2767       int i;
2768
2769       /* This situation leads to run-time undefined behavior.  We can't,
2770          therefore, simply error unless we can prove that all possible
2771          executions of the program must execute the code.  */
2772       if (warning_at (loc, 0, "function called through a non-compatible type"))
2773         /* We can, however, treat "undefined" any way we please.
2774            Call abort to encourage the user to fix the program.  */
2775         inform (loc, "if this code is reached, the program will abort");
2776       /* Before the abort, allow the function arguments to exit or
2777          call longjmp.  */
2778       for (i = 0; i < nargs; i++)
2779         trap = build2 (COMPOUND_EXPR, void_type_node,
2780                        VEC_index (tree, params, i), trap);
2781
2782       if (VOID_TYPE_P (return_type))
2783         {
2784           if (TYPE_QUALS (return_type) != TYPE_UNQUALIFIED)
2785             pedwarn (loc, 0,
2786                      "function with qualified void return type called");
2787           return trap;
2788         }
2789       else
2790         {
2791           tree rhs;
2792
2793           if (AGGREGATE_TYPE_P (return_type))
2794             rhs = build_compound_literal (loc, return_type,
2795                                           build_constructor (return_type, 0),
2796                                           false);
2797           else
2798             rhs = build_zero_cst (return_type);
2799
2800           return require_complete_type (build2 (COMPOUND_EXPR, return_type,
2801                                                 trap, rhs));
2802         }
2803     }
2804
2805   argarray = VEC_address (tree, params);
2806
2807   /* Check that arguments to builtin functions match the expectations.  */
2808   if (fundecl
2809       && DECL_BUILT_IN (fundecl)
2810       && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2811       && !check_builtin_function_arguments (fundecl, nargs, argarray))
2812     return error_mark_node;
2813
2814   /* Check that the arguments to the function are valid.  */
2815   check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2816                             TYPE_ARG_TYPES (fntype));
2817
2818   if (name != NULL_TREE
2819       && !strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10))
2820     {
2821       if (require_constant_value)
2822         result =
2823           fold_build_call_array_initializer_loc (loc, TREE_TYPE (fntype),
2824                                                  function, nargs, argarray);
2825       else
2826         result = fold_build_call_array_loc (loc, TREE_TYPE (fntype),
2827                                             function, nargs, argarray);
2828       if (TREE_CODE (result) == NOP_EXPR
2829           && TREE_CODE (TREE_OPERAND (result, 0)) == INTEGER_CST)
2830         STRIP_TYPE_NOPS (result);
2831     }
2832   else
2833     result = build_call_array_loc (loc, TREE_TYPE (fntype),
2834                                    function, nargs, argarray);
2835
2836   if (VOID_TYPE_P (TREE_TYPE (result)))
2837     {
2838       if (TYPE_QUALS (TREE_TYPE (result)) != TYPE_UNQUALIFIED)
2839         pedwarn (loc, 0,
2840                  "function with qualified void return type called");
2841       return result;
2842     }
2843   return require_complete_type (result);
2844 }
2845 \f
2846 /* Convert the argument expressions in the vector VALUES
2847    to the types in the list TYPELIST.
2848
2849    If TYPELIST is exhausted, or when an element has NULL as its type,
2850    perform the default conversions.
2851
2852    ORIGTYPES is the original types of the expressions in VALUES.  This
2853    holds the type of enum values which have been converted to integral
2854    types.  It may be NULL.
2855
2856    FUNCTION is a tree for the called function.  It is used only for
2857    error messages, where it is formatted with %qE.
2858
2859    This is also where warnings about wrong number of args are generated.
2860
2861    Returns the actual number of arguments processed (which may be less
2862    than the length of VALUES in some error situations), or -1 on
2863    failure.  */
2864
2865 static int
2866 convert_arguments (tree typelist, VEC(tree,gc) *values,
2867                    VEC(tree,gc) *origtypes, tree function, tree fundecl)
2868 {
2869   tree typetail, val;
2870   unsigned int parmnum;
2871   bool error_args = false;
2872   const bool type_generic = fundecl
2873     && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2874   bool type_generic_remove_excess_precision = false;
2875   tree selector;
2876
2877   /* Change pointer to function to the function itself for
2878      diagnostics.  */
2879   if (TREE_CODE (function) == ADDR_EXPR
2880       && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2881     function = TREE_OPERAND (function, 0);
2882
2883   /* Handle an ObjC selector specially for diagnostics.  */
2884   selector = objc_message_selector ();
2885
2886   /* For type-generic built-in functions, determine whether excess
2887      precision should be removed (classification) or not
2888      (comparison).  */
2889   if (type_generic
2890       && DECL_BUILT_IN (fundecl)
2891       && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL)
2892     {
2893       switch (DECL_FUNCTION_CODE (fundecl))
2894         {
2895         case BUILT_IN_ISFINITE:
2896         case BUILT_IN_ISINF:
2897         case BUILT_IN_ISINF_SIGN:
2898         case BUILT_IN_ISNAN:
2899         case BUILT_IN_ISNORMAL:
2900         case BUILT_IN_FPCLASSIFY:
2901           type_generic_remove_excess_precision = true;
2902           break;
2903
2904         default:
2905           type_generic_remove_excess_precision = false;
2906           break;
2907         }
2908     }
2909
2910   /* Scan the given expressions and types, producing individual
2911      converted arguments.  */
2912
2913   for (typetail = typelist, parmnum = 0;
2914        VEC_iterate (tree, values, parmnum, val);
2915        ++parmnum)
2916     {
2917       tree type = typetail ? TREE_VALUE (typetail) : 0;
2918       tree valtype = TREE_TYPE (val);
2919       tree rname = function;
2920       int argnum = parmnum + 1;
2921       const char *invalid_func_diag;
2922       bool excess_precision = false;
2923       bool npc;
2924       tree parmval;
2925
2926       if (type == void_type_node)
2927         {
2928           if (selector)
2929             error_at (input_location,
2930                       "too many arguments to method %qE", selector);
2931           else
2932             error_at (input_location,
2933                       "too many arguments to function %qE", function);
2934
2935           if (fundecl && !DECL_BUILT_IN (fundecl))
2936             inform (DECL_SOURCE_LOCATION (fundecl), "declared here");
2937           return parmnum;
2938         }
2939
2940       if (selector && argnum > 2)
2941         {
2942           rname = selector;
2943           argnum -= 2;
2944         }
2945
2946       npc = null_pointer_constant_p (val);
2947
2948       /* If there is excess precision and a prototype, convert once to
2949          the required type rather than converting via the semantic
2950          type.  Likewise without a prototype a float value represented
2951          as long double should be converted once to double.  But for
2952          type-generic classification functions excess precision must
2953          be removed here.  */
2954       if (TREE_CODE (val) == EXCESS_PRECISION_EXPR
2955           && (type || !type_generic || !type_generic_remove_excess_precision))
2956         {
2957           val = TREE_OPERAND (val, 0);
2958           excess_precision = true;
2959         }
2960       val = c_fully_fold (val, false, NULL);
2961       STRIP_TYPE_NOPS (val);
2962
2963       val = require_complete_type (val);
2964
2965       if (type != 0)
2966         {
2967           /* Formal parm type is specified by a function prototype.  */
2968
2969           if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2970             {
2971               error ("type of formal parameter %d is incomplete", parmnum + 1);
2972               parmval = val;
2973             }
2974           else
2975             {
2976               tree origtype;
2977
2978               /* Optionally warn about conversions that
2979                  differ from the default conversions.  */
2980               if (warn_traditional_conversion || warn_traditional)
2981                 {
2982                   unsigned int formal_prec = TYPE_PRECISION (type);
2983
2984                   if (INTEGRAL_TYPE_P (type)
2985                       && TREE_CODE (valtype) == REAL_TYPE)
2986                     warning (0, "passing argument %d of %qE as integer "
2987                              "rather than floating due to prototype",
2988                              argnum, rname);
2989                   if (INTEGRAL_TYPE_P (type)
2990                       && TREE_CODE (valtype) == COMPLEX_TYPE)
2991                     warning (0, "passing argument %d of %qE as integer "
2992                              "rather than complex due to prototype",
2993                              argnum, rname);
2994                   else if (TREE_CODE (type) == COMPLEX_TYPE
2995                            && TREE_CODE (valtype) == REAL_TYPE)
2996                     warning (0, "passing argument %d of %qE as complex "
2997                              "rather than floating due to prototype",
2998                              argnum, rname);
2999                   else if (TREE_CODE (type) == REAL_TYPE
3000                            && INTEGRAL_TYPE_P (valtype))
3001                     warning (0, "passing argument %d of %qE as floating "
3002                              "rather than integer due to prototype",
3003                              argnum, rname);
3004                   else if (TREE_CODE (type) == COMPLEX_TYPE
3005                            && INTEGRAL_TYPE_P (valtype))
3006                     warning (0, "passing argument %d of %qE as complex "
3007                              "rather than integer due to prototype",
3008                              argnum, rname);
3009                   else if (TREE_CODE (type) == REAL_TYPE
3010                            && TREE_CODE (valtype) == COMPLEX_TYPE)
3011                     warning (0, "passing argument %d of %qE as floating "
3012                              "rather than complex due to prototype",
3013                              argnum, rname);
3014                   /* ??? At some point, messages should be written about
3015                      conversions between complex types, but that's too messy
3016                      to do now.  */
3017                   else if (TREE_CODE (type) == REAL_TYPE
3018                            && TREE_CODE (valtype) == REAL_TYPE)
3019                     {
3020                       /* Warn if any argument is passed as `float',
3021                          since without a prototype it would be `double'.  */
3022                       if (formal_prec == TYPE_PRECISION (float_type_node)
3023                           && type != dfloat32_type_node)
3024                         warning (0, "passing argument %d of %qE as %<float%> "
3025                                  "rather than %<double%> due to prototype",
3026                                  argnum, rname);
3027
3028                       /* Warn if mismatch between argument and prototype
3029                          for decimal float types.  Warn of conversions with
3030                          binary float types and of precision narrowing due to
3031                          prototype. */
3032                       else if (type != valtype
3033                                && (type == dfloat32_type_node
3034                                    || type == dfloat64_type_node
3035                                    || type == dfloat128_type_node
3036                                    || valtype == dfloat32_type_node
3037                                    || valtype == dfloat64_type_node
3038                                    || valtype == dfloat128_type_node)
3039                                && (formal_prec
3040                                    <= TYPE_PRECISION (valtype)
3041                                    || (type == dfloat128_type_node
3042                                        && (valtype
3043                                            != dfloat64_type_node
3044                                            && (valtype
3045                                                != dfloat32_type_node)))
3046                                    || (type == dfloat64_type_node
3047                                        && (valtype
3048                                            != dfloat32_type_node))))
3049                         warning (0, "passing argument %d of %qE as %qT "
3050                                  "rather than %qT due to prototype",
3051                                  argnum, rname, type, valtype);
3052
3053                     }
3054                   /* Detect integer changing in width or signedness.
3055                      These warnings are only activated with
3056                      -Wtraditional-conversion, not with -Wtraditional.  */
3057                   else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
3058                            && INTEGRAL_TYPE_P (valtype))
3059                     {
3060                       tree would_have_been = default_conversion (val);
3061                       tree type1 = TREE_TYPE (would_have_been);
3062
3063                       if (TREE_CODE (type) == ENUMERAL_TYPE
3064                           && (TYPE_MAIN_VARIANT (type)
3065                               == TYPE_MAIN_VARIANT (valtype)))
3066                         /* No warning if function asks for enum
3067                            and the actual arg is that enum type.  */
3068                         ;
3069                       else if (formal_prec != TYPE_PRECISION (type1))
3070                         warning (OPT_Wtraditional_conversion,
3071                                  "passing argument %d of %qE "
3072                                  "with different width due to prototype",
3073                                  argnum, rname);
3074                       else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
3075                         ;
3076                       /* Don't complain if the formal parameter type
3077                          is an enum, because we can't tell now whether
3078                          the value was an enum--even the same enum.  */
3079                       else if (TREE_CODE (type) == ENUMERAL_TYPE)
3080                         ;
3081                       else if (TREE_CODE (val) == INTEGER_CST
3082                                && int_fits_type_p (val, type))
3083                         /* Change in signedness doesn't matter
3084                            if a constant value is unaffected.  */
3085                         ;
3086                       /* If the value is extended from a narrower
3087                          unsigned type, it doesn't matter whether we
3088                          pass it as signed or unsigned; the value
3089                          certainly is the same either way.  */
3090                       else if (TYPE_PRECISION (valtype) < TYPE_PRECISION (type)
3091                                && TYPE_UNSIGNED (valtype))
3092                         ;
3093                       else if (TYPE_UNSIGNED (type))
3094                         warning (OPT_Wtraditional_conversion,
3095                                  "passing argument %d of %qE "
3096                                  "as unsigned due to prototype",
3097                                  argnum, rname);
3098                       else
3099                         warning (OPT_Wtraditional_conversion,
3100                                  "passing argument %d of %qE "
3101                                  "as signed due to prototype", argnum, rname);
3102                     }
3103                 }
3104
3105               /* Possibly restore an EXCESS_PRECISION_EXPR for the
3106                  sake of better warnings from convert_and_check.  */
3107               if (excess_precision)
3108                 val = build1 (EXCESS_PRECISION_EXPR, valtype, val);
3109               origtype = (origtypes == NULL
3110                           ? NULL_TREE
3111                           : VEC_index (tree, origtypes, parmnum));
3112               parmval = convert_for_assignment (input_location, type, val,
3113                                                 origtype, ic_argpass, npc,
3114                                                 fundecl, function,
3115                                                 parmnum + 1);
3116
3117               if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
3118                   && INTEGRAL_TYPE_P (type)
3119                   && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
3120                 parmval = default_conversion (parmval);
3121             }
3122         }
3123       else if (TREE_CODE (valtype) == REAL_TYPE
3124                && (TYPE_PRECISION (valtype)
3125                    < TYPE_PRECISION (double_type_node))
3126                && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (valtype)))
3127         {
3128           if (type_generic)
3129             parmval = val;
3130           else
3131             {
3132               /* Convert `float' to `double'.  */
3133               if (warn_double_promotion && !c_inhibit_evaluation_warnings)
3134                 warning (OPT_Wdouble_promotion,
3135                          "implicit conversion from %qT to %qT when passing "
3136                          "argument to function",
3137                          valtype, double_type_node);
3138               parmval = convert (double_type_node, val);
3139             }
3140         }
3141       else if (excess_precision && !type_generic)
3142         /* A "double" argument with excess precision being passed
3143            without a prototype or in variable arguments.  */
3144         parmval = convert (valtype, val);
3145       else if ((invalid_func_diag =
3146                 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
3147         {
3148           error (invalid_func_diag);
3149           return -1;
3150         }
3151       else
3152         /* Convert `short' and `char' to full-size `int'.  */
3153         parmval = default_conversion (val);
3154
3155       VEC_replace (tree, values, parmnum, parmval);
3156       if (parmval == error_mark_node)
3157         error_args = true;
3158
3159       if (typetail)
3160         typetail = TREE_CHAIN (typetail);
3161     }
3162
3163   gcc_assert (parmnum == VEC_length (tree, values));
3164
3165   if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
3166     {
3167       error_at (input_location,
3168                 "too few arguments to function %qE", function);
3169       if (fundecl && !DECL_BUILT_IN (fundecl))
3170         inform (DECL_SOURCE_LOCATION (fundecl), "declared here");
3171       return -1;
3172     }
3173
3174   return error_args ? -1 : (int) parmnum;
3175 }
3176 \f
3177 /* This is the entry point used by the parser to build unary operators
3178    in the input.  CODE, a tree_code, specifies the unary operator, and
3179    ARG is the operand.  For unary plus, the C parser currently uses
3180    CONVERT_EXPR for code.
3181
3182    LOC is the location to use for the tree generated.
3183 */
3184
3185 struct c_expr
3186 parser_build_unary_op (location_t loc, enum tree_code code, struct c_expr arg)
3187 {
3188   struct c_expr result;
3189
3190   result.value = build_unary_op (loc, code, arg.value, 0);
3191   result.original_code = code;
3192   result.original_type = NULL;
3193
3194   if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
3195     overflow_warning (loc, result.value);
3196
3197   return result;
3198 }
3199
3200 /* This is the entry point used by the parser to build binary operators
3201    in the input.  CODE, a tree_code, specifies the binary operator, and
3202    ARG1 and ARG2 are the operands.  In addition to constructing the
3203    expression, we check for operands that were written with other binary
3204    operators in a way that is likely to confuse the user.
3205
3206    LOCATION is the location of the binary operator.  */
3207
3208 struct c_expr
3209 parser_build_binary_op (location_t location, enum tree_code code,
3210                         struct c_expr arg1, struct c_expr arg2)
3211 {
3212   struct c_expr result;
3213
3214   enum tree_code code1 = arg1.original_code;
3215   enum tree_code code2 = arg2.original_code;
3216   tree type1 = (arg1.original_type
3217                 ? arg1.original_type
3218                 : TREE_TYPE (arg1.value));
3219   tree type2 = (arg2.original_type
3220                 ? arg2.original_type
3221                 : TREE_TYPE (arg2.value));
3222
3223   result.value = build_binary_op (location, code,
3224                                   arg1.value, arg2.value, 1);
3225   result.original_code = code;
3226   result.original_type = NULL;
3227
3228   if (TREE_CODE (result.value) == ERROR_MARK)
3229     return result;
3230
3231   if (location != UNKNOWN_LOCATION)
3232     protected_set_expr_location (result.value, location);
3233
3234   /* Check for cases such as x+y<<z which users are likely
3235      to misinterpret.  */
3236   if (warn_parentheses)
3237     warn_about_parentheses (code, code1, arg1.value, code2, arg2.value);
3238
3239   if (warn_logical_op)
3240     warn_logical_operator (input_location, code, TREE_TYPE (result.value),
3241                            code1, arg1.value, code2, arg2.value);
3242
3243   /* Warn about comparisons against string literals, with the exception
3244      of testing for equality or inequality of a string literal with NULL.  */
3245   if (code == EQ_EXPR || code == NE_EXPR)
3246     {
3247       if ((code1 == STRING_CST && !integer_zerop (arg2.value))
3248           || (code2 == STRING_CST && !integer_zerop (arg1.value)))
3249         warning_at (location, OPT_Waddress,
3250                     "comparison with string literal results in unspecified behavior");
3251     }
3252   else if (TREE_CODE_CLASS (code) == tcc_comparison
3253            && (code1 == STRING_CST || code2 == STRING_CST))
3254     warning_at (location, OPT_Waddress,
3255                 "comparison with string literal results in unspecified behavior");
3256
3257   if (TREE_OVERFLOW_P (result.value)
3258       && !TREE_OVERFLOW_P (arg1.value)
3259       && !TREE_OVERFLOW_P (arg2.value))
3260     overflow_warning (location, result.value);
3261
3262   /* Warn about comparisons of different enum types.  */
3263   if (warn_enum_compare
3264       && TREE_CODE_CLASS (code) == tcc_comparison
3265       && TREE_CODE (type1) == ENUMERAL_TYPE
3266       && TREE_CODE (type2) == ENUMERAL_TYPE
3267       && TYPE_MAIN_VARIANT (type1) != TYPE_MAIN_VARIANT (type2))
3268     warning_at (location, OPT_Wenum_compare,
3269                 "comparison between %qT and %qT",
3270                 type1, type2);
3271
3272   return result;
3273 }
3274 \f
3275 /* Return a tree for the difference of pointers OP0 and OP1.
3276    The resulting tree has type int.  */
3277
3278 static tree
3279 pointer_diff (location_t loc, tree op0, tree op1)
3280 {
3281   tree restype = ptrdiff_type_node;
3282   tree result, inttype;
3283
3284   addr_space_t as0 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (op0)));
3285   addr_space_t as1 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (op1)));
3286   tree target_type = TREE_TYPE (TREE_TYPE (op0));
3287   tree con0, con1, lit0, lit1;
3288   tree orig_op1 = op1;
3289
3290   /* If the operands point into different address spaces, we need to
3291      explicitly convert them to pointers into the common address space
3292      before we can subtract the numerical address values.  */
3293   if (as0 != as1)
3294     {
3295       addr_space_t as_common;
3296       tree common_type;
3297
3298       /* Determine the common superset address space.  This is guaranteed
3299          to exist because the caller verified that comp_target_types
3300          returned non-zero.  */
3301       if (!addr_space_superset (as0, as1, &as_common))
3302         gcc_unreachable ();
3303
3304       common_type = common_pointer_type (TREE_TYPE (op0), TREE_TYPE (op1));
3305       op0 = convert (common_type, op0);
3306       op1 = convert (common_type, op1);
3307     }
3308
3309   /* Determine integer type to perform computations in.  This will usually
3310      be the same as the result type (ptrdiff_t), but may need to be a wider
3311      type if pointers for the address space are wider than ptrdiff_t.  */
3312   if (TYPE_PRECISION (restype) < TYPE_PRECISION (TREE_TYPE (op0)))
3313     inttype = lang_hooks.types.type_for_size
3314                 (TYPE_PRECISION (TREE_TYPE (op0)), 0);
3315   else
3316     inttype = restype;
3317
3318
3319   if (TREE_CODE (target_type) == VOID_TYPE)
3320     pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3321              "pointer of type %<void *%> used in subtraction");
3322   if (TREE_CODE (target_type) == FUNCTION_TYPE)
3323     pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3324              "pointer to a function used in subtraction");
3325
3326   /* If the conversion to ptrdiff_type does anything like widening or
3327      converting a partial to an integral mode, we get a convert_expression
3328      that is in the way to do any simplifications.
3329      (fold-const.c doesn't know that the extra bits won't be needed.
3330      split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
3331      different mode in place.)
3332      So first try to find a common term here 'by hand'; we want to cover
3333      at least the cases that occur in legal static initializers.  */
3334   if (CONVERT_EXPR_P (op0)
3335       && (TYPE_PRECISION (TREE_TYPE (op0))
3336           == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
3337     con0 = TREE_OPERAND (op0, 0);
3338   else
3339     con0 = op0;
3340   if (CONVERT_EXPR_P (op1)
3341       && (TYPE_PRECISION (TREE_TYPE (op1))
3342           == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
3343     con1 = TREE_OPERAND (op1, 0);
3344   else
3345     con1 = op1;
3346
3347   if (TREE_CODE (con0) == PLUS_EXPR)
3348     {
3349       lit0 = TREE_OPERAND (con0, 1);
3350       con0 = TREE_OPERAND (con0, 0);
3351     }
3352   else
3353     lit0 = integer_zero_node;
3354
3355   if (TREE_CODE (con1) == PLUS_EXPR)
3356     {
3357       lit1 = TREE_OPERAND (con1, 1);
3358       con1 = TREE_OPERAND (con1, 0);
3359     }
3360   else
3361     lit1 = integer_zero_node;
3362
3363   if (operand_equal_p (con0, con1, 0))
3364     {
3365       op0 = lit0;
3366       op1 = lit1;
3367     }
3368
3369
3370   /* First do the subtraction as integers;
3371      then drop through to build the divide operator.
3372      Do not do default conversions on the minus operator
3373      in case restype is a short type.  */
3374
3375   op0 = build_binary_op (loc,
3376                          MINUS_EXPR, convert (inttype, op0),
3377                          convert (inttype, op1), 0);
3378   /* This generates an error if op1 is pointer to incomplete type.  */
3379   if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
3380     error_at (loc, "arithmetic on pointer to an incomplete type");
3381
3382   /* This generates an error if op0 is pointer to incomplete type.  */
3383   op1 = c_size_in_bytes (target_type);
3384
3385   /* Divide by the size, in easiest possible way.  */
3386   result = fold_build2_loc (loc, EXACT_DIV_EXPR, inttype,
3387                             op0, convert (inttype, op1));
3388
3389   /* Convert to final result type if necessary.  */
3390   return convert (restype, result);
3391 }
3392 \f
3393 /* Construct and perhaps optimize a tree representation
3394    for a unary operation.  CODE, a tree_code, specifies the operation
3395    and XARG is the operand.
3396    For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
3397    the default promotions (such as from short to int).
3398    For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
3399    allows non-lvalues; this is only used to handle conversion of non-lvalue
3400    arrays to pointers in C99.
3401
3402    LOCATION is the location of the operator.  */
3403
3404 tree
3405 build_unary_op (location_t location,
3406                 enum tree_code code, tree xarg, int flag)
3407 {
3408   /* No default_conversion here.  It causes trouble for ADDR_EXPR.  */
3409   tree arg = xarg;
3410   tree argtype = 0;
3411   enum tree_code typecode;
3412   tree val;
3413   tree ret = error_mark_node;
3414   tree eptype = NULL_TREE;
3415   int noconvert = flag;
3416   const char *invalid_op_diag;
3417   bool int_operands;
3418
3419   int_operands = EXPR_INT_CONST_OPERANDS (xarg);
3420   if (int_operands)
3421     arg = remove_c_maybe_const_expr (arg);
3422
3423   if (code != ADDR_EXPR)
3424     arg = require_complete_type (arg);
3425
3426   typecode = TREE_CODE (TREE_TYPE (arg));
3427   if (typecode == ERROR_MARK)
3428     return error_mark_node;
3429   if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
3430     typecode = INTEGER_TYPE;
3431
3432   if ((invalid_op_diag
3433        = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
3434     {
3435       error_at (location, invalid_op_diag);
3436       return error_mark_node;
3437     }
3438
3439   if (TREE_CODE (arg) == EXCESS_PRECISION_EXPR)
3440     {
3441       eptype = TREE_TYPE (arg);
3442       arg = TREE_OPERAND (arg, 0);
3443     }
3444
3445   switch (code)
3446     {
3447     case CONVERT_EXPR:
3448       /* This is used for unary plus, because a CONVERT_EXPR
3449          is enough to prevent anybody from looking inside for
3450          associativity, but won't generate any code.  */
3451       if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3452             || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
3453             || typecode == VECTOR_TYPE))
3454         {
3455           error_at (location, "wrong type argument to unary plus");
3456           return error_mark_node;
3457         }
3458       else if (!noconvert)
3459         arg = default_conversion (arg);
3460       arg = non_lvalue_loc (location, arg);
3461       break;
3462
3463     case NEGATE_EXPR:
3464       if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3465             || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
3466             || typecode == VECTOR_TYPE))
3467         {
3468           error_at (location, "wrong type argument to unary minus");
3469           return error_mark_node;
3470         }
3471       else if (!noconvert)
3472         arg = default_conversion (arg);
3473       break;
3474
3475     case BIT_NOT_EXPR:
3476       /* ~ works on integer types and non float vectors. */
3477       if (typecode == INTEGER_TYPE
3478           || (typecode == VECTOR_TYPE
3479               && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
3480         {
3481           if (!noconvert)
3482             arg = default_conversion (arg);
3483         }
3484       else if (typecode == COMPLEX_TYPE)
3485         {
3486           code = CONJ_EXPR;
3487           pedwarn (location, OPT_pedantic,
3488                    "ISO C does not support %<~%> for complex conjugation");
3489           if (!noconvert)
3490             arg = default_conversion (arg);
3491         }
3492       else
3493         {
3494           error_at (location, "wrong type argument to bit-complement");
3495           return error_mark_node;
3496         }
3497       break;
3498
3499     case ABS_EXPR:
3500       if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
3501         {
3502           error_at (location, "wrong type argument to abs");
3503           return error_mark_node;
3504         }
3505       else if (!noconvert)
3506         arg = default_conversion (arg);
3507       break;
3508
3509     case CONJ_EXPR:
3510       /* Conjugating a real value is a no-op, but allow it anyway.  */
3511       if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3512             || typecode == COMPLEX_TYPE))
3513         {
3514           error_at (location, "wrong type argument to conjugation");
3515           return error_mark_node;
3516         }
3517       else if (!noconvert)
3518         arg = default_conversion (arg);
3519       break;
3520
3521     case TRUTH_NOT_EXPR:
3522       if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
3523           && typecode != REAL_TYPE && typecode != POINTER_TYPE
3524           && typecode != COMPLEX_TYPE)
3525         {
3526           error_at (location,
3527                     "wrong type argument to unary exclamation mark");
3528           return error_mark_node;
3529         }
3530       arg = c_objc_common_truthvalue_conversion (location, arg);
3531       ret = invert_truthvalue_loc (location, arg);
3532       /* If the TRUTH_NOT_EXPR has been folded, reset the location.  */
3533       if (EXPR_P (ret) && EXPR_HAS_LOCATION (ret))
3534         location = EXPR_LOCATION (ret);
3535       goto return_build_unary_op;
3536
3537     case REALPART_EXPR:
3538     case IMAGPART_EXPR:
3539       ret = build_real_imag_expr (location, code, arg);
3540       if (ret == error_mark_node)
3541         return error_mark_node;
3542       if (eptype && TREE_CODE (eptype) == COMPLEX_TYPE)
3543         eptype = TREE_TYPE (eptype);
3544       goto return_build_unary_op;
3545
3546     case PREINCREMENT_EXPR:
3547     case POSTINCREMENT_EXPR:
3548     case PREDECREMENT_EXPR:
3549     case POSTDECREMENT_EXPR:
3550
3551       if (TREE_CODE (arg) == C_MAYBE_CONST_EXPR)
3552         {
3553           tree inner = build_unary_op (location, code,
3554                                        C_MAYBE_CONST_EXPR_EXPR (arg), flag);
3555           if (inner == error_mark_node)
3556             return error_mark_node;
3557           ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
3558                         C_MAYBE_CONST_EXPR_PRE (arg), inner);
3559           gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg));
3560           C_MAYBE_CONST_EXPR_NON_CONST (ret) = 1;
3561           goto return_build_unary_op;
3562         }
3563
3564       /* Complain about anything that is not a true lvalue.  In
3565          Objective-C, skip this check for property_refs.  */
3566       if (!objc_is_property_ref (arg)
3567           && !lvalue_or_else (location,
3568                               arg, ((code == PREINCREMENT_EXPR
3569                                      || code == POSTINCREMENT_EXPR)
3570                                     ? lv_increment
3571                                     : lv_decrement)))
3572         return error_mark_node;
3573
3574       if (warn_cxx_compat && TREE_CODE (TREE_TYPE (arg)) == ENUMERAL_TYPE)
3575         {
3576           if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3577             warning_at (location, OPT_Wc___compat,
3578                         "increment of enumeration value is invalid in C++");
3579           else
3580             warning_at (location, OPT_Wc___compat,
3581                         "decrement of enumeration value is invalid in C++");
3582         }
3583
3584       /* Ensure the argument is fully folded inside any SAVE_EXPR.  */
3585       arg = c_fully_fold (arg, false, NULL);
3586
3587       /* Increment or decrement the real part of the value,
3588          and don't change the imaginary part.  */
3589       if (typecode == COMPLEX_TYPE)
3590         {
3591           tree real, imag;
3592
3593           pedwarn (location, OPT_pedantic,
3594                    "ISO C does not support %<++%> and %<--%> on complex types");
3595
3596           arg = stabilize_reference (arg);
3597           real = build_unary_op (EXPR_LOCATION (arg), REALPART_EXPR, arg, 1);
3598           imag = build_unary_op (EXPR_LOCATION (arg), IMAGPART_EXPR, arg, 1);
3599           real = build_unary_op (EXPR_LOCATION (arg), code, real, 1);
3600           if (real == error_mark_node || imag == error_mark_node)
3601             return error_mark_node;
3602           ret = build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3603                         real, imag);
3604           goto return_build_unary_op;
3605         }
3606
3607       /* Report invalid types.  */
3608
3609       if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3610           && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3611         {
3612           if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3613             error_at (location, "wrong type argument to increment");
3614           else
3615             error_at (location, "wrong type argument to decrement");
3616
3617           return error_mark_node;
3618         }
3619
3620       {
3621         tree inc;
3622
3623         argtype = TREE_TYPE (arg);
3624
3625         /* Compute the increment.  */
3626
3627         if (typecode == POINTER_TYPE)
3628           {
3629             /* If pointer target is an undefined struct,
3630                we just cannot know how to do the arithmetic.  */
3631             if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (argtype)))
3632               {
3633                 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3634                   error_at (location,
3635                             "increment of pointer to unknown structure");
3636                 else
3637                   error_at (location,
3638                             "decrement of pointer to unknown structure");
3639               }
3640             else if (TREE_CODE (TREE_TYPE (argtype)) == FUNCTION_TYPE
3641                      || TREE_CODE (TREE_TYPE (argtype)) == VOID_TYPE)
3642               {
3643                 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3644                   pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3645                            "wrong type argument to increment");
3646                 else
3647                   pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3648                            "wrong type argument to decrement");
3649               }
3650
3651             inc = c_size_in_bytes (TREE_TYPE (argtype));
3652             inc = fold_convert_loc (location, sizetype, inc);
3653           }
3654         else if (FRACT_MODE_P (TYPE_MODE (argtype)))
3655           {
3656             /* For signed fract types, we invert ++ to -- or
3657                -- to ++, and change inc from 1 to -1, because
3658                it is not possible to represent 1 in signed fract constants.
3659                For unsigned fract types, the result always overflows and
3660                we get an undefined (original) or the maximum value.  */
3661             if (code == PREINCREMENT_EXPR)
3662               code = PREDECREMENT_EXPR;
3663             else if (code == PREDECREMENT_EXPR)
3664               code = PREINCREMENT_EXPR;
3665             else if (code == POSTINCREMENT_EXPR)
3666               code = POSTDECREMENT_EXPR;
3667             else /* code == POSTDECREMENT_EXPR  */
3668               code = POSTINCREMENT_EXPR;
3669
3670             inc = integer_minus_one_node;
3671             inc = convert (argtype, inc);
3672           }
3673         else
3674           {
3675             inc = integer_one_node;
3676             inc = convert (argtype, inc);
3677           }
3678
3679         /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
3680            need to ask Objective-C to build the increment or decrement
3681            expression for it.  */
3682         if (objc_is_property_ref (arg))
3683           return objc_build_incr_expr_for_property_ref (location, code,
3684                                                         arg, inc);
3685
3686         /* Report a read-only lvalue.  */
3687         if (TYPE_READONLY (argtype))
3688           {
3689             readonly_error (arg,
3690                             ((code == PREINCREMENT_EXPR
3691                               || code == POSTINCREMENT_EXPR)
3692                              ? lv_increment : lv_decrement));
3693             return error_mark_node;
3694           }
3695         else if (TREE_READONLY (arg))
3696           readonly_warning (arg,
3697                             ((code == PREINCREMENT_EXPR
3698                               || code == POSTINCREMENT_EXPR)
3699                              ? lv_increment : lv_decrement));
3700
3701         if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3702           val = boolean_increment (code, arg);
3703         else
3704           val = build2 (code, TREE_TYPE (arg), arg, inc);
3705         TREE_SIDE_EFFECTS (val) = 1;
3706         if (TREE_CODE (val) != code)
3707           TREE_NO_WARNING (val) = 1;
3708         ret = val;
3709         goto return_build_unary_op;
3710       }
3711
3712     case ADDR_EXPR:
3713       /* Note that this operation never does default_conversion.  */
3714
3715       /* The operand of unary '&' must be an lvalue (which excludes
3716          expressions of type void), or, in C99, the result of a [] or
3717          unary '*' operator.  */
3718       if (VOID_TYPE_P (TREE_TYPE (arg))
3719           && TYPE_QUALS (TREE_TYPE (arg)) == TYPE_UNQUALIFIED
3720           && (TREE_CODE (arg) != INDIRECT_REF
3721               || !flag_isoc99))
3722         pedwarn (location, 0, "taking address of expression of type %<void%>");
3723
3724       /* Let &* cancel out to simplify resulting code.  */
3725       if (TREE_CODE (arg) == INDIRECT_REF)
3726         {
3727           /* Don't let this be an lvalue.  */
3728           if (lvalue_p (TREE_OPERAND (arg, 0)))
3729             return non_lvalue_loc (location, TREE_OPERAND (arg, 0));
3730           ret = TREE_OPERAND (arg, 0);
3731           goto return_build_unary_op;
3732         }
3733
3734       /* For &x[y], return x+y */
3735       if (TREE_CODE (arg) == ARRAY_REF)
3736         {
3737           tree op0 = TREE_OPERAND (arg, 0);
3738           if (!c_mark_addressable (op0))
3739             return error_mark_node;
3740         }
3741
3742       /* Anything not already handled and not a true memory reference
3743          or a non-lvalue array is an error.  */
3744       else if (typecode != FUNCTION_TYPE && !flag
3745                && !lvalue_or_else (location, arg, lv_addressof))
3746         return error_mark_node;
3747
3748       /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3749          folding later.  */
3750       if (TREE_CODE (arg) == C_MAYBE_CONST_EXPR)
3751         {
3752           tree inner = build_unary_op (location, code,
3753                                        C_MAYBE_CONST_EXPR_EXPR (arg), flag);
3754           ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
3755                         C_MAYBE_CONST_EXPR_PRE (arg), inner);
3756           gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg));
3757           C_MAYBE_CONST_EXPR_NON_CONST (ret)
3758             = C_MAYBE_CONST_EXPR_NON_CONST (arg);
3759           goto return_build_unary_op;
3760         }
3761
3762       /* Ordinary case; arg is a COMPONENT_REF or a decl.  */
3763       argtype = TREE_TYPE (arg);
3764
3765       /* If the lvalue is const or volatile, merge that into the type
3766          to which the address will point.  This is only needed
3767          for function types.  */
3768       if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3769           && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg))
3770           && TREE_CODE (argtype) == FUNCTION_TYPE)
3771         {
3772           int orig_quals = TYPE_QUALS (strip_array_types (argtype));
3773           int quals = orig_quals;
3774
3775           if (TREE_READONLY (arg))
3776             quals |= TYPE_QUAL_CONST;
3777           if (TREE_THIS_VOLATILE (arg))
3778             quals |= TYPE_QUAL_VOLATILE;
3779
3780           argtype = c_build_qualified_type (argtype, quals);
3781         }
3782
3783       if (!c_mark_addressable (arg))
3784         return error_mark_node;
3785
3786       gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3787                   || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3788
3789       argtype = build_pointer_type (argtype);
3790
3791       /* ??? Cope with user tricks that amount to offsetof.  Delete this
3792          when we have proper support for integer constant expressions.  */
3793       val = get_base_address (arg);
3794       if (val && TREE_CODE (val) == INDIRECT_REF
3795           && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3796         {
3797           tree op0 = fold_convert_loc (location, sizetype,
3798                                        fold_offsetof (arg, val)), op1;
3799
3800           op1 = fold_convert_loc (location, argtype, TREE_OPERAND (val, 0));
3801           ret = fold_build2_loc (location, POINTER_PLUS_EXPR, argtype, op1, op0);
3802           goto return_build_unary_op;
3803         }
3804
3805       val = build1 (ADDR_EXPR, argtype, arg);
3806
3807       ret = val;
3808       goto return_build_unary_op;
3809
3810     default:
3811       gcc_unreachable ();
3812     }
3813
3814   if (argtype == 0)
3815     argtype = TREE_TYPE (arg);
3816   if (TREE_CODE (arg) == INTEGER_CST)
3817     ret = (require_constant_value
3818            ? fold_build1_initializer_loc (location, code, argtype, arg)
3819            : fold_build1_loc (location, code, argtype, arg));
3820   else
3821     ret = build1 (code, argtype, arg);
3822  return_build_unary_op:
3823   gcc_assert (ret != error_mark_node);
3824   if (TREE_CODE (ret) == INTEGER_CST && !TREE_OVERFLOW (ret)
3825       && !(TREE_CODE (xarg) == INTEGER_CST && !TREE_OVERFLOW (xarg)))
3826     ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
3827   else if (TREE_CODE (ret) != INTEGER_CST && int_operands)
3828     ret = note_integer_operands (ret);
3829   if (eptype)
3830     ret = build1 (EXCESS_PRECISION_EXPR, eptype, ret);
3831   protected_set_expr_location (ret, location);
3832   return ret;
3833 }
3834
3835 /* Return nonzero if REF is an lvalue valid for this language.
3836    Lvalues can be assigned, unless their type has TYPE_READONLY.
3837    Lvalues can have their address taken, unless they have C_DECL_REGISTER.  */
3838
3839 bool
3840 lvalue_p (const_tree ref)
3841 {
3842   const enum tree_code code = TREE_CODE (ref);
3843
3844   switch (code)
3845     {
3846     case REALPART_EXPR:
3847     case IMAGPART_EXPR:
3848     case COMPONENT_REF:
3849       return lvalue_p (TREE_OPERAND (ref, 0));
3850
3851     case C_MAYBE_CONST_EXPR:
3852       return lvalue_p (TREE_OPERAND (ref, 1));
3853
3854     case COMPOUND_LITERAL_EXPR:
3855     case STRING_CST:
3856       return 1;
3857
3858     case INDIRECT_REF:
3859     case ARRAY_REF:
3860     case VAR_DECL:
3861     case PARM_DECL:
3862     case RESULT_DECL:
3863     case ERROR_MARK:
3864       return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3865               && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3866
3867     case BIND_EXPR:
3868       return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3869
3870     default:
3871       return 0;
3872     }
3873 }
3874 \f
3875 /* Give a warning for storing in something that is read-only in GCC
3876    terms but not const in ISO C terms.  */
3877
3878 static void
3879 readonly_warning (tree arg, enum lvalue_use use)
3880 {
3881   switch (use)
3882     {
3883     case lv_assign:
3884       warning (0, "assignment of read-only location %qE", arg);
3885       break;
3886     case lv_increment:
3887       warning (0, "increment of read-only location %qE", arg);
3888       break;
3889     case lv_decrement:
3890       warning (0, "decrement of read-only location %qE", arg);
3891       break;
3892     default:
3893       gcc_unreachable ();
3894     }
3895   return;
3896 }
3897
3898
3899 /* Return nonzero if REF is an lvalue valid for this language;
3900    otherwise, print an error message and return zero.  USE says
3901    how the lvalue is being used and so selects the error message.
3902    LOCATION is the location at which any error should be reported.  */
3903
3904 static int
3905 lvalue_or_else (location_t loc, const_tree ref, enum lvalue_use use)
3906 {
3907   int win = lvalue_p (ref);
3908
3909   if (!win)
3910     lvalue_error (loc, use);
3911
3912   return win;
3913 }
3914 \f
3915 /* Mark EXP saying that we need to be able to take the
3916    address of it; it should not be allocated in a register.
3917    Returns true if successful.  */
3918
3919 bool
3920 c_mark_addressable (tree exp)
3921 {
3922   tree x = exp;
3923
3924   while (1)
3925     switch (TREE_CODE (x))
3926       {
3927       case COMPONENT_REF:
3928         if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3929           {
3930             error
3931               ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3932             return false;
3933           }
3934
3935         /* ... fall through ...  */
3936
3937       case ADDR_EXPR:
3938       case ARRAY_REF:
3939       case REALPART_EXPR:
3940       case IMAGPART_EXPR:
3941         x = TREE_OPERAND (x, 0);
3942         break;
3943
3944       case COMPOUND_LITERAL_EXPR:
3945       case CONSTRUCTOR:
3946         TREE_ADDRESSABLE (x) = 1;
3947         return true;
3948
3949       case VAR_DECL:
3950       case CONST_DECL:
3951       case PARM_DECL:
3952       case RESULT_DECL:
3953         if (C_DECL_REGISTER (x)
3954             && DECL_NONLOCAL (x))
3955           {
3956             if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3957               {
3958                 error
3959                   ("global register variable %qD used in nested function", x);
3960                 return false;
3961               }
3962             pedwarn (input_location, 0, "register variable %qD used in nested function", x);
3963           }
3964         else if (C_DECL_REGISTER (x))
3965           {
3966             if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3967               error ("address of global register variable %qD requested", x);
3968             else
3969               error ("address of register variable %qD requested", x);
3970             return false;
3971           }
3972
3973         /* drops in */
3974       case FUNCTION_DECL:
3975         TREE_ADDRESSABLE (x) = 1;
3976         /* drops out */
3977       default:
3978         return true;
3979     }
3980 }
3981 \f
3982 /* Convert EXPR to TYPE, warning about conversion problems with
3983    constants.  SEMANTIC_TYPE is the type this conversion would use
3984    without excess precision. If SEMANTIC_TYPE is NULL, this function
3985    is equivalent to convert_and_check. This function is a wrapper that
3986    handles conversions that may be different than
3987    the usual ones because of excess precision.  */
3988
3989 static tree
3990 ep_convert_and_check (tree type, tree expr, tree semantic_type)
3991 {
3992   if (TREE_TYPE (expr) == type)
3993     return expr;
3994
3995   if (!semantic_type)
3996     return convert_and_check (type, expr);
3997
3998   if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
3999       && TREE_TYPE (expr) != semantic_type)
4000     {
4001       /* For integers, we need to check the real conversion, not
4002          the conversion to the excess precision type.  */
4003       expr = convert_and_check (semantic_type, expr);
4004     }
4005   /* Result type is the excess precision type, which should be
4006      large enough, so do not check.  */
4007   return convert (type, expr);
4008 }
4009
4010 /* Build and return a conditional expression IFEXP ? OP1 : OP2.  If
4011    IFEXP_BCP then the condition is a call to __builtin_constant_p, and
4012    if folded to an integer constant then the unselected half may
4013    contain arbitrary operations not normally permitted in constant
4014    expressions.  Set the location of the expression to LOC.  */
4015
4016 tree
4017 build_conditional_expr (location_t colon_loc, tree ifexp, bool ifexp_bcp,
4018                         tree op1, tree op1_original_type, tree op2,
4019                         tree op2_original_type)
4020 {
4021   tree type1;
4022   tree type2;
4023   enum tree_code code1;
4024   enum tree_code code2;
4025   tree result_type = NULL;
4026   tree semantic_result_type = NULL;
4027   tree orig_op1 = op1, orig_op2 = op2;
4028   bool int_const, op1_int_operands, op2_int_operands, int_operands;
4029   bool ifexp_int_operands;
4030   tree ret;
4031
4032   op1_int_operands = EXPR_INT_CONST_OPERANDS (orig_op1);
4033   if (op1_int_operands)
4034     op1 = remove_c_maybe_const_expr (op1);
4035   op2_int_operands = EXPR_INT_CONST_OPERANDS (orig_op2);
4036   if (op2_int_operands)
4037     op2 = remove_c_maybe_const_expr (op2);
4038   ifexp_int_operands = EXPR_INT_CONST_OPERANDS (ifexp);
4039   if (ifexp_int_operands)
4040     ifexp = remove_c_maybe_const_expr (ifexp);
4041
4042   /* Promote both alternatives.  */
4043
4044   if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
4045     op1 = default_conversion (op1);
4046   if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
4047     op2 = default_conversion (op2);
4048
4049   if (TREE_CODE (ifexp) == ERROR_MARK
4050       || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
4051       || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
4052     return error_mark_node;
4053
4054   type1 = TREE_TYPE (op1);
4055   code1 = TREE_CODE (type1);
4056   type2 = TREE_TYPE (op2);
4057   code2 = TREE_CODE (type2);
4058
4059   /* C90 does not permit non-lvalue arrays in conditional expressions.
4060      In C99 they will be pointers by now.  */
4061   if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
4062     {
4063       error_at (colon_loc, "non-lvalue array in conditional expression");
4064       return error_mark_node;
4065     }
4066
4067   if ((TREE_CODE (op1) == EXCESS_PRECISION_EXPR
4068        || TREE_CODE (op2) == EXCESS_PRECISION_EXPR)
4069       && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4070           || code1 == COMPLEX_TYPE)
4071       && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
4072           || code2 == COMPLEX_TYPE))
4073     {
4074       semantic_result_type = c_common_type (type1, type2);
4075       if (TREE_CODE (op1) == EXCESS_PRECISION_EXPR)
4076         {
4077           op1 = TREE_OPERAND (op1, 0);
4078           type1 = TREE_TYPE (op1);
4079           gcc_assert (TREE_CODE (type1) == code1);
4080         }
4081       if (TREE_CODE (op2) == EXCESS_PRECISION_EXPR)
4082         {
4083           op2 = TREE_OPERAND (op2, 0);
4084           type2 = TREE_TYPE (op2);
4085           gcc_assert (TREE_CODE (type2) == code2);
4086         }
4087     }
4088
4089   if (warn_cxx_compat)
4090     {
4091       tree t1 = op1_original_type ? op1_original_type : TREE_TYPE (orig_op1);
4092       tree t2 = op2_original_type ? op2_original_type : TREE_TYPE (orig_op2);
4093
4094       if (TREE_CODE (t1) == ENUMERAL_TYPE
4095           && TREE_CODE (t2) == ENUMERAL_TYPE
4096           && TYPE_MAIN_VARIANT (t1) != TYPE_MAIN_VARIANT (t2))
4097         warning_at (colon_loc, OPT_Wc___compat,
4098                     ("different enum types in conditional is "
4099                      "invalid in C++: %qT vs %qT"),
4100                     t1, t2);
4101     }
4102
4103   /* Quickly detect the usual case where op1 and op2 have the same type
4104      after promotion.  */
4105   if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
4106     {
4107       if (type1 == type2)
4108         result_type = type1;
4109       else
4110         result_type = TYPE_MAIN_VARIANT (type1);
4111     }
4112   else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
4113             || code1 == COMPLEX_TYPE)
4114            && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
4115                || code2 == COMPLEX_TYPE))
4116     {
4117       result_type = c_common_type (type1, type2);
4118       do_warn_double_promotion (result_type, type1, type2,
4119                                 "implicit conversion from %qT to %qT to "
4120                                 "match other result of conditional",
4121                                 colon_loc);
4122
4123       /* If -Wsign-compare, warn here if type1 and type2 have
4124          different signedness.  We'll promote the signed to unsigned
4125          and later code won't know it used to be different.
4126          Do this check on the original types, so that explicit casts
4127          will be considered, but default promotions won't.  */
4128       if (c_inhibit_evaluation_warnings == 0)
4129         {
4130           int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
4131           int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
4132
4133           if (unsigned_op1 ^ unsigned_op2)
4134             {
4135               bool ovf;
4136
4137               /* Do not warn if the result type is signed, since the
4138                  signed type will only be chosen if it can represent
4139                  all the values of the unsigned type.  */
4140               if (!TYPE_UNSIGNED (result_type))
4141                 /* OK */;
4142               else
4143                 {
4144                   bool op1_maybe_const = true;
4145                   bool op2_maybe_const = true;
4146
4147                   /* Do not warn if the signed quantity is an
4148                      unsuffixed integer literal (or some static
4149                      constant expression involving such literals) and
4150                      it is non-negative.  This warning requires the
4151                      operands to be folded for best results, so do
4152                      that folding in this case even without
4153                      warn_sign_compare to avoid warning options
4154                      possibly affecting code generation.  */
4155                   c_inhibit_evaluation_warnings
4156                     += (ifexp == truthvalue_false_node);
4157                   op1 = c_fully_fold (op1, require_constant_value,
4158                                       &op1_maybe_const);
4159                   c_inhibit_evaluation_warnings
4160                     -= (ifexp == truthvalue_false_node);
4161
4162                   c_inhibit_evaluation_warnings
4163                     += (ifexp == truthvalue_true_node);
4164                   op2 = c_fully_fold (op2, require_constant_value,
4165                                       &op2_maybe_const);
4166                   c_inhibit_evaluation_warnings
4167                     -= (ifexp == truthvalue_true_node);
4168
4169                   if (warn_sign_compare)
4170                     {
4171                       if ((unsigned_op2
4172                            && tree_expr_nonnegative_warnv_p (op1, &ovf))
4173                           || (unsigned_op1
4174                               && tree_expr_nonnegative_warnv_p (op2, &ovf)))
4175                         /* OK */;
4176                       else
4177                         warning_at (colon_loc, OPT_Wsign_compare,
4178                                     ("signed and unsigned type in "
4179                                      "conditional expression"));
4180                     }
4181                   if (!op1_maybe_const || TREE_CODE (op1) != INTEGER_CST)
4182                     op1 = c_wrap_maybe_const (op1, !op1_maybe_const);
4183                   if (!op2_maybe_const || TREE_CODE (op2) != INTEGER_CST)
4184                     op2 = c_wrap_maybe_const (op2, !op2_maybe_const);
4185                 }
4186             }
4187         }
4188     }
4189   else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
4190     {
4191       if (code1 != VOID_TYPE || code2 != VOID_TYPE)
4192         pedwarn (colon_loc, OPT_pedantic,
4193                  "ISO C forbids conditional expr with only one void side");
4194       result_type = void_type_node;
4195     }
4196   else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
4197     {
4198       addr_space_t as1 = TYPE_ADDR_SPACE (TREE_TYPE (type1));
4199       addr_space_t as2 = TYPE_ADDR_SPACE (TREE_TYPE (type2));
4200       addr_space_t as_common;
4201
4202       if (comp_target_types (colon_loc, type1, type2))
4203         result_type = common_pointer_type (type1, type2);
4204       else if (null_pointer_constant_p (orig_op1))
4205         result_type = type2;
4206       else if (null_pointer_constant_p (orig_op2))
4207         result_type = type1;
4208       else if (!addr_space_superset (as1, as2, &as_common))
4209         {
4210           error_at (colon_loc, "pointers to disjoint address spaces "
4211                     "used in conditional expression");
4212           return error_mark_node;
4213         }
4214       else if (VOID_TYPE_P (TREE_TYPE (type1)))
4215         {
4216           if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
4217             pedwarn (colon_loc, OPT_pedantic,
4218                      "ISO C forbids conditional expr between "
4219                      "%<void *%> and function pointer");
4220           result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
4221                                                           TREE_TYPE (type2)));
4222         }
4223       else if (VOID_TYPE_P (TREE_TYPE (type2)))
4224         {
4225           if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
4226             pedwarn (colon_loc, OPT_pedantic,
4227                      "ISO C forbids conditional expr between "
4228                      "%<void *%> and function pointer");
4229           result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
4230                                                           TREE_TYPE (type1)));
4231         }
4232       /* Objective-C pointer comparisons are a bit more lenient.  */
4233       else if (objc_have_common_type (type1, type2, -3, NULL_TREE))
4234         result_type = objc_common_type (type1, type2);
4235       else
4236         {
4237           int qual = ENCODE_QUAL_ADDR_SPACE (as_common);
4238
4239           pedwarn (colon_loc, 0,
4240                    "pointer type mismatch in conditional expression");
4241           result_type = build_pointer_type
4242                           (build_qualified_type (void_type_node, qual));
4243         }
4244     }
4245   else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
4246     {
4247       if (!null_pointer_constant_p (orig_op2))
4248         pedwarn (colon_loc, 0,
4249                  "pointer/integer type mismatch in conditional expression");
4250       else
4251         {
4252           op2 = null_pointer_node;
4253         }
4254       result_type = type1;
4255     }
4256   else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
4257     {
4258       if (!null_pointer_constant_p (orig_op1))
4259         pedwarn (colon_loc, 0,
4260                  "pointer/integer type mismatch in conditional expression");
4261       else
4262         {
4263           op1 = null_pointer_node;
4264         }
4265       result_type = type2;
4266     }
4267
4268   if (!result_type)
4269     {
4270       if (flag_cond_mismatch)
4271         result_type = void_type_node;
4272       else
4273         {
4274           error_at (colon_loc, "type mismatch in conditional expression");
4275           return error_mark_node;
4276         }
4277     }
4278
4279   /* Merge const and volatile flags of the incoming types.  */
4280   result_type
4281     = build_type_variant (result_type,
4282                           TYPE_READONLY (type1) || TYPE_READONLY (type2),
4283                           TYPE_VOLATILE (type1) || TYPE_VOLATILE (type2));
4284
4285   op1 = ep_convert_and_check (result_type, op1, semantic_result_type);
4286   op2 = ep_convert_and_check (result_type, op2, semantic_result_type);
4287
4288   if (ifexp_bcp && ifexp == truthvalue_true_node)
4289     {
4290       op2_int_operands = true;
4291       op1 = c_fully_fold (op1, require_constant_value, NULL);
4292     }
4293   if (ifexp_bcp && ifexp == truthvalue_false_node)
4294     {
4295       op1_int_operands = true;
4296       op2 = c_fully_fold (op2, require_constant_value, NULL);
4297     }
4298   int_const = int_operands = (ifexp_int_operands
4299                               && op1_int_operands
4300                               && op2_int_operands);
4301   if (int_operands)
4302     {
4303       int_const = ((ifexp == truthvalue_true_node
4304                     && TREE_CODE (orig_op1) == INTEGER_CST
4305                     && !TREE_OVERFLOW (orig_op1))
4306                    || (ifexp == truthvalue_false_node
4307                        && TREE_CODE (orig_op2) == INTEGER_CST
4308                        && !TREE_OVERFLOW (orig_op2)));
4309     }
4310   if (int_const || (ifexp_bcp && TREE_CODE (ifexp) == INTEGER_CST))
4311     ret = fold_build3_loc (colon_loc, COND_EXPR, result_type, ifexp, op1, op2);
4312   else
4313     {
4314       ret = build3 (COND_EXPR, result_type, ifexp, op1, op2);
4315       if (int_operands)
4316         ret = note_integer_operands (ret);
4317     }
4318   if (semantic_result_type)
4319     ret = build1 (EXCESS_PRECISION_EXPR, semantic_result_type, ret);
4320
4321   protected_set_expr_location (ret, colon_loc);
4322   return ret;
4323 }
4324 \f
4325 /* Return a compound expression that performs two expressions and
4326    returns the value of the second of them.
4327
4328    LOC is the location of the COMPOUND_EXPR.  */
4329
4330 tree
4331 build_compound_expr (location_t loc, tree expr1, tree expr2)
4332 {
4333   bool expr1_int_operands, expr2_int_operands;
4334   tree eptype = NULL_TREE;
4335   tree ret;
4336
4337   expr1_int_operands = EXPR_INT_CONST_OPERANDS (expr1);
4338   if (expr1_int_operands)
4339     expr1 = remove_c_maybe_const_expr (expr1);
4340   expr2_int_operands = EXPR_INT_CONST_OPERANDS (expr2);
4341   if (expr2_int_operands)
4342     expr2 = remove_c_maybe_const_expr (expr2);
4343
4344   if (TREE_CODE (expr1) == EXCESS_PRECISION_EXPR)
4345     expr1 = TREE_OPERAND (expr1, 0);
4346   if (TREE_CODE (expr2) == EXCESS_PRECISION_EXPR)
4347     {
4348       eptype = TREE_TYPE (expr2);
4349       expr2 = TREE_OPERAND (expr2, 0);
4350     }
4351
4352   if (!TREE_SIDE_EFFECTS (expr1))
4353     {
4354       /* The left-hand operand of a comma expression is like an expression
4355          statement: with -Wunused, we should warn if it doesn't have
4356          any side-effects, unless it was explicitly cast to (void).  */
4357       if (warn_unused_value)
4358         {
4359           if (VOID_TYPE_P (TREE_TYPE (expr1))
4360               && CONVERT_EXPR_P (expr1))
4361             ; /* (void) a, b */
4362           else if (VOID_TYPE_P (TREE_TYPE (expr1))
4363                    && TREE_CODE (expr1) == COMPOUND_EXPR
4364                    && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
4365             ; /* (void) a, (void) b, c */
4366           else
4367             warning_at (loc, OPT_Wunused_value,
4368                         "left-hand operand of comma expression has no effect");
4369         }
4370     }
4371
4372   /* With -Wunused, we should also warn if the left-hand operand does have
4373      side-effects, but computes a value which is not used.  For example, in
4374      `foo() + bar(), baz()' the result of the `+' operator is not used,
4375      so we should issue a warning.  */
4376   else if (warn_unused_value)
4377     warn_if_unused_value (expr1, loc);
4378
4379   if (expr2 == error_mark_node)
4380     return error_mark_node;
4381
4382   ret = build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
4383
4384   if (flag_isoc99
4385       && expr1_int_operands
4386       && expr2_int_operands)
4387     ret = note_integer_operands (ret);
4388
4389   if (eptype)
4390     ret = build1 (EXCESS_PRECISION_EXPR, eptype, ret);
4391
4392   protected_set_expr_location (ret, loc);
4393   return ret;
4394 }
4395
4396 /* Issue -Wcast-qual warnings when appropriate.  TYPE is the type to
4397    which we are casting.  OTYPE is the type of the expression being
4398    cast.  Both TYPE and OTYPE are pointer types.  LOC is the location
4399    of the cast.  -Wcast-qual appeared on the command line.  Named
4400    address space qualifiers are not handled here, because they result
4401    in different warnings.  */
4402
4403 static void
4404 handle_warn_cast_qual (location_t loc, tree type, tree otype)
4405 {
4406   tree in_type = type;
4407   tree in_otype = otype;
4408   int added = 0;
4409   int discarded = 0;
4410   bool is_const;
4411
4412   /* Check that the qualifiers on IN_TYPE are a superset of the
4413      qualifiers of IN_OTYPE.  The outermost level of POINTER_TYPE
4414      nodes is uninteresting and we stop as soon as we hit a
4415      non-POINTER_TYPE node on either type.  */
4416   do
4417     {
4418       in_otype = TREE_TYPE (in_otype);
4419       in_type = TREE_TYPE (in_type);
4420
4421       /* GNU C allows cv-qualified function types.  'const' means the
4422          function is very pure, 'volatile' means it can't return.  We
4423          need to warn when such qualifiers are added, not when they're
4424          taken away.  */
4425       if (TREE_CODE (in_otype) == FUNCTION_TYPE
4426           && TREE_CODE (in_type) == FUNCTION_TYPE)
4427         added |= (TYPE_QUALS_NO_ADDR_SPACE (in_type)
4428                   & ~TYPE_QUALS_NO_ADDR_SPACE (in_otype));
4429       else
4430         discarded |= (TYPE_QUALS_NO_ADDR_SPACE (in_otype)
4431                       & ~TYPE_QUALS_NO_ADDR_SPACE (in_type));
4432     }
4433   while (TREE_CODE (in_type) == POINTER_TYPE
4434          && TREE_CODE (in_otype) == POINTER_TYPE);
4435
4436   if (added)
4437     warning_at (loc, OPT_Wcast_qual,
4438                 "cast adds %q#v qualifier to function type", added);
4439
4440   if (discarded)
4441     /* There are qualifiers present in IN_OTYPE that are not present
4442        in IN_TYPE.  */
4443     warning_at (loc, OPT_Wcast_qual,
4444                 "cast discards %q#v qualifier from pointer target type",
4445                 discarded);
4446
4447   if (added || discarded)
4448     return;
4449
4450   /* A cast from **T to const **T is unsafe, because it can cause a
4451      const value to be changed with no additional warning.  We only
4452      issue this warning if T is the same on both sides, and we only
4453      issue the warning if there are the same number of pointers on
4454      both sides, as otherwise the cast is clearly unsafe anyhow.  A
4455      cast is unsafe when a qualifier is added at one level and const
4456      is not present at all outer levels.
4457
4458      To issue this warning, we check at each level whether the cast
4459      adds new qualifiers not already seen.  We don't need to special
4460      case function types, as they won't have the same
4461      TYPE_MAIN_VARIANT.  */
4462
4463   if (TYPE_MAIN_VARIANT (in_type) != TYPE_MAIN_VARIANT (in_otype))
4464     return;
4465   if (TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE)
4466     return;
4467
4468   in_type = type;
4469   in_otype = otype;
4470   is_const = TYPE_READONLY (TREE_TYPE (in_type));
4471   do
4472     {
4473       in_type = TREE_TYPE (in_type);
4474       in_otype = TREE_TYPE (in_otype);
4475       if ((TYPE_QUALS (in_type) &~ TYPE_QUALS (in_otype)) != 0
4476           && !is_const)
4477         {
4478           warning_at (loc, OPT_Wcast_qual,
4479                       "to be safe all intermediate pointers in cast from "
4480                       "%qT to %qT must be %<const%> qualified",
4481                       otype, type);
4482           break;
4483         }
4484       if (is_const)
4485         is_const = TYPE_READONLY (in_type);
4486     }
4487   while (TREE_CODE (in_type) == POINTER_TYPE);
4488 }
4489
4490 /* Build an expression representing a cast to type TYPE of expression EXPR.
4491    LOC is the location of the cast-- typically the open paren of the cast.  */
4492
4493 tree
4494 build_c_cast (location_t loc, tree type, tree expr)
4495 {
4496   tree value;
4497
4498   if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
4499     expr = TREE_OPERAND (expr, 0);
4500
4501   value = expr;
4502
4503   if (type == error_mark_node || expr == error_mark_node)
4504     return error_mark_node;
4505
4506   /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
4507      only in <protocol> qualifications.  But when constructing cast expressions,
4508      the protocols do matter and must be kept around.  */
4509   if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
4510     return build1 (NOP_EXPR, type, expr);
4511
4512   type = TYPE_MAIN_VARIANT (type);
4513
4514   if (TREE_CODE (type) == ARRAY_TYPE)
4515     {
4516       error_at (loc, "cast specifies array type");
4517       return error_mark_node;
4518     }
4519
4520   if (TREE_CODE (type) == FUNCTION_TYPE)
4521     {
4522       error_at (loc, "cast specifies function type");
4523       return error_mark_node;
4524     }
4525
4526   if (!VOID_TYPE_P (type))
4527     {
4528       value = require_complete_type (value);
4529       if (value == error_mark_node)
4530         return error_mark_node;
4531     }
4532
4533   if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
4534     {
4535       if (TREE_CODE (type) == RECORD_TYPE
4536           || TREE_CODE (type) == UNION_TYPE)
4537         pedwarn (loc, OPT_pedantic,
4538                  "ISO C forbids casting nonscalar to the same type");
4539     }
4540   else if (TREE_CODE (type) == UNION_TYPE)
4541     {
4542       tree field;
4543
4544       for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
4545         if (TREE_TYPE (field) != error_mark_node
4546             && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
4547                           TYPE_MAIN_VARIANT (TREE_TYPE (value))))
4548           break;
4549
4550       if (field)
4551         {
4552           tree t;
4553           bool maybe_const = true;
4554
4555           pedwarn (loc, OPT_pedantic, "ISO C forbids casts to union type");
4556           t = c_fully_fold (value, false, &maybe_const);
4557           t = build_constructor_single (type, field, t);
4558           if (!maybe_const)
4559             t = c_wrap_maybe_const (t, true);
4560           t = digest_init (loc, type, t,
4561                            NULL_TREE, false, true, 0);
4562           TREE_CONSTANT (t) = TREE_CONSTANT (value);
4563           return t;
4564         }
4565       error_at (loc, "cast to union type from type not present in union");
4566       return error_mark_node;
4567     }
4568   else
4569     {
4570       tree otype, ovalue;
4571
4572       if (type == void_type_node)
4573         {
4574           tree t = build1 (CONVERT_EXPR, type, value);
4575           SET_EXPR_LOCATION (t, loc);
4576           return t;
4577         }
4578
4579       otype = TREE_TYPE (value);
4580
4581       /* Optionally warn about potentially worrisome casts.  */
4582       if (warn_cast_qual
4583           && TREE_CODE (type) == POINTER_TYPE
4584           && TREE_CODE (otype) == POINTER_TYPE)
4585         handle_warn_cast_qual (loc, type, otype);
4586
4587       /* Warn about conversions between pointers to disjoint
4588          address spaces.  */
4589       if (TREE_CODE (type) == POINTER_TYPE
4590           && TREE_CODE (otype) == POINTER_TYPE
4591           && !null_pointer_constant_p (value))
4592         {
4593           addr_space_t as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
4594           addr_space_t as_from = TYPE_ADDR_SPACE (TREE_TYPE (otype));
4595           addr_space_t as_common;
4596
4597           if (!addr_space_superset (as_to, as_from, &as_common))
4598             {
4599               if (ADDR_SPACE_GENERIC_P (as_from))
4600                 warning_at (loc, 0, "cast to %s address space pointer "
4601                             "from disjoint generic address space pointer",
4602                             c_addr_space_name (as_to));
4603
4604               else if (ADDR_SPACE_GENERIC_P (as_to))
4605                 warning_at (loc, 0, "cast to generic address space pointer "
4606                             "from disjoint %s address space pointer",
4607                             c_addr_space_name (as_from));
4608
4609               else
4610                 warning_at (loc, 0, "cast to %s address space pointer "
4611                             "from disjoint %s address space pointer",
4612                             c_addr_space_name (as_to),
4613                             c_addr_space_name (as_from));
4614             }
4615         }
4616
4617       /* Warn about possible alignment problems.  */
4618       if (STRICT_ALIGNMENT
4619           && TREE_CODE (type) == POINTER_TYPE
4620           && TREE_CODE (otype) == POINTER_TYPE
4621           && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
4622           && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
4623           /* Don't warn about opaque types, where the actual alignment
4624              restriction is unknown.  */
4625           && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
4626                 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
4627                && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
4628           && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
4629         warning_at (loc, OPT_Wcast_align,
4630                     "cast increases required alignment of target type");
4631
4632       if (TREE_CODE (type) == INTEGER_TYPE
4633           && TREE_CODE (otype) == POINTER_TYPE
4634           && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
4635       /* Unlike conversion of integers to pointers, where the
4636          warning is disabled for converting constants because
4637          of cases such as SIG_*, warn about converting constant
4638          pointers to integers. In some cases it may cause unwanted
4639          sign extension, and a warning is appropriate.  */
4640         warning_at (loc, OPT_Wpointer_to_int_cast,
4641                     "cast from pointer to integer of different size");
4642
4643       if (TREE_CODE (value) == CALL_EXPR
4644           && TREE_CODE (type) != TREE_CODE (otype))
4645         warning_at (loc, OPT_Wbad_function_cast,
4646                     "cast from function call of type %qT "
4647                     "to non-matching type %qT", otype, type);
4648
4649       if (TREE_CODE (type) == POINTER_TYPE
4650           && TREE_CODE (otype) == INTEGER_TYPE
4651           && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
4652           /* Don't warn about converting any constant.  */
4653           && !TREE_CONSTANT (value))
4654         warning_at (loc,
4655                     OPT_Wint_to_pointer_cast, "cast to pointer from integer "
4656                     "of different size");
4657
4658       if (warn_strict_aliasing <= 2)
4659         strict_aliasing_warning (otype, type, expr);
4660
4661       /* If pedantic, warn for conversions between function and object
4662          pointer types, except for converting a null pointer constant
4663          to function pointer type.  */
4664       if (pedantic
4665           && TREE_CODE (type) == POINTER_TYPE
4666           && TREE_CODE (otype) == POINTER_TYPE
4667           && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
4668           && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
4669         pedwarn (loc, OPT_pedantic, "ISO C forbids "
4670                  "conversion of function pointer to object pointer type");
4671
4672       if (pedantic
4673           && TREE_CODE (type) == POINTER_TYPE
4674           && TREE_CODE (otype) == POINTER_TYPE
4675           && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
4676           && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
4677           && !null_pointer_constant_p (value))
4678         pedwarn (loc, OPT_pedantic, "ISO C forbids "
4679                  "conversion of object pointer to function pointer type");
4680
4681       ovalue = value;
4682       value = convert (type, value);
4683
4684       /* Ignore any integer overflow caused by the cast.  */
4685       if (TREE_CODE (value) == INTEGER_CST && !FLOAT_TYPE_P (otype))
4686         {
4687           if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
4688             {
4689               if (!TREE_OVERFLOW (value))
4690                 {
4691                   /* Avoid clobbering a shared constant.  */
4692                   value = copy_node (value);
4693                   TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
4694                 }
4695             }
4696           else if (TREE_OVERFLOW (value))
4697             /* Reset VALUE's overflow flags, ensuring constant sharing.  */
4698             value = build_int_cst_wide (TREE_TYPE (value),
4699                                         TREE_INT_CST_LOW (value),
4700                                         TREE_INT_CST_HIGH (value));
4701         }
4702     }
4703
4704   /* Don't let a cast be an lvalue.  */
4705   if (value == expr)
4706     value = non_lvalue_loc (loc, value);
4707
4708   /* Don't allow the results of casting to floating-point or complex
4709      types be confused with actual constants, or casts involving
4710      integer and pointer types other than direct integer-to-integer
4711      and integer-to-pointer be confused with integer constant
4712      expressions and null pointer constants.  */
4713   if (TREE_CODE (value) == REAL_CST
4714       || TREE_CODE (value) == COMPLEX_CST
4715       || (TREE_CODE (value) == INTEGER_CST
4716           && !((TREE_CODE (expr) == INTEGER_CST
4717                 && INTEGRAL_TYPE_P (TREE_TYPE (expr)))
4718                || TREE_CODE (expr) == REAL_CST
4719                || TREE_CODE (expr) == COMPLEX_CST)))
4720       value = build1 (NOP_EXPR, type, value);
4721
4722   if (CAN_HAVE_LOCATION_P (value))
4723     SET_EXPR_LOCATION (value, loc);
4724   return value;
4725 }
4726
4727 /* Interpret a cast of expression EXPR to type TYPE.  LOC is the
4728    location of the open paren of the cast, or the position of the cast
4729    expr.  */
4730 tree
4731 c_cast_expr (location_t loc, struct c_type_name *type_name, tree expr)
4732 {
4733   tree type;
4734   tree type_expr = NULL_TREE;
4735   bool type_expr_const = true;
4736   tree ret;
4737   int saved_wsp = warn_strict_prototypes;
4738
4739   /* This avoids warnings about unprototyped casts on
4740      integers.  E.g. "#define SIG_DFL (void(*)())0".  */
4741   if (TREE_CODE (expr) == INTEGER_CST)
4742     warn_strict_prototypes = 0;
4743   type = groktypename (type_name, &type_expr, &type_expr_const);
4744   warn_strict_prototypes = saved_wsp;
4745
4746   ret = build_c_cast (loc, type, expr);
4747   if (type_expr)
4748     {
4749       ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret), type_expr, ret);
4750       C_MAYBE_CONST_EXPR_NON_CONST (ret) = !type_expr_const;
4751       SET_EXPR_LOCATION (ret, loc);
4752     }
4753
4754   if (CAN_HAVE_LOCATION_P (ret) && !EXPR_HAS_LOCATION (ret))
4755     SET_EXPR_LOCATION (ret, loc);
4756
4757   /* C++ does not permits types to be defined in a cast, but it
4758      allows references to incomplete types.  */
4759   if (warn_cxx_compat && type_name->specs->typespec_kind == ctsk_tagdef)
4760     warning_at (loc, OPT_Wc___compat,
4761                 "defining a type in a cast is invalid in C++");
4762
4763   return ret;
4764 }
4765 \f
4766 /* Build an assignment expression of lvalue LHS from value RHS.
4767    If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
4768    may differ from TREE_TYPE (LHS) for an enum bitfield.
4769    MODIFYCODE is the code for a binary operator that we use
4770    to combine the old value of LHS with RHS to get the new value.
4771    Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4772    If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
4773    which may differ from TREE_TYPE (RHS) for an enum value.
4774
4775    LOCATION is the location of the MODIFYCODE operator.
4776    RHS_LOC is the location of the RHS.  */
4777
4778 tree
4779 build_modify_expr (location_t location, tree lhs, tree lhs_origtype,
4780                    enum tree_code modifycode,
4781                    location_t rhs_loc, tree rhs, tree rhs_origtype)
4782 {
4783   tree result;
4784   tree newrhs;
4785   tree rhs_semantic_type = NULL_TREE;
4786   tree lhstype = TREE_TYPE (lhs);
4787   tree olhstype = lhstype;
4788   bool npc;
4789
4790   /* Types that aren't fully specified cannot be used in assignments.  */
4791   lhs = require_complete_type (lhs);
4792
4793   /* Avoid duplicate error messages from operands that had errors.  */
4794   if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
4795     return error_mark_node;
4796
4797   /* For ObjC properties, defer this check.  */
4798   if (!objc_is_property_ref (lhs) && !lvalue_or_else (location, lhs, lv_assign))
4799     return error_mark_node;
4800
4801   if (TREE_CODE (rhs) == EXCESS_PRECISION_EXPR)
4802     {
4803       rhs_semantic_type = TREE_TYPE (rhs);
4804       rhs = TREE_OPERAND (rhs, 0);
4805     }
4806
4807   newrhs = rhs;
4808
4809   if (TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
4810     {
4811       tree inner = build_modify_expr (location, C_MAYBE_CONST_EXPR_EXPR (lhs),
4812                                       lhs_origtype, modifycode, rhs_loc, rhs,
4813                                       rhs_origtype);
4814       if (inner == error_mark_node)
4815         return error_mark_node;
4816       result = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
4817                        C_MAYBE_CONST_EXPR_PRE (lhs), inner);
4818       gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (lhs));
4819       C_MAYBE_CONST_EXPR_NON_CONST (result) = 1;
4820       protected_set_expr_location (result, location);
4821       return result;
4822     }
4823
4824   /* If a binary op has been requested, combine the old LHS value with the RHS
4825      producing the value we should actually store into the LHS.  */
4826
4827   if (modifycode != NOP_EXPR)
4828     {
4829       lhs = c_fully_fold (lhs, false, NULL);
4830       lhs = stabilize_reference (lhs);
4831       newrhs = build_binary_op (location,
4832                                 modifycode, lhs, rhs, 1);
4833
4834       /* The original type of the right hand side is no longer
4835          meaningful.  */
4836       rhs_origtype = NULL_TREE;
4837     }
4838
4839   if (c_dialect_objc ())
4840     {
4841       /* Check if we are modifying an Objective-C property reference;
4842          if so, we need to generate setter calls.  */
4843       result = objc_maybe_build_modify_expr (lhs, newrhs);
4844       if (result)
4845         return result;
4846
4847       /* Else, do the check that we postponed for Objective-C.  */
4848       if (!lvalue_or_else (location, lhs, lv_assign))
4849         return error_mark_node;
4850     }
4851
4852   /* Give an error for storing in something that is 'const'.  */
4853
4854   if (TYPE_READONLY (lhstype)
4855       || ((TREE_CODE (lhstype) == RECORD_TYPE
4856            || TREE_CODE (lhstype) == UNION_TYPE)
4857           && C_TYPE_FIELDS_READONLY (lhstype)))
4858     {
4859       readonly_error (lhs, lv_assign);
4860       return error_mark_node;
4861     }
4862   else if (TREE_READONLY (lhs))
4863     readonly_warning (lhs, lv_assign);
4864
4865   /* If storing into a structure or union member,
4866      it has probably been given type `int'.
4867      Compute the type that would go with
4868      the actual amount of storage the member occupies.  */
4869
4870   if (TREE_CODE (lhs) == COMPONENT_REF
4871       && (TREE_CODE (lhstype) == INTEGER_TYPE
4872           || TREE_CODE (lhstype) == BOOLEAN_TYPE
4873           || TREE_CODE (lhstype) == REAL_TYPE
4874           || TREE_CODE (lhstype) == ENUMERAL_TYPE))
4875     lhstype = TREE_TYPE (get_unwidened (lhs, 0));
4876
4877   /* If storing in a field that is in actuality a short or narrower than one,
4878      we must store in the field in its actual type.  */
4879
4880   if (lhstype != TREE_TYPE (lhs))
4881     {
4882       lhs = copy_node (lhs);
4883       TREE_TYPE (lhs) = lhstype;
4884     }
4885
4886   /* Issue -Wc++-compat warnings about an assignment to an enum type
4887      when LHS does not have its original type.  This happens for,
4888      e.g., an enum bitfield in a struct.  */
4889   if (warn_cxx_compat
4890       && lhs_origtype != NULL_TREE
4891       && lhs_origtype != lhstype
4892       && TREE_CODE (lhs_origtype) == ENUMERAL_TYPE)
4893     {
4894       tree checktype = (rhs_origtype != NULL_TREE
4895                         ? rhs_origtype
4896                         : TREE_TYPE (rhs));
4897       if (checktype != error_mark_node
4898           && TYPE_MAIN_VARIANT (checktype) != TYPE_MAIN_VARIANT (lhs_origtype))
4899         warning_at (location, OPT_Wc___compat,
4900                     "enum conversion in assignment is invalid in C++");
4901     }
4902
4903   /* Convert new value to destination type.  Fold it first, then
4904      restore any excess precision information, for the sake of
4905      conversion warnings.  */
4906
4907   npc = null_pointer_constant_p (newrhs);
4908   newrhs = c_fully_fold (newrhs, false, NULL);
4909   if (rhs_semantic_type)
4910     newrhs = build1 (EXCESS_PRECISION_EXPR, rhs_semantic_type, newrhs);
4911   newrhs = convert_for_assignment (location, lhstype, newrhs, rhs_origtype,
4912                                    ic_assign, npc, NULL_TREE, NULL_TREE, 0);
4913   if (TREE_CODE (newrhs) == ERROR_MARK)
4914     return error_mark_node;
4915
4916   /* Emit ObjC write barrier, if necessary.  */
4917   if (c_dialect_objc () && flag_objc_gc)
4918     {
4919       result = objc_generate_write_barrier (lhs, modifycode, newrhs);
4920       if (result)
4921         {
4922           protected_set_expr_location (result, location);
4923           return result;
4924         }
4925     }
4926
4927   /* Scan operands.  */
4928
4929   result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
4930   TREE_SIDE_EFFECTS (result) = 1;
4931   protected_set_expr_location (result, location);
4932
4933   /* If we got the LHS in a different type for storing in,
4934      convert the result back to the nominal type of LHS
4935      so that the value we return always has the same type
4936      as the LHS argument.  */
4937
4938   if (olhstype == TREE_TYPE (result))
4939     return result;
4940
4941   result = convert_for_assignment (location, olhstype, result, rhs_origtype,
4942                                    ic_assign, false, NULL_TREE, NULL_TREE, 0);
4943   protected_set_expr_location (result, location);
4944   return result;
4945 }
4946 \f
4947 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
4948    This is used to implement -fplan9-extensions.  */
4949
4950 static bool
4951 find_anonymous_field_with_type (tree struct_type, tree type)
4952 {
4953   tree field;
4954   bool found;
4955
4956   gcc_assert (TREE_CODE (struct_type) == RECORD_TYPE
4957               || TREE_CODE (struct_type) == UNION_TYPE);
4958   found = false;
4959   for (field = TYPE_FIELDS (struct_type);
4960        field != NULL_TREE;
4961        field = TREE_CHAIN (field))
4962     {
4963       if (DECL_NAME (field) == NULL
4964           && comptypes (type, TYPE_MAIN_VARIANT (TREE_TYPE (field))))
4965         {
4966           if (found)
4967             return false;
4968           found = true;
4969         }
4970       else if (DECL_NAME (field) == NULL
4971                && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
4972                    || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
4973                && find_anonymous_field_with_type (TREE_TYPE (field), type))
4974         {
4975           if (found)
4976             return false;
4977           found = true;
4978         }
4979     }
4980   return found;
4981 }
4982
4983 /* RHS is an expression whose type is pointer to struct.  If there is
4984    an anonymous field in RHS with type TYPE, then return a pointer to
4985    that field in RHS.  This is used with -fplan9-extensions.  This
4986    returns NULL if no conversion could be found.  */
4987
4988 static tree
4989 convert_to_anonymous_field (location_t location, tree type, tree rhs)
4990 {
4991   tree rhs_struct_type, lhs_main_type;
4992   tree field, found_field;
4993   bool found_sub_field;
4994   tree ret;
4995
4996   gcc_assert (POINTER_TYPE_P (TREE_TYPE (rhs)));
4997   rhs_struct_type = TREE_TYPE (TREE_TYPE (rhs));
4998   gcc_assert (TREE_CODE (rhs_struct_type) == RECORD_TYPE
4999               || TREE_CODE (rhs_struct_type) == UNION_TYPE);
5000
5001   gcc_assert (POINTER_TYPE_P (type));
5002   lhs_main_type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
5003
5004   found_field = NULL_TREE;
5005   found_sub_field = false;
5006   for (field = TYPE_FIELDS (rhs_struct_type);
5007        field != NULL_TREE;
5008        field = TREE_CHAIN (field))
5009     {
5010       if (DECL_NAME (field) != NULL_TREE
5011           || (TREE_CODE (TREE_TYPE (field)) != RECORD_TYPE
5012               && TREE_CODE (TREE_TYPE (field)) != UNION_TYPE))
5013         continue;
5014       if (comptypes (lhs_main_type, TYPE_MAIN_VARIANT (TREE_TYPE (field))))
5015         {
5016           if (found_field != NULL_TREE)
5017             return NULL_TREE;
5018           found_field = field;
5019         }
5020       else if (find_anonymous_field_with_type (TREE_TYPE (field),
5021                                                lhs_main_type))
5022         {
5023           if (found_field != NULL_TREE)
5024             return NULL_TREE;
5025           found_field = field;
5026           found_sub_field = true;
5027         }
5028     }
5029
5030   if (found_field == NULL_TREE)
5031     return NULL_TREE;
5032
5033   ret = fold_build3_loc (location, COMPONENT_REF, TREE_TYPE (found_field),
5034                          build_fold_indirect_ref (rhs), found_field,
5035                          NULL_TREE);
5036   ret = build_fold_addr_expr_loc (location, ret);
5037
5038   if (found_sub_field)
5039     {
5040       ret = convert_to_anonymous_field (location, type, ret);
5041       gcc_assert (ret != NULL_TREE);
5042     }
5043
5044   return ret;
5045 }
5046
5047 /* Convert value RHS to type TYPE as preparation for an assignment to
5048    an lvalue of type TYPE.  If ORIGTYPE is not NULL_TREE, it is the
5049    original type of RHS; this differs from TREE_TYPE (RHS) for enum
5050    types.  NULL_POINTER_CONSTANT says whether RHS was a null pointer
5051    constant before any folding.
5052    The real work of conversion is done by `convert'.
5053    The purpose of this function is to generate error messages
5054    for assignments that are not allowed in C.
5055    ERRTYPE says whether it is argument passing, assignment,
5056    initialization or return.
5057
5058    LOCATION is the location of the RHS.
5059    FUNCTION is a tree for the function being called.
5060    PARMNUM is the number of the argument, for printing in error messages.  */
5061
5062 static tree
5063 convert_for_assignment (location_t location, tree type, tree rhs,
5064                         tree origtype, enum impl_conv errtype,
5065                         bool null_pointer_constant, tree fundecl,
5066                         tree function, int parmnum)
5067 {
5068   enum tree_code codel = TREE_CODE (type);
5069   tree orig_rhs = rhs;
5070   tree rhstype;
5071   enum tree_code coder;
5072   tree rname = NULL_TREE;
5073   bool objc_ok = false;
5074
5075   if (errtype == ic_argpass)
5076     {
5077       tree selector;
5078       /* Change pointer to function to the function itself for
5079          diagnostics.  */
5080       if (TREE_CODE (function) == ADDR_EXPR
5081           && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
5082         function = TREE_OPERAND (function, 0);
5083
5084       /* Handle an ObjC selector specially for diagnostics.  */
5085       selector = objc_message_selector ();
5086       rname = function;
5087       if (selector && parmnum > 2)
5088         {
5089           rname = selector;
5090           parmnum -= 2;
5091         }
5092     }
5093
5094   /* This macro is used to emit diagnostics to ensure that all format
5095      strings are complete sentences, visible to gettext and checked at
5096      compile time.  */
5097 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE)               \
5098   do {                                                                   \
5099     switch (errtype)                                                     \
5100       {                                                                  \
5101       case ic_argpass:                                                   \
5102         if (pedwarn (LOCATION, OPT, AR, parmnum, rname))                 \
5103           inform ((fundecl && !DECL_IS_BUILTIN (fundecl))                \
5104                   ? DECL_SOURCE_LOCATION (fundecl) : LOCATION,           \
5105                   "expected %qT but argument is of type %qT",            \
5106                   type, rhstype);                                        \
5107         break;                                                           \
5108       case ic_assign:                                                    \
5109         pedwarn (LOCATION, OPT, AS);                                     \
5110         break;                                                           \
5111       case ic_init:                                                      \
5112         pedwarn_init (LOCATION, OPT, IN);                                \
5113         break;                                                           \
5114       case ic_return:                                                    \
5115         pedwarn (LOCATION, OPT, RE);                                     \
5116         break;                                                           \
5117       default:                                                           \
5118         gcc_unreachable ();                                              \
5119       }                                                                  \
5120   } while (0)
5121
5122   /* This macro is used to emit diagnostics to ensure that all format
5123      strings are complete sentences, visible to gettext and checked at
5124      compile time.  It is the same as WARN_FOR_ASSIGNMENT but with an
5125      extra parameter to enumerate qualifiers.  */
5126
5127 #define WARN_FOR_QUALIFIERS(LOCATION, OPT, AR, AS, IN, RE, QUALS)        \
5128   do {                                                                   \
5129     switch (errtype)                                                     \
5130       {                                                                  \
5131       case ic_argpass:                                                   \
5132         if (pedwarn (LOCATION, OPT, AR, parmnum, rname, QUALS))          \
5133           inform ((fundecl && !DECL_IS_BUILTIN (fundecl))                \
5134                   ? DECL_SOURCE_LOCATION (fundecl) : LOCATION,           \
5135                   "expected %qT but argument is of type %qT",            \
5136                   type, rhstype);                                        \
5137         break;                                                           \
5138       case ic_assign:                                                    \
5139         pedwarn (LOCATION, OPT, AS, QUALS);                          \
5140         break;                                                           \
5141       case ic_init:                                                      \
5142         pedwarn (LOCATION, OPT, IN, QUALS);                          \
5143         break;                                                           \
5144       case ic_return:                                                    \
5145         pedwarn (LOCATION, OPT, RE, QUALS);                              \
5146         break;                                                           \
5147       default:                                                           \
5148         gcc_unreachable ();                                              \
5149       }                                                                  \
5150   } while (0)
5151
5152   if (TREE_CODE (rhs) == EXCESS_PRECISION_EXPR)
5153     rhs = TREE_OPERAND (rhs, 0);
5154
5155   rhstype = TREE_TYPE (rhs);
5156   coder = TREE_CODE (rhstype);
5157
5158   if (coder == ERROR_MARK)
5159     return error_mark_node;
5160
5161   if (c_dialect_objc ())
5162     {
5163       int parmno;
5164
5165       switch (errtype)
5166         {
5167         case ic_return:
5168           parmno = 0;
5169           break;
5170
5171         case ic_assign:
5172           parmno = -1;
5173           break;
5174
5175         case ic_init:
5176           parmno = -2;
5177           break;
5178
5179         default:
5180           parmno = parmnum;
5181           break;
5182         }
5183
5184       objc_ok = objc_compare_types (type, rhstype, parmno, rname);
5185     }
5186
5187   if (warn_cxx_compat)
5188     {
5189       tree checktype = origtype != NULL_TREE ? origtype : rhstype;
5190       if (checktype != error_mark_node
5191           && TREE_CODE (type) == ENUMERAL_TYPE
5192           && TYPE_MAIN_VARIANT (checktype) != TYPE_MAIN_VARIANT (type))
5193         {
5194           WARN_FOR_ASSIGNMENT (input_location, OPT_Wc___compat,
5195                                G_("enum conversion when passing argument "
5196                                   "%d of %qE is invalid in C++"),
5197                                G_("enum conversion in assignment is "
5198                                   "invalid in C++"),
5199                                G_("enum conversion in initialization is "
5200                                   "invalid in C++"),
5201                                G_("enum conversion in return is "
5202                                   "invalid in C++"));
5203         }
5204     }
5205
5206   if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
5207     return rhs;
5208
5209   if (coder == VOID_TYPE)
5210     {
5211       /* Except for passing an argument to an unprototyped function,
5212          this is a constraint violation.  When passing an argument to
5213          an unprototyped function, it is compile-time undefined;
5214          making it a constraint in that case was rejected in
5215          DR#252.  */
5216       error_at (location, "void value not ignored as it ought to be");
5217       return error_mark_node;
5218     }
5219   rhs = require_complete_type (rhs);
5220   if (rhs == error_mark_node)
5221     return error_mark_node;
5222   /* A type converts to a reference to it.
5223      This code doesn't fully support references, it's just for the
5224      special case of va_start and va_copy.  */
5225   if (codel == REFERENCE_TYPE
5226       && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
5227     {
5228       if (!lvalue_p (rhs))
5229         {
5230           error_at (location, "cannot pass rvalue to reference parameter");
5231           return error_mark_node;
5232         }
5233       if (!c_mark_addressable (rhs))
5234         return error_mark_node;
5235       rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
5236       SET_EXPR_LOCATION (rhs, location);
5237
5238       /* We already know that these two types are compatible, but they
5239          may not be exactly identical.  In fact, `TREE_TYPE (type)' is
5240          likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
5241          likely to be va_list, a typedef to __builtin_va_list, which
5242          is different enough that it will cause problems later.  */
5243       if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
5244         {
5245           rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
5246           SET_EXPR_LOCATION (rhs, location);
5247         }
5248
5249       rhs = build1 (NOP_EXPR, type, rhs);
5250       SET_EXPR_LOCATION (rhs, location);
5251       return rhs;
5252     }
5253   /* Some types can interconvert without explicit casts.  */
5254   else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
5255            && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
5256     return convert (type, rhs);
5257   /* Arithmetic types all interconvert, and enum is treated like int.  */
5258   else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
5259             || codel == FIXED_POINT_TYPE
5260             || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
5261             || codel == BOOLEAN_TYPE)
5262            && (coder == INTEGER_TYPE || coder == REAL_TYPE
5263                || coder == FIXED_POINT_TYPE
5264                || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
5265                || coder == BOOLEAN_TYPE))
5266     {
5267       tree ret;
5268       bool save = in_late_binary_op;
5269       if (codel == BOOLEAN_TYPE || codel == COMPLEX_TYPE)
5270         in_late_binary_op = true;
5271       ret = convert_and_check (type, orig_rhs);
5272       if (codel == BOOLEAN_TYPE || codel == COMPLEX_TYPE)
5273         in_late_binary_op = save;
5274       return ret;
5275     }
5276
5277   /* Aggregates in different TUs might need conversion.  */
5278   if ((codel == RECORD_TYPE || codel == UNION_TYPE)
5279       && codel == coder
5280       && comptypes (type, rhstype))
5281     return convert_and_check (type, rhs);
5282
5283   /* Conversion to a transparent union or record from its member types.
5284      This applies only to function arguments.  */
5285   if (((codel == UNION_TYPE || codel == RECORD_TYPE)
5286       && TYPE_TRANSPARENT_AGGR (type))
5287       && errtype == ic_argpass)
5288     {
5289       tree memb, marginal_memb = NULL_TREE;
5290
5291       for (memb = TYPE_FIELDS (type); memb ; memb = DECL_CHAIN (memb))
5292         {
5293           tree memb_type = TREE_TYPE (memb);
5294
5295           if (comptypes (TYPE_MAIN_VARIANT (memb_type),
5296                          TYPE_MAIN_VARIANT (rhstype)))
5297             break;
5298
5299           if (TREE_CODE (memb_type) != POINTER_TYPE)
5300             continue;
5301
5302           if (coder == POINTER_TYPE)
5303             {
5304               tree ttl = TREE_TYPE (memb_type);
5305               tree ttr = TREE_TYPE (rhstype);
5306
5307               /* Any non-function converts to a [const][volatile] void *
5308                  and vice versa; otherwise, targets must be the same.
5309                  Meanwhile, the lhs target must have all the qualifiers of
5310                  the rhs.  */
5311               if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
5312                   || comp_target_types (location, memb_type, rhstype))
5313                 {
5314                   /* If this type won't generate any warnings, use it.  */
5315                   if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
5316                       || ((TREE_CODE (ttr) == FUNCTION_TYPE
5317                            && TREE_CODE (ttl) == FUNCTION_TYPE)
5318                           ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
5319                              == TYPE_QUALS (ttr))
5320                           : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
5321                              == TYPE_QUALS (ttl))))
5322                     break;
5323
5324                   /* Keep looking for a better type, but remember this one.  */
5325                   if (!marginal_memb)
5326                     marginal_memb = memb;
5327                 }
5328             }
5329
5330           /* Can convert integer zero to any pointer type.  */
5331           if (null_pointer_constant)
5332             {
5333               rhs = null_pointer_node;
5334               break;
5335             }
5336         }
5337
5338       if (memb || marginal_memb)
5339         {
5340           if (!memb)
5341             {
5342               /* We have only a marginally acceptable member type;
5343                  it needs a warning.  */
5344               tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
5345               tree ttr = TREE_TYPE (rhstype);
5346
5347               /* Const and volatile mean something different for function
5348                  types, so the usual warnings are not appropriate.  */
5349               if (TREE_CODE (ttr) == FUNCTION_TYPE
5350                   && TREE_CODE (ttl) == FUNCTION_TYPE)
5351                 {
5352                   /* Because const and volatile on functions are
5353                      restrictions that say the function will not do
5354                      certain things, it is okay to use a const or volatile
5355                      function where an ordinary one is wanted, but not
5356                      vice-versa.  */
5357                   if (TYPE_QUALS_NO_ADDR_SPACE (ttl)
5358                       & ~TYPE_QUALS_NO_ADDR_SPACE (ttr))
5359                     WARN_FOR_QUALIFIERS (location, 0,
5360                                          G_("passing argument %d of %qE "
5361                                             "makes %q#v qualified function "
5362                                             "pointer from unqualified"),
5363                                          G_("assignment makes %q#v qualified "
5364                                             "function pointer from "
5365                                             "unqualified"),
5366                                          G_("initialization makes %q#v qualified "
5367                                             "function pointer from "
5368                                             "unqualified"),
5369                                          G_("return makes %q#v qualified function "
5370                                             "pointer from unqualified"),
5371                                          TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr));
5372                 }
5373               else if (TYPE_QUALS_NO_ADDR_SPACE (ttr)
5374                        & ~TYPE_QUALS_NO_ADDR_SPACE (ttl))
5375                 WARN_FOR_QUALIFIERS (location, 0,
5376                                      G_("passing argument %d of %qE discards "
5377                                         "%qv qualifier from pointer target type"),
5378                                      G_("assignment discards %qv qualifier "
5379                                         "from pointer target type"),
5380                                      G_("initialization discards %qv qualifier "
5381                                         "from pointer target type"),
5382                                      G_("return discards %qv qualifier from "
5383                                         "pointer target type"),
5384                                      TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl));
5385
5386               memb = marginal_memb;
5387             }
5388
5389           if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
5390             pedwarn (location, OPT_pedantic,
5391                      "ISO C prohibits argument conversion to union type");
5392
5393           rhs = fold_convert_loc (location, TREE_TYPE (memb), rhs);
5394           return build_constructor_single (type, memb, rhs);
5395         }
5396     }
5397
5398   /* Conversions among pointers */
5399   else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
5400            && (coder == codel))
5401     {
5402       tree ttl = TREE_TYPE (type);
5403       tree ttr = TREE_TYPE (rhstype);
5404       tree mvl = ttl;
5405       tree mvr = ttr;
5406       bool is_opaque_pointer;
5407       int target_cmp = 0;   /* Cache comp_target_types () result.  */
5408       addr_space_t asl;
5409       addr_space_t asr;
5410
5411       if (TREE_CODE (mvl) != ARRAY_TYPE)
5412         mvl = TYPE_MAIN_VARIANT (mvl);
5413       if (TREE_CODE (mvr) != ARRAY_TYPE)
5414         mvr = TYPE_MAIN_VARIANT (mvr);
5415       /* Opaque pointers are treated like void pointers.  */
5416       is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
5417
5418       /* The Plan 9 compiler permits a pointer to a struct to be
5419          automatically converted into a pointer to an anonymous field
5420          within the struct.  */
5421       if (flag_plan9_extensions
5422           && (TREE_CODE (mvl) == RECORD_TYPE || TREE_CODE(mvl) == UNION_TYPE)
5423           && (TREE_CODE (mvr) == RECORD_TYPE || TREE_CODE(mvr) == UNION_TYPE)
5424           && mvl != mvr)
5425         {
5426           tree new_rhs = convert_to_anonymous_field (location, type, rhs);
5427           if (new_rhs != NULL_TREE)
5428             {
5429               rhs = new_rhs;
5430               rhstype = TREE_TYPE (rhs);
5431               coder = TREE_CODE (rhstype);
5432               ttr = TREE_TYPE (rhstype);
5433               mvr = TYPE_MAIN_VARIANT (ttr);
5434             }
5435         }
5436
5437       /* C++ does not allow the implicit conversion void* -> T*.  However,
5438          for the purpose of reducing the number of false positives, we
5439          tolerate the special case of
5440
5441                 int *p = NULL;
5442
5443          where NULL is typically defined in C to be '(void *) 0'.  */
5444       if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
5445         warning_at (location, OPT_Wc___compat,
5446                     "request for implicit conversion "
5447                     "from %qT to %qT not permitted in C++", rhstype, type);
5448
5449       /* See if the pointers point to incompatible address spaces.  */
5450       asl = TYPE_ADDR_SPACE (ttl);
5451       asr = TYPE_ADDR_SPACE (ttr);
5452       if (!null_pointer_constant_p (rhs)
5453           && asr != asl && !targetm.addr_space.subset_p (asr, asl))
5454         {
5455           switch (errtype)
5456             {
5457             case ic_argpass:
5458               error_at (location, "passing argument %d of %qE from pointer to "
5459                         "non-enclosed address space", parmnum, rname);
5460               break;
5461             case ic_assign:
5462               error_at (location, "assignment from pointer to "
5463                         "non-enclosed address space");
5464               break;
5465             case ic_init:
5466               error_at (location, "initialization from pointer to "
5467                         "non-enclosed address space");
5468               break;
5469             case ic_return:
5470               error_at (location, "return from pointer to "
5471                         "non-enclosed address space");
5472               break;
5473             default:
5474               gcc_unreachable ();
5475             }
5476           return error_mark_node;
5477         }
5478
5479       /* Check if the right-hand side has a format attribute but the
5480          left-hand side doesn't.  */
5481       if (warn_missing_format_attribute
5482           && check_missing_format_attribute (type, rhstype))
5483         {
5484           switch (errtype)
5485           {
5486           case ic_argpass:
5487             warning_at (location, OPT_Wmissing_format_attribute,
5488                         "argument %d of %qE might be "
5489                         "a candidate for a format attribute",
5490                         parmnum, rname);
5491             break;
5492           case ic_assign:
5493             warning_at (location, OPT_Wmissing_format_attribute,
5494                         "assignment left-hand side might be "
5495                         "a candidate for a format attribute");
5496             break;
5497           case ic_init:
5498             warning_at (location, OPT_Wmissing_format_attribute,
5499                         "initialization left-hand side might be "
5500                         "a candidate for a format attribute");
5501             break;
5502           case ic_return:
5503             warning_at (location, OPT_Wmissing_format_attribute,
5504                         "return type might be "
5505                         "a candidate for a format attribute");
5506             break;
5507           default:
5508             gcc_unreachable ();
5509           }
5510         }
5511
5512       /* Any non-function converts to a [const][volatile] void *
5513          and vice versa; otherwise, targets must be the same.
5514          Meanwhile, the lhs target must have all the qualifiers of the rhs.  */
5515       if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
5516           || (target_cmp = comp_target_types (location, type, rhstype))
5517           || is_opaque_pointer
5518           || (c_common_unsigned_type (mvl)
5519               == c_common_unsigned_type (mvr)))
5520         {
5521           if (pedantic
5522               && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
5523                   ||
5524                   (VOID_TYPE_P (ttr)
5525                    && !null_pointer_constant
5526                    && TREE_CODE (ttl) == FUNCTION_TYPE)))
5527             WARN_FOR_ASSIGNMENT (location, OPT_pedantic,
5528                                  G_("ISO C forbids passing argument %d of "
5529                                     "%qE between function pointer "
5530                                     "and %<void *%>"),
5531                                  G_("ISO C forbids assignment between "
5532                                     "function pointer and %<void *%>"),
5533                                  G_("ISO C forbids initialization between "
5534                                     "function pointer and %<void *%>"),
5535                                  G_("ISO C forbids return between function "
5536                                     "pointer and %<void *%>"));
5537           /* Const and volatile mean something different for function types,
5538              so the usual warnings are not appropriate.  */
5539           else if (TREE_CODE (ttr) != FUNCTION_TYPE
5540                    && TREE_CODE (ttl) != FUNCTION_TYPE)
5541             {
5542               if (TYPE_QUALS_NO_ADDR_SPACE (ttr)
5543                   & ~TYPE_QUALS_NO_ADDR_SPACE (ttl))
5544                 {
5545                   WARN_FOR_QUALIFIERS (location, 0,
5546                                        G_("passing argument %d of %qE discards "
5547                                           "%qv qualifier from pointer target type"),
5548                                        G_("assignment discards %qv qualifier "
5549                                           "from pointer target type"),
5550                                        G_("initialization discards %qv qualifier "
5551                                           "from pointer target type"),
5552                                        G_("return discards %qv qualifier from "
5553                                           "pointer target type"),
5554                                        TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl));
5555                 }
5556               /* If this is not a case of ignoring a mismatch in signedness,
5557                  no warning.  */
5558               else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
5559                        || target_cmp)
5560                 ;
5561               /* If there is a mismatch, do warn.  */
5562               else if (warn_pointer_sign)
5563                 WARN_FOR_ASSIGNMENT (location, OPT_Wpointer_sign,
5564                                      G_("pointer targets in passing argument "
5565                                         "%d of %qE differ in signedness"),
5566                                      G_("pointer targets in assignment "
5567                                         "differ in signedness"),
5568                                      G_("pointer targets in initialization "
5569                                         "differ in signedness"),
5570                                      G_("pointer targets in return differ "
5571                                         "in signedness"));
5572             }
5573           else if (TREE_CODE (ttl) == FUNCTION_TYPE
5574                    && TREE_CODE (ttr) == FUNCTION_TYPE)
5575             {
5576               /* Because const and volatile on functions are restrictions
5577                  that say the function will not do certain things,
5578                  it is okay to use a const or volatile function
5579                  where an ordinary one is wanted, but not vice-versa.  */
5580               if (TYPE_QUALS_NO_ADDR_SPACE (ttl)
5581                   & ~TYPE_QUALS_NO_ADDR_SPACE (ttr))
5582                 WARN_FOR_QUALIFIERS (location, 0,
5583                                      G_("passing argument %d of %qE makes "
5584                                         "%q#v qualified function pointer "
5585                                         "from unqualified"),
5586                                      G_("assignment makes %q#v qualified function "
5587                                         "pointer from unqualified"),
5588                                      G_("initialization makes %q#v qualified "
5589                                         "function pointer from unqualified"),
5590                                      G_("return makes %q#v qualified function "
5591                                         "pointer from unqualified"),
5592                                      TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr));
5593             }
5594         }
5595       else
5596         /* Avoid warning about the volatile ObjC EH puts on decls.  */
5597         if (!objc_ok)
5598           WARN_FOR_ASSIGNMENT (location, 0,
5599                                G_("passing argument %d of %qE from "
5600                                   "incompatible pointer type"),
5601                                G_("assignment from incompatible pointer type"),
5602                                G_("initialization from incompatible "
5603                                   "pointer type"),
5604                                G_("return from incompatible pointer type"));
5605
5606       return convert (type, rhs);
5607     }
5608   else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
5609     {
5610       /* ??? This should not be an error when inlining calls to
5611          unprototyped functions.  */
5612       error_at (location, "invalid use of non-lvalue array");
5613       return error_mark_node;
5614     }
5615   else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
5616     {
5617       /* An explicit constant 0 can convert to a pointer,
5618          or one that results from arithmetic, even including
5619          a cast to integer type.  */
5620       if (!null_pointer_constant)
5621         WARN_FOR_ASSIGNMENT (location, 0,
5622                              G_("passing argument %d of %qE makes "
5623                                 "pointer from integer without a cast"),
5624                              G_("assignment makes pointer from integer "
5625                                 "without a cast"),
5626                              G_("initialization makes pointer from "
5627                                 "integer without a cast"),
5628                              G_("return makes pointer from integer "
5629                                 "without a cast"));
5630
5631       return convert (type, rhs);
5632     }
5633   else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
5634     {
5635       WARN_FOR_ASSIGNMENT (location, 0,
5636                            G_("passing argument %d of %qE makes integer "
5637                               "from pointer without a cast"),
5638                            G_("assignment makes integer from pointer "
5639                               "without a cast"),
5640                            G_("initialization makes integer from pointer "
5641                               "without a cast"),
5642                            G_("return makes integer from pointer "
5643                               "without a cast"));
5644       return convert (type, rhs);
5645     }
5646   else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
5647     {
5648       tree ret;
5649       bool save = in_late_binary_op;
5650       in_late_binary_op = true;
5651       ret = convert (type, rhs);
5652       in_late_binary_op = save;
5653       return ret;
5654     }
5655
5656   switch (errtype)
5657     {
5658     case ic_argpass:
5659       error_at (location, "incompatible type for argument %d of %qE", parmnum, rname);
5660       inform ((fundecl && !DECL_IS_BUILTIN (fundecl))
5661               ? DECL_SOURCE_LOCATION (fundecl) : input_location,
5662               "expected %qT but argument is of type %qT", type, rhstype);
5663       break;
5664     case ic_assign:
5665       error_at (location, "incompatible types when assigning to type %qT from "
5666                 "type %qT", type, rhstype);
5667       break;
5668     case ic_init:
5669       error_at (location,
5670                 "incompatible types when initializing type %qT using type %qT",
5671                 type, rhstype);
5672       break;
5673     case ic_return:
5674       error_at (location,
5675                 "incompatible types when returning type %qT but %qT was "
5676                 "expected", rhstype, type);
5677       break;
5678     default:
5679       gcc_unreachable ();
5680     }
5681
5682   return error_mark_node;
5683 }
5684 \f
5685 /* If VALUE is a compound expr all of whose expressions are constant, then
5686    return its value.  Otherwise, return error_mark_node.
5687
5688    This is for handling COMPOUND_EXPRs as initializer elements
5689    which is allowed with a warning when -pedantic is specified.  */
5690
5691 static tree
5692 valid_compound_expr_initializer (tree value, tree endtype)
5693 {
5694   if (TREE_CODE (value) == COMPOUND_EXPR)
5695     {
5696       if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
5697           == error_mark_node)
5698         return error_mark_node;
5699       return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
5700                                               endtype);
5701     }
5702   else if (!initializer_constant_valid_p (value, endtype))
5703     return error_mark_node;
5704   else
5705     return value;
5706 }
5707 \f
5708 /* Perform appropriate conversions on the initial value of a variable,
5709    store it in the declaration DECL,
5710    and print any error messages that are appropriate.
5711    If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5712    If the init is invalid, store an ERROR_MARK.
5713
5714    INIT_LOC is the location of the initial value.  */
5715
5716 void
5717 store_init_value (location_t init_loc, tree decl, tree init, tree origtype)
5718 {
5719   tree value, type;
5720   bool npc = false;
5721
5722   /* If variable's type was invalidly declared, just ignore it.  */
5723
5724   type = TREE_TYPE (decl);
5725   if (TREE_CODE (type) == ERROR_MARK)
5726     return;
5727
5728   /* Digest the specified initializer into an expression.  */
5729
5730   if (init)
5731     npc = null_pointer_constant_p (init);
5732   value = digest_init (init_loc, type, init, origtype, npc,
5733                        true, TREE_STATIC (decl));
5734
5735   /* Store the expression if valid; else report error.  */
5736
5737   if (!in_system_header
5738       && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
5739     warning (OPT_Wtraditional, "traditional C rejects automatic "
5740              "aggregate initialization");
5741
5742   DECL_INITIAL (decl) = value;
5743
5744   /* ANSI wants warnings about out-of-range constant initializers.  */
5745   STRIP_TYPE_NOPS (value);
5746   if (TREE_STATIC (decl))
5747     constant_expression_warning (value);
5748
5749   /* Check if we need to set array size from compound literal size.  */
5750   if (TREE_CODE (type) == ARRAY_TYPE
5751       && TYPE_DOMAIN (type) == 0
5752       && value != error_mark_node)
5753     {
5754       tree inside_init = init;
5755
5756       STRIP_TYPE_NOPS (inside_init);
5757       inside_init = fold (inside_init);
5758
5759       if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
5760         {
5761           tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
5762
5763           if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
5764             {
5765               /* For int foo[] = (int [3]){1}; we need to set array size
5766                  now since later on array initializer will be just the
5767                  brace enclosed list of the compound literal.  */
5768               tree etype = strip_array_types (TREE_TYPE (decl));
5769               type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
5770               TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
5771               layout_type (type);
5772               layout_decl (cldecl, 0);
5773               TREE_TYPE (decl)
5774                 = c_build_qualified_type (type, TYPE_QUALS (etype));
5775             }
5776         }
5777     }
5778 }
5779 \f
5780 /* Methods for storing and printing names for error messages.  */
5781
5782 /* Implement a spelling stack that allows components of a name to be pushed
5783    and popped.  Each element on the stack is this structure.  */
5784
5785 struct spelling
5786 {
5787   int kind;
5788   union
5789     {
5790       unsigned HOST_WIDE_INT i;
5791       const char *s;
5792     } u;
5793 };
5794
5795 #define SPELLING_STRING 1
5796 #define SPELLING_MEMBER 2
5797 #define SPELLING_BOUNDS 3
5798
5799 static struct spelling *spelling;       /* Next stack element (unused).  */
5800 static struct spelling *spelling_base;  /* Spelling stack base.  */
5801 static int spelling_size;               /* Size of the spelling stack.  */
5802
5803 /* Macros to save and restore the spelling stack around push_... functions.
5804    Alternative to SAVE_SPELLING_STACK.  */
5805
5806 #define SPELLING_DEPTH() (spelling - spelling_base)
5807 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
5808
5809 /* Push an element on the spelling stack with type KIND and assign VALUE
5810    to MEMBER.  */
5811
5812 #define PUSH_SPELLING(KIND, VALUE, MEMBER)                              \
5813 {                                                                       \
5814   int depth = SPELLING_DEPTH ();                                        \
5815                                                                         \
5816   if (depth >= spelling_size)                                           \
5817     {                                                                   \
5818       spelling_size += 10;                                              \
5819       spelling_base = XRESIZEVEC (struct spelling, spelling_base,       \
5820                                   spelling_size);                       \
5821       RESTORE_SPELLING_DEPTH (depth);                                   \
5822     }                                                                   \
5823                                                                         \
5824   spelling->kind = (KIND);                                              \
5825   spelling->MEMBER = (VALUE);                                           \
5826   spelling++;                                                           \
5827 }
5828
5829 /* Push STRING on the stack.  Printed literally.  */
5830
5831 static void
5832 push_string (const char *string)
5833 {
5834   PUSH_SPELLING (SPELLING_STRING, string, u.s);
5835 }
5836
5837 /* Push a member name on the stack.  Printed as '.' STRING.  */
5838
5839 static void
5840 push_member_name (tree decl)
5841 {
5842   const char *const string
5843     = (DECL_NAME (decl)
5844        ? identifier_to_locale (IDENTIFIER_POINTER (DECL_NAME (decl)))
5845        : _("<anonymous>"));
5846   PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
5847 }
5848
5849 /* Push an array bounds on the stack.  Printed as [BOUNDS].  */
5850
5851 static void
5852 push_array_bounds (unsigned HOST_WIDE_INT bounds)
5853 {
5854   PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
5855 }
5856
5857 /* Compute the maximum size in bytes of the printed spelling.  */
5858
5859 static int
5860 spelling_length (void)
5861 {
5862   int size = 0;
5863   struct spelling *p;
5864
5865   for (p = spelling_base; p < spelling; p++)
5866     {
5867       if (p->kind == SPELLING_BOUNDS)
5868         size += 25;
5869       else
5870         size += strlen (p->u.s) + 1;
5871     }
5872
5873   return size;
5874 }
5875
5876 /* Print the spelling to BUFFER and return it.  */
5877
5878 static char *
5879 print_spelling (char *buffer)
5880 {
5881   char *d = buffer;
5882   struct spelling *p;
5883
5884   for (p = spelling_base; p < spelling; p++)
5885     if (p->kind == SPELLING_BOUNDS)
5886       {
5887         sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
5888         d += strlen (d);
5889       }
5890     else
5891       {
5892         const char *s;
5893         if (p->kind == SPELLING_MEMBER)
5894           *d++ = '.';
5895         for (s = p->u.s; (*d = *s++); d++)
5896           ;
5897       }
5898   *d++ = '\0';
5899   return buffer;
5900 }
5901
5902 /* Issue an error message for a bad initializer component.
5903    GMSGID identifies the message.
5904    The component name is taken from the spelling stack.  */
5905
5906 void
5907 error_init (const char *gmsgid)
5908 {
5909   char *ofwhat;
5910
5911   /* The gmsgid may be a format string with %< and %>. */
5912   error (gmsgid);
5913   ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5914   if (*ofwhat)
5915     error ("(near initialization for %qs)", ofwhat);
5916 }
5917
5918 /* Issue a pedantic warning for a bad initializer component.  OPT is
5919    the option OPT_* (from options.h) controlling this warning or 0 if
5920    it is unconditionally given.  GMSGID identifies the message.  The
5921    component name is taken from the spelling stack.  */
5922
5923 void
5924 pedwarn_init (location_t location, int opt, const char *gmsgid)
5925 {
5926   char *ofwhat;
5927
5928   /* The gmsgid may be a format string with %< and %>. */
5929   pedwarn (location, opt, gmsgid);
5930   ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5931   if (*ofwhat)
5932     pedwarn (location, opt, "(near initialization for %qs)", ofwhat);
5933 }
5934
5935 /* Issue a warning for a bad initializer component.
5936
5937    OPT is the OPT_W* value corresponding to the warning option that
5938    controls this warning.  GMSGID identifies the message.  The
5939    component name is taken from the spelling stack.  */
5940
5941 static void
5942 warning_init (int opt, const char *gmsgid)
5943 {
5944   char *ofwhat;
5945
5946   /* The gmsgid may be a format string with %< and %>. */
5947   warning (opt, gmsgid);
5948   ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5949   if (*ofwhat)
5950     warning (opt, "(near initialization for %qs)", ofwhat);
5951 }
5952 \f
5953 /* If TYPE is an array type and EXPR is a parenthesized string
5954    constant, warn if pedantic that EXPR is being used to initialize an
5955    object of type TYPE.  */
5956
5957 void
5958 maybe_warn_string_init (tree type, struct c_expr expr)
5959 {
5960   if (pedantic
5961       && TREE_CODE (type) == ARRAY_TYPE
5962       && TREE_CODE (expr.value) == STRING_CST
5963       && expr.original_code != STRING_CST)
5964     pedwarn_init (input_location, OPT_pedantic,
5965                   "array initialized from parenthesized string constant");
5966 }
5967
5968 /* Digest the parser output INIT as an initializer for type TYPE.
5969    Return a C expression of type TYPE to represent the initial value.
5970
5971    If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5972
5973    NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
5974
5975    If INIT is a string constant, STRICT_STRING is true if it is
5976    unparenthesized or we should not warn here for it being parenthesized.
5977    For other types of INIT, STRICT_STRING is not used.
5978
5979    INIT_LOC is the location of the INIT.
5980
5981    REQUIRE_CONSTANT requests an error if non-constant initializers or
5982    elements are seen.  */
5983
5984 static tree
5985 digest_init (location_t init_loc, tree type, tree init, tree origtype,
5986              bool null_pointer_constant, bool strict_string,
5987              int require_constant)
5988 {
5989   enum tree_code code = TREE_CODE (type);
5990   tree inside_init = init;
5991   tree semantic_type = NULL_TREE;
5992   bool maybe_const = true;
5993
5994   if (type == error_mark_node
5995       || !init
5996       || init == error_mark_node
5997       || TREE_TYPE (init) == error_mark_node)
5998     return error_mark_node;
5999
6000   STRIP_TYPE_NOPS (inside_init);
6001
6002   if (TREE_CODE (inside_init) == EXCESS_PRECISION_EXPR)
6003     {
6004       semantic_type = TREE_TYPE (inside_init);
6005       inside_init = TREE_OPERAND (inside_init, 0);
6006     }
6007   inside_init = c_fully_fold (inside_init, require_constant, &maybe_const);
6008   inside_init = decl_constant_value_for_optimization (inside_init);
6009
6010   /* Initialization of an array of chars from a string constant
6011      optionally enclosed in braces.  */
6012
6013   if (code == ARRAY_TYPE && inside_init
6014       && TREE_CODE (inside_init) == STRING_CST)
6015     {
6016       tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
6017       /* Note that an array could be both an array of character type
6018          and an array of wchar_t if wchar_t is signed char or unsigned
6019          char.  */
6020       bool char_array = (typ1 == char_type_node
6021                          || typ1 == signed_char_type_node
6022                          || typ1 == unsigned_char_type_node);
6023       bool wchar_array = !!comptypes (typ1, wchar_type_node);
6024       bool char16_array = !!comptypes (typ1, char16_type_node);
6025       bool char32_array = !!comptypes (typ1, char32_type_node);
6026
6027       if (char_array || wchar_array || char16_array || char32_array)
6028         {
6029           struct c_expr expr;
6030           tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
6031           expr.value = inside_init;
6032           expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
6033           expr.original_type = NULL;
6034           maybe_warn_string_init (type, expr);
6035
6036           if (TYPE_DOMAIN (type) && !TYPE_MAX_VALUE (TYPE_DOMAIN (type)))
6037             pedwarn_init (init_loc, OPT_pedantic,
6038                           "initialization of a flexible array member");
6039
6040           if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
6041                          TYPE_MAIN_VARIANT (type)))
6042             return inside_init;
6043
6044           if (char_array)
6045             {
6046               if (typ2 != char_type_node)
6047                 {
6048                   error_init ("char-array initialized from wide string");
6049                   return error_mark_node;
6050                 }
6051             }
6052           else
6053             {
6054               if (typ2 == char_type_node)
6055                 {
6056                   error_init ("wide character array initialized from non-wide "
6057                               "string");
6058                   return error_mark_node;
6059                 }
6060               else if (!comptypes(typ1, typ2))
6061                 {
6062                   error_init ("wide character array initialized from "
6063                               "incompatible wide string");
6064                   return error_mark_node;
6065                 }
6066             }
6067
6068           TREE_TYPE (inside_init) = type;
6069           if (TYPE_DOMAIN (type) != 0
6070               && TYPE_SIZE (type) != 0
6071               && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST)
6072             {
6073               unsigned HOST_WIDE_INT len = TREE_STRING_LENGTH (inside_init);
6074
6075               /* Subtract the size of a single (possibly wide) character
6076                  because it's ok to ignore the terminating null char
6077                  that is counted in the length of the constant.  */
6078               if (0 > compare_tree_int (TYPE_SIZE_UNIT (type),
6079                                         (len
6080                                          - (TYPE_PRECISION (typ1)
6081                                             / BITS_PER_UNIT))))
6082                 pedwarn_init (init_loc, 0,
6083                               ("initializer-string for array of chars "
6084                                "is too long"));
6085               else if (warn_cxx_compat
6086                        && 0 > compare_tree_int (TYPE_SIZE_UNIT (type), len))
6087                 warning_at (init_loc, OPT_Wc___compat,
6088                             ("initializer-string for array chars "
6089                              "is too long for C++"));
6090             }
6091
6092           return inside_init;
6093         }
6094       else if (INTEGRAL_TYPE_P (typ1))
6095         {
6096           error_init ("array of inappropriate type initialized "
6097                       "from string constant");
6098           return error_mark_node;
6099         }
6100     }
6101
6102   /* Build a VECTOR_CST from a *constant* vector constructor.  If the
6103      vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
6104      below and handle as a constructor.  */
6105   if (code == VECTOR_TYPE
6106       && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
6107       && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
6108       && TREE_CONSTANT (inside_init))
6109     {
6110       if (TREE_CODE (inside_init) == VECTOR_CST
6111           && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
6112                         TYPE_MAIN_VARIANT (type)))
6113         return inside_init;
6114
6115       if (TREE_CODE (inside_init) == CONSTRUCTOR)
6116         {
6117           unsigned HOST_WIDE_INT ix;
6118           tree value;
6119           bool constant_p = true;
6120
6121           /* Iterate through elements and check if all constructor
6122              elements are *_CSTs.  */
6123           FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
6124             if (!CONSTANT_CLASS_P (value))
6125               {
6126                 constant_p = false;
6127                 break;
6128               }
6129
6130           if (constant_p)
6131             return build_vector_from_ctor (type,
6132                                            CONSTRUCTOR_ELTS (inside_init));
6133         }
6134     }
6135
6136   if (warn_sequence_point)
6137     verify_sequence_points (inside_init);
6138
6139   /* Any type can be initialized
6140      from an expression of the same type, optionally with braces.  */
6141
6142   if (inside_init && TREE_TYPE (inside_init) != 0
6143       && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
6144                      TYPE_MAIN_VARIANT (type))
6145           || (code == ARRAY_TYPE
6146               && comptypes (TREE_TYPE (inside_init), type))
6147           || (code == VECTOR_TYPE
6148               && comptypes (TREE_TYPE (inside_init), type))
6149           || (code == POINTER_TYPE
6150               && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
6151               && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
6152                             TREE_TYPE (type)))))
6153     {
6154       if (code == POINTER_TYPE)
6155         {
6156           if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
6157             {
6158               if (TREE_CODE (inside_init) == STRING_CST
6159                   || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
6160                 inside_init = array_to_pointer_conversion
6161                   (init_loc, inside_init);
6162               else
6163                 {
6164                   error_init ("invalid use of non-lvalue array");
6165                   return error_mark_node;
6166                 }
6167             }
6168         }
6169
6170       if (code == VECTOR_TYPE)
6171         /* Although the types are compatible, we may require a
6172            conversion.  */
6173         inside_init = convert (type, inside_init);
6174
6175       if (require_constant
6176           && (code == VECTOR_TYPE || !flag_isoc99)
6177           && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
6178         {
6179           /* As an extension, allow initializing objects with static storage
6180              duration with compound literals (which are then treated just as
6181              the brace enclosed list they contain).  Also allow this for
6182              vectors, as we can only assign them with compound literals.  */
6183           tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
6184           inside_init = DECL_INITIAL (decl);
6185         }
6186
6187       if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
6188           && TREE_CODE (inside_init) != CONSTRUCTOR)
6189         {
6190           error_init ("array initialized from non-constant array expression");
6191           return error_mark_node;
6192         }
6193
6194       /* Compound expressions can only occur here if -pedantic or
6195          -pedantic-errors is specified.  In the later case, we always want
6196          an error.  In the former case, we simply want a warning.  */
6197       if (require_constant && pedantic
6198           && TREE_CODE (inside_init) == COMPOUND_EXPR)
6199         {
6200           inside_init
6201             = valid_compound_expr_initializer (inside_init,
6202                                                TREE_TYPE (inside_init));
6203           if (inside_init == error_mark_node)
6204             error_init ("initializer element is not constant");
6205           else
6206             pedwarn_init (init_loc, OPT_pedantic,
6207                           "initializer element is not constant");
6208           if (flag_pedantic_errors)
6209             inside_init = error_mark_node;
6210         }
6211       else if (require_constant
6212                && !initializer_constant_valid_p (inside_init,
6213                                                  TREE_TYPE (inside_init)))
6214         {
6215           error_init ("initializer element is not constant");
6216           inside_init = error_mark_node;
6217         }
6218       else if (require_constant && !maybe_const)
6219         pedwarn_init (init_loc, 0,
6220                       "initializer element is not a constant expression");
6221
6222       /* Added to enable additional -Wmissing-format-attribute warnings.  */
6223       if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
6224         inside_init = convert_for_assignment (init_loc, type, inside_init,
6225                                               origtype,
6226                                               ic_init, null_pointer_constant,
6227                                               NULL_TREE, NULL_TREE, 0);
6228       return inside_init;
6229     }
6230
6231   /* Handle scalar types, including conversions.  */
6232
6233   if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
6234       || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
6235       || code == COMPLEX_TYPE || code == VECTOR_TYPE)
6236     {
6237       if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
6238           && (TREE_CODE (init) == STRING_CST
6239               || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
6240         inside_init = init = array_to_pointer_conversion (init_loc, init);
6241       if (semantic_type)
6242         inside_init = build1 (EXCESS_PRECISION_EXPR, semantic_type,
6243                               inside_init);
6244       inside_init
6245         = convert_for_assignment (init_loc, type, inside_init, origtype,
6246                                   ic_init, null_pointer_constant,
6247                                   NULL_TREE, NULL_TREE, 0);
6248
6249       /* Check to see if we have already given an error message.  */
6250       if (inside_init == error_mark_node)
6251         ;
6252       else if (require_constant && !TREE_CONSTANT (inside_init))
6253         {
6254           error_init ("initializer element is not constant");
6255           inside_init = error_mark_node;
6256         }
6257       else if (require_constant
6258                && !initializer_constant_valid_p (inside_init,
6259                                                  TREE_TYPE (inside_init)))
6260         {
6261           error_init ("initializer element is not computable at load time");
6262           inside_init = error_mark_node;
6263         }
6264       else if (require_constant && !maybe_const)
6265         pedwarn_init (init_loc, 0,
6266                       "initializer element is not a constant expression");
6267
6268       return inside_init;
6269     }
6270
6271   /* Come here only for records and arrays.  */
6272
6273   if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
6274     {
6275       error_init ("variable-sized object may not be initialized");
6276       return error_mark_node;
6277     }
6278
6279   error_init ("invalid initializer");
6280   return error_mark_node;
6281 }
6282 \f
6283 /* Handle initializers that use braces.  */
6284
6285 /* Type of object we are accumulating a constructor for.
6286    This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE.  */
6287 static tree constructor_type;
6288
6289 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
6290    left to fill.  */
6291 static tree constructor_fields;
6292
6293 /* For an ARRAY_TYPE, this is the specified index
6294    at which to store the next element we get.  */
6295 static tree constructor_index;
6296
6297 /* For an ARRAY_TYPE, this is the maximum index.  */
6298 static tree constructor_max_index;
6299
6300 /* For a RECORD_TYPE, this is the first field not yet written out.  */
6301 static tree constructor_unfilled_fields;
6302
6303 /* For an ARRAY_TYPE, this is the index of the first element
6304    not yet written out.  */
6305 static tree constructor_unfilled_index;
6306
6307 /* In a RECORD_TYPE, the byte index of the next consecutive field.
6308    This is so we can generate gaps between fields, when appropriate.  */
6309 static tree constructor_bit_index;
6310
6311 /* If we are saving up the elements rather than allocating them,
6312    this is the list of elements so far (in reverse order,
6313    most recent first).  */
6314 static VEC(constructor_elt,gc) *constructor_elements;
6315
6316 /* 1 if constructor should be incrementally stored into a constructor chain,
6317    0 if all the elements should be kept in AVL tree.  */
6318 static int constructor_incremental;
6319
6320 /* 1 if so far this constructor's elements are all compile-time constants.  */
6321 static int constructor_constant;
6322
6323 /* 1 if so far this constructor's elements are all valid address constants.  */
6324 static int constructor_simple;
6325
6326 /* 1 if this constructor has an element that cannot be part of a
6327    constant expression.  */
6328 static int constructor_nonconst;
6329
6330 /* 1 if this constructor is erroneous so far.  */
6331 static int constructor_erroneous;
6332
6333 /* Structure for managing pending initializer elements, organized as an
6334    AVL tree.  */
6335
6336 struct init_node
6337 {
6338   struct init_node *left, *right;
6339   struct init_node *parent;
6340   int balance;
6341   tree purpose;
6342   tree value;
6343   tree origtype;
6344 };
6345
6346 /* Tree of pending elements at this constructor level.
6347    These are elements encountered out of order
6348    which belong at places we haven't reached yet in actually
6349    writing the output.
6350    Will never hold tree nodes across GC runs.  */
6351 static struct init_node *constructor_pending_elts;
6352
6353 /* The SPELLING_DEPTH of this constructor.  */
6354 static int constructor_depth;
6355
6356 /* DECL node for which an initializer is being read.
6357    0 means we are reading a constructor expression
6358    such as (struct foo) {...}.  */
6359 static tree constructor_decl;
6360
6361 /* Nonzero if this is an initializer for a top-level decl.  */
6362 static int constructor_top_level;
6363
6364 /* Nonzero if there were any member designators in this initializer.  */
6365 static int constructor_designated;
6366
6367 /* Nesting depth of designator list.  */
6368 static int designator_depth;
6369
6370 /* Nonzero if there were diagnosed errors in this designator list.  */
6371 static int designator_erroneous;
6372
6373 \f
6374 /* This stack has a level for each implicit or explicit level of
6375    structuring in the initializer, including the outermost one.  It
6376    saves the values of most of the variables above.  */
6377
6378 struct constructor_range_stack;
6379
6380 struct constructor_stack
6381 {
6382   struct constructor_stack *next;
6383   tree type;
6384   tree fields;
6385   tree index;
6386   tree max_index;
6387   tree unfilled_index;
6388   tree unfilled_fields;
6389   tree bit_index;
6390   VEC(constructor_elt,gc) *elements;
6391   struct init_node *pending_elts;
6392   int offset;
6393   int depth;
6394   /* If value nonzero, this value should replace the entire
6395      constructor at this level.  */
6396   struct c_expr replacement_value;
6397   struct constructor_range_stack *range_stack;
6398   char constant;
6399   char simple;
6400   char nonconst;
6401   char implicit;
6402   char erroneous;
6403   char outer;
6404   char incremental;
6405   char designated;
6406 };
6407
6408 static struct constructor_stack *constructor_stack;
6409
6410 /* This stack represents designators from some range designator up to
6411    the last designator in the list.  */
6412
6413 struct constructor_range_stack
6414 {
6415   struct constructor_range_stack *next, *prev;
6416   struct constructor_stack *stack;
6417   tree range_start;
6418   tree index;
6419   tree range_end;
6420   tree fields;
6421 };
6422
6423 static struct constructor_range_stack *constructor_range_stack;
6424
6425 /* This stack records separate initializers that are nested.
6426    Nested initializers can't happen in ANSI C, but GNU C allows them
6427    in cases like { ... (struct foo) { ... } ... }.  */
6428
6429 struct initializer_stack
6430 {
6431   struct initializer_stack *next;
6432   tree decl;
6433   struct constructor_stack *constructor_stack;
6434   struct constructor_range_stack *constructor_range_stack;
6435   VEC(constructor_elt,gc) *elements;
6436   struct spelling *spelling;
6437   struct spelling *spelling_base;
6438   int spelling_size;
6439   char top_level;
6440   char require_constant_value;
6441   char require_constant_elements;
6442 };
6443
6444 static struct initializer_stack *initializer_stack;
6445 \f
6446 /* Prepare to parse and output the initializer for variable DECL.  */
6447
6448 void
6449 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
6450 {
6451   const char *locus;
6452   struct initializer_stack *p = XNEW (struct initializer_stack);
6453
6454   p->decl = constructor_decl;
6455   p->require_constant_value = require_constant_value;
6456   p->require_constant_elements = require_constant_elements;
6457   p->constructor_stack = constructor_stack;
6458   p->constructor_range_stack = constructor_range_stack;
6459   p->elements = constructor_elements;
6460   p->spelling = spelling;
6461   p->spelling_base = spelling_base;
6462   p->spelling_size = spelling_size;
6463   p->top_level = constructor_top_level;
6464   p->next = initializer_stack;
6465   initializer_stack = p;
6466
6467   constructor_decl = decl;
6468   constructor_designated = 0;
6469   constructor_top_level = top_level;
6470
6471   if (decl != 0 && decl != error_mark_node)
6472     {
6473       require_constant_value = TREE_STATIC (decl);
6474       require_constant_elements
6475         = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
6476            /* For a scalar, you can always use any value to initialize,
6477               even within braces.  */
6478            && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
6479                || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
6480                || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
6481                || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
6482       locus = identifier_to_locale (IDENTIFIER_POINTER (DECL_NAME (decl)));
6483     }
6484   else
6485     {
6486       require_constant_value = 0;
6487       require_constant_elements = 0;
6488       locus = _("(anonymous)");
6489     }
6490
6491   constructor_stack = 0;
6492   constructor_range_stack = 0;
6493
6494   missing_braces_mentioned = 0;
6495
6496   spelling_base = 0;
6497   spelling_size = 0;
6498   RESTORE_SPELLING_DEPTH (0);
6499
6500   if (locus)
6501     push_string (locus);
6502 }
6503
6504 void
6505 finish_init (void)
6506 {
6507   struct initializer_stack *p = initializer_stack;
6508
6509   /* Free the whole constructor stack of this initializer.  */
6510   while (constructor_stack)
6511     {
6512       struct constructor_stack *q = constructor_stack;
6513       constructor_stack = q->next;
6514       free (q);
6515     }
6516
6517   gcc_assert (!constructor_range_stack);
6518
6519   /* Pop back to the data of the outer initializer (if any).  */
6520   free (spelling_base);
6521
6522   constructor_decl = p->decl;
6523   require_constant_value = p->require_constant_value;
6524   require_constant_elements = p->require_constant_elements;
6525   constructor_stack = p->constructor_stack;
6526   constructor_range_stack = p->constructor_range_stack;
6527   constructor_elements = p->elements;
6528   spelling = p->spelling;
6529   spelling_base = p->spelling_base;
6530   spelling_size = p->spelling_size;
6531   constructor_top_level = p->top_level;
6532   initializer_stack = p->next;
6533   free (p);
6534 }
6535 \f
6536 /* Call here when we see the initializer is surrounded by braces.
6537    This is instead of a call to push_init_level;
6538    it is matched by a call to pop_init_level.
6539
6540    TYPE is the type to initialize, for a constructor expression.
6541    For an initializer for a decl, TYPE is zero.  */
6542
6543 void
6544 really_start_incremental_init (tree type)
6545 {
6546   struct constructor_stack *p = XNEW (struct constructor_stack);
6547
6548   if (type == 0)
6549     type = TREE_TYPE (constructor_decl);
6550
6551   if (TREE_CODE (type) == VECTOR_TYPE
6552       && TYPE_VECTOR_OPAQUE (type))
6553     error ("opaque vector types cannot be initialized");
6554
6555   p->type = constructor_type;
6556   p->fields = constructor_fields;
6557   p->index = constructor_index;
6558   p->max_index = constructor_max_index;
6559   p->unfilled_index = constructor_unfilled_index;
6560   p->unfilled_fields = constructor_unfilled_fields;
6561   p->bit_index = constructor_bit_index;
6562   p->elements = constructor_elements;
6563   p->constant = constructor_constant;
6564   p->simple = constructor_simple;
6565   p->nonconst = constructor_nonconst;
6566   p->erroneous = constructor_erroneous;
6567   p->pending_elts = constructor_pending_elts;
6568   p->depth = constructor_depth;
6569   p->replacement_value.value = 0;
6570   p->replacement_value.original_code = ERROR_MARK;
6571   p->replacement_value.original_type = NULL;
6572   p->implicit = 0;
6573   p->range_stack = 0;
6574   p->outer = 0;
6575   p->incremental = constructor_incremental;
6576   p->designated = constructor_designated;
6577   p->next = 0;
6578   constructor_stack = p;
6579
6580   constructor_constant = 1;
6581   constructor_simple = 1;
6582   constructor_nonconst = 0;
6583   constructor_depth = SPELLING_DEPTH ();
6584   constructor_elements = 0;
6585   constructor_pending_elts = 0;
6586   constructor_type = type;
6587   constructor_incremental = 1;
6588   constructor_designated = 0;
6589   designator_depth = 0;
6590   designator_erroneous = 0;
6591
6592   if (TREE_CODE (constructor_type) == RECORD_TYPE
6593       || TREE_CODE (constructor_type) == UNION_TYPE)
6594     {
6595       constructor_fields = TYPE_FIELDS (constructor_type);
6596       /* Skip any nameless bit fields at the beginning.  */
6597       while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
6598              && DECL_NAME (constructor_fields) == 0)
6599         constructor_fields = DECL_CHAIN (constructor_fields);
6600
6601       constructor_unfilled_fields = constructor_fields;
6602       constructor_bit_index = bitsize_zero_node;
6603     }
6604   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6605     {
6606       if (TYPE_DOMAIN (constructor_type))
6607         {
6608           constructor_max_index
6609             = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
6610
6611           /* Detect non-empty initializations of zero-length arrays.  */
6612           if (constructor_max_index == NULL_TREE
6613               && TYPE_SIZE (constructor_type))
6614             constructor_max_index = integer_minus_one_node;
6615
6616           /* constructor_max_index needs to be an INTEGER_CST.  Attempts
6617              to initialize VLAs will cause a proper error; avoid tree
6618              checking errors as well by setting a safe value.  */
6619           if (constructor_max_index
6620               && TREE_CODE (constructor_max_index) != INTEGER_CST)
6621             constructor_max_index = integer_minus_one_node;
6622
6623           constructor_index
6624             = convert (bitsizetype,
6625                        TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6626         }
6627       else
6628         {
6629           constructor_index = bitsize_zero_node;
6630           constructor_max_index = NULL_TREE;
6631         }
6632
6633       constructor_unfilled_index = constructor_index;
6634     }
6635   else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6636     {
6637       /* Vectors are like simple fixed-size arrays.  */
6638       constructor_max_index =
6639         build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
6640       constructor_index = bitsize_zero_node;
6641       constructor_unfilled_index = constructor_index;
6642     }
6643   else
6644     {
6645       /* Handle the case of int x = {5}; */
6646       constructor_fields = constructor_type;
6647       constructor_unfilled_fields = constructor_type;
6648     }
6649 }
6650 \f
6651 /* Push down into a subobject, for initialization.
6652    If this is for an explicit set of braces, IMPLICIT is 0.
6653    If it is because the next element belongs at a lower level,
6654    IMPLICIT is 1 (or 2 if the push is because of designator list).  */
6655
6656 void
6657 push_init_level (int implicit, struct obstack * braced_init_obstack)
6658 {
6659   struct constructor_stack *p;
6660   tree value = NULL_TREE;
6661
6662   /* If we've exhausted any levels that didn't have braces,
6663      pop them now.  If implicit == 1, this will have been done in
6664      process_init_element; do not repeat it here because in the case
6665      of excess initializers for an empty aggregate this leads to an
6666      infinite cycle of popping a level and immediately recreating
6667      it.  */
6668   if (implicit != 1)
6669     {
6670       while (constructor_stack->implicit)
6671         {
6672           if ((TREE_CODE (constructor_type) == RECORD_TYPE
6673                || TREE_CODE (constructor_type) == UNION_TYPE)
6674               && constructor_fields == 0)
6675             process_init_element (pop_init_level (1, braced_init_obstack),
6676                                   true, braced_init_obstack);
6677           else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6678                    && constructor_max_index
6679                    && tree_int_cst_lt (constructor_max_index,
6680                                        constructor_index))
6681             process_init_element (pop_init_level (1, braced_init_obstack),
6682                                   true, braced_init_obstack);
6683           else
6684             break;
6685         }
6686     }
6687
6688   /* Unless this is an explicit brace, we need to preserve previous
6689      content if any.  */
6690   if (implicit)
6691     {
6692       if ((TREE_CODE (constructor_type) == RECORD_TYPE
6693            || TREE_CODE (constructor_type) == UNION_TYPE)
6694           && constructor_fields)
6695         value = find_init_member (constructor_fields, braced_init_obstack);
6696       else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6697         value = find_init_member (constructor_index, braced_init_obstack);
6698     }
6699
6700   p = XNEW (struct constructor_stack);
6701   p->type = constructor_type;
6702   p->fields = constructor_fields;
6703   p->index = constructor_index;
6704   p->max_index = constructor_max_index;
6705   p->unfilled_index = constructor_unfilled_index;
6706   p->unfilled_fields = constructor_unfilled_fields;
6707   p->bit_index = constructor_bit_index;
6708   p->elements = constructor_elements;
6709   p->constant = constructor_constant;
6710   p->simple = constructor_simple;
6711   p->nonconst = constructor_nonconst;
6712   p->erroneous = constructor_erroneous;
6713   p->pending_elts = constructor_pending_elts;
6714   p->depth = constructor_depth;
6715   p->replacement_value.value = 0;
6716   p->replacement_value.original_code = ERROR_MARK;
6717   p->replacement_value.original_type = NULL;
6718   p->implicit = implicit;
6719   p->outer = 0;
6720   p->incremental = constructor_incremental;
6721   p->designated = constructor_designated;
6722   p->next = constructor_stack;
6723   p->range_stack = 0;
6724   constructor_stack = p;
6725
6726   constructor_constant = 1;
6727   constructor_simple = 1;
6728   constructor_nonconst = 0;
6729   constructor_depth = SPELLING_DEPTH ();
6730   constructor_elements = 0;
6731   constructor_incremental = 1;
6732   constructor_designated = 0;
6733   constructor_pending_elts = 0;
6734   if (!implicit)
6735     {
6736       p->range_stack = constructor_range_stack;
6737       constructor_range_stack = 0;
6738       designator_depth = 0;
6739       designator_erroneous = 0;
6740     }
6741
6742   /* Don't die if an entire brace-pair level is superfluous
6743      in the containing level.  */
6744   if (constructor_type == 0)
6745     ;
6746   else if (TREE_CODE (constructor_type) == RECORD_TYPE
6747            || TREE_CODE (constructor_type) == UNION_TYPE)
6748     {
6749       /* Don't die if there are extra init elts at the end.  */
6750       if (constructor_fields == 0)
6751         constructor_type = 0;
6752       else
6753         {
6754           constructor_type = TREE_TYPE (constructor_fields);
6755           push_member_name (constructor_fields);
6756           constructor_depth++;
6757         }
6758     }
6759   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6760     {
6761       constructor_type = TREE_TYPE (constructor_type);
6762       push_array_bounds (tree_low_cst (constructor_index, 1));
6763       constructor_depth++;
6764     }
6765
6766   if (constructor_type == 0)
6767     {
6768       error_init ("extra brace group at end of initializer");
6769       constructor_fields = 0;
6770       constructor_unfilled_fields = 0;
6771       return;
6772     }
6773
6774   if (value && TREE_CODE (value) == CONSTRUCTOR)
6775     {
6776       constructor_constant = TREE_CONSTANT (value);
6777       constructor_simple = TREE_STATIC (value);
6778       constructor_nonconst = CONSTRUCTOR_NON_CONST (value);
6779       constructor_elements = CONSTRUCTOR_ELTS (value);
6780       if (!VEC_empty (constructor_elt, constructor_elements)
6781           && (TREE_CODE (constructor_type) == RECORD_TYPE
6782               || TREE_CODE (constructor_type) == ARRAY_TYPE))
6783         set_nonincremental_init (braced_init_obstack);
6784     }
6785
6786   if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
6787     {
6788       missing_braces_mentioned = 1;
6789       warning_init (OPT_Wmissing_braces, "missing braces around initializer");
6790     }
6791
6792   if (TREE_CODE (constructor_type) == RECORD_TYPE
6793            || TREE_CODE (constructor_type) == UNION_TYPE)
6794     {
6795       constructor_fields = TYPE_FIELDS (constructor_type);
6796       /* Skip any nameless bit fields at the beginning.  */
6797       while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
6798              && DECL_NAME (constructor_fields) == 0)
6799         constructor_fields = DECL_CHAIN (constructor_fields);
6800
6801       constructor_unfilled_fields = constructor_fields;
6802       constructor_bit_index = bitsize_zero_node;
6803     }
6804   else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6805     {
6806       /* Vectors are like simple fixed-size arrays.  */
6807       constructor_max_index =
6808         build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
6809       constructor_index = convert (bitsizetype, integer_zero_node);
6810       constructor_unfilled_index = constructor_index;
6811     }
6812   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6813     {
6814       if (TYPE_DOMAIN (constructor_type))
6815         {
6816           constructor_max_index
6817             = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
6818
6819           /* Detect non-empty initializations of zero-length arrays.  */
6820           if (constructor_max_index == NULL_TREE
6821               && TYPE_SIZE (constructor_type))
6822             constructor_max_index = integer_minus_one_node;
6823
6824           /* constructor_max_index needs to be an INTEGER_CST.  Attempts
6825              to initialize VLAs will cause a proper error; avoid tree
6826              checking errors as well by setting a safe value.  */
6827           if (constructor_max_index
6828               && TREE_CODE (constructor_max_index) != INTEGER_CST)
6829             constructor_max_index = integer_minus_one_node;
6830
6831           constructor_index
6832             = convert (bitsizetype,
6833                        TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6834         }
6835       else
6836         constructor_index = bitsize_zero_node;
6837
6838       constructor_unfilled_index = constructor_index;
6839       if (value && TREE_CODE (value) == STRING_CST)
6840         {
6841           /* We need to split the char/wchar array into individual
6842              characters, so that we don't have to special case it
6843              everywhere.  */
6844           set_nonincremental_init_from_string (value, braced_init_obstack);
6845         }
6846     }
6847   else
6848     {
6849       if (constructor_type != error_mark_node)
6850         warning_init (0, "braces around scalar initializer");
6851       constructor_fields = constructor_type;
6852       constructor_unfilled_fields = constructor_type;
6853     }
6854 }
6855
6856 /* At the end of an implicit or explicit brace level,
6857    finish up that level of constructor.  If a single expression
6858    with redundant braces initialized that level, return the
6859    c_expr structure for that expression.  Otherwise, the original_code
6860    element is set to ERROR_MARK.
6861    If we were outputting the elements as they are read, return 0 as the value
6862    from inner levels (process_init_element ignores that),
6863    but return error_mark_node as the value from the outermost level
6864    (that's what we want to put in DECL_INITIAL).
6865    Otherwise, return a CONSTRUCTOR expression as the value.  */
6866
6867 struct c_expr
6868 pop_init_level (int implicit, struct obstack * braced_init_obstack)
6869 {
6870   struct constructor_stack *p;
6871   struct c_expr ret;
6872   ret.value = 0;
6873   ret.original_code = ERROR_MARK;
6874   ret.original_type = NULL;
6875
6876   if (implicit == 0)
6877     {
6878       /* When we come to an explicit close brace,
6879          pop any inner levels that didn't have explicit braces.  */
6880       while (constructor_stack->implicit)
6881         {
6882           process_init_element (pop_init_level (1, braced_init_obstack),
6883                                 true, braced_init_obstack);
6884         }
6885       gcc_assert (!constructor_range_stack);
6886     }
6887
6888   /* Now output all pending elements.  */
6889   constructor_incremental = 1;
6890   output_pending_init_elements (1, braced_init_obstack);
6891
6892   p = constructor_stack;
6893
6894   /* Error for initializing a flexible array member, or a zero-length
6895      array member in an inappropriate context.  */
6896   if (constructor_type && constructor_fields
6897       && TREE_CODE (constructor_type) == ARRAY_TYPE
6898       && TYPE_DOMAIN (constructor_type)
6899       && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
6900     {
6901       /* Silently discard empty initializations.  The parser will
6902          already have pedwarned for empty brackets.  */
6903       if (integer_zerop (constructor_unfilled_index))
6904         constructor_type = NULL_TREE;
6905       else
6906         {
6907           gcc_assert (!TYPE_SIZE (constructor_type));
6908
6909           if (constructor_depth > 2)
6910             error_init ("initialization of flexible array member in a nested context");
6911           else
6912             pedwarn_init (input_location, OPT_pedantic,
6913                           "initialization of a flexible array member");
6914
6915           /* We have already issued an error message for the existence
6916              of a flexible array member not at the end of the structure.
6917              Discard the initializer so that we do not die later.  */
6918           if (DECL_CHAIN (constructor_fields) != NULL_TREE)
6919             constructor_type = NULL_TREE;
6920         }
6921     }
6922
6923   /* Warn when some struct elements are implicitly initialized to zero.  */
6924   if (warn_missing_field_initializers
6925       && constructor_type
6926       && TREE_CODE (constructor_type) == RECORD_TYPE
6927       && constructor_unfilled_fields)
6928     {
6929         bool constructor_zeroinit =
6930          (VEC_length (constructor_elt, constructor_elements) == 1
6931           && integer_zerop
6932               (VEC_index (constructor_elt, constructor_elements, 0)->value));
6933
6934         /* Do not warn for flexible array members or zero-length arrays.  */
6935         while (constructor_unfilled_fields
6936                && (!DECL_SIZE (constructor_unfilled_fields)
6937                    || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
6938           constructor_unfilled_fields = DECL_CHAIN (constructor_unfilled_fields);
6939
6940         if (constructor_unfilled_fields
6941             /* Do not warn if this level of the initializer uses member
6942                designators; it is likely to be deliberate.  */
6943             && !constructor_designated
6944             /* Do not warn about initializing with ` = {0}'.  */
6945             && !constructor_zeroinit)
6946           {
6947             push_member_name (constructor_unfilled_fields);
6948             warning_init (OPT_Wmissing_field_initializers,
6949                           "missing initializer");
6950             RESTORE_SPELLING_DEPTH (constructor_depth);
6951           }
6952     }
6953
6954   /* Pad out the end of the structure.  */
6955   if (p->replacement_value.value)
6956     /* If this closes a superfluous brace pair,
6957        just pass out the element between them.  */
6958     ret = p->replacement_value;
6959   else if (constructor_type == 0)
6960     ;
6961   else if (TREE_CODE (constructor_type) != RECORD_TYPE
6962            && TREE_CODE (constructor_type) != UNION_TYPE
6963            && TREE_CODE (constructor_type) != ARRAY_TYPE
6964            && TREE_CODE (constructor_type) != VECTOR_TYPE)
6965     {
6966       /* A nonincremental scalar initializer--just return
6967          the element, after verifying there is just one.  */
6968       if (VEC_empty (constructor_elt,constructor_elements))
6969         {
6970           if (!constructor_erroneous)
6971             error_init ("empty scalar initializer");
6972           ret.value = error_mark_node;
6973         }
6974       else if (VEC_length (constructor_elt,constructor_elements) != 1)
6975         {
6976           error_init ("extra elements in scalar initializer");
6977           ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
6978         }
6979       else
6980         ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
6981     }
6982   else
6983     {
6984       if (constructor_erroneous)
6985         ret.value = error_mark_node;
6986       else
6987         {
6988           ret.value = build_constructor (constructor_type,
6989                                          constructor_elements);
6990           if (constructor_constant)
6991             TREE_CONSTANT (ret.value) = 1;
6992           if (constructor_constant && constructor_simple)
6993             TREE_STATIC (ret.value) = 1;
6994           if (constructor_nonconst)
6995             CONSTRUCTOR_NON_CONST (ret.value) = 1;
6996         }
6997     }
6998
6999   if (ret.value && TREE_CODE (ret.value) != CONSTRUCTOR)
7000     {
7001       if (constructor_nonconst)
7002         ret.original_code = C_MAYBE_CONST_EXPR;
7003       else if (ret.original_code == C_MAYBE_CONST_EXPR)
7004         ret.original_code = ERROR_MARK;
7005     }
7006
7007   constructor_type = p->type;
7008   constructor_fields = p->fields;
7009   constructor_index = p->index;
7010   constructor_max_index = p->max_index;
7011   constructor_unfilled_index = p->unfilled_index;
7012   constructor_unfilled_fields = p->unfilled_fields;
7013   constructor_bit_index = p->bit_index;
7014   constructor_elements = p->elements;
7015   constructor_constant = p->constant;
7016   constructor_simple = p->simple;
7017   constructor_nonconst = p->nonconst;
7018   constructor_erroneous = p->erroneous;
7019   constructor_incremental = p->incremental;
7020   constructor_designated = p->designated;
7021   constructor_pending_elts = p->pending_elts;
7022   constructor_depth = p->depth;
7023   if (!p->implicit)
7024     constructor_range_stack = p->range_stack;
7025   RESTORE_SPELLING_DEPTH (constructor_depth);
7026
7027   constructor_stack = p->next;
7028   free (p);
7029
7030   if (ret.value == 0 && constructor_stack == 0)
7031     ret.value = error_mark_node;
7032   return ret;
7033 }
7034
7035 /* Common handling for both array range and field name designators.
7036    ARRAY argument is nonzero for array ranges.  Returns zero for success.  */
7037
7038 static int
7039 set_designator (int array, struct obstack * braced_init_obstack)
7040 {
7041   tree subtype;
7042   enum tree_code subcode;
7043
7044   /* Don't die if an entire brace-pair level is superfluous
7045      in the containing level.  */
7046   if (constructor_type == 0)
7047     return 1;
7048
7049   /* If there were errors in this designator list already, bail out
7050      silently.  */
7051   if (designator_erroneous)
7052     return 1;
7053
7054   if (!designator_depth)
7055     {
7056       gcc_assert (!constructor_range_stack);
7057
7058       /* Designator list starts at the level of closest explicit
7059          braces.  */
7060       while (constructor_stack->implicit)
7061         {
7062           process_init_element (pop_init_level (1, braced_init_obstack),
7063                                 true, braced_init_obstack);
7064         }
7065       constructor_designated = 1;
7066       return 0;
7067     }
7068
7069   switch (TREE_CODE (constructor_type))
7070     {
7071     case  RECORD_TYPE:
7072     case  UNION_TYPE:
7073       subtype = TREE_TYPE (constructor_fields);
7074       if (subtype != error_mark_node)
7075         subtype = TYPE_MAIN_VARIANT (subtype);
7076       break;
7077     case ARRAY_TYPE:
7078       subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
7079       break;
7080     default:
7081       gcc_unreachable ();
7082     }
7083
7084   subcode = TREE_CODE (subtype);
7085   if (array && subcode != ARRAY_TYPE)
7086     {
7087       error_init ("array index in non-array initializer");
7088       return 1;
7089     }
7090   else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
7091     {
7092       error_init ("field name not in record or union initializer");
7093       return 1;
7094     }
7095
7096   constructor_designated = 1;
7097   push_init_level (2, braced_init_obstack);
7098   return 0;
7099 }
7100
7101 /* If there are range designators in designator list, push a new designator
7102    to constructor_range_stack.  RANGE_END is end of such stack range or
7103    NULL_TREE if there is no range designator at this level.  */
7104
7105 static void
7106 push_range_stack (tree range_end, struct obstack * braced_init_obstack)
7107 {
7108   struct constructor_range_stack *p;
7109
7110   p = (struct constructor_range_stack *)
7111     obstack_alloc (braced_init_obstack,
7112                    sizeof (struct constructor_range_stack));
7113   p->prev = constructor_range_stack;
7114   p->next = 0;
7115   p->fields = constructor_fields;
7116   p->range_start = constructor_index;
7117   p->index = constructor_index;
7118   p->stack = constructor_stack;
7119   p->range_end = range_end;
7120   if (constructor_range_stack)
7121     constructor_range_stack->next = p;
7122   constructor_range_stack = p;
7123 }
7124
7125 /* Within an array initializer, specify the next index to be initialized.
7126    FIRST is that index.  If LAST is nonzero, then initialize a range
7127    of indices, running from FIRST through LAST.  */
7128
7129 void
7130 set_init_index (tree first, tree last,
7131                 struct obstack * braced_init_obstack)
7132 {
7133   if (set_designator (1, braced_init_obstack))
7134     return;
7135
7136   designator_erroneous = 1;
7137
7138   if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
7139       || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
7140     {
7141       error_init ("array index in initializer not of integer type");
7142       return;
7143     }
7144
7145   if (TREE_CODE (first) != INTEGER_CST)
7146     {
7147       first = c_fully_fold (first, false, NULL);
7148       if (TREE_CODE (first) == INTEGER_CST)
7149         pedwarn_init (input_location, OPT_pedantic,
7150                       "array index in initializer is not "
7151                       "an integer constant expression");
7152     }
7153
7154   if (last && TREE_CODE (last) != INTEGER_CST)
7155     {
7156       last = c_fully_fold (last, false, NULL);
7157       if (TREE_CODE (last) == INTEGER_CST)
7158         pedwarn_init (input_location, OPT_pedantic,
7159                       "array index in initializer is not "
7160                       "an integer constant expression");
7161     }
7162
7163   if (TREE_CODE (first) != INTEGER_CST)
7164     error_init ("nonconstant array index in initializer");
7165   else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
7166     error_init ("nonconstant array index in initializer");
7167   else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
7168     error_init ("array index in non-array initializer");
7169   else if (tree_int_cst_sgn (first) == -1)
7170     error_init ("array index in initializer exceeds array bounds");
7171   else if (constructor_max_index
7172            && tree_int_cst_lt (constructor_max_index, first))
7173     error_init ("array index in initializer exceeds array bounds");
7174   else
7175     {
7176       constant_expression_warning (first);
7177       if (last)
7178         constant_expression_warning (last);
7179       constructor_index = convert (bitsizetype, first);
7180
7181       if (last)
7182         {
7183           if (tree_int_cst_equal (first, last))
7184             last = 0;
7185           else if (tree_int_cst_lt (last, first))
7186             {
7187               error_init ("empty index range in initializer");
7188               last = 0;
7189             }
7190           else
7191             {
7192               last = convert (bitsizetype, last);
7193               if (constructor_max_index != 0
7194                   && tree_int_cst_lt (constructor_max_index, last))
7195                 {
7196                   error_init ("array index range in initializer exceeds array bounds");
7197                   last = 0;
7198                 }
7199             }
7200         }
7201
7202       designator_depth++;
7203       designator_erroneous = 0;
7204       if (constructor_range_stack || last)
7205         push_range_stack (last, braced_init_obstack);
7206     }
7207 }
7208
7209 /* Within a struct initializer, specify the next field to be initialized.  */
7210
7211 void
7212 set_init_label (tree fieldname, struct obstack * braced_init_obstack)
7213 {
7214   tree field;
7215
7216   if (set_designator (0, braced_init_obstack))
7217     return;
7218
7219   designator_erroneous = 1;
7220
7221   if (TREE_CODE (constructor_type) != RECORD_TYPE
7222       && TREE_CODE (constructor_type) != UNION_TYPE)
7223     {
7224       error_init ("field name not in record or union initializer");
7225       return;
7226     }
7227
7228   field = lookup_field (constructor_type, fieldname);
7229
7230   if (field == 0)
7231     error ("unknown field %qE specified in initializer", fieldname);
7232   else
7233     do
7234       {
7235         constructor_fields = TREE_VALUE (field);
7236         designator_depth++;
7237         designator_erroneous = 0;
7238         if (constructor_range_stack)
7239           push_range_stack (NULL_TREE, braced_init_obstack);
7240         field = TREE_CHAIN (field);
7241         if (field)
7242           {
7243             if (set_designator (0, braced_init_obstack))
7244               return;
7245           }
7246       }
7247     while (field != NULL_TREE);
7248 }
7249 \f
7250 /* Add a new initializer to the tree of pending initializers.  PURPOSE
7251    identifies the initializer, either array index or field in a structure.
7252    VALUE is the value of that index or field.  If ORIGTYPE is not
7253    NULL_TREE, it is the original type of VALUE.
7254
7255    IMPLICIT is true if value comes from pop_init_level (1),
7256    the new initializer has been merged with the existing one
7257    and thus no warnings should be emitted about overriding an
7258    existing initializer.  */
7259
7260 static void
7261 add_pending_init (tree purpose, tree value, tree origtype, bool implicit,
7262                   struct obstack * braced_init_obstack)
7263 {
7264   struct init_node *p, **q, *r;
7265
7266   q = &constructor_pending_elts;
7267   p = 0;
7268
7269   if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7270     {
7271       while (*q != 0)
7272         {
7273           p = *q;
7274           if (tree_int_cst_lt (purpose, p->purpose))
7275             q = &p->left;
7276           else if (tree_int_cst_lt (p->purpose, purpose))
7277             q = &p->right;
7278           else
7279             {
7280               if (!implicit)
7281                 {
7282                   if (TREE_SIDE_EFFECTS (p->value))
7283                     warning_init (0, "initialized field with side-effects overwritten");
7284                   else if (warn_override_init)
7285                     warning_init (OPT_Woverride_init, "initialized field overwritten");
7286                 }
7287               p->value = value;
7288               p->origtype = origtype;
7289               return;
7290             }
7291         }
7292     }
7293   else
7294     {
7295       tree bitpos;
7296
7297       bitpos = bit_position (purpose);
7298       while (*q != NULL)
7299         {
7300           p = *q;
7301           if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
7302             q = &p->left;
7303           else if (p->purpose != purpose)
7304             q = &p->right;
7305           else
7306             {
7307               if (!implicit)
7308                 {
7309                   if (TREE_SIDE_EFFECTS (p->value))
7310                     warning_init (0, "initialized field with side-effects overwritten");
7311                   else if (warn_override_init)
7312                     warning_init (OPT_Woverride_init, "initialized field overwritten");
7313                 }
7314               p->value = value;
7315               p->origtype = origtype;
7316               return;
7317             }
7318         }
7319     }
7320
7321   r = (struct init_node *) obstack_alloc (braced_init_obstack,
7322                                           sizeof (struct init_node));
7323   r->purpose = purpose;
7324   r->value = value;
7325   r->origtype = origtype;
7326
7327   *q = r;
7328   r->parent = p;
7329   r->left = 0;
7330   r->right = 0;
7331   r->balance = 0;
7332
7333   while (p)
7334     {
7335       struct init_node *s;
7336
7337       if (r == p->left)
7338         {
7339           if (p->balance == 0)
7340             p->balance = -1;
7341           else if (p->balance < 0)
7342             {
7343               if (r->balance < 0)
7344                 {
7345                   /* L rotation.  */
7346                   p->left = r->right;
7347                   if (p->left)
7348                     p->left->parent = p;
7349                   r->right = p;
7350
7351                   p->balance = 0;
7352                   r->balance = 0;
7353
7354                   s = p->parent;
7355                   p->parent = r;
7356                   r->parent = s;
7357                   if (s)
7358                     {
7359                       if (s->left == p)
7360                         s->left = r;
7361                       else
7362                         s->right = r;
7363                     }
7364                   else
7365                     constructor_pending_elts = r;
7366                 }
7367               else
7368                 {
7369                   /* LR rotation.  */
7370                   struct init_node *t = r->right;
7371
7372                   r->right = t->left;
7373                   if (r->right)
7374                     r->right->parent = r;
7375                   t->left = r;
7376
7377                   p->left = t->right;
7378                   if (p->left)
7379                     p->left->parent = p;
7380                   t->right = p;
7381
7382                   p->balance = t->balance < 0;
7383                   r->balance = -(t->balance > 0);
7384                   t->balance = 0;
7385
7386                   s = p->parent;
7387                   p->parent = t;
7388                   r->parent = t;
7389                   t->parent = s;
7390                   if (s)
7391                     {
7392                       if (s->left == p)
7393                         s->left = t;
7394                       else
7395                         s->right = t;
7396                     }
7397                   else
7398                     constructor_pending_elts = t;
7399                 }
7400               break;
7401             }
7402           else
7403             {
7404               /* p->balance == +1; growth of left side balances the node.  */
7405               p->balance = 0;
7406               break;
7407             }
7408         }
7409       else /* r == p->right */
7410         {
7411           if (p->balance == 0)
7412             /* Growth propagation from right side.  */
7413             p->balance++;
7414           else if (p->balance > 0)
7415             {
7416               if (r->balance > 0)
7417                 {
7418                   /* R rotation.  */
7419                   p->right = r->left;
7420                   if (p->right)
7421                     p->right->parent = p;
7422                   r->left = p;
7423
7424                   p->balance = 0;
7425                   r->balance = 0;
7426
7427                   s = p->parent;
7428                   p->parent = r;
7429                   r->parent = s;
7430                   if (s)
7431                     {
7432                       if (s->left == p)
7433                         s->left = r;
7434                       else
7435                         s->right = r;
7436                     }
7437                   else
7438                     constructor_pending_elts = r;
7439                 }
7440               else /* r->balance == -1 */
7441                 {
7442                   /* RL rotation */
7443                   struct init_node *t = r->left;
7444
7445                   r->left = t->right;
7446                   if (r->left)
7447                     r->left->parent = r;
7448                   t->right = r;
7449
7450                   p->right = t->left;
7451                   if (p->right)
7452                     p->right->parent = p;
7453                   t->left = p;
7454
7455                   r->balance = (t->balance < 0);
7456                   p->balance = -(t->balance > 0);
7457                   t->balance = 0;
7458
7459                   s = p->parent;
7460                   p->parent = t;
7461                   r->parent = t;
7462                   t->parent = s;
7463                   if (s)
7464                     {
7465                       if (s->left == p)
7466                         s->left = t;
7467                       else
7468                         s->right = t;
7469                     }
7470                   else
7471                     constructor_pending_elts = t;
7472                 }
7473               break;
7474             }
7475           else
7476             {
7477               /* p->balance == -1; growth of right side balances the node.  */
7478               p->balance = 0;
7479               break;
7480             }
7481         }
7482
7483       r = p;
7484       p = p->parent;
7485     }
7486 }
7487
7488 /* Build AVL tree from a sorted chain.  */
7489
7490 static void
7491 set_nonincremental_init (struct obstack * braced_init_obstack)
7492 {
7493   unsigned HOST_WIDE_INT ix;
7494   tree index, value;
7495
7496   if (TREE_CODE (constructor_type) != RECORD_TYPE
7497       && TREE_CODE (constructor_type) != ARRAY_TYPE)
7498     return;
7499
7500   FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
7501     {
7502       add_pending_init (index, value, NULL_TREE, false,
7503                         braced_init_obstack);
7504     }
7505   constructor_elements = 0;
7506   if (TREE_CODE (constructor_type) == RECORD_TYPE)
7507     {
7508       constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
7509       /* Skip any nameless bit fields at the beginning.  */
7510       while (constructor_unfilled_fields != 0
7511              && DECL_C_BIT_FIELD (constructor_unfilled_fields)
7512              && DECL_NAME (constructor_unfilled_fields) == 0)
7513         constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
7514
7515     }
7516   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7517     {
7518       if (TYPE_DOMAIN (constructor_type))
7519         constructor_unfilled_index
7520             = convert (bitsizetype,
7521                        TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
7522       else
7523         constructor_unfilled_index = bitsize_zero_node;
7524     }
7525   constructor_incremental = 0;
7526 }
7527
7528 /* Build AVL tree from a string constant.  */
7529
7530 static void
7531 set_nonincremental_init_from_string (tree str,
7532                                      struct obstack * braced_init_obstack)
7533 {
7534   tree value, purpose, type;
7535   HOST_WIDE_INT val[2];
7536   const char *p, *end;
7537   int byte, wchar_bytes, charwidth, bitpos;
7538
7539   gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
7540
7541   wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
7542   charwidth = TYPE_PRECISION (char_type_node);
7543   type = TREE_TYPE (constructor_type);
7544   p = TREE_STRING_POINTER (str);
7545   end = p + TREE_STRING_LENGTH (str);
7546
7547   for (purpose = bitsize_zero_node;
7548        p < end && !tree_int_cst_lt (constructor_max_index, purpose);
7549        purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
7550     {
7551       if (wchar_bytes == 1)
7552         {
7553           val[1] = (unsigned char) *p++;
7554           val[0] = 0;
7555         }
7556       else
7557         {
7558           val[0] = 0;
7559           val[1] = 0;
7560           for (byte = 0; byte < wchar_bytes; byte++)
7561             {
7562               if (BYTES_BIG_ENDIAN)
7563                 bitpos = (wchar_bytes - byte - 1) * charwidth;
7564               else
7565                 bitpos = byte * charwidth;
7566               val[bitpos < HOST_BITS_PER_WIDE_INT]
7567                 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
7568                    << (bitpos % HOST_BITS_PER_WIDE_INT);
7569             }
7570         }
7571
7572       if (!TYPE_UNSIGNED (type))
7573         {
7574           bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
7575           if (bitpos < HOST_BITS_PER_WIDE_INT)
7576             {
7577               if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
7578                 {
7579                   val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
7580                   val[0] = -1;
7581                 }
7582             }
7583           else if (bitpos == HOST_BITS_PER_WIDE_INT)
7584             {
7585               if (val[1] < 0)
7586                 val[0] = -1;
7587             }
7588           else if (val[0] & (((HOST_WIDE_INT) 1)
7589                              << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
7590             val[0] |= ((HOST_WIDE_INT) -1)
7591                       << (bitpos - HOST_BITS_PER_WIDE_INT);
7592         }
7593
7594       value = build_int_cst_wide (type, val[1], val[0]);
7595       add_pending_init (purpose, value, NULL_TREE, false,
7596                         braced_init_obstack);
7597     }
7598
7599   constructor_incremental = 0;
7600 }
7601
7602 /* Return value of FIELD in pending initializer or zero if the field was
7603    not initialized yet.  */
7604
7605 static tree
7606 find_init_member (tree field, struct obstack * braced_init_obstack)
7607 {
7608   struct init_node *p;
7609
7610   if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7611     {
7612       if (constructor_incremental
7613           && tree_int_cst_lt (field, constructor_unfilled_index))
7614         set_nonincremental_init (braced_init_obstack);
7615
7616       p = constructor_pending_elts;
7617       while (p)
7618         {
7619           if (tree_int_cst_lt (field, p->purpose))
7620             p = p->left;
7621           else if (tree_int_cst_lt (p->purpose, field))
7622             p = p->right;
7623           else
7624             return p->value;
7625         }
7626     }
7627   else if (TREE_CODE (constructor_type) == RECORD_TYPE)
7628     {
7629       tree bitpos = bit_position (field);
7630
7631       if (constructor_incremental
7632           && (!constructor_unfilled_fields
7633               || tree_int_cst_lt (bitpos,
7634                                   bit_position (constructor_unfilled_fields))))
7635         set_nonincremental_init (braced_init_obstack);
7636
7637       p = constructor_pending_elts;
7638       while (p)
7639         {
7640           if (field == p->purpose)
7641             return p->value;
7642           else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
7643             p = p->left;
7644           else
7645             p = p->right;
7646         }
7647     }
7648   else if (TREE_CODE (constructor_type) == UNION_TYPE)
7649     {
7650       if (!VEC_empty (constructor_elt, constructor_elements)
7651           && (VEC_last (constructor_elt, constructor_elements)->index
7652               == field))
7653         return VEC_last (constructor_elt, constructor_elements)->value;
7654     }
7655   return 0;
7656 }
7657
7658 /* "Output" the next constructor element.
7659    At top level, really output it to assembler code now.
7660    Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
7661    If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
7662    TYPE is the data type that the containing data type wants here.
7663    FIELD is the field (a FIELD_DECL) or the index that this element fills.
7664    If VALUE is a string constant, STRICT_STRING is true if it is
7665    unparenthesized or we should not warn here for it being parenthesized.
7666    For other types of VALUE, STRICT_STRING is not used.
7667
7668    PENDING if non-nil means output pending elements that belong
7669    right after this element.  (PENDING is normally 1;
7670    it is 0 while outputting pending elements, to avoid recursion.)
7671
7672    IMPLICIT is true if value comes from pop_init_level (1),
7673    the new initializer has been merged with the existing one
7674    and thus no warnings should be emitted about overriding an
7675    existing initializer.  */
7676
7677 static void
7678 output_init_element (tree value, tree origtype, bool strict_string, tree type,
7679                      tree field, int pending, bool implicit,
7680                      struct obstack * braced_init_obstack)
7681 {
7682   tree semantic_type = NULL_TREE;
7683   constructor_elt *celt;
7684   bool maybe_const = true;
7685   bool npc;
7686
7687   if (type == error_mark_node || value == error_mark_node)
7688     {
7689       constructor_erroneous = 1;
7690       return;
7691     }
7692   if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
7693       && (TREE_CODE (value) == STRING_CST
7694           || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
7695       && !(TREE_CODE (value) == STRING_CST
7696            && TREE_CODE (type) == ARRAY_TYPE
7697            && INTEGRAL_TYPE_P (TREE_TYPE (type)))
7698       && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
7699                      TYPE_MAIN_VARIANT (type)))
7700     value = array_to_pointer_conversion (input_location, value);
7701
7702   if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
7703       && require_constant_value && !flag_isoc99 && pending)
7704     {
7705       /* As an extension, allow initializing objects with static storage
7706          duration with compound literals (which are then treated just as
7707          the brace enclosed list they contain).  */
7708       tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
7709       value = DECL_INITIAL (decl);
7710     }
7711
7712   npc = null_pointer_constant_p (value);
7713   if (TREE_CODE (value) == EXCESS_PRECISION_EXPR)
7714     {
7715       semantic_type = TREE_TYPE (value);
7716       value = TREE_OPERAND (value, 0);
7717     }
7718   value = c_fully_fold (value, require_constant_value, &maybe_const);
7719
7720   if (value == error_mark_node)
7721     constructor_erroneous = 1;
7722   else if (!TREE_CONSTANT (value))
7723     constructor_constant = 0;
7724   else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
7725            || ((TREE_CODE (constructor_type) == RECORD_TYPE
7726                 || TREE_CODE (constructor_type) == UNION_TYPE)
7727                && DECL_C_BIT_FIELD (field)
7728                && TREE_CODE (value) != INTEGER_CST))
7729     constructor_simple = 0;
7730   if (!maybe_const)
7731     constructor_nonconst = 1;
7732
7733   if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
7734     {
7735       if (require_constant_value)
7736         {
7737           error_init ("initializer element is not constant");
7738           value = error_mark_node;
7739         }
7740       else if (require_constant_elements)
7741         pedwarn (input_location, 0,
7742                  "initializer element is not computable at load time");
7743     }
7744   else if (!maybe_const
7745            && (require_constant_value || require_constant_elements))
7746     pedwarn_init (input_location, 0,
7747                   "initializer element is not a constant expression");
7748
7749   /* Issue -Wc++-compat warnings about initializing a bitfield with
7750      enum type.  */
7751   if (warn_cxx_compat
7752       && field != NULL_TREE
7753       && TREE_CODE (field) == FIELD_DECL
7754       && DECL_BIT_FIELD_TYPE (field) != NULL_TREE
7755       && (TYPE_MAIN_VARIANT (DECL_BIT_FIELD_TYPE (field))
7756           != TYPE_MAIN_VARIANT (type))
7757       && TREE_CODE (DECL_BIT_FIELD_TYPE (field)) == ENUMERAL_TYPE)
7758     {
7759       tree checktype = origtype != NULL_TREE ? origtype : TREE_TYPE (value);
7760       if (checktype != error_mark_node
7761           && (TYPE_MAIN_VARIANT (checktype)
7762               != TYPE_MAIN_VARIANT (DECL_BIT_FIELD_TYPE (field))))
7763         warning_init (OPT_Wc___compat,
7764                       "enum conversion in initialization is invalid in C++");
7765     }
7766
7767   /* If this field is empty (and not at the end of structure),
7768      don't do anything other than checking the initializer.  */
7769   if (field
7770       && (TREE_TYPE (field) == error_mark_node
7771           || (COMPLETE_TYPE_P (TREE_TYPE (field))
7772               && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
7773               && (TREE_CODE (constructor_type) == ARRAY_TYPE
7774                   || DECL_CHAIN (field)))))
7775     return;
7776
7777   if (semantic_type)
7778     value = build1 (EXCESS_PRECISION_EXPR, semantic_type, value);
7779   value = digest_init (input_location, type, value, origtype, npc,
7780                        strict_string, require_constant_value);
7781   if (value == error_mark_node)
7782     {
7783       constructor_erroneous = 1;
7784       return;
7785     }
7786   if (require_constant_value || require_constant_elements)
7787     constant_expression_warning (value);
7788
7789   /* If this element doesn't come next in sequence,
7790      put it on constructor_pending_elts.  */
7791   if (TREE_CODE (constructor_type) == ARRAY_TYPE
7792       && (!constructor_incremental
7793           || !tree_int_cst_equal (field, constructor_unfilled_index)))
7794     {
7795       if (constructor_incremental
7796           && tree_int_cst_lt (field, constructor_unfilled_index))
7797         set_nonincremental_init (braced_init_obstack);
7798
7799       add_pending_init (field, value, origtype, implicit,
7800                         braced_init_obstack);
7801       return;
7802     }
7803   else if (TREE_CODE (constructor_type) == RECORD_TYPE
7804            && (!constructor_incremental
7805                || field != constructor_unfilled_fields))
7806     {
7807       /* We do this for records but not for unions.  In a union,
7808          no matter which field is specified, it can be initialized
7809          right away since it starts at the beginning of the union.  */
7810       if (constructor_incremental)
7811         {
7812           if (!constructor_unfilled_fields)
7813             set_nonincremental_init (braced_init_obstack);
7814           else
7815             {
7816               tree bitpos, unfillpos;
7817
7818               bitpos = bit_position (field);
7819               unfillpos = bit_position (constructor_unfilled_fields);
7820
7821               if (tree_int_cst_lt (bitpos, unfillpos))
7822                 set_nonincremental_init (braced_init_obstack);
7823             }
7824         }
7825
7826       add_pending_init (field, value, origtype, implicit,
7827                         braced_init_obstack);
7828       return;
7829     }
7830   else if (TREE_CODE (constructor_type) == UNION_TYPE
7831            && !VEC_empty (constructor_elt, constructor_elements))
7832     {
7833       if (!implicit)
7834         {
7835           if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
7836                                            constructor_elements)->value))
7837             warning_init (0,
7838                           "initialized field with side-effects overwritten");
7839           else if (warn_override_init)
7840             warning_init (OPT_Woverride_init, "initialized field overwritten");
7841         }
7842
7843       /* We can have just one union field set.  */
7844       constructor_elements = 0;
7845     }
7846
7847   /* Otherwise, output this element either to
7848      constructor_elements or to the assembler file.  */
7849
7850   celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
7851   celt->index = field;
7852   celt->value = value;
7853
7854   /* Advance the variable that indicates sequential elements output.  */
7855   if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7856     constructor_unfilled_index
7857       = size_binop_loc (input_location, PLUS_EXPR, constructor_unfilled_index,
7858                         bitsize_one_node);
7859   else if (TREE_CODE (constructor_type) == RECORD_TYPE)
7860     {
7861       constructor_unfilled_fields
7862         = DECL_CHAIN (constructor_unfilled_fields);
7863
7864       /* Skip any nameless bit fields.  */
7865       while (constructor_unfilled_fields != 0
7866              && DECL_C_BIT_FIELD (constructor_unfilled_fields)
7867              && DECL_NAME (constructor_unfilled_fields) == 0)
7868         constructor_unfilled_fields =
7869           DECL_CHAIN (constructor_unfilled_fields);
7870     }
7871   else if (TREE_CODE (constructor_type) == UNION_TYPE)
7872     constructor_unfilled_fields = 0;
7873
7874   /* Now output any pending elements which have become next.  */
7875   if (pending)
7876     output_pending_init_elements (0, braced_init_obstack);
7877 }
7878
7879 /* Output any pending elements which have become next.
7880    As we output elements, constructor_unfilled_{fields,index}
7881    advances, which may cause other elements to become next;
7882    if so, they too are output.
7883
7884    If ALL is 0, we return when there are
7885    no more pending elements to output now.
7886
7887    If ALL is 1, we output space as necessary so that
7888    we can output all the pending elements.  */
7889 static void
7890 output_pending_init_elements (int all, struct obstack * braced_init_obstack)
7891 {
7892   struct init_node *elt = constructor_pending_elts;
7893   tree next;
7894
7895  retry:
7896
7897   /* Look through the whole pending tree.
7898      If we find an element that should be output now,
7899      output it.  Otherwise, set NEXT to the element
7900      that comes first among those still pending.  */
7901
7902   next = 0;
7903   while (elt)
7904     {
7905       if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7906         {
7907           if (tree_int_cst_equal (elt->purpose,
7908                                   constructor_unfilled_index))
7909             output_init_element (elt->value, elt->origtype, true,
7910                                  TREE_TYPE (constructor_type),
7911                                  constructor_unfilled_index, 0, false,
7912                                  braced_init_obstack);
7913           else if (tree_int_cst_lt (constructor_unfilled_index,
7914                                     elt->purpose))
7915             {
7916               /* Advance to the next smaller node.  */
7917               if (elt->left)
7918                 elt = elt->left;
7919               else
7920                 {
7921                   /* We have reached the smallest node bigger than the
7922                      current unfilled index.  Fill the space first.  */
7923                   next = elt->purpose;
7924                   break;
7925                 }
7926             }
7927           else
7928             {
7929               /* Advance to the next bigger node.  */
7930               if (elt->right)
7931                 elt = elt->right;
7932               else
7933                 {
7934                   /* We have reached the biggest node in a subtree.  Find
7935                      the parent of it, which is the next bigger node.  */
7936                   while (elt->parent && elt->parent->right == elt)
7937                     elt = elt->parent;
7938                   elt = elt->parent;
7939                   if (elt && tree_int_cst_lt (constructor_unfilled_index,
7940                                               elt->purpose))
7941                     {
7942                       next = elt->purpose;
7943                       break;
7944                     }
7945                 }
7946             }
7947         }
7948       else if (TREE_CODE (constructor_type) == RECORD_TYPE
7949                || TREE_CODE (constructor_type) == UNION_TYPE)
7950         {
7951           tree ctor_unfilled_bitpos, elt_bitpos;
7952
7953           /* If the current record is complete we are done.  */
7954           if (constructor_unfilled_fields == 0)
7955             break;
7956
7957           ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
7958           elt_bitpos = bit_position (elt->purpose);
7959           /* We can't compare fields here because there might be empty
7960              fields in between.  */
7961           if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
7962             {
7963               constructor_unfilled_fields = elt->purpose;
7964               output_init_element (elt->value, elt->origtype, true,
7965                                    TREE_TYPE (elt->purpose),
7966                                    elt->purpose, 0, false,
7967                                    braced_init_obstack);
7968             }
7969           else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
7970             {
7971               /* Advance to the next smaller node.  */
7972               if (elt->left)
7973                 elt = elt->left;
7974               else
7975                 {
7976                   /* We have reached the smallest node bigger than the
7977                      current unfilled field.  Fill the space first.  */
7978                   next = elt->purpose;
7979                   break;
7980                 }
7981             }
7982           else
7983             {
7984               /* Advance to the next bigger node.  */
7985               if (elt->right)
7986                 elt = elt->right;
7987               else
7988                 {
7989                   /* We have reached the biggest node in a subtree.  Find
7990                      the parent of it, which is the next bigger node.  */
7991                   while (elt->parent && elt->parent->right == elt)
7992                     elt = elt->parent;
7993                   elt = elt->parent;
7994                   if (elt
7995                       && (tree_int_cst_lt (ctor_unfilled_bitpos,
7996                                            bit_position (elt->purpose))))
7997                     {
7998                       next = elt->purpose;
7999                       break;
8000                     }
8001                 }
8002             }
8003         }
8004     }
8005
8006   /* Ordinarily return, but not if we want to output all
8007      and there are elements left.  */
8008   if (!(all && next != 0))
8009     return;
8010
8011   /* If it's not incremental, just skip over the gap, so that after
8012      jumping to retry we will output the next successive element.  */
8013   if (TREE_CODE (constructor_type) == RECORD_TYPE
8014       || TREE_CODE (constructor_type) == UNION_TYPE)
8015     constructor_unfilled_fields = next;
8016   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
8017     constructor_unfilled_index = next;
8018
8019   /* ELT now points to the node in the pending tree with the next
8020      initializer to output.  */
8021   goto retry;
8022 }
8023 \f
8024 /* Add one non-braced element to the current constructor level.
8025    This adjusts the current position within the constructor's type.
8026    This may also start or terminate implicit levels
8027    to handle a partly-braced initializer.
8028
8029    Once this has found the correct level for the new element,
8030    it calls output_init_element.
8031
8032    IMPLICIT is true if value comes from pop_init_level (1),
8033    the new initializer has been merged with the existing one
8034    and thus no warnings should be emitted about overriding an
8035    existing initializer.  */
8036
8037 void
8038 process_init_element (struct c_expr value, bool implicit,
8039                       struct obstack * braced_init_obstack)
8040 {
8041   tree orig_value = value.value;
8042   int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
8043   bool strict_string = value.original_code == STRING_CST;
8044
8045   designator_depth = 0;
8046   designator_erroneous = 0;
8047
8048   /* Handle superfluous braces around string cst as in
8049      char x[] = {"foo"}; */
8050   if (string_flag
8051       && constructor_type
8052       && TREE_CODE (constructor_type) == ARRAY_TYPE
8053       && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
8054       && integer_zerop (constructor_unfilled_index))
8055     {
8056       if (constructor_stack->replacement_value.value)
8057         error_init ("excess elements in char array initializer");
8058       constructor_stack->replacement_value = value;
8059       return;
8060     }
8061
8062   if (constructor_stack->replacement_value.value != 0)
8063     {
8064       error_init ("excess elements in struct initializer");
8065       return;
8066     }
8067
8068   /* Ignore elements of a brace group if it is entirely superfluous
8069      and has already been diagnosed.  */
8070   if (constructor_type == 0)
8071     return;
8072
8073   /* If we've exhausted any levels that didn't have braces,
8074      pop them now.  */
8075   while (constructor_stack->implicit)
8076     {
8077       if ((TREE_CODE (constructor_type) == RECORD_TYPE
8078            || TREE_CODE (constructor_type) == UNION_TYPE)
8079           && constructor_fields == 0)
8080         process_init_element (pop_init_level (1, braced_init_obstack),
8081                               true, braced_init_obstack);
8082       else if ((TREE_CODE (constructor_type) == ARRAY_TYPE
8083                 || TREE_CODE (constructor_type) == VECTOR_TYPE)
8084                && (constructor_max_index == 0
8085                    || tree_int_cst_lt (constructor_max_index,
8086                                        constructor_index)))
8087         process_init_element (pop_init_level (1, braced_init_obstack),
8088                               true, braced_init_obstack);
8089       else
8090         break;
8091     }
8092
8093   /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once.  */
8094   if (constructor_range_stack)
8095     {
8096       /* If value is a compound literal and we'll be just using its
8097          content, don't put it into a SAVE_EXPR.  */
8098       if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
8099           || !require_constant_value
8100           || flag_isoc99)
8101         {
8102           tree semantic_type = NULL_TREE;
8103           if (TREE_CODE (value.value) == EXCESS_PRECISION_EXPR)
8104             {
8105               semantic_type = TREE_TYPE (value.value);
8106               value.value = TREE_OPERAND (value.value, 0);
8107             }
8108           value.value = c_save_expr (value.value);
8109           if (semantic_type)
8110             value.value = build1 (EXCESS_PRECISION_EXPR, semantic_type,
8111                                   value.value);
8112         }
8113     }
8114
8115   while (1)
8116     {
8117       if (TREE_CODE (constructor_type) == RECORD_TYPE)
8118         {
8119           tree fieldtype;
8120           enum tree_code fieldcode;
8121
8122           if (constructor_fields == 0)
8123             {
8124               pedwarn_init (input_location, 0,
8125                             "excess elements in struct initializer");
8126               break;
8127             }
8128
8129           fieldtype = TREE_TYPE (constructor_fields);
8130           if (fieldtype != error_mark_node)
8131             fieldtype = TYPE_MAIN_VARIANT (fieldtype);
8132           fieldcode = TREE_CODE (fieldtype);
8133
8134           /* Error for non-static initialization of a flexible array member.  */
8135           if (fieldcode == ARRAY_TYPE
8136               && !require_constant_value
8137               && TYPE_SIZE (fieldtype) == NULL_TREE
8138               && DECL_CHAIN (constructor_fields) == NULL_TREE)
8139             {
8140               error_init ("non-static initialization of a flexible array member");
8141               break;
8142             }
8143
8144           /* Accept a string constant to initialize a subarray.  */
8145           if (value.value != 0
8146               && fieldcode == ARRAY_TYPE
8147               && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
8148               && string_flag)
8149             value.value = orig_value;
8150           /* Otherwise, if we have come to a subaggregate,
8151              and we don't have an element of its type, push into it.  */
8152           else if (value.value != 0
8153                    && value.value != error_mark_node
8154                    && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
8155                    && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
8156                        || fieldcode == UNION_TYPE || fieldcode == VECTOR_TYPE))
8157             {
8158               push_init_level (1, braced_init_obstack);
8159               continue;
8160             }
8161
8162           if (value.value)
8163             {
8164               push_member_name (constructor_fields);
8165               output_init_element (value.value, value.original_type,
8166                                    strict_string, fieldtype,
8167                                    constructor_fields, 1, implicit,
8168                                    braced_init_obstack);
8169               RESTORE_SPELLING_DEPTH (constructor_depth);
8170             }
8171           else
8172             /* Do the bookkeeping for an element that was
8173                directly output as a constructor.  */
8174             {
8175               /* For a record, keep track of end position of last field.  */
8176               if (DECL_SIZE (constructor_fields))
8177                 constructor_bit_index
8178                   = size_binop_loc (input_location, PLUS_EXPR,
8179                                     bit_position (constructor_fields),
8180                                     DECL_SIZE (constructor_fields));
8181
8182               /* If the current field was the first one not yet written out,
8183                  it isn't now, so update.  */
8184               if (constructor_unfilled_fields == constructor_fields)
8185                 {
8186                   constructor_unfilled_fields = DECL_CHAIN (constructor_fields);
8187                   /* Skip any nameless bit fields.  */
8188                   while (constructor_unfilled_fields != 0
8189                          && DECL_C_BIT_FIELD (constructor_unfilled_fields)
8190                          && DECL_NAME (constructor_unfilled_fields) == 0)
8191                     constructor_unfilled_fields =
8192                       DECL_CHAIN (constructor_unfilled_fields);
8193                 }
8194             }
8195
8196           constructor_fields = DECL_CHAIN (constructor_fields);
8197           /* Skip any nameless bit fields at the beginning.  */
8198           while (constructor_fields != 0
8199                  && DECL_C_BIT_FIELD (constructor_fields)
8200                  && DECL_NAME (constructor_fields) == 0)
8201             constructor_fields = DECL_CHAIN (constructor_fields);
8202         }
8203       else if (TREE_CODE (constructor_type) == UNION_TYPE)
8204         {
8205           tree fieldtype;
8206           enum tree_code fieldcode;
8207
8208           if (constructor_fields == 0)
8209             {
8210               pedwarn_init (input_location, 0,
8211                             "excess elements in union initializer");
8212               break;
8213             }
8214
8215           fieldtype = TREE_TYPE (constructor_fields);
8216           if (fieldtype != error_mark_node)
8217             fieldtype = TYPE_MAIN_VARIANT (fieldtype);
8218           fieldcode = TREE_CODE (fieldtype);
8219
8220           /* Warn that traditional C rejects initialization of unions.
8221              We skip the warning if the value is zero.  This is done
8222              under the assumption that the zero initializer in user
8223              code appears conditioned on e.g. __STDC__ to avoid
8224              "missing initializer" warnings and relies on default
8225              initialization to zero in the traditional C case.
8226              We also skip the warning if the initializer is designated,
8227              again on the assumption that this must be conditional on
8228              __STDC__ anyway (and we've already complained about the
8229              member-designator already).  */
8230           if (!in_system_header && !constructor_designated
8231               && !(value.value && (integer_zerop (value.value)
8232                                    || real_zerop (value.value))))
8233             warning (OPT_Wtraditional, "traditional C rejects initialization "
8234                      "of unions");
8235
8236           /* Accept a string constant to initialize a subarray.  */
8237           if (value.value != 0
8238               && fieldcode == ARRAY_TYPE
8239               && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
8240               && string_flag)
8241             value.value = orig_value;
8242           /* Otherwise, if we have come to a subaggregate,
8243              and we don't have an element of its type, push into it.  */
8244           else if (value.value != 0
8245                    && value.value != error_mark_node
8246                    && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
8247                    && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
8248                        || fieldcode == UNION_TYPE || fieldcode == VECTOR_TYPE))
8249             {
8250               push_init_level (1, braced_init_obstack);
8251               continue;
8252             }
8253
8254           if (value.value)
8255             {
8256               push_member_name (constructor_fields);
8257               output_init_element (value.value, value.original_type,
8258                                    strict_string, fieldtype,
8259                                    constructor_fields, 1, implicit,
8260                                    braced_init_obstack);
8261               RESTORE_SPELLING_DEPTH (constructor_depth);
8262             }
8263           else
8264             /* Do the bookkeeping for an element that was
8265                directly output as a constructor.  */
8266             {
8267               constructor_bit_index = DECL_SIZE (constructor_fields);
8268               constructor_unfilled_fields = DECL_CHAIN (constructor_fields);
8269             }
8270
8271           constructor_fields = 0;
8272         }
8273       else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
8274         {
8275           tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
8276           enum tree_code eltcode = TREE_CODE (elttype);
8277
8278           /* Accept a string constant to initialize a subarray.  */
8279           if (value.value != 0
8280               && eltcode == ARRAY_TYPE
8281               && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
8282               && string_flag)
8283             value.value = orig_value;
8284           /* Otherwise, if we have come to a subaggregate,
8285              and we don't have an element of its type, push into it.  */
8286           else if (value.value != 0
8287                    && value.value != error_mark_node
8288                    && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
8289                    && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
8290                        || eltcode == UNION_TYPE || eltcode == VECTOR_TYPE))
8291             {
8292               push_init_level (1, braced_init_obstack);
8293               continue;
8294             }
8295
8296           if (constructor_max_index != 0
8297               && (tree_int_cst_lt (constructor_max_index, constructor_index)
8298                   || integer_all_onesp (constructor_max_index)))
8299             {
8300               pedwarn_init (input_location, 0,
8301                             "excess elements in array initializer");
8302               break;
8303             }
8304
8305           /* Now output the actual element.  */
8306           if (value.value)
8307             {
8308               push_array_bounds (tree_low_cst (constructor_index, 1));
8309               output_init_element (value.value, value.original_type,
8310                                    strict_string, elttype,
8311                                    constructor_index, 1, implicit,
8312                                    braced_init_obstack);
8313               RESTORE_SPELLING_DEPTH (constructor_depth);
8314             }
8315
8316           constructor_index
8317             = size_binop_loc (input_location, PLUS_EXPR,
8318                               constructor_index, bitsize_one_node);
8319
8320           if (!value.value)
8321             /* If we are doing the bookkeeping for an element that was
8322                directly output as a constructor, we must update
8323                constructor_unfilled_index.  */
8324             constructor_unfilled_index = constructor_index;
8325         }
8326       else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
8327         {
8328           tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
8329
8330          /* Do a basic check of initializer size.  Note that vectors
8331             always have a fixed size derived from their type.  */
8332           if (tree_int_cst_lt (constructor_max_index, constructor_index))
8333             {
8334               pedwarn_init (input_location, 0,
8335                             "excess elements in vector initializer");
8336               break;
8337             }
8338
8339           /* Now output the actual element.  */
8340           if (value.value)
8341             {
8342               if (TREE_CODE (value.value) == VECTOR_CST)
8343                 elttype = TYPE_MAIN_VARIANT (constructor_type);
8344               output_init_element (value.value, value.original_type,
8345                                    strict_string, elttype,
8346                                    constructor_index, 1, implicit,
8347                                    braced_init_obstack);
8348             }
8349
8350           constructor_index
8351             = size_binop_loc (input_location,
8352                               PLUS_EXPR, constructor_index, bitsize_one_node);
8353
8354           if (!value.value)
8355             /* If we are doing the bookkeeping for an element that was
8356                directly output as a constructor, we must update
8357                constructor_unfilled_index.  */
8358             constructor_unfilled_index = constructor_index;
8359         }
8360
8361       /* Handle the sole element allowed in a braced initializer
8362          for a scalar variable.  */
8363       else if (constructor_type != error_mark_node
8364                && constructor_fields == 0)
8365         {
8366           pedwarn_init (input_location, 0,
8367                         "excess elements in scalar initializer");
8368           break;
8369         }
8370       else
8371         {
8372           if (value.value)
8373             output_init_element (value.value, value.original_type,
8374                                  strict_string, constructor_type,
8375                                  NULL_TREE, 1, implicit,
8376                                  braced_init_obstack);
8377           constructor_fields = 0;
8378         }
8379
8380       /* Handle range initializers either at this level or anywhere higher
8381          in the designator stack.  */
8382       if (constructor_range_stack)
8383         {
8384           struct constructor_range_stack *p, *range_stack;
8385           int finish = 0;
8386
8387           range_stack = constructor_range_stack;
8388           constructor_range_stack = 0;
8389           while (constructor_stack != range_stack->stack)
8390             {
8391               gcc_assert (constructor_stack->implicit);
8392               process_init_element (pop_init_level (1,
8393                                                     braced_init_obstack),
8394                                     true, braced_init_obstack);
8395             }
8396           for (p = range_stack;
8397                !p->range_end || tree_int_cst_equal (p->index, p->range_end);
8398                p = p->prev)
8399             {
8400               gcc_assert (constructor_stack->implicit);
8401               process_init_element (pop_init_level (1, braced_init_obstack),
8402                                     true, braced_init_obstack);
8403             }
8404
8405           p->index = size_binop_loc (input_location,
8406                                      PLUS_EXPR, p->index, bitsize_one_node);
8407           if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
8408             finish = 1;
8409
8410           while (1)
8411             {
8412               constructor_index = p->index;
8413               constructor_fields = p->fields;
8414               if (finish && p->range_end && p->index == p->range_start)
8415                 {
8416                   finish = 0;
8417                   p->prev = 0;
8418                 }
8419               p = p->next;
8420               if (!p)
8421                 break;
8422               push_init_level (2, braced_init_obstack);
8423               p->stack = constructor_stack;
8424               if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
8425                 p->index = p->range_start;
8426             }
8427
8428           if (!finish)
8429             constructor_range_stack = range_stack;
8430           continue;
8431         }
8432
8433       break;
8434     }
8435
8436   constructor_range_stack = 0;
8437 }
8438 \f
8439 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
8440    (guaranteed to be 'volatile' or null) and ARGS (represented using
8441    an ASM_EXPR node).  */
8442 tree
8443 build_asm_stmt (tree cv_qualifier, tree args)
8444 {
8445   if (!ASM_VOLATILE_P (args) && cv_qualifier)
8446     ASM_VOLATILE_P (args) = 1;
8447   return add_stmt (args);
8448 }
8449
8450 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
8451    some INPUTS, and some CLOBBERS.  The latter three may be NULL.
8452    SIMPLE indicates whether there was anything at all after the
8453    string in the asm expression -- asm("blah") and asm("blah" : )
8454    are subtly different.  We use a ASM_EXPR node to represent this.  */
8455 tree
8456 build_asm_expr (location_t loc, tree string, tree outputs, tree inputs,
8457                 tree clobbers, tree labels, bool simple)
8458 {
8459   tree tail;
8460   tree args;
8461   int i;
8462   const char *constraint;
8463   const char **oconstraints;
8464   bool allows_mem, allows_reg, is_inout;
8465   int ninputs, noutputs;
8466
8467   ninputs = list_length (inputs);
8468   noutputs = list_length (outputs);
8469   oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
8470
8471   string = resolve_asm_operand_names (string, outputs, inputs, labels);
8472
8473   /* Remove output conversions that change the type but not the mode.  */
8474   for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
8475     {
8476       tree output = TREE_VALUE (tail);
8477
8478       /* ??? Really, this should not be here.  Users should be using a
8479          proper lvalue, dammit.  But there's a long history of using casts
8480          in the output operands.  In cases like longlong.h, this becomes a
8481          primitive form of typechecking -- if the cast can be removed, then
8482          the output operand had a type of the proper width; otherwise we'll
8483          get an error.  Gross, but ...  */
8484       STRIP_NOPS (output);
8485
8486       if (!lvalue_or_else (loc, output, lv_asm))
8487         output = error_mark_node;
8488
8489       if (output != error_mark_node
8490           && (TREE_READONLY (output)
8491               || TYPE_READONLY (TREE_TYPE (output))
8492               || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
8493                    || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
8494                   && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
8495         readonly_error (output, lv_asm);
8496
8497       constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
8498       oconstraints[i] = constraint;
8499
8500       if (parse_output_constraint (&constraint, i, ninputs, noutputs,
8501                                    &allows_mem, &allows_reg, &is_inout))
8502         {
8503           /* If the operand is going to end up in memory,
8504              mark it addressable.  */
8505           if (!allows_reg && !c_mark_addressable (output))
8506             output = error_mark_node;
8507           if (!(!allows_reg && allows_mem)
8508               && output != error_mark_node
8509               && VOID_TYPE_P (TREE_TYPE (output)))
8510             {
8511               error_at (loc, "invalid use of void expression");
8512               output = error_mark_node;
8513             }
8514         }
8515       else
8516         output = error_mark_node;
8517
8518       TREE_VALUE (tail) = output;
8519     }
8520
8521   for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
8522     {
8523       tree input;
8524
8525       constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
8526       input = TREE_VALUE (tail);
8527
8528       if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
8529                                   oconstraints, &allows_mem, &allows_reg))
8530         {
8531           /* If the operand is going to end up in memory,
8532              mark it addressable.  */
8533           if (!allows_reg && allows_mem)
8534             {
8535               /* Strip the nops as we allow this case.  FIXME, this really
8536                  should be rejected or made deprecated.  */
8537               STRIP_NOPS (input);
8538               if (!c_mark_addressable (input))
8539                 input = error_mark_node;
8540             }
8541           else if (input != error_mark_node && VOID_TYPE_P (TREE_TYPE (input)))
8542             {
8543               error_at (loc, "invalid use of void expression");
8544               input = error_mark_node;
8545             }
8546         }
8547       else
8548         input = error_mark_node;
8549
8550       TREE_VALUE (tail) = input;
8551     }
8552
8553   /* ASMs with labels cannot have outputs.  This should have been
8554      enforced by the parser.  */
8555   gcc_assert (outputs == NULL || labels == NULL);
8556
8557   args = build_stmt (loc, ASM_EXPR, string, outputs, inputs, clobbers, labels);
8558
8559   /* asm statements without outputs, including simple ones, are treated
8560      as volatile.  */
8561   ASM_INPUT_P (args) = simple;
8562   ASM_VOLATILE_P (args) = (noutputs == 0);
8563
8564   return args;
8565 }
8566 \f
8567 /* Generate a goto statement to LABEL.  LOC is the location of the
8568    GOTO.  */
8569
8570 tree
8571 c_finish_goto_label (location_t loc, tree label)
8572 {
8573   tree decl = lookup_label_for_goto (loc, label);
8574   if (!decl)
8575     return NULL_TREE;
8576   TREE_USED (decl) = 1;
8577   {
8578     tree t = build1 (GOTO_EXPR, void_type_node, decl);
8579     SET_EXPR_LOCATION (t, loc);
8580     return add_stmt (t);
8581   }
8582 }
8583
8584 /* Generate a computed goto statement to EXPR.  LOC is the location of
8585    the GOTO.  */
8586
8587 tree
8588 c_finish_goto_ptr (location_t loc, tree expr)
8589 {
8590   tree t;
8591   pedwarn (loc, OPT_pedantic, "ISO C forbids %<goto *expr;%>");
8592   expr = c_fully_fold (expr, false, NULL);
8593   expr = convert (ptr_type_node, expr);
8594   t = build1 (GOTO_EXPR, void_type_node, expr);
8595   SET_EXPR_LOCATION (t, loc);
8596   return add_stmt (t);
8597 }
8598
8599 /* Generate a C `return' statement.  RETVAL is the expression for what
8600    to return, or a null pointer for `return;' with no value.  LOC is
8601    the location of the return statement.  If ORIGTYPE is not NULL_TREE, it
8602    is the original type of RETVAL.  */
8603
8604 tree
8605 c_finish_return (location_t loc, tree retval, tree origtype)
8606 {
8607   tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
8608   bool no_warning = false;
8609   bool npc = false;
8610
8611   if (TREE_THIS_VOLATILE (current_function_decl))
8612     warning_at (loc, 0,
8613                 "function declared %<noreturn%> has a %<return%> statement");
8614
8615   if (retval)
8616     {
8617       tree semantic_type = NULL_TREE;
8618       npc = null_pointer_constant_p (retval);
8619       if (TREE_CODE (retval) == EXCESS_PRECISION_EXPR)
8620         {
8621           semantic_type = TREE_TYPE (retval);
8622           retval = TREE_OPERAND (retval, 0);
8623         }
8624       retval = c_fully_fold (retval, false, NULL);
8625       if (semantic_type)
8626         retval = build1 (EXCESS_PRECISION_EXPR, semantic_type, retval);
8627     }
8628
8629   if (!retval)
8630     {
8631       current_function_returns_null = 1;
8632       if ((warn_return_type || flag_isoc99)
8633           && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
8634         {
8635           pedwarn_c99 (loc, flag_isoc99 ? 0 : OPT_Wreturn_type,
8636                        "%<return%> with no value, in "
8637                        "function returning non-void");
8638           no_warning = true;
8639         }
8640     }
8641   else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
8642     {
8643       current_function_returns_null = 1;
8644       if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
8645         pedwarn (loc, 0,
8646                  "%<return%> with a value, in function returning void");
8647       else
8648         pedwarn (loc, OPT_pedantic, "ISO C forbids "
8649                  "%<return%> with expression, in function returning void");
8650     }
8651   else
8652     {
8653       tree t = convert_for_assignment (loc, valtype, retval, origtype,
8654                                        ic_return,
8655                                        npc, NULL_TREE, NULL_TREE, 0);
8656       tree res = DECL_RESULT (current_function_decl);
8657       tree inner;
8658
8659       current_function_returns_value = 1;
8660       if (t == error_mark_node)
8661         return NULL_TREE;
8662
8663       inner = t = convert (TREE_TYPE (res), t);
8664
8665       /* Strip any conversions, additions, and subtractions, and see if
8666          we are returning the address of a local variable.  Warn if so.  */
8667       while (1)
8668         {
8669           switch (TREE_CODE (inner))
8670             {
8671             CASE_CONVERT:
8672             case NON_LVALUE_EXPR:
8673             case PLUS_EXPR:
8674             case POINTER_PLUS_EXPR:
8675               inner = TREE_OPERAND (inner, 0);
8676               continue;
8677
8678             case MINUS_EXPR:
8679               /* If the second operand of the MINUS_EXPR has a pointer
8680                  type (or is converted from it), this may be valid, so
8681                  don't give a warning.  */
8682               {
8683                 tree op1 = TREE_OPERAND (inner, 1);
8684
8685                 while (!POINTER_TYPE_P (TREE_TYPE (op1))
8686                        && (CONVERT_EXPR_P (op1)
8687                            || TREE_CODE (op1) == NON_LVALUE_EXPR))
8688                   op1 = TREE_OPERAND (op1, 0);
8689
8690                 if (POINTER_TYPE_P (TREE_TYPE (op1)))
8691                   break;
8692
8693                 inner = TREE_OPERAND (inner, 0);
8694                 continue;
8695               }
8696
8697             case ADDR_EXPR:
8698               inner = TREE_OPERAND (inner, 0);
8699
8700               while (REFERENCE_CLASS_P (inner)
8701                      && TREE_CODE (inner) != INDIRECT_REF)
8702                 inner = TREE_OPERAND (inner, 0);
8703
8704               if (DECL_P (inner)
8705                   && !DECL_EXTERNAL (inner)
8706                   && !TREE_STATIC (inner)
8707                   && DECL_CONTEXT (inner) == current_function_decl)
8708                 warning_at (loc,
8709                             0, "function returns address of local variable");
8710               break;
8711
8712             default:
8713               break;
8714             }
8715
8716           break;
8717         }
8718
8719       retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
8720       SET_EXPR_LOCATION (retval, loc);
8721
8722       if (warn_sequence_point)
8723         verify_sequence_points (retval);
8724     }
8725
8726   ret_stmt = build_stmt (loc, RETURN_EXPR, retval);
8727   TREE_NO_WARNING (ret_stmt) |= no_warning;
8728   return add_stmt (ret_stmt);
8729 }
8730 \f
8731 struct c_switch {
8732   /* The SWITCH_EXPR being built.  */
8733   tree switch_expr;
8734
8735   /* The original type of the testing expression, i.e. before the
8736      default conversion is applied.  */
8737   tree orig_type;
8738
8739   /* A splay-tree mapping the low element of a case range to the high
8740      element, or NULL_TREE if there is no high element.  Used to
8741      determine whether or not a new case label duplicates an old case
8742      label.  We need a tree, rather than simply a hash table, because
8743      of the GNU case range extension.  */
8744   splay_tree cases;
8745
8746   /* The bindings at the point of the switch.  This is used for
8747      warnings crossing decls when branching to a case label.  */
8748   struct c_spot_bindings *bindings;
8749
8750   /* The next node on the stack.  */
8751   struct c_switch *next;
8752 };
8753
8754 /* A stack of the currently active switch statements.  The innermost
8755    switch statement is on the top of the stack.  There is no need to
8756    mark the stack for garbage collection because it is only active
8757    during the processing of the body of a function, and we never
8758    collect at that point.  */
8759
8760 struct c_switch *c_switch_stack;
8761
8762 /* Start a C switch statement, testing expression EXP.  Return the new
8763    SWITCH_EXPR.  SWITCH_LOC is the location of the `switch'.
8764    SWITCH_COND_LOC is the location of the switch's condition.  */
8765
8766 tree
8767 c_start_case (location_t switch_loc,
8768               location_t switch_cond_loc,
8769               tree exp)
8770 {
8771   tree orig_type = error_mark_node;
8772   struct c_switch *cs;
8773
8774   if (exp != error_mark_node)
8775     {
8776       orig_type = TREE_TYPE (exp);
8777
8778       if (!INTEGRAL_TYPE_P (orig_type))
8779         {
8780           if (orig_type != error_mark_node)
8781             {
8782               error_at (switch_cond_loc, "switch quantity not an integer");
8783               orig_type = error_mark_node;
8784             }
8785           exp = integer_zero_node;
8786         }
8787       else
8788         {
8789           tree type = TYPE_MAIN_VARIANT (orig_type);
8790
8791           if (!in_system_header
8792               && (type == long_integer_type_node
8793                   || type == long_unsigned_type_node))
8794             warning_at (switch_cond_loc,
8795                         OPT_Wtraditional, "%<long%> switch expression not "
8796                         "converted to %<int%> in ISO C");
8797
8798           exp = c_fully_fold (exp, false, NULL);
8799           exp = default_conversion (exp);
8800
8801           if (warn_sequence_point)
8802             verify_sequence_points (exp);
8803         }
8804     }
8805
8806   /* Add this new SWITCH_EXPR to the stack.  */
8807   cs = XNEW (struct c_switch);
8808   cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
8809   SET_EXPR_LOCATION (cs->switch_expr, switch_loc);
8810   cs->orig_type = orig_type;
8811   cs->cases = splay_tree_new (case_compare, NULL, NULL);
8812   cs->bindings = c_get_switch_bindings ();
8813   cs->next = c_switch_stack;
8814   c_switch_stack = cs;
8815
8816   return add_stmt (cs->switch_expr);
8817 }
8818
8819 /* Process a case label at location LOC.  */
8820
8821 tree
8822 do_case (location_t loc, tree low_value, tree high_value)
8823 {
8824   tree label = NULL_TREE;
8825
8826   if (low_value && TREE_CODE (low_value) != INTEGER_CST)
8827     {
8828       low_value = c_fully_fold (low_value, false, NULL);
8829       if (TREE_CODE (low_value) == INTEGER_CST)
8830         pedwarn (input_location, OPT_pedantic,
8831                  "case label is not an integer constant expression");
8832     }
8833
8834   if (high_value && TREE_CODE (high_value) != INTEGER_CST)
8835     {
8836       high_value = c_fully_fold (high_value, false, NULL);
8837       if (TREE_CODE (high_value) == INTEGER_CST)
8838         pedwarn (input_location, OPT_pedantic,
8839                  "case label is not an integer constant expression");
8840     }
8841
8842   if (c_switch_stack == NULL)
8843     {
8844       if (low_value)
8845         error_at (loc, "case label not within a switch statement");
8846       else
8847         error_at (loc, "%<default%> label not within a switch statement");
8848       return NULL_TREE;
8849     }
8850
8851   if (c_check_switch_jump_warnings (c_switch_stack->bindings,
8852                                     EXPR_LOCATION (c_switch_stack->switch_expr),
8853                                     loc))
8854     return NULL_TREE;
8855
8856   label = c_add_case_label (loc, c_switch_stack->cases,
8857                             SWITCH_COND (c_switch_stack->switch_expr),
8858                             c_switch_stack->orig_type,
8859                             low_value, high_value);
8860   if (label == error_mark_node)
8861     label = NULL_TREE;
8862   return label;
8863 }
8864
8865 /* Finish the switch statement.  */
8866
8867 void
8868 c_finish_case (tree body)
8869 {
8870   struct c_switch *cs = c_switch_stack;
8871   location_t switch_location;
8872
8873   SWITCH_BODY (cs->switch_expr) = body;
8874
8875   /* Emit warnings as needed.  */
8876   switch_location = EXPR_LOCATION (cs->switch_expr);
8877   c_do_switch_warnings (cs->cases, switch_location,
8878                         TREE_TYPE (cs->switch_expr),
8879                         SWITCH_COND (cs->switch_expr));
8880
8881   /* Pop the stack.  */
8882   c_switch_stack = cs->next;
8883   splay_tree_delete (cs->cases);
8884   c_release_switch_bindings (cs->bindings);
8885   XDELETE (cs);
8886 }
8887 \f
8888 /* Emit an if statement.  IF_LOCUS is the location of the 'if'.  COND,
8889    THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
8890    may be null.  NESTED_IF is true if THEN_BLOCK contains another IF
8891    statement, and was not surrounded with parenthesis.  */
8892
8893 void
8894 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
8895                   tree else_block, bool nested_if)
8896 {
8897   tree stmt;
8898
8899   /* Diagnose an ambiguous else if if-then-else is nested inside if-then.  */
8900   if (warn_parentheses && nested_if && else_block == NULL)
8901     {
8902       tree inner_if = then_block;
8903
8904       /* We know from the grammar productions that there is an IF nested
8905          within THEN_BLOCK.  Due to labels and c99 conditional declarations,
8906          it might not be exactly THEN_BLOCK, but should be the last
8907          non-container statement within.  */
8908       while (1)
8909         switch (TREE_CODE (inner_if))
8910           {
8911           case COND_EXPR:
8912             goto found;
8913           case BIND_EXPR:
8914             inner_if = BIND_EXPR_BODY (inner_if);
8915             break;
8916           case STATEMENT_LIST:
8917             inner_if = expr_last (then_block);
8918             break;
8919           case TRY_FINALLY_EXPR:
8920           case TRY_CATCH_EXPR:
8921             inner_if = TREE_OPERAND (inner_if, 0);
8922             break;
8923           default:
8924             gcc_unreachable ();
8925           }
8926     found:
8927
8928       if (COND_EXPR_ELSE (inner_if))
8929          warning_at (if_locus, OPT_Wparentheses,
8930                      "suggest explicit braces to avoid ambiguous %<else%>");
8931     }
8932
8933   stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
8934   SET_EXPR_LOCATION (stmt, if_locus);
8935   add_stmt (stmt);
8936 }
8937
8938 /* Emit a general-purpose loop construct.  START_LOCUS is the location of
8939    the beginning of the loop.  COND is the loop condition.  COND_IS_FIRST
8940    is false for DO loops.  INCR is the FOR increment expression.  BODY is
8941    the statement controlled by the loop.  BLAB is the break label.  CLAB is
8942    the continue label.  Everything is allowed to be NULL.  */
8943
8944 void
8945 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
8946                tree blab, tree clab, bool cond_is_first)
8947 {
8948   tree entry = NULL, exit = NULL, t;
8949
8950   /* If the condition is zero don't generate a loop construct.  */
8951   if (cond && integer_zerop (cond))
8952     {
8953       if (cond_is_first)
8954         {
8955           t = build_and_jump (&blab);
8956           SET_EXPR_LOCATION (t, start_locus);
8957           add_stmt (t);
8958         }
8959     }
8960   else
8961     {
8962       tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
8963
8964       /* If we have an exit condition, then we build an IF with gotos either
8965          out of the loop, or to the top of it.  If there's no exit condition,
8966          then we just build a jump back to the top.  */
8967       exit = build_and_jump (&LABEL_EXPR_LABEL (top));
8968
8969       if (cond && !integer_nonzerop (cond))
8970         {
8971           /* Canonicalize the loop condition to the end.  This means
8972              generating a branch to the loop condition.  Reuse the
8973              continue label, if possible.  */
8974           if (cond_is_first)
8975             {
8976               if (incr || !clab)
8977                 {
8978                   entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
8979                   t = build_and_jump (&LABEL_EXPR_LABEL (entry));
8980                 }
8981               else
8982                 t = build1 (GOTO_EXPR, void_type_node, clab);
8983               SET_EXPR_LOCATION (t, start_locus);
8984               add_stmt (t);
8985             }
8986
8987           t = build_and_jump (&blab);
8988           if (cond_is_first)
8989             exit = fold_build3_loc (start_locus,
8990                                 COND_EXPR, void_type_node, cond, exit, t);
8991           else
8992             exit = fold_build3_loc (input_location,
8993                                 COND_EXPR, void_type_node, cond, exit, t);
8994         }
8995
8996       add_stmt (top);
8997     }
8998
8999   if (body)
9000     add_stmt (body);
9001   if (clab)
9002     add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
9003   if (incr)
9004     add_stmt (incr);
9005   if (entry)
9006     add_stmt (entry);
9007   if (exit)
9008     add_stmt (exit);
9009   if (blab)
9010     add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
9011 }
9012
9013 tree
9014 c_finish_bc_stmt (location_t loc, tree *label_p, bool is_break)
9015 {
9016   bool skip;
9017   tree label = *label_p;
9018
9019   /* In switch statements break is sometimes stylistically used after
9020      a return statement.  This can lead to spurious warnings about
9021      control reaching the end of a non-void function when it is
9022      inlined.  Note that we are calling block_may_fallthru with
9023      language specific tree nodes; this works because
9024      block_may_fallthru returns true when given something it does not
9025      understand.  */
9026   skip = !block_may_fallthru (cur_stmt_list);
9027
9028   if (!label)
9029     {
9030       if (!skip)
9031         *label_p = label = create_artificial_label (loc);
9032     }
9033   else if (TREE_CODE (label) == LABEL_DECL)
9034     ;
9035   else switch (TREE_INT_CST_LOW (label))
9036     {
9037     case 0:
9038       if (is_break)
9039         error_at (loc, "break statement not within loop or switch");
9040       else
9041         error_at (loc, "continue statement not within a loop");
9042       return NULL_TREE;
9043
9044     case 1:
9045       gcc_assert (is_break);
9046       error_at (loc, "break statement used with OpenMP for loop");
9047       return NULL_TREE;
9048
9049     default:
9050       gcc_unreachable ();
9051     }
9052
9053   if (skip)
9054     return NULL_TREE;
9055
9056   if (!is_break)
9057     add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
9058
9059   return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
9060 }
9061
9062 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr.  */
9063
9064 static void
9065 emit_side_effect_warnings (location_t loc, tree expr)
9066 {
9067   if (expr == error_mark_node)
9068     ;
9069   else if (!TREE_SIDE_EFFECTS (expr))
9070     {
9071       if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
9072         warning_at (loc, OPT_Wunused_value, "statement with no effect");
9073     }
9074   else
9075     warn_if_unused_value (expr, loc);
9076 }
9077
9078 /* Process an expression as if it were a complete statement.  Emit
9079    diagnostics, but do not call ADD_STMT.  LOC is the location of the
9080    statement.  */
9081
9082 tree
9083 c_process_expr_stmt (location_t loc, tree expr)
9084 {
9085   tree exprv;
9086
9087   if (!expr)
9088     return NULL_TREE;
9089
9090   expr = c_fully_fold (expr, false, NULL);
9091
9092   if (warn_sequence_point)
9093     verify_sequence_points (expr);
9094
9095   if (TREE_TYPE (expr) != error_mark_node
9096       && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
9097       && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
9098     error_at (loc, "expression statement has incomplete type");
9099
9100   /* If we're not processing a statement expression, warn about unused values.
9101      Warnings for statement expressions will be emitted later, once we figure
9102      out which is the result.  */
9103   if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
9104       && warn_unused_value)
9105     emit_side_effect_warnings (loc, expr);
9106
9107   exprv = expr;
9108   while (TREE_CODE (exprv) == COMPOUND_EXPR)
9109     exprv = TREE_OPERAND (exprv, 1);
9110   if (DECL_P (exprv) || handled_component_p (exprv))
9111     mark_exp_read (exprv);
9112
9113   /* If the expression is not of a type to which we cannot assign a line
9114      number, wrap the thing in a no-op NOP_EXPR.  */
9115   if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
9116     {
9117       expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
9118       SET_EXPR_LOCATION (expr, loc);
9119     }
9120
9121   return expr;
9122 }
9123
9124 /* Emit an expression as a statement.  LOC is the location of the
9125    expression.  */
9126
9127 tree
9128 c_finish_expr_stmt (location_t loc, tree expr)
9129 {
9130   if (expr)
9131     return add_stmt (c_process_expr_stmt (loc, expr));
9132   else
9133     return NULL;
9134 }
9135
9136 /* Do the opposite and emit a statement as an expression.  To begin,
9137    create a new binding level and return it.  */
9138
9139 tree
9140 c_begin_stmt_expr (void)
9141 {
9142   tree ret;
9143
9144   /* We must force a BLOCK for this level so that, if it is not expanded
9145      later, there is a way to turn off the entire subtree of blocks that
9146      are contained in it.  */
9147   keep_next_level ();
9148   ret = c_begin_compound_stmt (true);
9149
9150   c_bindings_start_stmt_expr (c_switch_stack == NULL
9151                               ? NULL
9152                               : c_switch_stack->bindings);
9153
9154   /* Mark the current statement list as belonging to a statement list.  */
9155   STATEMENT_LIST_STMT_EXPR (ret) = 1;
9156
9157   return ret;
9158 }
9159
9160 /* LOC is the location of the compound statement to which this body
9161    belongs.  */
9162
9163 tree
9164 c_finish_stmt_expr (location_t loc, tree body)
9165 {
9166   tree last, type, tmp, val;
9167   tree *last_p;
9168
9169   body = c_end_compound_stmt (loc, body, true);
9170
9171   c_bindings_end_stmt_expr (c_switch_stack == NULL
9172                             ? NULL
9173                             : c_switch_stack->bindings);
9174
9175   /* Locate the last statement in BODY.  See c_end_compound_stmt
9176      about always returning a BIND_EXPR.  */
9177   last_p = &BIND_EXPR_BODY (body);
9178   last = BIND_EXPR_BODY (body);
9179
9180  continue_searching:
9181   if (TREE_CODE (last) == STATEMENT_LIST)
9182     {
9183       tree_stmt_iterator i;
9184
9185       /* This can happen with degenerate cases like ({ }).  No value.  */
9186       if (!TREE_SIDE_EFFECTS (last))
9187         return body;
9188
9189       /* If we're supposed to generate side effects warnings, process
9190          all of the statements except the last.  */
9191       if (warn_unused_value)
9192         {
9193           for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
9194             {
9195               location_t tloc;
9196               tree t = tsi_stmt (i);
9197
9198               tloc = EXPR_HAS_LOCATION (t) ? EXPR_LOCATION (t) : loc;
9199               emit_side_effect_warnings (tloc, t);
9200             }
9201         }
9202       else
9203         i = tsi_last (last);
9204       last_p = tsi_stmt_ptr (i);
9205       last = *last_p;
9206     }
9207
9208   /* If the end of the list is exception related, then the list was split
9209      by a call to push_cleanup.  Continue searching.  */
9210   if (TREE_CODE (last) == TRY_FINALLY_EXPR
9211       || TREE_CODE (last) == TRY_CATCH_EXPR)
9212     {
9213       last_p = &TREE_OPERAND (last, 0);
9214       last = *last_p;
9215       goto continue_searching;
9216     }
9217
9218   if (last == error_mark_node)
9219     return last;
9220
9221   /* In the case that the BIND_EXPR is not necessary, return the
9222      expression out from inside it.  */
9223   if (last == BIND_EXPR_BODY (body)
9224       && BIND_EXPR_VARS (body) == NULL)
9225     {
9226       /* Even if this looks constant, do not allow it in a constant
9227          expression.  */
9228       last = c_wrap_maybe_const (last, true);
9229       /* Do not warn if the return value of a statement expression is
9230          unused.  */
9231       TREE_NO_WARNING (last) = 1;
9232       return last;
9233     }
9234
9235   /* Extract the type of said expression.  */
9236   type = TREE_TYPE (last);
9237
9238   /* If we're not returning a value at all, then the BIND_EXPR that
9239      we already have is a fine expression to return.  */
9240   if (!type || VOID_TYPE_P (type))
9241     return body;
9242
9243   /* Now that we've located the expression containing the value, it seems
9244      silly to make voidify_wrapper_expr repeat the process.  Create a
9245      temporary of the appropriate type and stick it in a TARGET_EXPR.  */
9246   tmp = create_tmp_var_raw (type, NULL);
9247
9248   /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt.  This avoids
9249      tree_expr_nonnegative_p giving up immediately.  */
9250   val = last;
9251   if (TREE_CODE (val) == NOP_EXPR
9252       && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
9253     val = TREE_OPERAND (val, 0);
9254
9255   *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
9256   SET_EXPR_LOCATION (*last_p, EXPR_LOCATION (last));
9257
9258   {
9259     tree t = build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
9260     SET_EXPR_LOCATION (t, loc);
9261     return t;
9262   }
9263 }
9264 \f
9265 /* Begin and end compound statements.  This is as simple as pushing
9266    and popping new statement lists from the tree.  */
9267
9268 tree
9269 c_begin_compound_stmt (bool do_scope)
9270 {
9271   tree stmt = push_stmt_list ();
9272   if (do_scope)
9273     push_scope ();
9274   return stmt;
9275 }
9276
9277 /* End a compound statement.  STMT is the statement.  LOC is the
9278    location of the compound statement-- this is usually the location
9279    of the opening brace.  */
9280
9281 tree
9282 c_end_compound_stmt (location_t loc, tree stmt, bool do_scope)
9283 {
9284   tree block = NULL;
9285
9286   if (do_scope)
9287     {
9288       if (c_dialect_objc ())
9289         objc_clear_super_receiver ();
9290       block = pop_scope ();
9291     }
9292
9293   stmt = pop_stmt_list (stmt);
9294   stmt = c_build_bind_expr (loc, block, stmt);
9295
9296   /* If this compound statement is nested immediately inside a statement
9297      expression, then force a BIND_EXPR to be created.  Otherwise we'll
9298      do the wrong thing for ({ { 1; } }) or ({ 1; { } }).  In particular,
9299      STATEMENT_LISTs merge, and thus we can lose track of what statement
9300      was really last.  */
9301   if (cur_stmt_list
9302       && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
9303       && TREE_CODE (stmt) != BIND_EXPR)
9304     {
9305       stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
9306       TREE_SIDE_EFFECTS (stmt) = 1;
9307       SET_EXPR_LOCATION (stmt, loc);
9308     }
9309
9310   return stmt;
9311 }
9312
9313 /* Queue a cleanup.  CLEANUP is an expression/statement to be executed
9314    when the current scope is exited.  EH_ONLY is true when this is not
9315    meant to apply to normal control flow transfer.  */
9316
9317 void
9318 push_cleanup (tree decl, tree cleanup, bool eh_only)
9319 {
9320   enum tree_code code;
9321   tree stmt, list;
9322   bool stmt_expr;
9323
9324   code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
9325   stmt = build_stmt (DECL_SOURCE_LOCATION (decl), code, NULL, cleanup);
9326   add_stmt (stmt);
9327   stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
9328   list = push_stmt_list ();
9329   TREE_OPERAND (stmt, 0) = list;
9330   STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
9331 }
9332 \f
9333 /* Build a binary-operation expression without default conversions.
9334    CODE is the kind of expression to build.
9335    LOCATION is the operator's location.
9336    This function differs from `build' in several ways:
9337    the data type of the result is computed and recorded in it,
9338    warnings are generated if arg data types are invalid,
9339    special handling for addition and subtraction of pointers is known,
9340    and some optimization is done (operations on narrow ints
9341    are done in the narrower type when that gives the same result).
9342    Constant folding is also done before the result is returned.
9343
9344    Note that the operands will never have enumeral types, or function
9345    or array types, because either they will have the default conversions
9346    performed or they have both just been converted to some other type in which
9347    the arithmetic is to be done.  */
9348
9349 tree
9350 build_binary_op (location_t location, enum tree_code code,
9351                  tree orig_op0, tree orig_op1, int convert_p)
9352 {
9353   tree type0, type1, orig_type0, orig_type1;
9354   tree eptype;
9355   enum tree_code code0, code1;
9356   tree op0, op1;
9357   tree ret = error_mark_node;
9358   const char *invalid_op_diag;
9359   bool op0_int_operands, op1_int_operands;
9360   bool int_const, int_const_or_overflow, int_operands;
9361
9362   /* Expression code to give to the expression when it is built.
9363      Normally this is CODE, which is what the caller asked for,
9364      but in some special cases we change it.  */
9365   enum tree_code resultcode = code;
9366
9367   /* Data type in which the computation is to be performed.
9368      In the simplest cases this is the common type of the arguments.  */
9369   tree result_type = NULL;
9370
9371   /* When the computation is in excess precision, the type of the
9372      final EXCESS_PRECISION_EXPR.  */
9373   tree semantic_result_type = NULL;
9374
9375   /* Nonzero means operands have already been type-converted
9376      in whatever way is necessary.
9377      Zero means they need to be converted to RESULT_TYPE.  */
9378   int converted = 0;
9379
9380   /* Nonzero means create the expression with this type, rather than
9381      RESULT_TYPE.  */
9382   tree build_type = 0;
9383
9384   /* Nonzero means after finally constructing the expression
9385      convert it to this type.  */
9386   tree final_type = 0;
9387
9388   /* Nonzero if this is an operation like MIN or MAX which can
9389      safely be computed in short if both args are promoted shorts.
9390      Also implies COMMON.
9391      -1 indicates a bitwise operation; this makes a difference
9392      in the exact conditions for when it is safe to do the operation
9393      in a narrower mode.  */
9394   int shorten = 0;
9395
9396   /* Nonzero if this is a comparison operation;
9397      if both args are promoted shorts, compare the original shorts.
9398      Also implies COMMON.  */
9399   int short_compare = 0;
9400
9401   /* Nonzero if this is a right-shift operation, which can be computed on the
9402      original short and then promoted if the operand is a promoted short.  */
9403   int short_shift = 0;
9404
9405   /* Nonzero means set RESULT_TYPE to the common type of the args.  */
9406   int common = 0;
9407
9408   /* True means types are compatible as far as ObjC is concerned.  */
9409   bool objc_ok;
9410
9411   /* True means this is an arithmetic operation that may need excess
9412      precision.  */
9413   bool may_need_excess_precision;
9414
9415   /* True means this is a boolean operation that converts both its
9416      operands to truth-values.  */
9417   bool boolean_op = false;
9418
9419   if (location == UNKNOWN_LOCATION)
9420     location = input_location;
9421
9422   op0 = orig_op0;
9423   op1 = orig_op1;
9424
9425   op0_int_operands = EXPR_INT_CONST_OPERANDS (orig_op0);
9426   if (op0_int_operands)
9427     op0 = remove_c_maybe_const_expr (op0);
9428   op1_int_operands = EXPR_INT_CONST_OPERANDS (orig_op1);
9429   if (op1_int_operands)
9430     op1 = remove_c_maybe_const_expr (op1);
9431   int_operands = (op0_int_operands && op1_int_operands);
9432   if (int_operands)
9433     {
9434       int_const_or_overflow = (TREE_CODE (orig_op0) == INTEGER_CST
9435                                && TREE_CODE (orig_op1) == INTEGER_CST);
9436       int_const = (int_const_or_overflow
9437                    && !TREE_OVERFLOW (orig_op0)
9438                    && !TREE_OVERFLOW (orig_op1));
9439     }
9440   else
9441     int_const = int_const_or_overflow = false;
9442
9443   if (convert_p)
9444     {
9445       op0 = default_conversion (op0);
9446       op1 = default_conversion (op1);
9447     }
9448
9449   orig_type0 = type0 = TREE_TYPE (op0);
9450   orig_type1 = type1 = TREE_TYPE (op1);
9451
9452   /* The expression codes of the data types of the arguments tell us
9453      whether the arguments are integers, floating, pointers, etc.  */
9454   code0 = TREE_CODE (type0);
9455   code1 = TREE_CODE (type1);
9456
9457   /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue.  */
9458   STRIP_TYPE_NOPS (op0);
9459   STRIP_TYPE_NOPS (op1);
9460
9461   /* If an error was already reported for one of the arguments,
9462      avoid reporting another error.  */
9463
9464   if (code0 == ERROR_MARK || code1 == ERROR_MARK)
9465     return error_mark_node;
9466
9467   if ((invalid_op_diag
9468        = targetm.invalid_binary_op (code, type0, type1)))
9469     {
9470       error_at (location, invalid_op_diag);
9471       return error_mark_node;
9472     }
9473
9474   switch (code)
9475     {
9476     case PLUS_EXPR:
9477     case MINUS_EXPR:
9478     case MULT_EXPR:
9479     case TRUNC_DIV_EXPR:
9480     case CEIL_DIV_EXPR:
9481     case FLOOR_DIV_EXPR:
9482     case ROUND_DIV_EXPR:
9483     case EXACT_DIV_EXPR:
9484       may_need_excess_precision = true;
9485       break;
9486     default:
9487       may_need_excess_precision = false;
9488       break;
9489     }
9490   if (TREE_CODE (op0) == EXCESS_PRECISION_EXPR)
9491     {
9492       op0 = TREE_OPERAND (op0, 0);
9493       type0 = TREE_TYPE (op0);
9494     }
9495   else if (may_need_excess_precision
9496            && (eptype = excess_precision_type (type0)) != NULL_TREE)
9497     {
9498       type0 = eptype;
9499       op0 = convert (eptype, op0);
9500     }
9501   if (TREE_CODE (op1) == EXCESS_PRECISION_EXPR)
9502     {
9503       op1 = TREE_OPERAND (op1, 0);
9504       type1 = TREE_TYPE (op1);
9505     }
9506   else if (may_need_excess_precision
9507            && (eptype = excess_precision_type (type1)) != NULL_TREE)
9508     {
9509       type1 = eptype;
9510       op1 = convert (eptype, op1);
9511     }
9512
9513   objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
9514
9515   switch (code)
9516     {
9517     case PLUS_EXPR:
9518       /* Handle the pointer + int case.  */
9519       if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9520         {
9521           ret = pointer_int_sum (location, PLUS_EXPR, op0, op1);
9522           goto return_build_binary_op;
9523         }
9524       else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
9525         {
9526           ret = pointer_int_sum (location, PLUS_EXPR, op1, op0);
9527           goto return_build_binary_op;
9528         }
9529       else
9530         common = 1;
9531       break;
9532
9533     case MINUS_EXPR:
9534       /* Subtraction of two similar pointers.
9535          We must subtract them as integers, then divide by object size.  */
9536       if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
9537           && comp_target_types (location, type0, type1))
9538         {
9539           ret = pointer_diff (location, op0, op1);
9540           goto return_build_binary_op;
9541         }
9542       /* Handle pointer minus int.  Just like pointer plus int.  */
9543       else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9544         {
9545           ret = pointer_int_sum (location, MINUS_EXPR, op0, op1);
9546           goto return_build_binary_op;
9547         }
9548       else
9549         common = 1;
9550       break;
9551
9552     case MULT_EXPR:
9553       common = 1;
9554       break;
9555
9556     case TRUNC_DIV_EXPR:
9557     case CEIL_DIV_EXPR:
9558     case FLOOR_DIV_EXPR:
9559     case ROUND_DIV_EXPR:
9560     case EXACT_DIV_EXPR:
9561       warn_for_div_by_zero (location, op1);
9562
9563       if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
9564            || code0 == FIXED_POINT_TYPE
9565            || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
9566           && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
9567               || code1 == FIXED_POINT_TYPE
9568               || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
9569         {
9570           enum tree_code tcode0 = code0, tcode1 = code1;
9571
9572           if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
9573             tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
9574           if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
9575             tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
9576
9577           if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
9578               || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
9579             resultcode = RDIV_EXPR;
9580           else
9581             /* Although it would be tempting to shorten always here, that
9582                loses on some targets, since the modulo instruction is
9583                undefined if the quotient can't be represented in the
9584                computation mode.  We shorten only if unsigned or if
9585                dividing by something we know != -1.  */
9586             shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
9587                        || (TREE_CODE (op1) == INTEGER_CST
9588                            && !integer_all_onesp (op1)));
9589           common = 1;
9590         }
9591       break;
9592
9593     case BIT_AND_EXPR:
9594     case BIT_IOR_EXPR:
9595     case BIT_XOR_EXPR:
9596       if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
9597         shorten = -1;
9598       /* Allow vector types which are not floating point types.   */
9599       else if (code0 == VECTOR_TYPE
9600                && code1 == VECTOR_TYPE
9601                && !VECTOR_FLOAT_TYPE_P (type0)
9602                && !VECTOR_FLOAT_TYPE_P (type1))
9603         common = 1;
9604       break;
9605
9606     case TRUNC_MOD_EXPR:
9607     case FLOOR_MOD_EXPR:
9608       warn_for_div_by_zero (location, op1);
9609
9610       if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9611           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
9612           && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
9613         common = 1;
9614       else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
9615         {
9616           /* Although it would be tempting to shorten always here, that loses
9617              on some targets, since the modulo instruction is undefined if the
9618              quotient can't be represented in the computation mode.  We shorten
9619              only if unsigned or if dividing by something we know != -1.  */
9620           shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
9621                      || (TREE_CODE (op1) == INTEGER_CST
9622                          && !integer_all_onesp (op1)));
9623           common = 1;
9624         }
9625       break;
9626
9627     case TRUTH_ANDIF_EXPR:
9628     case TRUTH_ORIF_EXPR:
9629     case TRUTH_AND_EXPR:
9630     case TRUTH_OR_EXPR:
9631     case TRUTH_XOR_EXPR:
9632       if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
9633            || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
9634            || code0 == FIXED_POINT_TYPE)
9635           && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
9636               || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
9637               || code1 == FIXED_POINT_TYPE))
9638         {
9639           /* Result of these operations is always an int,
9640              but that does not mean the operands should be
9641              converted to ints!  */
9642           result_type = integer_type_node;
9643           op0 = c_common_truthvalue_conversion (location, op0);
9644           op1 = c_common_truthvalue_conversion (location, op1);
9645           converted = 1;
9646           boolean_op = true;
9647         }
9648       if (code == TRUTH_ANDIF_EXPR)
9649         {
9650           int_const_or_overflow = (int_operands
9651                                    && TREE_CODE (orig_op0) == INTEGER_CST
9652                                    && (op0 == truthvalue_false_node
9653                                        || TREE_CODE (orig_op1) == INTEGER_CST));
9654           int_const = (int_const_or_overflow
9655                        && !TREE_OVERFLOW (orig_op0)
9656                        && (op0 == truthvalue_false_node
9657                            || !TREE_OVERFLOW (orig_op1)));
9658         }
9659       else if (code == TRUTH_ORIF_EXPR)
9660         {
9661           int_const_or_overflow = (int_operands
9662                                    && TREE_CODE (orig_op0) == INTEGER_CST
9663                                    && (op0 == truthvalue_true_node
9664                                        || TREE_CODE (orig_op1) == INTEGER_CST));
9665           int_const = (int_const_or_overflow
9666                        && !TREE_OVERFLOW (orig_op0)
9667                        && (op0 == truthvalue_true_node
9668                            || !TREE_OVERFLOW (orig_op1)));
9669         }
9670       break;
9671
9672       /* Shift operations: result has same type as first operand;
9673          always convert second operand to int.
9674          Also set SHORT_SHIFT if shifting rightward.  */
9675
9676     case RSHIFT_EXPR:
9677       if (code0 == VECTOR_TYPE && code1 == INTEGER_TYPE
9678           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE)
9679         {
9680           result_type = type0;
9681           converted = 1;
9682         }
9683       else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9684           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
9685           && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE
9686           && TYPE_VECTOR_SUBPARTS (type0) == TYPE_VECTOR_SUBPARTS (type1))
9687         {
9688           result_type = type0;
9689           converted = 1;
9690         }
9691       else if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
9692           && code1 == INTEGER_TYPE)
9693         {
9694           if (TREE_CODE (op1) == INTEGER_CST)
9695             {
9696               if (tree_int_cst_sgn (op1) < 0)
9697                 {
9698                   int_const = false;
9699                   if (c_inhibit_evaluation_warnings == 0)
9700                     warning (0, "right shift count is negative");
9701                 }
9702               else
9703                 {
9704                   if (!integer_zerop (op1))
9705                     short_shift = 1;
9706
9707                   if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
9708                     {
9709                       int_const = false;
9710                       if (c_inhibit_evaluation_warnings == 0)
9711                         warning (0, "right shift count >= width of type");
9712                     }
9713                 }
9714             }
9715
9716           /* Use the type of the value to be shifted.  */
9717           result_type = type0;
9718           /* Convert the non vector shift-count to an integer, regardless
9719              of size of value being shifted.  */
9720           if (TREE_CODE (TREE_TYPE (op1)) != VECTOR_TYPE
9721               && TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
9722             op1 = convert (integer_type_node, op1);
9723           /* Avoid converting op1 to result_type later.  */
9724           converted = 1;
9725         }
9726       break;
9727
9728     case LSHIFT_EXPR:
9729       if (code0 == VECTOR_TYPE && code1 == INTEGER_TYPE
9730           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE)
9731         {
9732           result_type = type0;
9733           converted = 1;
9734         }
9735       else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9736           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
9737           && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE
9738           && TYPE_VECTOR_SUBPARTS (type0) == TYPE_VECTOR_SUBPARTS (type1))
9739         {
9740           result_type = type0;
9741           converted = 1;
9742         }
9743       else if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
9744           && code1 == INTEGER_TYPE)
9745         {
9746           if (TREE_CODE (op1) == INTEGER_CST)
9747             {
9748               if (tree_int_cst_sgn (op1) < 0)
9749                 {
9750                   int_const = false;
9751                   if (c_inhibit_evaluation_warnings == 0)
9752                     warning (0, "left shift count is negative");
9753                 }
9754
9755               else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
9756                 {
9757                   int_const = false;
9758                   if (c_inhibit_evaluation_warnings == 0)
9759                     warning (0, "left shift count >= width of type");
9760                 }
9761             }
9762
9763           /* Use the type of the value to be shifted.  */
9764           result_type = type0;
9765           /* Convert the non vector shift-count to an integer, regardless
9766              of size of value being shifted.  */
9767           if (TREE_CODE (TREE_TYPE (op1)) != VECTOR_TYPE
9768               && TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
9769             op1 = convert (integer_type_node, op1);
9770           /* Avoid converting op1 to result_type later.  */
9771           converted = 1;
9772         }
9773       break;
9774
9775     case EQ_EXPR:
9776     case NE_EXPR:
9777       if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
9778         warning_at (location,
9779                     OPT_Wfloat_equal,
9780                     "comparing floating point with == or != is unsafe");
9781       /* Result of comparison is always int,
9782          but don't convert the args to int!  */
9783       build_type = integer_type_node;
9784       if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
9785            || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
9786           && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
9787               || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
9788         short_compare = 1;
9789       else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
9790         {
9791           if (TREE_CODE (op0) == ADDR_EXPR
9792               && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
9793             {
9794               if (code == EQ_EXPR)
9795                 warning_at (location,
9796                             OPT_Waddress,
9797                             "the comparison will always evaluate as %<false%> "
9798                             "for the address of %qD will never be NULL",
9799                             TREE_OPERAND (op0, 0));
9800               else
9801                 warning_at (location,
9802                             OPT_Waddress,
9803                             "the comparison will always evaluate as %<true%> "
9804                             "for the address of %qD will never be NULL",
9805                             TREE_OPERAND (op0, 0));
9806             }
9807           result_type = type0;
9808         }
9809       else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
9810         {
9811           if (TREE_CODE (op1) == ADDR_EXPR
9812               && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
9813             {
9814               if (code == EQ_EXPR)
9815                 warning_at (location,
9816                             OPT_Waddress,
9817                             "the comparison will always evaluate as %<false%> "
9818                             "for the address of %qD will never be NULL",
9819                             TREE_OPERAND (op1, 0));
9820               else
9821                 warning_at (location,
9822                             OPT_Waddress,
9823                             "the comparison will always evaluate as %<true%> "
9824                             "for the address of %qD will never be NULL",
9825                             TREE_OPERAND (op1, 0));
9826             }
9827           result_type = type1;
9828         }
9829       else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
9830         {
9831           tree tt0 = TREE_TYPE (type0);
9832           tree tt1 = TREE_TYPE (type1);
9833           addr_space_t as0 = TYPE_ADDR_SPACE (tt0);
9834           addr_space_t as1 = TYPE_ADDR_SPACE (tt1);
9835           addr_space_t as_common = ADDR_SPACE_GENERIC;
9836
9837           /* Anything compares with void *.  void * compares with anything.
9838              Otherwise, the targets must be compatible
9839              and both must be object or both incomplete.  */
9840           if (comp_target_types (location, type0, type1))
9841             result_type = common_pointer_type (type0, type1);
9842           else if (!addr_space_superset (as0, as1, &as_common))
9843             {
9844               error_at (location, "comparison of pointers to "
9845                         "disjoint address spaces");
9846               return error_mark_node;
9847             }
9848           else if (VOID_TYPE_P (tt0))
9849             {
9850               if (pedantic && TREE_CODE (tt1) == FUNCTION_TYPE)
9851                 pedwarn (location, OPT_pedantic, "ISO C forbids "
9852                          "comparison of %<void *%> with function pointer");
9853             }
9854           else if (VOID_TYPE_P (tt1))
9855             {
9856               if (pedantic && TREE_CODE (tt0) == FUNCTION_TYPE)
9857                 pedwarn (location, OPT_pedantic, "ISO C forbids "
9858                          "comparison of %<void *%> with function pointer");
9859             }
9860           else
9861             /* Avoid warning about the volatile ObjC EH puts on decls.  */
9862             if (!objc_ok)
9863               pedwarn (location, 0,
9864                        "comparison of distinct pointer types lacks a cast");
9865
9866           if (result_type == NULL_TREE)
9867             {
9868               int qual = ENCODE_QUAL_ADDR_SPACE (as_common);
9869               result_type = build_pointer_type
9870                               (build_qualified_type (void_type_node, qual));
9871             }
9872         }
9873       else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9874         {
9875           result_type = type0;
9876           pedwarn (location, 0, "comparison between pointer and integer");
9877         }
9878       else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
9879         {
9880           result_type = type1;
9881           pedwarn (location, 0, "comparison between pointer and integer");
9882         }
9883       break;
9884
9885     case LE_EXPR:
9886     case GE_EXPR:
9887     case LT_EXPR:
9888     case GT_EXPR:
9889       build_type = integer_type_node;
9890       if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
9891            || code0 == FIXED_POINT_TYPE)
9892           && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
9893               || code1 == FIXED_POINT_TYPE))
9894         short_compare = 1;
9895       else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
9896         {
9897           addr_space_t as0 = TYPE_ADDR_SPACE (TREE_TYPE (type0));
9898           addr_space_t as1 = TYPE_ADDR_SPACE (TREE_TYPE (type1));
9899           addr_space_t as_common;
9900
9901           if (comp_target_types (location, type0, type1))
9902             {
9903               result_type = common_pointer_type (type0, type1);
9904               if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
9905                   != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
9906                 pedwarn (location, 0,
9907                          "comparison of complete and incomplete pointers");
9908               else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
9909                 pedwarn (location, OPT_pedantic, "ISO C forbids "
9910                          "ordered comparisons of pointers to functions");
9911               else if (null_pointer_constant_p (orig_op0)
9912                        || null_pointer_constant_p (orig_op1))
9913                 warning_at (location, OPT_Wextra,
9914                             "ordered comparison of pointer with null pointer");
9915
9916             }
9917           else if (!addr_space_superset (as0, as1, &as_common))
9918             {
9919               error_at (location, "comparison of pointers to "
9920                         "disjoint address spaces");
9921               return error_mark_node;
9922             }
9923           else
9924             {
9925               int qual = ENCODE_QUAL_ADDR_SPACE (as_common);
9926               result_type = build_pointer_type
9927                               (build_qualified_type (void_type_node, qual));
9928               pedwarn (location, 0,
9929                        "comparison of distinct pointer types lacks a cast");
9930             }
9931         }
9932       else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
9933         {
9934           result_type = type0;
9935           if (pedantic)
9936             pedwarn (location, OPT_pedantic,
9937                      "ordered comparison of pointer with integer zero");
9938           else if (extra_warnings)
9939             warning_at (location, OPT_Wextra,
9940                         "ordered comparison of pointer with integer zero");
9941         }
9942       else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
9943         {
9944           result_type = type1;
9945           if (pedantic)
9946             pedwarn (location, OPT_pedantic,
9947                      "ordered comparison of pointer with integer zero");
9948           else if (extra_warnings)
9949             warning_at (location, OPT_Wextra,
9950                         "ordered comparison of pointer with integer zero");
9951         }
9952       else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9953         {
9954           result_type = type0;
9955           pedwarn (location, 0, "comparison between pointer and integer");
9956         }
9957       else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
9958         {
9959           result_type = type1;
9960           pedwarn (location, 0, "comparison between pointer and integer");
9961         }
9962       break;
9963
9964     default:
9965       gcc_unreachable ();
9966     }
9967
9968   if (code0 == ERROR_MARK || code1 == ERROR_MARK)
9969     return error_mark_node;
9970
9971   if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9972       && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
9973           || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
9974                                                     TREE_TYPE (type1))))
9975     {
9976       binary_op_error (location, code, type0, type1);
9977       return error_mark_node;
9978     }
9979
9980   if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
9981        || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
9982       &&
9983       (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
9984        || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
9985     {
9986       bool first_complex = (code0 == COMPLEX_TYPE);
9987       bool second_complex = (code1 == COMPLEX_TYPE);
9988       int none_complex = (!first_complex && !second_complex);
9989
9990       if (shorten || common || short_compare)
9991         {
9992           result_type = c_common_type (type0, type1);
9993           do_warn_double_promotion (result_type, type0, type1,
9994                                     "implicit conversion from %qT to %qT "
9995                                     "to match other operand of binary "
9996                                     "expression",
9997                                     location);
9998           if (result_type == error_mark_node)
9999             return error_mark_node;
10000         }
10001
10002       if (first_complex != second_complex
10003           && (code == PLUS_EXPR
10004               || code == MINUS_EXPR
10005               || code == MULT_EXPR
10006               || (code == TRUNC_DIV_EXPR && first_complex))
10007           && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
10008           && flag_signed_zeros)
10009         {
10010           /* An operation on mixed real/complex operands must be
10011              handled specially, but the language-independent code can
10012              more easily optimize the plain complex arithmetic if
10013              -fno-signed-zeros.  */
10014           tree real_type = TREE_TYPE (result_type);
10015           tree real, imag;
10016           if (type0 != orig_type0 || type1 != orig_type1)
10017             {
10018               gcc_assert (may_need_excess_precision && common);
10019               semantic_result_type = c_common_type (orig_type0, orig_type1);
10020             }
10021           if (first_complex)
10022             {
10023               if (TREE_TYPE (op0) != result_type)
10024                 op0 = convert_and_check (result_type, op0);
10025               if (TREE_TYPE (op1) != real_type)
10026                 op1 = convert_and_check (real_type, op1);
10027             }
10028           else
10029             {
10030               if (TREE_TYPE (op0) != real_type)
10031                 op0 = convert_and_check (real_type, op0);
10032               if (TREE_TYPE (op1) != result_type)
10033                 op1 = convert_and_check (result_type, op1);
10034             }
10035           if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
10036             return error_mark_node;
10037           if (first_complex)
10038             {
10039               op0 = c_save_expr (op0);
10040               real = build_unary_op (EXPR_LOCATION (orig_op0), REALPART_EXPR,
10041                                      op0, 1);
10042               imag = build_unary_op (EXPR_LOCATION (orig_op0), IMAGPART_EXPR,
10043                                      op0, 1);
10044               switch (code)
10045                 {
10046                 case MULT_EXPR:
10047                 case TRUNC_DIV_EXPR:
10048                   imag = build2 (resultcode, real_type, imag, op1);
10049                   /* Fall through.  */
10050                 case PLUS_EXPR:
10051                 case MINUS_EXPR:
10052                   real = build2 (resultcode, real_type, real, op1);
10053                   break;
10054                 default:
10055                   gcc_unreachable();
10056                 }
10057             }
10058           else
10059             {
10060               op1 = c_save_expr (op1);
10061               real = build_unary_op (EXPR_LOCATION (orig_op1), REALPART_EXPR,
10062                                      op1, 1);
10063               imag = build_unary_op (EXPR_LOCATION (orig_op1), IMAGPART_EXPR,
10064                                      op1, 1);
10065               switch (code)
10066                 {
10067                 case MULT_EXPR:
10068                   imag = build2 (resultcode, real_type, op0, imag);
10069                   /* Fall through.  */
10070                 case PLUS_EXPR:
10071                   real = build2 (resultcode, real_type, op0, real);
10072                   break;
10073                 case MINUS_EXPR:
10074                   real = build2 (resultcode, real_type, op0, real);
10075                   imag = build1 (NEGATE_EXPR, real_type, imag);
10076                   break;
10077                 default:
10078                   gcc_unreachable();
10079                 }
10080             }
10081           ret = build2 (COMPLEX_EXPR, result_type, real, imag);
10082           goto return_build_binary_op;
10083         }
10084
10085       /* For certain operations (which identify themselves by shorten != 0)
10086          if both args were extended from the same smaller type,
10087          do the arithmetic in that type and then extend.
10088
10089          shorten !=0 and !=1 indicates a bitwise operation.
10090          For them, this optimization is safe only if
10091          both args are zero-extended or both are sign-extended.
10092          Otherwise, we might change the result.
10093          Eg, (short)-1 | (unsigned short)-1 is (int)-1
10094          but calculated in (unsigned short) it would be (unsigned short)-1.  */
10095
10096       if (shorten && none_complex)
10097         {
10098           final_type = result_type;
10099           result_type = shorten_binary_op (result_type, op0, op1,
10100                                            shorten == -1);
10101         }
10102
10103       /* Shifts can be shortened if shifting right.  */
10104
10105       if (short_shift)
10106         {
10107           int unsigned_arg;
10108           tree arg0 = get_narrower (op0, &unsigned_arg);
10109
10110           final_type = result_type;
10111
10112           if (arg0 == op0 && final_type == TREE_TYPE (op0))
10113             unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
10114
10115           if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
10116               && tree_int_cst_sgn (op1) > 0
10117               /* We can shorten only if the shift count is less than the
10118                  number of bits in the smaller type size.  */
10119               && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
10120               /* We cannot drop an unsigned shift after sign-extension.  */
10121               && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
10122             {
10123               /* Do an unsigned shift if the operand was zero-extended.  */
10124               result_type
10125                 = c_common_signed_or_unsigned_type (unsigned_arg,
10126                                                     TREE_TYPE (arg0));
10127               /* Convert value-to-be-shifted to that type.  */
10128               if (TREE_TYPE (op0) != result_type)
10129                 op0 = convert (result_type, op0);
10130               converted = 1;
10131             }
10132         }
10133
10134       /* Comparison operations are shortened too but differently.
10135          They identify themselves by setting short_compare = 1.  */
10136
10137       if (short_compare)
10138         {
10139           /* Don't write &op0, etc., because that would prevent op0
10140              from being kept in a register.
10141              Instead, make copies of the our local variables and
10142              pass the copies by reference, then copy them back afterward.  */
10143           tree xop0 = op0, xop1 = op1, xresult_type = result_type;
10144           enum tree_code xresultcode = resultcode;
10145           tree val
10146             = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
10147
10148           if (val != 0)
10149             {
10150               ret = val;
10151               goto return_build_binary_op;
10152             }
10153
10154           op0 = xop0, op1 = xop1;
10155           converted = 1;
10156           resultcode = xresultcode;
10157
10158           if (c_inhibit_evaluation_warnings == 0)
10159             {
10160               bool op0_maybe_const = true;
10161               bool op1_maybe_const = true;
10162               tree orig_op0_folded, orig_op1_folded;
10163
10164               if (in_late_binary_op)
10165                 {
10166                   orig_op0_folded = orig_op0;
10167                   orig_op1_folded = orig_op1;
10168                 }
10169               else
10170                 {
10171                   /* Fold for the sake of possible warnings, as in
10172                      build_conditional_expr.  This requires the
10173                      "original" values to be folded, not just op0 and
10174                      op1.  */
10175                   c_inhibit_evaluation_warnings++;
10176                   op0 = c_fully_fold (op0, require_constant_value,
10177                                       &op0_maybe_const);
10178                   op1 = c_fully_fold (op1, require_constant_value,
10179                                       &op1_maybe_const);
10180                   c_inhibit_evaluation_warnings--;
10181                   orig_op0_folded = c_fully_fold (orig_op0,
10182                                                   require_constant_value,
10183                                                   NULL);
10184                   orig_op1_folded = c_fully_fold (orig_op1,
10185                                                   require_constant_value,
10186                                                   NULL);
10187                 }
10188
10189               if (warn_sign_compare)
10190                 warn_for_sign_compare (location, orig_op0_folded,
10191                                        orig_op1_folded, op0, op1,
10192                                        result_type, resultcode);
10193               if (!in_late_binary_op && !int_operands)
10194                 {
10195                   if (!op0_maybe_const || TREE_CODE (op0) != INTEGER_CST)
10196                     op0 = c_wrap_maybe_const (op0, !op0_maybe_const);
10197                   if (!op1_maybe_const || TREE_CODE (op1) != INTEGER_CST)
10198                     op1 = c_wrap_maybe_const (op1, !op1_maybe_const);
10199                 }
10200             }
10201         }
10202     }
10203
10204   /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
10205      If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
10206      Then the expression will be built.
10207      It will be given type FINAL_TYPE if that is nonzero;
10208      otherwise, it will be given type RESULT_TYPE.  */
10209
10210   if (!result_type)
10211     {
10212       binary_op_error (location, code, TREE_TYPE (op0), TREE_TYPE (op1));
10213       return error_mark_node;
10214     }
10215
10216   if (build_type == NULL_TREE)
10217     {
10218       build_type = result_type;
10219       if ((type0 != orig_type0 || type1 != orig_type1)
10220           && !boolean_op)
10221         {
10222           gcc_assert (may_need_excess_precision && common);
10223           semantic_result_type = c_common_type (orig_type0, orig_type1);
10224         }
10225     }
10226
10227   if (!converted)
10228     {
10229       op0 = ep_convert_and_check (result_type, op0, semantic_result_type);
10230       op1 = ep_convert_and_check (result_type, op1, semantic_result_type);
10231
10232       /* This can happen if one operand has a vector type, and the other
10233          has a different type.  */
10234       if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
10235         return error_mark_node;
10236     }
10237
10238   /* Treat expressions in initializers specially as they can't trap.  */
10239   if (int_const_or_overflow)
10240     ret = (require_constant_value
10241            ? fold_build2_initializer_loc (location, resultcode, build_type,
10242                                           op0, op1)
10243            : fold_build2_loc (location, resultcode, build_type, op0, op1));
10244   else
10245     ret = build2 (resultcode, build_type, op0, op1);
10246   if (final_type != 0)
10247     ret = convert (final_type, ret);
10248
10249  return_build_binary_op:
10250   gcc_assert (ret != error_mark_node);
10251   if (TREE_CODE (ret) == INTEGER_CST && !TREE_OVERFLOW (ret) && !int_const)
10252     ret = (int_operands
10253            ? note_integer_operands (ret)
10254            : build1 (NOP_EXPR, TREE_TYPE (ret), ret));
10255   else if (TREE_CODE (ret) != INTEGER_CST && int_operands
10256            && !in_late_binary_op)
10257     ret = note_integer_operands (ret);
10258   if (semantic_result_type)
10259     ret = build1 (EXCESS_PRECISION_EXPR, semantic_result_type, ret);
10260   protected_set_expr_location (ret, location);
10261   return ret;
10262 }
10263
10264
10265 /* Convert EXPR to be a truth-value, validating its type for this
10266    purpose.  LOCATION is the source location for the expression.  */
10267
10268 tree
10269 c_objc_common_truthvalue_conversion (location_t location, tree expr)
10270 {
10271   bool int_const, int_operands;
10272
10273   switch (TREE_CODE (TREE_TYPE (expr)))
10274     {
10275     case ARRAY_TYPE:
10276       error_at (location, "used array that cannot be converted to pointer where scalar is required");
10277       return error_mark_node;
10278
10279     case RECORD_TYPE:
10280       error_at (location, "used struct type value where scalar is required");
10281       return error_mark_node;
10282
10283     case UNION_TYPE:
10284       error_at (location, "used union type value where scalar is required");
10285       return error_mark_node;
10286
10287     case VOID_TYPE:
10288       error_at (location, "void value not ignored as it ought to be");
10289       return error_mark_node;
10290
10291     case FUNCTION_TYPE:
10292       gcc_unreachable ();
10293
10294     default:
10295       break;
10296     }
10297
10298   int_const = (TREE_CODE (expr) == INTEGER_CST && !TREE_OVERFLOW (expr));
10299   int_operands = EXPR_INT_CONST_OPERANDS (expr);
10300   if (int_operands)
10301     expr = remove_c_maybe_const_expr (expr);
10302
10303   /* ??? Should we also give an error for vectors rather than leaving
10304      those to give errors later?  */
10305   expr = c_common_truthvalue_conversion (location, expr);
10306
10307   if (TREE_CODE (expr) == INTEGER_CST && int_operands && !int_const)
10308     {
10309       if (TREE_OVERFLOW (expr))
10310         return expr;
10311       else
10312         return note_integer_operands (expr);
10313     }
10314   if (TREE_CODE (expr) == INTEGER_CST && !int_const)
10315     return build1 (NOP_EXPR, TREE_TYPE (expr), expr);
10316   return expr;
10317 }
10318 \f
10319
10320 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
10321    required.  */
10322
10323 tree
10324 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
10325 {
10326   if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
10327     {
10328       tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
10329       /* Executing a compound literal inside a function reinitializes
10330          it.  */
10331       if (!TREE_STATIC (decl))
10332         *se = true;
10333       return decl;
10334     }
10335   else
10336     return expr;
10337 }
10338 \f
10339 /* Like c_begin_compound_stmt, except force the retention of the BLOCK.  */
10340
10341 tree
10342 c_begin_omp_parallel (void)
10343 {
10344   tree block;
10345
10346   keep_next_level ();
10347   block = c_begin_compound_stmt (true);
10348
10349   return block;
10350 }
10351
10352 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
10353    statement.  LOC is the location of the OMP_PARALLEL.  */
10354
10355 tree
10356 c_finish_omp_parallel (location_t loc, tree clauses, tree block)
10357 {
10358   tree stmt;
10359
10360   block = c_end_compound_stmt (loc, block, true);
10361
10362   stmt = make_node (OMP_PARALLEL);
10363   TREE_TYPE (stmt) = void_type_node;
10364   OMP_PARALLEL_CLAUSES (stmt) = clauses;
10365   OMP_PARALLEL_BODY (stmt) = block;
10366   SET_EXPR_LOCATION (stmt, loc);
10367
10368   return add_stmt (stmt);
10369 }
10370
10371 /* Like c_begin_compound_stmt, except force the retention of the BLOCK.  */
10372
10373 tree
10374 c_begin_omp_task (void)
10375 {
10376   tree block;
10377
10378   keep_next_level ();
10379   block = c_begin_compound_stmt (true);
10380
10381   return block;
10382 }
10383
10384 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
10385    statement.  LOC is the location of the #pragma.  */
10386
10387 tree
10388 c_finish_omp_task (location_t loc, tree clauses, tree block)
10389 {
10390   tree stmt;
10391
10392   block = c_end_compound_stmt (loc, block, true);
10393
10394   stmt = make_node (OMP_TASK);
10395   TREE_TYPE (stmt) = void_type_node;
10396   OMP_TASK_CLAUSES (stmt) = clauses;
10397   OMP_TASK_BODY (stmt) = block;
10398   SET_EXPR_LOCATION (stmt, loc);
10399
10400   return add_stmt (stmt);
10401 }
10402
10403 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
10404    Remove any elements from the list that are invalid.  */
10405
10406 tree
10407 c_finish_omp_clauses (tree clauses)
10408 {
10409   bitmap_head generic_head, firstprivate_head, lastprivate_head;
10410   tree c, t, *pc = &clauses;
10411   const char *name;
10412
10413   bitmap_obstack_initialize (NULL);
10414   bitmap_initialize (&generic_head, &bitmap_default_obstack);
10415   bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
10416   bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
10417
10418   for (pc = &clauses, c = clauses; c ; c = *pc)
10419     {
10420       bool remove = false;
10421       bool need_complete = false;
10422       bool need_implicitly_determined = false;
10423
10424       switch (OMP_CLAUSE_CODE (c))
10425         {
10426         case OMP_CLAUSE_SHARED:
10427           name = "shared";
10428           need_implicitly_determined = true;
10429           goto check_dup_generic;
10430
10431         case OMP_CLAUSE_PRIVATE:
10432           name = "private";
10433           need_complete = true;
10434           need_implicitly_determined = true;
10435           goto check_dup_generic;
10436
10437         case OMP_CLAUSE_REDUCTION:
10438           name = "reduction";
10439           need_implicitly_determined = true;
10440           t = OMP_CLAUSE_DECL (c);
10441           if (AGGREGATE_TYPE_P (TREE_TYPE (t))
10442               || POINTER_TYPE_P (TREE_TYPE (t)))
10443             {
10444               error_at (OMP_CLAUSE_LOCATION (c),
10445                         "%qE has invalid type for %<reduction%>", t);
10446               remove = true;
10447             }
10448           else if (FLOAT_TYPE_P (TREE_TYPE (t)))
10449             {
10450               enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
10451               const char *r_name = NULL;
10452
10453               switch (r_code)
10454                 {
10455                 case PLUS_EXPR:
10456                 case MULT_EXPR:
10457                 case MINUS_EXPR:
10458                   break;
10459                 case BIT_AND_EXPR:
10460                   r_name = "&";
10461                   break;
10462                 case BIT_XOR_EXPR:
10463                   r_name = "^";
10464                   break;
10465                 case BIT_IOR_EXPR:
10466                   r_name = "|";
10467                   break;
10468                 case TRUTH_ANDIF_EXPR:
10469                   r_name = "&&";
10470                   break;
10471                 case TRUTH_ORIF_EXPR:
10472                   r_name = "||";
10473                   break;
10474                 default:
10475                   gcc_unreachable ();
10476                 }
10477               if (r_name)
10478                 {
10479                   error_at (OMP_CLAUSE_LOCATION (c),
10480                             "%qE has invalid type for %<reduction(%s)%>",
10481                             t, r_name);
10482                   remove = true;
10483                 }
10484             }
10485           goto check_dup_generic;
10486
10487         case OMP_CLAUSE_COPYPRIVATE:
10488           name = "copyprivate";
10489           goto check_dup_generic;
10490
10491         case OMP_CLAUSE_COPYIN:
10492           name = "copyin";
10493           t = OMP_CLAUSE_DECL (c);
10494           if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
10495             {
10496               error_at (OMP_CLAUSE_LOCATION (c),
10497                         "%qE must be %<threadprivate%> for %<copyin%>", t);
10498               remove = true;
10499             }
10500           goto check_dup_generic;
10501
10502         check_dup_generic:
10503           t = OMP_CLAUSE_DECL (c);
10504           if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
10505             {
10506               error_at (OMP_CLAUSE_LOCATION (c),
10507                         "%qE is not a variable in clause %qs", t, name);
10508               remove = true;
10509             }
10510           else if (bitmap_bit_p (&generic_head, DECL_UID (t))
10511                    || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
10512                    || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
10513             {
10514               error_at (OMP_CLAUSE_LOCATION (c),
10515                         "%qE appears more than once in data clauses", t);
10516               remove = true;
10517             }
10518           else
10519             bitmap_set_bit (&generic_head, DECL_UID (t));
10520           break;
10521
10522         case OMP_CLAUSE_FIRSTPRIVATE:
10523           name = "firstprivate";
10524           t = OMP_CLAUSE_DECL (c);
10525           need_complete = true;
10526           need_implicitly_determined = true;
10527           if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
10528             {
10529               error_at (OMP_CLAUSE_LOCATION (c),
10530                         "%qE is not a variable in clause %<firstprivate%>", t);
10531               remove = true;
10532             }
10533           else if (bitmap_bit_p (&generic_head, DECL_UID (t))
10534                    || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
10535             {
10536               error_at (OMP_CLAUSE_LOCATION (c),
10537                         "%qE appears more than once in data clauses", t);
10538               remove = true;
10539             }
10540           else
10541             bitmap_set_bit (&firstprivate_head, DECL_UID (t));
10542           break;
10543
10544         case OMP_CLAUSE_LASTPRIVATE:
10545           name = "lastprivate";
10546           t = OMP_CLAUSE_DECL (c);
10547           need_complete = true;
10548           need_implicitly_determined = true;
10549           if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
10550             {
10551               error_at (OMP_CLAUSE_LOCATION (c),
10552                         "%qE is not a variable in clause %<lastprivate%>", t);
10553               remove = true;
10554             }
10555           else if (bitmap_bit_p (&generic_head, DECL_UID (t))
10556                    || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
10557             {
10558               error_at (OMP_CLAUSE_LOCATION (c),
10559                      "%qE appears more than once in data clauses", t);
10560               remove = true;
10561             }
10562           else
10563             bitmap_set_bit (&lastprivate_head, DECL_UID (t));
10564           break;
10565
10566         case OMP_CLAUSE_IF:
10567         case OMP_CLAUSE_NUM_THREADS:
10568         case OMP_CLAUSE_SCHEDULE:
10569         case OMP_CLAUSE_NOWAIT:
10570         case OMP_CLAUSE_ORDERED:
10571         case OMP_CLAUSE_DEFAULT:
10572         case OMP_CLAUSE_UNTIED:
10573         case OMP_CLAUSE_COLLAPSE:
10574           pc = &OMP_CLAUSE_CHAIN (c);
10575           continue;
10576
10577         default:
10578           gcc_unreachable ();
10579         }
10580
10581       if (!remove)
10582         {
10583           t = OMP_CLAUSE_DECL (c);
10584
10585           if (need_complete)
10586             {
10587               t = require_complete_type (t);
10588               if (t == error_mark_node)
10589                 remove = true;
10590             }
10591
10592           if (need_implicitly_determined)
10593             {
10594               const char *share_name = NULL;
10595
10596               if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
10597                 share_name = "threadprivate";
10598               else switch (c_omp_predetermined_sharing (t))
10599                 {
10600                 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
10601                   break;
10602                 case OMP_CLAUSE_DEFAULT_SHARED:
10603                   share_name = "shared";
10604                   break;
10605                 case OMP_CLAUSE_DEFAULT_PRIVATE:
10606                   share_name = "private";
10607                   break;
10608                 default:
10609                   gcc_unreachable ();
10610                 }
10611               if (share_name)
10612                 {
10613                   error_at (OMP_CLAUSE_LOCATION (c),
10614                             "%qE is predetermined %qs for %qs",
10615                             t, share_name, name);
10616                   remove = true;
10617                 }
10618             }
10619         }
10620
10621       if (remove)
10622         *pc = OMP_CLAUSE_CHAIN (c);
10623       else
10624         pc = &OMP_CLAUSE_CHAIN (c);
10625     }
10626
10627   bitmap_obstack_release (NULL);
10628   return clauses;
10629 }
10630
10631 /* Make a variant type in the proper way for C/C++, propagating qualifiers
10632    down to the element type of an array.  */
10633
10634 tree
10635 c_build_qualified_type (tree type, int type_quals)
10636 {
10637   if (type == error_mark_node)
10638     return type;
10639
10640   if (TREE_CODE (type) == ARRAY_TYPE)
10641     {
10642       tree t;
10643       tree element_type = c_build_qualified_type (TREE_TYPE (type),
10644                                                   type_quals);
10645
10646       /* See if we already have an identically qualified type.  */
10647       for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
10648         {
10649           if (TYPE_QUALS (strip_array_types (t)) == type_quals
10650               && TYPE_NAME (t) == TYPE_NAME (type)
10651               && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
10652               && attribute_list_equal (TYPE_ATTRIBUTES (t),
10653                                        TYPE_ATTRIBUTES (type)))
10654             break;
10655         }
10656       if (!t)
10657         {
10658           tree domain = TYPE_DOMAIN (type);
10659
10660           t = build_variant_type_copy (type);
10661           TREE_TYPE (t) = element_type;
10662
10663           if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
10664               || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
10665             SET_TYPE_STRUCTURAL_EQUALITY (t);
10666           else if (TYPE_CANONICAL (element_type) != element_type
10667                    || (domain && TYPE_CANONICAL (domain) != domain))
10668             {
10669               tree unqualified_canon
10670                 = build_array_type (TYPE_CANONICAL (element_type),
10671                                     domain? TYPE_CANONICAL (domain)
10672                                           : NULL_TREE);
10673               TYPE_CANONICAL (t)
10674                 = c_build_qualified_type (unqualified_canon, type_quals);
10675             }
10676           else
10677             TYPE_CANONICAL (t) = t;
10678         }
10679       return t;
10680     }
10681
10682   /* A restrict-qualified pointer type must be a pointer to object or
10683      incomplete type.  Note that the use of POINTER_TYPE_P also allows
10684      REFERENCE_TYPEs, which is appropriate for C++.  */
10685   if ((type_quals & TYPE_QUAL_RESTRICT)
10686       && (!POINTER_TYPE_P (type)
10687           || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
10688     {
10689       error ("invalid use of %<restrict%>");
10690       type_quals &= ~TYPE_QUAL_RESTRICT;
10691     }
10692
10693   return build_qualified_type (type, type_quals);
10694 }
10695
10696 /* Build a VA_ARG_EXPR for the C parser.  */
10697
10698 tree
10699 c_build_va_arg (location_t loc, tree expr, tree type)
10700 {
10701   if (warn_cxx_compat && TREE_CODE (type) == ENUMERAL_TYPE)
10702     warning_at (loc, OPT_Wc___compat,
10703                 "C++ requires promoted type, not enum type, in %<va_arg%>");
10704   return build_va_arg (loc, expr, type);
10705 }