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           return build_binary_op (location, PLUS_EXPR,
3741                                   (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3742                                    ? array_to_pointer_conversion (location,
3743                                                                   op0)
3744                                    : op0),
3745                                   TREE_OPERAND (arg, 1), 1);
3746         }
3747
3748       /* Anything not already handled and not a true memory reference
3749          or a non-lvalue array is an error.  */
3750       else if (typecode != FUNCTION_TYPE && !flag
3751                && !lvalue_or_else (location, arg, lv_addressof))
3752         return error_mark_node;
3753
3754       /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3755          folding later.  */
3756       if (TREE_CODE (arg) == C_MAYBE_CONST_EXPR)
3757         {
3758           tree inner = build_unary_op (location, code,
3759                                        C_MAYBE_CONST_EXPR_EXPR (arg), flag);
3760           ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
3761                         C_MAYBE_CONST_EXPR_PRE (arg), inner);
3762           gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg));
3763           C_MAYBE_CONST_EXPR_NON_CONST (ret)
3764             = C_MAYBE_CONST_EXPR_NON_CONST (arg);
3765           goto return_build_unary_op;
3766         }
3767
3768       /* Ordinary case; arg is a COMPONENT_REF or a decl.  */
3769       argtype = TREE_TYPE (arg);
3770
3771       /* If the lvalue is const or volatile, merge that into the type
3772          to which the address will point.  This should only be needed
3773          for function types.  */
3774       if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3775           && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3776         {
3777           int orig_quals = TYPE_QUALS (strip_array_types (argtype));
3778           int quals = orig_quals;
3779
3780           if (TREE_READONLY (arg))
3781             quals |= TYPE_QUAL_CONST;
3782           if (TREE_THIS_VOLATILE (arg))
3783             quals |= TYPE_QUAL_VOLATILE;
3784
3785           gcc_assert (quals == orig_quals
3786                       || TREE_CODE (argtype) == FUNCTION_TYPE);
3787
3788           argtype = c_build_qualified_type (argtype, quals);
3789         }
3790
3791       if (!c_mark_addressable (arg))
3792         return error_mark_node;
3793
3794       gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3795                   || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3796
3797       argtype = build_pointer_type (argtype);
3798
3799       /* ??? Cope with user tricks that amount to offsetof.  Delete this
3800          when we have proper support for integer constant expressions.  */
3801       val = get_base_address (arg);
3802       if (val && TREE_CODE (val) == INDIRECT_REF
3803           && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3804         {
3805           tree op0 = fold_convert_loc (location, sizetype,
3806                                        fold_offsetof (arg, val)), op1;
3807
3808           op1 = fold_convert_loc (location, argtype, TREE_OPERAND (val, 0));
3809           ret = fold_build2_loc (location, POINTER_PLUS_EXPR, argtype, op1, op0);
3810           goto return_build_unary_op;
3811         }
3812
3813       val = build1 (ADDR_EXPR, argtype, arg);
3814
3815       ret = val;
3816       goto return_build_unary_op;
3817
3818     default:
3819       gcc_unreachable ();
3820     }
3821
3822   if (argtype == 0)
3823     argtype = TREE_TYPE (arg);
3824   if (TREE_CODE (arg) == INTEGER_CST)
3825     ret = (require_constant_value
3826            ? fold_build1_initializer_loc (location, code, argtype, arg)
3827            : fold_build1_loc (location, code, argtype, arg));
3828   else
3829     ret = build1 (code, argtype, arg);
3830  return_build_unary_op:
3831   gcc_assert (ret != error_mark_node);
3832   if (TREE_CODE (ret) == INTEGER_CST && !TREE_OVERFLOW (ret)
3833       && !(TREE_CODE (xarg) == INTEGER_CST && !TREE_OVERFLOW (xarg)))
3834     ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
3835   else if (TREE_CODE (ret) != INTEGER_CST && int_operands)
3836     ret = note_integer_operands (ret);
3837   if (eptype)
3838     ret = build1 (EXCESS_PRECISION_EXPR, eptype, ret);
3839   protected_set_expr_location (ret, location);
3840   return ret;
3841 }
3842
3843 /* Return nonzero if REF is an lvalue valid for this language.
3844    Lvalues can be assigned, unless their type has TYPE_READONLY.
3845    Lvalues can have their address taken, unless they have C_DECL_REGISTER.  */
3846
3847 bool
3848 lvalue_p (const_tree ref)
3849 {
3850   const enum tree_code code = TREE_CODE (ref);
3851
3852   switch (code)
3853     {
3854     case REALPART_EXPR:
3855     case IMAGPART_EXPR:
3856     case COMPONENT_REF:
3857       return lvalue_p (TREE_OPERAND (ref, 0));
3858
3859     case C_MAYBE_CONST_EXPR:
3860       return lvalue_p (TREE_OPERAND (ref, 1));
3861
3862     case COMPOUND_LITERAL_EXPR:
3863     case STRING_CST:
3864       return 1;
3865
3866     case INDIRECT_REF:
3867     case ARRAY_REF:
3868     case VAR_DECL:
3869     case PARM_DECL:
3870     case RESULT_DECL:
3871     case ERROR_MARK:
3872       return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3873               && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3874
3875     case BIND_EXPR:
3876       return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3877
3878     default:
3879       return 0;
3880     }
3881 }
3882 \f
3883 /* Give a warning for storing in something that is read-only in GCC
3884    terms but not const in ISO C terms.  */
3885
3886 static void
3887 readonly_warning (tree arg, enum lvalue_use use)
3888 {
3889   switch (use)
3890     {
3891     case lv_assign:
3892       warning (0, "assignment of read-only location %qE", arg);
3893       break;
3894     case lv_increment:
3895       warning (0, "increment of read-only location %qE", arg);
3896       break;
3897     case lv_decrement:
3898       warning (0, "decrement of read-only location %qE", arg);
3899       break;
3900     default:
3901       gcc_unreachable ();
3902     }
3903   return;
3904 }
3905
3906
3907 /* Return nonzero if REF is an lvalue valid for this language;
3908    otherwise, print an error message and return zero.  USE says
3909    how the lvalue is being used and so selects the error message.
3910    LOCATION is the location at which any error should be reported.  */
3911
3912 static int
3913 lvalue_or_else (location_t loc, const_tree ref, enum lvalue_use use)
3914 {
3915   int win = lvalue_p (ref);
3916
3917   if (!win)
3918     lvalue_error (loc, use);
3919
3920   return win;
3921 }
3922 \f
3923 /* Mark EXP saying that we need to be able to take the
3924    address of it; it should not be allocated in a register.
3925    Returns true if successful.  */
3926
3927 bool
3928 c_mark_addressable (tree exp)
3929 {
3930   tree x = exp;
3931
3932   while (1)
3933     switch (TREE_CODE (x))
3934       {
3935       case COMPONENT_REF:
3936         if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3937           {
3938             error
3939               ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3940             return false;
3941           }
3942
3943         /* ... fall through ...  */
3944
3945       case ADDR_EXPR:
3946       case ARRAY_REF:
3947       case REALPART_EXPR:
3948       case IMAGPART_EXPR:
3949         x = TREE_OPERAND (x, 0);
3950         break;
3951
3952       case COMPOUND_LITERAL_EXPR:
3953       case CONSTRUCTOR:
3954         TREE_ADDRESSABLE (x) = 1;
3955         return true;
3956
3957       case VAR_DECL:
3958       case CONST_DECL:
3959       case PARM_DECL:
3960       case RESULT_DECL:
3961         if (C_DECL_REGISTER (x)
3962             && DECL_NONLOCAL (x))
3963           {
3964             if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3965               {
3966                 error
3967                   ("global register variable %qD used in nested function", x);
3968                 return false;
3969               }
3970             pedwarn (input_location, 0, "register variable %qD used in nested function", x);
3971           }
3972         else if (C_DECL_REGISTER (x))
3973           {
3974             if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3975               error ("address of global register variable %qD requested", x);
3976             else
3977               error ("address of register variable %qD requested", x);
3978             return false;
3979           }
3980
3981         /* drops in */
3982       case FUNCTION_DECL:
3983         TREE_ADDRESSABLE (x) = 1;
3984         /* drops out */
3985       default:
3986         return true;
3987     }
3988 }
3989 \f
3990 /* Convert EXPR to TYPE, warning about conversion problems with
3991    constants.  SEMANTIC_TYPE is the type this conversion would use
3992    without excess precision. If SEMANTIC_TYPE is NULL, this function
3993    is equivalent to convert_and_check. This function is a wrapper that
3994    handles conversions that may be different than
3995    the usual ones because of excess precision.  */
3996
3997 static tree
3998 ep_convert_and_check (tree type, tree expr, tree semantic_type)
3999 {
4000   if (TREE_TYPE (expr) == type)
4001     return expr;
4002
4003   if (!semantic_type)
4004     return convert_and_check (type, expr);
4005
4006   if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
4007       && TREE_TYPE (expr) != semantic_type)
4008     {
4009       /* For integers, we need to check the real conversion, not
4010          the conversion to the excess precision type.  */
4011       expr = convert_and_check (semantic_type, expr);
4012     }
4013   /* Result type is the excess precision type, which should be
4014      large enough, so do not check.  */
4015   return convert (type, expr);
4016 }
4017
4018 /* Build and return a conditional expression IFEXP ? OP1 : OP2.  If
4019    IFEXP_BCP then the condition is a call to __builtin_constant_p, and
4020    if folded to an integer constant then the unselected half may
4021    contain arbitrary operations not normally permitted in constant
4022    expressions.  Set the location of the expression to LOC.  */
4023
4024 tree
4025 build_conditional_expr (location_t colon_loc, tree ifexp, bool ifexp_bcp,
4026                         tree op1, tree op1_original_type, tree op2,
4027                         tree op2_original_type)
4028 {
4029   tree type1;
4030   tree type2;
4031   enum tree_code code1;
4032   enum tree_code code2;
4033   tree result_type = NULL;
4034   tree semantic_result_type = NULL;
4035   tree orig_op1 = op1, orig_op2 = op2;
4036   bool int_const, op1_int_operands, op2_int_operands, int_operands;
4037   bool ifexp_int_operands;
4038   tree ret;
4039
4040   op1_int_operands = EXPR_INT_CONST_OPERANDS (orig_op1);
4041   if (op1_int_operands)
4042     op1 = remove_c_maybe_const_expr (op1);
4043   op2_int_operands = EXPR_INT_CONST_OPERANDS (orig_op2);
4044   if (op2_int_operands)
4045     op2 = remove_c_maybe_const_expr (op2);
4046   ifexp_int_operands = EXPR_INT_CONST_OPERANDS (ifexp);
4047   if (ifexp_int_operands)
4048     ifexp = remove_c_maybe_const_expr (ifexp);
4049
4050   /* Promote both alternatives.  */
4051
4052   if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
4053     op1 = default_conversion (op1);
4054   if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
4055     op2 = default_conversion (op2);
4056
4057   if (TREE_CODE (ifexp) == ERROR_MARK
4058       || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
4059       || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
4060     return error_mark_node;
4061
4062   type1 = TREE_TYPE (op1);
4063   code1 = TREE_CODE (type1);
4064   type2 = TREE_TYPE (op2);
4065   code2 = TREE_CODE (type2);
4066
4067   /* C90 does not permit non-lvalue arrays in conditional expressions.
4068      In C99 they will be pointers by now.  */
4069   if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
4070     {
4071       error_at (colon_loc, "non-lvalue array in conditional expression");
4072       return error_mark_node;
4073     }
4074
4075   if ((TREE_CODE (op1) == EXCESS_PRECISION_EXPR
4076        || TREE_CODE (op2) == EXCESS_PRECISION_EXPR)
4077       && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4078           || code1 == COMPLEX_TYPE)
4079       && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
4080           || code2 == COMPLEX_TYPE))
4081     {
4082       semantic_result_type = c_common_type (type1, type2);
4083       if (TREE_CODE (op1) == EXCESS_PRECISION_EXPR)
4084         {
4085           op1 = TREE_OPERAND (op1, 0);
4086           type1 = TREE_TYPE (op1);
4087           gcc_assert (TREE_CODE (type1) == code1);
4088         }
4089       if (TREE_CODE (op2) == EXCESS_PRECISION_EXPR)
4090         {
4091           op2 = TREE_OPERAND (op2, 0);
4092           type2 = TREE_TYPE (op2);
4093           gcc_assert (TREE_CODE (type2) == code2);
4094         }
4095     }
4096
4097   if (warn_cxx_compat)
4098     {
4099       tree t1 = op1_original_type ? op1_original_type : TREE_TYPE (orig_op1);
4100       tree t2 = op2_original_type ? op2_original_type : TREE_TYPE (orig_op2);
4101
4102       if (TREE_CODE (t1) == ENUMERAL_TYPE
4103           && TREE_CODE (t2) == ENUMERAL_TYPE
4104           && TYPE_MAIN_VARIANT (t1) != TYPE_MAIN_VARIANT (t2))
4105         warning_at (colon_loc, OPT_Wc___compat,
4106                     ("different enum types in conditional is "
4107                      "invalid in C++: %qT vs %qT"),
4108                     t1, t2);
4109     }
4110
4111   /* Quickly detect the usual case where op1 and op2 have the same type
4112      after promotion.  */
4113   if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
4114     {
4115       if (type1 == type2)
4116         result_type = type1;
4117       else
4118         result_type = TYPE_MAIN_VARIANT (type1);
4119     }
4120   else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
4121             || code1 == COMPLEX_TYPE)
4122            && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
4123                || code2 == COMPLEX_TYPE))
4124     {
4125       result_type = c_common_type (type1, type2);
4126       do_warn_double_promotion (result_type, type1, type2,
4127                                 "implicit conversion from %qT to %qT to "
4128                                 "match other result of conditional",
4129                                 colon_loc);
4130
4131       /* If -Wsign-compare, warn here if type1 and type2 have
4132          different signedness.  We'll promote the signed to unsigned
4133          and later code won't know it used to be different.
4134          Do this check on the original types, so that explicit casts
4135          will be considered, but default promotions won't.  */
4136       if (c_inhibit_evaluation_warnings == 0)
4137         {
4138           int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
4139           int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
4140
4141           if (unsigned_op1 ^ unsigned_op2)
4142             {
4143               bool ovf;
4144
4145               /* Do not warn if the result type is signed, since the
4146                  signed type will only be chosen if it can represent
4147                  all the values of the unsigned type.  */
4148               if (!TYPE_UNSIGNED (result_type))
4149                 /* OK */;
4150               else
4151                 {
4152                   bool op1_maybe_const = true;
4153                   bool op2_maybe_const = true;
4154
4155                   /* Do not warn if the signed quantity is an
4156                      unsuffixed integer literal (or some static
4157                      constant expression involving such literals) and
4158                      it is non-negative.  This warning requires the
4159                      operands to be folded for best results, so do
4160                      that folding in this case even without
4161                      warn_sign_compare to avoid warning options
4162                      possibly affecting code generation.  */
4163                   c_inhibit_evaluation_warnings
4164                     += (ifexp == truthvalue_false_node);
4165                   op1 = c_fully_fold (op1, require_constant_value,
4166                                       &op1_maybe_const);
4167                   c_inhibit_evaluation_warnings
4168                     -= (ifexp == truthvalue_false_node);
4169
4170                   c_inhibit_evaluation_warnings
4171                     += (ifexp == truthvalue_true_node);
4172                   op2 = c_fully_fold (op2, require_constant_value,
4173                                       &op2_maybe_const);
4174                   c_inhibit_evaluation_warnings
4175                     -= (ifexp == truthvalue_true_node);
4176
4177                   if (warn_sign_compare)
4178                     {
4179                       if ((unsigned_op2
4180                            && tree_expr_nonnegative_warnv_p (op1, &ovf))
4181                           || (unsigned_op1
4182                               && tree_expr_nonnegative_warnv_p (op2, &ovf)))
4183                         /* OK */;
4184                       else
4185                         warning_at (colon_loc, OPT_Wsign_compare,
4186                                     ("signed and unsigned type in "
4187                                      "conditional expression"));
4188                     }
4189                   if (!op1_maybe_const || TREE_CODE (op1) != INTEGER_CST)
4190                     op1 = c_wrap_maybe_const (op1, !op1_maybe_const);
4191                   if (!op2_maybe_const || TREE_CODE (op2) != INTEGER_CST)
4192                     op2 = c_wrap_maybe_const (op2, !op2_maybe_const);
4193                 }
4194             }
4195         }
4196     }
4197   else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
4198     {
4199       if (code1 != VOID_TYPE || code2 != VOID_TYPE)
4200         pedwarn (colon_loc, OPT_pedantic,
4201                  "ISO C forbids conditional expr with only one void side");
4202       result_type = void_type_node;
4203     }
4204   else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
4205     {
4206       addr_space_t as1 = TYPE_ADDR_SPACE (TREE_TYPE (type1));
4207       addr_space_t as2 = TYPE_ADDR_SPACE (TREE_TYPE (type2));
4208       addr_space_t as_common;
4209
4210       if (comp_target_types (colon_loc, type1, type2))
4211         result_type = common_pointer_type (type1, type2);
4212       else if (null_pointer_constant_p (orig_op1))
4213         result_type = type2;
4214       else if (null_pointer_constant_p (orig_op2))
4215         result_type = type1;
4216       else if (!addr_space_superset (as1, as2, &as_common))
4217         {
4218           error_at (colon_loc, "pointers to disjoint address spaces "
4219                     "used in conditional expression");
4220           return error_mark_node;
4221         }
4222       else if (VOID_TYPE_P (TREE_TYPE (type1)))
4223         {
4224           if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
4225             pedwarn (colon_loc, OPT_pedantic,
4226                      "ISO C forbids conditional expr between "
4227                      "%<void *%> and function pointer");
4228           result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
4229                                                           TREE_TYPE (type2)));
4230         }
4231       else if (VOID_TYPE_P (TREE_TYPE (type2)))
4232         {
4233           if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
4234             pedwarn (colon_loc, OPT_pedantic,
4235                      "ISO C forbids conditional expr between "
4236                      "%<void *%> and function pointer");
4237           result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
4238                                                           TREE_TYPE (type1)));
4239         }
4240       /* Objective-C pointer comparisons are a bit more lenient.  */
4241       else if (objc_have_common_type (type1, type2, -3, NULL_TREE))
4242         result_type = objc_common_type (type1, type2);
4243       else
4244         {
4245           int qual = ENCODE_QUAL_ADDR_SPACE (as_common);
4246
4247           pedwarn (colon_loc, 0,
4248                    "pointer type mismatch in conditional expression");
4249           result_type = build_pointer_type
4250                           (build_qualified_type (void_type_node, qual));
4251         }
4252     }
4253   else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
4254     {
4255       if (!null_pointer_constant_p (orig_op2))
4256         pedwarn (colon_loc, 0,
4257                  "pointer/integer type mismatch in conditional expression");
4258       else
4259         {
4260           op2 = null_pointer_node;
4261         }
4262       result_type = type1;
4263     }
4264   else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
4265     {
4266       if (!null_pointer_constant_p (orig_op1))
4267         pedwarn (colon_loc, 0,
4268                  "pointer/integer type mismatch in conditional expression");
4269       else
4270         {
4271           op1 = null_pointer_node;
4272         }
4273       result_type = type2;
4274     }
4275
4276   if (!result_type)
4277     {
4278       if (flag_cond_mismatch)
4279         result_type = void_type_node;
4280       else
4281         {
4282           error_at (colon_loc, "type mismatch in conditional expression");
4283           return error_mark_node;
4284         }
4285     }
4286
4287   /* Merge const and volatile flags of the incoming types.  */
4288   result_type
4289     = build_type_variant (result_type,
4290                           TYPE_READONLY (type1) || TYPE_READONLY (type2),
4291                           TYPE_VOLATILE (type1) || TYPE_VOLATILE (type2));
4292
4293   op1 = ep_convert_and_check (result_type, op1, semantic_result_type);
4294   op2 = ep_convert_and_check (result_type, op2, semantic_result_type);
4295
4296   if (ifexp_bcp && ifexp == truthvalue_true_node)
4297     {
4298       op2_int_operands = true;
4299       op1 = c_fully_fold (op1, require_constant_value, NULL);
4300     }
4301   if (ifexp_bcp && ifexp == truthvalue_false_node)
4302     {
4303       op1_int_operands = true;
4304       op2 = c_fully_fold (op2, require_constant_value, NULL);
4305     }
4306   int_const = int_operands = (ifexp_int_operands
4307                               && op1_int_operands
4308                               && op2_int_operands);
4309   if (int_operands)
4310     {
4311       int_const = ((ifexp == truthvalue_true_node
4312                     && TREE_CODE (orig_op1) == INTEGER_CST
4313                     && !TREE_OVERFLOW (orig_op1))
4314                    || (ifexp == truthvalue_false_node
4315                        && TREE_CODE (orig_op2) == INTEGER_CST
4316                        && !TREE_OVERFLOW (orig_op2)));
4317     }
4318   if (int_const || (ifexp_bcp && TREE_CODE (ifexp) == INTEGER_CST))
4319     ret = fold_build3_loc (colon_loc, COND_EXPR, result_type, ifexp, op1, op2);
4320   else
4321     {
4322       ret = build3 (COND_EXPR, result_type, ifexp, op1, op2);
4323       if (int_operands)
4324         ret = note_integer_operands (ret);
4325     }
4326   if (semantic_result_type)
4327     ret = build1 (EXCESS_PRECISION_EXPR, semantic_result_type, ret);
4328
4329   protected_set_expr_location (ret, colon_loc);
4330   return ret;
4331 }
4332 \f
4333 /* Return a compound expression that performs two expressions and
4334    returns the value of the second of them.
4335
4336    LOC is the location of the COMPOUND_EXPR.  */
4337
4338 tree
4339 build_compound_expr (location_t loc, tree expr1, tree expr2)
4340 {
4341   bool expr1_int_operands, expr2_int_operands;
4342   tree eptype = NULL_TREE;
4343   tree ret;
4344
4345   expr1_int_operands = EXPR_INT_CONST_OPERANDS (expr1);
4346   if (expr1_int_operands)
4347     expr1 = remove_c_maybe_const_expr (expr1);
4348   expr2_int_operands = EXPR_INT_CONST_OPERANDS (expr2);
4349   if (expr2_int_operands)
4350     expr2 = remove_c_maybe_const_expr (expr2);
4351
4352   if (TREE_CODE (expr1) == EXCESS_PRECISION_EXPR)
4353     expr1 = TREE_OPERAND (expr1, 0);
4354   if (TREE_CODE (expr2) == EXCESS_PRECISION_EXPR)
4355     {
4356       eptype = TREE_TYPE (expr2);
4357       expr2 = TREE_OPERAND (expr2, 0);
4358     }
4359
4360   if (!TREE_SIDE_EFFECTS (expr1))
4361     {
4362       /* The left-hand operand of a comma expression is like an expression
4363          statement: with -Wunused, we should warn if it doesn't have
4364          any side-effects, unless it was explicitly cast to (void).  */
4365       if (warn_unused_value)
4366         {
4367           if (VOID_TYPE_P (TREE_TYPE (expr1))
4368               && CONVERT_EXPR_P (expr1))
4369             ; /* (void) a, b */
4370           else if (VOID_TYPE_P (TREE_TYPE (expr1))
4371                    && TREE_CODE (expr1) == COMPOUND_EXPR
4372                    && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
4373             ; /* (void) a, (void) b, c */
4374           else
4375             warning_at (loc, OPT_Wunused_value,
4376                         "left-hand operand of comma expression has no effect");
4377         }
4378     }
4379
4380   /* With -Wunused, we should also warn if the left-hand operand does have
4381      side-effects, but computes a value which is not used.  For example, in
4382      `foo() + bar(), baz()' the result of the `+' operator is not used,
4383      so we should issue a warning.  */
4384   else if (warn_unused_value)
4385     warn_if_unused_value (expr1, loc);
4386
4387   if (expr2 == error_mark_node)
4388     return error_mark_node;
4389
4390   ret = build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
4391
4392   if (flag_isoc99
4393       && expr1_int_operands
4394       && expr2_int_operands)
4395     ret = note_integer_operands (ret);
4396
4397   if (eptype)
4398     ret = build1 (EXCESS_PRECISION_EXPR, eptype, ret);
4399
4400   protected_set_expr_location (ret, loc);
4401   return ret;
4402 }
4403
4404 /* Issue -Wcast-qual warnings when appropriate.  TYPE is the type to
4405    which we are casting.  OTYPE is the type of the expression being
4406    cast.  Both TYPE and OTYPE are pointer types.  LOC is the location
4407    of the cast.  -Wcast-qual appeared on the command line.  Named
4408    address space qualifiers are not handled here, because they result
4409    in different warnings.  */
4410
4411 static void
4412 handle_warn_cast_qual (location_t loc, tree type, tree otype)
4413 {
4414   tree in_type = type;
4415   tree in_otype = otype;
4416   int added = 0;
4417   int discarded = 0;
4418   bool is_const;
4419
4420   /* Check that the qualifiers on IN_TYPE are a superset of the
4421      qualifiers of IN_OTYPE.  The outermost level of POINTER_TYPE
4422      nodes is uninteresting and we stop as soon as we hit a
4423      non-POINTER_TYPE node on either type.  */
4424   do
4425     {
4426       in_otype = TREE_TYPE (in_otype);
4427       in_type = TREE_TYPE (in_type);
4428
4429       /* GNU C allows cv-qualified function types.  'const' means the
4430          function is very pure, 'volatile' means it can't return.  We
4431          need to warn when such qualifiers are added, not when they're
4432          taken away.  */
4433       if (TREE_CODE (in_otype) == FUNCTION_TYPE
4434           && TREE_CODE (in_type) == FUNCTION_TYPE)
4435         added |= (TYPE_QUALS_NO_ADDR_SPACE (in_type)
4436                   & ~TYPE_QUALS_NO_ADDR_SPACE (in_otype));
4437       else
4438         discarded |= (TYPE_QUALS_NO_ADDR_SPACE (in_otype)
4439                       & ~TYPE_QUALS_NO_ADDR_SPACE (in_type));
4440     }
4441   while (TREE_CODE (in_type) == POINTER_TYPE
4442          && TREE_CODE (in_otype) == POINTER_TYPE);
4443
4444   if (added)
4445     warning_at (loc, OPT_Wcast_qual,
4446                 "cast adds %q#v qualifier to function type", added);
4447
4448   if (discarded)
4449     /* There are qualifiers present in IN_OTYPE that are not present
4450        in IN_TYPE.  */
4451     warning_at (loc, OPT_Wcast_qual,
4452                 "cast discards %q#v qualifier from pointer target type",
4453                 discarded);
4454
4455   if (added || discarded)
4456     return;
4457
4458   /* A cast from **T to const **T is unsafe, because it can cause a
4459      const value to be changed with no additional warning.  We only
4460      issue this warning if T is the same on both sides, and we only
4461      issue the warning if there are the same number of pointers on
4462      both sides, as otherwise the cast is clearly unsafe anyhow.  A
4463      cast is unsafe when a qualifier is added at one level and const
4464      is not present at all outer levels.
4465
4466      To issue this warning, we check at each level whether the cast
4467      adds new qualifiers not already seen.  We don't need to special
4468      case function types, as they won't have the same
4469      TYPE_MAIN_VARIANT.  */
4470
4471   if (TYPE_MAIN_VARIANT (in_type) != TYPE_MAIN_VARIANT (in_otype))
4472     return;
4473   if (TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE)
4474     return;
4475
4476   in_type = type;
4477   in_otype = otype;
4478   is_const = TYPE_READONLY (TREE_TYPE (in_type));
4479   do
4480     {
4481       in_type = TREE_TYPE (in_type);
4482       in_otype = TREE_TYPE (in_otype);
4483       if ((TYPE_QUALS (in_type) &~ TYPE_QUALS (in_otype)) != 0
4484           && !is_const)
4485         {
4486           warning_at (loc, OPT_Wcast_qual,
4487                       "to be safe all intermediate pointers in cast from "
4488                       "%qT to %qT must be %<const%> qualified",
4489                       otype, type);
4490           break;
4491         }
4492       if (is_const)
4493         is_const = TYPE_READONLY (in_type);
4494     }
4495   while (TREE_CODE (in_type) == POINTER_TYPE);
4496 }
4497
4498 /* Build an expression representing a cast to type TYPE of expression EXPR.
4499    LOC is the location of the cast-- typically the open paren of the cast.  */
4500
4501 tree
4502 build_c_cast (location_t loc, tree type, tree expr)
4503 {
4504   tree value;
4505
4506   if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
4507     expr = TREE_OPERAND (expr, 0);
4508
4509   value = expr;
4510
4511   if (type == error_mark_node || expr == error_mark_node)
4512     return error_mark_node;
4513
4514   /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
4515      only in <protocol> qualifications.  But when constructing cast expressions,
4516      the protocols do matter and must be kept around.  */
4517   if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
4518     return build1 (NOP_EXPR, type, expr);
4519
4520   type = TYPE_MAIN_VARIANT (type);
4521
4522   if (TREE_CODE (type) == ARRAY_TYPE)
4523     {
4524       error_at (loc, "cast specifies array type");
4525       return error_mark_node;
4526     }
4527
4528   if (TREE_CODE (type) == FUNCTION_TYPE)
4529     {
4530       error_at (loc, "cast specifies function type");
4531       return error_mark_node;
4532     }
4533
4534   if (!VOID_TYPE_P (type))
4535     {
4536       value = require_complete_type (value);
4537       if (value == error_mark_node)
4538         return error_mark_node;
4539     }
4540
4541   if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
4542     {
4543       if (TREE_CODE (type) == RECORD_TYPE
4544           || TREE_CODE (type) == UNION_TYPE)
4545         pedwarn (loc, OPT_pedantic,
4546                  "ISO C forbids casting nonscalar to the same type");
4547     }
4548   else if (TREE_CODE (type) == UNION_TYPE)
4549     {
4550       tree field;
4551
4552       for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
4553         if (TREE_TYPE (field) != error_mark_node
4554             && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
4555                           TYPE_MAIN_VARIANT (TREE_TYPE (value))))
4556           break;
4557
4558       if (field)
4559         {
4560           tree t;
4561           bool maybe_const = true;
4562
4563           pedwarn (loc, OPT_pedantic, "ISO C forbids casts to union type");
4564           t = c_fully_fold (value, false, &maybe_const);
4565           t = build_constructor_single (type, field, t);
4566           if (!maybe_const)
4567             t = c_wrap_maybe_const (t, true);
4568           t = digest_init (loc, type, t,
4569                            NULL_TREE, false, true, 0);
4570           TREE_CONSTANT (t) = TREE_CONSTANT (value);
4571           return t;
4572         }
4573       error_at (loc, "cast to union type from type not present in union");
4574       return error_mark_node;
4575     }
4576   else
4577     {
4578       tree otype, ovalue;
4579
4580       if (type == void_type_node)
4581         {
4582           tree t = build1 (CONVERT_EXPR, type, value);
4583           SET_EXPR_LOCATION (t, loc);
4584           return t;
4585         }
4586
4587       otype = TREE_TYPE (value);
4588
4589       /* Optionally warn about potentially worrisome casts.  */
4590       if (warn_cast_qual
4591           && TREE_CODE (type) == POINTER_TYPE
4592           && TREE_CODE (otype) == POINTER_TYPE)
4593         handle_warn_cast_qual (loc, type, otype);
4594
4595       /* Warn about conversions between pointers to disjoint
4596          address spaces.  */
4597       if (TREE_CODE (type) == POINTER_TYPE
4598           && TREE_CODE (otype) == POINTER_TYPE
4599           && !null_pointer_constant_p (value))
4600         {
4601           addr_space_t as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
4602           addr_space_t as_from = TYPE_ADDR_SPACE (TREE_TYPE (otype));
4603           addr_space_t as_common;
4604
4605           if (!addr_space_superset (as_to, as_from, &as_common))
4606             {
4607               if (ADDR_SPACE_GENERIC_P (as_from))
4608                 warning_at (loc, 0, "cast to %s address space pointer "
4609                             "from disjoint generic address space pointer",
4610                             c_addr_space_name (as_to));
4611
4612               else if (ADDR_SPACE_GENERIC_P (as_to))
4613                 warning_at (loc, 0, "cast to generic address space pointer "
4614                             "from disjoint %s address space pointer",
4615                             c_addr_space_name (as_from));
4616
4617               else
4618                 warning_at (loc, 0, "cast to %s address space pointer "
4619                             "from disjoint %s address space pointer",
4620                             c_addr_space_name (as_to),
4621                             c_addr_space_name (as_from));
4622             }
4623         }
4624
4625       /* Warn about possible alignment problems.  */
4626       if (STRICT_ALIGNMENT
4627           && TREE_CODE (type) == POINTER_TYPE
4628           && TREE_CODE (otype) == POINTER_TYPE
4629           && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
4630           && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
4631           /* Don't warn about opaque types, where the actual alignment
4632              restriction is unknown.  */
4633           && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
4634                 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
4635                && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
4636           && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
4637         warning_at (loc, OPT_Wcast_align,
4638                     "cast increases required alignment of target type");
4639
4640       if (TREE_CODE (type) == INTEGER_TYPE
4641           && TREE_CODE (otype) == POINTER_TYPE
4642           && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
4643       /* Unlike conversion of integers to pointers, where the
4644          warning is disabled for converting constants because
4645          of cases such as SIG_*, warn about converting constant
4646          pointers to integers. In some cases it may cause unwanted
4647          sign extension, and a warning is appropriate.  */
4648         warning_at (loc, OPT_Wpointer_to_int_cast,
4649                     "cast from pointer to integer of different size");
4650
4651       if (TREE_CODE (value) == CALL_EXPR
4652           && TREE_CODE (type) != TREE_CODE (otype))
4653         warning_at (loc, OPT_Wbad_function_cast,
4654                     "cast from function call of type %qT "
4655                     "to non-matching type %qT", otype, type);
4656
4657       if (TREE_CODE (type) == POINTER_TYPE
4658           && TREE_CODE (otype) == INTEGER_TYPE
4659           && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
4660           /* Don't warn about converting any constant.  */
4661           && !TREE_CONSTANT (value))
4662         warning_at (loc,
4663                     OPT_Wint_to_pointer_cast, "cast to pointer from integer "
4664                     "of different size");
4665
4666       if (warn_strict_aliasing <= 2)
4667         strict_aliasing_warning (otype, type, expr);
4668
4669       /* If pedantic, warn for conversions between function and object
4670          pointer types, except for converting a null pointer constant
4671          to function pointer type.  */
4672       if (pedantic
4673           && TREE_CODE (type) == POINTER_TYPE
4674           && TREE_CODE (otype) == POINTER_TYPE
4675           && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
4676           && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
4677         pedwarn (loc, OPT_pedantic, "ISO C forbids "
4678                  "conversion of function pointer to object pointer type");
4679
4680       if (pedantic
4681           && TREE_CODE (type) == POINTER_TYPE
4682           && TREE_CODE (otype) == POINTER_TYPE
4683           && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
4684           && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
4685           && !null_pointer_constant_p (value))
4686         pedwarn (loc, OPT_pedantic, "ISO C forbids "
4687                  "conversion of object pointer to function pointer type");
4688
4689       ovalue = value;
4690       value = convert (type, value);
4691
4692       /* Ignore any integer overflow caused by the cast.  */
4693       if (TREE_CODE (value) == INTEGER_CST && !FLOAT_TYPE_P (otype))
4694         {
4695           if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
4696             {
4697               if (!TREE_OVERFLOW (value))
4698                 {
4699                   /* Avoid clobbering a shared constant.  */
4700                   value = copy_node (value);
4701                   TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
4702                 }
4703             }
4704           else if (TREE_OVERFLOW (value))
4705             /* Reset VALUE's overflow flags, ensuring constant sharing.  */
4706             value = build_int_cst_wide (TREE_TYPE (value),
4707                                         TREE_INT_CST_LOW (value),
4708                                         TREE_INT_CST_HIGH (value));
4709         }
4710     }
4711
4712   /* Don't let a cast be an lvalue.  */
4713   if (value == expr)
4714     value = non_lvalue_loc (loc, value);
4715
4716   /* Don't allow the results of casting to floating-point or complex
4717      types be confused with actual constants, or casts involving
4718      integer and pointer types other than direct integer-to-integer
4719      and integer-to-pointer be confused with integer constant
4720      expressions and null pointer constants.  */
4721   if (TREE_CODE (value) == REAL_CST
4722       || TREE_CODE (value) == COMPLEX_CST
4723       || (TREE_CODE (value) == INTEGER_CST
4724           && !((TREE_CODE (expr) == INTEGER_CST
4725                 && INTEGRAL_TYPE_P (TREE_TYPE (expr)))
4726                || TREE_CODE (expr) == REAL_CST
4727                || TREE_CODE (expr) == COMPLEX_CST)))
4728       value = build1 (NOP_EXPR, type, value);
4729
4730   if (CAN_HAVE_LOCATION_P (value))
4731     SET_EXPR_LOCATION (value, loc);
4732   return value;
4733 }
4734
4735 /* Interpret a cast of expression EXPR to type TYPE.  LOC is the
4736    location of the open paren of the cast, or the position of the cast
4737    expr.  */
4738 tree
4739 c_cast_expr (location_t loc, struct c_type_name *type_name, tree expr)
4740 {
4741   tree type;
4742   tree type_expr = NULL_TREE;
4743   bool type_expr_const = true;
4744   tree ret;
4745   int saved_wsp = warn_strict_prototypes;
4746
4747   /* This avoids warnings about unprototyped casts on
4748      integers.  E.g. "#define SIG_DFL (void(*)())0".  */
4749   if (TREE_CODE (expr) == INTEGER_CST)
4750     warn_strict_prototypes = 0;
4751   type = groktypename (type_name, &type_expr, &type_expr_const);
4752   warn_strict_prototypes = saved_wsp;
4753
4754   ret = build_c_cast (loc, type, expr);
4755   if (type_expr)
4756     {
4757       ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret), type_expr, ret);
4758       C_MAYBE_CONST_EXPR_NON_CONST (ret) = !type_expr_const;
4759       SET_EXPR_LOCATION (ret, loc);
4760     }
4761
4762   if (CAN_HAVE_LOCATION_P (ret) && !EXPR_HAS_LOCATION (ret))
4763     SET_EXPR_LOCATION (ret, loc);
4764
4765   /* C++ does not permits types to be defined in a cast, but it
4766      allows references to incomplete types.  */
4767   if (warn_cxx_compat && type_name->specs->typespec_kind == ctsk_tagdef)
4768     warning_at (loc, OPT_Wc___compat,
4769                 "defining a type in a cast is invalid in C++");
4770
4771   return ret;
4772 }
4773 \f
4774 /* Build an assignment expression of lvalue LHS from value RHS.
4775    If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
4776    may differ from TREE_TYPE (LHS) for an enum bitfield.
4777    MODIFYCODE is the code for a binary operator that we use
4778    to combine the old value of LHS with RHS to get the new value.
4779    Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4780    If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
4781    which may differ from TREE_TYPE (RHS) for an enum value.
4782
4783    LOCATION is the location of the MODIFYCODE operator.
4784    RHS_LOC is the location of the RHS.  */
4785
4786 tree
4787 build_modify_expr (location_t location, tree lhs, tree lhs_origtype,
4788                    enum tree_code modifycode,
4789                    location_t rhs_loc, tree rhs, tree rhs_origtype)
4790 {
4791   tree result;
4792   tree newrhs;
4793   tree rhs_semantic_type = NULL_TREE;
4794   tree lhstype = TREE_TYPE (lhs);
4795   tree olhstype = lhstype;
4796   bool npc;
4797
4798   /* Types that aren't fully specified cannot be used in assignments.  */
4799   lhs = require_complete_type (lhs);
4800
4801   /* Avoid duplicate error messages from operands that had errors.  */
4802   if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
4803     return error_mark_node;
4804
4805   /* For ObjC properties, defer this check.  */
4806   if (!objc_is_property_ref (lhs) && !lvalue_or_else (location, lhs, lv_assign))
4807     return error_mark_node;
4808
4809   if (TREE_CODE (rhs) == EXCESS_PRECISION_EXPR)
4810     {
4811       rhs_semantic_type = TREE_TYPE (rhs);
4812       rhs = TREE_OPERAND (rhs, 0);
4813     }
4814
4815   newrhs = rhs;
4816
4817   if (TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
4818     {
4819       tree inner = build_modify_expr (location, C_MAYBE_CONST_EXPR_EXPR (lhs),
4820                                       lhs_origtype, modifycode, rhs_loc, rhs,
4821                                       rhs_origtype);
4822       if (inner == error_mark_node)
4823         return error_mark_node;
4824       result = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
4825                        C_MAYBE_CONST_EXPR_PRE (lhs), inner);
4826       gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (lhs));
4827       C_MAYBE_CONST_EXPR_NON_CONST (result) = 1;
4828       protected_set_expr_location (result, location);
4829       return result;
4830     }
4831
4832   /* If a binary op has been requested, combine the old LHS value with the RHS
4833      producing the value we should actually store into the LHS.  */
4834
4835   if (modifycode != NOP_EXPR)
4836     {
4837       lhs = c_fully_fold (lhs, false, NULL);
4838       lhs = stabilize_reference (lhs);
4839       newrhs = build_binary_op (location,
4840                                 modifycode, lhs, rhs, 1);
4841
4842       /* The original type of the right hand side is no longer
4843          meaningful.  */
4844       rhs_origtype = NULL_TREE;
4845     }
4846
4847   if (c_dialect_objc ())
4848     {
4849       /* Check if we are modifying an Objective-C property reference;
4850          if so, we need to generate setter calls.  */
4851       result = objc_maybe_build_modify_expr (lhs, newrhs);
4852       if (result)
4853         return result;
4854
4855       /* Else, do the check that we postponed for Objective-C.  */
4856       if (!lvalue_or_else (location, lhs, lv_assign))
4857         return error_mark_node;
4858     }
4859
4860   /* Give an error for storing in something that is 'const'.  */
4861
4862   if (TYPE_READONLY (lhstype)
4863       || ((TREE_CODE (lhstype) == RECORD_TYPE
4864            || TREE_CODE (lhstype) == UNION_TYPE)
4865           && C_TYPE_FIELDS_READONLY (lhstype)))
4866     {
4867       readonly_error (lhs, lv_assign);
4868       return error_mark_node;
4869     }
4870   else if (TREE_READONLY (lhs))
4871     readonly_warning (lhs, lv_assign);
4872
4873   /* If storing into a structure or union member,
4874      it has probably been given type `int'.
4875      Compute the type that would go with
4876      the actual amount of storage the member occupies.  */
4877
4878   if (TREE_CODE (lhs) == COMPONENT_REF
4879       && (TREE_CODE (lhstype) == INTEGER_TYPE
4880           || TREE_CODE (lhstype) == BOOLEAN_TYPE
4881           || TREE_CODE (lhstype) == REAL_TYPE
4882           || TREE_CODE (lhstype) == ENUMERAL_TYPE))
4883     lhstype = TREE_TYPE (get_unwidened (lhs, 0));
4884
4885   /* If storing in a field that is in actuality a short or narrower than one,
4886      we must store in the field in its actual type.  */
4887
4888   if (lhstype != TREE_TYPE (lhs))
4889     {
4890       lhs = copy_node (lhs);
4891       TREE_TYPE (lhs) = lhstype;
4892     }
4893
4894   /* Issue -Wc++-compat warnings about an assignment to an enum type
4895      when LHS does not have its original type.  This happens for,
4896      e.g., an enum bitfield in a struct.  */
4897   if (warn_cxx_compat
4898       && lhs_origtype != NULL_TREE
4899       && lhs_origtype != lhstype
4900       && TREE_CODE (lhs_origtype) == ENUMERAL_TYPE)
4901     {
4902       tree checktype = (rhs_origtype != NULL_TREE
4903                         ? rhs_origtype
4904                         : TREE_TYPE (rhs));
4905       if (checktype != error_mark_node
4906           && TYPE_MAIN_VARIANT (checktype) != TYPE_MAIN_VARIANT (lhs_origtype))
4907         warning_at (location, OPT_Wc___compat,
4908                     "enum conversion in assignment is invalid in C++");
4909     }
4910
4911   /* Convert new value to destination type.  Fold it first, then
4912      restore any excess precision information, for the sake of
4913      conversion warnings.  */
4914
4915   npc = null_pointer_constant_p (newrhs);
4916   newrhs = c_fully_fold (newrhs, false, NULL);
4917   if (rhs_semantic_type)
4918     newrhs = build1 (EXCESS_PRECISION_EXPR, rhs_semantic_type, newrhs);
4919   newrhs = convert_for_assignment (location, lhstype, newrhs, rhs_origtype,
4920                                    ic_assign, npc, NULL_TREE, NULL_TREE, 0);
4921   if (TREE_CODE (newrhs) == ERROR_MARK)
4922     return error_mark_node;
4923
4924   /* Emit ObjC write barrier, if necessary.  */
4925   if (c_dialect_objc () && flag_objc_gc)
4926     {
4927       result = objc_generate_write_barrier (lhs, modifycode, newrhs);
4928       if (result)
4929         {
4930           protected_set_expr_location (result, location);
4931           return result;
4932         }
4933     }
4934
4935   /* Scan operands.  */
4936
4937   result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
4938   TREE_SIDE_EFFECTS (result) = 1;
4939   protected_set_expr_location (result, location);
4940
4941   /* If we got the LHS in a different type for storing in,
4942      convert the result back to the nominal type of LHS
4943      so that the value we return always has the same type
4944      as the LHS argument.  */
4945
4946   if (olhstype == TREE_TYPE (result))
4947     return result;
4948
4949   result = convert_for_assignment (location, olhstype, result, rhs_origtype,
4950                                    ic_assign, false, NULL_TREE, NULL_TREE, 0);
4951   protected_set_expr_location (result, location);
4952   return result;
4953 }
4954 \f
4955 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
4956    This is used to implement -fplan9-extensions.  */
4957
4958 static bool
4959 find_anonymous_field_with_type (tree struct_type, tree type)
4960 {
4961   tree field;
4962   bool found;
4963
4964   gcc_assert (TREE_CODE (struct_type) == RECORD_TYPE
4965               || TREE_CODE (struct_type) == UNION_TYPE);
4966   found = false;
4967   for (field = TYPE_FIELDS (struct_type);
4968        field != NULL_TREE;
4969        field = TREE_CHAIN (field))
4970     {
4971       if (DECL_NAME (field) == NULL
4972           && comptypes (type, TYPE_MAIN_VARIANT (TREE_TYPE (field))))
4973         {
4974           if (found)
4975             return false;
4976           found = true;
4977         }
4978       else if (DECL_NAME (field) == NULL
4979                && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
4980                    || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
4981                && find_anonymous_field_with_type (TREE_TYPE (field), type))
4982         {
4983           if (found)
4984             return false;
4985           found = true;
4986         }
4987     }
4988   return found;
4989 }
4990
4991 /* RHS is an expression whose type is pointer to struct.  If there is
4992    an anonymous field in RHS with type TYPE, then return a pointer to
4993    that field in RHS.  This is used with -fplan9-extensions.  This
4994    returns NULL if no conversion could be found.  */
4995
4996 static tree
4997 convert_to_anonymous_field (location_t location, tree type, tree rhs)
4998 {
4999   tree rhs_struct_type, lhs_main_type;
5000   tree field, found_field;
5001   bool found_sub_field;
5002   tree ret;
5003
5004   gcc_assert (POINTER_TYPE_P (TREE_TYPE (rhs)));
5005   rhs_struct_type = TREE_TYPE (TREE_TYPE (rhs));
5006   gcc_assert (TREE_CODE (rhs_struct_type) == RECORD_TYPE
5007               || TREE_CODE (rhs_struct_type) == UNION_TYPE);
5008
5009   gcc_assert (POINTER_TYPE_P (type));
5010   lhs_main_type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
5011
5012   found_field = NULL_TREE;
5013   found_sub_field = false;
5014   for (field = TYPE_FIELDS (rhs_struct_type);
5015        field != NULL_TREE;
5016        field = TREE_CHAIN (field))
5017     {
5018       if (DECL_NAME (field) != NULL_TREE
5019           || (TREE_CODE (TREE_TYPE (field)) != RECORD_TYPE
5020               && TREE_CODE (TREE_TYPE (field)) != UNION_TYPE))
5021         continue;
5022       if (comptypes (lhs_main_type, TYPE_MAIN_VARIANT (TREE_TYPE (field))))
5023         {
5024           if (found_field != NULL_TREE)
5025             return NULL_TREE;
5026           found_field = field;
5027         }
5028       else if (find_anonymous_field_with_type (TREE_TYPE (field),
5029                                                lhs_main_type))
5030         {
5031           if (found_field != NULL_TREE)
5032             return NULL_TREE;
5033           found_field = field;
5034           found_sub_field = true;
5035         }
5036     }
5037
5038   if (found_field == NULL_TREE)
5039     return NULL_TREE;
5040
5041   ret = fold_build3_loc (location, COMPONENT_REF, TREE_TYPE (found_field),
5042                          build_fold_indirect_ref (rhs), found_field,
5043                          NULL_TREE);
5044   ret = build_fold_addr_expr_loc (location, ret);
5045
5046   if (found_sub_field)
5047     {
5048       ret = convert_to_anonymous_field (location, type, ret);
5049       gcc_assert (ret != NULL_TREE);
5050     }
5051
5052   return ret;
5053 }
5054
5055 /* Convert value RHS to type TYPE as preparation for an assignment to
5056    an lvalue of type TYPE.  If ORIGTYPE is not NULL_TREE, it is the
5057    original type of RHS; this differs from TREE_TYPE (RHS) for enum
5058    types.  NULL_POINTER_CONSTANT says whether RHS was a null pointer
5059    constant before any folding.
5060    The real work of conversion is done by `convert'.
5061    The purpose of this function is to generate error messages
5062    for assignments that are not allowed in C.
5063    ERRTYPE says whether it is argument passing, assignment,
5064    initialization or return.
5065
5066    LOCATION is the location of the RHS.
5067    FUNCTION is a tree for the function being called.
5068    PARMNUM is the number of the argument, for printing in error messages.  */
5069
5070 static tree
5071 convert_for_assignment (location_t location, tree type, tree rhs,
5072                         tree origtype, enum impl_conv errtype,
5073                         bool null_pointer_constant, tree fundecl,
5074                         tree function, int parmnum)
5075 {
5076   enum tree_code codel = TREE_CODE (type);
5077   tree orig_rhs = rhs;
5078   tree rhstype;
5079   enum tree_code coder;
5080   tree rname = NULL_TREE;
5081   bool objc_ok = false;
5082
5083   if (errtype == ic_argpass)
5084     {
5085       tree selector;
5086       /* Change pointer to function to the function itself for
5087          diagnostics.  */
5088       if (TREE_CODE (function) == ADDR_EXPR
5089           && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
5090         function = TREE_OPERAND (function, 0);
5091
5092       /* Handle an ObjC selector specially for diagnostics.  */
5093       selector = objc_message_selector ();
5094       rname = function;
5095       if (selector && parmnum > 2)
5096         {
5097           rname = selector;
5098           parmnum -= 2;
5099         }
5100     }
5101
5102   /* This macro is used to emit diagnostics to ensure that all format
5103      strings are complete sentences, visible to gettext and checked at
5104      compile time.  */
5105 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE)               \
5106   do {                                                                   \
5107     switch (errtype)                                                     \
5108       {                                                                  \
5109       case ic_argpass:                                                   \
5110         if (pedwarn (LOCATION, OPT, AR, parmnum, rname))                 \
5111           inform ((fundecl && !DECL_IS_BUILTIN (fundecl))                \
5112                   ? DECL_SOURCE_LOCATION (fundecl) : LOCATION,           \
5113                   "expected %qT but argument is of type %qT",            \
5114                   type, rhstype);                                        \
5115         break;                                                           \
5116       case ic_assign:                                                    \
5117         pedwarn (LOCATION, OPT, AS);                                     \
5118         break;                                                           \
5119       case ic_init:                                                      \
5120         pedwarn_init (LOCATION, OPT, IN);                                \
5121         break;                                                           \
5122       case ic_return:                                                    \
5123         pedwarn (LOCATION, OPT, RE);                                     \
5124         break;                                                           \
5125       default:                                                           \
5126         gcc_unreachable ();                                              \
5127       }                                                                  \
5128   } while (0)
5129
5130   /* This macro is used to emit diagnostics to ensure that all format
5131      strings are complete sentences, visible to gettext and checked at
5132      compile time.  It is the same as WARN_FOR_ASSIGNMENT but with an
5133      extra parameter to enumerate qualifiers.  */
5134
5135 #define WARN_FOR_QUALIFIERS(LOCATION, OPT, AR, AS, IN, RE, QUALS)        \
5136   do {                                                                   \
5137     switch (errtype)                                                     \
5138       {                                                                  \
5139       case ic_argpass:                                                   \
5140         if (pedwarn (LOCATION, OPT, AR, parmnum, rname, QUALS))          \
5141           inform ((fundecl && !DECL_IS_BUILTIN (fundecl))                \
5142                   ? DECL_SOURCE_LOCATION (fundecl) : LOCATION,           \
5143                   "expected %qT but argument is of type %qT",            \
5144                   type, rhstype);                                        \
5145         break;                                                           \
5146       case ic_assign:                                                    \
5147         pedwarn (LOCATION, OPT, AS, QUALS);                          \
5148         break;                                                           \
5149       case ic_init:                                                      \
5150         pedwarn (LOCATION, OPT, IN, QUALS);                          \
5151         break;                                                           \
5152       case ic_return:                                                    \
5153         pedwarn (LOCATION, OPT, RE, QUALS);                              \
5154         break;                                                           \
5155       default:                                                           \
5156         gcc_unreachable ();                                              \
5157       }                                                                  \
5158   } while (0)
5159
5160   if (TREE_CODE (rhs) == EXCESS_PRECISION_EXPR)
5161     rhs = TREE_OPERAND (rhs, 0);
5162
5163   rhstype = TREE_TYPE (rhs);
5164   coder = TREE_CODE (rhstype);
5165
5166   if (coder == ERROR_MARK)
5167     return error_mark_node;
5168
5169   if (c_dialect_objc ())
5170     {
5171       int parmno;
5172
5173       switch (errtype)
5174         {
5175         case ic_return:
5176           parmno = 0;
5177           break;
5178
5179         case ic_assign:
5180           parmno = -1;
5181           break;
5182
5183         case ic_init:
5184           parmno = -2;
5185           break;
5186
5187         default:
5188           parmno = parmnum;
5189           break;
5190         }
5191
5192       objc_ok = objc_compare_types (type, rhstype, parmno, rname);
5193     }
5194
5195   if (warn_cxx_compat)
5196     {
5197       tree checktype = origtype != NULL_TREE ? origtype : rhstype;
5198       if (checktype != error_mark_node
5199           && TREE_CODE (type) == ENUMERAL_TYPE
5200           && TYPE_MAIN_VARIANT (checktype) != TYPE_MAIN_VARIANT (type))
5201         {
5202           WARN_FOR_ASSIGNMENT (input_location, OPT_Wc___compat,
5203                                G_("enum conversion when passing argument "
5204                                   "%d of %qE is invalid in C++"),
5205                                G_("enum conversion in assignment is "
5206                                   "invalid in C++"),
5207                                G_("enum conversion in initialization is "
5208                                   "invalid in C++"),
5209                                G_("enum conversion in return is "
5210                                   "invalid in C++"));
5211         }
5212     }
5213
5214   if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
5215     return rhs;
5216
5217   if (coder == VOID_TYPE)
5218     {
5219       /* Except for passing an argument to an unprototyped function,
5220          this is a constraint violation.  When passing an argument to
5221          an unprototyped function, it is compile-time undefined;
5222          making it a constraint in that case was rejected in
5223          DR#252.  */
5224       error_at (location, "void value not ignored as it ought to be");
5225       return error_mark_node;
5226     }
5227   rhs = require_complete_type (rhs);
5228   if (rhs == error_mark_node)
5229     return error_mark_node;
5230   /* A type converts to a reference to it.
5231      This code doesn't fully support references, it's just for the
5232      special case of va_start and va_copy.  */
5233   if (codel == REFERENCE_TYPE
5234       && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
5235     {
5236       if (!lvalue_p (rhs))
5237         {
5238           error_at (location, "cannot pass rvalue to reference parameter");
5239           return error_mark_node;
5240         }
5241       if (!c_mark_addressable (rhs))
5242         return error_mark_node;
5243       rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
5244       SET_EXPR_LOCATION (rhs, location);
5245
5246       /* We already know that these two types are compatible, but they
5247          may not be exactly identical.  In fact, `TREE_TYPE (type)' is
5248          likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
5249          likely to be va_list, a typedef to __builtin_va_list, which
5250          is different enough that it will cause problems later.  */
5251       if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
5252         {
5253           rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
5254           SET_EXPR_LOCATION (rhs, location);
5255         }
5256
5257       rhs = build1 (NOP_EXPR, type, rhs);
5258       SET_EXPR_LOCATION (rhs, location);
5259       return rhs;
5260     }
5261   /* Some types can interconvert without explicit casts.  */
5262   else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
5263            && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
5264     return convert (type, rhs);
5265   /* Arithmetic types all interconvert, and enum is treated like int.  */
5266   else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
5267             || codel == FIXED_POINT_TYPE
5268             || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
5269             || codel == BOOLEAN_TYPE)
5270            && (coder == INTEGER_TYPE || coder == REAL_TYPE
5271                || coder == FIXED_POINT_TYPE
5272                || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
5273                || coder == BOOLEAN_TYPE))
5274     {
5275       tree ret;
5276       bool save = in_late_binary_op;
5277       if (codel == BOOLEAN_TYPE || codel == COMPLEX_TYPE)
5278         in_late_binary_op = true;
5279       ret = convert_and_check (type, orig_rhs);
5280       if (codel == BOOLEAN_TYPE || codel == COMPLEX_TYPE)
5281         in_late_binary_op = save;
5282       return ret;
5283     }
5284
5285   /* Aggregates in different TUs might need conversion.  */
5286   if ((codel == RECORD_TYPE || codel == UNION_TYPE)
5287       && codel == coder
5288       && comptypes (type, rhstype))
5289     return convert_and_check (type, rhs);
5290
5291   /* Conversion to a transparent union or record from its member types.
5292      This applies only to function arguments.  */
5293   if (((codel == UNION_TYPE || codel == RECORD_TYPE)
5294       && TYPE_TRANSPARENT_AGGR (type))
5295       && errtype == ic_argpass)
5296     {
5297       tree memb, marginal_memb = NULL_TREE;
5298
5299       for (memb = TYPE_FIELDS (type); memb ; memb = DECL_CHAIN (memb))
5300         {
5301           tree memb_type = TREE_TYPE (memb);
5302
5303           if (comptypes (TYPE_MAIN_VARIANT (memb_type),
5304                          TYPE_MAIN_VARIANT (rhstype)))
5305             break;
5306
5307           if (TREE_CODE (memb_type) != POINTER_TYPE)
5308             continue;
5309
5310           if (coder == POINTER_TYPE)
5311             {
5312               tree ttl = TREE_TYPE (memb_type);
5313               tree ttr = TREE_TYPE (rhstype);
5314
5315               /* Any non-function converts to a [const][volatile] void *
5316                  and vice versa; otherwise, targets must be the same.
5317                  Meanwhile, the lhs target must have all the qualifiers of
5318                  the rhs.  */
5319               if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
5320                   || comp_target_types (location, memb_type, rhstype))
5321                 {
5322                   /* If this type won't generate any warnings, use it.  */
5323                   if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
5324                       || ((TREE_CODE (ttr) == FUNCTION_TYPE
5325                            && TREE_CODE (ttl) == FUNCTION_TYPE)
5326                           ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
5327                              == TYPE_QUALS (ttr))
5328                           : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
5329                              == TYPE_QUALS (ttl))))
5330                     break;
5331
5332                   /* Keep looking for a better type, but remember this one.  */
5333                   if (!marginal_memb)
5334                     marginal_memb = memb;
5335                 }
5336             }
5337
5338           /* Can convert integer zero to any pointer type.  */
5339           if (null_pointer_constant)
5340             {
5341               rhs = null_pointer_node;
5342               break;
5343             }
5344         }
5345
5346       if (memb || marginal_memb)
5347         {
5348           if (!memb)
5349             {
5350               /* We have only a marginally acceptable member type;
5351                  it needs a warning.  */
5352               tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
5353               tree ttr = TREE_TYPE (rhstype);
5354
5355               /* Const and volatile mean something different for function
5356                  types, so the usual warnings are not appropriate.  */
5357               if (TREE_CODE (ttr) == FUNCTION_TYPE
5358                   && TREE_CODE (ttl) == FUNCTION_TYPE)
5359                 {
5360                   /* Because const and volatile on functions are
5361                      restrictions that say the function will not do
5362                      certain things, it is okay to use a const or volatile
5363                      function where an ordinary one is wanted, but not
5364                      vice-versa.  */
5365                   if (TYPE_QUALS_NO_ADDR_SPACE (ttl)
5366                       & ~TYPE_QUALS_NO_ADDR_SPACE (ttr))
5367                     WARN_FOR_QUALIFIERS (location, 0,
5368                                          G_("passing argument %d of %qE "
5369                                             "makes %q#v qualified function "
5370                                             "pointer from unqualified"),
5371                                          G_("assignment makes %q#v qualified "
5372                                             "function pointer from "
5373                                             "unqualified"),
5374                                          G_("initialization makes %q#v qualified "
5375                                             "function pointer from "
5376                                             "unqualified"),
5377                                          G_("return makes %q#v qualified function "
5378                                             "pointer from unqualified"),
5379                                          TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr));
5380                 }
5381               else if (TYPE_QUALS_NO_ADDR_SPACE (ttr)
5382                        & ~TYPE_QUALS_NO_ADDR_SPACE (ttl))
5383                 WARN_FOR_QUALIFIERS (location, 0,
5384                                      G_("passing argument %d of %qE discards "
5385                                         "%qv qualifier from pointer target type"),
5386                                      G_("assignment discards %qv qualifier "
5387                                         "from pointer target type"),
5388                                      G_("initialization discards %qv qualifier "
5389                                         "from pointer target type"),
5390                                      G_("return discards %qv qualifier from "
5391                                         "pointer target type"),
5392                                      TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl));
5393
5394               memb = marginal_memb;
5395             }
5396
5397           if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
5398             pedwarn (location, OPT_pedantic,
5399                      "ISO C prohibits argument conversion to union type");
5400
5401           rhs = fold_convert_loc (location, TREE_TYPE (memb), rhs);
5402           return build_constructor_single (type, memb, rhs);
5403         }
5404     }
5405
5406   /* Conversions among pointers */
5407   else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
5408            && (coder == codel))
5409     {
5410       tree ttl = TREE_TYPE (type);
5411       tree ttr = TREE_TYPE (rhstype);
5412       tree mvl = ttl;
5413       tree mvr = ttr;
5414       bool is_opaque_pointer;
5415       int target_cmp = 0;   /* Cache comp_target_types () result.  */
5416       addr_space_t asl;
5417       addr_space_t asr;
5418
5419       if (TREE_CODE (mvl) != ARRAY_TYPE)
5420         mvl = TYPE_MAIN_VARIANT (mvl);
5421       if (TREE_CODE (mvr) != ARRAY_TYPE)
5422         mvr = TYPE_MAIN_VARIANT (mvr);
5423       /* Opaque pointers are treated like void pointers.  */
5424       is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
5425
5426       /* The Plan 9 compiler permits a pointer to a struct to be
5427          automatically converted into a pointer to an anonymous field
5428          within the struct.  */
5429       if (flag_plan9_extensions
5430           && (TREE_CODE (mvl) == RECORD_TYPE || TREE_CODE(mvl) == UNION_TYPE)
5431           && (TREE_CODE (mvr) == RECORD_TYPE || TREE_CODE(mvr) == UNION_TYPE)
5432           && mvl != mvr)
5433         {
5434           tree new_rhs = convert_to_anonymous_field (location, type, rhs);
5435           if (new_rhs != NULL_TREE)
5436             {
5437               rhs = new_rhs;
5438               rhstype = TREE_TYPE (rhs);
5439               coder = TREE_CODE (rhstype);
5440               ttr = TREE_TYPE (rhstype);
5441               mvr = TYPE_MAIN_VARIANT (ttr);
5442             }
5443         }
5444
5445       /* C++ does not allow the implicit conversion void* -> T*.  However,
5446          for the purpose of reducing the number of false positives, we
5447          tolerate the special case of
5448
5449                 int *p = NULL;
5450
5451          where NULL is typically defined in C to be '(void *) 0'.  */
5452       if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
5453         warning_at (location, OPT_Wc___compat,
5454                     "request for implicit conversion "
5455                     "from %qT to %qT not permitted in C++", rhstype, type);
5456
5457       /* See if the pointers point to incompatible address spaces.  */
5458       asl = TYPE_ADDR_SPACE (ttl);
5459       asr = TYPE_ADDR_SPACE (ttr);
5460       if (!null_pointer_constant_p (rhs)
5461           && asr != asl && !targetm.addr_space.subset_p (asr, asl))
5462         {
5463           switch (errtype)
5464             {
5465             case ic_argpass:
5466               error_at (location, "passing argument %d of %qE from pointer to "
5467                         "non-enclosed address space", parmnum, rname);
5468               break;
5469             case ic_assign:
5470               error_at (location, "assignment from pointer to "
5471                         "non-enclosed address space");
5472               break;
5473             case ic_init:
5474               error_at (location, "initialization from pointer to "
5475                         "non-enclosed address space");
5476               break;
5477             case ic_return:
5478               error_at (location, "return from pointer to "
5479                         "non-enclosed address space");
5480               break;
5481             default:
5482               gcc_unreachable ();
5483             }
5484           return error_mark_node;
5485         }
5486
5487       /* Check if the right-hand side has a format attribute but the
5488          left-hand side doesn't.  */
5489       if (warn_missing_format_attribute
5490           && check_missing_format_attribute (type, rhstype))
5491         {
5492           switch (errtype)
5493           {
5494           case ic_argpass:
5495             warning_at (location, OPT_Wmissing_format_attribute,
5496                         "argument %d of %qE might be "
5497                         "a candidate for a format attribute",
5498                         parmnum, rname);
5499             break;
5500           case ic_assign:
5501             warning_at (location, OPT_Wmissing_format_attribute,
5502                         "assignment left-hand side might be "
5503                         "a candidate for a format attribute");
5504             break;
5505           case ic_init:
5506             warning_at (location, OPT_Wmissing_format_attribute,
5507                         "initialization left-hand side might be "
5508                         "a candidate for a format attribute");
5509             break;
5510           case ic_return:
5511             warning_at (location, OPT_Wmissing_format_attribute,
5512                         "return type might be "
5513                         "a candidate for a format attribute");
5514             break;
5515           default:
5516             gcc_unreachable ();
5517           }
5518         }
5519
5520       /* Any non-function converts to a [const][volatile] void *
5521          and vice versa; otherwise, targets must be the same.
5522          Meanwhile, the lhs target must have all the qualifiers of the rhs.  */
5523       if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
5524           || (target_cmp = comp_target_types (location, type, rhstype))
5525           || is_opaque_pointer
5526           || (c_common_unsigned_type (mvl)
5527               == c_common_unsigned_type (mvr)))
5528         {
5529           if (pedantic
5530               && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
5531                   ||
5532                   (VOID_TYPE_P (ttr)
5533                    && !null_pointer_constant
5534                    && TREE_CODE (ttl) == FUNCTION_TYPE)))
5535             WARN_FOR_ASSIGNMENT (location, OPT_pedantic,
5536                                  G_("ISO C forbids passing argument %d of "
5537                                     "%qE between function pointer "
5538                                     "and %<void *%>"),
5539                                  G_("ISO C forbids assignment between "
5540                                     "function pointer and %<void *%>"),
5541                                  G_("ISO C forbids initialization between "
5542                                     "function pointer and %<void *%>"),
5543                                  G_("ISO C forbids return between function "
5544                                     "pointer and %<void *%>"));
5545           /* Const and volatile mean something different for function types,
5546              so the usual warnings are not appropriate.  */
5547           else if (TREE_CODE (ttr) != FUNCTION_TYPE
5548                    && TREE_CODE (ttl) != FUNCTION_TYPE)
5549             {
5550               if (TYPE_QUALS_NO_ADDR_SPACE (ttr)
5551                   & ~TYPE_QUALS_NO_ADDR_SPACE (ttl))
5552                 {
5553                   WARN_FOR_QUALIFIERS (location, 0,
5554                                        G_("passing argument %d of %qE discards "
5555                                           "%qv qualifier from pointer target type"),
5556                                        G_("assignment discards %qv qualifier "
5557                                           "from pointer target type"),
5558                                        G_("initialization discards %qv qualifier "
5559                                           "from pointer target type"),
5560                                        G_("return discards %qv qualifier from "
5561                                           "pointer target type"),
5562                                        TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl));
5563                 }
5564               /* If this is not a case of ignoring a mismatch in signedness,
5565                  no warning.  */
5566               else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
5567                        || target_cmp)
5568                 ;
5569               /* If there is a mismatch, do warn.  */
5570               else if (warn_pointer_sign)
5571                 WARN_FOR_ASSIGNMENT (location, OPT_Wpointer_sign,
5572                                      G_("pointer targets in passing argument "
5573                                         "%d of %qE differ in signedness"),
5574                                      G_("pointer targets in assignment "
5575                                         "differ in signedness"),
5576                                      G_("pointer targets in initialization "
5577                                         "differ in signedness"),
5578                                      G_("pointer targets in return differ "
5579                                         "in signedness"));
5580             }
5581           else if (TREE_CODE (ttl) == FUNCTION_TYPE
5582                    && TREE_CODE (ttr) == FUNCTION_TYPE)
5583             {
5584               /* Because const and volatile on functions are restrictions
5585                  that say the function will not do certain things,
5586                  it is okay to use a const or volatile function
5587                  where an ordinary one is wanted, but not vice-versa.  */
5588               if (TYPE_QUALS_NO_ADDR_SPACE (ttl)
5589                   & ~TYPE_QUALS_NO_ADDR_SPACE (ttr))
5590                 WARN_FOR_QUALIFIERS (location, 0,
5591                                      G_("passing argument %d of %qE makes "
5592                                         "%q#v qualified function pointer "
5593                                         "from unqualified"),
5594                                      G_("assignment makes %q#v qualified function "
5595                                         "pointer from unqualified"),
5596                                      G_("initialization makes %q#v qualified "
5597                                         "function pointer from unqualified"),
5598                                      G_("return makes %q#v qualified function "
5599                                         "pointer from unqualified"),
5600                                      TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr));
5601             }
5602         }
5603       else
5604         /* Avoid warning about the volatile ObjC EH puts on decls.  */
5605         if (!objc_ok)
5606           WARN_FOR_ASSIGNMENT (location, 0,
5607                                G_("passing argument %d of %qE from "
5608                                   "incompatible pointer type"),
5609                                G_("assignment from incompatible pointer type"),
5610                                G_("initialization from incompatible "
5611                                   "pointer type"),
5612                                G_("return from incompatible pointer type"));
5613
5614       return convert (type, rhs);
5615     }
5616   else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
5617     {
5618       /* ??? This should not be an error when inlining calls to
5619          unprototyped functions.  */
5620       error_at (location, "invalid use of non-lvalue array");
5621       return error_mark_node;
5622     }
5623   else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
5624     {
5625       /* An explicit constant 0 can convert to a pointer,
5626          or one that results from arithmetic, even including
5627          a cast to integer type.  */
5628       if (!null_pointer_constant)
5629         WARN_FOR_ASSIGNMENT (location, 0,
5630                              G_("passing argument %d of %qE makes "
5631                                 "pointer from integer without a cast"),
5632                              G_("assignment makes pointer from integer "
5633                                 "without a cast"),
5634                              G_("initialization makes pointer from "
5635                                 "integer without a cast"),
5636                              G_("return makes pointer from integer "
5637                                 "without a cast"));
5638
5639       return convert (type, rhs);
5640     }
5641   else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
5642     {
5643       WARN_FOR_ASSIGNMENT (location, 0,
5644                            G_("passing argument %d of %qE makes integer "
5645                               "from pointer without a cast"),
5646                            G_("assignment makes integer from pointer "
5647                               "without a cast"),
5648                            G_("initialization makes integer from pointer "
5649                               "without a cast"),
5650                            G_("return makes integer from pointer "
5651                               "without a cast"));
5652       return convert (type, rhs);
5653     }
5654   else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
5655     {
5656       tree ret;
5657       bool save = in_late_binary_op;
5658       in_late_binary_op = true;
5659       ret = convert (type, rhs);
5660       in_late_binary_op = save;
5661       return ret;
5662     }
5663
5664   switch (errtype)
5665     {
5666     case ic_argpass:
5667       error_at (location, "incompatible type for argument %d of %qE", parmnum, rname);
5668       inform ((fundecl && !DECL_IS_BUILTIN (fundecl))
5669               ? DECL_SOURCE_LOCATION (fundecl) : input_location,
5670               "expected %qT but argument is of type %qT", type, rhstype);
5671       break;
5672     case ic_assign:
5673       error_at (location, "incompatible types when assigning to type %qT from "
5674                 "type %qT", type, rhstype);
5675       break;
5676     case ic_init:
5677       error_at (location,
5678                 "incompatible types when initializing type %qT using type %qT",
5679                 type, rhstype);
5680       break;
5681     case ic_return:
5682       error_at (location,
5683                 "incompatible types when returning type %qT but %qT was "
5684                 "expected", rhstype, type);
5685       break;
5686     default:
5687       gcc_unreachable ();
5688     }
5689
5690   return error_mark_node;
5691 }
5692 \f
5693 /* If VALUE is a compound expr all of whose expressions are constant, then
5694    return its value.  Otherwise, return error_mark_node.
5695
5696    This is for handling COMPOUND_EXPRs as initializer elements
5697    which is allowed with a warning when -pedantic is specified.  */
5698
5699 static tree
5700 valid_compound_expr_initializer (tree value, tree endtype)
5701 {
5702   if (TREE_CODE (value) == COMPOUND_EXPR)
5703     {
5704       if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
5705           == error_mark_node)
5706         return error_mark_node;
5707       return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
5708                                               endtype);
5709     }
5710   else if (!initializer_constant_valid_p (value, endtype))
5711     return error_mark_node;
5712   else
5713     return value;
5714 }
5715 \f
5716 /* Perform appropriate conversions on the initial value of a variable,
5717    store it in the declaration DECL,
5718    and print any error messages that are appropriate.
5719    If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5720    If the init is invalid, store an ERROR_MARK.
5721
5722    INIT_LOC is the location of the initial value.  */
5723
5724 void
5725 store_init_value (location_t init_loc, tree decl, tree init, tree origtype)
5726 {
5727   tree value, type;
5728   bool npc = false;
5729
5730   /* If variable's type was invalidly declared, just ignore it.  */
5731
5732   type = TREE_TYPE (decl);
5733   if (TREE_CODE (type) == ERROR_MARK)
5734     return;
5735
5736   /* Digest the specified initializer into an expression.  */
5737
5738   if (init)
5739     npc = null_pointer_constant_p (init);
5740   value = digest_init (init_loc, type, init, origtype, npc,
5741                        true, TREE_STATIC (decl));
5742
5743   /* Store the expression if valid; else report error.  */
5744
5745   if (!in_system_header
5746       && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
5747     warning (OPT_Wtraditional, "traditional C rejects automatic "
5748              "aggregate initialization");
5749
5750   DECL_INITIAL (decl) = value;
5751
5752   /* ANSI wants warnings about out-of-range constant initializers.  */
5753   STRIP_TYPE_NOPS (value);
5754   if (TREE_STATIC (decl))
5755     constant_expression_warning (value);
5756
5757   /* Check if we need to set array size from compound literal size.  */
5758   if (TREE_CODE (type) == ARRAY_TYPE
5759       && TYPE_DOMAIN (type) == 0
5760       && value != error_mark_node)
5761     {
5762       tree inside_init = init;
5763
5764       STRIP_TYPE_NOPS (inside_init);
5765       inside_init = fold (inside_init);
5766
5767       if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
5768         {
5769           tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
5770
5771           if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
5772             {
5773               /* For int foo[] = (int [3]){1}; we need to set array size
5774                  now since later on array initializer will be just the
5775                  brace enclosed list of the compound literal.  */
5776               tree etype = strip_array_types (TREE_TYPE (decl));
5777               type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
5778               TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
5779               layout_type (type);
5780               layout_decl (cldecl, 0);
5781               TREE_TYPE (decl)
5782                 = c_build_qualified_type (type, TYPE_QUALS (etype));
5783             }
5784         }
5785     }
5786 }
5787 \f
5788 /* Methods for storing and printing names for error messages.  */
5789
5790 /* Implement a spelling stack that allows components of a name to be pushed
5791    and popped.  Each element on the stack is this structure.  */
5792
5793 struct spelling
5794 {
5795   int kind;
5796   union
5797     {
5798       unsigned HOST_WIDE_INT i;
5799       const char *s;
5800     } u;
5801 };
5802
5803 #define SPELLING_STRING 1
5804 #define SPELLING_MEMBER 2
5805 #define SPELLING_BOUNDS 3
5806
5807 static struct spelling *spelling;       /* Next stack element (unused).  */
5808 static struct spelling *spelling_base;  /* Spelling stack base.  */
5809 static int spelling_size;               /* Size of the spelling stack.  */
5810
5811 /* Macros to save and restore the spelling stack around push_... functions.
5812    Alternative to SAVE_SPELLING_STACK.  */
5813
5814 #define SPELLING_DEPTH() (spelling - spelling_base)
5815 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
5816
5817 /* Push an element on the spelling stack with type KIND and assign VALUE
5818    to MEMBER.  */
5819
5820 #define PUSH_SPELLING(KIND, VALUE, MEMBER)                              \
5821 {                                                                       \
5822   int depth = SPELLING_DEPTH ();                                        \
5823                                                                         \
5824   if (depth >= spelling_size)                                           \
5825     {                                                                   \
5826       spelling_size += 10;                                              \
5827       spelling_base = XRESIZEVEC (struct spelling, spelling_base,       \
5828                                   spelling_size);                       \
5829       RESTORE_SPELLING_DEPTH (depth);                                   \
5830     }                                                                   \
5831                                                                         \
5832   spelling->kind = (KIND);                                              \
5833   spelling->MEMBER = (VALUE);                                           \
5834   spelling++;                                                           \
5835 }
5836
5837 /* Push STRING on the stack.  Printed literally.  */
5838
5839 static void
5840 push_string (const char *string)
5841 {
5842   PUSH_SPELLING (SPELLING_STRING, string, u.s);
5843 }
5844
5845 /* Push a member name on the stack.  Printed as '.' STRING.  */
5846
5847 static void
5848 push_member_name (tree decl)
5849 {
5850   const char *const string
5851     = (DECL_NAME (decl)
5852        ? identifier_to_locale (IDENTIFIER_POINTER (DECL_NAME (decl)))
5853        : _("<anonymous>"));
5854   PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
5855 }
5856
5857 /* Push an array bounds on the stack.  Printed as [BOUNDS].  */
5858
5859 static void
5860 push_array_bounds (unsigned HOST_WIDE_INT bounds)
5861 {
5862   PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
5863 }
5864
5865 /* Compute the maximum size in bytes of the printed spelling.  */
5866
5867 static int
5868 spelling_length (void)
5869 {
5870   int size = 0;
5871   struct spelling *p;
5872
5873   for (p = spelling_base; p < spelling; p++)
5874     {
5875       if (p->kind == SPELLING_BOUNDS)
5876         size += 25;
5877       else
5878         size += strlen (p->u.s) + 1;
5879     }
5880
5881   return size;
5882 }
5883
5884 /* Print the spelling to BUFFER and return it.  */
5885
5886 static char *
5887 print_spelling (char *buffer)
5888 {
5889   char *d = buffer;
5890   struct spelling *p;
5891
5892   for (p = spelling_base; p < spelling; p++)
5893     if (p->kind == SPELLING_BOUNDS)
5894       {
5895         sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
5896         d += strlen (d);
5897       }
5898     else
5899       {
5900         const char *s;
5901         if (p->kind == SPELLING_MEMBER)
5902           *d++ = '.';
5903         for (s = p->u.s; (*d = *s++); d++)
5904           ;
5905       }
5906   *d++ = '\0';
5907   return buffer;
5908 }
5909
5910 /* Issue an error message for a bad initializer component.
5911    GMSGID identifies the message.
5912    The component name is taken from the spelling stack.  */
5913
5914 void
5915 error_init (const char *gmsgid)
5916 {
5917   char *ofwhat;
5918
5919   /* The gmsgid may be a format string with %< and %>. */
5920   error (gmsgid);
5921   ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5922   if (*ofwhat)
5923     error ("(near initialization for %qs)", ofwhat);
5924 }
5925
5926 /* Issue a pedantic warning for a bad initializer component.  OPT is
5927    the option OPT_* (from options.h) controlling this warning or 0 if
5928    it is unconditionally given.  GMSGID identifies the message.  The
5929    component name is taken from the spelling stack.  */
5930
5931 void
5932 pedwarn_init (location_t location, int opt, const char *gmsgid)
5933 {
5934   char *ofwhat;
5935
5936   /* The gmsgid may be a format string with %< and %>. */
5937   pedwarn (location, opt, gmsgid);
5938   ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5939   if (*ofwhat)
5940     pedwarn (location, opt, "(near initialization for %qs)", ofwhat);
5941 }
5942
5943 /* Issue a warning for a bad initializer component.
5944
5945    OPT is the OPT_W* value corresponding to the warning option that
5946    controls this warning.  GMSGID identifies the message.  The
5947    component name is taken from the spelling stack.  */
5948
5949 static void
5950 warning_init (int opt, const char *gmsgid)
5951 {
5952   char *ofwhat;
5953
5954   /* The gmsgid may be a format string with %< and %>. */
5955   warning (opt, gmsgid);
5956   ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5957   if (*ofwhat)
5958     warning (opt, "(near initialization for %qs)", ofwhat);
5959 }
5960 \f
5961 /* If TYPE is an array type and EXPR is a parenthesized string
5962    constant, warn if pedantic that EXPR is being used to initialize an
5963    object of type TYPE.  */
5964
5965 void
5966 maybe_warn_string_init (tree type, struct c_expr expr)
5967 {
5968   if (pedantic
5969       && TREE_CODE (type) == ARRAY_TYPE
5970       && TREE_CODE (expr.value) == STRING_CST
5971       && expr.original_code != STRING_CST)
5972     pedwarn_init (input_location, OPT_pedantic,
5973                   "array initialized from parenthesized string constant");
5974 }
5975
5976 /* Digest the parser output INIT as an initializer for type TYPE.
5977    Return a C expression of type TYPE to represent the initial value.
5978
5979    If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5980
5981    NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
5982
5983    If INIT is a string constant, STRICT_STRING is true if it is
5984    unparenthesized or we should not warn here for it being parenthesized.
5985    For other types of INIT, STRICT_STRING is not used.
5986
5987    INIT_LOC is the location of the INIT.
5988
5989    REQUIRE_CONSTANT requests an error if non-constant initializers or
5990    elements are seen.  */
5991
5992 static tree
5993 digest_init (location_t init_loc, tree type, tree init, tree origtype,
5994              bool null_pointer_constant, bool strict_string,
5995              int require_constant)
5996 {
5997   enum tree_code code = TREE_CODE (type);
5998   tree inside_init = init;
5999   tree semantic_type = NULL_TREE;
6000   bool maybe_const = true;
6001
6002   if (type == error_mark_node
6003       || !init
6004       || init == error_mark_node
6005       || TREE_TYPE (init) == error_mark_node)
6006     return error_mark_node;
6007
6008   STRIP_TYPE_NOPS (inside_init);
6009
6010   if (TREE_CODE (inside_init) == EXCESS_PRECISION_EXPR)
6011     {
6012       semantic_type = TREE_TYPE (inside_init);
6013       inside_init = TREE_OPERAND (inside_init, 0);
6014     }
6015   inside_init = c_fully_fold (inside_init, require_constant, &maybe_const);
6016   inside_init = decl_constant_value_for_optimization (inside_init);
6017
6018   /* Initialization of an array of chars from a string constant
6019      optionally enclosed in braces.  */
6020
6021   if (code == ARRAY_TYPE && inside_init
6022       && TREE_CODE (inside_init) == STRING_CST)
6023     {
6024       tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
6025       /* Note that an array could be both an array of character type
6026          and an array of wchar_t if wchar_t is signed char or unsigned
6027          char.  */
6028       bool char_array = (typ1 == char_type_node
6029                          || typ1 == signed_char_type_node
6030                          || typ1 == unsigned_char_type_node);
6031       bool wchar_array = !!comptypes (typ1, wchar_type_node);
6032       bool char16_array = !!comptypes (typ1, char16_type_node);
6033       bool char32_array = !!comptypes (typ1, char32_type_node);
6034
6035       if (char_array || wchar_array || char16_array || char32_array)
6036         {
6037           struct c_expr expr;
6038           tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
6039           expr.value = inside_init;
6040           expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
6041           expr.original_type = NULL;
6042           maybe_warn_string_init (type, expr);
6043
6044           if (TYPE_DOMAIN (type) && !TYPE_MAX_VALUE (TYPE_DOMAIN (type)))
6045             pedwarn_init (init_loc, OPT_pedantic,
6046                           "initialization of a flexible array member");
6047
6048           if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
6049                          TYPE_MAIN_VARIANT (type)))
6050             return inside_init;
6051
6052           if (char_array)
6053             {
6054               if (typ2 != char_type_node)
6055                 {
6056                   error_init ("char-array initialized from wide string");
6057                   return error_mark_node;
6058                 }
6059             }
6060           else
6061             {
6062               if (typ2 == char_type_node)
6063                 {
6064                   error_init ("wide character array initialized from non-wide "
6065                               "string");
6066                   return error_mark_node;
6067                 }
6068               else if (!comptypes(typ1, typ2))
6069                 {
6070                   error_init ("wide character array initialized from "
6071                               "incompatible wide string");
6072                   return error_mark_node;
6073                 }
6074             }
6075
6076           TREE_TYPE (inside_init) = type;
6077           if (TYPE_DOMAIN (type) != 0
6078               && TYPE_SIZE (type) != 0
6079               && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST)
6080             {
6081               unsigned HOST_WIDE_INT len = TREE_STRING_LENGTH (inside_init);
6082
6083               /* Subtract the size of a single (possibly wide) character
6084                  because it's ok to ignore the terminating null char
6085                  that is counted in the length of the constant.  */
6086               if (0 > compare_tree_int (TYPE_SIZE_UNIT (type),
6087                                         (len
6088                                          - (TYPE_PRECISION (typ1)
6089                                             / BITS_PER_UNIT))))
6090                 pedwarn_init (init_loc, 0,
6091                               ("initializer-string for array of chars "
6092                                "is too long"));
6093               else if (warn_cxx_compat
6094                        && 0 > compare_tree_int (TYPE_SIZE_UNIT (type), len))
6095                 warning_at (init_loc, OPT_Wc___compat,
6096                             ("initializer-string for array chars "
6097                              "is too long for C++"));
6098             }
6099
6100           return inside_init;
6101         }
6102       else if (INTEGRAL_TYPE_P (typ1))
6103         {
6104           error_init ("array of inappropriate type initialized "
6105                       "from string constant");
6106           return error_mark_node;
6107         }
6108     }
6109
6110   /* Build a VECTOR_CST from a *constant* vector constructor.  If the
6111      vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
6112      below and handle as a constructor.  */
6113   if (code == VECTOR_TYPE
6114       && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
6115       && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
6116       && TREE_CONSTANT (inside_init))
6117     {
6118       if (TREE_CODE (inside_init) == VECTOR_CST
6119           && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
6120                         TYPE_MAIN_VARIANT (type)))
6121         return inside_init;
6122
6123       if (TREE_CODE (inside_init) == CONSTRUCTOR)
6124         {
6125           unsigned HOST_WIDE_INT ix;
6126           tree value;
6127           bool constant_p = true;
6128
6129           /* Iterate through elements and check if all constructor
6130              elements are *_CSTs.  */
6131           FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
6132             if (!CONSTANT_CLASS_P (value))
6133               {
6134                 constant_p = false;
6135                 break;
6136               }
6137
6138           if (constant_p)
6139             return build_vector_from_ctor (type,
6140                                            CONSTRUCTOR_ELTS (inside_init));
6141         }
6142     }
6143
6144   if (warn_sequence_point)
6145     verify_sequence_points (inside_init);
6146
6147   /* Any type can be initialized
6148      from an expression of the same type, optionally with braces.  */
6149
6150   if (inside_init && TREE_TYPE (inside_init) != 0
6151       && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
6152                      TYPE_MAIN_VARIANT (type))
6153           || (code == ARRAY_TYPE
6154               && comptypes (TREE_TYPE (inside_init), type))
6155           || (code == VECTOR_TYPE
6156               && comptypes (TREE_TYPE (inside_init), type))
6157           || (code == POINTER_TYPE
6158               && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
6159               && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
6160                             TREE_TYPE (type)))))
6161     {
6162       if (code == POINTER_TYPE)
6163         {
6164           if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
6165             {
6166               if (TREE_CODE (inside_init) == STRING_CST
6167                   || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
6168                 inside_init = array_to_pointer_conversion
6169                   (init_loc, inside_init);
6170               else
6171                 {
6172                   error_init ("invalid use of non-lvalue array");
6173                   return error_mark_node;
6174                 }
6175             }
6176         }
6177
6178       if (code == VECTOR_TYPE)
6179         /* Although the types are compatible, we may require a
6180            conversion.  */
6181         inside_init = convert (type, inside_init);
6182
6183       if (require_constant
6184           && (code == VECTOR_TYPE || !flag_isoc99)
6185           && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
6186         {
6187           /* As an extension, allow initializing objects with static storage
6188              duration with compound literals (which are then treated just as
6189              the brace enclosed list they contain).  Also allow this for
6190              vectors, as we can only assign them with compound literals.  */
6191           tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
6192           inside_init = DECL_INITIAL (decl);
6193         }
6194
6195       if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
6196           && TREE_CODE (inside_init) != CONSTRUCTOR)
6197         {
6198           error_init ("array initialized from non-constant array expression");
6199           return error_mark_node;
6200         }
6201
6202       /* Compound expressions can only occur here if -pedantic or
6203          -pedantic-errors is specified.  In the later case, we always want
6204          an error.  In the former case, we simply want a warning.  */
6205       if (require_constant && pedantic
6206           && TREE_CODE (inside_init) == COMPOUND_EXPR)
6207         {
6208           inside_init
6209             = valid_compound_expr_initializer (inside_init,
6210                                                TREE_TYPE (inside_init));
6211           if (inside_init == error_mark_node)
6212             error_init ("initializer element is not constant");
6213           else
6214             pedwarn_init (init_loc, OPT_pedantic,
6215                           "initializer element is not constant");
6216           if (flag_pedantic_errors)
6217             inside_init = error_mark_node;
6218         }
6219       else if (require_constant
6220                && !initializer_constant_valid_p (inside_init,
6221                                                  TREE_TYPE (inside_init)))
6222         {
6223           error_init ("initializer element is not constant");
6224           inside_init = error_mark_node;
6225         }
6226       else if (require_constant && !maybe_const)
6227         pedwarn_init (init_loc, 0,
6228                       "initializer element is not a constant expression");
6229
6230       /* Added to enable additional -Wmissing-format-attribute warnings.  */
6231       if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
6232         inside_init = convert_for_assignment (init_loc, type, inside_init,
6233                                               origtype,
6234                                               ic_init, null_pointer_constant,
6235                                               NULL_TREE, NULL_TREE, 0);
6236       return inside_init;
6237     }
6238
6239   /* Handle scalar types, including conversions.  */
6240
6241   if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
6242       || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
6243       || code == COMPLEX_TYPE || code == VECTOR_TYPE)
6244     {
6245       if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
6246           && (TREE_CODE (init) == STRING_CST
6247               || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
6248         inside_init = init = array_to_pointer_conversion (init_loc, init);
6249       if (semantic_type)
6250         inside_init = build1 (EXCESS_PRECISION_EXPR, semantic_type,
6251                               inside_init);
6252       inside_init
6253         = convert_for_assignment (init_loc, type, inside_init, origtype,
6254                                   ic_init, null_pointer_constant,
6255                                   NULL_TREE, NULL_TREE, 0);
6256
6257       /* Check to see if we have already given an error message.  */
6258       if (inside_init == error_mark_node)
6259         ;
6260       else if (require_constant && !TREE_CONSTANT (inside_init))
6261         {
6262           error_init ("initializer element is not constant");
6263           inside_init = error_mark_node;
6264         }
6265       else if (require_constant
6266                && !initializer_constant_valid_p (inside_init,
6267                                                  TREE_TYPE (inside_init)))
6268         {
6269           error_init ("initializer element is not computable at load time");
6270           inside_init = error_mark_node;
6271         }
6272       else if (require_constant && !maybe_const)
6273         pedwarn_init (init_loc, 0,
6274                       "initializer element is not a constant expression");
6275
6276       return inside_init;
6277     }
6278
6279   /* Come here only for records and arrays.  */
6280
6281   if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
6282     {
6283       error_init ("variable-sized object may not be initialized");
6284       return error_mark_node;
6285     }
6286
6287   error_init ("invalid initializer");
6288   return error_mark_node;
6289 }
6290 \f
6291 /* Handle initializers that use braces.  */
6292
6293 /* Type of object we are accumulating a constructor for.
6294    This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE.  */
6295 static tree constructor_type;
6296
6297 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
6298    left to fill.  */
6299 static tree constructor_fields;
6300
6301 /* For an ARRAY_TYPE, this is the specified index
6302    at which to store the next element we get.  */
6303 static tree constructor_index;
6304
6305 /* For an ARRAY_TYPE, this is the maximum index.  */
6306 static tree constructor_max_index;
6307
6308 /* For a RECORD_TYPE, this is the first field not yet written out.  */
6309 static tree constructor_unfilled_fields;
6310
6311 /* For an ARRAY_TYPE, this is the index of the first element
6312    not yet written out.  */
6313 static tree constructor_unfilled_index;
6314
6315 /* In a RECORD_TYPE, the byte index of the next consecutive field.
6316    This is so we can generate gaps between fields, when appropriate.  */
6317 static tree constructor_bit_index;
6318
6319 /* If we are saving up the elements rather than allocating them,
6320    this is the list of elements so far (in reverse order,
6321    most recent first).  */
6322 static VEC(constructor_elt,gc) *constructor_elements;
6323
6324 /* 1 if constructor should be incrementally stored into a constructor chain,
6325    0 if all the elements should be kept in AVL tree.  */
6326 static int constructor_incremental;
6327
6328 /* 1 if so far this constructor's elements are all compile-time constants.  */
6329 static int constructor_constant;
6330
6331 /* 1 if so far this constructor's elements are all valid address constants.  */
6332 static int constructor_simple;
6333
6334 /* 1 if this constructor has an element that cannot be part of a
6335    constant expression.  */
6336 static int constructor_nonconst;
6337
6338 /* 1 if this constructor is erroneous so far.  */
6339 static int constructor_erroneous;
6340
6341 /* Structure for managing pending initializer elements, organized as an
6342    AVL tree.  */
6343
6344 struct init_node
6345 {
6346   struct init_node *left, *right;
6347   struct init_node *parent;
6348   int balance;
6349   tree purpose;
6350   tree value;
6351   tree origtype;
6352 };
6353
6354 /* Tree of pending elements at this constructor level.
6355    These are elements encountered out of order
6356    which belong at places we haven't reached yet in actually
6357    writing the output.
6358    Will never hold tree nodes across GC runs.  */
6359 static struct init_node *constructor_pending_elts;
6360
6361 /* The SPELLING_DEPTH of this constructor.  */
6362 static int constructor_depth;
6363
6364 /* DECL node for which an initializer is being read.
6365    0 means we are reading a constructor expression
6366    such as (struct foo) {...}.  */
6367 static tree constructor_decl;
6368
6369 /* Nonzero if this is an initializer for a top-level decl.  */
6370 static int constructor_top_level;
6371
6372 /* Nonzero if there were any member designators in this initializer.  */
6373 static int constructor_designated;
6374
6375 /* Nesting depth of designator list.  */
6376 static int designator_depth;
6377
6378 /* Nonzero if there were diagnosed errors in this designator list.  */
6379 static int designator_erroneous;
6380
6381 \f
6382 /* This stack has a level for each implicit or explicit level of
6383    structuring in the initializer, including the outermost one.  It
6384    saves the values of most of the variables above.  */
6385
6386 struct constructor_range_stack;
6387
6388 struct constructor_stack
6389 {
6390   struct constructor_stack *next;
6391   tree type;
6392   tree fields;
6393   tree index;
6394   tree max_index;
6395   tree unfilled_index;
6396   tree unfilled_fields;
6397   tree bit_index;
6398   VEC(constructor_elt,gc) *elements;
6399   struct init_node *pending_elts;
6400   int offset;
6401   int depth;
6402   /* If value nonzero, this value should replace the entire
6403      constructor at this level.  */
6404   struct c_expr replacement_value;
6405   struct constructor_range_stack *range_stack;
6406   char constant;
6407   char simple;
6408   char nonconst;
6409   char implicit;
6410   char erroneous;
6411   char outer;
6412   char incremental;
6413   char designated;
6414 };
6415
6416 static struct constructor_stack *constructor_stack;
6417
6418 /* This stack represents designators from some range designator up to
6419    the last designator in the list.  */
6420
6421 struct constructor_range_stack
6422 {
6423   struct constructor_range_stack *next, *prev;
6424   struct constructor_stack *stack;
6425   tree range_start;
6426   tree index;
6427   tree range_end;
6428   tree fields;
6429 };
6430
6431 static struct constructor_range_stack *constructor_range_stack;
6432
6433 /* This stack records separate initializers that are nested.
6434    Nested initializers can't happen in ANSI C, but GNU C allows them
6435    in cases like { ... (struct foo) { ... } ... }.  */
6436
6437 struct initializer_stack
6438 {
6439   struct initializer_stack *next;
6440   tree decl;
6441   struct constructor_stack *constructor_stack;
6442   struct constructor_range_stack *constructor_range_stack;
6443   VEC(constructor_elt,gc) *elements;
6444   struct spelling *spelling;
6445   struct spelling *spelling_base;
6446   int spelling_size;
6447   char top_level;
6448   char require_constant_value;
6449   char require_constant_elements;
6450 };
6451
6452 static struct initializer_stack *initializer_stack;
6453 \f
6454 /* Prepare to parse and output the initializer for variable DECL.  */
6455
6456 void
6457 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
6458 {
6459   const char *locus;
6460   struct initializer_stack *p = XNEW (struct initializer_stack);
6461
6462   p->decl = constructor_decl;
6463   p->require_constant_value = require_constant_value;
6464   p->require_constant_elements = require_constant_elements;
6465   p->constructor_stack = constructor_stack;
6466   p->constructor_range_stack = constructor_range_stack;
6467   p->elements = constructor_elements;
6468   p->spelling = spelling;
6469   p->spelling_base = spelling_base;
6470   p->spelling_size = spelling_size;
6471   p->top_level = constructor_top_level;
6472   p->next = initializer_stack;
6473   initializer_stack = p;
6474
6475   constructor_decl = decl;
6476   constructor_designated = 0;
6477   constructor_top_level = top_level;
6478
6479   if (decl != 0 && decl != error_mark_node)
6480     {
6481       require_constant_value = TREE_STATIC (decl);
6482       require_constant_elements
6483         = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
6484            /* For a scalar, you can always use any value to initialize,
6485               even within braces.  */
6486            && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
6487                || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
6488                || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
6489                || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
6490       locus = identifier_to_locale (IDENTIFIER_POINTER (DECL_NAME (decl)));
6491     }
6492   else
6493     {
6494       require_constant_value = 0;
6495       require_constant_elements = 0;
6496       locus = _("(anonymous)");
6497     }
6498
6499   constructor_stack = 0;
6500   constructor_range_stack = 0;
6501
6502   missing_braces_mentioned = 0;
6503
6504   spelling_base = 0;
6505   spelling_size = 0;
6506   RESTORE_SPELLING_DEPTH (0);
6507
6508   if (locus)
6509     push_string (locus);
6510 }
6511
6512 void
6513 finish_init (void)
6514 {
6515   struct initializer_stack *p = initializer_stack;
6516
6517   /* Free the whole constructor stack of this initializer.  */
6518   while (constructor_stack)
6519     {
6520       struct constructor_stack *q = constructor_stack;
6521       constructor_stack = q->next;
6522       free (q);
6523     }
6524
6525   gcc_assert (!constructor_range_stack);
6526
6527   /* Pop back to the data of the outer initializer (if any).  */
6528   free (spelling_base);
6529
6530   constructor_decl = p->decl;
6531   require_constant_value = p->require_constant_value;
6532   require_constant_elements = p->require_constant_elements;
6533   constructor_stack = p->constructor_stack;
6534   constructor_range_stack = p->constructor_range_stack;
6535   constructor_elements = p->elements;
6536   spelling = p->spelling;
6537   spelling_base = p->spelling_base;
6538   spelling_size = p->spelling_size;
6539   constructor_top_level = p->top_level;
6540   initializer_stack = p->next;
6541   free (p);
6542 }
6543 \f
6544 /* Call here when we see the initializer is surrounded by braces.
6545    This is instead of a call to push_init_level;
6546    it is matched by a call to pop_init_level.
6547
6548    TYPE is the type to initialize, for a constructor expression.
6549    For an initializer for a decl, TYPE is zero.  */
6550
6551 void
6552 really_start_incremental_init (tree type)
6553 {
6554   struct constructor_stack *p = XNEW (struct constructor_stack);
6555
6556   if (type == 0)
6557     type = TREE_TYPE (constructor_decl);
6558
6559   if (TREE_CODE (type) == VECTOR_TYPE
6560       && TYPE_VECTOR_OPAQUE (type))
6561     error ("opaque vector types cannot be initialized");
6562
6563   p->type = constructor_type;
6564   p->fields = constructor_fields;
6565   p->index = constructor_index;
6566   p->max_index = constructor_max_index;
6567   p->unfilled_index = constructor_unfilled_index;
6568   p->unfilled_fields = constructor_unfilled_fields;
6569   p->bit_index = constructor_bit_index;
6570   p->elements = constructor_elements;
6571   p->constant = constructor_constant;
6572   p->simple = constructor_simple;
6573   p->nonconst = constructor_nonconst;
6574   p->erroneous = constructor_erroneous;
6575   p->pending_elts = constructor_pending_elts;
6576   p->depth = constructor_depth;
6577   p->replacement_value.value = 0;
6578   p->replacement_value.original_code = ERROR_MARK;
6579   p->replacement_value.original_type = NULL;
6580   p->implicit = 0;
6581   p->range_stack = 0;
6582   p->outer = 0;
6583   p->incremental = constructor_incremental;
6584   p->designated = constructor_designated;
6585   p->next = 0;
6586   constructor_stack = p;
6587
6588   constructor_constant = 1;
6589   constructor_simple = 1;
6590   constructor_nonconst = 0;
6591   constructor_depth = SPELLING_DEPTH ();
6592   constructor_elements = 0;
6593   constructor_pending_elts = 0;
6594   constructor_type = type;
6595   constructor_incremental = 1;
6596   constructor_designated = 0;
6597   designator_depth = 0;
6598   designator_erroneous = 0;
6599
6600   if (TREE_CODE (constructor_type) == RECORD_TYPE
6601       || TREE_CODE (constructor_type) == UNION_TYPE)
6602     {
6603       constructor_fields = TYPE_FIELDS (constructor_type);
6604       /* Skip any nameless bit fields at the beginning.  */
6605       while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
6606              && DECL_NAME (constructor_fields) == 0)
6607         constructor_fields = DECL_CHAIN (constructor_fields);
6608
6609       constructor_unfilled_fields = constructor_fields;
6610       constructor_bit_index = bitsize_zero_node;
6611     }
6612   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6613     {
6614       if (TYPE_DOMAIN (constructor_type))
6615         {
6616           constructor_max_index
6617             = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
6618
6619           /* Detect non-empty initializations of zero-length arrays.  */
6620           if (constructor_max_index == NULL_TREE
6621               && TYPE_SIZE (constructor_type))
6622             constructor_max_index = integer_minus_one_node;
6623
6624           /* constructor_max_index needs to be an INTEGER_CST.  Attempts
6625              to initialize VLAs will cause a proper error; avoid tree
6626              checking errors as well by setting a safe value.  */
6627           if (constructor_max_index
6628               && TREE_CODE (constructor_max_index) != INTEGER_CST)
6629             constructor_max_index = integer_minus_one_node;
6630
6631           constructor_index
6632             = convert (bitsizetype,
6633                        TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6634         }
6635       else
6636         {
6637           constructor_index = bitsize_zero_node;
6638           constructor_max_index = NULL_TREE;
6639         }
6640
6641       constructor_unfilled_index = constructor_index;
6642     }
6643   else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6644     {
6645       /* Vectors are like simple fixed-size arrays.  */
6646       constructor_max_index =
6647         build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
6648       constructor_index = bitsize_zero_node;
6649       constructor_unfilled_index = constructor_index;
6650     }
6651   else
6652     {
6653       /* Handle the case of int x = {5}; */
6654       constructor_fields = constructor_type;
6655       constructor_unfilled_fields = constructor_type;
6656     }
6657 }
6658 \f
6659 /* Push down into a subobject, for initialization.
6660    If this is for an explicit set of braces, IMPLICIT is 0.
6661    If it is because the next element belongs at a lower level,
6662    IMPLICIT is 1 (or 2 if the push is because of designator list).  */
6663
6664 void
6665 push_init_level (int implicit, struct obstack * braced_init_obstack)
6666 {
6667   struct constructor_stack *p;
6668   tree value = NULL_TREE;
6669
6670   /* If we've exhausted any levels that didn't have braces,
6671      pop them now.  If implicit == 1, this will have been done in
6672      process_init_element; do not repeat it here because in the case
6673      of excess initializers for an empty aggregate this leads to an
6674      infinite cycle of popping a level and immediately recreating
6675      it.  */
6676   if (implicit != 1)
6677     {
6678       while (constructor_stack->implicit)
6679         {
6680           if ((TREE_CODE (constructor_type) == RECORD_TYPE
6681                || TREE_CODE (constructor_type) == UNION_TYPE)
6682               && constructor_fields == 0)
6683             process_init_element (pop_init_level (1, braced_init_obstack),
6684                                   true, braced_init_obstack);
6685           else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6686                    && constructor_max_index
6687                    && tree_int_cst_lt (constructor_max_index,
6688                                        constructor_index))
6689             process_init_element (pop_init_level (1, braced_init_obstack),
6690                                   true, braced_init_obstack);
6691           else
6692             break;
6693         }
6694     }
6695
6696   /* Unless this is an explicit brace, we need to preserve previous
6697      content if any.  */
6698   if (implicit)
6699     {
6700       if ((TREE_CODE (constructor_type) == RECORD_TYPE
6701            || TREE_CODE (constructor_type) == UNION_TYPE)
6702           && constructor_fields)
6703         value = find_init_member (constructor_fields, braced_init_obstack);
6704       else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6705         value = find_init_member (constructor_index, braced_init_obstack);
6706     }
6707
6708   p = XNEW (struct constructor_stack);
6709   p->type = constructor_type;
6710   p->fields = constructor_fields;
6711   p->index = constructor_index;
6712   p->max_index = constructor_max_index;
6713   p->unfilled_index = constructor_unfilled_index;
6714   p->unfilled_fields = constructor_unfilled_fields;
6715   p->bit_index = constructor_bit_index;
6716   p->elements = constructor_elements;
6717   p->constant = constructor_constant;
6718   p->simple = constructor_simple;
6719   p->nonconst = constructor_nonconst;
6720   p->erroneous = constructor_erroneous;
6721   p->pending_elts = constructor_pending_elts;
6722   p->depth = constructor_depth;
6723   p->replacement_value.value = 0;
6724   p->replacement_value.original_code = ERROR_MARK;
6725   p->replacement_value.original_type = NULL;
6726   p->implicit = implicit;
6727   p->outer = 0;
6728   p->incremental = constructor_incremental;
6729   p->designated = constructor_designated;
6730   p->next = constructor_stack;
6731   p->range_stack = 0;
6732   constructor_stack = p;
6733
6734   constructor_constant = 1;
6735   constructor_simple = 1;
6736   constructor_nonconst = 0;
6737   constructor_depth = SPELLING_DEPTH ();
6738   constructor_elements = 0;
6739   constructor_incremental = 1;
6740   constructor_designated = 0;
6741   constructor_pending_elts = 0;
6742   if (!implicit)
6743     {
6744       p->range_stack = constructor_range_stack;
6745       constructor_range_stack = 0;
6746       designator_depth = 0;
6747       designator_erroneous = 0;
6748     }
6749
6750   /* Don't die if an entire brace-pair level is superfluous
6751      in the containing level.  */
6752   if (constructor_type == 0)
6753     ;
6754   else if (TREE_CODE (constructor_type) == RECORD_TYPE
6755            || TREE_CODE (constructor_type) == UNION_TYPE)
6756     {
6757       /* Don't die if there are extra init elts at the end.  */
6758       if (constructor_fields == 0)
6759         constructor_type = 0;
6760       else
6761         {
6762           constructor_type = TREE_TYPE (constructor_fields);
6763           push_member_name (constructor_fields);
6764           constructor_depth++;
6765         }
6766     }
6767   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6768     {
6769       constructor_type = TREE_TYPE (constructor_type);
6770       push_array_bounds (tree_low_cst (constructor_index, 1));
6771       constructor_depth++;
6772     }
6773
6774   if (constructor_type == 0)
6775     {
6776       error_init ("extra brace group at end of initializer");
6777       constructor_fields = 0;
6778       constructor_unfilled_fields = 0;
6779       return;
6780     }
6781
6782   if (value && TREE_CODE (value) == CONSTRUCTOR)
6783     {
6784       constructor_constant = TREE_CONSTANT (value);
6785       constructor_simple = TREE_STATIC (value);
6786       constructor_nonconst = CONSTRUCTOR_NON_CONST (value);
6787       constructor_elements = CONSTRUCTOR_ELTS (value);
6788       if (!VEC_empty (constructor_elt, constructor_elements)
6789           && (TREE_CODE (constructor_type) == RECORD_TYPE
6790               || TREE_CODE (constructor_type) == ARRAY_TYPE))
6791         set_nonincremental_init (braced_init_obstack);
6792     }
6793
6794   if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
6795     {
6796       missing_braces_mentioned = 1;
6797       warning_init (OPT_Wmissing_braces, "missing braces around initializer");
6798     }
6799
6800   if (TREE_CODE (constructor_type) == RECORD_TYPE
6801            || TREE_CODE (constructor_type) == UNION_TYPE)
6802     {
6803       constructor_fields = TYPE_FIELDS (constructor_type);
6804       /* Skip any nameless bit fields at the beginning.  */
6805       while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
6806              && DECL_NAME (constructor_fields) == 0)
6807         constructor_fields = DECL_CHAIN (constructor_fields);
6808
6809       constructor_unfilled_fields = constructor_fields;
6810       constructor_bit_index = bitsize_zero_node;
6811     }
6812   else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6813     {
6814       /* Vectors are like simple fixed-size arrays.  */
6815       constructor_max_index =
6816         build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
6817       constructor_index = convert (bitsizetype, integer_zero_node);
6818       constructor_unfilled_index = constructor_index;
6819     }
6820   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6821     {
6822       if (TYPE_DOMAIN (constructor_type))
6823         {
6824           constructor_max_index
6825             = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
6826
6827           /* Detect non-empty initializations of zero-length arrays.  */
6828           if (constructor_max_index == NULL_TREE
6829               && TYPE_SIZE (constructor_type))
6830             constructor_max_index = integer_minus_one_node;
6831
6832           /* constructor_max_index needs to be an INTEGER_CST.  Attempts
6833              to initialize VLAs will cause a proper error; avoid tree
6834              checking errors as well by setting a safe value.  */
6835           if (constructor_max_index
6836               && TREE_CODE (constructor_max_index) != INTEGER_CST)
6837             constructor_max_index = integer_minus_one_node;
6838
6839           constructor_index
6840             = convert (bitsizetype,
6841                        TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6842         }
6843       else
6844         constructor_index = bitsize_zero_node;
6845
6846       constructor_unfilled_index = constructor_index;
6847       if (value && TREE_CODE (value) == STRING_CST)
6848         {
6849           /* We need to split the char/wchar array into individual
6850              characters, so that we don't have to special case it
6851              everywhere.  */
6852           set_nonincremental_init_from_string (value, braced_init_obstack);
6853         }
6854     }
6855   else
6856     {
6857       if (constructor_type != error_mark_node)
6858         warning_init (0, "braces around scalar initializer");
6859       constructor_fields = constructor_type;
6860       constructor_unfilled_fields = constructor_type;
6861     }
6862 }
6863
6864 /* At the end of an implicit or explicit brace level,
6865    finish up that level of constructor.  If a single expression
6866    with redundant braces initialized that level, return the
6867    c_expr structure for that expression.  Otherwise, the original_code
6868    element is set to ERROR_MARK.
6869    If we were outputting the elements as they are read, return 0 as the value
6870    from inner levels (process_init_element ignores that),
6871    but return error_mark_node as the value from the outermost level
6872    (that's what we want to put in DECL_INITIAL).
6873    Otherwise, return a CONSTRUCTOR expression as the value.  */
6874
6875 struct c_expr
6876 pop_init_level (int implicit, struct obstack * braced_init_obstack)
6877 {
6878   struct constructor_stack *p;
6879   struct c_expr ret;
6880   ret.value = 0;
6881   ret.original_code = ERROR_MARK;
6882   ret.original_type = NULL;
6883
6884   if (implicit == 0)
6885     {
6886       /* When we come to an explicit close brace,
6887          pop any inner levels that didn't have explicit braces.  */
6888       while (constructor_stack->implicit)
6889         {
6890           process_init_element (pop_init_level (1, braced_init_obstack),
6891                                 true, braced_init_obstack);
6892         }
6893       gcc_assert (!constructor_range_stack);
6894     }
6895
6896   /* Now output all pending elements.  */
6897   constructor_incremental = 1;
6898   output_pending_init_elements (1, braced_init_obstack);
6899
6900   p = constructor_stack;
6901
6902   /* Error for initializing a flexible array member, or a zero-length
6903      array member in an inappropriate context.  */
6904   if (constructor_type && constructor_fields
6905       && TREE_CODE (constructor_type) == ARRAY_TYPE
6906       && TYPE_DOMAIN (constructor_type)
6907       && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
6908     {
6909       /* Silently discard empty initializations.  The parser will
6910          already have pedwarned for empty brackets.  */
6911       if (integer_zerop (constructor_unfilled_index))
6912         constructor_type = NULL_TREE;
6913       else
6914         {
6915           gcc_assert (!TYPE_SIZE (constructor_type));
6916
6917           if (constructor_depth > 2)
6918             error_init ("initialization of flexible array member in a nested context");
6919           else
6920             pedwarn_init (input_location, OPT_pedantic,
6921                           "initialization of a flexible array member");
6922
6923           /* We have already issued an error message for the existence
6924              of a flexible array member not at the end of the structure.
6925              Discard the initializer so that we do not die later.  */
6926           if (DECL_CHAIN (constructor_fields) != NULL_TREE)
6927             constructor_type = NULL_TREE;
6928         }
6929     }
6930
6931   /* Warn when some struct elements are implicitly initialized to zero.  */
6932   if (warn_missing_field_initializers
6933       && constructor_type
6934       && TREE_CODE (constructor_type) == RECORD_TYPE
6935       && constructor_unfilled_fields)
6936     {
6937         bool constructor_zeroinit =
6938          (VEC_length (constructor_elt, constructor_elements) == 1
6939           && integer_zerop
6940               (VEC_index (constructor_elt, constructor_elements, 0)->value));
6941
6942         /* Do not warn for flexible array members or zero-length arrays.  */
6943         while (constructor_unfilled_fields
6944                && (!DECL_SIZE (constructor_unfilled_fields)
6945                    || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
6946           constructor_unfilled_fields = DECL_CHAIN (constructor_unfilled_fields);
6947
6948         if (constructor_unfilled_fields
6949             /* Do not warn if this level of the initializer uses member
6950                designators; it is likely to be deliberate.  */
6951             && !constructor_designated
6952             /* Do not warn about initializing with ` = {0}'.  */
6953             && !constructor_zeroinit)
6954           {
6955             push_member_name (constructor_unfilled_fields);
6956             warning_init (OPT_Wmissing_field_initializers,
6957                           "missing initializer");
6958             RESTORE_SPELLING_DEPTH (constructor_depth);
6959           }
6960     }
6961
6962   /* Pad out the end of the structure.  */
6963   if (p->replacement_value.value)
6964     /* If this closes a superfluous brace pair,
6965        just pass out the element between them.  */
6966     ret = p->replacement_value;
6967   else if (constructor_type == 0)
6968     ;
6969   else if (TREE_CODE (constructor_type) != RECORD_TYPE
6970            && TREE_CODE (constructor_type) != UNION_TYPE
6971            && TREE_CODE (constructor_type) != ARRAY_TYPE
6972            && TREE_CODE (constructor_type) != VECTOR_TYPE)
6973     {
6974       /* A nonincremental scalar initializer--just return
6975          the element, after verifying there is just one.  */
6976       if (VEC_empty (constructor_elt,constructor_elements))
6977         {
6978           if (!constructor_erroneous)
6979             error_init ("empty scalar initializer");
6980           ret.value = error_mark_node;
6981         }
6982       else if (VEC_length (constructor_elt,constructor_elements) != 1)
6983         {
6984           error_init ("extra elements in scalar initializer");
6985           ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
6986         }
6987       else
6988         ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
6989     }
6990   else
6991     {
6992       if (constructor_erroneous)
6993         ret.value = error_mark_node;
6994       else
6995         {
6996           ret.value = build_constructor (constructor_type,
6997                                          constructor_elements);
6998           if (constructor_constant)
6999             TREE_CONSTANT (ret.value) = 1;
7000           if (constructor_constant && constructor_simple)
7001             TREE_STATIC (ret.value) = 1;
7002           if (constructor_nonconst)
7003             CONSTRUCTOR_NON_CONST (ret.value) = 1;
7004         }
7005     }
7006
7007   if (ret.value && TREE_CODE (ret.value) != CONSTRUCTOR)
7008     {
7009       if (constructor_nonconst)
7010         ret.original_code = C_MAYBE_CONST_EXPR;
7011       else if (ret.original_code == C_MAYBE_CONST_EXPR)
7012         ret.original_code = ERROR_MARK;
7013     }
7014
7015   constructor_type = p->type;
7016   constructor_fields = p->fields;
7017   constructor_index = p->index;
7018   constructor_max_index = p->max_index;
7019   constructor_unfilled_index = p->unfilled_index;
7020   constructor_unfilled_fields = p->unfilled_fields;
7021   constructor_bit_index = p->bit_index;
7022   constructor_elements = p->elements;
7023   constructor_constant = p->constant;
7024   constructor_simple = p->simple;
7025   constructor_nonconst = p->nonconst;
7026   constructor_erroneous = p->erroneous;
7027   constructor_incremental = p->incremental;
7028   constructor_designated = p->designated;
7029   constructor_pending_elts = p->pending_elts;
7030   constructor_depth = p->depth;
7031   if (!p->implicit)
7032     constructor_range_stack = p->range_stack;
7033   RESTORE_SPELLING_DEPTH (constructor_depth);
7034
7035   constructor_stack = p->next;
7036   free (p);
7037
7038   if (ret.value == 0 && constructor_stack == 0)
7039     ret.value = error_mark_node;
7040   return ret;
7041 }
7042
7043 /* Common handling for both array range and field name designators.
7044    ARRAY argument is nonzero for array ranges.  Returns zero for success.  */
7045
7046 static int
7047 set_designator (int array, struct obstack * braced_init_obstack)
7048 {
7049   tree subtype;
7050   enum tree_code subcode;
7051
7052   /* Don't die if an entire brace-pair level is superfluous
7053      in the containing level.  */
7054   if (constructor_type == 0)
7055     return 1;
7056
7057   /* If there were errors in this designator list already, bail out
7058      silently.  */
7059   if (designator_erroneous)
7060     return 1;
7061
7062   if (!designator_depth)
7063     {
7064       gcc_assert (!constructor_range_stack);
7065
7066       /* Designator list starts at the level of closest explicit
7067          braces.  */
7068       while (constructor_stack->implicit)
7069         {
7070           process_init_element (pop_init_level (1, braced_init_obstack),
7071                                 true, braced_init_obstack);
7072         }
7073       constructor_designated = 1;
7074       return 0;
7075     }
7076
7077   switch (TREE_CODE (constructor_type))
7078     {
7079     case  RECORD_TYPE:
7080     case  UNION_TYPE:
7081       subtype = TREE_TYPE (constructor_fields);
7082       if (subtype != error_mark_node)
7083         subtype = TYPE_MAIN_VARIANT (subtype);
7084       break;
7085     case ARRAY_TYPE:
7086       subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
7087       break;
7088     default:
7089       gcc_unreachable ();
7090     }
7091
7092   subcode = TREE_CODE (subtype);
7093   if (array && subcode != ARRAY_TYPE)
7094     {
7095       error_init ("array index in non-array initializer");
7096       return 1;
7097     }
7098   else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
7099     {
7100       error_init ("field name not in record or union initializer");
7101       return 1;
7102     }
7103
7104   constructor_designated = 1;
7105   push_init_level (2, braced_init_obstack);
7106   return 0;
7107 }
7108
7109 /* If there are range designators in designator list, push a new designator
7110    to constructor_range_stack.  RANGE_END is end of such stack range or
7111    NULL_TREE if there is no range designator at this level.  */
7112
7113 static void
7114 push_range_stack (tree range_end, struct obstack * braced_init_obstack)
7115 {
7116   struct constructor_range_stack *p;
7117
7118   p = (struct constructor_range_stack *)
7119     obstack_alloc (braced_init_obstack,
7120                    sizeof (struct constructor_range_stack));
7121   p->prev = constructor_range_stack;
7122   p->next = 0;
7123   p->fields = constructor_fields;
7124   p->range_start = constructor_index;
7125   p->index = constructor_index;
7126   p->stack = constructor_stack;
7127   p->range_end = range_end;
7128   if (constructor_range_stack)
7129     constructor_range_stack->next = p;
7130   constructor_range_stack = p;
7131 }
7132
7133 /* Within an array initializer, specify the next index to be initialized.
7134    FIRST is that index.  If LAST is nonzero, then initialize a range
7135    of indices, running from FIRST through LAST.  */
7136
7137 void
7138 set_init_index (tree first, tree last,
7139                 struct obstack * braced_init_obstack)
7140 {
7141   if (set_designator (1, braced_init_obstack))
7142     return;
7143
7144   designator_erroneous = 1;
7145
7146   if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
7147       || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
7148     {
7149       error_init ("array index in initializer not of integer type");
7150       return;
7151     }
7152
7153   if (TREE_CODE (first) != INTEGER_CST)
7154     {
7155       first = c_fully_fold (first, false, NULL);
7156       if (TREE_CODE (first) == INTEGER_CST)
7157         pedwarn_init (input_location, OPT_pedantic,
7158                       "array index in initializer is not "
7159                       "an integer constant expression");
7160     }
7161
7162   if (last && TREE_CODE (last) != INTEGER_CST)
7163     {
7164       last = c_fully_fold (last, false, NULL);
7165       if (TREE_CODE (last) == INTEGER_CST)
7166         pedwarn_init (input_location, OPT_pedantic,
7167                       "array index in initializer is not "
7168                       "an integer constant expression");
7169     }
7170
7171   if (TREE_CODE (first) != INTEGER_CST)
7172     error_init ("nonconstant array index in initializer");
7173   else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
7174     error_init ("nonconstant array index in initializer");
7175   else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
7176     error_init ("array index in non-array initializer");
7177   else if (tree_int_cst_sgn (first) == -1)
7178     error_init ("array index in initializer exceeds array bounds");
7179   else if (constructor_max_index
7180            && tree_int_cst_lt (constructor_max_index, first))
7181     error_init ("array index in initializer exceeds array bounds");
7182   else
7183     {
7184       constant_expression_warning (first);
7185       if (last)
7186         constant_expression_warning (last);
7187       constructor_index = convert (bitsizetype, first);
7188
7189       if (last)
7190         {
7191           if (tree_int_cst_equal (first, last))
7192             last = 0;
7193           else if (tree_int_cst_lt (last, first))
7194             {
7195               error_init ("empty index range in initializer");
7196               last = 0;
7197             }
7198           else
7199             {
7200               last = convert (bitsizetype, last);
7201               if (constructor_max_index != 0
7202                   && tree_int_cst_lt (constructor_max_index, last))
7203                 {
7204                   error_init ("array index range in initializer exceeds array bounds");
7205                   last = 0;
7206                 }
7207             }
7208         }
7209
7210       designator_depth++;
7211       designator_erroneous = 0;
7212       if (constructor_range_stack || last)
7213         push_range_stack (last, braced_init_obstack);
7214     }
7215 }
7216
7217 /* Within a struct initializer, specify the next field to be initialized.  */
7218
7219 void
7220 set_init_label (tree fieldname, struct obstack * braced_init_obstack)
7221 {
7222   tree field;
7223
7224   if (set_designator (0, braced_init_obstack))
7225     return;
7226
7227   designator_erroneous = 1;
7228
7229   if (TREE_CODE (constructor_type) != RECORD_TYPE
7230       && TREE_CODE (constructor_type) != UNION_TYPE)
7231     {
7232       error_init ("field name not in record or union initializer");
7233       return;
7234     }
7235
7236   field = lookup_field (constructor_type, fieldname);
7237
7238   if (field == 0)
7239     error ("unknown field %qE specified in initializer", fieldname);
7240   else
7241     do
7242       {
7243         constructor_fields = TREE_VALUE (field);
7244         designator_depth++;
7245         designator_erroneous = 0;
7246         if (constructor_range_stack)
7247           push_range_stack (NULL_TREE, braced_init_obstack);
7248         field = TREE_CHAIN (field);
7249         if (field)
7250           {
7251             if (set_designator (0, braced_init_obstack))
7252               return;
7253           }
7254       }
7255     while (field != NULL_TREE);
7256 }
7257 \f
7258 /* Add a new initializer to the tree of pending initializers.  PURPOSE
7259    identifies the initializer, either array index or field in a structure.
7260    VALUE is the value of that index or field.  If ORIGTYPE is not
7261    NULL_TREE, it is the original type of VALUE.
7262
7263    IMPLICIT is true if value comes from pop_init_level (1),
7264    the new initializer has been merged with the existing one
7265    and thus no warnings should be emitted about overriding an
7266    existing initializer.  */
7267
7268 static void
7269 add_pending_init (tree purpose, tree value, tree origtype, bool implicit,
7270                   struct obstack * braced_init_obstack)
7271 {
7272   struct init_node *p, **q, *r;
7273
7274   q = &constructor_pending_elts;
7275   p = 0;
7276
7277   if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7278     {
7279       while (*q != 0)
7280         {
7281           p = *q;
7282           if (tree_int_cst_lt (purpose, p->purpose))
7283             q = &p->left;
7284           else if (tree_int_cst_lt (p->purpose, purpose))
7285             q = &p->right;
7286           else
7287             {
7288               if (!implicit)
7289                 {
7290                   if (TREE_SIDE_EFFECTS (p->value))
7291                     warning_init (0, "initialized field with side-effects overwritten");
7292                   else if (warn_override_init)
7293                     warning_init (OPT_Woverride_init, "initialized field overwritten");
7294                 }
7295               p->value = value;
7296               p->origtype = origtype;
7297               return;
7298             }
7299         }
7300     }
7301   else
7302     {
7303       tree bitpos;
7304
7305       bitpos = bit_position (purpose);
7306       while (*q != NULL)
7307         {
7308           p = *q;
7309           if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
7310             q = &p->left;
7311           else if (p->purpose != purpose)
7312             q = &p->right;
7313           else
7314             {
7315               if (!implicit)
7316                 {
7317                   if (TREE_SIDE_EFFECTS (p->value))
7318                     warning_init (0, "initialized field with side-effects overwritten");
7319                   else if (warn_override_init)
7320                     warning_init (OPT_Woverride_init, "initialized field overwritten");
7321                 }
7322               p->value = value;
7323               p->origtype = origtype;
7324               return;
7325             }
7326         }
7327     }
7328
7329   r = (struct init_node *) obstack_alloc (braced_init_obstack,
7330                                           sizeof (struct init_node));
7331   r->purpose = purpose;
7332   r->value = value;
7333   r->origtype = origtype;
7334
7335   *q = r;
7336   r->parent = p;
7337   r->left = 0;
7338   r->right = 0;
7339   r->balance = 0;
7340
7341   while (p)
7342     {
7343       struct init_node *s;
7344
7345       if (r == p->left)
7346         {
7347           if (p->balance == 0)
7348             p->balance = -1;
7349           else if (p->balance < 0)
7350             {
7351               if (r->balance < 0)
7352                 {
7353                   /* L rotation.  */
7354                   p->left = r->right;
7355                   if (p->left)
7356                     p->left->parent = p;
7357                   r->right = p;
7358
7359                   p->balance = 0;
7360                   r->balance = 0;
7361
7362                   s = p->parent;
7363                   p->parent = r;
7364                   r->parent = s;
7365                   if (s)
7366                     {
7367                       if (s->left == p)
7368                         s->left = r;
7369                       else
7370                         s->right = r;
7371                     }
7372                   else
7373                     constructor_pending_elts = r;
7374                 }
7375               else
7376                 {
7377                   /* LR rotation.  */
7378                   struct init_node *t = r->right;
7379
7380                   r->right = t->left;
7381                   if (r->right)
7382                     r->right->parent = r;
7383                   t->left = r;
7384
7385                   p->left = t->right;
7386                   if (p->left)
7387                     p->left->parent = p;
7388                   t->right = p;
7389
7390                   p->balance = t->balance < 0;
7391                   r->balance = -(t->balance > 0);
7392                   t->balance = 0;
7393
7394                   s = p->parent;
7395                   p->parent = t;
7396                   r->parent = t;
7397                   t->parent = s;
7398                   if (s)
7399                     {
7400                       if (s->left == p)
7401                         s->left = t;
7402                       else
7403                         s->right = t;
7404                     }
7405                   else
7406                     constructor_pending_elts = t;
7407                 }
7408               break;
7409             }
7410           else
7411             {
7412               /* p->balance == +1; growth of left side balances the node.  */
7413               p->balance = 0;
7414               break;
7415             }
7416         }
7417       else /* r == p->right */
7418         {
7419           if (p->balance == 0)
7420             /* Growth propagation from right side.  */
7421             p->balance++;
7422           else if (p->balance > 0)
7423             {
7424               if (r->balance > 0)
7425                 {
7426                   /* R rotation.  */
7427                   p->right = r->left;
7428                   if (p->right)
7429                     p->right->parent = p;
7430                   r->left = p;
7431
7432                   p->balance = 0;
7433                   r->balance = 0;
7434
7435                   s = p->parent;
7436                   p->parent = r;
7437                   r->parent = s;
7438                   if (s)
7439                     {
7440                       if (s->left == p)
7441                         s->left = r;
7442                       else
7443                         s->right = r;
7444                     }
7445                   else
7446                     constructor_pending_elts = r;
7447                 }
7448               else /* r->balance == -1 */
7449                 {
7450                   /* RL rotation */
7451                   struct init_node *t = r->left;
7452
7453                   r->left = t->right;
7454                   if (r->left)
7455                     r->left->parent = r;
7456                   t->right = r;
7457
7458                   p->right = t->left;
7459                   if (p->right)
7460                     p->right->parent = p;
7461                   t->left = p;
7462
7463                   r->balance = (t->balance < 0);
7464                   p->balance = -(t->balance > 0);
7465                   t->balance = 0;
7466
7467                   s = p->parent;
7468                   p->parent = t;
7469                   r->parent = t;
7470                   t->parent = s;
7471                   if (s)
7472                     {
7473                       if (s->left == p)
7474                         s->left = t;
7475                       else
7476                         s->right = t;
7477                     }
7478                   else
7479                     constructor_pending_elts = t;
7480                 }
7481               break;
7482             }
7483           else
7484             {
7485               /* p->balance == -1; growth of right side balances the node.  */
7486               p->balance = 0;
7487               break;
7488             }
7489         }
7490
7491       r = p;
7492       p = p->parent;
7493     }
7494 }
7495
7496 /* Build AVL tree from a sorted chain.  */
7497
7498 static void
7499 set_nonincremental_init (struct obstack * braced_init_obstack)
7500 {
7501   unsigned HOST_WIDE_INT ix;
7502   tree index, value;
7503
7504   if (TREE_CODE (constructor_type) != RECORD_TYPE
7505       && TREE_CODE (constructor_type) != ARRAY_TYPE)
7506     return;
7507
7508   FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
7509     {
7510       add_pending_init (index, value, NULL_TREE, false,
7511                         braced_init_obstack);
7512     }
7513   constructor_elements = 0;
7514   if (TREE_CODE (constructor_type) == RECORD_TYPE)
7515     {
7516       constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
7517       /* Skip any nameless bit fields at the beginning.  */
7518       while (constructor_unfilled_fields != 0
7519              && DECL_C_BIT_FIELD (constructor_unfilled_fields)
7520              && DECL_NAME (constructor_unfilled_fields) == 0)
7521         constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
7522
7523     }
7524   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7525     {
7526       if (TYPE_DOMAIN (constructor_type))
7527         constructor_unfilled_index
7528             = convert (bitsizetype,
7529                        TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
7530       else
7531         constructor_unfilled_index = bitsize_zero_node;
7532     }
7533   constructor_incremental = 0;
7534 }
7535
7536 /* Build AVL tree from a string constant.  */
7537
7538 static void
7539 set_nonincremental_init_from_string (tree str,
7540                                      struct obstack * braced_init_obstack)
7541 {
7542   tree value, purpose, type;
7543   HOST_WIDE_INT val[2];
7544   const char *p, *end;
7545   int byte, wchar_bytes, charwidth, bitpos;
7546
7547   gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
7548
7549   wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
7550   charwidth = TYPE_PRECISION (char_type_node);
7551   type = TREE_TYPE (constructor_type);
7552   p = TREE_STRING_POINTER (str);
7553   end = p + TREE_STRING_LENGTH (str);
7554
7555   for (purpose = bitsize_zero_node;
7556        p < end && !tree_int_cst_lt (constructor_max_index, purpose);
7557        purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
7558     {
7559       if (wchar_bytes == 1)
7560         {
7561           val[1] = (unsigned char) *p++;
7562           val[0] = 0;
7563         }
7564       else
7565         {
7566           val[0] = 0;
7567           val[1] = 0;
7568           for (byte = 0; byte < wchar_bytes; byte++)
7569             {
7570               if (BYTES_BIG_ENDIAN)
7571                 bitpos = (wchar_bytes - byte - 1) * charwidth;
7572               else
7573                 bitpos = byte * charwidth;
7574               val[bitpos < HOST_BITS_PER_WIDE_INT]
7575                 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
7576                    << (bitpos % HOST_BITS_PER_WIDE_INT);
7577             }
7578         }
7579
7580       if (!TYPE_UNSIGNED (type))
7581         {
7582           bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
7583           if (bitpos < HOST_BITS_PER_WIDE_INT)
7584             {
7585               if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
7586                 {
7587                   val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
7588                   val[0] = -1;
7589                 }
7590             }
7591           else if (bitpos == HOST_BITS_PER_WIDE_INT)
7592             {
7593               if (val[1] < 0)
7594                 val[0] = -1;
7595             }
7596           else if (val[0] & (((HOST_WIDE_INT) 1)
7597                              << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
7598             val[0] |= ((HOST_WIDE_INT) -1)
7599                       << (bitpos - HOST_BITS_PER_WIDE_INT);
7600         }
7601
7602       value = build_int_cst_wide (type, val[1], val[0]);
7603       add_pending_init (purpose, value, NULL_TREE, false,
7604                         braced_init_obstack);
7605     }
7606
7607   constructor_incremental = 0;
7608 }
7609
7610 /* Return value of FIELD in pending initializer or zero if the field was
7611    not initialized yet.  */
7612
7613 static tree
7614 find_init_member (tree field, struct obstack * braced_init_obstack)
7615 {
7616   struct init_node *p;
7617
7618   if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7619     {
7620       if (constructor_incremental
7621           && tree_int_cst_lt (field, constructor_unfilled_index))
7622         set_nonincremental_init (braced_init_obstack);
7623
7624       p = constructor_pending_elts;
7625       while (p)
7626         {
7627           if (tree_int_cst_lt (field, p->purpose))
7628             p = p->left;
7629           else if (tree_int_cst_lt (p->purpose, field))
7630             p = p->right;
7631           else
7632             return p->value;
7633         }
7634     }
7635   else if (TREE_CODE (constructor_type) == RECORD_TYPE)
7636     {
7637       tree bitpos = bit_position (field);
7638
7639       if (constructor_incremental
7640           && (!constructor_unfilled_fields
7641               || tree_int_cst_lt (bitpos,
7642                                   bit_position (constructor_unfilled_fields))))
7643         set_nonincremental_init (braced_init_obstack);
7644
7645       p = constructor_pending_elts;
7646       while (p)
7647         {
7648           if (field == p->purpose)
7649             return p->value;
7650           else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
7651             p = p->left;
7652           else
7653             p = p->right;
7654         }
7655     }
7656   else if (TREE_CODE (constructor_type) == UNION_TYPE)
7657     {
7658       if (!VEC_empty (constructor_elt, constructor_elements)
7659           && (VEC_last (constructor_elt, constructor_elements)->index
7660               == field))
7661         return VEC_last (constructor_elt, constructor_elements)->value;
7662     }
7663   return 0;
7664 }
7665
7666 /* "Output" the next constructor element.
7667    At top level, really output it to assembler code now.
7668    Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
7669    If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
7670    TYPE is the data type that the containing data type wants here.
7671    FIELD is the field (a FIELD_DECL) or the index that this element fills.
7672    If VALUE is a string constant, STRICT_STRING is true if it is
7673    unparenthesized or we should not warn here for it being parenthesized.
7674    For other types of VALUE, STRICT_STRING is not used.
7675
7676    PENDING if non-nil means output pending elements that belong
7677    right after this element.  (PENDING is normally 1;
7678    it is 0 while outputting pending elements, to avoid recursion.)
7679
7680    IMPLICIT is true if value comes from pop_init_level (1),
7681    the new initializer has been merged with the existing one
7682    and thus no warnings should be emitted about overriding an
7683    existing initializer.  */
7684
7685 static void
7686 output_init_element (tree value, tree origtype, bool strict_string, tree type,
7687                      tree field, int pending, bool implicit,
7688                      struct obstack * braced_init_obstack)
7689 {
7690   tree semantic_type = NULL_TREE;
7691   constructor_elt *celt;
7692   bool maybe_const = true;
7693   bool npc;
7694
7695   if (type == error_mark_node || value == error_mark_node)
7696     {
7697       constructor_erroneous = 1;
7698       return;
7699     }
7700   if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
7701       && (TREE_CODE (value) == STRING_CST
7702           || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
7703       && !(TREE_CODE (value) == STRING_CST
7704            && TREE_CODE (type) == ARRAY_TYPE
7705            && INTEGRAL_TYPE_P (TREE_TYPE (type)))
7706       && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
7707                      TYPE_MAIN_VARIANT (type)))
7708     value = array_to_pointer_conversion (input_location, value);
7709
7710   if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
7711       && require_constant_value && !flag_isoc99 && pending)
7712     {
7713       /* As an extension, allow initializing objects with static storage
7714          duration with compound literals (which are then treated just as
7715          the brace enclosed list they contain).  */
7716       tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
7717       value = DECL_INITIAL (decl);
7718     }
7719
7720   npc = null_pointer_constant_p (value);
7721   if (TREE_CODE (value) == EXCESS_PRECISION_EXPR)
7722     {
7723       semantic_type = TREE_TYPE (value);
7724       value = TREE_OPERAND (value, 0);
7725     }
7726   value = c_fully_fold (value, require_constant_value, &maybe_const);
7727
7728   if (value == error_mark_node)
7729     constructor_erroneous = 1;
7730   else if (!TREE_CONSTANT (value))
7731     constructor_constant = 0;
7732   else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
7733            || ((TREE_CODE (constructor_type) == RECORD_TYPE
7734                 || TREE_CODE (constructor_type) == UNION_TYPE)
7735                && DECL_C_BIT_FIELD (field)
7736                && TREE_CODE (value) != INTEGER_CST))
7737     constructor_simple = 0;
7738   if (!maybe_const)
7739     constructor_nonconst = 1;
7740
7741   if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
7742     {
7743       if (require_constant_value)
7744         {
7745           error_init ("initializer element is not constant");
7746           value = error_mark_node;
7747         }
7748       else if (require_constant_elements)
7749         pedwarn (input_location, 0,
7750                  "initializer element is not computable at load time");
7751     }
7752   else if (!maybe_const
7753            && (require_constant_value || require_constant_elements))
7754     pedwarn_init (input_location, 0,
7755                   "initializer element is not a constant expression");
7756
7757   /* Issue -Wc++-compat warnings about initializing a bitfield with
7758      enum type.  */
7759   if (warn_cxx_compat
7760       && field != NULL_TREE
7761       && TREE_CODE (field) == FIELD_DECL
7762       && DECL_BIT_FIELD_TYPE (field) != NULL_TREE
7763       && (TYPE_MAIN_VARIANT (DECL_BIT_FIELD_TYPE (field))
7764           != TYPE_MAIN_VARIANT (type))
7765       && TREE_CODE (DECL_BIT_FIELD_TYPE (field)) == ENUMERAL_TYPE)
7766     {
7767       tree checktype = origtype != NULL_TREE ? origtype : TREE_TYPE (value);
7768       if (checktype != error_mark_node
7769           && (TYPE_MAIN_VARIANT (checktype)
7770               != TYPE_MAIN_VARIANT (DECL_BIT_FIELD_TYPE (field))))
7771         warning_init (OPT_Wc___compat,
7772                       "enum conversion in initialization is invalid in C++");
7773     }
7774
7775   /* If this field is empty (and not at the end of structure),
7776      don't do anything other than checking the initializer.  */
7777   if (field
7778       && (TREE_TYPE (field) == error_mark_node
7779           || (COMPLETE_TYPE_P (TREE_TYPE (field))
7780               && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
7781               && (TREE_CODE (constructor_type) == ARRAY_TYPE
7782                   || DECL_CHAIN (field)))))
7783     return;
7784
7785   if (semantic_type)
7786     value = build1 (EXCESS_PRECISION_EXPR, semantic_type, value);
7787   value = digest_init (input_location, type, value, origtype, npc,
7788                        strict_string, require_constant_value);
7789   if (value == error_mark_node)
7790     {
7791       constructor_erroneous = 1;
7792       return;
7793     }
7794   if (require_constant_value || require_constant_elements)
7795     constant_expression_warning (value);
7796
7797   /* If this element doesn't come next in sequence,
7798      put it on constructor_pending_elts.  */
7799   if (TREE_CODE (constructor_type) == ARRAY_TYPE
7800       && (!constructor_incremental
7801           || !tree_int_cst_equal (field, constructor_unfilled_index)))
7802     {
7803       if (constructor_incremental
7804           && tree_int_cst_lt (field, constructor_unfilled_index))
7805         set_nonincremental_init (braced_init_obstack);
7806
7807       add_pending_init (field, value, origtype, implicit,
7808                         braced_init_obstack);
7809       return;
7810     }
7811   else if (TREE_CODE (constructor_type) == RECORD_TYPE
7812            && (!constructor_incremental
7813                || field != constructor_unfilled_fields))
7814     {
7815       /* We do this for records but not for unions.  In a union,
7816          no matter which field is specified, it can be initialized
7817          right away since it starts at the beginning of the union.  */
7818       if (constructor_incremental)
7819         {
7820           if (!constructor_unfilled_fields)
7821             set_nonincremental_init (braced_init_obstack);
7822           else
7823             {
7824               tree bitpos, unfillpos;
7825
7826               bitpos = bit_position (field);
7827               unfillpos = bit_position (constructor_unfilled_fields);
7828
7829               if (tree_int_cst_lt (bitpos, unfillpos))
7830                 set_nonincremental_init (braced_init_obstack);
7831             }
7832         }
7833
7834       add_pending_init (field, value, origtype, implicit,
7835                         braced_init_obstack);
7836       return;
7837     }
7838   else if (TREE_CODE (constructor_type) == UNION_TYPE
7839            && !VEC_empty (constructor_elt, constructor_elements))
7840     {
7841       if (!implicit)
7842         {
7843           if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
7844                                            constructor_elements)->value))
7845             warning_init (0,
7846                           "initialized field with side-effects overwritten");
7847           else if (warn_override_init)
7848             warning_init (OPT_Woverride_init, "initialized field overwritten");
7849         }
7850
7851       /* We can have just one union field set.  */
7852       constructor_elements = 0;
7853     }
7854
7855   /* Otherwise, output this element either to
7856      constructor_elements or to the assembler file.  */
7857
7858   celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
7859   celt->index = field;
7860   celt->value = value;
7861
7862   /* Advance the variable that indicates sequential elements output.  */
7863   if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7864     constructor_unfilled_index
7865       = size_binop_loc (input_location, PLUS_EXPR, constructor_unfilled_index,
7866                         bitsize_one_node);
7867   else if (TREE_CODE (constructor_type) == RECORD_TYPE)
7868     {
7869       constructor_unfilled_fields
7870         = DECL_CHAIN (constructor_unfilled_fields);
7871
7872       /* Skip any nameless bit fields.  */
7873       while (constructor_unfilled_fields != 0
7874              && DECL_C_BIT_FIELD (constructor_unfilled_fields)
7875              && DECL_NAME (constructor_unfilled_fields) == 0)
7876         constructor_unfilled_fields =
7877           DECL_CHAIN (constructor_unfilled_fields);
7878     }
7879   else if (TREE_CODE (constructor_type) == UNION_TYPE)
7880     constructor_unfilled_fields = 0;
7881
7882   /* Now output any pending elements which have become next.  */
7883   if (pending)
7884     output_pending_init_elements (0, braced_init_obstack);
7885 }
7886
7887 /* Output any pending elements which have become next.
7888    As we output elements, constructor_unfilled_{fields,index}
7889    advances, which may cause other elements to become next;
7890    if so, they too are output.
7891
7892    If ALL is 0, we return when there are
7893    no more pending elements to output now.
7894
7895    If ALL is 1, we output space as necessary so that
7896    we can output all the pending elements.  */
7897 static void
7898 output_pending_init_elements (int all, struct obstack * braced_init_obstack)
7899 {
7900   struct init_node *elt = constructor_pending_elts;
7901   tree next;
7902
7903  retry:
7904
7905   /* Look through the whole pending tree.
7906      If we find an element that should be output now,
7907      output it.  Otherwise, set NEXT to the element
7908      that comes first among those still pending.  */
7909
7910   next = 0;
7911   while (elt)
7912     {
7913       if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7914         {
7915           if (tree_int_cst_equal (elt->purpose,
7916                                   constructor_unfilled_index))
7917             output_init_element (elt->value, elt->origtype, true,
7918                                  TREE_TYPE (constructor_type),
7919                                  constructor_unfilled_index, 0, false,
7920                                  braced_init_obstack);
7921           else if (tree_int_cst_lt (constructor_unfilled_index,
7922                                     elt->purpose))
7923             {
7924               /* Advance to the next smaller node.  */
7925               if (elt->left)
7926                 elt = elt->left;
7927               else
7928                 {
7929                   /* We have reached the smallest node bigger than the
7930                      current unfilled index.  Fill the space first.  */
7931                   next = elt->purpose;
7932                   break;
7933                 }
7934             }
7935           else
7936             {
7937               /* Advance to the next bigger node.  */
7938               if (elt->right)
7939                 elt = elt->right;
7940               else
7941                 {
7942                   /* We have reached the biggest node in a subtree.  Find
7943                      the parent of it, which is the next bigger node.  */
7944                   while (elt->parent && elt->parent->right == elt)
7945                     elt = elt->parent;
7946                   elt = elt->parent;
7947                   if (elt && tree_int_cst_lt (constructor_unfilled_index,
7948                                               elt->purpose))
7949                     {
7950                       next = elt->purpose;
7951                       break;
7952                     }
7953                 }
7954             }
7955         }
7956       else if (TREE_CODE (constructor_type) == RECORD_TYPE
7957                || TREE_CODE (constructor_type) == UNION_TYPE)
7958         {
7959           tree ctor_unfilled_bitpos, elt_bitpos;
7960
7961           /* If the current record is complete we are done.  */
7962           if (constructor_unfilled_fields == 0)
7963             break;
7964
7965           ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
7966           elt_bitpos = bit_position (elt->purpose);
7967           /* We can't compare fields here because there might be empty
7968              fields in between.  */
7969           if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
7970             {
7971               constructor_unfilled_fields = elt->purpose;
7972               output_init_element (elt->value, elt->origtype, true,
7973                                    TREE_TYPE (elt->purpose),
7974                                    elt->purpose, 0, false,
7975                                    braced_init_obstack);
7976             }
7977           else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
7978             {
7979               /* Advance to the next smaller node.  */
7980               if (elt->left)
7981                 elt = elt->left;
7982               else
7983                 {
7984                   /* We have reached the smallest node bigger than the
7985                      current unfilled field.  Fill the space first.  */
7986                   next = elt->purpose;
7987                   break;
7988                 }
7989             }
7990           else
7991             {
7992               /* Advance to the next bigger node.  */
7993               if (elt->right)
7994                 elt = elt->right;
7995               else
7996                 {
7997                   /* We have reached the biggest node in a subtree.  Find
7998                      the parent of it, which is the next bigger node.  */
7999                   while (elt->parent && elt->parent->right == elt)
8000                     elt = elt->parent;
8001                   elt = elt->parent;
8002                   if (elt
8003                       && (tree_int_cst_lt (ctor_unfilled_bitpos,
8004                                            bit_position (elt->purpose))))
8005                     {
8006                       next = elt->purpose;
8007                       break;
8008                     }
8009                 }
8010             }
8011         }
8012     }
8013
8014   /* Ordinarily return, but not if we want to output all
8015      and there are elements left.  */
8016   if (!(all && next != 0))
8017     return;
8018
8019   /* If it's not incremental, just skip over the gap, so that after
8020      jumping to retry we will output the next successive element.  */
8021   if (TREE_CODE (constructor_type) == RECORD_TYPE
8022       || TREE_CODE (constructor_type) == UNION_TYPE)
8023     constructor_unfilled_fields = next;
8024   else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
8025     constructor_unfilled_index = next;
8026
8027   /* ELT now points to the node in the pending tree with the next
8028      initializer to output.  */
8029   goto retry;
8030 }
8031 \f
8032 /* Add one non-braced element to the current constructor level.
8033    This adjusts the current position within the constructor's type.
8034    This may also start or terminate implicit levels
8035    to handle a partly-braced initializer.
8036
8037    Once this has found the correct level for the new element,
8038    it calls output_init_element.
8039
8040    IMPLICIT is true if value comes from pop_init_level (1),
8041    the new initializer has been merged with the existing one
8042    and thus no warnings should be emitted about overriding an
8043    existing initializer.  */
8044
8045 void
8046 process_init_element (struct c_expr value, bool implicit,
8047                       struct obstack * braced_init_obstack)
8048 {
8049   tree orig_value = value.value;
8050   int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
8051   bool strict_string = value.original_code == STRING_CST;
8052
8053   designator_depth = 0;
8054   designator_erroneous = 0;
8055
8056   /* Handle superfluous braces around string cst as in
8057      char x[] = {"foo"}; */
8058   if (string_flag
8059       && constructor_type
8060       && TREE_CODE (constructor_type) == ARRAY_TYPE
8061       && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
8062       && integer_zerop (constructor_unfilled_index))
8063     {
8064       if (constructor_stack->replacement_value.value)
8065         error_init ("excess elements in char array initializer");
8066       constructor_stack->replacement_value = value;
8067       return;
8068     }
8069
8070   if (constructor_stack->replacement_value.value != 0)
8071     {
8072       error_init ("excess elements in struct initializer");
8073       return;
8074     }
8075
8076   /* Ignore elements of a brace group if it is entirely superfluous
8077      and has already been diagnosed.  */
8078   if (constructor_type == 0)
8079     return;
8080
8081   /* If we've exhausted any levels that didn't have braces,
8082      pop them now.  */
8083   while (constructor_stack->implicit)
8084     {
8085       if ((TREE_CODE (constructor_type) == RECORD_TYPE
8086            || TREE_CODE (constructor_type) == UNION_TYPE)
8087           && constructor_fields == 0)
8088         process_init_element (pop_init_level (1, braced_init_obstack),
8089                               true, braced_init_obstack);
8090       else if ((TREE_CODE (constructor_type) == ARRAY_TYPE
8091                 || TREE_CODE (constructor_type) == VECTOR_TYPE)
8092                && (constructor_max_index == 0
8093                    || tree_int_cst_lt (constructor_max_index,
8094                                        constructor_index)))
8095         process_init_element (pop_init_level (1, braced_init_obstack),
8096                               true, braced_init_obstack);
8097       else
8098         break;
8099     }
8100
8101   /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once.  */
8102   if (constructor_range_stack)
8103     {
8104       /* If value is a compound literal and we'll be just using its
8105          content, don't put it into a SAVE_EXPR.  */
8106       if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
8107           || !require_constant_value
8108           || flag_isoc99)
8109         {
8110           tree semantic_type = NULL_TREE;
8111           if (TREE_CODE (value.value) == EXCESS_PRECISION_EXPR)
8112             {
8113               semantic_type = TREE_TYPE (value.value);
8114               value.value = TREE_OPERAND (value.value, 0);
8115             }
8116           value.value = c_save_expr (value.value);
8117           if (semantic_type)
8118             value.value = build1 (EXCESS_PRECISION_EXPR, semantic_type,
8119                                   value.value);
8120         }
8121     }
8122
8123   while (1)
8124     {
8125       if (TREE_CODE (constructor_type) == RECORD_TYPE)
8126         {
8127           tree fieldtype;
8128           enum tree_code fieldcode;
8129
8130           if (constructor_fields == 0)
8131             {
8132               pedwarn_init (input_location, 0,
8133                             "excess elements in struct initializer");
8134               break;
8135             }
8136
8137           fieldtype = TREE_TYPE (constructor_fields);
8138           if (fieldtype != error_mark_node)
8139             fieldtype = TYPE_MAIN_VARIANT (fieldtype);
8140           fieldcode = TREE_CODE (fieldtype);
8141
8142           /* Error for non-static initialization of a flexible array member.  */
8143           if (fieldcode == ARRAY_TYPE
8144               && !require_constant_value
8145               && TYPE_SIZE (fieldtype) == NULL_TREE
8146               && DECL_CHAIN (constructor_fields) == NULL_TREE)
8147             {
8148               error_init ("non-static initialization of a flexible array member");
8149               break;
8150             }
8151
8152           /* Accept a string constant to initialize a subarray.  */
8153           if (value.value != 0
8154               && fieldcode == ARRAY_TYPE
8155               && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
8156               && string_flag)
8157             value.value = orig_value;
8158           /* Otherwise, if we have come to a subaggregate,
8159              and we don't have an element of its type, push into it.  */
8160           else if (value.value != 0
8161                    && value.value != error_mark_node
8162                    && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
8163                    && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
8164                        || fieldcode == UNION_TYPE || fieldcode == VECTOR_TYPE))
8165             {
8166               push_init_level (1, braced_init_obstack);
8167               continue;
8168             }
8169
8170           if (value.value)
8171             {
8172               push_member_name (constructor_fields);
8173               output_init_element (value.value, value.original_type,
8174                                    strict_string, fieldtype,
8175                                    constructor_fields, 1, implicit,
8176                                    braced_init_obstack);
8177               RESTORE_SPELLING_DEPTH (constructor_depth);
8178             }
8179           else
8180             /* Do the bookkeeping for an element that was
8181                directly output as a constructor.  */
8182             {
8183               /* For a record, keep track of end position of last field.  */
8184               if (DECL_SIZE (constructor_fields))
8185                 constructor_bit_index
8186                   = size_binop_loc (input_location, PLUS_EXPR,
8187                                     bit_position (constructor_fields),
8188                                     DECL_SIZE (constructor_fields));
8189
8190               /* If the current field was the first one not yet written out,
8191                  it isn't now, so update.  */
8192               if (constructor_unfilled_fields == constructor_fields)
8193                 {
8194                   constructor_unfilled_fields = DECL_CHAIN (constructor_fields);
8195                   /* Skip any nameless bit fields.  */
8196                   while (constructor_unfilled_fields != 0
8197                          && DECL_C_BIT_FIELD (constructor_unfilled_fields)
8198                          && DECL_NAME (constructor_unfilled_fields) == 0)
8199                     constructor_unfilled_fields =
8200                       DECL_CHAIN (constructor_unfilled_fields);
8201                 }
8202             }
8203
8204           constructor_fields = DECL_CHAIN (constructor_fields);
8205           /* Skip any nameless bit fields at the beginning.  */
8206           while (constructor_fields != 0
8207                  && DECL_C_BIT_FIELD (constructor_fields)
8208                  && DECL_NAME (constructor_fields) == 0)
8209             constructor_fields = DECL_CHAIN (constructor_fields);
8210         }
8211       else if (TREE_CODE (constructor_type) == UNION_TYPE)
8212         {
8213           tree fieldtype;
8214           enum tree_code fieldcode;
8215
8216           if (constructor_fields == 0)
8217             {
8218               pedwarn_init (input_location, 0,
8219                             "excess elements in union initializer");
8220               break;
8221             }
8222
8223           fieldtype = TREE_TYPE (constructor_fields);
8224           if (fieldtype != error_mark_node)
8225             fieldtype = TYPE_MAIN_VARIANT (fieldtype);
8226           fieldcode = TREE_CODE (fieldtype);
8227
8228           /* Warn that traditional C rejects initialization of unions.
8229              We skip the warning if the value is zero.  This is done
8230              under the assumption that the zero initializer in user
8231              code appears conditioned on e.g. __STDC__ to avoid
8232              "missing initializer" warnings and relies on default
8233              initialization to zero in the traditional C case.
8234              We also skip the warning if the initializer is designated,
8235              again on the assumption that this must be conditional on
8236              __STDC__ anyway (and we've already complained about the
8237              member-designator already).  */
8238           if (!in_system_header && !constructor_designated
8239               && !(value.value && (integer_zerop (value.value)
8240                                    || real_zerop (value.value))))
8241             warning (OPT_Wtraditional, "traditional C rejects initialization "
8242                      "of unions");
8243
8244           /* Accept a string constant to initialize a subarray.  */
8245           if (value.value != 0
8246               && fieldcode == ARRAY_TYPE
8247               && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
8248               && string_flag)
8249             value.value = orig_value;
8250           /* Otherwise, if we have come to a subaggregate,
8251              and we don't have an element of its type, push into it.  */
8252           else if (value.value != 0
8253                    && value.value != error_mark_node
8254                    && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
8255                    && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
8256                        || fieldcode == UNION_TYPE || fieldcode == VECTOR_TYPE))
8257             {
8258               push_init_level (1, braced_init_obstack);
8259               continue;
8260             }
8261
8262           if (value.value)
8263             {
8264               push_member_name (constructor_fields);
8265               output_init_element (value.value, value.original_type,
8266                                    strict_string, fieldtype,
8267                                    constructor_fields, 1, implicit,
8268                                    braced_init_obstack);
8269               RESTORE_SPELLING_DEPTH (constructor_depth);
8270             }
8271           else
8272             /* Do the bookkeeping for an element that was
8273                directly output as a constructor.  */
8274             {
8275               constructor_bit_index = DECL_SIZE (constructor_fields);
8276               constructor_unfilled_fields = DECL_CHAIN (constructor_fields);
8277             }
8278
8279           constructor_fields = 0;
8280         }
8281       else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
8282         {
8283           tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
8284           enum tree_code eltcode = TREE_CODE (elttype);
8285
8286           /* Accept a string constant to initialize a subarray.  */
8287           if (value.value != 0
8288               && eltcode == ARRAY_TYPE
8289               && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
8290               && string_flag)
8291             value.value = orig_value;
8292           /* Otherwise, if we have come to a subaggregate,
8293              and we don't have an element of its type, push into it.  */
8294           else if (value.value != 0
8295                    && value.value != error_mark_node
8296                    && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
8297                    && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
8298                        || eltcode == UNION_TYPE || eltcode == VECTOR_TYPE))
8299             {
8300               push_init_level (1, braced_init_obstack);
8301               continue;
8302             }
8303
8304           if (constructor_max_index != 0
8305               && (tree_int_cst_lt (constructor_max_index, constructor_index)
8306                   || integer_all_onesp (constructor_max_index)))
8307             {
8308               pedwarn_init (input_location, 0,
8309                             "excess elements in array initializer");
8310               break;
8311             }
8312
8313           /* Now output the actual element.  */
8314           if (value.value)
8315             {
8316               push_array_bounds (tree_low_cst (constructor_index, 1));
8317               output_init_element (value.value, value.original_type,
8318                                    strict_string, elttype,
8319                                    constructor_index, 1, implicit,
8320                                    braced_init_obstack);
8321               RESTORE_SPELLING_DEPTH (constructor_depth);
8322             }
8323
8324           constructor_index
8325             = size_binop_loc (input_location, PLUS_EXPR,
8326                               constructor_index, bitsize_one_node);
8327
8328           if (!value.value)
8329             /* If we are doing the bookkeeping for an element that was
8330                directly output as a constructor, we must update
8331                constructor_unfilled_index.  */
8332             constructor_unfilled_index = constructor_index;
8333         }
8334       else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
8335         {
8336           tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
8337
8338          /* Do a basic check of initializer size.  Note that vectors
8339             always have a fixed size derived from their type.  */
8340           if (tree_int_cst_lt (constructor_max_index, constructor_index))
8341             {
8342               pedwarn_init (input_location, 0,
8343                             "excess elements in vector initializer");
8344               break;
8345             }
8346
8347           /* Now output the actual element.  */
8348           if (value.value)
8349             {
8350               if (TREE_CODE (value.value) == VECTOR_CST)
8351                 elttype = TYPE_MAIN_VARIANT (constructor_type);
8352               output_init_element (value.value, value.original_type,
8353                                    strict_string, elttype,
8354                                    constructor_index, 1, implicit,
8355                                    braced_init_obstack);
8356             }
8357
8358           constructor_index
8359             = size_binop_loc (input_location,
8360                               PLUS_EXPR, constructor_index, bitsize_one_node);
8361
8362           if (!value.value)
8363             /* If we are doing the bookkeeping for an element that was
8364                directly output as a constructor, we must update
8365                constructor_unfilled_index.  */
8366             constructor_unfilled_index = constructor_index;
8367         }
8368
8369       /* Handle the sole element allowed in a braced initializer
8370          for a scalar variable.  */
8371       else if (constructor_type != error_mark_node
8372                && constructor_fields == 0)
8373         {
8374           pedwarn_init (input_location, 0,
8375                         "excess elements in scalar initializer");
8376           break;
8377         }
8378       else
8379         {
8380           if (value.value)
8381             output_init_element (value.value, value.original_type,
8382                                  strict_string, constructor_type,
8383                                  NULL_TREE, 1, implicit,
8384                                  braced_init_obstack);
8385           constructor_fields = 0;
8386         }
8387
8388       /* Handle range initializers either at this level or anywhere higher
8389          in the designator stack.  */
8390       if (constructor_range_stack)
8391         {
8392           struct constructor_range_stack *p, *range_stack;
8393           int finish = 0;
8394
8395           range_stack = constructor_range_stack;
8396           constructor_range_stack = 0;
8397           while (constructor_stack != range_stack->stack)
8398             {
8399               gcc_assert (constructor_stack->implicit);
8400               process_init_element (pop_init_level (1,
8401                                                     braced_init_obstack),
8402                                     true, braced_init_obstack);
8403             }
8404           for (p = range_stack;
8405                !p->range_end || tree_int_cst_equal (p->index, p->range_end);
8406                p = p->prev)
8407             {
8408               gcc_assert (constructor_stack->implicit);
8409               process_init_element (pop_init_level (1, braced_init_obstack),
8410                                     true, braced_init_obstack);
8411             }
8412
8413           p->index = size_binop_loc (input_location,
8414                                      PLUS_EXPR, p->index, bitsize_one_node);
8415           if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
8416             finish = 1;
8417
8418           while (1)
8419             {
8420               constructor_index = p->index;
8421               constructor_fields = p->fields;
8422               if (finish && p->range_end && p->index == p->range_start)
8423                 {
8424                   finish = 0;
8425                   p->prev = 0;
8426                 }
8427               p = p->next;
8428               if (!p)
8429                 break;
8430               push_init_level (2, braced_init_obstack);
8431               p->stack = constructor_stack;
8432               if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
8433                 p->index = p->range_start;
8434             }
8435
8436           if (!finish)
8437             constructor_range_stack = range_stack;
8438           continue;
8439         }
8440
8441       break;
8442     }
8443
8444   constructor_range_stack = 0;
8445 }
8446 \f
8447 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
8448    (guaranteed to be 'volatile' or null) and ARGS (represented using
8449    an ASM_EXPR node).  */
8450 tree
8451 build_asm_stmt (tree cv_qualifier, tree args)
8452 {
8453   if (!ASM_VOLATILE_P (args) && cv_qualifier)
8454     ASM_VOLATILE_P (args) = 1;
8455   return add_stmt (args);
8456 }
8457
8458 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
8459    some INPUTS, and some CLOBBERS.  The latter three may be NULL.
8460    SIMPLE indicates whether there was anything at all after the
8461    string in the asm expression -- asm("blah") and asm("blah" : )
8462    are subtly different.  We use a ASM_EXPR node to represent this.  */
8463 tree
8464 build_asm_expr (location_t loc, tree string, tree outputs, tree inputs,
8465                 tree clobbers, tree labels, bool simple)
8466 {
8467   tree tail;
8468   tree args;
8469   int i;
8470   const char *constraint;
8471   const char **oconstraints;
8472   bool allows_mem, allows_reg, is_inout;
8473   int ninputs, noutputs;
8474
8475   ninputs = list_length (inputs);
8476   noutputs = list_length (outputs);
8477   oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
8478
8479   string = resolve_asm_operand_names (string, outputs, inputs, labels);
8480
8481   /* Remove output conversions that change the type but not the mode.  */
8482   for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
8483     {
8484       tree output = TREE_VALUE (tail);
8485
8486       /* ??? Really, this should not be here.  Users should be using a
8487          proper lvalue, dammit.  But there's a long history of using casts
8488          in the output operands.  In cases like longlong.h, this becomes a
8489          primitive form of typechecking -- if the cast can be removed, then
8490          the output operand had a type of the proper width; otherwise we'll
8491          get an error.  Gross, but ...  */
8492       STRIP_NOPS (output);
8493
8494       if (!lvalue_or_else (loc, output, lv_asm))
8495         output = error_mark_node;
8496
8497       if (output != error_mark_node
8498           && (TREE_READONLY (output)
8499               || TYPE_READONLY (TREE_TYPE (output))
8500               || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
8501                    || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
8502                   && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
8503         readonly_error (output, lv_asm);
8504
8505       constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
8506       oconstraints[i] = constraint;
8507
8508       if (parse_output_constraint (&constraint, i, ninputs, noutputs,
8509                                    &allows_mem, &allows_reg, &is_inout))
8510         {
8511           /* If the operand is going to end up in memory,
8512              mark it addressable.  */
8513           if (!allows_reg && !c_mark_addressable (output))
8514             output = error_mark_node;
8515           if (!(!allows_reg && allows_mem)
8516               && output != error_mark_node
8517               && VOID_TYPE_P (TREE_TYPE (output)))
8518             {
8519               error_at (loc, "invalid use of void expression");
8520               output = error_mark_node;
8521             }
8522         }
8523       else
8524         output = error_mark_node;
8525
8526       TREE_VALUE (tail) = output;
8527     }
8528
8529   for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
8530     {
8531       tree input;
8532
8533       constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
8534       input = TREE_VALUE (tail);
8535
8536       if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
8537                                   oconstraints, &allows_mem, &allows_reg))
8538         {
8539           /* If the operand is going to end up in memory,
8540              mark it addressable.  */
8541           if (!allows_reg && allows_mem)
8542             {
8543               /* Strip the nops as we allow this case.  FIXME, this really
8544                  should be rejected or made deprecated.  */
8545               STRIP_NOPS (input);
8546               if (!c_mark_addressable (input))
8547                 input = error_mark_node;
8548             }
8549           else if (input != error_mark_node && VOID_TYPE_P (TREE_TYPE (input)))
8550             {
8551               error_at (loc, "invalid use of void expression");
8552               input = error_mark_node;
8553             }
8554         }
8555       else
8556         input = error_mark_node;
8557
8558       TREE_VALUE (tail) = input;
8559     }
8560
8561   /* ASMs with labels cannot have outputs.  This should have been
8562      enforced by the parser.  */
8563   gcc_assert (outputs == NULL || labels == NULL);
8564
8565   args = build_stmt (loc, ASM_EXPR, string, outputs, inputs, clobbers, labels);
8566
8567   /* asm statements without outputs, including simple ones, are treated
8568      as volatile.  */
8569   ASM_INPUT_P (args) = simple;
8570   ASM_VOLATILE_P (args) = (noutputs == 0);
8571
8572   return args;
8573 }
8574 \f
8575 /* Generate a goto statement to LABEL.  LOC is the location of the
8576    GOTO.  */
8577
8578 tree
8579 c_finish_goto_label (location_t loc, tree label)
8580 {
8581   tree decl = lookup_label_for_goto (loc, label);
8582   if (!decl)
8583     return NULL_TREE;
8584   TREE_USED (decl) = 1;
8585   {
8586     tree t = build1 (GOTO_EXPR, void_type_node, decl);
8587     SET_EXPR_LOCATION (t, loc);
8588     return add_stmt (t);
8589   }
8590 }
8591
8592 /* Generate a computed goto statement to EXPR.  LOC is the location of
8593    the GOTO.  */
8594
8595 tree
8596 c_finish_goto_ptr (location_t loc, tree expr)
8597 {
8598   tree t;
8599   pedwarn (loc, OPT_pedantic, "ISO C forbids %<goto *expr;%>");
8600   expr = c_fully_fold (expr, false, NULL);
8601   expr = convert (ptr_type_node, expr);
8602   t = build1 (GOTO_EXPR, void_type_node, expr);
8603   SET_EXPR_LOCATION (t, loc);
8604   return add_stmt (t);
8605 }
8606
8607 /* Generate a C `return' statement.  RETVAL is the expression for what
8608    to return, or a null pointer for `return;' with no value.  LOC is
8609    the location of the return statement.  If ORIGTYPE is not NULL_TREE, it
8610    is the original type of RETVAL.  */
8611
8612 tree
8613 c_finish_return (location_t loc, tree retval, tree origtype)
8614 {
8615   tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
8616   bool no_warning = false;
8617   bool npc = false;
8618
8619   if (TREE_THIS_VOLATILE (current_function_decl))
8620     warning_at (loc, 0,
8621                 "function declared %<noreturn%> has a %<return%> statement");
8622
8623   if (retval)
8624     {
8625       tree semantic_type = NULL_TREE;
8626       npc = null_pointer_constant_p (retval);
8627       if (TREE_CODE (retval) == EXCESS_PRECISION_EXPR)
8628         {
8629           semantic_type = TREE_TYPE (retval);
8630           retval = TREE_OPERAND (retval, 0);
8631         }
8632       retval = c_fully_fold (retval, false, NULL);
8633       if (semantic_type)
8634         retval = build1 (EXCESS_PRECISION_EXPR, semantic_type, retval);
8635     }
8636
8637   if (!retval)
8638     {
8639       current_function_returns_null = 1;
8640       if ((warn_return_type || flag_isoc99)
8641           && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
8642         {
8643           pedwarn_c99 (loc, flag_isoc99 ? 0 : OPT_Wreturn_type,
8644                        "%<return%> with no value, in "
8645                        "function returning non-void");
8646           no_warning = true;
8647         }
8648     }
8649   else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
8650     {
8651       current_function_returns_null = 1;
8652       if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
8653         pedwarn (loc, 0,
8654                  "%<return%> with a value, in function returning void");
8655       else
8656         pedwarn (loc, OPT_pedantic, "ISO C forbids "
8657                  "%<return%> with expression, in function returning void");
8658     }
8659   else
8660     {
8661       tree t = convert_for_assignment (loc, valtype, retval, origtype,
8662                                        ic_return,
8663                                        npc, NULL_TREE, NULL_TREE, 0);
8664       tree res = DECL_RESULT (current_function_decl);
8665       tree inner;
8666
8667       current_function_returns_value = 1;
8668       if (t == error_mark_node)
8669         return NULL_TREE;
8670
8671       inner = t = convert (TREE_TYPE (res), t);
8672
8673       /* Strip any conversions, additions, and subtractions, and see if
8674          we are returning the address of a local variable.  Warn if so.  */
8675       while (1)
8676         {
8677           switch (TREE_CODE (inner))
8678             {
8679             CASE_CONVERT:
8680             case NON_LVALUE_EXPR:
8681             case PLUS_EXPR:
8682             case POINTER_PLUS_EXPR:
8683               inner = TREE_OPERAND (inner, 0);
8684               continue;
8685
8686             case MINUS_EXPR:
8687               /* If the second operand of the MINUS_EXPR has a pointer
8688                  type (or is converted from it), this may be valid, so
8689                  don't give a warning.  */
8690               {
8691                 tree op1 = TREE_OPERAND (inner, 1);
8692
8693                 while (!POINTER_TYPE_P (TREE_TYPE (op1))
8694                        && (CONVERT_EXPR_P (op1)
8695                            || TREE_CODE (op1) == NON_LVALUE_EXPR))
8696                   op1 = TREE_OPERAND (op1, 0);
8697
8698                 if (POINTER_TYPE_P (TREE_TYPE (op1)))
8699                   break;
8700
8701                 inner = TREE_OPERAND (inner, 0);
8702                 continue;
8703               }
8704
8705             case ADDR_EXPR:
8706               inner = TREE_OPERAND (inner, 0);
8707
8708               while (REFERENCE_CLASS_P (inner)
8709                      && TREE_CODE (inner) != INDIRECT_REF)
8710                 inner = TREE_OPERAND (inner, 0);
8711
8712               if (DECL_P (inner)
8713                   && !DECL_EXTERNAL (inner)
8714                   && !TREE_STATIC (inner)
8715                   && DECL_CONTEXT (inner) == current_function_decl)
8716                 warning_at (loc,
8717                             0, "function returns address of local variable");
8718               break;
8719
8720             default:
8721               break;
8722             }
8723
8724           break;
8725         }
8726
8727       retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
8728       SET_EXPR_LOCATION (retval, loc);
8729
8730       if (warn_sequence_point)
8731         verify_sequence_points (retval);
8732     }
8733
8734   ret_stmt = build_stmt (loc, RETURN_EXPR, retval);
8735   TREE_NO_WARNING (ret_stmt) |= no_warning;
8736   return add_stmt (ret_stmt);
8737 }
8738 \f
8739 struct c_switch {
8740   /* The SWITCH_EXPR being built.  */
8741   tree switch_expr;
8742
8743   /* The original type of the testing expression, i.e. before the
8744      default conversion is applied.  */
8745   tree orig_type;
8746
8747   /* A splay-tree mapping the low element of a case range to the high
8748      element, or NULL_TREE if there is no high element.  Used to
8749      determine whether or not a new case label duplicates an old case
8750      label.  We need a tree, rather than simply a hash table, because
8751      of the GNU case range extension.  */
8752   splay_tree cases;
8753
8754   /* The bindings at the point of the switch.  This is used for
8755      warnings crossing decls when branching to a case label.  */
8756   struct c_spot_bindings *bindings;
8757
8758   /* The next node on the stack.  */
8759   struct c_switch *next;
8760 };
8761
8762 /* A stack of the currently active switch statements.  The innermost
8763    switch statement is on the top of the stack.  There is no need to
8764    mark the stack for garbage collection because it is only active
8765    during the processing of the body of a function, and we never
8766    collect at that point.  */
8767
8768 struct c_switch *c_switch_stack;
8769
8770 /* Start a C switch statement, testing expression EXP.  Return the new
8771    SWITCH_EXPR.  SWITCH_LOC is the location of the `switch'.
8772    SWITCH_COND_LOC is the location of the switch's condition.  */
8773
8774 tree
8775 c_start_case (location_t switch_loc,
8776               location_t switch_cond_loc,
8777               tree exp)
8778 {
8779   tree orig_type = error_mark_node;
8780   struct c_switch *cs;
8781
8782   if (exp != error_mark_node)
8783     {
8784       orig_type = TREE_TYPE (exp);
8785
8786       if (!INTEGRAL_TYPE_P (orig_type))
8787         {
8788           if (orig_type != error_mark_node)
8789             {
8790               error_at (switch_cond_loc, "switch quantity not an integer");
8791               orig_type = error_mark_node;
8792             }
8793           exp = integer_zero_node;
8794         }
8795       else
8796         {
8797           tree type = TYPE_MAIN_VARIANT (orig_type);
8798
8799           if (!in_system_header
8800               && (type == long_integer_type_node
8801                   || type == long_unsigned_type_node))
8802             warning_at (switch_cond_loc,
8803                         OPT_Wtraditional, "%<long%> switch expression not "
8804                         "converted to %<int%> in ISO C");
8805
8806           exp = c_fully_fold (exp, false, NULL);
8807           exp = default_conversion (exp);
8808
8809           if (warn_sequence_point)
8810             verify_sequence_points (exp);
8811         }
8812     }
8813
8814   /* Add this new SWITCH_EXPR to the stack.  */
8815   cs = XNEW (struct c_switch);
8816   cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
8817   SET_EXPR_LOCATION (cs->switch_expr, switch_loc);
8818   cs->orig_type = orig_type;
8819   cs->cases = splay_tree_new (case_compare, NULL, NULL);
8820   cs->bindings = c_get_switch_bindings ();
8821   cs->next = c_switch_stack;
8822   c_switch_stack = cs;
8823
8824   return add_stmt (cs->switch_expr);
8825 }
8826
8827 /* Process a case label at location LOC.  */
8828
8829 tree
8830 do_case (location_t loc, tree low_value, tree high_value)
8831 {
8832   tree label = NULL_TREE;
8833
8834   if (low_value && TREE_CODE (low_value) != INTEGER_CST)
8835     {
8836       low_value = c_fully_fold (low_value, false, NULL);
8837       if (TREE_CODE (low_value) == INTEGER_CST)
8838         pedwarn (input_location, OPT_pedantic,
8839                  "case label is not an integer constant expression");
8840     }
8841
8842   if (high_value && TREE_CODE (high_value) != INTEGER_CST)
8843     {
8844       high_value = c_fully_fold (high_value, false, NULL);
8845       if (TREE_CODE (high_value) == INTEGER_CST)
8846         pedwarn (input_location, OPT_pedantic,
8847                  "case label is not an integer constant expression");
8848     }
8849
8850   if (c_switch_stack == NULL)
8851     {
8852       if (low_value)
8853         error_at (loc, "case label not within a switch statement");
8854       else
8855         error_at (loc, "%<default%> label not within a switch statement");
8856       return NULL_TREE;
8857     }
8858
8859   if (c_check_switch_jump_warnings (c_switch_stack->bindings,
8860                                     EXPR_LOCATION (c_switch_stack->switch_expr),
8861                                     loc))
8862     return NULL_TREE;
8863
8864   label = c_add_case_label (loc, c_switch_stack->cases,
8865                             SWITCH_COND (c_switch_stack->switch_expr),
8866                             c_switch_stack->orig_type,
8867                             low_value, high_value);
8868   if (label == error_mark_node)
8869     label = NULL_TREE;
8870   return label;
8871 }
8872
8873 /* Finish the switch statement.  */
8874
8875 void
8876 c_finish_case (tree body)
8877 {
8878   struct c_switch *cs = c_switch_stack;
8879   location_t switch_location;
8880
8881   SWITCH_BODY (cs->switch_expr) = body;
8882
8883   /* Emit warnings as needed.  */
8884   switch_location = EXPR_LOCATION (cs->switch_expr);
8885   c_do_switch_warnings (cs->cases, switch_location,
8886                         TREE_TYPE (cs->switch_expr),
8887                         SWITCH_COND (cs->switch_expr));
8888
8889   /* Pop the stack.  */
8890   c_switch_stack = cs->next;
8891   splay_tree_delete (cs->cases);
8892   c_release_switch_bindings (cs->bindings);
8893   XDELETE (cs);
8894 }
8895 \f
8896 /* Emit an if statement.  IF_LOCUS is the location of the 'if'.  COND,
8897    THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
8898    may be null.  NESTED_IF is true if THEN_BLOCK contains another IF
8899    statement, and was not surrounded with parenthesis.  */
8900
8901 void
8902 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
8903                   tree else_block, bool nested_if)
8904 {
8905   tree stmt;
8906
8907   /* Diagnose an ambiguous else if if-then-else is nested inside if-then.  */
8908   if (warn_parentheses && nested_if && else_block == NULL)
8909     {
8910       tree inner_if = then_block;
8911
8912       /* We know from the grammar productions that there is an IF nested
8913          within THEN_BLOCK.  Due to labels and c99 conditional declarations,
8914          it might not be exactly THEN_BLOCK, but should be the last
8915          non-container statement within.  */
8916       while (1)
8917         switch (TREE_CODE (inner_if))
8918           {
8919           case COND_EXPR:
8920             goto found;
8921           case BIND_EXPR:
8922             inner_if = BIND_EXPR_BODY (inner_if);
8923             break;
8924           case STATEMENT_LIST:
8925             inner_if = expr_last (then_block);
8926             break;
8927           case TRY_FINALLY_EXPR:
8928           case TRY_CATCH_EXPR:
8929             inner_if = TREE_OPERAND (inner_if, 0);
8930             break;
8931           default:
8932             gcc_unreachable ();
8933           }
8934     found:
8935
8936       if (COND_EXPR_ELSE (inner_if))
8937          warning_at (if_locus, OPT_Wparentheses,
8938                      "suggest explicit braces to avoid ambiguous %<else%>");
8939     }
8940
8941   stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
8942   SET_EXPR_LOCATION (stmt, if_locus);
8943   add_stmt (stmt);
8944 }
8945
8946 /* Emit a general-purpose loop construct.  START_LOCUS is the location of
8947    the beginning of the loop.  COND is the loop condition.  COND_IS_FIRST
8948    is false for DO loops.  INCR is the FOR increment expression.  BODY is
8949    the statement controlled by the loop.  BLAB is the break label.  CLAB is
8950    the continue label.  Everything is allowed to be NULL.  */
8951
8952 void
8953 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
8954                tree blab, tree clab, bool cond_is_first)
8955 {
8956   tree entry = NULL, exit = NULL, t;
8957
8958   /* If the condition is zero don't generate a loop construct.  */
8959   if (cond && integer_zerop (cond))
8960     {
8961       if (cond_is_first)
8962         {
8963           t = build_and_jump (&blab);
8964           SET_EXPR_LOCATION (t, start_locus);
8965           add_stmt (t);
8966         }
8967     }
8968   else
8969     {
8970       tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
8971
8972       /* If we have an exit condition, then we build an IF with gotos either
8973          out of the loop, or to the top of it.  If there's no exit condition,
8974          then we just build a jump back to the top.  */
8975       exit = build_and_jump (&LABEL_EXPR_LABEL (top));
8976
8977       if (cond && !integer_nonzerop (cond))
8978         {
8979           /* Canonicalize the loop condition to the end.  This means
8980              generating a branch to the loop condition.  Reuse the
8981              continue label, if possible.  */
8982           if (cond_is_first)
8983             {
8984               if (incr || !clab)
8985                 {
8986                   entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
8987                   t = build_and_jump (&LABEL_EXPR_LABEL (entry));
8988                 }
8989               else
8990                 t = build1 (GOTO_EXPR, void_type_node, clab);
8991               SET_EXPR_LOCATION (t, start_locus);
8992               add_stmt (t);
8993             }
8994
8995           t = build_and_jump (&blab);
8996           if (cond_is_first)
8997             exit = fold_build3_loc (start_locus,
8998                                 COND_EXPR, void_type_node, cond, exit, t);
8999           else
9000             exit = fold_build3_loc (input_location,
9001                                 COND_EXPR, void_type_node, cond, exit, t);
9002         }
9003
9004       add_stmt (top);
9005     }
9006
9007   if (body)
9008     add_stmt (body);
9009   if (clab)
9010     add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
9011   if (incr)
9012     add_stmt (incr);
9013   if (entry)
9014     add_stmt (entry);
9015   if (exit)
9016     add_stmt (exit);
9017   if (blab)
9018     add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
9019 }
9020
9021 tree
9022 c_finish_bc_stmt (location_t loc, tree *label_p, bool is_break)
9023 {
9024   bool skip;
9025   tree label = *label_p;
9026
9027   /* In switch statements break is sometimes stylistically used after
9028      a return statement.  This can lead to spurious warnings about
9029      control reaching the end of a non-void function when it is
9030      inlined.  Note that we are calling block_may_fallthru with
9031      language specific tree nodes; this works because
9032      block_may_fallthru returns true when given something it does not
9033      understand.  */
9034   skip = !block_may_fallthru (cur_stmt_list);
9035
9036   if (!label)
9037     {
9038       if (!skip)
9039         *label_p = label = create_artificial_label (loc);
9040     }
9041   else if (TREE_CODE (label) == LABEL_DECL)
9042     ;
9043   else switch (TREE_INT_CST_LOW (label))
9044     {
9045     case 0:
9046       if (is_break)
9047         error_at (loc, "break statement not within loop or switch");
9048       else
9049         error_at (loc, "continue statement not within a loop");
9050       return NULL_TREE;
9051
9052     case 1:
9053       gcc_assert (is_break);
9054       error_at (loc, "break statement used with OpenMP for loop");
9055       return NULL_TREE;
9056
9057     default:
9058       gcc_unreachable ();
9059     }
9060
9061   if (skip)
9062     return NULL_TREE;
9063
9064   if (!is_break)
9065     add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
9066
9067   return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
9068 }
9069
9070 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr.  */
9071
9072 static void
9073 emit_side_effect_warnings (location_t loc, tree expr)
9074 {
9075   if (expr == error_mark_node)
9076     ;
9077   else if (!TREE_SIDE_EFFECTS (expr))
9078     {
9079       if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
9080         warning_at (loc, OPT_Wunused_value, "statement with no effect");
9081     }
9082   else
9083     warn_if_unused_value (expr, loc);
9084 }
9085
9086 /* Process an expression as if it were a complete statement.  Emit
9087    diagnostics, but do not call ADD_STMT.  LOC is the location of the
9088    statement.  */
9089
9090 tree
9091 c_process_expr_stmt (location_t loc, tree expr)
9092 {
9093   tree exprv;
9094
9095   if (!expr)
9096     return NULL_TREE;
9097
9098   expr = c_fully_fold (expr, false, NULL);
9099
9100   if (warn_sequence_point)
9101     verify_sequence_points (expr);
9102
9103   if (TREE_TYPE (expr) != error_mark_node
9104       && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
9105       && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
9106     error_at (loc, "expression statement has incomplete type");
9107
9108   /* If we're not processing a statement expression, warn about unused values.
9109      Warnings for statement expressions will be emitted later, once we figure
9110      out which is the result.  */
9111   if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
9112       && warn_unused_value)
9113     emit_side_effect_warnings (loc, expr);
9114
9115   exprv = expr;
9116   while (TREE_CODE (exprv) == COMPOUND_EXPR)
9117     exprv = TREE_OPERAND (exprv, 1);
9118   if (DECL_P (exprv) || handled_component_p (exprv))
9119     mark_exp_read (exprv);
9120
9121   /* If the expression is not of a type to which we cannot assign a line
9122      number, wrap the thing in a no-op NOP_EXPR.  */
9123   if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
9124     {
9125       expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
9126       SET_EXPR_LOCATION (expr, loc);
9127     }
9128
9129   return expr;
9130 }
9131
9132 /* Emit an expression as a statement.  LOC is the location of the
9133    expression.  */
9134
9135 tree
9136 c_finish_expr_stmt (location_t loc, tree expr)
9137 {
9138   if (expr)
9139     return add_stmt (c_process_expr_stmt (loc, expr));
9140   else
9141     return NULL;
9142 }
9143
9144 /* Do the opposite and emit a statement as an expression.  To begin,
9145    create a new binding level and return it.  */
9146
9147 tree
9148 c_begin_stmt_expr (void)
9149 {
9150   tree ret;
9151
9152   /* We must force a BLOCK for this level so that, if it is not expanded
9153      later, there is a way to turn off the entire subtree of blocks that
9154      are contained in it.  */
9155   keep_next_level ();
9156   ret = c_begin_compound_stmt (true);
9157
9158   c_bindings_start_stmt_expr (c_switch_stack == NULL
9159                               ? NULL
9160                               : c_switch_stack->bindings);
9161
9162   /* Mark the current statement list as belonging to a statement list.  */
9163   STATEMENT_LIST_STMT_EXPR (ret) = 1;
9164
9165   return ret;
9166 }
9167
9168 /* LOC is the location of the compound statement to which this body
9169    belongs.  */
9170
9171 tree
9172 c_finish_stmt_expr (location_t loc, tree body)
9173 {
9174   tree last, type, tmp, val;
9175   tree *last_p;
9176
9177   body = c_end_compound_stmt (loc, body, true);
9178
9179   c_bindings_end_stmt_expr (c_switch_stack == NULL
9180                             ? NULL
9181                             : c_switch_stack->bindings);
9182
9183   /* Locate the last statement in BODY.  See c_end_compound_stmt
9184      about always returning a BIND_EXPR.  */
9185   last_p = &BIND_EXPR_BODY (body);
9186   last = BIND_EXPR_BODY (body);
9187
9188  continue_searching:
9189   if (TREE_CODE (last) == STATEMENT_LIST)
9190     {
9191       tree_stmt_iterator i;
9192
9193       /* This can happen with degenerate cases like ({ }).  No value.  */
9194       if (!TREE_SIDE_EFFECTS (last))
9195         return body;
9196
9197       /* If we're supposed to generate side effects warnings, process
9198          all of the statements except the last.  */
9199       if (warn_unused_value)
9200         {
9201           for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
9202             {
9203               location_t tloc;
9204               tree t = tsi_stmt (i);
9205
9206               tloc = EXPR_HAS_LOCATION (t) ? EXPR_LOCATION (t) : loc;
9207               emit_side_effect_warnings (tloc, t);
9208             }
9209         }
9210       else
9211         i = tsi_last (last);
9212       last_p = tsi_stmt_ptr (i);
9213       last = *last_p;
9214     }
9215
9216   /* If the end of the list is exception related, then the list was split
9217      by a call to push_cleanup.  Continue searching.  */
9218   if (TREE_CODE (last) == TRY_FINALLY_EXPR
9219       || TREE_CODE (last) == TRY_CATCH_EXPR)
9220     {
9221       last_p = &TREE_OPERAND (last, 0);
9222       last = *last_p;
9223       goto continue_searching;
9224     }
9225
9226   if (last == error_mark_node)
9227     return last;
9228
9229   /* In the case that the BIND_EXPR is not necessary, return the
9230      expression out from inside it.  */
9231   if (last == BIND_EXPR_BODY (body)
9232       && BIND_EXPR_VARS (body) == NULL)
9233     {
9234       /* Even if this looks constant, do not allow it in a constant
9235          expression.  */
9236       last = c_wrap_maybe_const (last, true);
9237       /* Do not warn if the return value of a statement expression is
9238          unused.  */
9239       TREE_NO_WARNING (last) = 1;
9240       return last;
9241     }
9242
9243   /* Extract the type of said expression.  */
9244   type = TREE_TYPE (last);
9245
9246   /* If we're not returning a value at all, then the BIND_EXPR that
9247      we already have is a fine expression to return.  */
9248   if (!type || VOID_TYPE_P (type))
9249     return body;
9250
9251   /* Now that we've located the expression containing the value, it seems
9252      silly to make voidify_wrapper_expr repeat the process.  Create a
9253      temporary of the appropriate type and stick it in a TARGET_EXPR.  */
9254   tmp = create_tmp_var_raw (type, NULL);
9255
9256   /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt.  This avoids
9257      tree_expr_nonnegative_p giving up immediately.  */
9258   val = last;
9259   if (TREE_CODE (val) == NOP_EXPR
9260       && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
9261     val = TREE_OPERAND (val, 0);
9262
9263   *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
9264   SET_EXPR_LOCATION (*last_p, EXPR_LOCATION (last));
9265
9266   {
9267     tree t = build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
9268     SET_EXPR_LOCATION (t, loc);
9269     return t;
9270   }
9271 }
9272 \f
9273 /* Begin and end compound statements.  This is as simple as pushing
9274    and popping new statement lists from the tree.  */
9275
9276 tree
9277 c_begin_compound_stmt (bool do_scope)
9278 {
9279   tree stmt = push_stmt_list ();
9280   if (do_scope)
9281     push_scope ();
9282   return stmt;
9283 }
9284
9285 /* End a compound statement.  STMT is the statement.  LOC is the
9286    location of the compound statement-- this is usually the location
9287    of the opening brace.  */
9288
9289 tree
9290 c_end_compound_stmt (location_t loc, tree stmt, bool do_scope)
9291 {
9292   tree block = NULL;
9293
9294   if (do_scope)
9295     {
9296       if (c_dialect_objc ())
9297         objc_clear_super_receiver ();
9298       block = pop_scope ();
9299     }
9300
9301   stmt = pop_stmt_list (stmt);
9302   stmt = c_build_bind_expr (loc, block, stmt);
9303
9304   /* If this compound statement is nested immediately inside a statement
9305      expression, then force a BIND_EXPR to be created.  Otherwise we'll
9306      do the wrong thing for ({ { 1; } }) or ({ 1; { } }).  In particular,
9307      STATEMENT_LISTs merge, and thus we can lose track of what statement
9308      was really last.  */
9309   if (cur_stmt_list
9310       && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
9311       && TREE_CODE (stmt) != BIND_EXPR)
9312     {
9313       stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
9314       TREE_SIDE_EFFECTS (stmt) = 1;
9315       SET_EXPR_LOCATION (stmt, loc);
9316     }
9317
9318   return stmt;
9319 }
9320
9321 /* Queue a cleanup.  CLEANUP is an expression/statement to be executed
9322    when the current scope is exited.  EH_ONLY is true when this is not
9323    meant to apply to normal control flow transfer.  */
9324
9325 void
9326 push_cleanup (tree decl, tree cleanup, bool eh_only)
9327 {
9328   enum tree_code code;
9329   tree stmt, list;
9330   bool stmt_expr;
9331
9332   code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
9333   stmt = build_stmt (DECL_SOURCE_LOCATION (decl), code, NULL, cleanup);
9334   add_stmt (stmt);
9335   stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
9336   list = push_stmt_list ();
9337   TREE_OPERAND (stmt, 0) = list;
9338   STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
9339 }
9340 \f
9341 /* Build a binary-operation expression without default conversions.
9342    CODE is the kind of expression to build.
9343    LOCATION is the operator's location.
9344    This function differs from `build' in several ways:
9345    the data type of the result is computed and recorded in it,
9346    warnings are generated if arg data types are invalid,
9347    special handling for addition and subtraction of pointers is known,
9348    and some optimization is done (operations on narrow ints
9349    are done in the narrower type when that gives the same result).
9350    Constant folding is also done before the result is returned.
9351
9352    Note that the operands will never have enumeral types, or function
9353    or array types, because either they will have the default conversions
9354    performed or they have both just been converted to some other type in which
9355    the arithmetic is to be done.  */
9356
9357 tree
9358 build_binary_op (location_t location, enum tree_code code,
9359                  tree orig_op0, tree orig_op1, int convert_p)
9360 {
9361   tree type0, type1, orig_type0, orig_type1;
9362   tree eptype;
9363   enum tree_code code0, code1;
9364   tree op0, op1;
9365   tree ret = error_mark_node;
9366   const char *invalid_op_diag;
9367   bool op0_int_operands, op1_int_operands;
9368   bool int_const, int_const_or_overflow, int_operands;
9369
9370   /* Expression code to give to the expression when it is built.
9371      Normally this is CODE, which is what the caller asked for,
9372      but in some special cases we change it.  */
9373   enum tree_code resultcode = code;
9374
9375   /* Data type in which the computation is to be performed.
9376      In the simplest cases this is the common type of the arguments.  */
9377   tree result_type = NULL;
9378
9379   /* When the computation is in excess precision, the type of the
9380      final EXCESS_PRECISION_EXPR.  */
9381   tree semantic_result_type = NULL;
9382
9383   /* Nonzero means operands have already been type-converted
9384      in whatever way is necessary.
9385      Zero means they need to be converted to RESULT_TYPE.  */
9386   int converted = 0;
9387
9388   /* Nonzero means create the expression with this type, rather than
9389      RESULT_TYPE.  */
9390   tree build_type = 0;
9391
9392   /* Nonzero means after finally constructing the expression
9393      convert it to this type.  */
9394   tree final_type = 0;
9395
9396   /* Nonzero if this is an operation like MIN or MAX which can
9397      safely be computed in short if both args are promoted shorts.
9398      Also implies COMMON.
9399      -1 indicates a bitwise operation; this makes a difference
9400      in the exact conditions for when it is safe to do the operation
9401      in a narrower mode.  */
9402   int shorten = 0;
9403
9404   /* Nonzero if this is a comparison operation;
9405      if both args are promoted shorts, compare the original shorts.
9406      Also implies COMMON.  */
9407   int short_compare = 0;
9408
9409   /* Nonzero if this is a right-shift operation, which can be computed on the
9410      original short and then promoted if the operand is a promoted short.  */
9411   int short_shift = 0;
9412
9413   /* Nonzero means set RESULT_TYPE to the common type of the args.  */
9414   int common = 0;
9415
9416   /* True means types are compatible as far as ObjC is concerned.  */
9417   bool objc_ok;
9418
9419   /* True means this is an arithmetic operation that may need excess
9420      precision.  */
9421   bool may_need_excess_precision;
9422
9423   /* True means this is a boolean operation that converts both its
9424      operands to truth-values.  */
9425   bool boolean_op = false;
9426
9427   if (location == UNKNOWN_LOCATION)
9428     location = input_location;
9429
9430   op0 = orig_op0;
9431   op1 = orig_op1;
9432
9433   op0_int_operands = EXPR_INT_CONST_OPERANDS (orig_op0);
9434   if (op0_int_operands)
9435     op0 = remove_c_maybe_const_expr (op0);
9436   op1_int_operands = EXPR_INT_CONST_OPERANDS (orig_op1);
9437   if (op1_int_operands)
9438     op1 = remove_c_maybe_const_expr (op1);
9439   int_operands = (op0_int_operands && op1_int_operands);
9440   if (int_operands)
9441     {
9442       int_const_or_overflow = (TREE_CODE (orig_op0) == INTEGER_CST
9443                                && TREE_CODE (orig_op1) == INTEGER_CST);
9444       int_const = (int_const_or_overflow
9445                    && !TREE_OVERFLOW (orig_op0)
9446                    && !TREE_OVERFLOW (orig_op1));
9447     }
9448   else
9449     int_const = int_const_or_overflow = false;
9450
9451   if (convert_p)
9452     {
9453       op0 = default_conversion (op0);
9454       op1 = default_conversion (op1);
9455     }
9456
9457   orig_type0 = type0 = TREE_TYPE (op0);
9458   orig_type1 = type1 = TREE_TYPE (op1);
9459
9460   /* The expression codes of the data types of the arguments tell us
9461      whether the arguments are integers, floating, pointers, etc.  */
9462   code0 = TREE_CODE (type0);
9463   code1 = TREE_CODE (type1);
9464
9465   /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue.  */
9466   STRIP_TYPE_NOPS (op0);
9467   STRIP_TYPE_NOPS (op1);
9468
9469   /* If an error was already reported for one of the arguments,
9470      avoid reporting another error.  */
9471
9472   if (code0 == ERROR_MARK || code1 == ERROR_MARK)
9473     return error_mark_node;
9474
9475   if ((invalid_op_diag
9476        = targetm.invalid_binary_op (code, type0, type1)))
9477     {
9478       error_at (location, invalid_op_diag);
9479       return error_mark_node;
9480     }
9481
9482   switch (code)
9483     {
9484     case PLUS_EXPR:
9485     case MINUS_EXPR:
9486     case MULT_EXPR:
9487     case TRUNC_DIV_EXPR:
9488     case CEIL_DIV_EXPR:
9489     case FLOOR_DIV_EXPR:
9490     case ROUND_DIV_EXPR:
9491     case EXACT_DIV_EXPR:
9492       may_need_excess_precision = true;
9493       break;
9494     default:
9495       may_need_excess_precision = false;
9496       break;
9497     }
9498   if (TREE_CODE (op0) == EXCESS_PRECISION_EXPR)
9499     {
9500       op0 = TREE_OPERAND (op0, 0);
9501       type0 = TREE_TYPE (op0);
9502     }
9503   else if (may_need_excess_precision
9504            && (eptype = excess_precision_type (type0)) != NULL_TREE)
9505     {
9506       type0 = eptype;
9507       op0 = convert (eptype, op0);
9508     }
9509   if (TREE_CODE (op1) == EXCESS_PRECISION_EXPR)
9510     {
9511       op1 = TREE_OPERAND (op1, 0);
9512       type1 = TREE_TYPE (op1);
9513     }
9514   else if (may_need_excess_precision
9515            && (eptype = excess_precision_type (type1)) != NULL_TREE)
9516     {
9517       type1 = eptype;
9518       op1 = convert (eptype, op1);
9519     }
9520
9521   objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
9522
9523   switch (code)
9524     {
9525     case PLUS_EXPR:
9526       /* Handle the pointer + int case.  */
9527       if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9528         {
9529           ret = pointer_int_sum (location, PLUS_EXPR, op0, op1);
9530           goto return_build_binary_op;
9531         }
9532       else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
9533         {
9534           ret = pointer_int_sum (location, PLUS_EXPR, op1, op0);
9535           goto return_build_binary_op;
9536         }
9537       else
9538         common = 1;
9539       break;
9540
9541     case MINUS_EXPR:
9542       /* Subtraction of two similar pointers.
9543          We must subtract them as integers, then divide by object size.  */
9544       if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
9545           && comp_target_types (location, type0, type1))
9546         {
9547           ret = pointer_diff (location, op0, op1);
9548           goto return_build_binary_op;
9549         }
9550       /* Handle pointer minus int.  Just like pointer plus int.  */
9551       else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9552         {
9553           ret = pointer_int_sum (location, MINUS_EXPR, op0, op1);
9554           goto return_build_binary_op;
9555         }
9556       else
9557         common = 1;
9558       break;
9559
9560     case MULT_EXPR:
9561       common = 1;
9562       break;
9563
9564     case TRUNC_DIV_EXPR:
9565     case CEIL_DIV_EXPR:
9566     case FLOOR_DIV_EXPR:
9567     case ROUND_DIV_EXPR:
9568     case EXACT_DIV_EXPR:
9569       warn_for_div_by_zero (location, op1);
9570
9571       if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
9572            || code0 == FIXED_POINT_TYPE
9573            || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
9574           && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
9575               || code1 == FIXED_POINT_TYPE
9576               || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
9577         {
9578           enum tree_code tcode0 = code0, tcode1 = code1;
9579
9580           if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
9581             tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
9582           if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
9583             tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
9584
9585           if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
9586               || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
9587             resultcode = RDIV_EXPR;
9588           else
9589             /* Although it would be tempting to shorten always here, that
9590                loses on some targets, since the modulo instruction is
9591                undefined if the quotient can't be represented in the
9592                computation mode.  We shorten only if unsigned or if
9593                dividing by something we know != -1.  */
9594             shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
9595                        || (TREE_CODE (op1) == INTEGER_CST
9596                            && !integer_all_onesp (op1)));
9597           common = 1;
9598         }
9599       break;
9600
9601     case BIT_AND_EXPR:
9602     case BIT_IOR_EXPR:
9603     case BIT_XOR_EXPR:
9604       if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
9605         shorten = -1;
9606       /* Allow vector types which are not floating point types.   */
9607       else if (code0 == VECTOR_TYPE
9608                && code1 == VECTOR_TYPE
9609                && !VECTOR_FLOAT_TYPE_P (type0)
9610                && !VECTOR_FLOAT_TYPE_P (type1))
9611         common = 1;
9612       break;
9613
9614     case TRUNC_MOD_EXPR:
9615     case FLOOR_MOD_EXPR:
9616       warn_for_div_by_zero (location, op1);
9617
9618       if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9619           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
9620           && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
9621         common = 1;
9622       else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
9623         {
9624           /* Although it would be tempting to shorten always here, that loses
9625              on some targets, since the modulo instruction is undefined if the
9626              quotient can't be represented in the computation mode.  We shorten
9627              only if unsigned or if dividing by something we know != -1.  */
9628           shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
9629                      || (TREE_CODE (op1) == INTEGER_CST
9630                          && !integer_all_onesp (op1)));
9631           common = 1;
9632         }
9633       break;
9634
9635     case TRUTH_ANDIF_EXPR:
9636     case TRUTH_ORIF_EXPR:
9637     case TRUTH_AND_EXPR:
9638     case TRUTH_OR_EXPR:
9639     case TRUTH_XOR_EXPR:
9640       if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
9641            || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
9642            || code0 == FIXED_POINT_TYPE)
9643           && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
9644               || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
9645               || code1 == FIXED_POINT_TYPE))
9646         {
9647           /* Result of these operations is always an int,
9648              but that does not mean the operands should be
9649              converted to ints!  */
9650           result_type = integer_type_node;
9651           op0 = c_common_truthvalue_conversion (location, op0);
9652           op1 = c_common_truthvalue_conversion (location, op1);
9653           converted = 1;
9654           boolean_op = true;
9655         }
9656       if (code == TRUTH_ANDIF_EXPR)
9657         {
9658           int_const_or_overflow = (int_operands
9659                                    && TREE_CODE (orig_op0) == INTEGER_CST
9660                                    && (op0 == truthvalue_false_node
9661                                        || TREE_CODE (orig_op1) == INTEGER_CST));
9662           int_const = (int_const_or_overflow
9663                        && !TREE_OVERFLOW (orig_op0)
9664                        && (op0 == truthvalue_false_node
9665                            || !TREE_OVERFLOW (orig_op1)));
9666         }
9667       else if (code == TRUTH_ORIF_EXPR)
9668         {
9669           int_const_or_overflow = (int_operands
9670                                    && TREE_CODE (orig_op0) == INTEGER_CST
9671                                    && (op0 == truthvalue_true_node
9672                                        || TREE_CODE (orig_op1) == INTEGER_CST));
9673           int_const = (int_const_or_overflow
9674                        && !TREE_OVERFLOW (orig_op0)
9675                        && (op0 == truthvalue_true_node
9676                            || !TREE_OVERFLOW (orig_op1)));
9677         }
9678       break;
9679
9680       /* Shift operations: result has same type as first operand;
9681          always convert second operand to int.
9682          Also set SHORT_SHIFT if shifting rightward.  */
9683
9684     case RSHIFT_EXPR:
9685       if (code0 == VECTOR_TYPE && code1 == INTEGER_TYPE
9686           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE)
9687         {
9688           result_type = type0;
9689           converted = 1;
9690         }
9691       else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9692           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
9693           && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE
9694           && TYPE_VECTOR_SUBPARTS (type0) == TYPE_VECTOR_SUBPARTS (type1))
9695         {
9696           result_type = type0;
9697           converted = 1;
9698         }
9699       else if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
9700           && code1 == INTEGER_TYPE)
9701         {
9702           if (TREE_CODE (op1) == INTEGER_CST)
9703             {
9704               if (tree_int_cst_sgn (op1) < 0)
9705                 {
9706                   int_const = false;
9707                   if (c_inhibit_evaluation_warnings == 0)
9708                     warning (0, "right shift count is negative");
9709                 }
9710               else
9711                 {
9712                   if (!integer_zerop (op1))
9713                     short_shift = 1;
9714
9715                   if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
9716                     {
9717                       int_const = false;
9718                       if (c_inhibit_evaluation_warnings == 0)
9719                         warning (0, "right shift count >= width of type");
9720                     }
9721                 }
9722             }
9723
9724           /* Use the type of the value to be shifted.  */
9725           result_type = type0;
9726           /* Convert the non vector shift-count to an integer, regardless
9727              of size of value being shifted.  */
9728           if (TREE_CODE (TREE_TYPE (op1)) != VECTOR_TYPE
9729               && TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
9730             op1 = convert (integer_type_node, op1);
9731           /* Avoid converting op1 to result_type later.  */
9732           converted = 1;
9733         }
9734       break;
9735
9736     case LSHIFT_EXPR:
9737       if (code0 == VECTOR_TYPE && code1 == INTEGER_TYPE
9738           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE)
9739         {
9740           result_type = type0;
9741           converted = 1;
9742         }
9743       else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9744           && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
9745           && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE
9746           && TYPE_VECTOR_SUBPARTS (type0) == TYPE_VECTOR_SUBPARTS (type1))
9747         {
9748           result_type = type0;
9749           converted = 1;
9750         }
9751       else if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
9752           && code1 == INTEGER_TYPE)
9753         {
9754           if (TREE_CODE (op1) == INTEGER_CST)
9755             {
9756               if (tree_int_cst_sgn (op1) < 0)
9757                 {
9758                   int_const = false;
9759                   if (c_inhibit_evaluation_warnings == 0)
9760                     warning (0, "left shift count is negative");
9761                 }
9762
9763               else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
9764                 {
9765                   int_const = false;
9766                   if (c_inhibit_evaluation_warnings == 0)
9767                     warning (0, "left shift count >= width of type");
9768                 }
9769             }
9770
9771           /* Use the type of the value to be shifted.  */
9772           result_type = type0;
9773           /* Convert the non vector shift-count to an integer, regardless
9774              of size of value being shifted.  */
9775           if (TREE_CODE (TREE_TYPE (op1)) != VECTOR_TYPE
9776               && TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
9777             op1 = convert (integer_type_node, op1);
9778           /* Avoid converting op1 to result_type later.  */
9779           converted = 1;
9780         }
9781       break;
9782
9783     case EQ_EXPR:
9784     case NE_EXPR:
9785       if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
9786         warning_at (location,
9787                     OPT_Wfloat_equal,
9788                     "comparing floating point with == or != is unsafe");
9789       /* Result of comparison is always int,
9790          but don't convert the args to int!  */
9791       build_type = integer_type_node;
9792       if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
9793            || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
9794           && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
9795               || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
9796         short_compare = 1;
9797       else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
9798         {
9799           if (TREE_CODE (op0) == ADDR_EXPR
9800               && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
9801             {
9802               if (code == EQ_EXPR)
9803                 warning_at (location,
9804                             OPT_Waddress,
9805                             "the comparison will always evaluate as %<false%> "
9806                             "for the address of %qD will never be NULL",
9807                             TREE_OPERAND (op0, 0));
9808               else
9809                 warning_at (location,
9810                             OPT_Waddress,
9811                             "the comparison will always evaluate as %<true%> "
9812                             "for the address of %qD will never be NULL",
9813                             TREE_OPERAND (op0, 0));
9814             }
9815           result_type = type0;
9816         }
9817       else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
9818         {
9819           if (TREE_CODE (op1) == ADDR_EXPR
9820               && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
9821             {
9822               if (code == EQ_EXPR)
9823                 warning_at (location,
9824                             OPT_Waddress,
9825                             "the comparison will always evaluate as %<false%> "
9826                             "for the address of %qD will never be NULL",
9827                             TREE_OPERAND (op1, 0));
9828               else
9829                 warning_at (location,
9830                             OPT_Waddress,
9831                             "the comparison will always evaluate as %<true%> "
9832                             "for the address of %qD will never be NULL",
9833                             TREE_OPERAND (op1, 0));
9834             }
9835           result_type = type1;
9836         }
9837       else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
9838         {
9839           tree tt0 = TREE_TYPE (type0);
9840           tree tt1 = TREE_TYPE (type1);
9841           addr_space_t as0 = TYPE_ADDR_SPACE (tt0);
9842           addr_space_t as1 = TYPE_ADDR_SPACE (tt1);
9843           addr_space_t as_common = ADDR_SPACE_GENERIC;
9844
9845           /* Anything compares with void *.  void * compares with anything.
9846              Otherwise, the targets must be compatible
9847              and both must be object or both incomplete.  */
9848           if (comp_target_types (location, type0, type1))
9849             result_type = common_pointer_type (type0, type1);
9850           else if (!addr_space_superset (as0, as1, &as_common))
9851             {
9852               error_at (location, "comparison of pointers to "
9853                         "disjoint address spaces");
9854               return error_mark_node;
9855             }
9856           else if (VOID_TYPE_P (tt0))
9857             {
9858               if (pedantic && TREE_CODE (tt1) == FUNCTION_TYPE)
9859                 pedwarn (location, OPT_pedantic, "ISO C forbids "
9860                          "comparison of %<void *%> with function pointer");
9861             }
9862           else if (VOID_TYPE_P (tt1))
9863             {
9864               if (pedantic && TREE_CODE (tt0) == FUNCTION_TYPE)
9865                 pedwarn (location, OPT_pedantic, "ISO C forbids "
9866                          "comparison of %<void *%> with function pointer");
9867             }
9868           else
9869             /* Avoid warning about the volatile ObjC EH puts on decls.  */
9870             if (!objc_ok)
9871               pedwarn (location, 0,
9872                        "comparison of distinct pointer types lacks a cast");
9873
9874           if (result_type == NULL_TREE)
9875             {
9876               int qual = ENCODE_QUAL_ADDR_SPACE (as_common);
9877               result_type = build_pointer_type
9878                               (build_qualified_type (void_type_node, qual));
9879             }
9880         }
9881       else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9882         {
9883           result_type = type0;
9884           pedwarn (location, 0, "comparison between pointer and integer");
9885         }
9886       else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
9887         {
9888           result_type = type1;
9889           pedwarn (location, 0, "comparison between pointer and integer");
9890         }
9891       break;
9892
9893     case LE_EXPR:
9894     case GE_EXPR:
9895     case LT_EXPR:
9896     case GT_EXPR:
9897       build_type = integer_type_node;
9898       if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
9899            || code0 == FIXED_POINT_TYPE)
9900           && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
9901               || code1 == FIXED_POINT_TYPE))
9902         short_compare = 1;
9903       else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
9904         {
9905           addr_space_t as0 = TYPE_ADDR_SPACE (TREE_TYPE (type0));
9906           addr_space_t as1 = TYPE_ADDR_SPACE (TREE_TYPE (type1));
9907           addr_space_t as_common;
9908
9909           if (comp_target_types (location, type0, type1))
9910             {
9911               result_type = common_pointer_type (type0, type1);
9912               if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
9913                   != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
9914                 pedwarn (location, 0,
9915                          "comparison of complete and incomplete pointers");
9916               else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
9917                 pedwarn (location, OPT_pedantic, "ISO C forbids "
9918                          "ordered comparisons of pointers to functions");
9919               else if (null_pointer_constant_p (orig_op0)
9920                        || null_pointer_constant_p (orig_op1))
9921                 warning_at (location, OPT_Wextra,
9922                             "ordered comparison of pointer with null pointer");
9923
9924             }
9925           else if (!addr_space_superset (as0, as1, &as_common))
9926             {
9927               error_at (location, "comparison of pointers to "
9928                         "disjoint address spaces");
9929               return error_mark_node;
9930             }
9931           else
9932             {
9933               int qual = ENCODE_QUAL_ADDR_SPACE (as_common);
9934               result_type = build_pointer_type
9935                               (build_qualified_type (void_type_node, qual));
9936               pedwarn (location, 0,
9937                        "comparison of distinct pointer types lacks a cast");
9938             }
9939         }
9940       else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
9941         {
9942           result_type = type0;
9943           if (pedantic)
9944             pedwarn (location, OPT_pedantic,
9945                      "ordered comparison of pointer with integer zero");
9946           else if (extra_warnings)
9947             warning_at (location, OPT_Wextra,
9948                         "ordered comparison of pointer with integer zero");
9949         }
9950       else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
9951         {
9952           result_type = type1;
9953           if (pedantic)
9954             pedwarn (location, OPT_pedantic,
9955                      "ordered comparison of pointer with integer zero");
9956           else if (extra_warnings)
9957             warning_at (location, OPT_Wextra,
9958                         "ordered comparison of pointer with integer zero");
9959         }
9960       else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9961         {
9962           result_type = type0;
9963           pedwarn (location, 0, "comparison between pointer and integer");
9964         }
9965       else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
9966         {
9967           result_type = type1;
9968           pedwarn (location, 0, "comparison between pointer and integer");
9969         }
9970       break;
9971
9972     default:
9973       gcc_unreachable ();
9974     }
9975
9976   if (code0 == ERROR_MARK || code1 == ERROR_MARK)
9977     return error_mark_node;
9978
9979   if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9980       && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
9981           || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
9982                                                     TREE_TYPE (type1))))
9983     {
9984       binary_op_error (location, code, type0, type1);
9985       return error_mark_node;
9986     }
9987
9988   if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
9989        || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
9990       &&
9991       (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
9992        || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
9993     {
9994       bool first_complex = (code0 == COMPLEX_TYPE);
9995       bool second_complex = (code1 == COMPLEX_TYPE);
9996       int none_complex = (!first_complex && !second_complex);
9997
9998       if (shorten || common || short_compare)
9999         {
10000           result_type = c_common_type (type0, type1);
10001           do_warn_double_promotion (result_type, type0, type1,
10002                                     "implicit conversion from %qT to %qT "
10003                                     "to match other operand of binary "
10004                                     "expression",
10005                                     location);
10006           if (result_type == error_mark_node)
10007             return error_mark_node;
10008         }
10009
10010       if (first_complex != second_complex
10011           && (code == PLUS_EXPR
10012               || code == MINUS_EXPR
10013               || code == MULT_EXPR
10014               || (code == TRUNC_DIV_EXPR && first_complex))
10015           && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
10016           && flag_signed_zeros)
10017         {
10018           /* An operation on mixed real/complex operands must be
10019              handled specially, but the language-independent code can
10020              more easily optimize the plain complex arithmetic if
10021              -fno-signed-zeros.  */
10022           tree real_type = TREE_TYPE (result_type);
10023           tree real, imag;
10024           if (type0 != orig_type0 || type1 != orig_type1)
10025             {
10026               gcc_assert (may_need_excess_precision && common);
10027               semantic_result_type = c_common_type (orig_type0, orig_type1);
10028             }
10029           if (first_complex)
10030             {
10031               if (TREE_TYPE (op0) != result_type)
10032                 op0 = convert_and_check (result_type, op0);
10033               if (TREE_TYPE (op1) != real_type)
10034                 op1 = convert_and_check (real_type, op1);
10035             }
10036           else
10037             {
10038               if (TREE_TYPE (op0) != real_type)
10039                 op0 = convert_and_check (real_type, op0);
10040               if (TREE_TYPE (op1) != result_type)
10041                 op1 = convert_and_check (result_type, op1);
10042             }
10043           if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
10044             return error_mark_node;
10045           if (first_complex)
10046             {
10047               op0 = c_save_expr (op0);
10048               real = build_unary_op (EXPR_LOCATION (orig_op0), REALPART_EXPR,
10049                                      op0, 1);
10050               imag = build_unary_op (EXPR_LOCATION (orig_op0), IMAGPART_EXPR,
10051                                      op0, 1);
10052               switch (code)
10053                 {
10054                 case MULT_EXPR:
10055                 case TRUNC_DIV_EXPR:
10056                   imag = build2 (resultcode, real_type, imag, op1);
10057                   /* Fall through.  */
10058                 case PLUS_EXPR:
10059                 case MINUS_EXPR:
10060                   real = build2 (resultcode, real_type, real, op1);
10061                   break;
10062                 default:
10063                   gcc_unreachable();
10064                 }
10065             }
10066           else
10067             {
10068               op1 = c_save_expr (op1);
10069               real = build_unary_op (EXPR_LOCATION (orig_op1), REALPART_EXPR,
10070                                      op1, 1);
10071               imag = build_unary_op (EXPR_LOCATION (orig_op1), IMAGPART_EXPR,
10072                                      op1, 1);
10073               switch (code)
10074                 {
10075                 case MULT_EXPR:
10076                   imag = build2 (resultcode, real_type, op0, imag);
10077                   /* Fall through.  */
10078                 case PLUS_EXPR:
10079                   real = build2 (resultcode, real_type, op0, real);
10080                   break;
10081                 case MINUS_EXPR:
10082                   real = build2 (resultcode, real_type, op0, real);
10083                   imag = build1 (NEGATE_EXPR, real_type, imag);
10084                   break;
10085                 default:
10086                   gcc_unreachable();
10087                 }
10088             }
10089           ret = build2 (COMPLEX_EXPR, result_type, real, imag);
10090           goto return_build_binary_op;
10091         }
10092
10093       /* For certain operations (which identify themselves by shorten != 0)
10094          if both args were extended from the same smaller type,
10095          do the arithmetic in that type and then extend.
10096
10097          shorten !=0 and !=1 indicates a bitwise operation.
10098          For them, this optimization is safe only if
10099          both args are zero-extended or both are sign-extended.
10100          Otherwise, we might change the result.
10101          Eg, (short)-1 | (unsigned short)-1 is (int)-1
10102          but calculated in (unsigned short) it would be (unsigned short)-1.  */
10103
10104       if (shorten && none_complex)
10105         {
10106           final_type = result_type;
10107           result_type = shorten_binary_op (result_type, op0, op1,
10108                                            shorten == -1);
10109         }
10110
10111       /* Shifts can be shortened if shifting right.  */
10112
10113       if (short_shift)
10114         {
10115           int unsigned_arg;
10116           tree arg0 = get_narrower (op0, &unsigned_arg);
10117
10118           final_type = result_type;
10119
10120           if (arg0 == op0 && final_type == TREE_TYPE (op0))
10121             unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
10122
10123           if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
10124               && tree_int_cst_sgn (op1) > 0
10125               /* We can shorten only if the shift count is less than the
10126                  number of bits in the smaller type size.  */
10127               && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
10128               /* We cannot drop an unsigned shift after sign-extension.  */
10129               && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
10130             {
10131               /* Do an unsigned shift if the operand was zero-extended.  */
10132               result_type
10133                 = c_common_signed_or_unsigned_type (unsigned_arg,
10134                                                     TREE_TYPE (arg0));
10135               /* Convert value-to-be-shifted to that type.  */
10136               if (TREE_TYPE (op0) != result_type)
10137                 op0 = convert (result_type, op0);
10138               converted = 1;
10139             }
10140         }
10141
10142       /* Comparison operations are shortened too but differently.
10143          They identify themselves by setting short_compare = 1.  */
10144
10145       if (short_compare)
10146         {
10147           /* Don't write &op0, etc., because that would prevent op0
10148              from being kept in a register.
10149              Instead, make copies of the our local variables and
10150              pass the copies by reference, then copy them back afterward.  */
10151           tree xop0 = op0, xop1 = op1, xresult_type = result_type;
10152           enum tree_code xresultcode = resultcode;
10153           tree val
10154             = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
10155
10156           if (val != 0)
10157             {
10158               ret = val;
10159               goto return_build_binary_op;
10160             }
10161
10162           op0 = xop0, op1 = xop1;
10163           converted = 1;
10164           resultcode = xresultcode;
10165
10166           if (c_inhibit_evaluation_warnings == 0)
10167             {
10168               bool op0_maybe_const = true;
10169               bool op1_maybe_const = true;
10170               tree orig_op0_folded, orig_op1_folded;
10171
10172               if (in_late_binary_op)
10173                 {
10174                   orig_op0_folded = orig_op0;
10175                   orig_op1_folded = orig_op1;
10176                 }
10177               else
10178                 {
10179                   /* Fold for the sake of possible warnings, as in
10180                      build_conditional_expr.  This requires the
10181                      "original" values to be folded, not just op0 and
10182                      op1.  */
10183                   c_inhibit_evaluation_warnings++;
10184                   op0 = c_fully_fold (op0, require_constant_value,
10185                                       &op0_maybe_const);
10186                   op1 = c_fully_fold (op1, require_constant_value,
10187                                       &op1_maybe_const);
10188                   c_inhibit_evaluation_warnings--;
10189                   orig_op0_folded = c_fully_fold (orig_op0,
10190                                                   require_constant_value,
10191                                                   NULL);
10192                   orig_op1_folded = c_fully_fold (orig_op1,
10193                                                   require_constant_value,
10194                                                   NULL);
10195                 }
10196
10197               if (warn_sign_compare)
10198                 warn_for_sign_compare (location, orig_op0_folded,
10199                                        orig_op1_folded, op0, op1,
10200                                        result_type, resultcode);
10201               if (!in_late_binary_op)
10202                 {
10203                   if (!op0_maybe_const || TREE_CODE (op0) != INTEGER_CST)
10204                     op0 = c_wrap_maybe_const (op0, !op0_maybe_const);
10205                   if (!op1_maybe_const || TREE_CODE (op1) != INTEGER_CST)
10206                     op1 = c_wrap_maybe_const (op1, !op1_maybe_const);
10207                 }
10208             }
10209         }
10210     }
10211
10212   /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
10213      If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
10214      Then the expression will be built.
10215      It will be given type FINAL_TYPE if that is nonzero;
10216      otherwise, it will be given type RESULT_TYPE.  */
10217
10218   if (!result_type)
10219     {
10220       binary_op_error (location, code, TREE_TYPE (op0), TREE_TYPE (op1));
10221       return error_mark_node;
10222     }
10223
10224   if (build_type == NULL_TREE)
10225     {
10226       build_type = result_type;
10227       if ((type0 != orig_type0 || type1 != orig_type1)
10228           && !boolean_op)
10229         {
10230           gcc_assert (may_need_excess_precision && common);
10231           semantic_result_type = c_common_type (orig_type0, orig_type1);
10232         }
10233     }
10234
10235   if (!converted)
10236     {
10237       op0 = ep_convert_and_check (result_type, op0, semantic_result_type);
10238       op1 = ep_convert_and_check (result_type, op1, semantic_result_type);
10239
10240       /* This can happen if one operand has a vector type, and the other
10241          has a different type.  */
10242       if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
10243         return error_mark_node;
10244     }
10245
10246   /* Treat expressions in initializers specially as they can't trap.  */
10247   if (int_const_or_overflow)
10248     ret = (require_constant_value
10249            ? fold_build2_initializer_loc (location, resultcode, build_type,
10250                                           op0, op1)
10251            : fold_build2_loc (location, resultcode, build_type, op0, op1));
10252   else
10253     ret = build2 (resultcode, build_type, op0, op1);
10254   if (final_type != 0)
10255     ret = convert (final_type, ret);
10256
10257  return_build_binary_op:
10258   gcc_assert (ret != error_mark_node);
10259   if (TREE_CODE (ret) == INTEGER_CST && !TREE_OVERFLOW (ret) && !int_const)
10260     ret = (int_operands
10261            ? note_integer_operands (ret)
10262            : build1 (NOP_EXPR, TREE_TYPE (ret), ret));
10263   else if (TREE_CODE (ret) != INTEGER_CST && int_operands
10264            && !in_late_binary_op)
10265     ret = note_integer_operands (ret);
10266   if (semantic_result_type)
10267     ret = build1 (EXCESS_PRECISION_EXPR, semantic_result_type, ret);
10268   protected_set_expr_location (ret, location);
10269   return ret;
10270 }
10271
10272
10273 /* Convert EXPR to be a truth-value, validating its type for this
10274    purpose.  LOCATION is the source location for the expression.  */
10275
10276 tree
10277 c_objc_common_truthvalue_conversion (location_t location, tree expr)
10278 {
10279   bool int_const, int_operands;
10280
10281   switch (TREE_CODE (TREE_TYPE (expr)))
10282     {
10283     case ARRAY_TYPE:
10284       error_at (location, "used array that cannot be converted to pointer where scalar is required");
10285       return error_mark_node;
10286
10287     case RECORD_TYPE:
10288       error_at (location, "used struct type value where scalar is required");
10289       return error_mark_node;
10290
10291     case UNION_TYPE:
10292       error_at (location, "used union type value where scalar is required");
10293       return error_mark_node;
10294
10295     case VOID_TYPE:
10296       error_at (location, "void value not ignored as it ought to be");
10297       return error_mark_node;
10298
10299     case FUNCTION_TYPE:
10300       gcc_unreachable ();
10301
10302     default:
10303       break;
10304     }
10305
10306   int_const = (TREE_CODE (expr) == INTEGER_CST && !TREE_OVERFLOW (expr));
10307   int_operands = EXPR_INT_CONST_OPERANDS (expr);
10308   if (int_operands)
10309     expr = remove_c_maybe_const_expr (expr);
10310
10311   /* ??? Should we also give an error for vectors rather than leaving
10312      those to give errors later?  */
10313   expr = c_common_truthvalue_conversion (location, expr);
10314
10315   if (TREE_CODE (expr) == INTEGER_CST && int_operands && !int_const)
10316     {
10317       if (TREE_OVERFLOW (expr))
10318         return expr;
10319       else
10320         return note_integer_operands (expr);
10321     }
10322   if (TREE_CODE (expr) == INTEGER_CST && !int_const)
10323     return build1 (NOP_EXPR, TREE_TYPE (expr), expr);
10324   return expr;
10325 }
10326 \f
10327
10328 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
10329    required.  */
10330
10331 tree
10332 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
10333 {
10334   if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
10335     {
10336       tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
10337       /* Executing a compound literal inside a function reinitializes
10338          it.  */
10339       if (!TREE_STATIC (decl))
10340         *se = true;
10341       return decl;
10342     }
10343   else
10344     return expr;
10345 }
10346 \f
10347 /* Like c_begin_compound_stmt, except force the retention of the BLOCK.  */
10348
10349 tree
10350 c_begin_omp_parallel (void)
10351 {
10352   tree block;
10353
10354   keep_next_level ();
10355   block = c_begin_compound_stmt (true);
10356
10357   return block;
10358 }
10359
10360 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
10361    statement.  LOC is the location of the OMP_PARALLEL.  */
10362
10363 tree
10364 c_finish_omp_parallel (location_t loc, tree clauses, tree block)
10365 {
10366   tree stmt;
10367
10368   block = c_end_compound_stmt (loc, block, true);
10369
10370   stmt = make_node (OMP_PARALLEL);
10371   TREE_TYPE (stmt) = void_type_node;
10372   OMP_PARALLEL_CLAUSES (stmt) = clauses;
10373   OMP_PARALLEL_BODY (stmt) = block;
10374   SET_EXPR_LOCATION (stmt, loc);
10375
10376   return add_stmt (stmt);
10377 }
10378
10379 /* Like c_begin_compound_stmt, except force the retention of the BLOCK.  */
10380
10381 tree
10382 c_begin_omp_task (void)
10383 {
10384   tree block;
10385
10386   keep_next_level ();
10387   block = c_begin_compound_stmt (true);
10388
10389   return block;
10390 }
10391
10392 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
10393    statement.  LOC is the location of the #pragma.  */
10394
10395 tree
10396 c_finish_omp_task (location_t loc, tree clauses, tree block)
10397 {
10398   tree stmt;
10399
10400   block = c_end_compound_stmt (loc, block, true);
10401
10402   stmt = make_node (OMP_TASK);
10403   TREE_TYPE (stmt) = void_type_node;
10404   OMP_TASK_CLAUSES (stmt) = clauses;
10405   OMP_TASK_BODY (stmt) = block;
10406   SET_EXPR_LOCATION (stmt, loc);
10407
10408   return add_stmt (stmt);
10409 }
10410
10411 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
10412    Remove any elements from the list that are invalid.  */
10413
10414 tree
10415 c_finish_omp_clauses (tree clauses)
10416 {
10417   bitmap_head generic_head, firstprivate_head, lastprivate_head;
10418   tree c, t, *pc = &clauses;
10419   const char *name;
10420
10421   bitmap_obstack_initialize (NULL);
10422   bitmap_initialize (&generic_head, &bitmap_default_obstack);
10423   bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
10424   bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
10425
10426   for (pc = &clauses, c = clauses; c ; c = *pc)
10427     {
10428       bool remove = false;
10429       bool need_complete = false;
10430       bool need_implicitly_determined = false;
10431
10432       switch (OMP_CLAUSE_CODE (c))
10433         {
10434         case OMP_CLAUSE_SHARED:
10435           name = "shared";
10436           need_implicitly_determined = true;
10437           goto check_dup_generic;
10438
10439         case OMP_CLAUSE_PRIVATE:
10440           name = "private";
10441           need_complete = true;
10442           need_implicitly_determined = true;
10443           goto check_dup_generic;
10444
10445         case OMP_CLAUSE_REDUCTION:
10446           name = "reduction";
10447           need_implicitly_determined = true;
10448           t = OMP_CLAUSE_DECL (c);
10449           if (AGGREGATE_TYPE_P (TREE_TYPE (t))
10450               || POINTER_TYPE_P (TREE_TYPE (t)))
10451             {
10452               error_at (OMP_CLAUSE_LOCATION (c),
10453                         "%qE has invalid type for %<reduction%>", t);
10454               remove = true;
10455             }
10456           else if (FLOAT_TYPE_P (TREE_TYPE (t)))
10457             {
10458               enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
10459               const char *r_name = NULL;
10460
10461               switch (r_code)
10462                 {
10463                 case PLUS_EXPR:
10464                 case MULT_EXPR:
10465                 case MINUS_EXPR:
10466                   break;
10467                 case BIT_AND_EXPR:
10468                   r_name = "&";
10469                   break;
10470                 case BIT_XOR_EXPR:
10471                   r_name = "^";
10472                   break;
10473                 case BIT_IOR_EXPR:
10474                   r_name = "|";
10475                   break;
10476                 case TRUTH_ANDIF_EXPR:
10477                   r_name = "&&";
10478                   break;
10479                 case TRUTH_ORIF_EXPR:
10480                   r_name = "||";
10481                   break;
10482                 default:
10483                   gcc_unreachable ();
10484                 }
10485               if (r_name)
10486                 {
10487                   error_at (OMP_CLAUSE_LOCATION (c),
10488                             "%qE has invalid type for %<reduction(%s)%>",
10489                             t, r_name);
10490                   remove = true;
10491                 }
10492             }
10493           goto check_dup_generic;
10494
10495         case OMP_CLAUSE_COPYPRIVATE:
10496           name = "copyprivate";
10497           goto check_dup_generic;
10498
10499         case OMP_CLAUSE_COPYIN:
10500           name = "copyin";
10501           t = OMP_CLAUSE_DECL (c);
10502           if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
10503             {
10504               error_at (OMP_CLAUSE_LOCATION (c),
10505                         "%qE must be %<threadprivate%> for %<copyin%>", t);
10506               remove = true;
10507             }
10508           goto check_dup_generic;
10509
10510         check_dup_generic:
10511           t = OMP_CLAUSE_DECL (c);
10512           if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
10513             {
10514               error_at (OMP_CLAUSE_LOCATION (c),
10515                         "%qE is not a variable in clause %qs", t, name);
10516               remove = true;
10517             }
10518           else if (bitmap_bit_p (&generic_head, DECL_UID (t))
10519                    || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
10520                    || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
10521             {
10522               error_at (OMP_CLAUSE_LOCATION (c),
10523                         "%qE appears more than once in data clauses", t);
10524               remove = true;
10525             }
10526           else
10527             bitmap_set_bit (&generic_head, DECL_UID (t));
10528           break;
10529
10530         case OMP_CLAUSE_FIRSTPRIVATE:
10531           name = "firstprivate";
10532           t = OMP_CLAUSE_DECL (c);
10533           need_complete = true;
10534           need_implicitly_determined = true;
10535           if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
10536             {
10537               error_at (OMP_CLAUSE_LOCATION (c),
10538                         "%qE is not a variable in clause %<firstprivate%>", t);
10539               remove = true;
10540             }
10541           else if (bitmap_bit_p (&generic_head, DECL_UID (t))
10542                    || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
10543             {
10544               error_at (OMP_CLAUSE_LOCATION (c),
10545                         "%qE appears more than once in data clauses", t);
10546               remove = true;
10547             }
10548           else
10549             bitmap_set_bit (&firstprivate_head, DECL_UID (t));
10550           break;
10551
10552         case OMP_CLAUSE_LASTPRIVATE:
10553           name = "lastprivate";
10554           t = OMP_CLAUSE_DECL (c);
10555           need_complete = true;
10556           need_implicitly_determined = true;
10557           if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
10558             {
10559               error_at (OMP_CLAUSE_LOCATION (c),
10560                         "%qE is not a variable in clause %<lastprivate%>", t);
10561               remove = true;
10562             }
10563           else if (bitmap_bit_p (&generic_head, DECL_UID (t))
10564                    || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
10565             {
10566               error_at (OMP_CLAUSE_LOCATION (c),
10567                      "%qE appears more than once in data clauses", t);
10568               remove = true;
10569             }
10570           else
10571             bitmap_set_bit (&lastprivate_head, DECL_UID (t));
10572           break;
10573
10574         case OMP_CLAUSE_IF:
10575         case OMP_CLAUSE_NUM_THREADS:
10576         case OMP_CLAUSE_SCHEDULE:
10577         case OMP_CLAUSE_NOWAIT:
10578         case OMP_CLAUSE_ORDERED:
10579         case OMP_CLAUSE_DEFAULT:
10580         case OMP_CLAUSE_UNTIED:
10581         case OMP_CLAUSE_COLLAPSE:
10582           pc = &OMP_CLAUSE_CHAIN (c);
10583           continue;
10584
10585         default:
10586           gcc_unreachable ();
10587         }
10588
10589       if (!remove)
10590         {
10591           t = OMP_CLAUSE_DECL (c);
10592
10593           if (need_complete)
10594             {
10595               t = require_complete_type (t);
10596               if (t == error_mark_node)
10597                 remove = true;
10598             }
10599
10600           if (need_implicitly_determined)
10601             {
10602               const char *share_name = NULL;
10603
10604               if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
10605                 share_name = "threadprivate";
10606               else switch (c_omp_predetermined_sharing (t))
10607                 {
10608                 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
10609                   break;
10610                 case OMP_CLAUSE_DEFAULT_SHARED:
10611                   share_name = "shared";
10612                   break;
10613                 case OMP_CLAUSE_DEFAULT_PRIVATE:
10614                   share_name = "private";
10615                   break;
10616                 default:
10617                   gcc_unreachable ();
10618                 }
10619               if (share_name)
10620                 {
10621                   error_at (OMP_CLAUSE_LOCATION (c),
10622                             "%qE is predetermined %qs for %qs",
10623                             t, share_name, name);
10624                   remove = true;
10625                 }
10626             }
10627         }
10628
10629       if (remove)
10630         *pc = OMP_CLAUSE_CHAIN (c);
10631       else
10632         pc = &OMP_CLAUSE_CHAIN (c);
10633     }
10634
10635   bitmap_obstack_release (NULL);
10636   return clauses;
10637 }
10638
10639 /* Make a variant type in the proper way for C/C++, propagating qualifiers
10640    down to the element type of an array.  */
10641
10642 tree
10643 c_build_qualified_type (tree type, int type_quals)
10644 {
10645   if (type == error_mark_node)
10646     return type;
10647
10648   if (TREE_CODE (type) == ARRAY_TYPE)
10649     {
10650       tree t;
10651       tree element_type = c_build_qualified_type (TREE_TYPE (type),
10652                                                   type_quals);
10653
10654       /* See if we already have an identically qualified type.  */
10655       for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
10656         {
10657           if (TYPE_QUALS (strip_array_types (t)) == type_quals
10658               && TYPE_NAME (t) == TYPE_NAME (type)
10659               && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
10660               && attribute_list_equal (TYPE_ATTRIBUTES (t),
10661                                        TYPE_ATTRIBUTES (type)))
10662             break;
10663         }
10664       if (!t)
10665         {
10666           tree domain = TYPE_DOMAIN (type);
10667
10668           t = build_variant_type_copy (type);
10669           TREE_TYPE (t) = element_type;
10670
10671           if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
10672               || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
10673             SET_TYPE_STRUCTURAL_EQUALITY (t);
10674           else if (TYPE_CANONICAL (element_type) != element_type
10675                    || (domain && TYPE_CANONICAL (domain) != domain))
10676             {
10677               tree unqualified_canon
10678                 = build_array_type (TYPE_CANONICAL (element_type),
10679                                     domain? TYPE_CANONICAL (domain)
10680                                           : NULL_TREE);
10681               TYPE_CANONICAL (t)
10682                 = c_build_qualified_type (unqualified_canon, type_quals);
10683             }
10684           else
10685             TYPE_CANONICAL (t) = t;
10686         }
10687       return t;
10688     }
10689
10690   /* A restrict-qualified pointer type must be a pointer to object or
10691      incomplete type.  Note that the use of POINTER_TYPE_P also allows
10692      REFERENCE_TYPEs, which is appropriate for C++.  */
10693   if ((type_quals & TYPE_QUAL_RESTRICT)
10694       && (!POINTER_TYPE_P (type)
10695           || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
10696     {
10697       error ("invalid use of %<restrict%>");
10698       type_quals &= ~TYPE_QUAL_RESTRICT;
10699     }
10700
10701   return build_qualified_type (type, type_quals);
10702 }
10703
10704 /* Build a VA_ARG_EXPR for the C parser.  */
10705
10706 tree
10707 c_build_va_arg (location_t loc, tree expr, tree type)
10708 {
10709   if (warn_cxx_compat && TREE_CODE (type) == ENUMERAL_TYPE)
10710     warning_at (loc, OPT_Wc___compat,
10711                 "C++ requires promoted type, not enum type, in %<va_arg%>");
10712   return build_va_arg (loc, expr, type);
10713 }