gcc/builtins.c

   1 /* Expand builtin functions.
   2    Copyright (C) 1988-2017 Free Software Foundation, Inc.
   3
   4 This file is part of GCC.
   5
   6 GCC is free software; you can redistribute it and/or modify it under
   7 the terms of the GNU General Public License as published by the Free
   8 Software Foundation; either version 3, or (at your option) any later
   9 version.
  10
  11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14 for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with GCC; see the file COPYING3.  If not see
  18 <http://www.gnu.org/licenses/>.  */
  19
  20 /* Legacy warning!  Please add no further builtin simplifications here
  21    (apart from pure constant folding) - builtin simplifications should go
  22    to match.pd or gimple-fold.c instead.  */
  23
  24 #include "config.h"
  25 #include "system.h"
  26 #include "coretypes.h"
  27 #include "backend.h"
  28 #include "target.h"
  29 #include "rtl.h"
  30 #include "tree.h"
  31 #include "memmodel.h"
  32 #include "gimple.h"
  33 #include "predict.h"
  34 #include "tm_p.h"
  35 #include "stringpool.h"
  36 #include "tree-vrp.h"
  37 #include "tree-ssanames.h"
  38 #include "expmed.h"
  39 #include "optabs.h"
  40 #include "emit-rtl.h"
  41 #include "recog.h"
  42 #include "diagnostic-core.h"
  43 #include "alias.h"
  44 #include "fold-const.h"
  45 #include "fold-const-call.h"
  46 #include "gimple-ssa-warn-restrict.h"
  47 #include "stor-layout.h"
  48 #include "calls.h"
  49 #include "varasm.h"
  50 #include "tree-object-size.h"
  51 #include "realmpfr.h"
  52 #include "cfgrtl.h"
  53 #include "except.h"
  54 #include "dojump.h"
  55 #include "explow.h"
  56 #include "stmt.h"
  57 #include "expr.h"
  58 #include "libfuncs.h"
  59 #include "output.h"
  60 #include "typeclass.h"
  61 #include "langhooks.h"
  62 #include "value-prof.h"
  63 #include "builtins.h"
  64 #include "stringpool.h"
  65 #include "attribs.h"
  66 #include "asan.h"
  67 #include "tree-chkp.h"
  68 #include "rtl-chkp.h"
  69 #include "internal-fn.h"
  70 #include "case-cfn-macros.h"
  71 #include "gimple-fold.h"
  72 #include "intl.h"
  73
  74 struct target_builtins default_target_builtins;
  75 #if SWITCHABLE_TARGET
  76 struct target_builtins *this_target_builtins = &default_target_builtins;
  77 #endif
  78
  79 /* Define the names of the builtin function types and codes.  */
  80 const char *const built_in_class_names[BUILT_IN_LAST]
  81   = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
  82
  83 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
  84 const char * built_in_names[(int) END_BUILTINS] =
  85 {
  86 #include "builtins.def"
  87 };
  88
  89 /* Setup an array of builtin_info_type, make sure each element decl is
  90    initialized to NULL_TREE.  */
  91 builtin_info_type builtin_info[(int)END_BUILTINS];
  92
  93 /* Non-zero if __builtin_constant_p should be folded right away.  */
  94 bool force_folding_builtin_constant_p;
  95
  96 static rtx c_readstr (const char *, scalar_int_mode);
  97 static int target_char_cast (tree, char *);
  98 static rtx get_memory_rtx (tree, tree);
  99 static int apply_args_size (void);
 100 static int apply_result_size (void);
 101 static rtx result_vector (int, rtx);
 102 static void expand_builtin_prefetch (tree);
 103 static rtx expand_builtin_apply_args (void);
 104 static rtx expand_builtin_apply_args_1 (void);
 105 static rtx expand_builtin_apply (rtx, rtx, rtx);
 106 static void expand_builtin_return (rtx);
 107 static enum type_class type_to_class (tree);
 108 static rtx expand_builtin_classify_type (tree);
 109 static rtx expand_builtin_mathfn_3 (tree, rtx, rtx);
 110 static rtx expand_builtin_mathfn_ternary (tree, rtx, rtx);
 111 static rtx expand_builtin_interclass_mathfn (tree, rtx);
 112 static rtx expand_builtin_sincos (tree);
 113 static rtx expand_builtin_cexpi (tree, rtx);
 114 static rtx expand_builtin_int_roundingfn (tree, rtx);
 115 static rtx expand_builtin_int_roundingfn_2 (tree, rtx);
 116 static rtx expand_builtin_next_arg (void);
 117 static rtx expand_builtin_va_start (tree);
 118 static rtx expand_builtin_va_end (tree);
 119 static rtx expand_builtin_va_copy (tree);
 120 static rtx expand_builtin_strcmp (tree, rtx);
 121 static rtx expand_builtin_strncmp (tree, rtx, machine_mode);
 122 static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, scalar_int_mode);
 123 static rtx expand_builtin_memchr (tree, rtx);
 124 static rtx expand_builtin_memcpy (tree, rtx);
 125 static rtx expand_builtin_memcpy_with_bounds (tree, rtx);
 126 static rtx expand_builtin_memory_copy_args (tree dest, tree src, tree len,
 127                                             rtx target, tree exp, int endp);
 128 static rtx expand_builtin_memmove (tree, rtx);
 129 static rtx expand_builtin_mempcpy (tree, rtx);
 130 static rtx expand_builtin_mempcpy_with_bounds (tree, rtx);
 131 static rtx expand_builtin_mempcpy_args (tree, tree, tree, rtx, tree, int);
 132 static rtx expand_builtin_strcat (tree, rtx);
 133 static rtx expand_builtin_strcpy (tree, rtx);
 134 static rtx expand_builtin_strcpy_args (tree, tree, rtx);
 135 static rtx expand_builtin_stpcpy (tree, rtx, machine_mode);
 136 static rtx expand_builtin_stpncpy (tree, rtx);
 137 static rtx expand_builtin_strncat (tree, rtx);
 138 static rtx expand_builtin_strncpy (tree, rtx);
 139 static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, scalar_int_mode);
 140 static rtx expand_builtin_memset (tree, rtx, machine_mode);
 141 static rtx expand_builtin_memset_with_bounds (tree, rtx, machine_mode);
 142 static rtx expand_builtin_memset_args (tree, tree, tree, rtx, machine_mode, tree);
 143 static rtx expand_builtin_bzero (tree);
 144 static rtx expand_builtin_strlen (tree, rtx, machine_mode);
 145 static rtx expand_builtin_alloca (tree);
 146 static rtx expand_builtin_unop (machine_mode, tree, rtx, rtx, optab);
 147 static rtx expand_builtin_frame_address (tree, tree);
 148 static tree stabilize_va_list_loc (location_t, tree, int);
 149 static rtx expand_builtin_expect (tree, rtx);
 150 static tree fold_builtin_constant_p (tree);
 151 static tree fold_builtin_classify_type (tree);
 152 static tree fold_builtin_strlen (location_t, tree, tree);
 153 static tree fold_builtin_inf (location_t, tree, int);
 154 static tree rewrite_call_expr (location_t, tree, int, tree, int, ...);
 155 static bool validate_arg (const_tree, enum tree_code code);
 156 static rtx expand_builtin_fabs (tree, rtx, rtx);
 157 static rtx expand_builtin_signbit (tree, rtx);
 158 static tree fold_builtin_memcmp (location_t, tree, tree, tree);
 159 static tree fold_builtin_isascii (location_t, tree);
 160 static tree fold_builtin_toascii (location_t, tree);
 161 static tree fold_builtin_isdigit (location_t, tree);
 162 static tree fold_builtin_fabs (location_t, tree, tree);
 163 static tree fold_builtin_abs (location_t, tree, tree);
 164 static tree fold_builtin_unordered_cmp (location_t, tree, tree, tree, enum tree_code,
 165                                         enum tree_code);
 166 static tree fold_builtin_0 (location_t, tree);
 167 static tree fold_builtin_1 (location_t, tree, tree);
 168 static tree fold_builtin_2 (location_t, tree, tree, tree);
 169 static tree fold_builtin_3 (location_t, tree, tree, tree, tree);
 170 static tree fold_builtin_varargs (location_t, tree, tree*, int);
 171
 172 static tree fold_builtin_strpbrk (location_t, tree, tree, tree);
 173 static tree fold_builtin_strspn (location_t, tree, tree);
 174 static tree fold_builtin_strcspn (location_t, tree, tree);
 175
 176 static rtx expand_builtin_object_size (tree);
 177 static rtx expand_builtin_memory_chk (tree, rtx, machine_mode,
 178                                       enum built_in_function);
 179 static void maybe_emit_chk_warning (tree, enum built_in_function);
 180 static void maybe_emit_sprintf_chk_warning (tree, enum built_in_function);
 181 static void maybe_emit_free_warning (tree);
 182 static tree fold_builtin_object_size (tree, tree);
 183
 184 unsigned HOST_WIDE_INT target_newline;
 185 unsigned HOST_WIDE_INT target_percent;
 186 static unsigned HOST_WIDE_INT target_c;
 187 static unsigned HOST_WIDE_INT target_s;
 188 char target_percent_c[3];
 189 char target_percent_s[3];
 190 char target_percent_s_newline[4];
 191 static tree do_mpfr_remquo (tree, tree, tree);
 192 static tree do_mpfr_lgamma_r (tree, tree, tree);
 193 static void expand_builtin_sync_synchronize (void);
 194
 195 /* Return true if NAME starts with __builtin_ or __sync_.  */
 196
 197 static bool
 198 is_builtin_name (const char *name)
 199 {
 200   if (strncmp (name, "__builtin_", 10) == 0)
 201     return true;
 202   if (strncmp (name, "__sync_", 7) == 0)
 203     return true;
 204   if (strncmp (name, "__atomic_", 9) == 0)
 205     return true;
 206   return false;
 207 }
 208
 209
 210 /* Return true if DECL is a function symbol representing a built-in.  */
 211
 212 bool
 213 is_builtin_fn (tree decl)
 214 {
 215   return TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl);
 216 }
 217
 218 /* Return true if NODE should be considered for inline expansion regardless
 219    of the optimization level.  This means whenever a function is invoked with
 220    its "internal" name, which normally contains the prefix "__builtin".  */
 221
 222 bool
 223 called_as_built_in (tree node)
 224 {
 225   /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
 226      we want the name used to call the function, not the name it
 227      will have. */
 228   const char *name = IDENTIFIER_POINTER (DECL_NAME (node));
 229   return is_builtin_name (name);
 230 }
 231
 232 /* Compute values M and N such that M divides (address of EXP - N) and such
 233    that N < M.  If these numbers can be determined, store M in alignp and N in
 234    *BITPOSP and return true.  Otherwise return false and store BITS_PER_UNIT to
 235    *alignp and any bit-offset to *bitposp.
 236
 237    Note that the address (and thus the alignment) computed here is based
 238    on the address to which a symbol resolves, whereas DECL_ALIGN is based
 239    on the address at which an object is actually located.  These two
 240    addresses are not always the same.  For example, on ARM targets,
 241    the address &foo of a Thumb function foo() has the lowest bit set,
 242    whereas foo() itself starts on an even address.
 243
 244    If ADDR_P is true we are taking the address of the memory reference EXP
 245    and thus cannot rely on the access taking place.  */
 246
 247 static bool
 248 get_object_alignment_2 (tree exp, unsigned int *alignp,
 249                         unsigned HOST_WIDE_INT *bitposp, bool addr_p)
 250 {
 251   poly_int64 bitsize, bitpos;
 252   tree offset;
 253   machine_mode mode;
 254   int unsignedp, reversep, volatilep;
 255   unsigned int align = BITS_PER_UNIT;
 256   bool known_alignment = false;
 257
 258   /* Get the innermost object and the constant (bitpos) and possibly
 259      variable (offset) offset of the access.  */
 260   exp = get_inner_reference (exp, &bitsize, &bitpos, &offset, &mode,
 261                              &unsignedp, &reversep, &volatilep);
 262
 263   /* Extract alignment information from the innermost object and
 264      possibly adjust bitpos and offset.  */
 265   if (TREE_CODE (exp) == FUNCTION_DECL)
 266     {
 267       /* Function addresses can encode extra information besides their
 268          alignment.  However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
 269          allows the low bit to be used as a virtual bit, we know
 270          that the address itself must be at least 2-byte aligned.  */
 271       if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn)
 272         align = 2 * BITS_PER_UNIT;
 273     }
 274   else if (TREE_CODE (exp) == LABEL_DECL)
 275     ;
 276   else if (TREE_CODE (exp) == CONST_DECL)
 277     {
 278       /* The alignment of a CONST_DECL is determined by its initializer.  */
 279       exp = DECL_INITIAL (exp);
 280       align = TYPE_ALIGN (TREE_TYPE (exp));
 281       if (CONSTANT_CLASS_P (exp))
 282         align = targetm.constant_alignment (exp, align);
 283
 284       known_alignment = true;
 285     }
 286   else if (DECL_P (exp))
 287     {
 288       align = DECL_ALIGN (exp);
 289       known_alignment = true;
 290     }
 291   else if (TREE_CODE (exp) == INDIRECT_REF
 292            || TREE_CODE (exp) == MEM_REF
 293            || TREE_CODE (exp) == TARGET_MEM_REF)
 294     {
 295       tree addr = TREE_OPERAND (exp, 0);
 296       unsigned ptr_align;
 297       unsigned HOST_WIDE_INT ptr_bitpos;
 298       unsigned HOST_WIDE_INT ptr_bitmask = ~0;
 299
 300       /* If the address is explicitely aligned, handle that.  */
 301       if (TREE_CODE (addr) == BIT_AND_EXPR
 302           && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST)
 303         {
 304           ptr_bitmask = TREE_INT_CST_LOW (TREE_OPERAND (addr, 1));
 305           ptr_bitmask *= BITS_PER_UNIT;
 306           align = least_bit_hwi (ptr_bitmask);
 307           addr = TREE_OPERAND (addr, 0);
 308         }
 309
 310       known_alignment
 311         = get_pointer_alignment_1 (addr, &ptr_align, &ptr_bitpos);
 312       align = MAX (ptr_align, align);
 313
 314       /* Re-apply explicit alignment to the bitpos.  */
 315       ptr_bitpos &= ptr_bitmask;
 316
 317       /* The alignment of the pointer operand in a TARGET_MEM_REF
 318          has to take the variable offset parts into account.  */
 319       if (TREE_CODE (exp) == TARGET_MEM_REF)
 320         {
 321           if (TMR_INDEX (exp))
 322             {
 323               unsigned HOST_WIDE_INT step = 1;
 324               if (TMR_STEP (exp))
 325                 step = TREE_INT_CST_LOW (TMR_STEP (exp));
 326               align = MIN (align, least_bit_hwi (step) * BITS_PER_UNIT);
 327             }
 328           if (TMR_INDEX2 (exp))
 329             align = BITS_PER_UNIT;
 330           known_alignment = false;
 331         }
 332
 333       /* When EXP is an actual memory reference then we can use
 334          TYPE_ALIGN of a pointer indirection to derive alignment.
 335          Do so only if get_pointer_alignment_1 did not reveal absolute
 336          alignment knowledge and if using that alignment would
 337          improve the situation.  */
 338       unsigned int talign;
 339       if (!addr_p && !known_alignment
 340           && (talign = min_align_of_type (TREE_TYPE (exp)) * BITS_PER_UNIT)
 341           && talign > align)
 342         align = talign;
 343       else
 344         {
 345           /* Else adjust bitpos accordingly.  */
 346           bitpos += ptr_bitpos;
 347           if (TREE_CODE (exp) == MEM_REF
 348               || TREE_CODE (exp) == TARGET_MEM_REF)
 349             bitpos += mem_ref_offset (exp).force_shwi () * BITS_PER_UNIT;
 350         }
 351     }
 352   else if (TREE_CODE (exp) == STRING_CST)
 353     {
 354       /* STRING_CST are the only constant objects we allow to be not
 355          wrapped inside a CONST_DECL.  */
 356       align = TYPE_ALIGN (TREE_TYPE (exp));
 357       if (CONSTANT_CLASS_P (exp))
 358         align = targetm.constant_alignment (exp, align);
 359
 360       known_alignment = true;
 361     }
 362
 363   /* If there is a non-constant offset part extract the maximum
 364      alignment that can prevail.  */
 365   if (offset)
 366     {
 367       unsigned int trailing_zeros = tree_ctz (offset);
 368       if (trailing_zeros < HOST_BITS_PER_INT)
 369         {
 370           unsigned int inner = (1U << trailing_zeros) * BITS_PER_UNIT;
 371           if (inner)
 372             align = MIN (align, inner);
 373         }
 374     }
 375
 376   /* Account for the alignment of runtime coefficients, so that the constant
 377      bitpos is guaranteed to be accurate.  */
 378   unsigned int alt_align = ::known_alignment (bitpos - bitpos.coeffs[0]);
 379   if (alt_align != 0 && alt_align < align)
 380     {
 381       align = alt_align;
 382       known_alignment = false;
 383     }
 384
 385   *alignp = align;
 386   *bitposp = bitpos.coeffs[0] & (align - 1);
 387   return known_alignment;
 388 }
 389
 390 /* For a memory reference expression EXP compute values M and N such that M
 391    divides (&EXP - N) and such that N < M.  If these numbers can be determined,
 392    store M in alignp and N in *BITPOSP and return true.  Otherwise return false
 393    and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp.  */
 394
 395 bool
 396 get_object_alignment_1 (tree exp, unsigned int *alignp,
 397                         unsigned HOST_WIDE_INT *bitposp)
 398 {
 399   return get_object_alignment_2 (exp, alignp, bitposp, false);
 400 }
 401
 402 /* Return the alignment in bits of EXP, an object.  */
 403
 404 unsigned int
 405 get_object_alignment (tree exp)
 406 {
 407   unsigned HOST_WIDE_INT bitpos = 0;
 408   unsigned int align;
 409
 410   get_object_alignment_1 (exp, &align, &bitpos);
 411
 412   /* align and bitpos now specify known low bits of the pointer.
 413      ptr & (align - 1) == bitpos.  */
 414
 415   if (bitpos != 0)
 416     align = least_bit_hwi (bitpos);
 417   return align;
 418 }
 419
 420 /* For a pointer valued expression EXP compute values M and N such that M
 421    divides (EXP - N) and such that N < M.  If these numbers can be determined,
 422    store M in alignp and N in *BITPOSP and return true.  Return false if
 423    the results are just a conservative approximation.
 424
 425    If EXP is not a pointer, false is returned too.  */
 426
 427 bool
 428 get_pointer_alignment_1 (tree exp, unsigned int *alignp,
 429                          unsigned HOST_WIDE_INT *bitposp)
 430 {
 431   STRIP_NOPS (exp);
 432
 433   if (TREE_CODE (exp) == ADDR_EXPR)
 434     return get_object_alignment_2 (TREE_OPERAND (exp, 0),
 435                                    alignp, bitposp, true);
 436   else if (TREE_CODE (exp) == POINTER_PLUS_EXPR)
 437     {
 438       unsigned int align;
 439       unsigned HOST_WIDE_INT bitpos;
 440       bool res = get_pointer_alignment_1 (TREE_OPERAND (exp, 0),
 441                                           &align, &bitpos);
 442       if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
 443         bitpos += TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)) * BITS_PER_UNIT;
 444       else
 445         {
 446           unsigned int trailing_zeros = tree_ctz (TREE_OPERAND (exp, 1));
 447           if (trailing_zeros < HOST_BITS_PER_INT)
 448             {
 449               unsigned int inner = (1U << trailing_zeros) * BITS_PER_UNIT;
 450               if (inner)
 451                 align = MIN (align, inner);
 452             }
 453         }
 454       *alignp = align;
 455       *bitposp = bitpos & (align - 1);
 456       return res;
 457     }
 458   else if (TREE_CODE (exp) == SSA_NAME
 459            && POINTER_TYPE_P (TREE_TYPE (exp)))
 460     {
 461       unsigned int ptr_align, ptr_misalign;
 462       struct ptr_info_def *pi = SSA_NAME_PTR_INFO (exp);
 463
 464       if (pi && get_ptr_info_alignment (pi, &ptr_align, &ptr_misalign))
 465         {
 466           *bitposp = ptr_misalign * BITS_PER_UNIT;
 467           *alignp = ptr_align * BITS_PER_UNIT;
 468           /* Make sure to return a sensible alignment when the multiplication
 469              by BITS_PER_UNIT overflowed.  */
 470           if (*alignp == 0)
 471             *alignp = 1u << (HOST_BITS_PER_INT - 1);
 472           /* We cannot really tell whether this result is an approximation.  */
 473           return false;
 474         }
 475       else
 476         {
 477           *bitposp = 0;
 478           *alignp = BITS_PER_UNIT;
 479           return false;
 480         }
 481     }
 482   else if (TREE_CODE (exp) == INTEGER_CST)
 483     {
 484       *alignp = BIGGEST_ALIGNMENT;
 485       *bitposp = ((TREE_INT_CST_LOW (exp) * BITS_PER_UNIT)
 486                   & (BIGGEST_ALIGNMENT - 1));
 487       return true;
 488     }
 489
 490   *bitposp = 0;
 491   *alignp = BITS_PER_UNIT;
 492   return false;
 493 }
 494
 495 /* Return the alignment in bits of EXP, a pointer valued expression.
 496    The alignment returned is, by default, the alignment of the thing that
 497    EXP points to.  If it is not a POINTER_TYPE, 0 is returned.
 498
 499    Otherwise, look at the expression to see if we can do better, i.e., if the
 500    expression is actually pointing at an object whose alignment is tighter.  */
 501
 502 unsigned int
 503 get_pointer_alignment (tree exp)
 504 {
 505   unsigned HOST_WIDE_INT bitpos = 0;
 506   unsigned int align;
 507
 508   get_pointer_alignment_1 (exp, &align, &bitpos);
 509
 510   /* align and bitpos now specify known low bits of the pointer.
 511      ptr & (align - 1) == bitpos.  */
 512
 513   if (bitpos != 0)
 514     align = least_bit_hwi (bitpos);
 515
 516   return align;
 517 }
 518
 519 /* Return the number of non-zero elements in the sequence
 520    [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
 521    ELTSIZE must be a power of 2 less than 8.  Used by c_strlen.  */
 522
 523 static unsigned
 524 string_length (const void *ptr, unsigned eltsize, unsigned maxelts)
 525 {
 526   gcc_checking_assert (eltsize == 1 || eltsize == 2 || eltsize == 4);
 527
 528   unsigned n;
 529
 530   if (eltsize == 1)
 531     {
 532       /* Optimize the common case of plain char.  */
 533       for (n = 0; n < maxelts; n++)
 534         {
 535           const char *elt = (const char*) ptr + n;
 536           if (!*elt)
 537             break;
 538         }
 539     }
 540   else
 541     {
 542       for (n = 0; n < maxelts; n++)
 543         {
 544           const char *elt = (const char*) ptr + n * eltsize;
 545           if (!memcmp (elt, "\0\0\0\0", eltsize))
 546             break;
 547         }
 548     }
 549   return n;
 550 }
 551
 552 /* Compute the length of a null-terminated character string or wide
 553    character string handling character sizes of 1, 2, and 4 bytes.
 554    TREE_STRING_LENGTH is not the right way because it evaluates to
 555    the size of the character array in bytes (as opposed to characters)
 556    and because it can contain a zero byte in the middle.
 557
 558    ONLY_VALUE should be nonzero if the result is not going to be emitted
 559    into the instruction stream and zero if it is going to be expanded.
 560    E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
 561    is returned, otherwise NULL, since
 562    len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
 563    evaluate the side-effects.
 564
 565    If ONLY_VALUE is two then we do not emit warnings about out-of-bound
 566    accesses.  Note that this implies the result is not going to be emitted
 567    into the instruction stream.
 568
 569    The value returned is of type `ssizetype'.
 570
 571    Unfortunately, string_constant can't access the values of const char
 572    arrays with initializers, so neither can we do so here.  */
 573
 574 tree
 575 c_strlen (tree src, int only_value)
 576 {
 577   STRIP_NOPS (src);
 578   if (TREE_CODE (src) == COND_EXPR
 579       && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
 580     {
 581       tree len1, len2;
 582
 583       len1 = c_strlen (TREE_OPERAND (src, 1), only_value);
 584       len2 = c_strlen (TREE_OPERAND (src, 2), only_value);
 585       if (tree_int_cst_equal (len1, len2))
 586         return len1;
 587     }
 588
 589   if (TREE_CODE (src) == COMPOUND_EXPR
 590       && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
 591     return c_strlen (TREE_OPERAND (src, 1), only_value);
 592
 593   location_t loc = EXPR_LOC_OR_LOC (src, input_location);
 594
 595   /* Offset from the beginning of the string in bytes.  */
 596   tree byteoff;
 597   src = string_constant (src, &byteoff);
 598   if (src == 0)
 599     return NULL_TREE;
 600
 601   /* Determine the size of the string element.  */
 602   unsigned eltsize
 603     = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (src))));
 604
 605   /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
 606      length of SRC.  */
 607   unsigned maxelts = TREE_STRING_LENGTH (src) / eltsize - 1;
 608
 609   /* PTR can point to the byte representation of any string type, including
 610      char* and wchar_t*.  */
 611   const char *ptr = TREE_STRING_POINTER (src);
 612
 613   if (byteoff && TREE_CODE (byteoff) != INTEGER_CST)
 614     {
 615       /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
 616          compute the offset to the following null if we don't know where to
 617          start searching for it.  */
 618       if (string_length (ptr, eltsize, maxelts) < maxelts)
 619         {
 620           /* Return when an embedded null character is found.  */
 621           return NULL_TREE;
 622         }
 623
 624       /* We don't know the starting offset, but we do know that the string
 625          has no internal zero bytes.  We can assume that the offset falls
 626          within the bounds of the string; otherwise, the programmer deserves
 627          what he gets.  Subtract the offset from the length of the string,
 628          and return that.  This would perhaps not be valid if we were dealing
 629          with named arrays in addition to literal string constants.  */
 630
 631       return size_diffop_loc (loc, size_int (maxelts * eltsize), byteoff);
 632     }
 633
 634   /* Offset from the beginning of the string in elements.  */
 635   HOST_WIDE_INT eltoff;
 636
 637   /* We have a known offset into the string.  Start searching there for
 638      a null character if we can represent it as a single HOST_WIDE_INT.  */
 639   if (byteoff == 0)
 640     eltoff = 0;
 641   else if (! tree_fits_shwi_p (byteoff))
 642     eltoff = -1;
 643   else
 644     eltoff = tree_to_shwi (byteoff) / eltsize;
 645
 646   /* If the offset is known to be out of bounds, warn, and call strlen at
 647      runtime.  */
 648   if (eltoff < 0 || eltoff > maxelts)
 649     {
 650      /* Suppress multiple warnings for propagated constant strings.  */
 651       if (only_value != 2
 652           && !TREE_NO_WARNING (src))
 653         {
 654           warning_at (loc, 0, "offset %qwi outside bounds of constant string",
 655                       eltoff);
 656           TREE_NO_WARNING (src) = 1;
 657         }
 658       return NULL_TREE;
 659     }
 660
 661   /* Use strlen to search for the first zero byte.  Since any strings
 662      constructed with build_string will have nulls appended, we win even
 663      if we get handed something like (char[4])"abcd".
 664
 665      Since ELTOFF is our starting index into the string, no further
 666      calculation is needed.  */
 667   unsigned len = string_length (ptr + eltoff * eltsize, eltsize,
 668                                 maxelts - eltoff);
 669
 670   return ssize_int (len);
 671 }
 672
 673 /* Return a constant integer corresponding to target reading
 674    GET_MODE_BITSIZE (MODE) bits from string constant STR.  */
 675
 676 static rtx
 677 c_readstr (const char *str, scalar_int_mode mode)
 678 {
 679   HOST_WIDE_INT ch;
 680   unsigned int i, j;
 681   HOST_WIDE_INT tmp[MAX_BITSIZE_MODE_ANY_INT / HOST_BITS_PER_WIDE_INT];
 682
 683   gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
 684   unsigned int len = (GET_MODE_PRECISION (mode) + HOST_BITS_PER_WIDE_INT - 1)
 685     / HOST_BITS_PER_WIDE_INT;
 686
 687   gcc_assert (len <= MAX_BITSIZE_MODE_ANY_INT / HOST_BITS_PER_WIDE_INT);
 688   for (i = 0; i < len; i++)
 689     tmp[i] = 0;
 690
 691   ch = 1;
 692   for (i = 0; i < GET_MODE_SIZE (mode); i++)
 693     {
 694       j = i;
 695       if (WORDS_BIG_ENDIAN)
 696         j = GET_MODE_SIZE (mode) - i - 1;
 697       if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN
 698           && GET_MODE_SIZE (mode) >= UNITS_PER_WORD)
 699         j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1;
 700       j *= BITS_PER_UNIT;
 701
 702       if (ch)
 703         ch = (unsigned char) str[i];
 704       tmp[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT);
 705     }
 706
 707   wide_int c = wide_int::from_array (tmp, len, GET_MODE_PRECISION (mode));
 708   return immed_wide_int_const (c, mode);
 709 }
 710
 711 /* Cast a target constant CST to target CHAR and if that value fits into
 712    host char type, return zero and put that value into variable pointed to by
 713    P.  */
 714
 715 static int
 716 target_char_cast (tree cst, char *p)
 717 {
 718   unsigned HOST_WIDE_INT val, hostval;
 719
 720   if (TREE_CODE (cst) != INTEGER_CST
 721       || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
 722     return 1;
 723
 724   /* Do not care if it fits or not right here.  */
 725   val = TREE_INT_CST_LOW (cst);
 726
 727   if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
 728     val &= (HOST_WIDE_INT_1U << CHAR_TYPE_SIZE) - 1;
 729
 730   hostval = val;
 731   if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
 732     hostval &= (HOST_WIDE_INT_1U << HOST_BITS_PER_CHAR) - 1;
 733
 734   if (val != hostval)
 735     return 1;
 736
 737   *p = hostval;
 738   return 0;
 739 }
 740
 741 /* Similar to save_expr, but assumes that arbitrary code is not executed
 742    in between the multiple evaluations.  In particular, we assume that a
 743    non-addressable local variable will not be modified.  */
 744
 745 static tree
 746 builtin_save_expr (tree exp)
 747 {
 748   if (TREE_CODE (exp) == SSA_NAME
 749       || (TREE_ADDRESSABLE (exp) == 0
 750           && (TREE_CODE (exp) == PARM_DECL
 751               || (VAR_P (exp) && !TREE_STATIC (exp)))))
 752     return exp;
 753
 754   return save_expr (exp);
 755 }
 756
 757 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
 758    times to get the address of either a higher stack frame, or a return
 759    address located within it (depending on FNDECL_CODE).  */
 760
 761 static rtx
 762 expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
 763 {
 764   int i;
 765   rtx tem = INITIAL_FRAME_ADDRESS_RTX;
 766   if (tem == NULL_RTX)
 767     {
 768       /* For a zero count with __builtin_return_address, we don't care what
 769          frame address we return, because target-specific definitions will
 770          override us.  Therefore frame pointer elimination is OK, and using
 771          the soft frame pointer is OK.
 772
 773          For a nonzero count, or a zero count with __builtin_frame_address,
 774          we require a stable offset from the current frame pointer to the
 775          previous one, so we must use the hard frame pointer, and
 776          we must disable frame pointer elimination.  */
 777       if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
 778         tem = frame_pointer_rtx;
 779       else
 780         {
 781           tem = hard_frame_pointer_rtx;
 782
 783           /* Tell reload not to eliminate the frame pointer.  */
 784           crtl->accesses_prior_frames = 1;
 785         }
 786     }
 787
 788   if (count > 0)
 789     SETUP_FRAME_ADDRESSES ();
 790
 791   /* On the SPARC, the return address is not in the frame, it is in a
 792      register.  There is no way to access it off of the current frame
 793      pointer, but it can be accessed off the previous frame pointer by
 794      reading the value from the register window save area.  */
 795   if (RETURN_ADDR_IN_PREVIOUS_FRAME && fndecl_code == BUILT_IN_RETURN_ADDRESS)
 796     count--;
 797
 798   /* Scan back COUNT frames to the specified frame.  */
 799   for (i = 0; i < count; i++)
 800     {
 801       /* Assume the dynamic chain pointer is in the word that the
 802          frame address points to, unless otherwise specified.  */
 803       tem = DYNAMIC_CHAIN_ADDRESS (tem);
 804       tem = memory_address (Pmode, tem);
 805       tem = gen_frame_mem (Pmode, tem);
 806       tem = copy_to_reg (tem);
 807     }
 808
 809   /* For __builtin_frame_address, return what we've got.  But, on
 810      the SPARC for example, we may have to add a bias.  */
 811   if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
 812     return FRAME_ADDR_RTX (tem);
 813
 814   /* For __builtin_return_address, get the return address from that frame.  */
 815 #ifdef RETURN_ADDR_RTX
 816   tem = RETURN_ADDR_RTX (count, tem);
 817 #else
 818   tem = memory_address (Pmode,
 819                         plus_constant (Pmode, tem, GET_MODE_SIZE (Pmode)));
 820   tem = gen_frame_mem (Pmode, tem);
 821 #endif
 822   return tem;
 823 }
 824
 825 /* Alias set used for setjmp buffer.  */
 826 static alias_set_type setjmp_alias_set = -1;
 827
 828 /* Construct the leading half of a __builtin_setjmp call.  Control will
 829    return to RECEIVER_LABEL.  This is also called directly by the SJLJ
 830    exception handling code.  */
 831
 832 void
 833 expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
 834 {
 835   machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
 836   rtx stack_save;
 837   rtx mem;
 838
 839   if (setjmp_alias_set == -1)
 840     setjmp_alias_set = new_alias_set ();
 841
 842   buf_addr = convert_memory_address (Pmode, buf_addr);
 843
 844   buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
 845
 846   /* We store the frame pointer and the address of receiver_label in
 847      the buffer and use the rest of it for the stack save area, which
 848      is machine-dependent.  */
 849
 850   mem = gen_rtx_MEM (Pmode, buf_addr);
 851   set_mem_alias_set (mem, setjmp_alias_set);
 852   emit_move_insn (mem, targetm.builtin_setjmp_frame_value ());
 853
 854   mem = gen_rtx_MEM (Pmode, plus_constant (Pmode, buf_addr,
 855                                            GET_MODE_SIZE (Pmode))),
 856   set_mem_alias_set (mem, setjmp_alias_set);
 857
 858   emit_move_insn (validize_mem (mem),
 859                   force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
 860
 861   stack_save = gen_rtx_MEM (sa_mode,
 862                             plus_constant (Pmode, buf_addr,
 863                                            2 * GET_MODE_SIZE (Pmode)));
 864   set_mem_alias_set (stack_save, setjmp_alias_set);
 865   emit_stack_save (SAVE_NONLOCAL, &stack_save);
 866
 867   /* If there is further processing to do, do it.  */
 868   if (targetm.have_builtin_setjmp_setup ())
 869     emit_insn (targetm.gen_builtin_setjmp_setup (buf_addr));
 870
 871   /* We have a nonlocal label.   */
 872   cfun->has_nonlocal_label = 1;
 873 }
 874
 875 /* Construct the trailing part of a __builtin_setjmp call.  This is
 876    also called directly by the SJLJ exception handling code.
 877    If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler.  */
 878
 879 void
 880 expand_builtin_setjmp_receiver (rtx receiver_label)
 881 {
 882   rtx chain;
 883
 884   /* Mark the FP as used when we get here, so we have to make sure it's
 885      marked as used by this function.  */
 886   emit_use (hard_frame_pointer_rtx);
 887
 888   /* Mark the static chain as clobbered here so life information
 889      doesn't get messed up for it.  */
 890   chain = rtx_for_static_chain (current_function_decl, true);
 891   if (chain && REG_P (chain))
 892     emit_clobber (chain);
 893
 894   /* Now put in the code to restore the frame pointer, and argument
 895      pointer, if needed.  */
 896   if (! targetm.have_nonlocal_goto ())
 897     {
 898       /* First adjust our frame pointer to its actual value.  It was
 899          previously set to the start of the virtual area corresponding to
 900          the stacked variables when we branched here and now needs to be
 901          adjusted to the actual hardware fp value.
 902
 903          Assignments to virtual registers are converted by
 904          instantiate_virtual_regs into the corresponding assignment
 905          to the underlying register (fp in this case) that makes
 906          the original assignment true.
 907          So the following insn will actually be decrementing fp by
 908          TARGET_STARTING_FRAME_OFFSET.  */
 909       emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx);
 910
 911       /* Restoring the frame pointer also modifies the hard frame pointer.
 912          Mark it used (so that the previous assignment remains live once
 913          the frame pointer is eliminated) and clobbered (to represent the
 914          implicit update from the assignment).  */
 915       emit_use (hard_frame_pointer_rtx);
 916       emit_clobber (hard_frame_pointer_rtx);
 917     }
 918
 919   if (!HARD_FRAME_POINTER_IS_ARG_POINTER && fixed_regs[ARG_POINTER_REGNUM])
 920     {
 921       /* If the argument pointer can be eliminated in favor of the
 922          frame pointer, we don't need to restore it.  We assume here
 923          that if such an elimination is present, it can always be used.
 924          This is the case on all known machines; if we don't make this
 925          assumption, we do unnecessary saving on many machines.  */
 926       size_t i;
 927       static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
 928
 929       for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
 930         if (elim_regs[i].from == ARG_POINTER_REGNUM
 931             && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
 932           break;
 933
 934       if (i == ARRAY_SIZE (elim_regs))
 935         {
 936           /* Now restore our arg pointer from the address at which it
 937              was saved in our stack frame.  */
 938           emit_move_insn (crtl->args.internal_arg_pointer,
 939                           copy_to_reg (get_arg_pointer_save_area ()));
 940         }
 941     }
 942
 943   if (receiver_label != NULL && targetm.have_builtin_setjmp_receiver ())
 944     emit_insn (targetm.gen_builtin_setjmp_receiver (receiver_label));
 945   else if (targetm.have_nonlocal_goto_receiver ())
 946     emit_insn (targetm.gen_nonlocal_goto_receiver ());
 947   else
 948     { /* Nothing */ }
 949
 950   /* We must not allow the code we just generated to be reordered by
 951      scheduling.  Specifically, the update of the frame pointer must
 952      happen immediately, not later.  */
 953   emit_insn (gen_blockage ());
 954 }
 955
 956 /* __builtin_longjmp is passed a pointer to an array of five words (not
 957    all will be used on all machines).  It operates similarly to the C
 958    library function of the same name, but is more efficient.  Much of
 959    the code below is copied from the handling of non-local gotos.  */
 960
 961 static void
 962 expand_builtin_longjmp (rtx buf_addr, rtx value)
 963 {
 964   rtx fp, lab, stack;
 965   rtx_insn *insn, *last;
 966   machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
 967
 968   /* DRAP is needed for stack realign if longjmp is expanded to current
 969      function  */
 970   if (SUPPORTS_STACK_ALIGNMENT)
 971     crtl->need_drap = true;
 972
 973   if (setjmp_alias_set == -1)
 974     setjmp_alias_set = new_alias_set ();
 975
 976   buf_addr = convert_memory_address (Pmode, buf_addr);
 977
 978   buf_addr = force_reg (Pmode, buf_addr);
 979
 980   /* We require that the user must pass a second argument of 1, because
 981      that is what builtin_setjmp will return.  */
 982   gcc_assert (value == const1_rtx);
 983
 984   last = get_last_insn ();
 985   if (targetm.have_builtin_longjmp ())
 986     emit_insn (targetm.gen_builtin_longjmp (buf_addr));
 987   else
 988     {
 989       fp = gen_rtx_MEM (Pmode, buf_addr);
 990       lab = gen_rtx_MEM (Pmode, plus_constant (Pmode, buf_addr,
 991                                                GET_MODE_SIZE (Pmode)));
 992
 993       stack = gen_rtx_MEM (sa_mode, plus_constant (Pmode, buf_addr,
 994                                                    2 * GET_MODE_SIZE (Pmode)));
 995       set_mem_alias_set (fp, setjmp_alias_set);
 996       set_mem_alias_set (lab, setjmp_alias_set);
 997       set_mem_alias_set (stack, setjmp_alias_set);
 998
 999       /* Pick up FP, label, and SP from the block and jump.  This code is
1000          from expand_goto in stmt.c; see there for detailed comments.  */
1001       if (targetm.have_nonlocal_goto ())
1002         /* We have to pass a value to the nonlocal_goto pattern that will
1003            get copied into the static_chain pointer, but it does not matter
1004            what that value is, because builtin_setjmp does not use it.  */
1005         emit_insn (targetm.gen_nonlocal_goto (value, lab, stack, fp));
1006       else
1007         {
1008           lab = copy_to_reg (lab);
1009
1010           emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
1011           emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
1012
1013           emit_move_insn (hard_frame_pointer_rtx, fp);
1014           emit_stack_restore (SAVE_NONLOCAL, stack);
1015
1016           emit_use (hard_frame_pointer_rtx);
1017           emit_use (stack_pointer_rtx);
1018           emit_indirect_jump (lab);
1019         }
1020     }
1021
1022   /* Search backwards and mark the jump insn as a non-local goto.
1023      Note that this precludes the use of __builtin_longjmp to a
1024      __builtin_setjmp target in the same function.  However, we've
1025      already cautioned the user that these functions are for
1026      internal exception handling use only.  */
1027   for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1028     {
1029       gcc_assert (insn != last);
1030
1031       if (JUMP_P (insn))
1032         {
1033           add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1034           break;
1035         }
1036       else if (CALL_P (insn))
1037         break;
1038     }
1039 }
1040
1041 static inline bool
1042 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
1043 {
1044   return (iter->i < iter->n);
1045 }
1046
1047 /* This function validates the types of a function call argument list
1048    against a specified list of tree_codes.  If the last specifier is a 0,
1049    that represents an ellipsis, otherwise the last specifier must be a
1050    VOID_TYPE.  */
1051
1052 static bool
1053 validate_arglist (const_tree callexpr, ...)
1054 {
1055   enum tree_code code;
1056   bool res = 0;
1057   va_list ap;
1058   const_call_expr_arg_iterator iter;
1059   const_tree arg;
1060
1061   va_start (ap, callexpr);
1062   init_const_call_expr_arg_iterator (callexpr, &iter);
1063
1064   /* Get a bitmap of pointer argument numbers declared attribute nonnull.  */
1065   tree fn = CALL_EXPR_FN (callexpr);
1066   bitmap argmap = get_nonnull_args (TREE_TYPE (TREE_TYPE (fn)));
1067
1068   for (unsigned argno = 1; ; ++argno)
1069     {
1070       code = (enum tree_code) va_arg (ap, int);
1071
1072       switch (code)
1073         {
1074         case 0:
1075           /* This signifies an ellipses, any further arguments are all ok.  */
1076           res = true;
1077           goto end;
1078         case VOID_TYPE:
1079           /* This signifies an endlink, if no arguments remain, return
1080              true, otherwise return false.  */
1081           res = !more_const_call_expr_args_p (&iter);
1082           goto end;
1083         case POINTER_TYPE:
1084           /* The actual argument must be nonnull when either the whole
1085              called function has been declared nonnull, or when the formal
1086              argument corresponding to the actual argument has been.  */
1087           if (argmap
1088               && (bitmap_empty_p (argmap) || bitmap_bit_p (argmap, argno)))
1089             {
1090               arg = next_const_call_expr_arg (&iter);
1091               if (!validate_arg (arg, code) || integer_zerop (arg))
1092                 goto end;
1093               break;
1094             }
1095           /* FALLTHRU */
1096         default:
1097           /* If no parameters remain or the parameter's code does not
1098              match the specified code, return false.  Otherwise continue
1099              checking any remaining arguments.  */
1100           arg = next_const_call_expr_arg (&iter);
1101           if (!validate_arg (arg, code))
1102             goto end;
1103           break;
1104         }
1105     }
1106
1107   /* We need gotos here since we can only have one VA_CLOSE in a
1108      function.  */
1109  end: ;
1110   va_end (ap);
1111
1112   BITMAP_FREE (argmap);
1113
1114   return res;
1115 }
1116
1117 /* Expand a call to __builtin_nonlocal_goto.  We're passed the target label
1118    and the address of the save area.  */
1119
1120 static rtx
1121 expand_builtin_nonlocal_goto (tree exp)
1122 {
1123   tree t_label, t_save_area;
1124   rtx r_label, r_save_area, r_fp, r_sp;
1125   rtx_insn *insn;
1126
1127   if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
1128     return NULL_RTX;
1129
1130   t_label = CALL_EXPR_ARG (exp, 0);
1131   t_save_area = CALL_EXPR_ARG (exp, 1);
1132
1133   r_label = expand_normal (t_label);
1134   r_label = convert_memory_address (Pmode, r_label);
1135   r_save_area = expand_normal (t_save_area);
1136   r_save_area = convert_memory_address (Pmode, r_save_area);
1137   /* Copy the address of the save location to a register just in case it was
1138      based on the frame pointer.   */
1139   r_save_area = copy_to_reg (r_save_area);
1140   r_fp = gen_rtx_MEM (Pmode, r_save_area);
1141   r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
1142                       plus_constant (Pmode, r_save_area,
1143                                      GET_MODE_SIZE (Pmode)));
1144
1145   crtl->has_nonlocal_goto = 1;
1146
1147   /* ??? We no longer need to pass the static chain value, afaik.  */
1148   if (targetm.have_nonlocal_goto ())
1149     emit_insn (targetm.gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
1150   else
1151     {
1152       r_label = copy_to_reg (r_label);
1153
1154       emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
1155       emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
1156
1157       /* Restore frame pointer for containing function.  */
1158       emit_move_insn (hard_frame_pointer_rtx, r_fp);
1159       emit_stack_restore (SAVE_NONLOCAL, r_sp);
1160
1161       /* USE of hard_frame_pointer_rtx added for consistency;
1162          not clear if really needed.  */
1163       emit_use (hard_frame_pointer_rtx);
1164       emit_use (stack_pointer_rtx);
1165
1166       /* If the architecture is using a GP register, we must
1167          conservatively assume that the target function makes use of it.
1168          The prologue of functions with nonlocal gotos must therefore
1169          initialize the GP register to the appropriate value, and we
1170          must then make sure that this value is live at the point
1171          of the jump.  (Note that this doesn't necessarily apply
1172          to targets with a nonlocal_goto pattern; they are free
1173          to implement it in their own way.  Note also that this is
1174          a no-op if the GP register is a global invariant.)  */
1175       unsigned regnum = PIC_OFFSET_TABLE_REGNUM;
1176       if (regnum != INVALID_REGNUM && fixed_regs[regnum])
1177         emit_use (pic_offset_table_rtx);
1178
1179       emit_indirect_jump (r_label);
1180     }
1181
1182   /* Search backwards to the jump insn and mark it as a
1183      non-local goto.  */
1184   for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1185     {
1186       if (JUMP_P (insn))
1187         {
1188           add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1189           break;
1190         }
1191       else if (CALL_P (insn))
1192         break;
1193     }
1194
1195   return const0_rtx;
1196 }
1197
1198 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1199    (not all will be used on all machines) that was passed to __builtin_setjmp.
1200    It updates the stack pointer in that block to the current value.  This is
1201    also called directly by the SJLJ exception handling code.  */
1202
1203 void
1204 expand_builtin_update_setjmp_buf (rtx buf_addr)
1205 {
1206   machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
1207   buf_addr = convert_memory_address (Pmode, buf_addr);
1208   rtx stack_save
1209     = gen_rtx_MEM (sa_mode,
1210                    memory_address
1211                    (sa_mode,
1212                     plus_constant (Pmode, buf_addr,
1213                                    2 * GET_MODE_SIZE (Pmode))));
1214
1215   emit_stack_save (SAVE_NONLOCAL, &stack_save);
1216 }
1217
1218 /* Expand a call to __builtin_prefetch.  For a target that does not support
1219    data prefetch, evaluate the memory address argument in case it has side
1220    effects.  */
1221
1222 static void
1223 expand_builtin_prefetch (tree exp)
1224 {
1225   tree arg0, arg1, arg2;
1226   int nargs;
1227   rtx op0, op1, op2;
1228
1229   if (!validate_arglist (exp, POINTER_TYPE, 0))
1230     return;
1231
1232   arg0 = CALL_EXPR_ARG (exp, 0);
1233
1234   /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1235      zero (read) and argument 2 (locality) defaults to 3 (high degree of
1236      locality).  */
1237   nargs = call_expr_nargs (exp);
1238   if (nargs > 1)
1239     arg1 = CALL_EXPR_ARG (exp, 1);
1240   else
1241     arg1 = integer_zero_node;
1242   if (nargs > 2)
1243     arg2 = CALL_EXPR_ARG (exp, 2);
1244   else
1245     arg2 = integer_three_node;
1246
1247   /* Argument 0 is an address.  */
1248   op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
1249
1250   /* Argument 1 (read/write flag) must be a compile-time constant int.  */
1251   if (TREE_CODE (arg1) != INTEGER_CST)
1252     {
1253       error ("second argument to %<__builtin_prefetch%> must be a constant");
1254       arg1 = integer_zero_node;
1255     }
1256   op1 = expand_normal (arg1);
1257   /* Argument 1 must be either zero or one.  */
1258   if (INTVAL (op1) != 0 && INTVAL (op1) != 1)
1259     {
1260       warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1261                " using zero");
1262       op1 = const0_rtx;
1263     }
1264
1265   /* Argument 2 (locality) must be a compile-time constant int.  */
1266   if (TREE_CODE (arg2) != INTEGER_CST)
1267     {
1268       error ("third argument to %<__builtin_prefetch%> must be a constant");
1269       arg2 = integer_zero_node;
1270     }
1271   op2 = expand_normal (arg2);
1272   /* Argument 2 must be 0, 1, 2, or 3.  */
1273   if (INTVAL (op2) < 0 || INTVAL (op2) > 3)
1274     {
1275       warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1276       op2 = const0_rtx;
1277     }
1278
1279   if (targetm.have_prefetch ())
1280     {
1281       struct expand_operand ops[3];
1282
1283       create_address_operand (&ops[0], op0);
1284       create_integer_operand (&ops[1], INTVAL (op1));
1285       create_integer_operand (&ops[2], INTVAL (op2));
1286       if (maybe_expand_insn (targetm.code_for_prefetch, 3, ops))
1287         return;
1288     }
1289
1290   /* Don't do anything with direct references to volatile memory, but
1291      generate code to handle other side effects.  */
1292   if (!MEM_P (op0) && side_effects_p (op0))
1293     emit_insn (op0);
1294 }
1295
1296 /* Get a MEM rtx for expression EXP which is the address of an operand
1297    to be used in a string instruction (cmpstrsi, movmemsi, ..).  LEN is
1298    the maximum length of the block of memory that might be accessed or
1299    NULL if unknown.  */
1300
1301 static rtx
1302 get_memory_rtx (tree exp, tree len)
1303 {
1304   tree orig_exp = exp;
1305   rtx addr, mem;
1306
1307   /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1308      from its expression, for expr->a.b only <variable>.a.b is recorded.  */
1309   if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp))
1310     exp = TREE_OPERAND (exp, 0);
1311
1312   addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1313   mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
1314
1315   /* Get an expression we can use to find the attributes to assign to MEM.
1316      First remove any nops.  */
1317   while (CONVERT_EXPR_P (exp)
1318          && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
1319     exp = TREE_OPERAND (exp, 0);
1320
1321   /* Build a MEM_REF representing the whole accessed area as a byte blob,
1322      (as builtin stringops may alias with anything).  */
1323   exp = fold_build2 (MEM_REF,
1324                      build_array_type (char_type_node,
1325                                        build_range_type (sizetype,
1326                                                          size_one_node, len)),
1327                      exp, build_int_cst (ptr_type_node, 0));
1328
1329   /* If the MEM_REF has no acceptable address, try to get the base object
1330      from the original address we got, and build an all-aliasing
1331      unknown-sized access to that one.  */
1332   if (is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0)))
1333     set_mem_attributes (mem, exp, 0);
1334   else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
1335            && (exp = get_base_address (TREE_OPERAND (TREE_OPERAND (exp, 0),
1336                                                      0))))
1337     {
1338       exp = build_fold_addr_expr (exp);
1339       exp = fold_build2 (MEM_REF,
1340                          build_array_type (char_type_node,
1341                                            build_range_type (sizetype,
1342                                                              size_zero_node,
1343                                                              NULL)),
1344                          exp, build_int_cst (ptr_type_node, 0));
1345       set_mem_attributes (mem, exp, 0);
1346     }
1347   set_mem_alias_set (mem, 0);
1348   return mem;
1349 }
1350 \f
1351 /* Built-in functions to perform an untyped call and return.  */
1352
1353 #define apply_args_mode \
1354   (this_target_builtins->x_apply_args_mode)
1355 #define apply_result_mode \
1356   (this_target_builtins->x_apply_result_mode)
1357
1358 /* Return the size required for the block returned by __builtin_apply_args,
1359    and initialize apply_args_mode.  */
1360
1361 static int
1362 apply_args_size (void)
1363 {
1364   static int size = -1;
1365   int align;
1366   unsigned int regno;
1367   machine_mode mode;
1368
1369   /* The values computed by this function never change.  */
1370   if (size < 0)
1371     {
1372       /* The first value is the incoming arg-pointer.  */
1373       size = GET_MODE_SIZE (Pmode);
1374
1375       /* The second value is the structure value address unless this is
1376          passed as an "invisible" first argument.  */
1377       if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1378         size += GET_MODE_SIZE (Pmode);
1379
1380       for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1381         if (FUNCTION_ARG_REGNO_P (regno))
1382           {
1383             mode = targetm.calls.get_raw_arg_mode (regno);
1384
1385             gcc_assert (mode != VOIDmode);
1386
1387             align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1388             if (size % align != 0)
1389               size = CEIL (size, align) * align;
1390             size += GET_MODE_SIZE (mode);
1391             apply_args_mode[regno] = mode;
1392           }
1393         else
1394           {
1395             apply_args_mode[regno] = VOIDmode;
1396           }
1397     }
1398   return size;
1399 }
1400
1401 /* Return the size required for the block returned by __builtin_apply,
1402    and initialize apply_result_mode.  */
1403
1404 static int
1405 apply_result_size (void)
1406 {
1407   static int size = -1;
1408   int align, regno;
1409   machine_mode mode;
1410
1411   /* The values computed by this function never change.  */
1412   if (size < 0)
1413     {
1414       size = 0;
1415
1416       for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1417         if (targetm.calls.function_value_regno_p (regno))
1418           {
1419             mode = targetm.calls.get_raw_result_mode (regno);
1420
1421             gcc_assert (mode != VOIDmode);
1422
1423             align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1424             if (size % align != 0)
1425               size = CEIL (size, align) * align;
1426             size += GET_MODE_SIZE (mode);
1427             apply_result_mode[regno] = mode;
1428           }
1429         else
1430           apply_result_mode[regno] = VOIDmode;
1431
1432       /* Allow targets that use untyped_call and untyped_return to override
1433          the size so that machine-specific information can be stored here.  */
1434 #ifdef APPLY_RESULT_SIZE
1435       size = APPLY_RESULT_SIZE;
1436 #endif
1437     }
1438   return size;
1439 }
1440
1441 /* Create a vector describing the result block RESULT.  If SAVEP is true,
1442    the result block is used to save the values; otherwise it is used to
1443    restore the values.  */
1444
1445 static rtx
1446 result_vector (int savep, rtx result)
1447 {
1448   int regno, size, align, nelts;
1449   machine_mode mode;
1450   rtx reg, mem;
1451   rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER);
1452
1453   size = nelts = 0;
1454   for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1455     if ((mode = apply_result_mode[regno]) != VOIDmode)
1456       {
1457         align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1458         if (size % align != 0)
1459           size = CEIL (size, align) * align;
1460         reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1461         mem = adjust_address (result, mode, size);
1462         savevec[nelts++] = (savep
1463                             ? gen_rtx_SET (mem, reg)
1464                             : gen_rtx_SET (reg, mem));
1465         size += GET_MODE_SIZE (mode);
1466       }
1467   return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1468 }
1469
1470 /* Save the state required to perform an untyped call with the same
1471    arguments as were passed to the current function.  */
1472
1473 static rtx
1474 expand_builtin_apply_args_1 (void)
1475 {
1476   rtx registers, tem;
1477   int size, align, regno;
1478   machine_mode mode;
1479   rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1480
1481   /* Create a block where the arg-pointer, structure value address,
1482      and argument registers can be saved.  */
1483   registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1484
1485   /* Walk past the arg-pointer and structure value address.  */
1486   size = GET_MODE_SIZE (Pmode);
1487   if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1488     size += GET_MODE_SIZE (Pmode);
1489
1490   /* Save each register used in calling a function to the block.  */
1491   for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1492     if ((mode = apply_args_mode[regno]) != VOIDmode)
1493       {
1494         align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1495         if (size % align != 0)
1496           size = CEIL (size, align) * align;
1497
1498         tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1499
1500         emit_move_insn (adjust_address (registers, mode, size), tem);
1501         size += GET_MODE_SIZE (mode);
1502       }
1503
1504   /* Save the arg pointer to the block.  */
1505   tem = copy_to_reg (crtl->args.internal_arg_pointer);
1506   /* We need the pointer as the caller actually passed them to us, not
1507      as we might have pretended they were passed.  Make sure it's a valid
1508      operand, as emit_move_insn isn't expected to handle a PLUS.  */
1509   if (STACK_GROWS_DOWNWARD)
1510     tem
1511       = force_operand (plus_constant (Pmode, tem,
1512                                       crtl->args.pretend_args_size),
1513                        NULL_RTX);
1514   emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1515
1516   size = GET_MODE_SIZE (Pmode);
1517
1518   /* Save the structure value address unless this is passed as an
1519      "invisible" first argument.  */
1520   if (struct_incoming_value)
1521     {
1522       emit_move_insn (adjust_address (registers, Pmode, size),
1523                       copy_to_reg (struct_incoming_value));
1524       size += GET_MODE_SIZE (Pmode);
1525     }
1526
1527   /* Return the address of the block.  */
1528   return copy_addr_to_reg (XEXP (registers, 0));
1529 }
1530
1531 /* __builtin_apply_args returns block of memory allocated on
1532    the stack into which is stored the arg pointer, structure
1533    value address, static chain, and all the registers that might
1534    possibly be used in performing a function call.  The code is
1535    moved to the start of the function so the incoming values are
1536    saved.  */
1537
1538 static rtx
1539 expand_builtin_apply_args (void)
1540 {
1541   /* Don't do __builtin_apply_args more than once in a function.
1542      Save the result of the first call and reuse it.  */
1543   if (apply_args_value != 0)
1544     return apply_args_value;
1545   {
1546     /* When this function is called, it means that registers must be
1547        saved on entry to this function.  So we migrate the
1548        call to the first insn of this function.  */
1549     rtx temp;
1550
1551     start_sequence ();
1552     temp = expand_builtin_apply_args_1 ();
1553     rtx_insn *seq = get_insns ();
1554     end_sequence ();
1555
1556     apply_args_value = temp;
1557
1558     /* Put the insns after the NOTE that starts the function.
1559        If this is inside a start_sequence, make the outer-level insn
1560        chain current, so the code is placed at the start of the
1561        function.  If internal_arg_pointer is a non-virtual pseudo,
1562        it needs to be placed after the function that initializes
1563        that pseudo.  */
1564     push_topmost_sequence ();
1565     if (REG_P (crtl->args.internal_arg_pointer)
1566         && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER)
1567       emit_insn_before (seq, parm_birth_insn);
1568     else
1569       emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1570     pop_topmost_sequence ();
1571     return temp;
1572   }
1573 }
1574
1575 /* Perform an untyped call and save the state required to perform an
1576    untyped return of whatever value was returned by the given function.  */
1577
1578 static rtx
1579 expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1580 {
1581   int size, align, regno;
1582   machine_mode mode;
1583   rtx incoming_args, result, reg, dest, src;
1584   rtx_call_insn *call_insn;
1585   rtx old_stack_level = 0;
1586   rtx call_fusage = 0;
1587   rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1588
1589   arguments = convert_memory_address (Pmode, arguments);
1590
1591   /* Create a block where the return registers can be saved.  */
1592   result = assign_stack_local (BLKmode, apply_result_size (), -1);
1593
1594   /* Fetch the arg pointer from the ARGUMENTS block.  */
1595   incoming_args = gen_reg_rtx (Pmode);
1596   emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1597   if (!STACK_GROWS_DOWNWARD)
1598     incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1599                                          incoming_args, 0, OPTAB_LIB_WIDEN);
1600
1601   /* Push a new argument block and copy the arguments.  Do not allow
1602      the (potential) memcpy call below to interfere with our stack
1603      manipulations.  */
1604   do_pending_stack_adjust ();
1605   NO_DEFER_POP;
1606
1607   /* Save the stack with nonlocal if available.  */
1608   if (targetm.have_save_stack_nonlocal ())
1609     emit_stack_save (SAVE_NONLOCAL, &old_stack_level);
1610   else
1611     emit_stack_save (SAVE_BLOCK, &old_stack_level);
1612
1613   /* Allocate a block of memory onto the stack and copy the memory
1614      arguments to the outgoing arguments address.  We can pass TRUE
1615      as the 4th argument because we just saved the stack pointer
1616      and will restore it right after the call.  */
1617   allocate_dynamic_stack_space (argsize, 0, BIGGEST_ALIGNMENT, -1, true);
1618
1619   /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1620      may have already set current_function_calls_alloca to true.
1621      current_function_calls_alloca won't be set if argsize is zero,
1622      so we have to guarantee need_drap is true here.  */
1623   if (SUPPORTS_STACK_ALIGNMENT)
1624     crtl->need_drap = true;
1625
1626   dest = virtual_outgoing_args_rtx;
1627   if (!STACK_GROWS_DOWNWARD)
1628     {
1629       if (CONST_INT_P (argsize))
1630         dest = plus_constant (Pmode, dest, -INTVAL (argsize));
1631       else
1632         dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1633     }
1634   dest = gen_rtx_MEM (BLKmode, dest);
1635   set_mem_align (dest, PARM_BOUNDARY);
1636   src = gen_rtx_MEM (BLKmode, incoming_args);
1637   set_mem_align (src, PARM_BOUNDARY);
1638   emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1639
1640   /* Refer to the argument block.  */
1641   apply_args_size ();
1642   arguments = gen_rtx_MEM (BLKmode, arguments);
1643   set_mem_align (arguments, PARM_BOUNDARY);
1644
1645   /* Walk past the arg-pointer and structure value address.  */
1646   size = GET_MODE_SIZE (Pmode);
1647   if (struct_value)
1648     size += GET_MODE_SIZE (Pmode);
1649
1650   /* Restore each of the registers previously saved.  Make USE insns
1651      for each of these registers for use in making the call.  */
1652   for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1653     if ((mode = apply_args_mode[regno]) != VOIDmode)
1654       {
1655         align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1656         if (size % align != 0)
1657           size = CEIL (size, align) * align;
1658         reg = gen_rtx_REG (mode, regno);
1659         emit_move_insn (reg, adjust_address (arguments, mode, size));
1660         use_reg (&call_fusage, reg);
1661         size += GET_MODE_SIZE (mode);
1662       }
1663
1664   /* Restore the structure value address unless this is passed as an
1665      "invisible" first argument.  */
1666   size = GET_MODE_SIZE (Pmode);
1667   if (struct_value)
1668     {
1669       rtx value = gen_reg_rtx (Pmode);
1670       emit_move_insn (value, adjust_address (arguments, Pmode, size));
1671       emit_move_insn (struct_value, value);
1672       if (REG_P (struct_value))
1673         use_reg (&call_fusage, struct_value);
1674       size += GET_MODE_SIZE (Pmode);
1675     }
1676
1677   /* All arguments and registers used for the call are set up by now!  */
1678   function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0);
1679
1680   /* Ensure address is valid.  SYMBOL_REF is already valid, so no need,
1681      and we don't want to load it into a register as an optimization,
1682      because prepare_call_address already did it if it should be done.  */
1683   if (GET_CODE (function) != SYMBOL_REF)
1684     function = memory_address (FUNCTION_MODE, function);
1685
1686   /* Generate the actual call instruction and save the return value.  */
1687   if (targetm.have_untyped_call ())
1688     {
1689       rtx mem = gen_rtx_MEM (FUNCTION_MODE, function);
1690       emit_call_insn (targetm.gen_untyped_call (mem, result,
1691                                                 result_vector (1, result)));
1692     }
1693   else if (targetm.have_call_value ())
1694     {
1695       rtx valreg = 0;
1696
1697       /* Locate the unique return register.  It is not possible to
1698          express a call that sets more than one return register using
1699          call_value; use untyped_call for that.  In fact, untyped_call
1700          only needs to save the return registers in the given block.  */
1701       for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1702         if ((mode = apply_result_mode[regno]) != VOIDmode)
1703           {
1704             gcc_assert (!valreg); /* have_untyped_call required.  */
1705
1706             valreg = gen_rtx_REG (mode, regno);
1707           }
1708
1709       emit_insn (targetm.gen_call_value (valreg,
1710                                          gen_rtx_MEM (FUNCTION_MODE, function),
1711                                          const0_rtx, NULL_RTX, const0_rtx));
1712
1713       emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1714     }
1715   else
1716     gcc_unreachable ();
1717
1718   /* Find the CALL insn we just emitted, and attach the register usage
1719      information.  */
1720   call_insn = last_call_insn ();
1721   add_function_usage_to (call_insn, call_fusage);
1722
1723   /* Restore the stack.  */
1724   if (targetm.have_save_stack_nonlocal ())
1725     emit_stack_restore (SAVE_NONLOCAL, old_stack_level);
1726   else
1727     emit_stack_restore (SAVE_BLOCK, old_stack_level);
1728   fixup_args_size_notes (call_insn, get_last_insn (), 0);
1729
1730   OK_DEFER_POP;
1731
1732   /* Return the address of the result block.  */
1733   result = copy_addr_to_reg (XEXP (result, 0));
1734   return convert_memory_address (ptr_mode, result);
1735 }
1736
1737 /* Perform an untyped return.  */
1738
1739 static void
1740 expand_builtin_return (rtx result)
1741 {
1742   int size, align, regno;
1743   machine_mode mode;
1744   rtx reg;
1745   rtx_insn *call_fusage = 0;
1746
1747   result = convert_memory_address (Pmode, result);
1748
1749   apply_result_size ();
1750   result = gen_rtx_MEM (BLKmode, result);
1751
1752   if (targetm.have_untyped_return ())
1753     {
1754       rtx vector = result_vector (0, result);
1755       emit_jump_insn (targetm.gen_untyped_return (result, vector));
1756       emit_barrier ();
1757       return;
1758     }
1759
1760   /* Restore the return value and note that each value is used.  */
1761   size = 0;
1762   for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1763     if ((mode = apply_result_mode[regno]) != VOIDmode)
1764       {
1765         align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1766         if (size % align != 0)
1767           size = CEIL (size, align) * align;
1768         reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1769         emit_move_insn (reg, adjust_address (result, mode, size));
1770
1771         push_to_sequence (call_fusage);
1772         emit_use (reg);
1773         call_fusage = get_insns ();
1774         end_sequence ();
1775         size += GET_MODE_SIZE (mode);
1776       }
1777
1778   /* Put the USE insns before the return.  */
1779   emit_insn (call_fusage);
1780
1781   /* Return whatever values was restored by jumping directly to the end
1782      of the function.  */
1783   expand_naked_return ();
1784 }
1785
1786 /* Used by expand_builtin_classify_type and fold_builtin_classify_type.  */
1787
1788 static enum type_class
1789 type_to_class (tree type)
1790 {
1791   switch (TREE_CODE (type))
1792     {
1793     case VOID_TYPE:        return void_type_class;
1794     case INTEGER_TYPE:     return integer_type_class;
1795     case ENUMERAL_TYPE:    return enumeral_type_class;
1796     case BOOLEAN_TYPE:     return boolean_type_class;
1797     case POINTER_TYPE:     return pointer_type_class;
1798     case REFERENCE_TYPE:   return reference_type_class;
1799     case OFFSET_TYPE:      return offset_type_class;
1800     case REAL_TYPE:        return real_type_class;
1801     case COMPLEX_TYPE:     return complex_type_class;
1802     case FUNCTION_TYPE:    return function_type_class;
1803     case METHOD_TYPE:      return method_type_class;
1804     case RECORD_TYPE:      return record_type_class;
1805     case UNION_TYPE:
1806     case QUAL_UNION_TYPE:  return union_type_class;
1807     case ARRAY_TYPE:       return (TYPE_STRING_FLAG (type)
1808                                    ? string_type_class : array_type_class);
1809     case LANG_TYPE:        return lang_type_class;
1810     default:               return no_type_class;
1811     }
1812 }
1813
1814 /* Expand a call EXP to __builtin_classify_type.  */
1815
1816 static rtx
1817 expand_builtin_classify_type (tree exp)
1818 {
1819   if (call_expr_nargs (exp))
1820     return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0))));
1821   return GEN_INT (no_type_class);
1822 }
1823
1824 /* This helper macro, meant to be used in mathfn_built_in below, determines
1825    which among a set of builtin math functions is appropriate for a given type
1826    mode.  The `F' (float) and `L' (long double) are automatically generated
1827    from the 'double' case.  If a function supports the _Float<N> and _Float<N>X
1828    types, there are additional types that are considered with 'F32', 'F64',
1829    'F128', etc. suffixes.  */
1830 #define CASE_MATHFN(MATHFN) \
1831   CASE_CFN_##MATHFN: \
1832   fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1833   fcodel = BUILT_IN_##MATHFN##L ; break;
1834 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1835    types.  */
1836 #define CASE_MATHFN_FLOATN(MATHFN) \
1837   CASE_CFN_##MATHFN: \
1838   fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1839   fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1840   fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1841   fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1842   fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1843   break;
1844 /* Similar to above, but appends _R after any F/L suffix.  */
1845 #define CASE_MATHFN_REENT(MATHFN) \
1846   case CFN_BUILT_IN_##MATHFN##_R: \
1847   case CFN_BUILT_IN_##MATHFN##F_R: \
1848   case CFN_BUILT_IN_##MATHFN##L_R: \
1849   fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1850   fcodel = BUILT_IN_##MATHFN##L_R ; break;
1851
1852 /* Return a function equivalent to FN but operating on floating-point
1853    values of type TYPE, or END_BUILTINS if no such function exists.
1854    This is purely an operation on function codes; it does not guarantee
1855    that the target actually has an implementation of the function.  */
1856
1857 static built_in_function
1858 mathfn_built_in_2 (tree type, combined_fn fn)
1859 {
1860   tree mtype;
1861   built_in_function fcode, fcodef, fcodel;
1862   built_in_function fcodef16 = END_BUILTINS;
1863   built_in_function fcodef32 = END_BUILTINS;
1864   built_in_function fcodef64 = END_BUILTINS;
1865   built_in_function fcodef128 = END_BUILTINS;
1866   built_in_function fcodef32x = END_BUILTINS;
1867   built_in_function fcodef64x = END_BUILTINS;
1868   built_in_function fcodef128x = END_BUILTINS;
1869
1870   switch (fn)
1871     {
1872     CASE_MATHFN (ACOS)
1873     CASE_MATHFN (ACOSH)
1874     CASE_MATHFN (ASIN)
1875     CASE_MATHFN (ASINH)
1876     CASE_MATHFN (ATAN)
1877     CASE_MATHFN (ATAN2)
1878     CASE_MATHFN (ATANH)
1879     CASE_MATHFN (CBRT)
1880     CASE_MATHFN_FLOATN (CEIL)
1881     CASE_MATHFN (CEXPI)
1882     CASE_MATHFN_FLOATN (COPYSIGN)
1883     CASE_MATHFN (COS)
1884     CASE_MATHFN (COSH)
1885     CASE_MATHFN (DREM)
1886     CASE_MATHFN (ERF)
1887     CASE_MATHFN (ERFC)
1888     CASE_MATHFN (EXP)
1889     CASE_MATHFN (EXP10)
1890     CASE_MATHFN (EXP2)
1891     CASE_MATHFN (EXPM1)
1892     CASE_MATHFN (FABS)
1893     CASE_MATHFN (FDIM)
1894     CASE_MATHFN_FLOATN (FLOOR)
1895     CASE_MATHFN_FLOATN (FMA)
1896     CASE_MATHFN_FLOATN (FMAX)
1897     CASE_MATHFN_FLOATN (FMIN)
1898     CASE_MATHFN (FMOD)
1899     CASE_MATHFN (FREXP)
1900     CASE_MATHFN (GAMMA)
1901     CASE_MATHFN_REENT (GAMMA) /* GAMMA_R */
1902     CASE_MATHFN (HUGE_VAL)
1903     CASE_MATHFN (HYPOT)
1904     CASE_MATHFN (ILOGB)
1905     CASE_MATHFN (ICEIL)
1906     CASE_MATHFN (IFLOOR)
1907     CASE_MATHFN (INF)
1908     CASE_MATHFN (IRINT)
1909     CASE_MATHFN (IROUND)
1910     CASE_MATHFN (ISINF)
1911     CASE_MATHFN (J0)
1912     CASE_MATHFN (J1)
1913     CASE_MATHFN (JN)
1914     CASE_MATHFN (LCEIL)
1915     CASE_MATHFN (LDEXP)
1916     CASE_MATHFN (LFLOOR)
1917     CASE_MATHFN (LGAMMA)
1918     CASE_MATHFN_REENT (LGAMMA) /* LGAMMA_R */
1919     CASE_MATHFN (LLCEIL)
1920     CASE_MATHFN (LLFLOOR)
1921     CASE_MATHFN (LLRINT)
1922     CASE_MATHFN (LLROUND)
1923     CASE_MATHFN (LOG)
1924     CASE_MATHFN (LOG10)
1925     CASE_MATHFN (LOG1P)
1926     CASE_MATHFN (LOG2)
1927     CASE_MATHFN (LOGB)
1928     CASE_MATHFN (LRINT)
1929     CASE_MATHFN (LROUND)
1930     CASE_MATHFN (MODF)
1931     CASE_MATHFN (NAN)
1932     CASE_MATHFN (NANS)
1933     CASE_MATHFN_FLOATN (NEARBYINT)
1934     CASE_MATHFN (NEXTAFTER)
1935     CASE_MATHFN (NEXTTOWARD)
1936     CASE_MATHFN (POW)
1937     CASE_MATHFN (POWI)
1938     CASE_MATHFN (POW10)
1939     CASE_MATHFN (REMAINDER)
1940     CASE_MATHFN (REMQUO)
1941     CASE_MATHFN_FLOATN (RINT)
1942     CASE_MATHFN_FLOATN (ROUND)
1943     CASE_MATHFN (SCALB)
1944     CASE_MATHFN (SCALBLN)
1945     CASE_MATHFN (SCALBN)
1946     CASE_MATHFN (SIGNBIT)
1947     CASE_MATHFN (SIGNIFICAND)
1948     CASE_MATHFN (SIN)
1949     CASE_MATHFN (SINCOS)
1950     CASE_MATHFN (SINH)
1951     CASE_MATHFN_FLOATN (SQRT)
1952     CASE_MATHFN (TAN)
1953     CASE_MATHFN (TANH)
1954     CASE_MATHFN (TGAMMA)
1955     CASE_MATHFN_FLOATN (TRUNC)
1956     CASE_MATHFN (Y0)
1957     CASE_MATHFN (Y1)
1958     CASE_MATHFN (YN)
1959
1960     default:
1961       return END_BUILTINS;
1962     }
1963
1964   mtype = TYPE_MAIN_VARIANT (type);
1965   if (mtype == double_type_node)
1966     return fcode;
1967   else if (mtype == float_type_node)
1968     return fcodef;
1969   else if (mtype == long_double_type_node)
1970     return fcodel;
1971   else if (mtype == float16_type_node)
1972     return fcodef16;
1973   else if (mtype == float32_type_node)
1974     return fcodef32;
1975   else if (mtype == float64_type_node)
1976     return fcodef64;
1977   else if (mtype == float128_type_node)
1978     return fcodef128;
1979   else if (mtype == float32x_type_node)
1980     return fcodef32x;
1981   else if (mtype == float64x_type_node)
1982     return fcodef64x;
1983   else if (mtype == float128x_type_node)
1984     return fcodef128x;
1985   else
1986     return END_BUILTINS;
1987 }
1988
1989 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1990    if available.  If IMPLICIT_P is true use the implicit builtin declaration,
1991    otherwise use the explicit declaration.  If we can't do the conversion,
1992    return null.  */
1993
1994 static tree
1995 mathfn_built_in_1 (tree type, combined_fn fn, bool implicit_p)
1996 {
1997   built_in_function fcode2 = mathfn_built_in_2 (type, fn);
1998   if (fcode2 == END_BUILTINS)
1999     return NULL_TREE;
2000
2001   if (implicit_p && !builtin_decl_implicit_p (fcode2))
2002     return NULL_TREE;
2003
2004   return builtin_decl_explicit (fcode2);
2005 }
2006
2007 /* Like mathfn_built_in_1, but always use the implicit array.  */
2008
2009 tree
2010 mathfn_built_in (tree type, combined_fn fn)
2011 {
2012   return mathfn_built_in_1 (type, fn, /*implicit=*/ 1);
2013 }
2014
2015 /* Like mathfn_built_in_1, but take a built_in_function and
2016    always use the implicit array.  */
2017
2018 tree
2019 mathfn_built_in (tree type, enum built_in_function fn)
2020 {
2021   return mathfn_built_in_1 (type, as_combined_fn (fn), /*implicit=*/ 1);
2022 }
2023
2024 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2025    return its code, otherwise return IFN_LAST.  Note that this function
2026    only tests whether the function is defined in internals.def, not whether
2027    it is actually available on the target.  */
2028
2029 internal_fn
2030 associated_internal_fn (tree fndecl)
2031 {
2032   gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL);
2033   tree return_type = TREE_TYPE (TREE_TYPE (fndecl));
2034   switch (DECL_FUNCTION_CODE (fndecl))
2035     {
2036 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2037     CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2038 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2039     CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2040     CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2041 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2042     CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2043 #include "internal-fn.def"
2044
2045     CASE_FLT_FN (BUILT_IN_POW10):
2046       return IFN_EXP10;
2047
2048     CASE_FLT_FN (BUILT_IN_DREM):
2049       return IFN_REMAINDER;
2050
2051     CASE_FLT_FN (BUILT_IN_SCALBN):
2052     CASE_FLT_FN (BUILT_IN_SCALBLN):
2053       if (REAL_MODE_FORMAT (TYPE_MODE (return_type))->b == 2)
2054         return IFN_LDEXP;
2055       return IFN_LAST;
2056
2057     default:
2058       return IFN_LAST;
2059     }
2060 }
2061
2062 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2063    on the current target by a call to an internal function, return the
2064    code of that internal function, otherwise return IFN_LAST.  The caller
2065    is responsible for ensuring that any side-effects of the built-in
2066    call are dealt with correctly.  E.g. if CALL sets errno, the caller
2067    must decide that the errno result isn't needed or make it available
2068    in some other way.  */
2069
2070 internal_fn
2071 replacement_internal_fn (gcall *call)
2072 {
2073   if (gimple_call_builtin_p (call, BUILT_IN_NORMAL))
2074     {
2075       internal_fn ifn = associated_internal_fn (gimple_call_fndecl (call));
2076       if (ifn != IFN_LAST)
2077         {
2078           tree_pair types = direct_internal_fn_types (ifn, call);
2079           optimization_type opt_type = bb_optimization_type (gimple_bb (call));
2080           if (direct_internal_fn_supported_p (ifn, types, opt_type))
2081             return ifn;
2082         }
2083     }
2084   return IFN_LAST;
2085 }
2086
2087 /* Expand a call to the builtin trinary math functions (fma).
2088    Return NULL_RTX if a normal call should be emitted rather than expanding the
2089    function in-line.  EXP is the expression that is a call to the builtin
2090    function; if convenient, the result should be placed in TARGET.
2091    SUBTARGET may be used as the target for computing one of EXP's
2092    operands.  */
2093
2094 static rtx
2095 expand_builtin_mathfn_ternary (tree exp, rtx target, rtx subtarget)
2096 {
2097   optab builtin_optab;
2098   rtx op0, op1, op2, result;
2099   rtx_insn *insns;
2100   tree fndecl = get_callee_fndecl (exp);
2101   tree arg0, arg1, arg2;
2102   machine_mode mode;
2103
2104   if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2105     return NULL_RTX;
2106
2107   arg0 = CALL_EXPR_ARG (exp, 0);
2108   arg1 = CALL_EXPR_ARG (exp, 1);
2109   arg2 = CALL_EXPR_ARG (exp, 2);
2110
2111   switch (DECL_FUNCTION_CODE (fndecl))
2112     {
2113     CASE_FLT_FN (BUILT_IN_FMA):
2114     CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
2115       builtin_optab = fma_optab; break;
2116     default:
2117       gcc_unreachable ();
2118     }
2119
2120   /* Make a suitable register to place result in.  */
2121   mode = TYPE_MODE (TREE_TYPE (exp));
2122
2123   /* Before working hard, check whether the instruction is available.  */
2124   if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2125     return NULL_RTX;
2126
2127   result = gen_reg_rtx (mode);
2128
2129   /* Always stabilize the argument list.  */
2130   CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2131   CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2132   CALL_EXPR_ARG (exp, 2) = arg2 = builtin_save_expr (arg2);
2133
2134   op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2135   op1 = expand_normal (arg1);
2136   op2 = expand_normal (arg2);
2137
2138   start_sequence ();
2139
2140   /* Compute into RESULT.
2141      Set RESULT to wherever the result comes back.  */
2142   result = expand_ternary_op (mode, builtin_optab, op0, op1, op2,
2143                               result, 0);
2144
2145   /* If we were unable to expand via the builtin, stop the sequence
2146      (without outputting the insns) and call to the library function
2147      with the stabilized argument list.  */
2148   if (result == 0)
2149     {
2150       end_sequence ();
2151       return expand_call (exp, target, target == const0_rtx);
2152     }
2153
2154   /* Output the entire sequence.  */
2155   insns = get_insns ();
2156   end_sequence ();
2157   emit_insn (insns);
2158
2159   return result;
2160 }
2161
2162 /* Expand a call to the builtin sin and cos math functions.
2163    Return NULL_RTX if a normal call should be emitted rather than expanding the
2164    function in-line.  EXP is the expression that is a call to the builtin
2165    function; if convenient, the result should be placed in TARGET.
2166    SUBTARGET may be used as the target for computing one of EXP's
2167    operands.  */
2168
2169 static rtx
2170 expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2171 {
2172   optab builtin_optab;
2173   rtx op0;
2174   rtx_insn *insns;
2175   tree fndecl = get_callee_fndecl (exp);
2176   machine_mode mode;
2177   tree arg;
2178
2179   if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2180     return NULL_RTX;
2181
2182   arg = CALL_EXPR_ARG (exp, 0);
2183
2184   switch (DECL_FUNCTION_CODE (fndecl))
2185     {
2186     CASE_FLT_FN (BUILT_IN_SIN):
2187     CASE_FLT_FN (BUILT_IN_COS):
2188       builtin_optab = sincos_optab; break;
2189     default:
2190       gcc_unreachable ();
2191     }
2192
2193   /* Make a suitable register to place result in.  */
2194   mode = TYPE_MODE (TREE_TYPE (exp));
2195
2196   /* Check if sincos insn is available, otherwise fallback
2197      to sin or cos insn.  */
2198   if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2199     switch (DECL_FUNCTION_CODE (fndecl))
2200       {
2201       CASE_FLT_FN (BUILT_IN_SIN):
2202         builtin_optab = sin_optab; break;
2203       CASE_FLT_FN (BUILT_IN_COS):
2204         builtin_optab = cos_optab; break;
2205       default:
2206         gcc_unreachable ();
2207       }
2208
2209   /* Before working hard, check whether the instruction is available.  */
2210   if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing)
2211     {
2212       rtx result = gen_reg_rtx (mode);
2213
2214       /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2215          need to expand the argument again.  This way, we will not perform
2216          side-effects more the once.  */
2217       CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2218
2219       op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2220
2221       start_sequence ();
2222
2223       /* Compute into RESULT.
2224          Set RESULT to wherever the result comes back.  */
2225       if (builtin_optab == sincos_optab)
2226         {
2227           int ok;
2228
2229           switch (DECL_FUNCTION_CODE (fndecl))
2230             {
2231             CASE_FLT_FN (BUILT_IN_SIN):
2232               ok = expand_twoval_unop (builtin_optab, op0, 0, result, 0);
2233               break;
2234             CASE_FLT_FN (BUILT_IN_COS):
2235               ok = expand_twoval_unop (builtin_optab, op0, result, 0, 0);
2236               break;
2237             default:
2238               gcc_unreachable ();
2239             }
2240           gcc_assert (ok);
2241         }
2242       else
2243         result = expand_unop (mode, builtin_optab, op0, result, 0);
2244
2245       if (result != 0)
2246         {
2247           /* Output the entire sequence.  */
2248           insns = get_insns ();
2249           end_sequence ();
2250           emit_insn (insns);
2251           return result;
2252         }
2253
2254       /* If we were unable to expand via the builtin, stop the sequence
2255          (without outputting the insns) and call to the library function
2256          with the stabilized argument list.  */
2257       end_sequence ();
2258     }
2259
2260   return expand_call (exp, target, target == const0_rtx);
2261 }
2262
2263 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2264    return an RTL instruction code that implements the functionality.
2265    If that isn't possible or available return CODE_FOR_nothing.  */
2266
2267 static enum insn_code
2268 interclass_mathfn_icode (tree arg, tree fndecl)
2269 {
2270   bool errno_set = false;
2271   optab builtin_optab = unknown_optab;
2272   machine_mode mode;
2273
2274   switch (DECL_FUNCTION_CODE (fndecl))
2275     {
2276     CASE_FLT_FN (BUILT_IN_ILOGB):
2277       errno_set = true; builtin_optab = ilogb_optab; break;
2278     CASE_FLT_FN (BUILT_IN_ISINF):
2279       builtin_optab = isinf_optab; break;
2280     case BUILT_IN_ISNORMAL:
2281     case BUILT_IN_ISFINITE:
2282     CASE_FLT_FN (BUILT_IN_FINITE):
2283     case BUILT_IN_FINITED32:
2284     case BUILT_IN_FINITED64:
2285     case BUILT_IN_FINITED128:
2286     case BUILT_IN_ISINFD32:
2287     case BUILT_IN_ISINFD64:
2288     case BUILT_IN_ISINFD128:
2289       /* These builtins have no optabs (yet).  */
2290       break;
2291     default:
2292       gcc_unreachable ();
2293     }
2294
2295   /* There's no easy way to detect the case we need to set EDOM.  */
2296   if (flag_errno_math && errno_set)
2297     return CODE_FOR_nothing;
2298
2299   /* Optab mode depends on the mode of the input argument.  */
2300   mode = TYPE_MODE (TREE_TYPE (arg));
2301
2302   if (builtin_optab)
2303     return optab_handler (builtin_optab, mode);
2304   return CODE_FOR_nothing;
2305 }
2306
2307 /* Expand a call to one of the builtin math functions that operate on
2308    floating point argument and output an integer result (ilogb, isinf,
2309    isnan, etc).
2310    Return 0 if a normal call should be emitted rather than expanding the
2311    function in-line.  EXP is the expression that is a call to the builtin
2312    function; if convenient, the result should be placed in TARGET.  */
2313
2314 static rtx
2315 expand_builtin_interclass_mathfn (tree exp, rtx target)
2316 {
2317   enum insn_code icode = CODE_FOR_nothing;
2318   rtx op0;
2319   tree fndecl = get_callee_fndecl (exp);
2320   machine_mode mode;
2321   tree arg;
2322
2323   if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2324     return NULL_RTX;
2325
2326   arg = CALL_EXPR_ARG (exp, 0);
2327   icode = interclass_mathfn_icode (arg, fndecl);
2328   mode = TYPE_MODE (TREE_TYPE (arg));
2329
2330   if (icode != CODE_FOR_nothing)
2331     {
2332       struct expand_operand ops[1];
2333       rtx_insn *last = get_last_insn ();
2334       tree orig_arg = arg;
2335
2336       /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2337          need to expand the argument again.  This way, we will not perform
2338          side-effects more the once.  */
2339       CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2340
2341       op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2342
2343       if (mode != GET_MODE (op0))
2344         op0 = convert_to_mode (mode, op0, 0);
2345
2346       create_output_operand (&ops[0], target, TYPE_MODE (TREE_TYPE (exp)));
2347       if (maybe_legitimize_operands (icode, 0, 1, ops)
2348           && maybe_emit_unop_insn (icode, ops[0].value, op0, UNKNOWN))
2349         return ops[0].value;
2350
2351       delete_insns_since (last);
2352       CALL_EXPR_ARG (exp, 0) = orig_arg;
2353     }
2354
2355   return NULL_RTX;
2356 }
2357
2358 /* Expand a call to the builtin sincos math function.
2359    Return NULL_RTX if a normal call should be emitted rather than expanding the
2360    function in-line.  EXP is the expression that is a call to the builtin
2361    function.  */
2362
2363 static rtx
2364 expand_builtin_sincos (tree exp)
2365 {
2366   rtx op0, op1, op2, target1, target2;
2367   machine_mode mode;
2368   tree arg, sinp, cosp;
2369   int result;
2370   location_t loc = EXPR_LOCATION (exp);
2371   tree alias_type, alias_off;
2372
2373   if (!validate_arglist (exp, REAL_TYPE,
2374                          POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2375     return NULL_RTX;
2376
2377   arg = CALL_EXPR_ARG (exp, 0);
2378   sinp = CALL_EXPR_ARG (exp, 1);
2379   cosp = CALL_EXPR_ARG (exp, 2);
2380
2381   /* Make a suitable register to place result in.  */
2382   mode = TYPE_MODE (TREE_TYPE (arg));
2383
2384   /* Check if sincos insn is available, otherwise emit the call.  */
2385   if (optab_handler (sincos_optab, mode) == CODE_FOR_nothing)
2386     return NULL_RTX;
2387
2388   target1 = gen_reg_rtx (mode);
2389   target2 = gen_reg_rtx (mode);
2390
2391   op0 = expand_normal (arg);
2392   alias_type = build_pointer_type_for_mode (TREE_TYPE (arg), ptr_mode, true);
2393   alias_off = build_int_cst (alias_type, 0);
2394   op1 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2395                                         sinp, alias_off));
2396   op2 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2397                                         cosp, alias_off));
2398
2399   /* Compute into target1 and target2.
2400      Set TARGET to wherever the result comes back.  */
2401   result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2402   gcc_assert (result);
2403
2404   /* Move target1 and target2 to the memory locations indicated
2405      by op1 and op2.  */
2406   emit_move_insn (op1, target1);
2407   emit_move_insn (op2, target2);
2408
2409   return const0_rtx;
2410 }
2411
2412 /* Expand a call to the internal cexpi builtin to the sincos math function.
2413    EXP is the expression that is a call to the builtin function; if convenient,
2414    the result should be placed in TARGET.  */
2415
2416 static rtx
2417 expand_builtin_cexpi (tree exp, rtx target)
2418 {
2419   tree fndecl = get_callee_fndecl (exp);
2420   tree arg, type;
2421   machine_mode mode;
2422   rtx op0, op1, op2;
2423   location_t loc = EXPR_LOCATION (exp);
2424
2425   if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2426     return NULL_RTX;
2427
2428   arg = CALL_EXPR_ARG (exp, 0);
2429   type = TREE_TYPE (arg);
2430   mode = TYPE_MODE (TREE_TYPE (arg));
2431
2432   /* Try expanding via a sincos optab, fall back to emitting a libcall
2433      to sincos or cexp.  We are sure we have sincos or cexp because cexpi
2434      is only generated from sincos, cexp or if we have either of them.  */
2435   if (optab_handler (sincos_optab, mode) != CODE_FOR_nothing)
2436     {
2437       op1 = gen_reg_rtx (mode);
2438       op2 = gen_reg_rtx (mode);
2439
2440       op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2441
2442       /* Compute into op1 and op2.  */
2443       expand_twoval_unop (sincos_optab, op0, op2, op1, 0);
2444     }
2445   else if (targetm.libc_has_function (function_sincos))
2446     {
2447       tree call, fn = NULL_TREE;
2448       tree top1, top2;
2449       rtx op1a, op2a;
2450
2451       if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2452         fn = builtin_decl_explicit (BUILT_IN_SINCOSF);
2453       else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2454         fn = builtin_decl_explicit (BUILT_IN_SINCOS);
2455       else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2456         fn = builtin_decl_explicit (BUILT_IN_SINCOSL);
2457       else
2458         gcc_unreachable ();
2459
2460       op1 = assign_temp (TREE_TYPE (arg), 1, 1);
2461       op2 = assign_temp (TREE_TYPE (arg), 1, 1);
2462       op1a = copy_addr_to_reg (XEXP (op1, 0));
2463       op2a = copy_addr_to_reg (XEXP (op2, 0));
2464       top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2465       top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2466
2467       /* Make sure not to fold the sincos call again.  */
2468       call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2469       expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)),
2470                                       call, 3, arg, top1, top2));
2471     }
2472   else
2473     {
2474       tree call, fn = NULL_TREE, narg;
2475       tree ctype = build_complex_type (type);
2476
2477       if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2478         fn = builtin_decl_explicit (BUILT_IN_CEXPF);
2479       else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2480         fn = builtin_decl_explicit (BUILT_IN_CEXP);
2481       else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2482         fn = builtin_decl_explicit (BUILT_IN_CEXPL);
2483       else
2484         gcc_unreachable ();
2485
2486       /* If we don't have a decl for cexp create one.  This is the
2487          friendliest fallback if the user calls __builtin_cexpi
2488          without full target C99 function support.  */
2489       if (fn == NULL_TREE)
2490         {
2491           tree fntype;
2492           const char *name = NULL;
2493
2494           if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2495             name = "cexpf";
2496           else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2497             name = "cexp";
2498           else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2499             name = "cexpl";
2500
2501           fntype = build_function_type_list (ctype, ctype, NULL_TREE);
2502           fn = build_fn_decl (name, fntype);
2503         }
2504
2505       narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype,
2506                           build_real (type, dconst0), arg);
2507
2508       /* Make sure not to fold the cexp call again.  */
2509       call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2510       return expand_expr (build_call_nary (ctype, call, 1, narg),
2511                           target, VOIDmode, EXPAND_NORMAL);
2512     }
2513
2514   /* Now build the proper return type.  */
2515   return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2516                               make_tree (TREE_TYPE (arg), op2),
2517                               make_tree (TREE_TYPE (arg), op1)),
2518                       target, VOIDmode, EXPAND_NORMAL);
2519 }
2520
2521 /* Conveniently construct a function call expression.  FNDECL names the
2522    function to be called, N is the number of arguments, and the "..."
2523    parameters are the argument expressions.  Unlike build_call_exr
2524    this doesn't fold the call, hence it will always return a CALL_EXPR.  */
2525
2526 static tree
2527 build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2528 {
2529   va_list ap;
2530   tree fntype = TREE_TYPE (fndecl);
2531   tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2532
2533   va_start (ap, n);
2534   fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2535   va_end (ap);
2536   SET_EXPR_LOCATION (fn, loc);
2537   return fn;
2538 }
2539
2540 /* Expand a call to one of the builtin rounding functions gcc defines
2541    as an extension (lfloor and lceil).  As these are gcc extensions we
2542    do not need to worry about setting errno to EDOM.
2543    If expanding via optab fails, lower expression to (int)(floor(x)).
2544    EXP is the expression that is a call to the builtin function;
2545    if convenient, the result should be placed in TARGET.  */
2546
2547 static rtx
2548 expand_builtin_int_roundingfn (tree exp, rtx target)
2549 {
2550   convert_optab builtin_optab;
2551   rtx op0, tmp;
2552   rtx_insn *insns;
2553   tree fndecl = get_callee_fndecl (exp);
2554   enum built_in_function fallback_fn;
2555   tree fallback_fndecl;
2556   machine_mode mode;
2557   tree arg;
2558
2559   if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2560     gcc_unreachable ();
2561
2562   arg = CALL_EXPR_ARG (exp, 0);
2563
2564   switch (DECL_FUNCTION_CODE (fndecl))
2565     {
2566     CASE_FLT_FN (BUILT_IN_ICEIL):
2567     CASE_FLT_FN (BUILT_IN_LCEIL):
2568     CASE_FLT_FN (BUILT_IN_LLCEIL):
2569       builtin_optab = lceil_optab;
2570       fallback_fn = BUILT_IN_CEIL;
2571       break;
2572
2573     CASE_FLT_FN (BUILT_IN_IFLOOR):
2574     CASE_FLT_FN (BUILT_IN_LFLOOR):
2575     CASE_FLT_FN (BUILT_IN_LLFLOOR):
2576       builtin_optab = lfloor_optab;
2577       fallback_fn = BUILT_IN_FLOOR;
2578       break;
2579
2580     default:
2581       gcc_unreachable ();
2582     }
2583
2584   /* Make a suitable register to place result in.  */
2585   mode = TYPE_MODE (TREE_TYPE (exp));
2586
2587   target = gen_reg_rtx (mode);
2588
2589   /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2590      need to expand the argument again.  This way, we will not perform
2591      side-effects more the once.  */
2592   CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2593
2594   op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2595
2596   start_sequence ();
2597
2598   /* Compute into TARGET.  */
2599   if (expand_sfix_optab (target, op0, builtin_optab))
2600     {
2601       /* Output the entire sequence.  */
2602       insns = get_insns ();
2603       end_sequence ();
2604       emit_insn (insns);
2605       return target;
2606     }
2607
2608   /* If we were unable to expand via the builtin, stop the sequence
2609      (without outputting the insns).  */
2610   end_sequence ();
2611
2612   /* Fall back to floating point rounding optab.  */
2613   fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
2614
2615   /* For non-C99 targets we may end up without a fallback fndecl here
2616      if the user called __builtin_lfloor directly.  In this case emit
2617      a call to the floor/ceil variants nevertheless.  This should result
2618      in the best user experience for not full C99 targets.  */
2619   if (fallback_fndecl == NULL_TREE)
2620     {
2621       tree fntype;
2622       const char *name = NULL;
2623
2624       switch (DECL_FUNCTION_CODE (fndecl))
2625         {
2626         case BUILT_IN_ICEIL:
2627         case BUILT_IN_LCEIL:
2628         case BUILT_IN_LLCEIL:
2629           name = "ceil";
2630           break;
2631         case BUILT_IN_ICEILF:
2632         case BUILT_IN_LCEILF:
2633         case BUILT_IN_LLCEILF:
2634           name = "ceilf";
2635           break;
2636         case BUILT_IN_ICEILL:
2637         case BUILT_IN_LCEILL:
2638         case BUILT_IN_LLCEILL:
2639           name = "ceill";
2640           break;
2641         case BUILT_IN_IFLOOR:
2642         case BUILT_IN_LFLOOR:
2643         case BUILT_IN_LLFLOOR:
2644           name = "floor";
2645           break;
2646         case BUILT_IN_IFLOORF:
2647         case BUILT_IN_LFLOORF:
2648         case BUILT_IN_LLFLOORF:
2649           name = "floorf";
2650           break;
2651         case BUILT_IN_IFLOORL:
2652         case BUILT_IN_LFLOORL:
2653         case BUILT_IN_LLFLOORL:
2654           name = "floorl";
2655           break;
2656         default:
2657           gcc_unreachable ();
2658         }
2659
2660       fntype = build_function_type_list (TREE_TYPE (arg),
2661                                          TREE_TYPE (arg), NULL_TREE);
2662       fallback_fndecl = build_fn_decl (name, fntype);
2663     }
2664
2665   exp = build_call_nofold_loc (EXPR_LOCATION (exp), fallback_fndecl, 1, arg);
2666
2667   tmp = expand_normal (exp);
2668   tmp = maybe_emit_group_store (tmp, TREE_TYPE (exp));
2669
2670   /* Truncate the result of floating point optab to integer
2671      via expand_fix ().  */
2672   target = gen_reg_rtx (mode);
2673   expand_fix (target, tmp, 0);
2674
2675   return target;
2676 }
2677
2678 /* Expand a call to one of the builtin math functions doing integer
2679    conversion (lrint).
2680    Return 0 if a normal call should be emitted rather than expanding the
2681    function in-line.  EXP is the expression that is a call to the builtin
2682    function; if convenient, the result should be placed in TARGET.  */
2683
2684 static rtx
2685 expand_builtin_int_roundingfn_2 (tree exp, rtx target)
2686 {
2687   convert_optab builtin_optab;
2688   rtx op0;
2689   rtx_insn *insns;
2690   tree fndecl = get_callee_fndecl (exp);
2691   tree arg;
2692   machine_mode mode;
2693   enum built_in_function fallback_fn = BUILT_IN_NONE;
2694
2695   if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2696      gcc_unreachable ();
2697
2698   arg = CALL_EXPR_ARG (exp, 0);
2699
2700   switch (DECL_FUNCTION_CODE (fndecl))
2701     {
2702     CASE_FLT_FN (BUILT_IN_IRINT):
2703       fallback_fn = BUILT_IN_LRINT;
2704       gcc_fallthrough ();
2705     CASE_FLT_FN (BUILT_IN_LRINT):
2706     CASE_FLT_FN (BUILT_IN_LLRINT):
2707       builtin_optab = lrint_optab;
2708       break;
2709
2710     CASE_FLT_FN (BUILT_IN_IROUND):
2711       fallback_fn = BUILT_IN_LROUND;
2712       gcc_fallthrough ();
2713     CASE_FLT_FN (BUILT_IN_LROUND):
2714     CASE_FLT_FN (BUILT_IN_LLROUND):
2715       builtin_optab = lround_optab;
2716       break;
2717
2718     default:
2719       gcc_unreachable ();
2720     }
2721
2722   /* There's no easy way to detect the case we need to set EDOM.  */
2723   if (flag_errno_math && fallback_fn == BUILT_IN_NONE)
2724     return NULL_RTX;
2725
2726   /* Make a suitable register to place result in.  */
2727   mode = TYPE_MODE (TREE_TYPE (exp));
2728
2729   /* There's no easy way to detect the case we need to set EDOM.  */
2730   if (!flag_errno_math)
2731     {
2732       rtx result = gen_reg_rtx (mode);
2733
2734       /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2735          need to expand the argument again.  This way, we will not perform
2736          side-effects more the once.  */
2737       CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2738
2739       op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
2740
2741       start_sequence ();
2742
2743       if (expand_sfix_optab (result, op0, builtin_optab))
2744         {
2745           /* Output the entire sequence.  */
2746           insns = get_insns ();
2747           end_sequence ();
2748           emit_insn (insns);
2749           return result;
2750         }
2751
2752       /* If we were unable to expand via the builtin, stop the sequence
2753          (without outputting the insns) and call to the library function
2754          with the stabilized argument list.  */
2755       end_sequence ();
2756     }
2757
2758   if (fallback_fn != BUILT_IN_NONE)
2759     {
2760       /* Fall back to rounding to long int.  Use implicit_p 0 - for non-C99
2761          targets, (int) round (x) should never be transformed into
2762          BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2763          a call to lround in the hope that the target provides at least some
2764          C99 functions.  This should result in the best user experience for
2765          not full C99 targets.  */
2766       tree fallback_fndecl = mathfn_built_in_1
2767         (TREE_TYPE (arg), as_combined_fn (fallback_fn), 0);
2768
2769       exp = build_call_nofold_loc (EXPR_LOCATION (exp),
2770                                    fallback_fndecl, 1, arg);
2771
2772       target = expand_call (exp, NULL_RTX, target == const0_rtx);
2773       target = maybe_emit_group_store (target, TREE_TYPE (exp));
2774       return convert_to_mode (mode, target, 0);
2775     }
2776
2777   return expand_call (exp, target, target == const0_rtx);
2778 }
2779
2780 /* Expand a call to the powi built-in mathematical function.  Return NULL_RTX if
2781    a normal call should be emitted rather than expanding the function
2782    in-line.  EXP is the expression that is a call to the builtin
2783    function; if convenient, the result should be placed in TARGET.  */
2784
2785 static rtx
2786 expand_builtin_powi (tree exp, rtx target)
2787 {
2788   tree arg0, arg1;
2789   rtx op0, op1;
2790   machine_mode mode;
2791   machine_mode mode2;
2792
2793   if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
2794     return NULL_RTX;
2795
2796   arg0 = CALL_EXPR_ARG (exp, 0);
2797   arg1 = CALL_EXPR_ARG (exp, 1);
2798   mode = TYPE_MODE (TREE_TYPE (exp));
2799
2800   /* Emit a libcall to libgcc.  */
2801
2802   /* Mode of the 2nd argument must match that of an int.  */
2803   mode2 = int_mode_for_size (INT_TYPE_SIZE, 0).require ();
2804
2805   if (target == NULL_RTX)
2806     target = gen_reg_rtx (mode);
2807
2808   op0 = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL);
2809   if (GET_MODE (op0) != mode)
2810     op0 = convert_to_mode (mode, op0, 0);
2811   op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
2812   if (GET_MODE (op1) != mode2)
2813     op1 = convert_to_mode (mode2, op1, 0);
2814
2815   target = emit_library_call_value (optab_libfunc (powi_optab, mode),
2816                                     target, LCT_CONST, mode,
2817                                     op0, mode, op1, mode2);
2818
2819   return target;
2820 }
2821
2822 /* Expand expression EXP which is a call to the strlen builtin.  Return
2823    NULL_RTX if we failed the caller should emit a normal call, otherwise
2824    try to get the result in TARGET, if convenient.  */
2825
2826 static rtx
2827 expand_builtin_strlen (tree exp, rtx target,
2828                        machine_mode target_mode)
2829 {
2830   if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
2831     return NULL_RTX;
2832
2833   struct expand_operand ops[4];
2834   rtx pat;
2835   tree len;
2836   tree src = CALL_EXPR_ARG (exp, 0);
2837   rtx src_reg;
2838   rtx_insn *before_strlen;
2839   machine_mode insn_mode;
2840   enum insn_code icode = CODE_FOR_nothing;
2841   unsigned int align;
2842
2843   /* If the length can be computed at compile-time, return it.  */
2844   len = c_strlen (src, 0);
2845   if (len)
2846     return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2847
2848   /* If the length can be computed at compile-time and is constant
2849      integer, but there are side-effects in src, evaluate
2850      src for side-effects, then return len.
2851      E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2852      can be optimized into: i++; x = 3;  */
2853   len = c_strlen (src, 1);
2854   if (len && TREE_CODE (len) == INTEGER_CST)
2855     {
2856       expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
2857       return expand_expr (len, target, target_mode, EXPAND_NORMAL);
2858     }
2859
2860   align = get_pointer_alignment (src) / BITS_PER_UNIT;
2861
2862   /* If SRC is not a pointer type, don't do this operation inline.  */
2863   if (align == 0)
2864     return NULL_RTX;
2865
2866   /* Bail out if we can't compute strlen in the right mode.  */
2867   FOR_EACH_MODE_FROM (insn_mode, target_mode)
2868     {
2869       icode = optab_handler (strlen_optab, insn_mode);
2870       if (icode != CODE_FOR_nothing)
2871         break;
2872     }
2873   if (insn_mode == VOIDmode)
2874     return NULL_RTX;
2875
2876   /* Make a place to hold the source address.  We will not expand
2877      the actual source until we are sure that the expansion will
2878      not fail -- there are trees that cannot be expanded twice.  */
2879   src_reg = gen_reg_rtx (Pmode);
2880
2881   /* Mark the beginning of the strlen sequence so we can emit the
2882      source operand later.  */
2883   before_strlen = get_last_insn ();
2884
2885   create_output_operand (&ops[0], target, insn_mode);
2886   create_fixed_operand (&ops[1], gen_rtx_MEM (BLKmode, src_reg));
2887   create_integer_operand (&ops[2], 0);
2888   create_integer_operand (&ops[3], align);
2889   if (!maybe_expand_insn (icode, 4, ops))
2890     return NULL_RTX;
2891
2892   /* Check to see if the argument was declared attribute nonstring
2893      and if so, issue a warning since at this point it's not known
2894      to be nul-terminated.  */
2895   maybe_warn_nonstring_arg (get_callee_fndecl (exp), exp);
2896
2897   /* Now that we are assured of success, expand the source.  */
2898   start_sequence ();
2899   pat = expand_expr (src, src_reg, Pmode, EXPAND_NORMAL);
2900   if (pat != src_reg)
2901     {
2902 #ifdef POINTERS_EXTEND_UNSIGNED
2903       if (GET_MODE (pat) != Pmode)
2904         pat = convert_to_mode (Pmode, pat,
2905                                POINTERS_EXTEND_UNSIGNED);
2906 #endif
2907       emit_move_insn (src_reg, pat);
2908     }
2909   pat = get_insns ();
2910   end_sequence ();
2911
2912   if (before_strlen)
2913     emit_insn_after (pat, before_strlen);
2914   else
2915     emit_insn_before (pat, get_insns ());
2916
2917   /* Return the value in the proper mode for this function.  */
2918   if (GET_MODE (ops[0].value) == target_mode)
2919     target = ops[0].value;
2920   else if (target != 0)
2921     convert_move (target, ops[0].value, 0);
2922   else
2923     target = convert_to_mode (target_mode, ops[0].value, 0);
2924
2925   return target;
2926 }
2927
2928 /* Callback routine for store_by_pieces.  Read GET_MODE_BITSIZE (MODE)
2929    bytes from constant string DATA + OFFSET and return it as target
2930    constant.  */
2931
2932 static rtx
2933 builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset,
2934                          scalar_int_mode mode)
2935 {
2936   const char *str = (const char *) data;
2937
2938   gcc_assert (offset >= 0
2939               && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode)
2940                   <= strlen (str) + 1));
2941
2942   return c_readstr (str + offset, mode);
2943 }
2944
2945 /* LEN specify length of the block of memcpy/memset operation.
2946    Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2947    In some cases we can make very likely guess on max size, then we
2948    set it into PROBABLE_MAX_SIZE.  */
2949
2950 static void
2951 determine_block_size (tree len, rtx len_rtx,
2952                       unsigned HOST_WIDE_INT *min_size,
2953                       unsigned HOST_WIDE_INT *max_size,
2954                       unsigned HOST_WIDE_INT *probable_max_size)
2955 {
2956   if (CONST_INT_P (len_rtx))
2957     {
2958       *min_size = *max_size = *probable_max_size = UINTVAL (len_rtx);
2959       return;
2960     }
2961   else
2962     {
2963       wide_int min, max;
2964       enum value_range_type range_type = VR_UNDEFINED;
2965
2966       /* Determine bounds from the type.  */
2967       if (tree_fits_uhwi_p (TYPE_MIN_VALUE (TREE_TYPE (len))))
2968         *min_size = tree_to_uhwi (TYPE_MIN_VALUE (TREE_TYPE (len)));
2969       else
2970         *min_size = 0;
2971       if (tree_fits_uhwi_p (TYPE_MAX_VALUE (TREE_TYPE (len))))
2972         *probable_max_size = *max_size
2973           = tree_to_uhwi (TYPE_MAX_VALUE (TREE_TYPE (len)));
2974       else
2975         *probable_max_size = *max_size = GET_MODE_MASK (GET_MODE (len_rtx));
2976
2977       if (TREE_CODE (len) == SSA_NAME)
2978         range_type = get_range_info (len, &min, &max);
2979       if (range_type == VR_RANGE)
2980         {
2981           if (wi::fits_uhwi_p (min) && *min_size < min.to_uhwi ())
2982             *min_size = min.to_uhwi ();
2983           if (wi::fits_uhwi_p (max) && *max_size > max.to_uhwi ())
2984             *probable_max_size = *max_size = max.to_uhwi ();
2985         }
2986       else if (range_type == VR_ANTI_RANGE)
2987         {
2988           /* Anti range 0...N lets us to determine minimal size to N+1.  */
2989           if (min == 0)
2990             {
2991               if (wi::fits_uhwi_p (max) && max.to_uhwi () + 1 != 0)
2992                 *min_size = max.to_uhwi () + 1;
2993             }
2994           /* Code like
2995
2996              int n;
2997              if (n < 100)
2998                memcpy (a, b, n)
2999
3000              Produce anti range allowing negative values of N.  We still
3001              can use the information and make a guess that N is not negative.
3002              */
3003           else if (!wi::leu_p (max, 1 << 30) && wi::fits_uhwi_p (min))
3004             *probable_max_size = min.to_uhwi () - 1;
3005         }
3006     }
3007   gcc_checking_assert (*max_size <=
3008                        (unsigned HOST_WIDE_INT)
3009                           GET_MODE_MASK (GET_MODE (len_rtx)));
3010 }
3011
3012 /* Try to verify that the sizes and lengths of the arguments to a string
3013    manipulation function given by EXP are within valid bounds and that
3014    the operation does not lead to buffer overflow or read past the end.
3015    Arguments other than EXP may be null.  When non-null, the arguments
3016    have the following meaning:
3017    DST is the destination of a copy call or NULL otherwise.
3018    SRC is the source of a copy call or NULL otherwise.
3019    DSTWRITE is the number of bytes written into the destination obtained
3020    from the user-supplied size argument to the function (such as in
3021    memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3022    MAXREAD is the user-supplied bound on the length of the source sequence
3023    (such as in strncat(d, s, N).  It specifies the upper limit on the number
3024    of bytes to write.  If NULL, it's taken to be the same as DSTWRITE.
3025    SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3026    expression EXP is a string function call (as opposed to a memory call
3027    like memcpy).  As an exception, SRCSTR can also be an integer denoting
3028    the precomputed size of the source string or object (for functions like
3029    memcpy).
3030    DSTSIZE is the size of the destination object specified by the last
3031    argument to the _chk builtins, typically resulting from the expansion
3032    of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3033    DSTSIZE).
3034
3035    When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3036    SIZE_MAX.
3037
3038    If the call is successfully verified as safe return true, otherwise
3039    return false.  */
3040
3041 static bool
3042 check_access (tree exp, tree, tree, tree dstwrite,
3043               tree maxread, tree srcstr, tree dstsize)
3044 {
3045   int opt = OPT_Wstringop_overflow_;
3046
3047   /* The size of the largest object is half the address space, or
3048      PTRDIFF_MAX.  (This is way too permissive.)  */
3049   tree maxobjsize = max_object_size ();
3050
3051   /* Either the length of the source string for string functions or
3052      the size of the source object for raw memory functions.  */
3053   tree slen = NULL_TREE;
3054
3055   tree range[2] = { NULL_TREE, NULL_TREE };
3056
3057   /* Set to true when the exact number of bytes written by a string
3058      function like strcpy is not known and the only thing that is
3059      known is that it must be at least one (for the terminating nul).  */
3060   bool at_least_one = false;
3061   if (srcstr)
3062     {
3063       /* SRCSTR is normally a pointer to string but as a special case
3064          it can be an integer denoting the length of a string.  */
3065       if (POINTER_TYPE_P (TREE_TYPE (srcstr)))
3066         {
3067           /* Try to determine the range of lengths the source string
3068              refers to.  If it can be determined and is less than
3069              the upper bound given by MAXREAD add one to it for
3070              the terminating nul.  Otherwise, set it to one for
3071              the same reason, or to MAXREAD as appropriate.  */
3072           get_range_strlen (srcstr, range);
3073           if (range[0] && (!maxread || TREE_CODE (maxread) == INTEGER_CST))
3074             {
3075               if (maxread && tree_int_cst_le (maxread, range[0]))
3076                 range[0] = range[1] = maxread;
3077               else
3078                 range[0] = fold_build2 (PLUS_EXPR, size_type_node,
3079                                         range[0], size_one_node);
3080
3081               if (maxread && tree_int_cst_le (maxread, range[1]))
3082                 range[1] = maxread;
3083               else if (!integer_all_onesp (range[1]))
3084                 range[1] = fold_build2 (PLUS_EXPR, size_type_node,
3085                                         range[1], size_one_node);
3086
3087               slen = range[0];
3088             }
3089           else
3090             {
3091               at_least_one = true;
3092               slen = size_one_node;
3093             }
3094         }
3095       else
3096         slen = srcstr;
3097     }
3098
3099   if (!dstwrite && !maxread)
3100     {
3101       /* When the only available piece of data is the object size
3102          there is nothing to do.  */
3103       if (!slen)
3104         return true;
3105
3106       /* Otherwise, when the length of the source sequence is known
3107          (as with strlen), set DSTWRITE to it.  */
3108       if (!range[0])
3109         dstwrite = slen;
3110     }
3111
3112   if (!dstsize)
3113     dstsize = maxobjsize;
3114
3115   if (dstwrite)
3116     get_size_range (dstwrite, range);
3117
3118   tree func = get_callee_fndecl (exp);
3119
3120   /* First check the number of bytes to be written against the maximum
3121      object size.  */
3122   if (range[0] && tree_int_cst_lt (maxobjsize, range[0]))
3123     {
3124       location_t loc = tree_nonartificial_location (exp);
3125       loc = expansion_point_location_if_in_system_header (loc);
3126
3127       if (range[0] == range[1])
3128         warning_at (loc, opt,
3129                     "%K%qD specified size %E "
3130                     "exceeds maximum object size %E",
3131                     exp, func, range[0], maxobjsize);
3132           else
3133             warning_at (loc, opt,
3134                         "%K%qD specified size between %E and %E "
3135                         "exceeds maximum object size %E",
3136                         exp, func,
3137                         range[0], range[1], maxobjsize);
3138       return false;
3139     }
3140
3141   /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3142      constant, and in range of unsigned HOST_WIDE_INT.  */
3143   bool exactwrite = dstwrite && tree_fits_uhwi_p (dstwrite);
3144
3145   /* Next check the number of bytes to be written against the destination
3146      object size.  */
3147   if (range[0] || !exactwrite || integer_all_onesp (dstwrite))
3148     {
3149       if (range[0]
3150           && ((tree_fits_uhwi_p (dstsize)
3151                && tree_int_cst_lt (dstsize, range[0]))
3152               || (tree_fits_uhwi_p (dstwrite)
3153                   && tree_int_cst_lt (dstwrite, range[0]))))
3154         {
3155           location_t loc = tree_nonartificial_location (exp);
3156           loc = expansion_point_location_if_in_system_header (loc);
3157
3158           if (dstwrite == slen && at_least_one)
3159             {
3160               /* This is a call to strcpy with a destination of 0 size
3161                  and a source of unknown length.  The call will write
3162                  at least one byte past the end of the destination.  */
3163               warning_at (loc, opt,
3164                           "%K%qD writing %E or more bytes into a region "
3165                           "of size %E overflows the destination",
3166                           exp, func, range[0], dstsize);
3167             }
3168           else if (tree_int_cst_equal (range[0], range[1]))
3169             warning_at (loc, opt,
3170                         (integer_onep (range[0])
3171                          ? G_("%K%qD writing %E byte into a region "
3172                               "of size %E overflows the destination")
3173                          : G_("%K%qD writing %E bytes into a region "
3174                               "of size %E overflows the destination")),
3175                         exp, func, range[0], dstsize);
3176           else if (tree_int_cst_sign_bit (range[1]))
3177             {
3178               /* Avoid printing the upper bound if it's invalid.  */
3179               warning_at (loc, opt,
3180                           "%K%qD writing %E or more bytes into a region "
3181                           "of size %E overflows the destination",
3182                           exp, func, range[0], dstsize);
3183             }
3184           else
3185             warning_at (loc, opt,
3186                         "%K%qD writing between %E and %E bytes into "
3187                         "a region of size %E overflows the destination",
3188                         exp, func, range[0], range[1],
3189                         dstsize);
3190
3191           /* Return error when an overflow has been detected.  */
3192           return false;
3193         }
3194     }
3195
3196   /* Check the maximum length of the source sequence against the size
3197      of the destination object if known, or against the maximum size
3198      of an object.  */
3199   if (maxread)
3200     {
3201       get_size_range (maxread, range);
3202
3203       /* Use the lower end for MAXREAD from now on.  */
3204       if (range[0])
3205         maxread = range[0];
3206
3207       if (range[0] && dstsize && tree_fits_uhwi_p (dstsize))
3208         {
3209           location_t loc = tree_nonartificial_location (exp);
3210           loc = expansion_point_location_if_in_system_header (loc);
3211
3212           if (tree_int_cst_lt (maxobjsize, range[0]))
3213             {
3214               /* Warn about crazy big sizes first since that's more
3215                  likely to be meaningful than saying that the bound
3216                  is greater than the object size if both are big.  */
3217               if (range[0] == range[1])
3218                 warning_at (loc, opt,
3219                             "%K%qD specified bound %E "
3220                             "exceeds maximum object size %E",
3221                             exp, func,
3222                             range[0], maxobjsize);
3223               else
3224                 warning_at (loc, opt,
3225                             "%K%qD specified bound between %E and %E "
3226                             "exceeds maximum object size %E",
3227                             exp, func,
3228                             range[0], range[1], maxobjsize);
3229
3230               return false;
3231             }
3232
3233           if (dstsize != maxobjsize && tree_int_cst_lt (dstsize, range[0]))
3234             {
3235               if (tree_int_cst_equal (range[0], range[1]))
3236                 warning_at (loc, opt,
3237                             "%K%qD specified bound %E "
3238                             "exceeds destination size %E",
3239                             exp, func,
3240                             range[0], dstsize);
3241               else
3242                 warning_at (loc, opt,
3243                             "%K%qD specified bound between %E and %E "
3244                             "exceeds destination size %E",
3245                             exp, func,
3246                             range[0], range[1], dstsize);
3247               return false;
3248             }
3249         }
3250     }
3251
3252   /* Check for reading past the end of SRC.  */
3253   if (slen
3254       && slen == srcstr
3255       && dstwrite && range[0]
3256       && tree_int_cst_lt (slen, range[0]))
3257     {
3258       location_t loc = tree_nonartificial_location (exp);
3259
3260       if (tree_int_cst_equal (range[0], range[1]))
3261         warning_at (loc, opt,
3262                     (tree_int_cst_equal (range[0], integer_one_node)
3263                      ? G_("%K%qD reading %E byte from a region of size %E")
3264                      : G_("%K%qD reading %E bytes from a region of size %E")),
3265                     exp, func, range[0], slen);
3266       else if (tree_int_cst_sign_bit (range[1]))
3267         {
3268           /* Avoid printing the upper bound if it's invalid.  */
3269           warning_at (loc, opt,
3270                       "%K%qD reading %E or more bytes from a region "
3271                       "of size %E",
3272                       exp, func, range[0], slen);
3273         }
3274       else
3275         warning_at (loc, opt,
3276                     "%K%qD reading between %E and %E bytes from a region "
3277                     "of size %E",
3278                     exp, func, range[0], range[1], slen);
3279       return false;
3280     }
3281
3282   return true;
3283 }
3284
3285 /* Helper to compute the size of the object referenced by the DEST
3286    expression which must have pointer type, using Object Size type
3287    OSTYPE (only the least significant 2 bits are used).  Return
3288    an estimate of the size of the object if successful or NULL when
3289    the size cannot be determined.  When the referenced object involves
3290    a non-constant offset in some range the returned value represents
3291    the largest size given the smallest non-negative offset in the
3292    range.  The function is intended for diagnostics and should not
3293    be used to influence code generation or optimization.  */
3294
3295 tree
3296 compute_objsize (tree dest, int ostype)
3297 {
3298   unsigned HOST_WIDE_INT size;
3299
3300   /* Only the two least significant bits are meaningful.  */
3301   ostype &= 3;
3302
3303   if (compute_builtin_object_size (dest, ostype, &size))
3304     return build_int_cst (sizetype, size);
3305
3306   if (TREE_CODE (dest) == SSA_NAME)
3307     {
3308       gimple *stmt = SSA_NAME_DEF_STMT (dest);
3309       if (!is_gimple_assign (stmt))
3310         return NULL_TREE;
3311
3312       dest = gimple_assign_rhs1 (stmt);
3313
3314       tree_code code = gimple_assign_rhs_code (stmt);
3315       if (code == POINTER_PLUS_EXPR)
3316         {
3317           /* compute_builtin_object_size fails for addresses with
3318              non-constant offsets.  Try to determine the range of
3319              such an offset here and use it to adjus the constant
3320              size.  */
3321           tree off = gimple_assign_rhs2 (stmt);
3322           if (TREE_CODE (off) == SSA_NAME
3323               && INTEGRAL_TYPE_P (TREE_TYPE (off)))
3324             {
3325               wide_int min, max;
3326               enum value_range_type rng = get_range_info (off, &min, &max);
3327
3328               if (rng == VR_RANGE)
3329                 {
3330                   if (tree size = compute_objsize (dest, ostype))
3331                     {
3332                       wide_int wisiz = wi::to_wide (size);
3333
3334                       /* Ignore negative offsets for now.  For others,
3335                          use the lower bound as the most optimistic
3336                          estimate of the (remaining)size.  */
3337                       if (wi::sign_mask (min))
3338                         ;
3339                       else if (wi::ltu_p (min, wisiz))
3340                         return wide_int_to_tree (TREE_TYPE (size),
3341                                                  wi::sub (wisiz, min));
3342                       else
3343                         return size_zero_node;
3344                     }
3345                 }
3346             }
3347         }
3348       else if (code != ADDR_EXPR)
3349         return NULL_TREE;
3350     }
3351
3352   /* Unless computing the largest size (for memcpy and other raw memory
3353      functions), try to determine the size of the object from its type.  */
3354   if (!ostype)
3355     return NULL_TREE;
3356
3357   if (TREE_CODE (dest) != ADDR_EXPR)
3358     return NULL_TREE;
3359
3360   tree type = TREE_TYPE (dest);
3361   if (TREE_CODE (type) == POINTER_TYPE)
3362     type = TREE_TYPE (type);
3363
3364   type = TYPE_MAIN_VARIANT (type);
3365
3366   if (TREE_CODE (type) == ARRAY_TYPE
3367       && !array_at_struct_end_p (dest))
3368     {
3369       /* Return the constant size unless it's zero (that's a zero-length
3370          array likely at the end of a struct).  */
3371       tree size = TYPE_SIZE_UNIT (type);
3372       if (size && TREE_CODE (size) == INTEGER_CST
3373           && !integer_zerop (size))
3374         return size;
3375     }
3376
3377   return NULL_TREE;
3378 }
3379
3380 /* Helper to determine and check the sizes of the source and the destination
3381    of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls.  EXP is the
3382    call expression, DEST is the destination argument, SRC is the source
3383    argument or null, and LEN is the number of bytes.  Use Object Size type-0
3384    regardless of the OPT_Wstringop_overflow_ setting.  Return true on success
3385    (no overflow or invalid sizes), false otherwise.  */
3386
3387 static bool
3388 check_memop_access (tree exp, tree dest, tree src, tree size)
3389 {
3390   /* For functions like memset and memcpy that operate on raw memory
3391      try to determine the size of the largest source and destination
3392      object using type-0 Object Size regardless of the object size
3393      type specified by the option.  */
3394   tree srcsize = src ? compute_objsize (src, 0) : NULL_TREE;
3395   tree dstsize = compute_objsize (dest, 0);
3396
3397   return check_access (exp, dest, src, size, /*maxread=*/NULL_TREE,
3398                        srcsize, dstsize);
3399 }
3400
3401 /* Validate memchr arguments without performing any expansion.
3402    Return NULL_RTX.  */
3403
3404 static rtx
3405 expand_builtin_memchr (tree exp, rtx)
3406 {
3407   if (!validate_arglist (exp,
3408                          POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
3409     return NULL_RTX;
3410
3411   tree arg1 = CALL_EXPR_ARG (exp, 0);
3412   tree len = CALL_EXPR_ARG (exp, 2);
3413
3414   /* Diagnose calls where the specified length exceeds the size
3415      of the object.  */
3416   if (warn_stringop_overflow)
3417     {
3418       tree size = compute_objsize (arg1, 0);
3419       check_access (exp, /*dst=*/NULL_TREE, /*src=*/NULL_TREE, len,
3420                     /*maxread=*/NULL_TREE, size, /*objsize=*/NULL_TREE);
3421     }
3422
3423   return NULL_RTX;
3424 }
3425
3426 /* Expand a call EXP to the memcpy builtin.
3427    Return NULL_RTX if we failed, the caller should emit a normal call,
3428    otherwise try to get the result in TARGET, if convenient (and in
3429    mode MODE if that's convenient).  */
3430
3431 static rtx
3432 expand_builtin_memcpy (tree exp, rtx target)
3433 {
3434   if (!validate_arglist (exp,
3435                          POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3436     return NULL_RTX;
3437
3438   tree dest = CALL_EXPR_ARG (exp, 0);
3439   tree src = CALL_EXPR_ARG (exp, 1);
3440   tree len = CALL_EXPR_ARG (exp, 2);
3441
3442   check_memop_access (exp, dest, src, len);
3443
3444   return expand_builtin_memory_copy_args (dest, src, len, target, exp,
3445                                           /*endp=*/ 0);
3446 }
3447
3448 /* Check a call EXP to the memmove built-in for validity.
3449    Return NULL_RTX on both success and failure.  */
3450
3451 static rtx
3452 expand_builtin_memmove (tree exp, rtx)
3453 {
3454   if (!validate_arglist (exp,
3455                          POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3456     return NULL_RTX;
3457
3458   tree dest = CALL_EXPR_ARG (exp, 0);
3459   tree src = CALL_EXPR_ARG (exp, 1);
3460   tree len = CALL_EXPR_ARG (exp, 2);
3461
3462   check_memop_access (exp, dest, src, len);
3463
3464   return NULL_RTX;
3465 }
3466
3467 /* Expand an instrumented call EXP to the memcpy builtin.
3468    Return NULL_RTX if we failed, the caller should emit a normal call,
3469    otherwise try to get the result in TARGET, if convenient (and in
3470    mode MODE if that's convenient).  */
3471
3472 static rtx
3473 expand_builtin_memcpy_with_bounds (tree exp, rtx target)
3474 {
3475   if (!validate_arglist (exp,
3476                          POINTER_TYPE, POINTER_BOUNDS_TYPE,
3477                          POINTER_TYPE, POINTER_BOUNDS_TYPE,
3478                          INTEGER_TYPE, VOID_TYPE))
3479     return NULL_RTX;
3480   else
3481     {
3482       tree dest = CALL_EXPR_ARG (exp, 0);
3483       tree src = CALL_EXPR_ARG (exp, 2);
3484       tree len = CALL_EXPR_ARG (exp, 4);
3485       rtx res = expand_builtin_memory_copy_args (dest, src, len, target, exp,
3486                                                  /*end_p=*/ 0);
3487
3488       /* Return src bounds with the result.  */
3489       if (res)
3490         {
3491           rtx bnd = force_reg (targetm.chkp_bound_mode (),
3492                                expand_normal (CALL_EXPR_ARG (exp, 1)));
3493           res = chkp_join_splitted_slot (res, bnd);
3494         }
3495       return res;
3496     }
3497 }
3498
3499 /* Expand a call EXP to the mempcpy builtin.
3500    Return NULL_RTX if we failed; the caller should emit a normal call,
3501    otherwise try to get the result in TARGET, if convenient (and in
3502    mode MODE if that's convenient).  If ENDP is 0 return the
3503    destination pointer, if ENDP is 1 return the end pointer ala
3504    mempcpy, and if ENDP is 2 return the end pointer minus one ala
3505    stpcpy.  */
3506
3507 static rtx
3508 expand_builtin_mempcpy (tree exp, rtx target)
3509 {
3510   if (!validate_arglist (exp,
3511                          POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3512     return NULL_RTX;
3513
3514   tree dest = CALL_EXPR_ARG (exp, 0);
3515   tree src = CALL_EXPR_ARG (exp, 1);
3516   tree len = CALL_EXPR_ARG (exp, 2);
3517
3518   /* Policy does not generally allow using compute_objsize (which
3519      is used internally by check_memop_size) to change code generation
3520      or drive optimization decisions.
3521
3522      In this instance it is safe because the code we generate has
3523      the same semantics regardless of the return value of
3524      check_memop_sizes.   Exactly the same amount of data is copied
3525      and the return value is exactly the same in both cases.
3526
3527      Furthermore, check_memop_size always uses mode 0 for the call to
3528      compute_objsize, so the imprecise nature of compute_objsize is
3529      avoided.  */
3530
3531   /* Avoid expanding mempcpy into memcpy when the call is determined
3532      to overflow the buffer.  This also prevents the same overflow
3533      from being diagnosed again when expanding memcpy.  */
3534   if (!check_memop_access (exp, dest, src, len))
3535     return NULL_RTX;
3536
3537   return expand_builtin_mempcpy_args (dest, src, len,
3538                                       target, exp, /*endp=*/ 1);
3539 }
3540
3541 /* Expand an instrumented call EXP to the mempcpy builtin.
3542    Return NULL_RTX if we failed, the caller should emit a normal call,
3543    otherwise try to get the result in TARGET, if convenient (and in
3544    mode MODE if that's convenient).  */
3545
3546 static rtx
3547 expand_builtin_mempcpy_with_bounds (tree exp, rtx target)
3548 {
3549   if (!validate_arglist (exp,
3550                          POINTER_TYPE, POINTER_BOUNDS_TYPE,
3551                          POINTER_TYPE, POINTER_BOUNDS_TYPE,
3552                          INTEGER_TYPE, VOID_TYPE))
3553     return NULL_RTX;
3554   else
3555     {
3556       tree dest = CALL_EXPR_ARG (exp, 0);
3557       tree src = CALL_EXPR_ARG (exp, 2);
3558       tree len = CALL_EXPR_ARG (exp, 4);
3559       rtx res = expand_builtin_mempcpy_args (dest, src, len, target,
3560                                              exp, 1);
3561
3562       /* Return src bounds with the result.  */
3563       if (res)
3564         {
3565           rtx bnd = force_reg (targetm.chkp_bound_mode (),
3566                                expand_normal (CALL_EXPR_ARG (exp, 1)));
3567           res = chkp_join_splitted_slot (res, bnd);
3568         }
3569       return res;
3570     }
3571 }
3572
3573 /* Helper function to do the actual work for expand of memory copy family
3574    functions (memcpy, mempcpy, stpcpy).  Expansing should assign LEN bytes
3575    of memory from SRC to DEST and assign to TARGET if convenient.
3576    If ENDP is 0 return the
3577    destination pointer, if ENDP is 1 return the end pointer ala
3578    mempcpy, and if ENDP is 2 return the end pointer minus one ala
3579    stpcpy.  */
3580
3581 static rtx
3582 expand_builtin_memory_copy_args (tree dest, tree src, tree len,
3583                                  rtx target, tree exp, int endp)
3584 {
3585   const char *src_str;
3586   unsigned int src_align = get_pointer_alignment (src);
3587   unsigned int dest_align = get_pointer_alignment (dest);
3588   rtx dest_mem, src_mem, dest_addr, len_rtx;
3589   HOST_WIDE_INT expected_size = -1;
3590   unsigned int expected_align = 0;
3591   unsigned HOST_WIDE_INT min_size;
3592   unsigned HOST_WIDE_INT max_size;
3593   unsigned HOST_WIDE_INT probable_max_size;
3594
3595   /* If DEST is not a pointer type, call the normal function.  */
3596   if (dest_align == 0)
3597     return NULL_RTX;
3598
3599   /* If either SRC is not a pointer type, don't do this
3600      operation in-line.  */
3601   if (src_align == 0)
3602     return NULL_RTX;
3603
3604   if (currently_expanding_gimple_stmt)
3605     stringop_block_profile (currently_expanding_gimple_stmt,
3606                             &expected_align, &expected_size);
3607
3608   if (expected_align < dest_align)
3609     expected_align = dest_align;
3610   dest_mem = get_memory_rtx (dest, len);
3611   set_mem_align (dest_mem, dest_align);
3612   len_rtx = expand_normal (len);
3613   determine_block_size (len, len_rtx, &min_size, &max_size,
3614                         &probable_max_size);
3615   src_str = c_getstr (src);
3616
3617   /* If SRC is a string constant and block move would be done
3618      by pieces, we can avoid loading the string from memory
3619      and only stored the computed constants.  */
3620   if (src_str
3621       && CONST_INT_P (len_rtx)
3622       && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1
3623       && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3624                               CONST_CAST (char *, src_str),
3625                               dest_align, false))
3626     {
3627       dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3628                                   builtin_memcpy_read_str,
3629                                   CONST_CAST (char *, src_str),
3630                                   dest_align, false, endp);
3631       dest_mem = force_operand (XEXP (dest_mem, 0), target);
3632       dest_mem = convert_memory_address (ptr_mode, dest_mem);
3633       return dest_mem;
3634     }
3635
3636   src_mem = get_memory_rtx (src, len);
3637   set_mem_align (src_mem, src_align);
3638
3639   /* Copy word part most expediently.  */
3640   dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx,
3641                                      CALL_EXPR_TAILCALL (exp)
3642                                      && (endp == 0 || target == const0_rtx)
3643                                      ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
3644                                      expected_align, expected_size,
3645                                      min_size, max_size, probable_max_size);
3646
3647   if (dest_addr == 0)
3648     {
3649       dest_addr = force_operand (XEXP (dest_mem, 0), target);
3650       dest_addr = convert_memory_address (ptr_mode, dest_addr);
3651     }
3652
3653   if (endp && target != const0_rtx)
3654     {
3655       dest_addr = gen_rtx_PLUS (ptr_mode, dest_addr, len_rtx);
3656       /* stpcpy pointer to last byte.  */
3657       if (endp == 2)
3658         dest_addr = gen_rtx_MINUS (ptr_mode, dest_addr, const1_rtx);
3659     }
3660
3661   return dest_addr;
3662 }
3663
3664 static rtx
3665 expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3666                              rtx target, tree orig_exp, int endp)
3667 {
3668   return expand_builtin_memory_copy_args (dest, src, len, target, orig_exp,
3669                                           endp);
3670 }
3671
3672 /* Expand into a movstr instruction, if one is available.  Return NULL_RTX if
3673    we failed, the caller should emit a normal call, otherwise try to
3674    get the result in TARGET, if convenient.  If ENDP is 0 return the
3675    destination pointer, if ENDP is 1 return the end pointer ala
3676    mempcpy, and if ENDP is 2 return the end pointer minus one ala
3677    stpcpy.  */
3678
3679 static rtx
3680 expand_movstr (tree dest, tree src, rtx target, int endp)
3681 {
3682   struct expand_operand ops[3];
3683   rtx dest_mem;
3684   rtx src_mem;
3685
3686   if (!targetm.have_movstr ())
3687     return NULL_RTX;
3688
3689   dest_mem = get_memory_rtx (dest, NULL);
3690   src_mem = get_memory_rtx (src, NULL);
3691   if (!endp)
3692     {
3693       target = force_reg (Pmode, XEXP (dest_mem, 0));
3694       dest_mem = replace_equiv_address (dest_mem, target);
3695     }
3696
3697   create_output_operand (&ops[0], endp ? target : NULL_RTX, Pmode);
3698   create_fixed_operand (&ops[1], dest_mem);
3699   create_fixed_operand (&ops[2], src_mem);
3700   if (!maybe_expand_insn (targetm.code_for_movstr, 3, ops))
3701     return NULL_RTX;
3702
3703   if (endp && target != const0_rtx)
3704     {
3705       target = ops[0].value;
3706       /* movstr is supposed to set end to the address of the NUL
3707          terminator.  If the caller requested a mempcpy-like return value,
3708          adjust it.  */
3709       if (endp == 1)
3710         {
3711           rtx tem = plus_constant (GET_MODE (target),
3712                                    gen_lowpart (GET_MODE (target), target), 1);
3713           emit_move_insn (target, force_operand (tem, NULL_RTX));
3714         }
3715     }
3716   return target;
3717 }
3718
3719 /* Do some very basic size validation of a call to the strcpy builtin
3720    given by EXP.  Return NULL_RTX to have the built-in expand to a call
3721    to the library function.  */
3722
3723 static rtx
3724 expand_builtin_strcat (tree exp, rtx)
3725 {
3726   if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)
3727       || !warn_stringop_overflow)
3728     return NULL_RTX;
3729
3730   tree dest = CALL_EXPR_ARG (exp, 0);
3731   tree src = CALL_EXPR_ARG (exp, 1);
3732
3733   /* There is no way here to determine the length of the string in
3734      the destination to which the SRC string is being appended so
3735      just diagnose cases when the souce string is longer than
3736      the destination object.  */
3737
3738   tree destsize = compute_objsize (dest, warn_stringop_overflow - 1);
3739
3740   check_access (exp, dest, src, /*size=*/NULL_TREE, /*maxread=*/NULL_TREE, src,
3741                 destsize);
3742
3743   return NULL_RTX;
3744 }
3745
3746 /* Expand expression EXP, which is a call to the strcpy builtin.  Return
3747    NULL_RTX if we failed the caller should emit a normal call, otherwise
3748    try to get the result in TARGET, if convenient (and in mode MODE if that's
3749    convenient).  */
3750
3751 static rtx
3752 expand_builtin_strcpy (tree exp, rtx target)
3753 {
3754   if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3755     return NULL_RTX;
3756
3757   tree dest = CALL_EXPR_ARG (exp, 0);
3758   tree src = CALL_EXPR_ARG (exp, 1);
3759
3760   if (warn_stringop_overflow)
3761     {
3762       tree destsize = compute_objsize (dest, warn_stringop_overflow - 1);
3763       check_access (exp, dest, src, /*size=*/NULL_TREE, /*maxread=*/NULL_TREE,
3764                     src, destsize);
3765     }
3766
3767   return expand_builtin_strcpy_args (dest, src, target);
3768 }
3769
3770 /* Helper function to do the actual work for expand_builtin_strcpy.  The
3771    arguments to the builtin_strcpy call DEST and SRC are broken out
3772    so that this can also be called without constructing an actual CALL_EXPR.
3773    The other arguments and return value are the same as for
3774    expand_builtin_strcpy.  */
3775
3776 static rtx
3777 expand_builtin_strcpy_args (tree dest, tree src, rtx target)
3778 {
3779   return expand_movstr (dest, src, target, /*endp=*/0);
3780 }
3781
3782 /* Expand a call EXP to the stpcpy builtin.
3783    Return NULL_RTX if we failed the caller should emit a normal call,
3784    otherwise try to get the result in TARGET, if convenient (and in
3785    mode MODE if that's convenient).  */
3786
3787 static rtx
3788 expand_builtin_stpcpy (tree exp, rtx target, machine_mode mode)
3789 {
3790   tree dst, src;
3791   location_t loc = EXPR_LOCATION (exp);
3792
3793   if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3794     return NULL_RTX;
3795
3796   dst = CALL_EXPR_ARG (exp, 0);
3797   src = CALL_EXPR_ARG (exp, 1);
3798
3799   if (warn_stringop_overflow)
3800     {
3801       tree destsize = compute_objsize (dst, warn_stringop_overflow - 1);
3802       check_access (exp, dst, src, /*size=*/NULL_TREE, /*maxread=*/NULL_TREE,
3803                     src, destsize);
3804     }
3805
3806   /* If return value is ignored, transform stpcpy into strcpy.  */
3807   if (target == const0_rtx && builtin_decl_implicit (BUILT_IN_STRCPY))
3808     {
3809       tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
3810       tree result = build_call_nofold_loc (loc, fn, 2, dst, src);
3811       return expand_expr (result, target, mode, EXPAND_NORMAL);
3812     }
3813   else
3814     {
3815       tree len, lenp1;
3816       rtx ret;
3817
3818       /* Ensure we get an actual string whose length can be evaluated at
3819          compile-time, not an expression containing a string.  This is
3820          because the latter will potentially produce pessimized code
3821          when used to produce the return value.  */
3822       if (! c_getstr (src) || ! (len = c_strlen (src, 0)))
3823         return expand_movstr (dst, src, target, /*endp=*/2);
3824
3825       lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
3826       ret = expand_builtin_mempcpy_args (dst, src, lenp1,
3827                                          target, exp, /*endp=*/2);
3828
3829       if (ret)
3830         return ret;
3831
3832       if (TREE_CODE (len) == INTEGER_CST)
3833         {
3834           rtx len_rtx = expand_normal (len);
3835
3836           if (CONST_INT_P (len_rtx))
3837             {
3838               ret = expand_builtin_strcpy_args (dst, src, target);
3839
3840               if (ret)
3841                 {
3842                   if (! target)
3843                     {
3844                       if (mode != VOIDmode)
3845                         target = gen_reg_rtx (mode);
3846                       else
3847                         target = gen_reg_rtx (GET_MODE (ret));
3848                     }
3849                   if (GET_MODE (target) != GET_MODE (ret))
3850                     ret = gen_lowpart (GET_MODE (target), ret);
3851
3852                   ret = plus_constant (GET_MODE (ret), ret, INTVAL (len_rtx));
3853                   ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
3854                   gcc_assert (ret);
3855
3856                   return target;
3857                 }
3858             }
3859         }
3860
3861       return expand_movstr (dst, src, target, /*endp=*/2);
3862     }
3863 }
3864
3865 /* Check a call EXP to the stpncpy built-in for validity.
3866    Return NULL_RTX on both success and failure.  */
3867
3868 static rtx
3869 expand_builtin_stpncpy (tree exp, rtx)
3870 {
3871   if (!validate_arglist (exp,
3872                          POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
3873       || !warn_stringop_overflow)
3874     return NULL_RTX;
3875
3876   /* The source and destination of the call.  */
3877   tree dest = CALL_EXPR_ARG (exp, 0);
3878   tree src = CALL_EXPR_ARG (exp, 1);
3879
3880   /* The exact number of bytes to write (not the maximum).  */
3881   tree len = CALL_EXPR_ARG (exp, 2);
3882
3883   /* The size of the destination object.  */
3884   tree destsize = compute_objsize (dest, warn_stringop_overflow - 1);
3885
3886   check_access (exp, dest, src, len, /*maxread=*/NULL_TREE, src, destsize);
3887
3888   return NULL_RTX;
3889 }
3890
3891 /* Callback routine for store_by_pieces.  Read GET_MODE_BITSIZE (MODE)
3892    bytes from constant string DATA + OFFSET and return it as target
3893    constant.  */
3894
3895 rtx
3896 builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset,
3897                           scalar_int_mode mode)
3898 {
3899   const char *str = (const char *) data;
3900
3901   if ((unsigned HOST_WIDE_INT) offset > strlen (str))
3902     return const0_rtx;
3903
3904   return c_readstr (str + offset, mode);
3905 }
3906
3907 /* Helper to check the sizes of sequences and the destination of calls
3908    to __builtin_strncat and __builtin___strncat_chk.  Returns true on
3909    success (no overflow or invalid sizes), false otherwise.  */
3910
3911 static bool
3912 check_strncat_sizes (tree exp, tree objsize)
3913 {
3914   tree dest = CALL_EXPR_ARG (exp, 0);
3915   tree src = CALL_EXPR_ARG (exp, 1);
3916   tree maxread = CALL_EXPR_ARG (exp, 2);
3917
3918   /* Try to determine the range of lengths that the source expression
3919      refers to.  */
3920   tree lenrange[2];
3921   get_range_strlen (src, lenrange);
3922
3923   /* Try to verify that the destination is big enough for the shortest
3924      string.  */
3925
3926   if (!objsize && warn_stringop_overflow)
3927     {
3928       /* If it hasn't been provided by __strncat_chk, try to determine
3929          the size of the destination object into which the source is
3930          being copied.  */
3931       objsize = compute_objsize (dest, warn_stringop_overflow - 1);
3932     }
3933
3934   /* Add one for the terminating nul.  */
3935   tree srclen = (lenrange[0]
3936                  ? fold_build2 (PLUS_EXPR, size_type_node, lenrange[0],
3937                                 size_one_node)
3938                  : NULL_TREE);
3939
3940   /* The strncat function copies at most MAXREAD bytes and always appends
3941      the terminating nul so the specified upper bound should never be equal
3942      to (or greater than) the size of the destination.  */
3943   if (tree_fits_uhwi_p (maxread) && tree_fits_uhwi_p (objsize)
3944       && tree_int_cst_equal (objsize, maxread))
3945     {
3946       location_t loc = tree_nonartificial_location (exp);
3947       loc = expansion_point_location_if_in_system_header (loc);
3948
3949       warning_at (loc, OPT_Wstringop_overflow_,
3950                   "%K%qD specified bound %E equals destination size",
3951                   exp, get_callee_fndecl (exp), maxread);
3952
3953       return false;
3954     }
3955
3956   if (!srclen
3957       || (maxread && tree_fits_uhwi_p (maxread)
3958           && tree_fits_uhwi_p (srclen)
3959           && tree_int_cst_lt (maxread, srclen)))
3960     srclen = maxread;
3961
3962   /* The number of bytes to write is LEN but check_access will also
3963      check SRCLEN if LEN's value isn't known.  */
3964   return check_access (exp, dest, src, /*size=*/NULL_TREE, maxread, srclen,
3965                        objsize);
3966 }
3967
3968 /* Similar to expand_builtin_strcat, do some very basic size validation
3969    of a call to the strcpy builtin given by EXP.  Return NULL_RTX to have
3970    the built-in expand to a call to the library function.  */
3971
3972 static rtx
3973 expand_builtin_strncat (tree exp, rtx)
3974 {
3975   if (!validate_arglist (exp,
3976                          POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
3977       || !warn_stringop_overflow)
3978     return NULL_RTX;
3979
3980   tree dest = CALL_EXPR_ARG (exp, 0);
3981   tree src = CALL_EXPR_ARG (exp, 1);
3982   /* The upper bound on the number of bytes to write.  */
3983   tree maxread = CALL_EXPR_ARG (exp, 2);
3984   /* The length of the source sequence.  */
3985   tree slen = c_strlen (src, 1);
3986
3987   /* Try to determine the range of lengths that the source expression
3988      refers to.  */
3989   tree lenrange[2];
3990   if (slen)
3991     lenrange[0] = lenrange[1] = slen;
3992   else
3993     get_range_strlen (src, lenrange);
3994
3995   /* Try to verify that the destination is big enough for the shortest
3996      string.  First try to determine the size of the destination object
3997      into which the source is being copied.  */
3998   tree destsize = compute_objsize (dest, warn_stringop_overflow - 1);
3999
4000   /* Add one for the terminating nul.  */
4001   tree srclen = (lenrange[0]
4002                  ? fold_build2 (PLUS_EXPR, size_type_node, lenrange[0],
4003                                 size_one_node)
4004                  : NULL_TREE);
4005
4006   /* The strncat function copies at most MAXREAD bytes and always appends
4007      the terminating nul so the specified upper bound should never be equal
4008      to (or greater than) the size of the destination.  */
4009   if (tree_fits_uhwi_p (maxread) && tree_fits_uhwi_p (destsize)
4010       && tree_int_cst_equal (destsize, maxread))
4011     {
4012       location_t loc = tree_nonartificial_location (exp);
4013       loc = expansion_point_location_if_in_system_header (loc);
4014
4015       warning_at (loc, OPT_Wstringop_overflow_,
4016                   "%K%qD specified bound %E equals destination size",
4017                   exp, get_callee_fndecl (exp), maxread);
4018
4019       return NULL_RTX;
4020     }
4021
4022   if (!srclen
4023       || (maxread && tree_fits_uhwi_p (maxread)
4024           && tree_fits_uhwi_p (srclen)
4025           && tree_int_cst_lt (maxread, srclen)))
4026     srclen = maxread;
4027
4028   /* The number of bytes to write is SRCLEN.  */
4029   check_access (exp, dest, src, NULL_TREE, maxread, srclen, destsize);
4030
4031   return NULL_RTX;
4032 }
4033
4034 /* Expand expression EXP, which is a call to the strncpy builtin.  Return
4035    NULL_RTX if we failed the caller should emit a normal call.  */
4036
4037 static rtx
4038 expand_builtin_strncpy (tree exp, rtx target)
4039 {
4040   location_t loc = EXPR_LOCATION (exp);
4041
4042   if (validate_arglist (exp,
4043                         POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4044     {
4045       tree dest = CALL_EXPR_ARG (exp, 0);
4046       tree src = CALL_EXPR_ARG (exp, 1);
4047       /* The number of bytes to write (not the maximum).  */
4048       tree len = CALL_EXPR_ARG (exp, 2);
4049       /* The length of the source sequence.  */
4050       tree slen = c_strlen (src, 1);
4051
4052       if (warn_stringop_overflow)
4053         {
4054           tree destsize = compute_objsize (dest,
4055                                            warn_stringop_overflow - 1);
4056
4057           /* The number of bytes to write is LEN but check_access will also
4058              check SLEN if LEN's value isn't known.  */
4059           check_access (exp, dest, src, len, /*maxread=*/NULL_TREE, src,
4060                         destsize);
4061         }
4062
4063       /* We must be passed a constant len and src parameter.  */
4064       if (!tree_fits_uhwi_p (len) || !slen || !tree_fits_uhwi_p (slen))
4065         return NULL_RTX;
4066
4067       slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
4068
4069       /* We're required to pad with trailing zeros if the requested
4070          len is greater than strlen(s2)+1.  In that case try to
4071          use store_by_pieces, if it fails, punt.  */
4072       if (tree_int_cst_lt (slen, len))
4073         {
4074           unsigned int dest_align = get_pointer_alignment (dest);
4075           const char *p = c_getstr (src);
4076           rtx dest_mem;
4077
4078           if (!p || dest_align == 0 || !tree_fits_uhwi_p (len)
4079               || !can_store_by_pieces (tree_to_uhwi (len),
4080                                        builtin_strncpy_read_str,
4081                                        CONST_CAST (char *, p),
4082                                        dest_align, false))
4083             return NULL_RTX;
4084
4085           dest_mem = get_memory_rtx (dest, len);
4086           store_by_pieces (dest_mem, tree_to_uhwi (len),
4087                            builtin_strncpy_read_str,
4088                            CONST_CAST (char *, p), dest_align, false, 0);
4089           dest_mem = force_operand (XEXP (dest_mem, 0), target);
4090           dest_mem = convert_memory_address (ptr_mode, dest_mem);
4091           return dest_mem;
4092         }
4093     }
4094   return NULL_RTX;
4095 }
4096
4097 /* Callback routine for store_by_pieces.  Read GET_MODE_BITSIZE (MODE)
4098    bytes from constant string DATA + OFFSET and return it as target
4099    constant.  */
4100
4101 rtx
4102 builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4103                          scalar_int_mode mode)
4104 {
4105   const char *c = (const char *) data;
4106   char *p = XALLOCAVEC (char, GET_MODE_SIZE (mode));
4107
4108   memset (p, *c, GET_MODE_SIZE (mode));
4109
4110   return c_readstr (p, mode);
4111 }
4112
4113 /* Callback routine for store_by_pieces.  Return the RTL of a register
4114    containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4115    char value given in the RTL register data.  For example, if mode is
4116    4 bytes wide, return the RTL for 0x01010101*data.  */
4117
4118 static rtx
4119 builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4120                         scalar_int_mode mode)
4121 {
4122   rtx target, coeff;
4123   size_t size;
4124   char *p;
4125
4126   size = GET_MODE_SIZE (mode);
4127   if (size == 1)
4128     return (rtx) data;
4129
4130   p = XALLOCAVEC (char, size);
4131   memset (p, 1, size);
4132   coeff = c_readstr (p, mode);
4133
4134   target = convert_to_mode (mode, (rtx) data, 1);
4135   target = expand_mult (mode, target, coeff, NULL_RTX, 1);
4136   return force_reg (mode, target);
4137 }
4138
4139 /* Expand expression EXP, which is a call to the memset builtin.  Return
4140    NULL_RTX if we failed the caller should emit a normal call, otherwise
4141    try to get the result in TARGET, if convenient (and in mode MODE if that's
4142    convenient).  */
4143
4144 static rtx
4145 expand_builtin_memset (tree exp, rtx target, machine_mode mode)
4146 {
4147   if (!validate_arglist (exp,
4148                          POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
4149     return NULL_RTX;
4150
4151   tree dest = CALL_EXPR_ARG (exp, 0);
4152   tree val = CALL_EXPR_ARG (exp, 1);
4153   tree len = CALL_EXPR_ARG (exp, 2);
4154
4155   check_memop_access (exp, dest, NULL_TREE, len);
4156
4157   return expand_builtin_memset_args (dest, val, len, target, mode, exp);
4158 }
4159
4160 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4161    Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4162    try to get the result in TARGET, if convenient (and in mode MODE if that's
4163    convenient).  */
4164
4165 static rtx
4166 expand_builtin_memset_with_bounds (tree exp, rtx target, machine_mode mode)
4167 {
4168   if (!validate_arglist (exp,
4169                          POINTER_TYPE, POINTER_BOUNDS_TYPE,
4170                          INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
4171     return NULL_RTX;
4172   else
4173     {
4174       tree dest = CALL_EXPR_ARG (exp, 0);
4175       tree val = CALL_EXPR_ARG (exp, 2);
4176       tree len = CALL_EXPR_ARG (exp, 3);
4177       rtx res = expand_builtin_memset_args (dest, val, len, target, mode, exp);
4178
4179       /* Return src bounds with the result.  */
4180       if (res)
4181         {
4182           rtx bnd = force_reg (targetm.chkp_bound_mode (),
4183                                expand_normal (CALL_EXPR_ARG (exp, 1)));
4184           res = chkp_join_splitted_slot (res, bnd);
4185         }
4186       return res;
4187     }
4188 }
4189
4190 /* Helper function to do the actual work for expand_builtin_memset.  The
4191    arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4192    so that this can also be called without constructing an actual CALL_EXPR.
4193    The other arguments and return value are the same as for
4194    expand_builtin_memset.  */
4195
4196 static rtx
4197 expand_builtin_memset_args (tree dest, tree val, tree len,
4198                             rtx target, machine_mode mode, tree orig_exp)
4199 {
4200   tree fndecl, fn;
4201   enum built_in_function fcode;
4202   machine_mode val_mode;
4203   char c;
4204   unsigned int dest_align;
4205   rtx dest_mem, dest_addr, len_rtx;
4206   HOST_WIDE_INT expected_size = -1;
4207   unsigned int expected_align = 0;
4208   unsigned HOST_WIDE_INT min_size;
4209   unsigned HOST_WIDE_INT max_size;
4210   unsigned HOST_WIDE_INT probable_max_size;
4211
4212   dest_align = get_pointer_alignment (dest);
4213
4214   /* If DEST is not a pointer type, don't do this operation in-line.  */
4215   if (dest_align == 0)
4216     return NULL_RTX;
4217
4218   if (currently_expanding_gimple_stmt)
4219     stringop_block_profile (currently_expanding_gimple_stmt,
4220                             &expected_align, &expected_size);
4221
4222   if (expected_align < dest_align)
4223     expected_align = dest_align;
4224
4225   /* If the LEN parameter is zero, return DEST.  */
4226   if (integer_zerop (len))
4227     {
4228       /* Evaluate and ignore VAL in case it has side-effects.  */
4229       expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
4230       return expand_expr (dest, target, mode, EXPAND_NORMAL);
4231     }
4232
4233   /* Stabilize the arguments in case we fail.  */
4234   dest = builtin_save_expr (dest);
4235   val = builtin_save_expr (val);
4236   len = builtin_save_expr (len);
4237
4238   len_rtx = expand_normal (len);
4239   determine_block_size (len, len_rtx, &min_size, &max_size,
4240                         &probable_max_size);
4241   dest_mem = get_memory_rtx (dest, len);
4242   val_mode = TYPE_MODE (unsigned_char_type_node);
4243
4244   if (TREE_CODE (val) != INTEGER_CST)
4245     {
4246       rtx val_rtx;
4247
4248       val_rtx = expand_normal (val);
4249       val_rtx = convert_to_mode (val_mode, val_rtx, 0);
4250
4251       /* Assume that we can memset by pieces if we can store
4252        * the coefficients by pieces (in the required modes).
4253        * We can't pass builtin_memset_gen_str as that emits RTL.  */
4254       c = 1;
4255       if (tree_fits_uhwi_p (len)
4256           && can_store_by_pieces (tree_to_uhwi (len),
4257                                   builtin_memset_read_str, &c, dest_align,
4258                                   true))
4259         {
4260           val_rtx = force_reg (val_mode, val_rtx);
4261           store_by_pieces (dest_mem, tree_to_uhwi (len),
4262                            builtin_memset_gen_str, val_rtx, dest_align,
4263                            true, 0);
4264         }
4265       else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
4266                                         dest_align, expected_align,
4267                                         expected_size, min_size, max_size,
4268                                         probable_max_size))
4269         goto do_libcall;
4270
4271       dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4272       dest_mem = convert_memory_address (ptr_mode, dest_mem);
4273       return dest_mem;
4274     }
4275
4276   if (target_char_cast (val, &c))
4277     goto do_libcall;
4278
4279   if (c)
4280     {
4281       if (tree_fits_uhwi_p (len)
4282           && can_store_by_pieces (tree_to_uhwi (len),
4283                                   builtin_memset_read_str, &c, dest_align,
4284                                   true))
4285         store_by_pieces (dest_mem, tree_to_uhwi (len),
4286                          builtin_memset_read_str, &c, dest_align, true, 0);
4287       else if (!set_storage_via_setmem (dest_mem, len_rtx,
4288                                         gen_int_mode (c, val_mode),
4289                                         dest_align, expected_align,
4290                                         expected_size, min_size, max_size,
4291                                         probable_max_size))
4292         goto do_libcall;
4293
4294       dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4295       dest_mem = convert_memory_address (ptr_mode, dest_mem);
4296       return dest_mem;
4297     }
4298
4299   set_mem_align (dest_mem, dest_align);
4300   dest_addr = clear_storage_hints (dest_mem, len_rtx,
4301                                    CALL_EXPR_TAILCALL (orig_exp)
4302                                    ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
4303                                    expected_align, expected_size,
4304                                    min_size, max_size,
4305                                    probable_max_size);
4306
4307   if (dest_addr == 0)
4308     {
4309       dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4310       dest_addr = convert_memory_address (ptr_mode, dest_addr);
4311     }
4312
4313   return dest_addr;
4314
4315  do_libcall:
4316   fndecl = get_callee_fndecl (orig_exp);
4317   fcode = DECL_FUNCTION_CODE (fndecl);
4318   if (fcode == BUILT_IN_MEMSET
4319       || fcode == BUILT_IN_CHKP_MEMSET_NOBND_NOCHK_CHKP)
4320     fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 3,
4321                                 dest, val, len);
4322   else if (fcode == BUILT_IN_BZERO)
4323     fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 2,
4324                                 dest, len);
4325   else
4326     gcc_unreachable ();
4327   gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4328   CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
4329   return expand_call (fn, target, target == const0_rtx);
4330 }
4331
4332 /* Expand expression EXP, which is a call to the bzero builtin.  Return
4333    NULL_RTX if we failed the caller should emit a normal call.  */
4334
4335 static rtx
4336 expand_builtin_bzero (tree exp)
4337 {
4338   if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4339     return NULL_RTX;
4340
4341   tree dest = CALL_EXPR_ARG (exp, 0);
4342   tree size = CALL_EXPR_ARG (exp, 1);
4343
4344   check_memop_access (exp, dest, NULL_TREE, size);
4345
4346   /* New argument list transforming bzero(ptr x, int y) to
4347      memset(ptr x, int 0, size_t y).   This is done this way
4348      so that if it isn't expanded inline, we fallback to
4349      calling bzero instead of memset.  */
4350
4351   location_t loc = EXPR_LOCATION (exp);
4352
4353   return expand_builtin_memset_args (dest, integer_zero_node,
4354                                      fold_convert_loc (loc,
4355                                                        size_type_node, size),
4356                                      const0_rtx, VOIDmode, exp);
4357 }
4358
4359 /* Try to expand cmpstr operation ICODE with the given operands.
4360    Return the result rtx on success, otherwise return null.  */
4361
4362 static rtx
4363 expand_cmpstr (insn_code icode, rtx target, rtx arg1_rtx, rtx arg2_rtx,
4364                HOST_WIDE_INT align)
4365 {
4366   machine_mode insn_mode = insn_data[icode].operand[0].mode;
4367
4368   if (target && (!REG_P (target) || HARD_REGISTER_P (target)))
4369     target = NULL_RTX;
4370
4371   struct expand_operand ops[4];
4372   create_output_operand (&ops[0], target, insn_mode);
4373   create_fixed_operand (&ops[1], arg1_rtx);
4374   create_fixed_operand (&ops[2], arg2_rtx);
4375   create_integer_operand (&ops[3], align);
4376   if (maybe_expand_insn (icode, 4, ops))
4377     return ops[0].value;
4378   return NULL_RTX;
4379 }
4380
4381 /* Expand expression EXP, which is a call to the memcmp built-in function.
4382    Return NULL_RTX if we failed and the caller should emit a normal call,
4383    otherwise try to get the result in TARGET, if convenient.
4384    RESULT_EQ is true if we can relax the returned value to be either zero
4385    or nonzero, without caring about the sign.  */
4386
4387 static rtx
4388 expand_builtin_memcmp (tree exp, rtx target, bool result_eq)
4389 {
4390   if (!validate_arglist (exp,
4391                          POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4392     return NULL_RTX;
4393
4394   tree arg1 = CALL_EXPR_ARG (exp, 0);
4395   tree arg2 = CALL_EXPR_ARG (exp, 1);
4396   tree len = CALL_EXPR_ARG (exp, 2);
4397
4398   /* Diagnose calls where the specified length exceeds the size of either
4399      object.  */
4400   if (warn_stringop_overflow)
4401     {
4402       tree size = compute_objsize (arg1, 0);
4403       if (check_access (exp, /*dst=*/NULL_TREE, /*src=*/NULL_TREE, len,
4404                         /*maxread=*/NULL_TREE, size, /*objsize=*/NULL_TREE))
4405         {
4406           size = compute_objsize (arg2, 0);
4407           check_access (exp, /*dst=*/NULL_TREE, /*src=*/NULL_TREE, len,
4408                         /*maxread=*/NULL_TREE, size, /*objsize=*/NULL_TREE);
4409         }
4410     }
4411
4412   machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
4413   location_t loc = EXPR_LOCATION (exp);
4414
4415   unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
4416   unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
4417
4418   /* If we don't have POINTER_TYPE, call the function.  */
4419   if (arg1_align == 0 || arg2_align == 0)
4420     return NULL_RTX;
4421
4422   rtx arg1_rtx = get_memory_rtx (arg1, len);
4423   rtx arg2_rtx = get_memory_rtx (arg2, len);
4424   rtx len_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
4425
4426   /* Set MEM_SIZE as appropriate.  */
4427   if (CONST_INT_P (len_rtx))
4428     {
4429       set_mem_size (arg1_rtx, INTVAL (len_rtx));
4430       set_mem_size (arg2_rtx, INTVAL (len_rtx));
4431     }
4432
4433   by_pieces_constfn constfn = NULL;
4434
4435   const char *src_str = c_getstr (arg2);
4436   if (result_eq && src_str == NULL)
4437     {
4438       src_str = c_getstr (arg1);
4439       if (src_str != NULL)
4440         std::swap (arg1_rtx, arg2_rtx);
4441     }
4442
4443   /* If SRC is a string constant and block move would be done
4444      by pieces, we can avoid loading the string from memory
4445      and only stored the computed constants.  */
4446   if (src_str
4447       && CONST_INT_P (len_rtx)
4448       && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1)
4449     constfn = builtin_memcpy_read_str;
4450
4451   rtx result = emit_block_cmp_hints (arg1_rtx, arg2_rtx, len_rtx,
4452                                      TREE_TYPE (len), target,
4453                                      result_eq, constfn,
4454                                      CONST_CAST (char *, src_str));
4455
4456   if (result)
4457     {
4458       /* Return the value in the proper mode for this function.  */
4459       if (GET_MODE (result) == mode)
4460         return result;
4461
4462       if (target != 0)
4463         {
4464           convert_move (target, result, 0);
4465           return target;
4466         }
4467
4468       return convert_to_mode (mode, result, 0);
4469     }
4470
4471   return NULL_RTX;
4472 }
4473
4474 /* Expand expression EXP, which is a call to the strcmp builtin.  Return NULL_RTX
4475    if we failed the caller should emit a normal call, otherwise try to get
4476    the result in TARGET, if convenient.  */
4477
4478 static rtx
4479 expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
4480 {
4481   if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4482     return NULL_RTX;
4483
4484   insn_code cmpstr_icode = direct_optab_handler (cmpstr_optab, SImode);
4485   insn_code cmpstrn_icode = direct_optab_handler (cmpstrn_optab, SImode);
4486   if (cmpstr_icode == CODE_FOR_nothing && cmpstrn_icode == CODE_FOR_nothing)
4487     return NULL_RTX;
4488
4489   tree arg1 = CALL_EXPR_ARG (exp, 0);
4490   tree arg2 = CALL_EXPR_ARG (exp, 1);
4491
4492   unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
4493   unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
4494
4495   /* If we don't have POINTER_TYPE, call the function.  */
4496   if (arg1_align == 0 || arg2_align == 0)
4497     return NULL_RTX;
4498
4499   /* Stabilize the arguments in case gen_cmpstr(n)si fail.  */
4500   arg1 = builtin_save_expr (arg1);
4501   arg2 = builtin_save_expr (arg2);
4502
4503   rtx arg1_rtx = get_memory_rtx (arg1, NULL);
4504   rtx arg2_rtx = get_memory_rtx (arg2, NULL);
4505
4506   rtx result = NULL_RTX;
4507   /* Try to call cmpstrsi.  */
4508   if (cmpstr_icode != CODE_FOR_nothing)
4509     result = expand_cmpstr (cmpstr_icode, target, arg1_rtx, arg2_rtx,
4510                             MIN (arg1_align, arg2_align));
4511
4512   /* Try to determine at least one length and call cmpstrnsi.  */
4513   if (!result && cmpstrn_icode != CODE_FOR_nothing)
4514     {
4515       tree len;
4516       rtx arg3_rtx;
4517
4518       tree len1 = c_strlen (arg1, 1);
4519       tree len2 = c_strlen (arg2, 1);
4520
4521       if (len1)
4522         len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
4523       if (len2)
4524         len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
4525
4526       /* If we don't have a constant length for the first, use the length
4527          of the second, if we know it.  We don't require a constant for
4528          this case; some cost analysis could be done if both are available
4529          but neither is constant.  For now, assume they're equally cheap,
4530          unless one has side effects.  If both strings have constant lengths,
4531          use the smaller.  */
4532
4533       if (!len1)
4534         len = len2;
4535       else if (!len2)
4536         len = len1;
4537       else if (TREE_SIDE_EFFECTS (len1))
4538         len = len2;
4539       else if (TREE_SIDE_EFFECTS (len2))
4540         len = len1;
4541       else if (TREE_CODE (len1) != INTEGER_CST)
4542         len = len2;
4543       else if (TREE_CODE (len2) != INTEGER_CST)
4544         len = len1;
4545       else if (tree_int_cst_lt (len1, len2))
4546         len = len1;
4547       else
4548         len = len2;
4549
4550       /* If both arguments have side effects, we cannot optimize.  */
4551       if (len && !TREE_SIDE_EFFECTS (len))
4552         {
4553           arg3_rtx = expand_normal (len);
4554           result = expand_cmpstrn_or_cmpmem
4555             (cmpstrn_icode, target, arg1_rtx, arg2_rtx, TREE_TYPE (len),
4556              arg3_rtx, MIN (arg1_align, arg2_align));
4557         }
4558     }
4559
4560   /* Check to see if the argument was declared attribute nonstring
4561      and if so, issue a warning since at this point it's not known
4562      to be nul-terminated.  */
4563   tree fndecl = get_callee_fndecl (exp);
4564   maybe_warn_nonstring_arg (fndecl, exp);
4565
4566   if (result)
4567     {
4568       /* Return the value in the proper mode for this function.  */
4569       machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
4570       if (GET_MODE (result) == mode)
4571         return result;
4572       if (target == 0)
4573         return convert_to_mode (mode, result, 0);
4574       convert_move (target, result, 0);
4575       return target;
4576     }
4577
4578   /* Expand the library call ourselves using a stabilized argument
4579      list to avoid re-evaluating the function's arguments twice.  */
4580   tree fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 2, arg1, arg2);
4581   gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4582   CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4583   return expand_call (fn, target, target == const0_rtx);
4584 }
4585
4586 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4587    NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4588    the result in TARGET, if convenient.  */
4589
4590 static rtx
4591 expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
4592                         ATTRIBUTE_UNUSED machine_mode mode)
4593 {
4594   if (!validate_arglist (exp,
4595                          POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4596     return NULL_RTX;
4597
4598   /* If c_strlen can determine an expression for one of the string
4599      lengths, and it doesn't have side effects, then emit cmpstrnsi
4600      using length MIN(strlen(string)+1, arg3).  */
4601   insn_code cmpstrn_icode = direct_optab_handler (cmpstrn_optab, SImode);
4602   if (cmpstrn_icode == CODE_FOR_nothing)
4603     return NULL_RTX;
4604
4605   tree len;
4606
4607   tree arg1 = CALL_EXPR_ARG (exp, 0);
4608   tree arg2 = CALL_EXPR_ARG (exp, 1);
4609   tree arg3 = CALL_EXPR_ARG (exp, 2);
4610
4611   unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
4612   unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
4613
4614   tree len1 = c_strlen (arg1, 1);
4615   tree len2 = c_strlen (arg2, 1);
4616
4617   location_t loc = EXPR_LOCATION (exp);
4618
4619   if (len1)
4620     len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
4621   if (len2)
4622     len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
4623
4624   tree len3 = fold_convert_loc (loc, sizetype, arg3);
4625
4626   /* If we don't have a constant length for the first, use the length
4627      of the second, if we know it.  If neither string is constant length,
4628      use the given length argument.  We don't require a constant for
4629      this case; some cost analysis could be done if both are available
4630      but neither is constant.  For now, assume they're equally cheap,
4631      unless one has side effects.  If both strings have constant lengths,
4632      use the smaller.  */
4633
4634   if (!len1 && !len2)
4635     len = len3;
4636   else if (!len1)
4637     len = len2;
4638   else if (!len2)
4639     len = len1;
4640   else if (TREE_SIDE_EFFECTS (len1))
4641     len = len2;
4642   else if (TREE_SIDE_EFFECTS (len2))
4643     len = len1;
4644   else if (TREE_CODE (len1) != INTEGER_CST)
4645     len = len2;
4646   else if (TREE_CODE (len2) != INTEGER_CST)
4647     len = len1;
4648   else if (tree_int_cst_lt (len1, len2))
4649     len = len1;
4650   else
4651     len = len2;
4652
4653   /* If we are not using the given length, we must incorporate it here.
4654      The actual new length parameter will be MIN(len,arg3) in this case.  */
4655   if (len != len3)
4656     len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len, len3);
4657   rtx arg1_rtx = get_memory_rtx (arg1, len);
4658   rtx arg2_rtx = get_memory_rtx (arg2, len);
4659   rtx arg3_rtx = expand_normal (len);
4660   rtx result = expand_cmpstrn_or_cmpmem (cmpstrn_icode, target, arg1_rtx,
4661                                          arg2_rtx, TREE_TYPE (len), arg3_rtx,
4662                                          MIN (arg1_align, arg2_align));
4663
4664   /* Check to see if the argument was declared attribute nonstring
4665      and if so, issue a warning since at this point it's not known
4666      to be nul-terminated.  */
4667   tree fndecl = get_callee_fndecl (exp);
4668   maybe_warn_nonstring_arg (fndecl, exp);
4669
4670   if (result)
4671     {
4672       /* Return the value in the proper mode for this function.  */
4673       mode = TYPE_MODE (TREE_TYPE (exp));
4674       if (GET_MODE (result) == mode)
4675         return result;
4676       if (target == 0)
4677         return convert_to_mode (mode, result, 0);
4678       convert_move (target, result, 0);
4679       return target;
4680     }
4681
4682   /* Expand the library call ourselves using a stabilized argument
4683      list to avoid re-evaluating the function's arguments twice.  */
4684   tree fn = build_call_nofold_loc (loc, fndecl, 3, arg1, arg2, len);
4685   gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4686   CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
4687   return expand_call (fn, target, target == const0_rtx);
4688 }
4689
4690 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4691    if that's convenient.  */
4692
4693 rtx
4694 expand_builtin_saveregs (void)
4695 {
4696   rtx val;
4697   rtx_insn *seq;
4698
4699   /* Don't do __builtin_saveregs more than once in a function.
4700      Save the result of the first call and reuse it.  */
4701   if (saveregs_value != 0)
4702     return saveregs_value;
4703
4704   /* When this function is called, it means that registers must be
4705      saved on entry to this function.  So we migrate the call to the
4706      first insn of this function.  */
4707
4708   start_sequence ();
4709
4710   /* Do whatever the machine needs done in this case.  */
4711   val = targetm.calls.expand_builtin_saveregs ();
4712
4713   seq = get_insns ();
4714   end_sequence ();
4715
4716   saveregs_value = val;
4717
4718   /* Put the insns after the NOTE that starts the function.  If this
4719      is inside a start_sequence, make the outer-level insn chain current, so
4720      the code is placed at the start of the function.  */
4721   push_topmost_sequence ();
4722   emit_insn_after (seq, entry_of_function ());
4723   pop_topmost_sequence ();
4724
4725   return val;
4726 }
4727
4728 /* Expand a call to __builtin_next_arg.  */
4729
4730 static rtx
4731 expand_builtin_next_arg (void)
4732 {
4733   /* Checking arguments is already done in fold_builtin_next_arg
4734      that must be called before this function.  */
4735   return expand_binop (ptr_mode, add_optab,
4736                        crtl->args.internal_arg_pointer,
4737                        crtl->args.arg_offset_rtx,
4738                        NULL_RTX, 0, OPTAB_LIB_WIDEN);
4739 }
4740
4741 /* Make it easier for the backends by protecting the valist argument
4742    from multiple evaluations.  */
4743
4744 static tree
4745 stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
4746 {
4747   tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist));
4748
4749   /* The current way of determining the type of valist is completely
4750      bogus.  We should have the information on the va builtin instead.  */
4751   if (!vatype)
4752     vatype = targetm.fn_abi_va_list (cfun->decl);
4753
4754   if (TREE_CODE (vatype) == ARRAY_TYPE)
4755     {
4756       if (TREE_SIDE_EFFECTS (valist))
4757         valist = save_expr (valist);
4758
4759       /* For this case, the backends will be expecting a pointer to
4760          vatype, but it's possible we've actually been given an array
4761          (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4762          So fix it.  */
4763       if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
4764         {
4765           tree p1 = build_pointer_type (TREE_TYPE (vatype));
4766           valist = build_fold_addr_expr_with_type_loc (loc, valist, p1);
4767         }
4768     }
4769   else
4770     {
4771       tree pt = build_pointer_type (vatype);
4772
4773       if (! needs_lvalue)
4774         {
4775           if (! TREE_SIDE_EFFECTS (valist))
4776             return valist;
4777
4778           valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist);
4779           TREE_SIDE_EFFECTS (valist) = 1;
4780         }
4781
4782       if (TREE_SIDE_EFFECTS (valist))
4783         valist = save_expr (valist);
4784       valist = fold_build2_loc (loc, MEM_REF,
4785                                 vatype, valist, build_int_cst (pt, 0));
4786     }
4787
4788   return valist;
4789 }
4790
4791 /* The "standard" definition of va_list is void*.  */
4792
4793 tree
4794 std_build_builtin_va_list (void)
4795 {
4796   return ptr_type_node;
4797 }
4798
4799 /* The "standard" abi va_list is va_list_type_node.  */
4800
4801 tree
4802 std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED)
4803 {
4804   return va_list_type_node;
4805 }
4806
4807 /* The "standard" type of va_list is va_list_type_node.  */
4808
4809 tree
4810 std_canonical_va_list_type (tree type)
4811 {
4812   tree wtype, htype;
4813
4814   wtype = va_list_type_node;
4815   htype = type;
4816
4817   if (TREE_CODE (wtype) == ARRAY_TYPE)
4818     {
4819       /* If va_list is an array type, the argument may have decayed
4820          to a pointer type, e.g. by being passed to another function.
4821          In that case, unwrap both types so that we can compare the
4822          underlying records.  */
4823       if (TREE_CODE (htype) == ARRAY_TYPE
4824           || POINTER_TYPE_P (htype))
4825         {
4826           wtype = TREE_TYPE (wtype);
4827           htype = TREE_TYPE (htype);
4828         }
4829     }
4830   if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype))
4831     return va_list_type_node;
4832
4833   return NULL_TREE;
4834 }
4835
4836 /* The "standard" implementation of va_start: just assign `nextarg' to
4837    the variable.  */
4838
4839 void
4840 std_expand_builtin_va_start (tree valist, rtx nextarg)
4841 {
4842   rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE);
4843   convert_move (va_r, nextarg, 0);
4844
4845   /* We do not have any valid bounds for the pointer, so
4846      just store zero bounds for it.  */
4847   if (chkp_function_instrumented_p (current_function_decl))
4848     chkp_expand_bounds_reset_for_mem (valist,
4849                                       make_tree (TREE_TYPE (valist),
4850                                                  nextarg));
4851 }
4852
4853 /* Expand EXP, a call to __builtin_va_start.  */
4854
4855 static rtx
4856 expand_builtin_va_start (tree exp)
4857 {
4858   rtx nextarg;
4859   tree valist;
4860   location_t loc = EXPR_LOCATION (exp);
4861
4862   if (call_expr_nargs (exp) < 2)
4863     {
4864       error_at (loc, "too few arguments to function %<va_start%>");
4865       return const0_rtx;
4866     }
4867
4868   if (fold_builtin_next_arg (exp, true))
4869     return const0_rtx;
4870
4871   nextarg = expand_builtin_next_arg ();
4872   valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
4873
4874   if (targetm.expand_builtin_va_start)
4875     targetm.expand_builtin_va_start (valist, nextarg);
4876   else
4877     std_expand_builtin_va_start (valist, nextarg);
4878
4879   return const0_rtx;
4880 }
4881
4882 /* Expand EXP, a call to __builtin_va_end.  */
4883
4884 static rtx
4885 expand_builtin_va_end (tree exp)
4886 {
4887   tree valist = CALL_EXPR_ARG (exp, 0);
4888
4889   /* Evaluate for side effects, if needed.  I hate macros that don't
4890      do that.  */
4891   if (TREE_SIDE_EFFECTS (valist))
4892     expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
4893
4894   return const0_rtx;
4895 }
4896
4897 /* Expand EXP, a call to __builtin_va_copy.  We do this as a
4898    builtin rather than just as an assignment in stdarg.h because of the
4899    nastiness of array-type va_list types.  */
4900
4901 static rtx
4902 expand_builtin_va_copy (tree exp)
4903 {
4904   tree dst, src, t;
4905   location_t loc = EXPR_LOCATION (exp);
4906
4907   dst = CALL_EXPR_ARG (exp, 0);
4908   src = CALL_EXPR_ARG (exp, 1);
4909
4910   dst = stabilize_va_list_loc (loc, dst, 1);
4911   src = stabilize_va_list_loc (loc, src, 0);
4912
4913   gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
4914
4915   if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE)
4916     {
4917       t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src);
4918       TREE_SIDE_EFFECTS (t) = 1;
4919       expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
4920     }
4921   else
4922     {
4923       rtx dstb, srcb, size;
4924
4925       /* Evaluate to pointers.  */
4926       dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
4927       srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
4928       size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
4929                   NULL_RTX, VOIDmode, EXPAND_NORMAL);
4930
4931       dstb = convert_memory_address (Pmode, dstb);
4932       srcb = convert_memory_address (Pmode, srcb);
4933
4934       /* "Dereference" to BLKmode memories.  */
4935       dstb = gen_rtx_MEM (BLKmode, dstb);
4936       set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
4937       set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4938       srcb = gen_rtx_MEM (BLKmode, srcb);
4939       set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
4940       set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
4941
4942       /* Copy.  */
4943       emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
4944     }
4945
4946   return const0_rtx;
4947 }
4948
4949 /* Expand a call to one of the builtin functions __builtin_frame_address or
4950    __builtin_return_address.  */
4951
4952 static rtx
4953 expand_builtin_frame_address (tree fndecl, tree exp)
4954 {
4955   /* The argument must be a nonnegative integer constant.
4956      It counts the number of frames to scan up the stack.
4957      The value is either the frame pointer value or the return
4958      address saved in that frame.  */
4959   if (call_expr_nargs (exp) == 0)
4960     /* Warning about missing arg was already issued.  */
4961     return const0_rtx;
4962   else if (! tree_fits_uhwi_p (CALL_EXPR_ARG (exp, 0)))
4963     {
4964       error ("invalid argument to %qD", fndecl);
4965       return const0_rtx;
4966     }
4967   else
4968     {
4969       /* Number of frames to scan up the stack.  */
4970       unsigned HOST_WIDE_INT count = tree_to_uhwi (CALL_EXPR_ARG (exp, 0));
4971
4972       rtx tem = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl), count);
4973
4974       /* Some ports cannot access arbitrary stack frames.  */
4975       if (tem == NULL)
4976         {
4977           warning (0, "unsupported argument to %qD", fndecl);
4978           return const0_rtx;
4979         }
4980
4981       if (count)
4982         {
4983           /* Warn since no effort is made to ensure that any frame
4984              beyond the current one exists or can be safely reached.  */
4985           warning (OPT_Wframe_address, "calling %qD with "
4986                    "a nonzero argument is unsafe", fndecl);
4987         }
4988
4989       /* For __builtin_frame_address, return what we've got.  */
4990       if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
4991         return tem;
4992
4993       if (!REG_P (tem)
4994           && ! CONSTANT_P (tem))
4995         tem = copy_addr_to_reg (tem);
4996       return tem;
4997     }
4998 }
4999
5000 /* Expand EXP, a call to the alloca builtin.  Return NULL_RTX if we
5001    failed and the caller should emit a normal call.  */
5002
5003 static rtx
5004 expand_builtin_alloca (tree exp)
5005 {
5006   rtx op0;
5007   rtx result;
5008   unsigned int align;
5009   tree fndecl = get_callee_fndecl (exp);
5010   HOST_WIDE_INT max_size;
5011   enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5012   bool alloca_for_var = CALL_ALLOCA_FOR_VAR_P (exp);
5013   bool valid_arglist
5014     = (fcode == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
5015        ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, INTEGER_TYPE,
5016                            VOID_TYPE)
5017        : fcode == BUILT_IN_ALLOCA_WITH_ALIGN
5018          ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE)
5019          : validate_arglist (exp, INTEGER_TYPE, VOID_TYPE));
5020
5021   if (!valid_arglist)
5022     return NULL_RTX;
5023
5024   if ((alloca_for_var && !warn_vla_limit)
5025       || (!alloca_for_var && !warn_alloca_limit))
5026     {
5027       /* -Walloca-larger-than and -Wvla-larger-than settings override
5028          the more general -Walloc-size-larger-than so unless either of
5029          the former options is specified check the alloca arguments for
5030          overflow.  */
5031       tree args[] = { CALL_EXPR_ARG (exp, 0), NULL_TREE };
5032       int idx[] = { 0, -1 };
5033       maybe_warn_alloc_args_overflow (fndecl, exp, args, idx);
5034     }
5035
5036   /* Compute the argument.  */
5037   op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
5038
5039   /* Compute the alignment.  */
5040   align = (fcode == BUILT_IN_ALLOCA
5041            ? BIGGEST_ALIGNMENT
5042            : TREE_INT_CST_LOW (CALL_EXPR_ARG (exp, 1)));
5043
5044   /* Compute the maximum size.  */
5045   max_size = (fcode == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
5046               ? TREE_INT_CST_LOW (CALL_EXPR_ARG (exp, 2))
5047               : -1);
5048
5049   /* Allocate the desired space.  If the allocation stems from the declaration
5050      of a variable-sized object, it cannot accumulate.  */
5051   result
5052     = allocate_dynamic_stack_space (op0, 0, align, max_size, alloca_for_var);
5053   result = convert_memory_address (ptr_mode, result);
5054
5055   return result;
5056 }
5057
5058 /* Emit a call to __asan_allocas_unpoison call in EXP.  Replace second argument
5059    of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
5060    dummy value into second parameter relying on this function to perform the
5061    change.  See motivation for this in comment to handle_builtin_stack_restore
5062    function.  */
5063
5064 static rtx
5065 expand_asan_emit_allocas_unpoison (tree exp)
5066 {
5067   tree arg0 = CALL_EXPR_ARG (exp, 0);
5068   rtx top = expand_expr (arg0, NULL_RTX, ptr_mode, EXPAND_NORMAL);
5069   rtx bot = convert_memory_address (ptr_mode, virtual_stack_dynamic_rtx);
5070   rtx ret = init_one_libfunc ("__asan_allocas_unpoison");
5071   ret = emit_library_call_value (ret, NULL_RTX, LCT_NORMAL, ptr_mode,
5072                                  top, ptr_mode, bot, ptr_mode);
5073   return ret;
5074 }
5075
5076 /* Expand a call to bswap builtin in EXP.
5077    Return NULL_RTX if a normal call should be emitted rather than expanding the
5078    function in-line.  If convenient, the result should be placed in TARGET.
5079    SUBTARGET may be used as the target for computing one of EXP's operands.  */
5080
5081 static rtx
5082 expand_builtin_bswap (machine_mode target_mode, tree exp, rtx target,
5083                       rtx subtarget)
5084 {
5085   tree arg;
5086   rtx op0;
5087
5088   if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
5089     return NULL_RTX;
5090
5091   arg = CALL_EXPR_ARG (exp, 0);
5092   op0 = expand_expr (arg,
5093                      subtarget && GET_MODE (subtarget) == target_mode
5094                      ? subtarget : NULL_RTX,
5095                      target_mode, EXPAND_NORMAL);
5096   if (GET_MODE (op0) != target_mode)
5097     op0 = convert_to_mode (target_mode, op0, 1);
5098
5099   target = expand_unop (target_mode, bswap_optab, op0, target, 1);
5100
5101   gcc_assert (target);
5102
5103   return convert_to_mode (target_mode, target, 1);
5104 }
5105
5106 /* Expand a call to a unary builtin in EXP.
5107    Return NULL_RTX if a normal call should be emitted rather than expanding the
5108    function in-line.  If convenient, the result should be placed in TARGET.
5109    SUBTARGET may be used as the target for computing one of EXP's operands.  */
5110
5111 static rtx
5112 expand_builtin_unop (machine_mode target_mode, tree exp, rtx target,
5113                      rtx subtarget, optab op_optab)
5114 {
5115   rtx op0;
5116
5117   if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
5118     return NULL_RTX;
5119
5120   /* Compute the argument.  */
5121   op0 = expand_expr (CALL_EXPR_ARG (exp, 0),
5122                      (subtarget
5123                       && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0)))
5124                           == GET_MODE (subtarget))) ? subtarget : NULL_RTX,
5125                      VOIDmode, EXPAND_NORMAL);
5126   /* Compute op, into TARGET if possible.
5127      Set TARGET to wherever the result comes back.  */
5128   target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
5129                         op_optab, op0, target, op_optab != clrsb_optab);
5130   gcc_assert (target);
5131
5132   return convert_to_mode (target_mode, target, 0);
5133 }
5134
5135 /* Expand a call to __builtin_expect.  We just return our argument
5136    as the builtin_expect semantic should've been already executed by
5137    tree branch prediction pass. */
5138
5139 static rtx
5140 expand_builtin_expect (tree exp, rtx target)
5141 {
5142   tree arg;
5143
5144   if (call_expr_nargs (exp) < 2)
5145     return const0_rtx;
5146   arg = CALL_EXPR_ARG (exp, 0);
5147
5148   target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5149   /* When guessing was done, the hints should be already stripped away.  */
5150   gcc_assert (!flag_guess_branch_prob
5151               || optimize == 0 || seen_error ());
5152   return target;
5153 }
5154
5155 /* Expand a call to __builtin_assume_aligned.  We just return our first
5156    argument as the builtin_assume_aligned semantic should've been already
5157    executed by CCP.  */
5158
5159 static rtx
5160 expand_builtin_assume_aligned (tree exp, rtx target)
5161 {
5162   if (call_expr_nargs (exp) < 2)
5163     return const0_rtx;
5164   target = expand_expr (CALL_EXPR_ARG (exp, 0), target, VOIDmode,
5165                         EXPAND_NORMAL);
5166   gcc_assert (!TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 1))
5167               && (call_expr_nargs (exp) < 3
5168                   || !TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 2))));
5169   return target;
5170 }
5171
5172 void
5173 expand_builtin_trap (void)
5174 {
5175   if (targetm.have_trap ())
5176     {
5177       rtx_insn *insn = emit_insn (targetm.gen_trap ());
5178       /* For trap insns when not accumulating outgoing args force
5179          REG_ARGS_SIZE note to prevent crossjumping of calls with
5180          different args sizes.  */
5181       if (!ACCUMULATE_OUTGOING_ARGS)
5182         add_args_size_note (insn, stack_pointer_delta);
5183     }
5184   else
5185     {
5186       tree fn = builtin_decl_implicit (BUILT_IN_ABORT);
5187       tree call_expr = build_call_expr (fn, 0);
5188       expand_call (call_expr, NULL_RTX, false);
5189     }
5190
5191   emit_barrier ();
5192 }
5193
5194 /* Expand a call to __builtin_unreachable.  We do nothing except emit
5195    a barrier saying that control flow will not pass here.
5196
5197    It is the responsibility of the program being compiled to ensure
5198    that control flow does never reach __builtin_unreachable.  */
5199 static void
5200 expand_builtin_unreachable (void)
5201 {
5202   emit_barrier ();
5203 }
5204
5205 /* Expand EXP, a call to fabs, fabsf or fabsl.
5206    Return NULL_RTX if a normal call should be emitted rather than expanding
5207    the function inline.  If convenient, the result should be placed
5208    in TARGET.  SUBTARGET may be used as the target for computing
5209    the operand.  */
5210
5211 static rtx
5212 expand_builtin_fabs (tree exp, rtx target, rtx subtarget)
5213 {
5214   machine_mode mode;
5215   tree arg;
5216   rtx op0;
5217
5218   if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
5219     return NULL_RTX;
5220
5221   arg = CALL_EXPR_ARG (exp, 0);
5222   CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
5223   mode = TYPE_MODE (TREE_TYPE (arg));
5224   op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
5225   return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
5226 }
5227
5228 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5229    Return NULL is a normal call should be emitted rather than expanding the
5230    function inline.  If convenient, the result should be placed in TARGET.
5231    SUBTARGET may be used as the target for computing the operand.  */
5232
5233 static rtx
5234 expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
5235 {
5236   rtx op0, op1;
5237   tree arg;
5238
5239   if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
5240     return NULL_RTX;
5241
5242   arg = CALL_EXPR_ARG (exp, 0);
5243   op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
5244
5245   arg = CALL_EXPR_ARG (exp, 1);
5246   op1 = expand_normal (arg);
5247
5248   return expand_copysign (op0, op1, target);
5249 }
5250
5251 /* Expand a call to __builtin___clear_cache.  */
5252
5253 static rtx
5254 expand_builtin___clear_cache (tree exp)
5255 {
5256   if (!targetm.code_for_clear_cache)
5257     {
5258 #ifdef CLEAR_INSN_CACHE
5259       /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5260          does something.  Just do the default expansion to a call to
5261          __clear_cache().  */
5262       return NULL_RTX;
5263 #else
5264       /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5265          does nothing.  There is no need to call it.  Do nothing.  */
5266       return const0_rtx;
5267 #endif /* CLEAR_INSN_CACHE */
5268     }
5269
5270   /* We have a "clear_cache" insn, and it will handle everything.  */
5271   tree begin, end;
5272   rtx begin_rtx, end_rtx;
5273
5274   /* We must not expand to a library call.  If we did, any
5275      fallback library function in libgcc that might contain a call to
5276      __builtin___clear_cache() would recurse infinitely.  */
5277   if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
5278     {
5279       error ("both arguments to %<__builtin___clear_cache%> must be pointers");
5280       return const0_rtx;
5281     }
5282
5283   if (targetm.have_clear_cache ())
5284     {
5285       struct expand_operand ops[2];
5286
5287       begin = CALL_EXPR_ARG (exp, 0);
5288       begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL);
5289
5290       end = CALL_EXPR_ARG (exp, 1);
5291       end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL);
5292
5293       create_address_operand (&ops[0], begin_rtx);
5294       create_address_operand (&ops[1], end_rtx);
5295       if (maybe_expand_insn (targetm.code_for_clear_cache, 2, ops))
5296         return const0_rtx;
5297     }
5298   return const0_rtx;
5299 }
5300
5301 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT.  */
5302
5303 static rtx
5304 round_trampoline_addr (rtx tramp)
5305 {
5306   rtx temp, addend, mask;
5307
5308   /* If we don't need too much alignment, we'll have been guaranteed
5309      proper alignment by get_trampoline_type.  */
5310   if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
5311     return tramp;
5312
5313   /* Round address up to desired boundary.  */
5314   temp = gen_reg_rtx (Pmode);
5315   addend = gen_int_mode (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1, Pmode);
5316   mask = gen_int_mode (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT, Pmode);
5317
5318   temp  = expand_simple_binop (Pmode, PLUS, tramp, addend,
5319                                temp, 0, OPTAB_LIB_WIDEN);
5320   tramp = expand_simple_binop (Pmode, AND, temp, mask,
5321                                temp, 0, OPTAB_LIB_WIDEN);
5322
5323   return tramp;
5324 }
5325
5326 static rtx
5327 expand_builtin_init_trampoline (tree exp, bool onstack)
5328 {
5329   tree t_tramp, t_func, t_chain;
5330   rtx m_tramp, r_tramp, r_chain, tmp;
5331
5332   if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
5333                          POINTER_TYPE, VOID_TYPE))
5334     return NULL_RTX;
5335
5336   t_tramp = CALL_EXPR_ARG (exp, 0);
5337   t_func = CALL_EXPR_ARG (exp, 1);
5338   t_chain = CALL_EXPR_ARG (exp, 2);
5339
5340   r_tramp = expand_normal (t_tramp);
5341   m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
5342   MEM_NOTRAP_P (m_tramp) = 1;
5343
5344   /* If ONSTACK, the TRAMP argument should be the address of a field
5345      within the local function's FRAME decl.  Either way, let's see if
5346      we can fill in the MEM_ATTRs for this memory.  */
5347   if (TREE_CODE (t_tramp) == ADDR_EXPR)
5348     set_mem_attributes (m_tramp, TREE_OPERAND (t_tramp, 0), true);
5349
5350   /* Creator of a heap trampoline is responsible for making sure the
5351      address is aligned to at least STACK_BOUNDARY.  Normally malloc
5352      will ensure this anyhow.  */
5353   tmp = round_trampoline_addr (r_tramp);
5354   if (tmp != r_tramp)
5355     {
5356       m_tramp = change_address (m_tramp, BLKmode, tmp);
5357       set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT);
5358       set_mem_size (m_tramp, TRAMPOLINE_SIZE);
5359     }
5360
5361   /* The FUNC argument should be the address of the nested function.
5362      Extract the actual function decl to pass to the hook.  */
5363   gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
5364   t_func = TREE_OPERAND (t_func, 0);
5365   gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
5366
5367   r_chain = expand_normal (t_chain);
5368
5369   /* Generate insns to initialize the trampoline.  */
5370   targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
5371
5372   if (onstack)
5373     {
5374       trampolines_created = 1;
5375
5376       if (targetm.calls.custom_function_descriptors != 0)
5377         warning_at (DECL_SOURCE_LOCATION (t_func), OPT_Wtrampolines,
5378                     "trampoline generated for nested function %qD", t_func);
5379     }
5380
5381   return const0_rtx;
5382 }
5383
5384 static rtx
5385 expand_builtin_adjust_trampoline (tree exp)
5386 {
5387   rtx tramp;
5388
5389   if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5390     return NULL_RTX;
5391
5392   tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
5393   tramp = round_trampoline_addr (tramp);
5394   if (targetm.calls.trampoline_adjust_address)
5395     tramp = targetm.calls.trampoline_adjust_address (tramp);
5396
5397   return tramp;
5398 }
5399
5400 /* Expand a call to the builtin descriptor initialization routine.
5401    A descriptor is made up of a couple of pointers to the static
5402    chain and the code entry in this order.  */
5403
5404 static rtx
5405 expand_builtin_init_descriptor (tree exp)
5406 {
5407   tree t_descr, t_func, t_chain;
5408   rtx m_descr, r_descr, r_func, r_chain;
5409
5410   if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, POINTER_TYPE,
5411                          VOID_TYPE))
5412     return NULL_RTX;
5413
5414   t_descr = CALL_EXPR_ARG (exp, 0);
5415   t_func = CALL_EXPR_ARG (exp, 1);
5416   t_chain = CALL_EXPR_ARG (exp, 2);
5417
5418   r_descr = expand_normal (t_descr);
5419   m_descr = gen_rtx_MEM (BLKmode, r_descr);
5420   MEM_NOTRAP_P (m_descr) = 1;
5421
5422   r_func = expand_normal (t_func);
5423   r_chain = expand_normal (t_chain);
5424
5425   /* Generate insns to initialize the descriptor.  */
5426   emit_move_insn (adjust_address_nv (m_descr, ptr_mode, 0), r_chain);
5427   emit_move_insn (adjust_address_nv (m_descr, ptr_mode,
5428                                      POINTER_SIZE / BITS_PER_UNIT), r_func);
5429
5430   return const0_rtx;
5431 }
5432
5433 /* Expand a call to the builtin descriptor adjustment routine.  */
5434
5435 static rtx
5436 expand_builtin_adjust_descriptor (tree exp)
5437 {
5438   rtx tramp;
5439
5440   if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5441     return NULL_RTX;
5442
5443   tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
5444
5445   /* Unalign the descriptor to allow runtime identification.  */
5446   tramp = plus_constant (ptr_mode, tramp,
5447                          targetm.calls.custom_function_descriptors);
5448
5449   return force_operand (tramp, NULL_RTX);
5450 }
5451
5452 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5453    function.  The function first checks whether the back end provides
5454    an insn to implement signbit for the respective mode.  If not, it
5455    checks whether the floating point format of the value is such that
5456    the sign bit can be extracted.  If that is not the case, error out.
5457    EXP is the expression that is a call to the builtin function; if
5458    convenient, the result should be placed in TARGET.  */
5459 static rtx
5460 expand_builtin_signbit (tree exp, rtx target)
5461 {
5462   const struct real_format *fmt;
5463   scalar_float_mode fmode;
5464   scalar_int_mode rmode, imode;
5465   tree arg;
5466   int word, bitpos;
5467   enum insn_code icode;
5468   rtx temp;
5469   location_t loc = EXPR_LOCATION (exp);
5470
5471   if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
5472     return NULL_RTX;
5473
5474   arg = CALL_EXPR_ARG (exp, 0);
5475   fmode = SCALAR_FLOAT_TYPE_MODE (TREE_TYPE (arg));
5476   rmode = SCALAR_INT_TYPE_MODE (TREE_TYPE (exp));
5477   fmt = REAL_MODE_FORMAT (fmode);
5478
5479   arg = builtin_save_expr (arg);
5480
5481   /* Expand the argument yielding a RTX expression. */
5482   temp = expand_normal (arg);
5483
5484   /* Check if the back end provides an insn that handles signbit for the
5485      argument's mode. */
5486   icode = optab_handler (signbit_optab, fmode);
5487   if (icode != CODE_FOR_nothing)
5488     {
5489       rtx_insn *last = get_last_insn ();
5490       target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
5491       if (maybe_emit_unop_insn (icode, target, temp, UNKNOWN))
5492         return target;
5493       delete_insns_since (last);
5494     }
5495
5496   /* For floating point formats without a sign bit, implement signbit
5497      as "ARG < 0.0".  */
5498   bitpos = fmt->signbit_ro;
5499   if (bitpos < 0)
5500   {
5501     /* But we can't do this if the format supports signed zero.  */
5502     gcc_assert (!fmt->has_signed_zero || !HONOR_SIGNED_ZEROS (fmode));
5503
5504     arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg,
5505                        build_real (TREE_TYPE (arg), dconst0));
5506     return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5507   }
5508
5509   if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
5510     {
5511       imode = int_mode_for_mode (fmode).require ();
5512       temp = gen_lowpart (imode, temp);
5513     }
5514   else
5515     {
5516       imode = word_mode;
5517       /* Handle targets with different FP word orders.  */
5518       if (FLOAT_WORDS_BIG_ENDIAN)
5519         word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
5520       else
5521         word = bitpos / BITS_PER_WORD;
5522       temp = operand_subword_force (temp, word, fmode);
5523       bitpos = bitpos % BITS_PER_WORD;
5524     }
5525
5526   /* Force the intermediate word_mode (or narrower) result into a
5527      register.  This avoids attempting to create paradoxical SUBREGs
5528      of floating point modes below.  */
5529   temp = force_reg (imode, temp);
5530
5531   /* If the bitpos is within the "result mode" lowpart, the operation
5532      can be implement with a single bitwise AND.  Otherwise, we need
5533      a right shift and an AND.  */
5534
5535   if (bitpos < GET_MODE_BITSIZE (rmode))
5536     {
5537       wide_int mask = wi::set_bit_in_zero (bitpos, GET_MODE_PRECISION (rmode));
5538
5539       if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
5540         temp = gen_lowpart (rmode, temp);
5541       temp = expand_binop (rmode, and_optab, temp,
5542                            immed_wide_int_const (mask, rmode),
5543                            NULL_RTX, 1, OPTAB_LIB_WIDEN);
5544     }
5545   else
5546     {
5547       /* Perform a logical right shift to place the signbit in the least
5548          significant bit, then truncate the result to the desired mode
5549          and mask just this bit.  */
5550       temp = expand_shift (RSHIFT_EXPR, imode, temp, bitpos, NULL_RTX, 1);
5551       temp = gen_lowpart (rmode, temp);
5552       temp = expand_binop (rmode, and_optab, temp, const1_rtx,
5553                            NULL_RTX, 1, OPTAB_LIB_WIDEN);
5554     }
5555
5556   return temp;
5557 }
5558
5559 /* Expand fork or exec calls.  TARGET is the desired target of the
5560    call.  EXP is the call. FN is the
5561    identificator of the actual function.  IGNORE is nonzero if the
5562    value is to be ignored.  */
5563
5564 static rtx
5565 expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
5566 {
5567   tree id, decl;
5568   tree call;
5569
5570   /* If we are not profiling, just call the function.  */
5571   if (!profile_arc_flag)
5572     return NULL_RTX;
5573
5574   /* Otherwise call the wrapper.  This should be equivalent for the rest of
5575      compiler, so the code does not diverge, and the wrapper may run the
5576      code necessary for keeping the profiling sane.  */
5577
5578   switch (DECL_FUNCTION_CODE (fn))
5579     {
5580     case BUILT_IN_FORK:
5581       id = get_identifier ("__gcov_fork");
5582       break;
5583
5584     case BUILT_IN_EXECL:
5585       id = get_identifier ("__gcov_execl");
5586       break;
5587
5588     case BUILT_IN_EXECV:
5589       id = get_identifier ("__gcov_execv");
5590       break;
5591
5592     case BUILT_IN_EXECLP:
5593       id = get_identifier ("__gcov_execlp");
5594       break;
5595
5596     case BUILT_IN_EXECLE:
5597       id = get_identifier ("__gcov_execle");
5598       break;
5599
5600     case BUILT_IN_EXECVP:
5601       id = get_identifier ("__gcov_execvp");
5602       break;
5603
5604     case BUILT_IN_EXECVE:
5605       id = get_identifier ("__gcov_execve");
5606       break;
5607
5608     default:
5609       gcc_unreachable ();
5610     }
5611
5612   decl = build_decl (DECL_SOURCE_LOCATION (fn),
5613                      FUNCTION_DECL, id, TREE_TYPE (fn));
5614   DECL_EXTERNAL (decl) = 1;
5615   TREE_PUBLIC (decl) = 1;
5616   DECL_ARTIFICIAL (decl) = 1;
5617   TREE_NOTHROW (decl) = 1;
5618   DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5619   DECL_VISIBILITY_SPECIFIED (decl) = 1;
5620   call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0);
5621   return expand_call (call, target, ignore);
5622  }
5623
5624
5625 \f
5626 /* Reconstitute a mode for a __sync intrinsic operation.  Since the type of
5627    the pointer in these functions is void*, the tree optimizers may remove
5628    casts.  The mode computed in expand_builtin isn't reliable either, due
5629    to __sync_bool_compare_and_swap.
5630
5631    FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5632    group of builtins.  This gives us log2 of the mode size.  */
5633
5634 static inline machine_mode
5635 get_builtin_sync_mode (int fcode_diff)
5636 {
5637   /* The size is not negotiable, so ask not to get BLKmode in return
5638      if the target indicates that a smaller size would be better.  */
5639   return int_mode_for_size (BITS_PER_UNIT << fcode_diff, 0).require ();
5640 }
5641
5642 /* Expand the memory expression LOC and return the appropriate memory operand
5643    for the builtin_sync operations.  */
5644
5645 static rtx
5646 get_builtin_sync_mem (tree loc, machine_mode mode)
5647 {
5648   rtx addr, mem;
5649
5650   addr = expand_expr (loc, NULL_RTX, ptr_mode, EXPAND_SUM);
5651   addr = convert_memory_address (Pmode, addr);
5652
5653   /* Note that we explicitly do not want any alias information for this
5654      memory, so that we kill all other live memories.  Otherwise we don't
5655      satisfy the full barrier semantics of the intrinsic.  */
5656   mem = validize_mem (gen_rtx_MEM (mode, addr));
5657
5658   /* The alignment needs to be at least according to that of the mode.  */
5659   set_mem_align (mem, MAX (GET_MODE_ALIGNMENT (mode),
5660                            get_pointer_alignment (loc)));
5661   set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
5662   MEM_VOLATILE_P (mem) = 1;
5663
5664   return mem;
5665 }
5666
5667 /* Make sure an argument is in the right mode.
5668    EXP is the tree argument.
5669    MODE is the mode it should be in.  */
5670
5671 static rtx
5672 expand_expr_force_mode (tree exp, machine_mode mode)
5673 {
5674   rtx val;
5675   machine_mode old_mode;
5676
5677   val = expand_expr (exp, NULL_RTX, mode, EXPAND_NORMAL);
5678   /* If VAL is promoted to a wider mode, convert it back to MODE.  Take care
5679      of CONST_INTs, where we know the old_mode only from the call argument.  */
5680
5681   old_mode = GET_MODE (val);
5682   if (old_mode == VOIDmode)
5683     old_mode = TYPE_MODE (TREE_TYPE (exp));
5684   val = convert_modes (mode, old_mode, val, 1);
5685   return val;
5686 }
5687
5688
5689 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5690    EXP is the CALL_EXPR.  CODE is the rtx code
5691    that corresponds to the arithmetic or logical operation from the name;
5692    an exception here is that NOT actually means NAND.  TARGET is an optional
5693    place for us to store the results; AFTER is true if this is the
5694    fetch_and_xxx form.  */
5695
5696 static rtx
5697 expand_builtin_sync_operation (machine_mode mode, tree exp,
5698                                enum rtx_code code, bool after,
5699                                rtx target)
5700 {
5701   rtx val, mem;
5702   location_t loc = EXPR_LOCATION (exp);
5703
5704   if (code == NOT && warn_sync_nand)
5705     {
5706       tree fndecl = get_callee_fndecl (exp);
5707       enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5708
5709       static bool warned_f_a_n, warned_n_a_f;
5710
5711       switch (fcode)
5712         {
5713         case BUILT_IN_SYNC_FETCH_AND_NAND_1:
5714         case BUILT_IN_SYNC_FETCH_AND_NAND_2:
5715         case BUILT_IN_SYNC_FETCH_AND_NAND_4:
5716         case BUILT_IN_SYNC_FETCH_AND_NAND_8:
5717         case BUILT_IN_SYNC_FETCH_AND_NAND_16:
5718           if (warned_f_a_n)
5719             break;
5720
5721           fndecl = builtin_decl_implicit (BUILT_IN_SYNC_FETCH_AND_NAND_N);
5722           inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5723           warned_f_a_n = true;
5724           break;
5725
5726         case BUILT_IN_SYNC_NAND_AND_FETCH_1:
5727         case BUILT_IN_SYNC_NAND_AND_FETCH_2:
5728         case BUILT_IN_SYNC_NAND_AND_FETCH_4:
5729         case BUILT_IN_SYNC_NAND_AND_FETCH_8:
5730         case BUILT_IN_SYNC_NAND_AND_FETCH_16:
5731           if (warned_n_a_f)
5732             break;
5733
5734          fndecl = builtin_decl_implicit (BUILT_IN_SYNC_NAND_AND_FETCH_N);
5735           inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
5736           warned_n_a_f = true;
5737           break;
5738
5739         default:
5740           gcc_unreachable ();
5741         }
5742     }
5743
5744   /* Expand the operands.  */
5745   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5746   val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5747
5748   return expand_atomic_fetch_op (target, mem, val, code, MEMMODEL_SYNC_SEQ_CST,
5749                                  after);
5750 }
5751
5752 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5753    intrinsics. EXP is the CALL_EXPR.  IS_BOOL is
5754    true if this is the boolean form.  TARGET is a place for us to store the
5755    results; this is NOT optional if IS_BOOL is true.  */
5756
5757 static rtx
5758 expand_builtin_compare_and_swap (machine_mode mode, tree exp,
5759                                  bool is_bool, rtx target)
5760 {
5761   rtx old_val, new_val, mem;
5762   rtx *pbool, *poval;
5763
5764   /* Expand the operands.  */
5765   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5766   old_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5767   new_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
5768
5769   pbool = poval = NULL;
5770   if (target != const0_rtx)
5771     {
5772       if (is_bool)
5773         pbool = &target;
5774       else
5775         poval = &target;
5776     }
5777   if (!expand_atomic_compare_and_swap (pbool, poval, mem, old_val, new_val,
5778                                        false, MEMMODEL_SYNC_SEQ_CST,
5779                                        MEMMODEL_SYNC_SEQ_CST))
5780     return NULL_RTX;
5781
5782   return target;
5783 }
5784
5785 /* Expand the __sync_lock_test_and_set intrinsic.  Note that the most
5786    general form is actually an atomic exchange, and some targets only
5787    support a reduced form with the second argument being a constant 1.
5788    EXP is the CALL_EXPR; TARGET is an optional place for us to store
5789    the results.  */
5790
5791 static rtx
5792 expand_builtin_sync_lock_test_and_set (machine_mode mode, tree exp,
5793                                        rtx target)
5794 {
5795   rtx val, mem;
5796
5797   /* Expand the operands.  */
5798   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5799   val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5800
5801   return expand_sync_lock_test_and_set (target, mem, val);
5802 }
5803
5804 /* Expand the __sync_lock_release intrinsic.  EXP is the CALL_EXPR.  */
5805
5806 static void
5807 expand_builtin_sync_lock_release (machine_mode mode, tree exp)
5808 {
5809   rtx mem;
5810
5811   /* Expand the operands.  */
5812   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5813
5814   expand_atomic_store (mem, const0_rtx, MEMMODEL_SYNC_RELEASE, true);
5815 }
5816
5817 /* Given an integer representing an ``enum memmodel'', verify its
5818    correctness and return the memory model enum.  */
5819
5820 static enum memmodel
5821 get_memmodel (tree exp)
5822 {
5823   rtx op;
5824   unsigned HOST_WIDE_INT val;
5825   source_location loc
5826     = expansion_point_location_if_in_system_header (input_location);
5827
5828   /* If the parameter is not a constant, it's a run time value so we'll just
5829      convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking.  */
5830   if (TREE_CODE (exp) != INTEGER_CST)
5831     return MEMMODEL_SEQ_CST;
5832
5833   op = expand_normal (exp);
5834
5835   val = INTVAL (op);
5836   if (targetm.memmodel_check)
5837     val = targetm.memmodel_check (val);
5838   else if (val & ~MEMMODEL_MASK)
5839     {
5840       warning_at (loc, OPT_Winvalid_memory_model,
5841                   "unknown architecture specifier in memory model to builtin");
5842       return MEMMODEL_SEQ_CST;
5843     }
5844
5845   /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5846   if (memmodel_base (val) >= MEMMODEL_LAST)
5847     {
5848       warning_at (loc, OPT_Winvalid_memory_model,
5849                   "invalid memory model argument to builtin");
5850       return MEMMODEL_SEQ_CST;
5851     }
5852
5853   /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5854      be conservative and promote consume to acquire.  */
5855   if (val == MEMMODEL_CONSUME)
5856     val = MEMMODEL_ACQUIRE;
5857
5858   return (enum memmodel) val;
5859 }
5860
5861 /* Expand the __atomic_exchange intrinsic:
5862         TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5863    EXP is the CALL_EXPR.
5864    TARGET is an optional place for us to store the results.  */
5865
5866 static rtx
5867 expand_builtin_atomic_exchange (machine_mode mode, tree exp, rtx target)
5868 {
5869   rtx val, mem;
5870   enum memmodel model;
5871
5872   model = get_memmodel (CALL_EXPR_ARG (exp, 2));
5873
5874   if (!flag_inline_atomics)
5875     return NULL_RTX;
5876
5877   /* Expand the operands.  */
5878   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5879   val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
5880
5881   return expand_atomic_exchange (target, mem, val, model);
5882 }
5883
5884 /* Expand the __atomic_compare_exchange intrinsic:
5885         bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5886                                         TYPE desired, BOOL weak,
5887                                         enum memmodel success,
5888                                         enum memmodel failure)
5889    EXP is the CALL_EXPR.
5890    TARGET is an optional place for us to store the results.  */
5891
5892 static rtx
5893 expand_builtin_atomic_compare_exchange (machine_mode mode, tree exp,
5894                                         rtx target)
5895 {
5896   rtx expect, desired, mem, oldval;
5897   rtx_code_label *label;
5898   enum memmodel success, failure;
5899   tree weak;
5900   bool is_weak;
5901   source_location loc
5902     = expansion_point_location_if_in_system_header (input_location);
5903
5904   success = get_memmodel (CALL_EXPR_ARG (exp, 4));
5905   failure = get_memmodel (CALL_EXPR_ARG (exp, 5));
5906
5907   if (failure > success)
5908     {
5909       warning_at (loc, OPT_Winvalid_memory_model,
5910                   "failure memory model cannot be stronger than success "
5911                   "memory model for %<__atomic_compare_exchange%>");
5912       success = MEMMODEL_SEQ_CST;
5913     }
5914
5915   if (is_mm_release (failure) || is_mm_acq_rel (failure))
5916     {
5917       warning_at (loc, OPT_Winvalid_memory_model,
5918                   "invalid failure memory model for "
5919                   "%<__atomic_compare_exchange%>");
5920       failure = MEMMODEL_SEQ_CST;
5921       success = MEMMODEL_SEQ_CST;
5922     }
5923
5924
5925   if (!flag_inline_atomics)
5926     return NULL_RTX;
5927
5928   /* Expand the operands.  */
5929   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
5930
5931   expect = expand_normal (CALL_EXPR_ARG (exp, 1));
5932   expect = convert_memory_address (Pmode, expect);
5933   expect = gen_rtx_MEM (mode, expect);
5934   desired = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
5935
5936   weak = CALL_EXPR_ARG (exp, 3);
5937   is_weak = false;
5938   if (tree_fits_shwi_p (weak) && tree_to_shwi (weak) != 0)
5939     is_weak = true;
5940
5941   if (target == const0_rtx)
5942     target = NULL;
5943
5944   /* Lest the rtl backend create a race condition with an imporoper store
5945      to memory, always create a new pseudo for OLDVAL.  */
5946   oldval = NULL;
5947
5948   if (!expand_atomic_compare_and_swap (&target, &oldval, mem, expect, desired,
5949                                        is_weak, success, failure))
5950     return NULL_RTX;
5951
5952   /* Conditionally store back to EXPECT, lest we create a race condition
5953      with an improper store to memory.  */
5954   /* ??? With a rearrangement of atomics at the gimple level, we can handle
5955      the normal case where EXPECT is totally private, i.e. a register.  At
5956      which point the store can be unconditional.  */
5957   label = gen_label_rtx ();
5958   emit_cmp_and_jump_insns (target, const0_rtx, NE, NULL,
5959                            GET_MODE (target), 1, label);
5960   emit_move_insn (expect, oldval);
5961   emit_label (label);
5962
5963   return target;
5964 }
5965
5966 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5967    internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5968    call.  The weak parameter must be dropped to match the expected parameter
5969    list and the expected argument changed from value to pointer to memory
5970    slot.  */
5971
5972 static void
5973 expand_ifn_atomic_compare_exchange_into_call (gcall *call, machine_mode mode)
5974 {
5975   unsigned int z;
5976   vec<tree, va_gc> *vec;
5977
5978   vec_alloc (vec, 5);
5979   vec->quick_push (gimple_call_arg (call, 0));
5980   tree expected = gimple_call_arg (call, 1);
5981   rtx x = assign_stack_temp_for_type (mode, GET_MODE_SIZE (mode),
5982                                       TREE_TYPE (expected));
5983   rtx expd = expand_expr (expected, x, mode, EXPAND_NORMAL);
5984   if (expd != x)
5985     emit_move_insn (x, expd);
5986   tree v = make_tree (TREE_TYPE (expected), x);
5987   vec->quick_push (build1 (ADDR_EXPR,
5988                            build_pointer_type (TREE_TYPE (expected)), v));
5989   vec->quick_push (gimple_call_arg (call, 2));
5990   /* Skip the boolean weak parameter.  */
5991   for (z = 4; z < 6; z++)
5992     vec->quick_push (gimple_call_arg (call, z));
5993   built_in_function fncode
5994     = (built_in_function) ((int) BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1
5995                            + exact_log2 (GET_MODE_SIZE (mode)));
5996   tree fndecl = builtin_decl_explicit (fncode);
5997   tree fn = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fndecl)),
5998                     fndecl);
5999   tree exp = build_call_vec (boolean_type_node, fn, vec);
6000   tree lhs = gimple_call_lhs (call);
6001   rtx boolret = expand_call (exp, NULL_RTX, lhs == NULL_TREE);
6002   if (lhs)
6003     {
6004       rtx target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
6005       if (GET_MODE (boolret) != mode)
6006         boolret = convert_modes (mode, GET_MODE (boolret), boolret, 1);
6007       x = force_reg (mode, x);
6008       write_complex_part (target, boolret, true);
6009       write_complex_part (target, x, false);
6010     }
6011 }
6012
6013 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function.  */
6014
6015 void
6016 expand_ifn_atomic_compare_exchange (gcall *call)
6017 {
6018   int size = tree_to_shwi (gimple_call_arg (call, 3)) & 255;
6019   gcc_assert (size == 1 || size == 2 || size == 4 || size == 8 || size == 16);
6020   machine_mode mode = int_mode_for_size (BITS_PER_UNIT * size, 0).require ();
6021   rtx expect, desired, mem, oldval, boolret;
6022   enum memmodel success, failure;
6023   tree lhs;
6024   bool is_weak;
6025   source_location loc
6026     = expansion_point_location_if_in_system_header (gimple_location (call));
6027
6028   success = get_memmodel (gimple_call_arg (call, 4));
6029   failure = get_memmodel (gimple_call_arg (call, 5));
6030
6031   if (failure > success)
6032     {
6033       warning_at (loc, OPT_Winvalid_memory_model,
6034                   "failure memory model cannot be stronger than success "
6035                   "memory model for %<__atomic_compare_exchange%>");
6036       success = MEMMODEL_SEQ_CST;
6037     }
6038
6039   if (is_mm_release (failure) || is_mm_acq_rel (failure))
6040     {
6041       warning_at (loc, OPT_Winvalid_memory_model,
6042                   "invalid failure memory model for "
6043                   "%<__atomic_compare_exchange%>");
6044       failure = MEMMODEL_SEQ_CST;
6045       success = MEMMODEL_SEQ_CST;
6046     }
6047
6048   if (!flag_inline_atomics)
6049     {
6050       expand_ifn_atomic_compare_exchange_into_call (call, mode);
6051       return;
6052     }
6053
6054   /* Expand the operands.  */
6055   mem = get_builtin_sync_mem (gimple_call_arg (call, 0), mode);
6056
6057   expect = expand_expr_force_mode (gimple_call_arg (call, 1), mode);
6058   desired = expand_expr_force_mode (gimple_call_arg (call, 2), mode);
6059
6060   is_weak = (tree_to_shwi (gimple_call_arg (call, 3)) & 256) != 0;
6061
6062   boolret = NULL;
6063   oldval = NULL;
6064
6065   if (!expand_atomic_compare_and_swap (&boolret, &oldval, mem, expect, desired,
6066                                        is_weak, success, failure))
6067     {
6068       expand_ifn_atomic_compare_exchange_into_call (call, mode);
6069       return;
6070     }
6071
6072   lhs = gimple_call_lhs (call);
6073   if (lhs)
6074     {
6075       rtx target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
6076       if (GET_MODE (boolret) != mode)
6077         boolret = convert_modes (mode, GET_MODE (boolret), boolret, 1);
6078       write_complex_part (target, boolret, true);
6079       write_complex_part (target, oldval, false);
6080     }
6081 }
6082
6083 /* Expand the __atomic_load intrinsic:
6084         TYPE __atomic_load (TYPE *object, enum memmodel)
6085    EXP is the CALL_EXPR.
6086    TARGET is an optional place for us to store the results.  */
6087
6088 static rtx
6089 expand_builtin_atomic_load (machine_mode mode, tree exp, rtx target)
6090 {
6091   rtx mem;
6092   enum memmodel model;
6093
6094   model = get_memmodel (CALL_EXPR_ARG (exp, 1));
6095   if (is_mm_release (model) || is_mm_acq_rel (model))
6096     {
6097       source_location loc
6098         = expansion_point_location_if_in_system_header (input_location);
6099       warning_at (loc, OPT_Winvalid_memory_model,
6100                   "invalid memory model for %<__atomic_load%>");
6101       model = MEMMODEL_SEQ_CST;
6102     }
6103
6104   if (!flag_inline_atomics)
6105     return NULL_RTX;
6106
6107   /* Expand the operand.  */
6108   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6109
6110   return expand_atomic_load (target, mem, model);
6111 }
6112
6113
6114 /* Expand the __atomic_store intrinsic:
6115         void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6116    EXP is the CALL_EXPR.
6117    TARGET is an optional place for us to store the results.  */
6118
6119 static rtx
6120 expand_builtin_atomic_store (machine_mode mode, tree exp)
6121 {
6122   rtx mem, val;
6123   enum memmodel model;
6124
6125   model = get_memmodel (CALL_EXPR_ARG (exp, 2));
6126   if (!(is_mm_relaxed (model) || is_mm_seq_cst (model)
6127         || is_mm_release (model)))
6128     {
6129       source_location loc
6130         = expansion_point_location_if_in_system_header (input_location);
6131       warning_at (loc, OPT_Winvalid_memory_model,
6132                   "invalid memory model for %<__atomic_store%>");
6133       model = MEMMODEL_SEQ_CST;
6134     }
6135
6136   if (!flag_inline_atomics)
6137     return NULL_RTX;
6138
6139   /* Expand the operands.  */
6140   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6141   val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6142
6143   return expand_atomic_store (mem, val, model, false);
6144 }
6145
6146 /* Expand the __atomic_fetch_XXX intrinsic:
6147         TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6148    EXP is the CALL_EXPR.
6149    TARGET is an optional place for us to store the results.
6150    CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6151    FETCH_AFTER is true if returning the result of the operation.
6152    FETCH_AFTER is false if returning the value before the operation.
6153    IGNORE is true if the result is not used.
6154    EXT_CALL is the correct builtin for an external call if this cannot be
6155    resolved to an instruction sequence.  */
6156
6157 static rtx
6158 expand_builtin_atomic_fetch_op (machine_mode mode, tree exp, rtx target,
6159                                 enum rtx_code code, bool fetch_after,
6160                                 bool ignore, enum built_in_function ext_call)
6161 {
6162   rtx val, mem, ret;
6163   enum memmodel model;
6164   tree fndecl;
6165   tree addr;
6166
6167   model = get_memmodel (CALL_EXPR_ARG (exp, 2));
6168
6169   /* Expand the operands.  */
6170   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6171   val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6172
6173   /* Only try generating instructions if inlining is turned on.  */
6174   if (flag_inline_atomics)
6175     {
6176       ret = expand_atomic_fetch_op (target, mem, val, code, model, fetch_after);
6177       if (ret)
6178         return ret;
6179     }
6180
6181   /* Return if a different routine isn't needed for the library call.  */
6182   if (ext_call == BUILT_IN_NONE)
6183     return NULL_RTX;
6184
6185   /* Change the call to the specified function.  */
6186   fndecl = get_callee_fndecl (exp);
6187   addr = CALL_EXPR_FN (exp);
6188   STRIP_NOPS (addr);
6189
6190   gcc_assert (TREE_OPERAND (addr, 0) == fndecl);
6191   TREE_OPERAND (addr, 0) = builtin_decl_explicit (ext_call);
6192
6193   /* If we will emit code after the call, the call can not be a tail call.
6194      If it is emitted as a tail call, a barrier is emitted after it, and
6195      then all trailing code is removed.  */
6196   if (!ignore)
6197     CALL_EXPR_TAILCALL (exp) = 0;
6198
6199   /* Expand the call here so we can emit trailing code.  */
6200   ret = expand_call (exp, target, ignore);
6201
6202   /* Replace the original function just in case it matters.  */
6203   TREE_OPERAND (addr, 0) = fndecl;
6204
6205   /* Then issue the arithmetic correction to return the right result.  */
6206   if (!ignore)
6207     {
6208       if (code == NOT)
6209         {
6210           ret = expand_simple_binop (mode, AND, ret, val, NULL_RTX, true,
6211                                      OPTAB_LIB_WIDEN);
6212           ret = expand_simple_unop (mode, NOT, ret, target, true);
6213         }
6214       else
6215         ret = expand_simple_binop (mode, code, ret, val, target, true,
6216                                    OPTAB_LIB_WIDEN);
6217     }
6218   return ret;
6219 }
6220
6221 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function.  */
6222
6223 void
6224 expand_ifn_atomic_bit_test_and (gcall *call)
6225 {
6226   tree ptr = gimple_call_arg (call, 0);
6227   tree bit = gimple_call_arg (call, 1);
6228   tree flag = gimple_call_arg (call, 2);
6229   tree lhs = gimple_call_lhs (call);
6230   enum memmodel model = MEMMODEL_SYNC_SEQ_CST;
6231   machine_mode mode = TYPE_MODE (TREE_TYPE (flag));
6232   enum rtx_code code;
6233   optab optab;
6234   struct expand_operand ops[5];
6235
6236   gcc_assert (flag_inline_atomics);
6237
6238   if (gimple_call_num_args (call) == 4)
6239     model = get_memmodel (gimple_call_arg (call, 3));
6240
6241   rtx mem = get_builtin_sync_mem (ptr, mode);
6242   rtx val = expand_expr_force_mode (bit, mode);
6243
6244   switch (gimple_call_internal_fn (call))
6245     {
6246     case IFN_ATOMIC_BIT_TEST_AND_SET:
6247       code = IOR;
6248       optab = atomic_bit_test_and_set_optab;
6249       break;
6250     case IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT:
6251       code = XOR;
6252       optab = atomic_bit_test_and_complement_optab;
6253       break;
6254     case IFN_ATOMIC_BIT_TEST_AND_RESET:
6255       code = AND;
6256       optab = atomic_bit_test_and_reset_optab;
6257       break;
6258     default:
6259       gcc_unreachable ();
6260     }
6261
6262   if (lhs == NULL_TREE)
6263     {
6264       val = expand_simple_binop (mode, ASHIFT, const1_rtx,
6265                                  val, NULL_RTX, true, OPTAB_DIRECT);
6266       if (code == AND)
6267         val = expand_simple_unop (mode, NOT, val, NULL_RTX, true);
6268       expand_atomic_fetch_op (const0_rtx, mem, val, code, model, false);
6269       return;
6270     }
6271
6272   rtx target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
6273   enum insn_code icode = direct_optab_handler (optab, mode);
6274   gcc_assert (icode != CODE_FOR_nothing);
6275   create_output_operand (&ops[0], target, mode);
6276   create_fixed_operand (&ops[1], mem);
6277   create_convert_operand_to (&ops[2], val, mode, true);
6278   create_integer_operand (&ops[3], model);
6279   create_integer_operand (&ops[4], integer_onep (flag));
6280   if (maybe_expand_insn (icode, 5, ops))
6281     return;
6282
6283   rtx bitval = val;
6284   val = expand_simple_binop (mode, ASHIFT, const1_rtx,
6285                              val, NULL_RTX, true, OPTAB_DIRECT);
6286   rtx maskval = val;
6287   if (code == AND)
6288     val = expand_simple_unop (mode, NOT, val, NULL_RTX, true);
6289   rtx result = expand_atomic_fetch_op (gen_reg_rtx (mode), mem, val,
6290                                        code, model, false);
6291   if (integer_onep (flag))
6292     {
6293       result = expand_simple_binop (mode, ASHIFTRT, result, bitval,
6294                                     NULL_RTX, true, OPTAB_DIRECT);
6295       result = expand_simple_binop (mode, AND, result, const1_rtx, target,
6296                                     true, OPTAB_DIRECT);
6297     }
6298   else
6299     result = expand_simple_binop (mode, AND, result, maskval, target, true,
6300                                   OPTAB_DIRECT);
6301   if (result != target)
6302     emit_move_insn (target, result);
6303 }
6304
6305 /* Expand an atomic clear operation.
6306         void _atomic_clear (BOOL *obj, enum memmodel)
6307    EXP is the call expression.  */
6308
6309 static rtx
6310 expand_builtin_atomic_clear (tree exp)
6311 {
6312   machine_mode mode;
6313   rtx mem, ret;
6314   enum memmodel model;
6315
6316   mode = int_mode_for_size (BOOL_TYPE_SIZE, 0).require ();
6317   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6318   model = get_memmodel (CALL_EXPR_ARG (exp, 1));
6319
6320   if (is_mm_consume (model) || is_mm_acquire (model) || is_mm_acq_rel (model))
6321     {
6322       source_location loc
6323         = expansion_point_location_if_in_system_header (input_location);
6324       warning_at (loc, OPT_Winvalid_memory_model,
6325                   "invalid memory model for %<__atomic_store%>");
6326       model = MEMMODEL_SEQ_CST;
6327     }
6328
6329   /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6330      Failing that, a store is issued by __atomic_store.  The only way this can
6331      fail is if the bool type is larger than a word size.  Unlikely, but
6332      handle it anyway for completeness.  Assume a single threaded model since
6333      there is no atomic support in this case, and no barriers are required.  */
6334   ret = expand_atomic_store (mem, const0_rtx, model, true);
6335   if (!ret)
6336     emit_move_insn (mem, const0_rtx);
6337   return const0_rtx;
6338 }
6339
6340 /* Expand an atomic test_and_set operation.
6341         bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6342    EXP is the call expression.  */
6343
6344 static rtx
6345 expand_builtin_atomic_test_and_set (tree exp, rtx target)
6346 {
6347   rtx mem;
6348   enum memmodel model;
6349   machine_mode mode;
6350
6351   mode = int_mode_for_size (BOOL_TYPE_SIZE, 0).require ();
6352   mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6353   model = get_memmodel (CALL_EXPR_ARG (exp, 1));
6354
6355   return expand_atomic_test_and_set (target, mem, model);
6356 }
6357
6358
6359 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6360    this architecture.  If ARG1 is NULL, use typical alignment for size ARG0.  */
6361
6362 static tree
6363 fold_builtin_atomic_always_lock_free (tree arg0, tree arg1)
6364 {
6365   int size;
6366   machine_mode mode;
6367   unsigned int mode_align, type_align;
6368
6369   if (TREE_CODE (arg0) != INTEGER_CST)
6370     return NULL_TREE;
6371
6372   /* We need a corresponding integer mode for the access to be lock-free.  */
6373   size = INTVAL (expand_normal (arg0)) * BITS_PER_UNIT;
6374   if (!int_mode_for_size (size, 0).exists (&mode))
6375     return boolean_false_node;
6376
6377   mode_align = GET_MODE_ALIGNMENT (mode);
6378
6379   if (TREE_CODE (arg1) == INTEGER_CST)
6380     {
6381       unsigned HOST_WIDE_INT val = UINTVAL (expand_normal (arg1));
6382
6383       /* Either this argument is null, or it's a fake pointer encoding
6384          the alignment of the object.  */
6385       val = least_bit_hwi (val);
6386       val *= BITS_PER_UNIT;
6387
6388       if (val == 0 || mode_align < val)
6389         type_align = mode_align;
6390       else
6391         type_align = val;
6392     }
6393   else
6394     {
6395       tree ttype = TREE_TYPE (arg1);
6396
6397       /* This function is usually invoked and folded immediately by the front
6398          end before anything else has a chance to look at it.  The pointer
6399          parameter at this point is usually cast to a void *, so check for that
6400          and look past the cast.  */
6401       if (CONVERT_EXPR_P (arg1)
6402           && POINTER_TYPE_P (ttype)
6403           && VOID_TYPE_P (TREE_TYPE (ttype))
6404           && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1, 0))))
6405         arg1 = TREE_OPERAND (arg1, 0);
6406
6407       ttype = TREE_TYPE (arg1);
6408       gcc_assert (POINTER_TYPE_P (ttype));
6409
6410       /* Get the underlying type of the object.  */
6411       ttype = TREE_TYPE (ttype);
6412       type_align = TYPE_ALIGN (ttype);
6413     }
6414
6415   /* If the object has smaller alignment, the lock free routines cannot
6416      be used.  */
6417   if (type_align < mode_align)
6418     return boolean_false_node;
6419
6420   /* Check if a compare_and_swap pattern exists for the mode which represents
6421      the required size.  The pattern is not allowed to fail, so the existence
6422      of the pattern indicates support is present.  Also require that an
6423      atomic load exists for the required size.  */
6424   if (can_compare_and_swap_p (mode, true) && can_atomic_load_p (mode))
6425     return boolean_true_node;
6426   else
6427     return boolean_false_node;
6428 }
6429
6430 /* Return true if the parameters to call EXP represent an object which will
6431    always generate lock free instructions.  The first argument represents the
6432    size of the object, and the second parameter is a pointer to the object
6433    itself.  If NULL is passed for the object, then the result is based on
6434    typical alignment for an object of the specified size.  Otherwise return
6435    false.  */
6436
6437 static rtx
6438 expand_builtin_atomic_always_lock_free (tree exp)
6439 {
6440   tree size;
6441   tree arg0 = CALL_EXPR_ARG (exp, 0);
6442   tree arg1 = CALL_EXPR_ARG (exp, 1);
6443
6444   if (TREE_CODE (arg0) != INTEGER_CST)
6445     {
6446       error ("non-constant argument 1 to __atomic_always_lock_free");
6447       return const0_rtx;
6448     }
6449
6450   size = fold_builtin_atomic_always_lock_free (arg0, arg1);
6451   if (size == boolean_true_node)
6452     return const1_rtx;
6453   return const0_rtx;
6454 }
6455
6456 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6457    is lock free on this architecture.  */
6458
6459 static tree
6460 fold_builtin_atomic_is_lock_free (tree arg0, tree arg1)
6461 {
6462   if (!flag_inline_atomics)
6463     return NULL_TREE;
6464
6465   /* If it isn't always lock free, don't generate a result.  */
6466   if (fold_builtin_atomic_always_lock_free (arg0, arg1) == boolean_true_node)
6467     return boolean_true_node;
6468
6469   return NULL_TREE;
6470 }
6471
6472 /* Return true if the parameters to call EXP represent an object which will
6473    always generate lock free instructions.  The first argument represents the
6474    size of the object, and the second parameter is a pointer to the object
6475    itself.  If NULL is passed for the object, then the result is based on
6476    typical alignment for an object of the specified size.  Otherwise return
6477    NULL*/
6478
6479 static rtx
6480 expand_builtin_atomic_is_lock_free (tree exp)
6481 {
6482   tree size;
6483   tree arg0 = CALL_EXPR_ARG (exp, 0);
6484   tree arg1 = CALL_EXPR_ARG (exp, 1);
6485
6486   if (!INTEGRAL_TYPE_P (TREE_TYPE (arg0)))
6487     {
6488       error ("non-integer argument 1 to __atomic_is_lock_free");
6489       return NULL_RTX;
6490     }
6491
6492   if (!flag_inline_atomics)
6493     return NULL_RTX;
6494
6495   /* If the value is known at compile time, return the RTX for it.  */
6496   size = fold_builtin_atomic_is_lock_free (arg0, arg1);
6497   if (size == boolean_true_node)
6498     return const1_rtx;
6499
6500   return NULL_RTX;
6501 }
6502
6503 /* Expand the __atomic_thread_fence intrinsic:
6504         void __atomic_thread_fence (enum memmodel)
6505    EXP is the CALL_EXPR.  */
6506
6507 static void
6508 expand_builtin_atomic_thread_fence (tree exp)
6509 {
6510   enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
6511   expand_mem_thread_fence (model);
6512 }
6513
6514 /* Expand the __atomic_signal_fence intrinsic:
6515         void __atomic_signal_fence (enum memmodel)
6516    EXP is the CALL_EXPR.  */
6517
6518 static void
6519 expand_builtin_atomic_signal_fence (tree exp)
6520 {
6521   enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
6522   expand_mem_signal_fence (model);
6523 }
6524
6525 /* Expand the __sync_synchronize intrinsic.  */
6526
6527 static void
6528 expand_builtin_sync_synchronize (void)
6529 {
6530   expand_mem_thread_fence (MEMMODEL_SYNC_SEQ_CST);
6531 }
6532
6533 static rtx
6534 expand_builtin_thread_pointer (tree exp, rtx target)
6535 {
6536   enum insn_code icode;
6537   if (!validate_arglist (exp, VOID_TYPE))
6538     return const0_rtx;
6539   icode = direct_optab_handler (get_thread_pointer_optab, Pmode);
6540   if (icode != CODE_FOR_nothing)
6541     {
6542       struct expand_operand op;
6543       /* If the target is not sutitable then create a new target. */
6544       if (target == NULL_RTX
6545           || !REG_P (target)
6546           || GET_MODE (target) != Pmode)
6547         target = gen_reg_rtx (Pmode);
6548       create_output_operand (&op, target, Pmode);
6549       expand_insn (icode, 1, &op);
6550       return target;
6551     }
6552   error ("__builtin_thread_pointer is not supported on this target");
6553   return const0_rtx;
6554 }
6555
6556 static void
6557 expand_builtin_set_thread_pointer (tree exp)
6558 {
6559   enum insn_code icode;
6560   if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6561     return;
6562   icode = direct_optab_handler (set_thread_pointer_optab, Pmode);
6563   if (icode != CODE_FOR_nothing)
6564     {
6565       struct expand_operand op;
6566       rtx val = expand_expr (CALL_EXPR_ARG (exp, 0), NULL_RTX,
6567                              Pmode, EXPAND_NORMAL);
6568       create_input_operand (&op, val, Pmode);
6569       expand_insn (icode, 1, &op);
6570       return;
6571     }
6572   error ("__builtin_set_thread_pointer is not supported on this target");
6573 }
6574
6575 \f
6576 /* Emit code to restore the current value of stack.  */
6577
6578 static void
6579 expand_stack_restore (tree var)
6580 {
6581   rtx_insn *prev;
6582   rtx sa = expand_normal (var);
6583
6584   sa = convert_memory_address (Pmode, sa);
6585
6586   prev = get_last_insn ();
6587   emit_stack_restore (SAVE_BLOCK, sa);
6588
6589   record_new_stack_level ();
6590
6591   fixup_args_size_notes (prev, get_last_insn (), 0);
6592 }
6593
6594 /* Emit code to save the current value of stack.  */
6595
6596 static rtx
6597 expand_stack_save (void)
6598 {
6599   rtx ret = NULL_RTX;
6600
6601   emit_stack_save (SAVE_BLOCK, &ret);
6602   return ret;
6603 }
6604
6605
6606 /* Expand an expression EXP that calls a built-in function,
6607    with result going to TARGET if that's convenient
6608    (and in mode MODE if that's convenient).
6609    SUBTARGET may be used as the target for computing one of EXP's operands.
6610    IGNORE is nonzero if the value is to be ignored.  */
6611
6612 rtx
6613 expand_builtin (tree exp, rtx target, rtx subtarget, machine_mode mode,
6614                 int ignore)
6615 {
6616   tree fndecl = get_callee_fndecl (exp);
6617   enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6618   machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
6619   int flags;
6620
6621   if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
6622     return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
6623
6624   /* When ASan is enabled, we don't want to expand some memory/string
6625      builtins and rely on libsanitizer's hooks.  This allows us to avoid
6626      redundant checks and be sure, that possible overflow will be detected
6627      by ASan.  */
6628
6629   if ((flag_sanitize & SANITIZE_ADDRESS) && asan_intercepted_p (fcode))
6630     return expand_call (exp, target, ignore);
6631
6632   /* When not optimizing, generate calls to library functions for a certain
6633      set of builtins.  */
6634   if (!optimize
6635       && !called_as_built_in (fndecl)
6636       && fcode != BUILT_IN_FORK
6637       && fcode != BUILT_IN_EXECL
6638       && fcode != BUILT_IN_EXECV
6639       && fcode != BUILT_IN_EXECLP
6640       && fcode != BUILT_IN_EXECLE
6641       && fcode != BUILT_IN_EXECVP
6642       && fcode != BUILT_IN_EXECVE
6643       && !ALLOCA_FUNCTION_CODE_P (fcode)
6644       && fcode != BUILT_IN_FREE
6645       && fcode != BUILT_IN_CHKP_SET_PTR_BOUNDS
6646       && fcode != BUILT_IN_CHKP_INIT_PTR_BOUNDS
6647       && fcode != BUILT_IN_CHKP_NULL_PTR_BOUNDS
6648       && fcode != BUILT_IN_CHKP_COPY_PTR_BOUNDS
6649       && fcode != BUILT_IN_CHKP_NARROW_PTR_BOUNDS
6650       && fcode != BUILT_IN_CHKP_STORE_PTR_BOUNDS
6651       && fcode != BUILT_IN_CHKP_CHECK_PTR_LBOUNDS
6652       && fcode != BUILT_IN_CHKP_CHECK_PTR_UBOUNDS
6653       && fcode != BUILT_IN_CHKP_CHECK_PTR_BOUNDS
6654       && fcode != BUILT_IN_CHKP_GET_PTR_LBOUND
6655       && fcode != BUILT_IN_CHKP_GET_PTR_UBOUND
6656       && fcode != BUILT_IN_CHKP_BNDRET)
6657     return expand_call (exp, target, ignore);
6658
6659   /* The built-in function expanders test for target == const0_rtx
6660      to determine whether the function's result will be ignored.  */
6661   if (ignore)
6662     target = const0_rtx;
6663
6664   /* If the result of a pure or const built-in function is ignored, and
6665      none of its arguments are volatile, we can avoid expanding the
6666      built-in call and just evaluate the arguments for side-effects.  */
6667   if (target == const0_rtx
6668       && ((flags = flags_from_decl_or_type (fndecl)) & (ECF_CONST | ECF_PURE))
6669       && !(flags & ECF_LOOPING_CONST_OR_PURE))
6670     {
6671       bool volatilep = false;
6672       tree arg;
6673       call_expr_arg_iterator iter;
6674
6675       FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
6676         if (TREE_THIS_VOLATILE (arg))
6677           {
6678             volatilep = true;
6679             break;
6680           }
6681
6682       if (! volatilep)
6683         {
6684           FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
6685             expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
6686           return const0_rtx;
6687         }
6688     }
6689
6690   /* expand_builtin_with_bounds is supposed to be used for
6691      instrumented builtin calls.  */
6692   gcc_assert (!CALL_WITH_BOUNDS_P (exp));
6693
6694   switch (fcode)
6695     {
6696     CASE_FLT_FN (BUILT_IN_FABS):
6697     CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS):
6698     case BUILT_IN_FABSD32:
6699     case BUILT_IN_FABSD64:
6700     case BUILT_IN_FABSD128:
6701       target = expand_builtin_fabs (exp, target, subtarget);
6702       if (target)
6703         return target;
6704       break;
6705
6706     CASE_FLT_FN (BUILT_IN_COPYSIGN):
6707     CASE_FLT_FN_FLOATN_NX (BUILT_IN_COPYSIGN):
6708       target = expand_builtin_copysign (exp, target, subtarget);
6709       if (target)
6710         return target;
6711       break;
6712
6713       /* Just do a normal library call if we were unable to fold
6714          the values.  */
6715     CASE_FLT_FN (BUILT_IN_CABS):
6716       break;
6717
6718     CASE_FLT_FN (BUILT_IN_FMA):
6719     CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
6720       target = expand_builtin_mathfn_ternary (exp, target, subtarget);
6721       if (target)
6722         return target;
6723       break;
6724
6725     CASE_FLT_FN (BUILT_IN_ILOGB):
6726       if (! flag_unsafe_math_optimizations)
6727         break;
6728       gcc_fallthrough ();
6729     CASE_FLT_FN (BUILT_IN_ISINF):
6730     CASE_FLT_FN (BUILT_IN_FINITE):
6731     case BUILT_IN_ISFINITE:
6732     case BUILT_IN_ISNORMAL:
6733       target = expand_builtin_interclass_mathfn (exp, target);
6734       if (target)
6735         return target;
6736       break;
6737
6738     CASE_FLT_FN (BUILT_IN_ICEIL):
6739     CASE_FLT_FN (BUILT_IN_LCEIL):
6740     CASE_FLT_FN (BUILT_IN_LLCEIL):
6741     CASE_FLT_FN (BUILT_IN_LFLOOR):
6742     CASE_FLT_FN (BUILT_IN_IFLOOR):
6743     CASE_FLT_FN (BUILT_IN_LLFLOOR):
6744       target = expand_builtin_int_roundingfn (exp, target);
6745       if (target)
6746         return target;
6747       break;
6748
6749     CASE_FLT_FN (BUILT_IN_IRINT):
6750     CASE_FLT_FN (BUILT_IN_LRINT):
6751     CASE_FLT_FN (BUILT_IN_LLRINT):
6752     CASE_FLT_FN (BUILT_IN_IROUND):
6753     CASE_FLT_FN (BUILT_IN_LROUND):
6754     CASE_FLT_FN (BUILT_IN_LLROUND):
6755       target = expand_builtin_int_roundingfn_2 (exp, target);
6756       if (target)
6757         return target;
6758       break;
6759
6760     CASE_FLT_FN (BUILT_IN_POWI):
6761       target = expand_builtin_powi (exp, target);
6762       if (target)
6763         return target;
6764       break;
6765
6766     CASE_FLT_FN (BUILT_IN_CEXPI):
6767       target = expand_builtin_cexpi (exp, target);
6768       gcc_assert (target);
6769       return target;
6770
6771     CASE_FLT_FN (BUILT_IN_SIN):
6772     CASE_FLT_FN (BUILT_IN_COS):
6773       if (! flag_unsafe_math_optimizations)
6774         break;
6775       target = expand_builtin_mathfn_3 (exp, target, subtarget);
6776       if (target)
6777         return target;
6778       break;
6779
6780     CASE_FLT_FN (BUILT_IN_SINCOS):
6781       if (! flag_unsafe_math_optimizations)
6782         break;
6783       target = expand_builtin_sincos (exp);
6784       if (target)
6785         return target;
6786       break;
6787
6788     case BUILT_IN_APPLY_ARGS:
6789       return expand_builtin_apply_args ();
6790
6791       /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6792          FUNCTION with a copy of the parameters described by
6793          ARGUMENTS, and ARGSIZE.  It returns a block of memory
6794          allocated on the stack into which is stored all the registers
6795          that might possibly be used for returning the result of a
6796          function.  ARGUMENTS is the value returned by
6797          __builtin_apply_args.  ARGSIZE is the number of bytes of
6798          arguments that must be copied.  ??? How should this value be
6799          computed?  We'll also need a safe worst case value for varargs
6800          functions.  */
6801     case BUILT_IN_APPLY:
6802       if (!validate_arglist (exp, POINTER_TYPE,
6803                              POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
6804           && !validate_arglist (exp, REFERENCE_TYPE,
6805                                 POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
6806         return const0_rtx;
6807       else
6808         {
6809           rtx ops[3];
6810
6811           ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
6812           ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
6813           ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
6814
6815           return expand_builtin_apply (ops[0], ops[1], ops[2]);
6816         }
6817
6818       /* __builtin_return (RESULT) causes the function to return the
6819          value described by RESULT.  RESULT is address of the block of
6820          memory returned by __builtin_apply.  */
6821     case BUILT_IN_RETURN:
6822       if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6823         expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
6824       return const0_rtx;
6825
6826     case BUILT_IN_SAVEREGS:
6827       return expand_builtin_saveregs ();
6828
6829     case BUILT_IN_VA_ARG_PACK:
6830       /* All valid uses of __builtin_va_arg_pack () are removed during
6831          inlining.  */
6832       error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
6833       return const0_rtx;
6834
6835     case BUILT_IN_VA_ARG_PACK_LEN:
6836       /* All valid uses of __builtin_va_arg_pack_len () are removed during
6837          inlining.  */
6838       error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp);
6839       return const0_rtx;
6840
6841       /* Return the address of the first anonymous stack arg.  */
6842     case BUILT_IN_NEXT_ARG:
6843       if (fold_builtin_next_arg (exp, false))
6844         return const0_rtx;
6845       return expand_builtin_next_arg ();
6846
6847     case BUILT_IN_CLEAR_CACHE:
6848       target = expand_builtin___clear_cache (exp);
6849       if (target)
6850         return target;
6851       break;
6852
6853     case BUILT_IN_CLASSIFY_TYPE:
6854       return expand_builtin_classify_type (exp);
6855
6856     case BUILT_IN_CONSTANT_P:
6857       return const0_rtx;
6858
6859     case BUILT_IN_FRAME_ADDRESS:
6860     case BUILT_IN_RETURN_ADDRESS:
6861       return expand_builtin_frame_address (fndecl, exp);
6862
6863     /* Returns the address of the area where the structure is returned.
6864        0 otherwise.  */
6865     case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
6866       if (call_expr_nargs (exp) != 0
6867           || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
6868           || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
6869         return const0_rtx;
6870       else
6871         return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
6872
6873     CASE_BUILT_IN_ALLOCA:
6874       target = expand_builtin_alloca (exp);
6875       if (target)
6876         return target;
6877       break;
6878
6879     case BUILT_IN_ASAN_ALLOCAS_UNPOISON:
6880       return expand_asan_emit_allocas_unpoison (exp);
6881
6882     case BUILT_IN_STACK_SAVE:
6883       return expand_stack_save ();
6884
6885     case BUILT_IN_STACK_RESTORE:
6886       expand_stack_restore (CALL_EXPR_ARG (exp, 0));
6887       return const0_rtx;
6888
6889     case BUILT_IN_BSWAP16:
6890     case BUILT_IN_BSWAP32:
6891     case BUILT_IN_BSWAP64:
6892       target = expand_builtin_bswap (target_mode, exp, target, subtarget);
6893       if (target)
6894         return target;
6895       break;
6896
6897     CASE_INT_FN (BUILT_IN_FFS):
6898       target = expand_builtin_unop (target_mode, exp, target,
6899                                     subtarget, ffs_optab);
6900       if (target)
6901         return target;
6902       break;
6903
6904     CASE_INT_FN (BUILT_IN_CLZ):
6905       target = expand_builtin_unop (target_mode, exp, target,
6906                                     subtarget, clz_optab);
6907       if (target)
6908         return target;
6909       break;
6910
6911     CASE_INT_FN (BUILT_IN_CTZ):
6912       target = expand_builtin_unop (target_mode, exp, target,
6913                                     subtarget, ctz_optab);
6914       if (target)
6915         return target;
6916       break;
6917
6918     CASE_INT_FN (BUILT_IN_CLRSB):
6919       target = expand_builtin_unop (target_mode, exp, target,
6920                                     subtarget, clrsb_optab);
6921       if (target)
6922         return target;
6923       break;
6924
6925     CASE_INT_FN (BUILT_IN_POPCOUNT):
6926       target = expand_builtin_unop (target_mode, exp, target,
6927                                     subtarget, popcount_optab);
6928       if (target)
6929         return target;
6930       break;
6931
6932     CASE_INT_FN (BUILT_IN_PARITY):
6933       target = expand_builtin_unop (target_mode, exp, target,
6934                                     subtarget, parity_optab);
6935       if (target)
6936         return target;
6937       break;
6938
6939     case BUILT_IN_STRLEN:
6940       target = expand_builtin_strlen (exp, target, target_mode);
6941       if (target)
6942         return target;
6943       break;
6944
6945     case BUILT_IN_STRCAT:
6946       target = expand_builtin_strcat (exp, target);
6947       if (target)
6948         return target;
6949       break;
6950
6951     case BUILT_IN_STRCPY:
6952       target = expand_builtin_strcpy (exp, target);
6953       if (target)
6954         return target;
6955       break;
6956
6957     case BUILT_IN_STRNCAT:
6958       target = expand_builtin_strncat (exp, target);
6959       if (target)
6960         return target;
6961       break;
6962
6963     case BUILT_IN_STRNCPY:
6964       target = expand_builtin_strncpy (exp, target);
6965       if (target)
6966         return target;
6967       break;
6968
6969     case BUILT_IN_STPCPY:
6970       target = expand_builtin_stpcpy (exp, target, mode);
6971       if (target)
6972         return target;
6973       break;
6974
6975     case BUILT_IN_STPNCPY:
6976       target = expand_builtin_stpncpy (exp, target);
6977       if (target)
6978         return target;
6979       break;
6980
6981     case BUILT_IN_MEMCHR:
6982       target = expand_builtin_memchr (exp, target);
6983       if (target)
6984         return target;
6985       break;
6986
6987     case BUILT_IN_MEMCPY:
6988       target = expand_builtin_memcpy (exp, target);
6989       if (target)
6990         return target;
6991       break;
6992
6993     case BUILT_IN_MEMMOVE:
6994       target = expand_builtin_memmove (exp, target);
6995       if (target)
6996         return target;
6997       break;
6998
6999     case BUILT_IN_MEMPCPY:
7000       target = expand_builtin_mempcpy (exp, target);
7001       if (target)
7002         return target;
7003       break;
7004
7005     case BUILT_IN_MEMSET:
7006       target = expand_builtin_memset (exp, target, mode);
7007       if (target)
7008         return target;
7009       break;
7010
7011     case BUILT_IN_BZERO:
7012       target = expand_builtin_bzero (exp);
7013       if (target)
7014         return target;
7015       break;
7016
7017     case BUILT_IN_STRCMP:
7018       target = expand_builtin_strcmp (exp, target);
7019       if (target)
7020         return target;
7021       break;
7022
7023     case BUILT_IN_STRNCMP:
7024       target = expand_builtin_strncmp (exp, target, mode);
7025       if (target)
7026         return target;
7027       break;
7028
7029     case BUILT_IN_BCMP:
7030     case BUILT_IN_MEMCMP:
7031     case BUILT_IN_MEMCMP_EQ:
7032       target = expand_builtin_memcmp (exp, target, fcode == BUILT_IN_MEMCMP_EQ);
7033       if (target)
7034         return target;
7035       if (fcode == BUILT_IN_MEMCMP_EQ)
7036         {
7037           tree newdecl = builtin_decl_explicit (BUILT_IN_MEMCMP);
7038           TREE_OPERAND (exp, 1) = build_fold_addr_expr (newdecl);
7039         }
7040       break;
7041
7042     case BUILT_IN_SETJMP:
7043       /* This should have been lowered to the builtins below.  */
7044       gcc_unreachable ();
7045
7046     case BUILT_IN_SETJMP_SETUP:
7047       /* __builtin_setjmp_setup is passed a pointer to an array of five words
7048           and the receiver label.  */
7049       if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
7050         {
7051           rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
7052                                       VOIDmode, EXPAND_NORMAL);
7053           tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
7054           rtx_insn *label_r = label_rtx (label);
7055
7056           /* This is copied from the handling of non-local gotos.  */
7057           expand_builtin_setjmp_setup (buf_addr, label_r);
7058           nonlocal_goto_handler_labels
7059             = gen_rtx_INSN_LIST (VOIDmode, label_r,
7060                                  nonlocal_goto_handler_labels);
7061           /* ??? Do not let expand_label treat us as such since we would
7062              not want to be both on the list of non-local labels and on
7063              the list of forced labels.  */
7064           FORCED_LABEL (label) = 0;
7065           return const0_rtx;
7066         }
7067       break;
7068
7069     case BUILT_IN_SETJMP_RECEIVER:
7070        /* __builtin_setjmp_receiver is passed the receiver label.  */
7071       if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
7072         {
7073           tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
7074           rtx_insn *label_r = label_rtx (label);
7075
7076           expand_builtin_setjmp_receiver (label_r);
7077           return const0_rtx;
7078         }
7079       break;
7080
7081       /* __builtin_longjmp is passed a pointer to an array of five words.
7082          It's similar to the C library longjmp function but works with
7083          __builtin_setjmp above.  */
7084     case BUILT_IN_LONGJMP:
7085       if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
7086         {
7087           rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
7088                                       VOIDmode, EXPAND_NORMAL);
7089           rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
7090
7091           if (value != const1_rtx)
7092             {
7093               error ("%<__builtin_longjmp%> second argument must be 1");
7094               return const0_rtx;
7095             }
7096
7097           expand_builtin_longjmp (buf_addr, value);
7098           return const0_rtx;
7099         }
7100       break;
7101
7102     case BUILT_IN_NONLOCAL_GOTO:
7103       target = expand_builtin_nonlocal_goto (exp);
7104       if (target)
7105         return target;
7106       break;
7107
7108       /* This updates the setjmp buffer that is its argument with the value
7109          of the current stack pointer.  */
7110     case BUILT_IN_UPDATE_SETJMP_BUF:
7111       if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
7112         {
7113           rtx buf_addr
7114             = expand_normal (CALL_EXPR_ARG (exp, 0));
7115
7116           expand_builtin_update_setjmp_buf (buf_addr);
7117           return const0_rtx;
7118         }
7119       break;
7120
7121     case BUILT_IN_TRAP:
7122       expand_builtin_trap ();
7123       return const0_rtx;
7124
7125     case BUILT_IN_UNREACHABLE:
7126       expand_builtin_unreachable ();
7127       return const0_rtx;
7128
7129     CASE_FLT_FN (BUILT_IN_SIGNBIT):
7130     case BUILT_IN_SIGNBITD32:
7131     case BUILT_IN_SIGNBITD64:
7132     case BUILT_IN_SIGNBITD128:
7133       target = expand_builtin_signbit (exp, target);
7134       if (target)
7135         return target;
7136       break;
7137
7138       /* Various hooks for the DWARF 2 __throw routine.  */
7139     case BUILT_IN_UNWIND_INIT:
7140       expand_builtin_unwind_init ();
7141       return const0_rtx;
7142     case BUILT_IN_DWARF_CFA:
7143       return virtual_cfa_rtx;
7144 #ifdef DWARF2_UNWIND_INFO
7145     case BUILT_IN_DWARF_SP_COLUMN:
7146       return expand_builtin_dwarf_sp_column ();
7147     case BUILT_IN_INIT_DWARF_REG_SIZES:
7148       expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
7149       return const0_rtx;
7150 #endif
7151     case BUILT_IN_FROB_RETURN_ADDR:
7152       return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
7153     case BUILT_IN_EXTRACT_RETURN_ADDR:
7154       return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
7155     case BUILT_IN_EH_RETURN:
7156       expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
7157                                 CALL_EXPR_ARG (exp, 1));
7158       return const0_rtx;
7159     case BUILT_IN_EH_RETURN_DATA_REGNO:
7160       return expand_builtin_eh_return_data_regno (exp);
7161     case BUILT_IN_EXTEND_POINTER:
7162       return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
7163     case BUILT_IN_EH_POINTER:
7164       return expand_builtin_eh_pointer (exp);
7165     case BUILT_IN_EH_FILTER:
7166       return expand_builtin_eh_filter (exp);
7167     case BUILT_IN_EH_COPY_VALUES:
7168       return expand_builtin_eh_copy_values (exp);
7169
7170     case BUILT_IN_VA_START:
7171       return expand_builtin_va_start (exp);
7172     case BUILT_IN_VA_END:
7173       return expand_builtin_va_end (exp);
7174     case BUILT_IN_VA_COPY:
7175       return expand_builtin_va_copy (exp);
7176     case BUILT_IN_EXPECT:
7177       return expand_builtin_expect (exp, target);
7178     case BUILT_IN_ASSUME_ALIGNED:
7179       return expand_builtin_assume_aligned (exp, target);
7180     case BUILT_IN_PREFETCH:
7181       expand_builtin_prefetch (exp);
7182       return const0_rtx;
7183
7184     case BUILT_IN_INIT_TRAMPOLINE:
7185       return expand_builtin_init_trampoline (exp, true);
7186     case BUILT_IN_INIT_HEAP_TRAMPOLINE:
7187       return expand_builtin_init_trampoline (exp, false);
7188     case BUILT_IN_ADJUST_TRAMPOLINE:
7189       return expand_builtin_adjust_trampoline (exp);
7190
7191     case BUILT_IN_INIT_DESCRIPTOR:
7192       return expand_builtin_init_descriptor (exp);
7193     case BUILT_IN_ADJUST_DESCRIPTOR:
7194       return expand_builtin_adjust_descriptor (exp);
7195
7196     case BUILT_IN_FORK:
7197     case BUILT_IN_EXECL:
7198     case BUILT_IN_EXECV:
7199     case BUILT_IN_EXECLP:
7200     case BUILT_IN_EXECLE:
7201     case BUILT_IN_EXECVP:
7202     case BUILT_IN_EXECVE:
7203       target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
7204       if (target)
7205         return target;
7206       break;
7207
7208     case BUILT_IN_SYNC_FETCH_AND_ADD_1:
7209     case BUILT_IN_SYNC_FETCH_AND_ADD_2:
7210     case BUILT_IN_SYNC_FETCH_AND_ADD_4:
7211     case BUILT_IN_SYNC_FETCH_AND_ADD_8:
7212     case BUILT_IN_SYNC_FETCH_AND_ADD_16:
7213       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_ADD_1);
7214       target = expand_builtin_sync_operation (mode, exp, PLUS, false, target);
7215       if (target)
7216         return target;
7217       break;
7218
7219     case BUILT_IN_SYNC_FETCH_AND_SUB_1:
7220     case BUILT_IN_SYNC_FETCH_AND_SUB_2:
7221     case BUILT_IN_SYNC_FETCH_AND_SUB_4:
7222     case BUILT_IN_SYNC_FETCH_AND_SUB_8:
7223     case BUILT_IN_SYNC_FETCH_AND_SUB_16:
7224       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_SUB_1);
7225       target = expand_builtin_sync_operation (mode, exp, MINUS, false, target);
7226       if (target)
7227         return target;
7228       break;
7229
7230     case BUILT_IN_SYNC_FETCH_AND_OR_1:
7231     case BUILT_IN_SYNC_FETCH_AND_OR_2:
7232     case BUILT_IN_SYNC_FETCH_AND_OR_4:
7233     case BUILT_IN_SYNC_FETCH_AND_OR_8:
7234     case BUILT_IN_SYNC_FETCH_AND_OR_16:
7235       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_OR_1);
7236       target = expand_builtin_sync_operation (mode, exp, IOR, false, target);
7237       if (target)
7238         return target;
7239       break;
7240
7241     case BUILT_IN_SYNC_FETCH_AND_AND_1:
7242     case BUILT_IN_SYNC_FETCH_AND_AND_2:
7243     case BUILT_IN_SYNC_FETCH_AND_AND_4:
7244     case BUILT_IN_SYNC_FETCH_AND_AND_8:
7245     case BUILT_IN_SYNC_FETCH_AND_AND_16:
7246       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_AND_1);
7247       target = expand_builtin_sync_operation (mode, exp, AND, false, target);
7248       if (target)
7249         return target;
7250       break;
7251
7252     case BUILT_IN_SYNC_FETCH_AND_XOR_1:
7253     case BUILT_IN_SYNC_FETCH_AND_XOR_2:
7254     case BUILT_IN_SYNC_FETCH_AND_XOR_4:
7255     case BUILT_IN_SYNC_FETCH_AND_XOR_8:
7256     case BUILT_IN_SYNC_FETCH_AND_XOR_16:
7257       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_XOR_1);
7258       target = expand_builtin_sync_operation (mode, exp, XOR, false, target);
7259       if (target)
7260         return target;
7261       break;
7262
7263     case BUILT_IN_SYNC_FETCH_AND_NAND_1:
7264     case BUILT_IN_SYNC_FETCH_AND_NAND_2:
7265     case BUILT_IN_SYNC_FETCH_AND_NAND_4:
7266     case BUILT_IN_SYNC_FETCH_AND_NAND_8:
7267     case BUILT_IN_SYNC_FETCH_AND_NAND_16:
7268       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_NAND_1);
7269       target = expand_builtin_sync_operation (mode, exp, NOT, false, target);
7270       if (target)
7271         return target;
7272       break;
7273
7274     case BUILT_IN_SYNC_ADD_AND_FETCH_1:
7275     case BUILT_IN_SYNC_ADD_AND_FETCH_2:
7276     case BUILT_IN_SYNC_ADD_AND_FETCH_4:
7277     case BUILT_IN_SYNC_ADD_AND_FETCH_8:
7278     case BUILT_IN_SYNC_ADD_AND_FETCH_16:
7279       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_ADD_AND_FETCH_1);
7280       target = expand_builtin_sync_operation (mode, exp, PLUS, true, target);
7281       if (target)
7282         return target;
7283       break;
7284
7285     case BUILT_IN_SYNC_SUB_AND_FETCH_1:
7286     case BUILT_IN_SYNC_SUB_AND_FETCH_2:
7287     case BUILT_IN_SYNC_SUB_AND_FETCH_4:
7288     case BUILT_IN_SYNC_SUB_AND_FETCH_8:
7289     case BUILT_IN_SYNC_SUB_AND_FETCH_16:
7290       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_SUB_AND_FETCH_1);
7291       target = expand_builtin_sync_operation (mode, exp, MINUS, true, target);
7292       if (target)
7293         return target;
7294       break;
7295
7296     case BUILT_IN_SYNC_OR_AND_FETCH_1:
7297     case BUILT_IN_SYNC_OR_AND_FETCH_2:
7298     case BUILT_IN_SYNC_OR_AND_FETCH_4:
7299     case BUILT_IN_SYNC_OR_AND_FETCH_8:
7300     case BUILT_IN_SYNC_OR_AND_FETCH_16:
7301       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_OR_AND_FETCH_1);
7302       target = expand_builtin_sync_operation (mode, exp, IOR, true, target);
7303       if (target)
7304         return target;
7305       break;
7306
7307     case BUILT_IN_SYNC_AND_AND_FETCH_1:
7308     case BUILT_IN_SYNC_AND_AND_FETCH_2:
7309     case BUILT_IN_SYNC_AND_AND_FETCH_4:
7310     case BUILT_IN_SYNC_AND_AND_FETCH_8:
7311     case BUILT_IN_SYNC_AND_AND_FETCH_16:
7312       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_AND_AND_FETCH_1);
7313       target = expand_builtin_sync_operation (mode, exp, AND, true, target);
7314       if (target)
7315         return target;
7316       break;
7317
7318     case BUILT_IN_SYNC_XOR_AND_FETCH_1:
7319     case BUILT_IN_SYNC_XOR_AND_FETCH_2:
7320     case BUILT_IN_SYNC_XOR_AND_FETCH_4:
7321     case BUILT_IN_SYNC_XOR_AND_FETCH_8:
7322     case BUILT_IN_SYNC_XOR_AND_FETCH_16:
7323       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_XOR_AND_FETCH_1);
7324       target = expand_builtin_sync_operation (mode, exp, XOR, true, target);
7325       if (target)
7326         return target;
7327       break;
7328
7329     case BUILT_IN_SYNC_NAND_AND_FETCH_1:
7330     case BUILT_IN_SYNC_NAND_AND_FETCH_2:
7331     case BUILT_IN_SYNC_NAND_AND_FETCH_4:
7332     case BUILT_IN_SYNC_NAND_AND_FETCH_8:
7333     case BUILT_IN_SYNC_NAND_AND_FETCH_16:
7334       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_NAND_AND_FETCH_1);
7335       target = expand_builtin_sync_operation (mode, exp, NOT, true, target);
7336       if (target)
7337         return target;
7338       break;
7339
7340     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
7341     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
7342     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
7343     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
7344     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
7345       if (mode == VOIDmode)
7346         mode = TYPE_MODE (boolean_type_node);
7347       if (!target || !register_operand (target, mode))
7348         target = gen_reg_rtx (mode);
7349
7350       mode = get_builtin_sync_mode
7351                                 (fcode - BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1);
7352       target = expand_builtin_compare_and_swap (mode, exp, true, target);
7353       if (target)
7354         return target;
7355       break;
7356
7357     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1:
7358     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2:
7359     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4:
7360     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8:
7361     case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16:
7362       mode = get_builtin_sync_mode
7363                                 (fcode - BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1);
7364       target = expand_builtin_compare_and_swap (mode, exp, false, target);
7365       if (target)
7366         return target;
7367       break;
7368
7369     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1:
7370     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2:
7371     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4:
7372     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8:
7373     case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16:
7374       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_TEST_AND_SET_1);
7375       target = expand_builtin_sync_lock_test_and_set (mode, exp, target);
7376       if (target)
7377         return target;
7378       break;
7379
7380     case BUILT_IN_SYNC_LOCK_RELEASE_1:
7381     case BUILT_IN_SYNC_LOCK_RELEASE_2:
7382     case BUILT_IN_SYNC_LOCK_RELEASE_4:
7383     case BUILT_IN_SYNC_LOCK_RELEASE_8:
7384     case BUILT_IN_SYNC_LOCK_RELEASE_16:
7385       mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_RELEASE_1);
7386       expand_builtin_sync_lock_release (mode, exp);
7387       return const0_rtx;
7388
7389     case BUILT_IN_SYNC_SYNCHRONIZE:
7390       expand_builtin_sync_synchronize ();
7391       return const0_rtx;
7392
7393     case BUILT_IN_ATOMIC_EXCHANGE_1:
7394     case BUILT_IN_ATOMIC_EXCHANGE_2:
7395     case BUILT_IN_ATOMIC_EXCHANGE_4:
7396     case BUILT_IN_ATOMIC_EXCHANGE_8:
7397     case BUILT_IN_ATOMIC_EXCHANGE_16:
7398       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_EXCHANGE_1);
7399       target = expand_builtin_atomic_exchange (mode, exp, target);
7400       if (target)
7401         return target;
7402       break;
7403
7404     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1:
7405     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2:
7406     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4:
7407     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8:
7408     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16:
7409       {
7410         unsigned int nargs, z;
7411         vec<tree, va_gc> *vec;
7412
7413         mode =
7414             get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1);
7415         target = expand_builtin_atomic_compare_exchange (mode, exp, target);
7416         if (target)
7417           return target;
7418
7419         /* If this is turned into an external library call, the weak parameter
7420            must be dropped to match the expected parameter list.  */
7421         nargs = call_expr_nargs (exp);
7422         vec_alloc (vec, nargs - 1);
7423         for (z = 0; z < 3; z++)
7424           vec->quick_push (CALL_EXPR_ARG (exp, z));
7425         /* Skip the boolean weak parameter.  */
7426         for (z = 4; z < 6; z++)
7427           vec->quick_push (CALL_EXPR_ARG (exp, z));
7428         exp = build_call_vec (TREE_TYPE (exp), CALL_EXPR_FN (exp), vec);
7429         break;
7430       }
7431
7432     case BUILT_IN_ATOMIC_LOAD_1:
7433     case BUILT_IN_ATOMIC_LOAD_2:
7434     case BUILT_IN_ATOMIC_LOAD_4:
7435     case BUILT_IN_ATOMIC_LOAD_8:
7436     case BUILT_IN_ATOMIC_LOAD_16:
7437       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_LOAD_1);
7438       target = expand_builtin_atomic_load (mode, exp, target);
7439       if (target)
7440         return target;
7441       break;
7442
7443     case BUILT_IN_ATOMIC_STORE_1:
7444     case BUILT_IN_ATOMIC_STORE_2:
7445     case BUILT_IN_ATOMIC_STORE_4:
7446     case BUILT_IN_ATOMIC_STORE_8:
7447     case BUILT_IN_ATOMIC_STORE_16:
7448       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_STORE_1);
7449       target = expand_builtin_atomic_store (mode, exp);
7450       if (target)
7451         return const0_rtx;
7452       break;
7453
7454     case BUILT_IN_ATOMIC_ADD_FETCH_1:
7455     case BUILT_IN_ATOMIC_ADD_FETCH_2:
7456     case BUILT_IN_ATOMIC_ADD_FETCH_4:
7457     case BUILT_IN_ATOMIC_ADD_FETCH_8:
7458     case BUILT_IN_ATOMIC_ADD_FETCH_16:
7459       {
7460         enum built_in_function lib;
7461         mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1);
7462         lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_ADD_1 +
7463                                        (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1));
7464         target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, true,
7465                                                  ignore, lib);
7466         if (target)
7467           return target;
7468         break;
7469       }
7470     case BUILT_IN_ATOMIC_SUB_FETCH_1:
7471     case BUILT_IN_ATOMIC_SUB_FETCH_2:
7472     case BUILT_IN_ATOMIC_SUB_FETCH_4:
7473     case BUILT_IN_ATOMIC_SUB_FETCH_8:
7474     case BUILT_IN_ATOMIC_SUB_FETCH_16:
7475       {
7476         enum built_in_function lib;
7477         mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1);
7478         lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_SUB_1 +
7479                                        (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1));
7480         target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, true,
7481                                                  ignore, lib);
7482         if (target)
7483           return target;
7484         break;
7485       }
7486     case BUILT_IN_ATOMIC_AND_FETCH_1:
7487     case BUILT_IN_ATOMIC_AND_FETCH_2:
7488     case BUILT_IN_ATOMIC_AND_FETCH_4:
7489     case BUILT_IN_ATOMIC_AND_FETCH_8:
7490     case BUILT_IN_ATOMIC_AND_FETCH_16:
7491       {
7492         enum built_in_function lib;
7493         mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_AND_FETCH_1);
7494         lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_AND_1 +
7495                                        (fcode - BUILT_IN_ATOMIC_AND_FETCH_1));
7496         target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, true,
7497                                                  ignore, lib);
7498         if (target)
7499           return target;
7500         break;
7501       }
7502     case BUILT_IN_ATOMIC_NAND_FETCH_1:
7503     case BUILT_IN_ATOMIC_NAND_FETCH_2:
7504     case BUILT_IN_ATOMIC_NAND_FETCH_4:
7505     case BUILT_IN_ATOMIC_NAND_FETCH_8:
7506     case BUILT_IN_ATOMIC_NAND_FETCH_16:
7507       {
7508         enum built_in_function lib;
7509         mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1);
7510         lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_NAND_1 +
7511                                        (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1));
7512         target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, true,
7513                                                  ignore, lib);
7514         if (target)
7515           return target;
7516         break;
7517       }
7518     case BUILT_IN_ATOMIC_XOR_FETCH_1:
7519     case BUILT_IN_ATOMIC_XOR_FETCH_2:
7520     case BUILT_IN_ATOMIC_XOR_FETCH_4:
7521     case BUILT_IN_ATOMIC_XOR_FETCH_8:
7522     case BUILT_IN_ATOMIC_XOR_FETCH_16:
7523       {
7524         enum built_in_function lib;
7525         mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1);
7526         lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_XOR_1 +
7527                                        (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1));
7528         target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, true,
7529                                                  ignore, lib);
7530         if (target)
7531           return target;
7532         break;
7533       }
7534     case BUILT_IN_ATOMIC_OR_FETCH_1:
7535     case BUILT_IN_ATOMIC_OR_FETCH_2:
7536     case BUILT_IN_ATOMIC_OR_FETCH_4:
7537     case BUILT_IN_ATOMIC_OR_FETCH_8:
7538     case BUILT_IN_ATOMIC_OR_FETCH_16:
7539       {
7540         enum built_in_function lib;
7541         mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_OR_FETCH_1);
7542         lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_OR_1 +
7543                                        (fcode - BUILT_IN_ATOMIC_OR_FETCH_1));
7544         target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, true,
7545                                                  ignore, lib);
7546         if (target)
7547           return target;
7548         break;
7549       }
7550     case BUILT_IN_ATOMIC_FETCH_ADD_1:
7551     case BUILT_IN_ATOMIC_FETCH_ADD_2:
7552     case BUILT_IN_ATOMIC_FETCH_ADD_4:
7553     case BUILT_IN_ATOMIC_FETCH_ADD_8:
7554     case BUILT_IN_ATOMIC_FETCH_ADD_16:
7555       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_ADD_1);
7556       target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, false,
7557                                                ignore, BUILT_IN_NONE);
7558       if (target)
7559         return target;
7560       break;
7561
7562     case BUILT_IN_ATOMIC_FETCH_SUB_1:
7563     case BUILT_IN_ATOMIC_FETCH_SUB_2:
7564     case BUILT_IN_ATOMIC_FETCH_SUB_4:
7565     case BUILT_IN_ATOMIC_FETCH_SUB_8:
7566     case BUILT_IN_ATOMIC_FETCH_SUB_16:
7567       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_SUB_1);
7568       target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, false,
7569                                                ignore, BUILT_IN_NONE);
7570       if (target)
7571         return target;
7572       break;
7573
7574     case BUILT_IN_ATOMIC_FETCH_AND_1:
7575     case BUILT_IN_ATOMIC_FETCH_AND_2:
7576     case BUILT_IN_ATOMIC_FETCH_AND_4:
7577     case BUILT_IN_ATOMIC_FETCH_AND_8:
7578     case BUILT_IN_ATOMIC_FETCH_AND_16:
7579       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_AND_1);
7580       target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, false,
7581                                                ignore, BUILT_IN_NONE);
7582       if (target)
7583         return target;
7584       break;
7585
7586     case BUILT_IN_ATOMIC_FETCH_NAND_1:
7587     case BUILT_IN_ATOMIC_FETCH_NAND_2:
7588     case BUILT_IN_ATOMIC_FETCH_NAND_4:
7589     case BUILT_IN_ATOMIC_FETCH_NAND_8:
7590     case BUILT_IN_ATOMIC_FETCH_NAND_16:
7591       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_NAND_1);
7592       target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, false,
7593                                                ignore, BUILT_IN_NONE);
7594       if (target)
7595         return target;
7596       break;
7597
7598     case BUILT_IN_ATOMIC_FETCH_XOR_1:
7599     case BUILT_IN_ATOMIC_FETCH_XOR_2:
7600     case BUILT_IN_ATOMIC_FETCH_XOR_4:
7601     case BUILT_IN_ATOMIC_FETCH_XOR_8:
7602     case BUILT_IN_ATOMIC_FETCH_XOR_16:
7603       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_XOR_1);
7604       target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, false,
7605                                                ignore, BUILT_IN_NONE);
7606       if (target)
7607         return target;
7608       break;
7609
7610     case BUILT_IN_ATOMIC_FETCH_OR_1:
7611     case BUILT_IN_ATOMIC_FETCH_OR_2:
7612     case BUILT_IN_ATOMIC_FETCH_OR_4:
7613     case BUILT_IN_ATOMIC_FETCH_OR_8:
7614     case BUILT_IN_ATOMIC_FETCH_OR_16:
7615       mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_OR_1);
7616       target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, false,
7617                                                ignore, BUILT_IN_NONE);
7618       if (target)
7619         return target;
7620       break;
7621
7622     case BUILT_IN_ATOMIC_TEST_AND_SET:
7623       return expand_builtin_atomic_test_and_set (exp, target);
7624
7625     case BUILT_IN_ATOMIC_CLEAR:
7626       return expand_builtin_atomic_clear (exp);
7627
7628     case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
7629       return expand_builtin_atomic_always_lock_free (exp);
7630
7631     case BUILT_IN_ATOMIC_IS_LOCK_FREE:
7632       target = expand_builtin_atomic_is_lock_free (exp);
7633       if (target)
7634         return target;
7635       break;
7636
7637     case BUILT_IN_ATOMIC_THREAD_FENCE:
7638       expand_builtin_atomic_thread_fence (exp);
7639       return const0_rtx;
7640
7641     case BUILT_IN_ATOMIC_SIGNAL_FENCE:
7642       expand_builtin_atomic_signal_fence (exp);
7643       return const0_rtx;
7644
7645     case BUILT_IN_OBJECT_SIZE:
7646       return expand_builtin_object_size (exp);
7647
7648     case BUILT_IN_MEMCPY_CHK:
7649     case BUILT_IN_MEMPCPY_CHK:
7650     case BUILT_IN_MEMMOVE_CHK:
7651     case BUILT_IN_MEMSET_CHK:
7652       target = expand_builtin_memory_chk (exp, target, mode, fcode);
7653       if (target)
7654         return target;
7655       break;
7656
7657     case BUILT_IN_STRCPY_CHK:
7658     case BUILT_IN_STPCPY_CHK:
7659     case BUILT_IN_STRNCPY_CHK:
7660     case BUILT_IN_STPNCPY_CHK:
7661     case BUILT_IN_STRCAT_CHK:
7662     case BUILT_IN_STRNCAT_CHK:
7663     case BUILT_IN_SNPRINTF_CHK:
7664     case BUILT_IN_VSNPRINTF_CHK:
7665       maybe_emit_chk_warning (exp, fcode);
7666       break;
7667
7668     case BUILT_IN_SPRINTF_CHK:
7669     case BUILT_IN_VSPRINTF_CHK:
7670       maybe_emit_sprintf_chk_warning (exp, fcode);
7671       break;
7672
7673     case BUILT_IN_FREE:
7674       if (warn_free_nonheap_object)
7675         maybe_emit_free_warning (exp);
7676       break;
7677
7678     case BUILT_IN_THREAD_POINTER:
7679       return expand_builtin_thread_pointer (exp, target);
7680
7681     case BUILT_IN_SET_THREAD_POINTER:
7682       expand_builtin_set_thread_pointer (exp);
7683       return const0_rtx;
7684
7685     case BUILT_IN_CHKP_INIT_PTR_BOUNDS:
7686     case BUILT_IN_CHKP_NULL_PTR_BOUNDS:
7687     case BUILT_IN_CHKP_COPY_PTR_BOUNDS:
7688     case BUILT_IN_CHKP_CHECK_PTR_LBOUNDS:
7689     case BUILT_IN_CHKP_CHECK_PTR_UBOUNDS:
7690     case BUILT_IN_CHKP_CHECK_PTR_BOUNDS:
7691     case BUILT_IN_CHKP_SET_PTR_BOUNDS:
7692     case BUILT_IN_CHKP_NARROW_PTR_BOUNDS:
7693     case BUILT_IN_CHKP_STORE_PTR_BOUNDS:
7694     case BUILT_IN_CHKP_GET_PTR_LBOUND:
7695     case BUILT_IN_CHKP_GET_PTR_UBOUND:
7696       /* We allow user CHKP builtins if Pointer Bounds
7697          Checker is off.  */
7698       if (!chkp_function_instrumented_p (current_function_decl))
7699         {
7700           if (fcode == BUILT_IN_CHKP_SET_PTR_BOUNDS
7701               || fcode == BUILT_IN_CHKP_NARROW_PTR_BOUNDS
7702               || fcode == BUILT_IN_CHKP_INIT_PTR_BOUNDS
7703               || fcode == BUILT_IN_CHKP_NULL_PTR_BOUNDS
7704               || fcode == BUILT_IN_CHKP_COPY_PTR_BOUNDS)
7705             return expand_normal (CALL_EXPR_ARG (exp, 0));
7706           else if (fcode == BUILT_IN_CHKP_GET_PTR_LBOUND)
7707             return expand_normal (size_zero_node);
7708           else if (fcode == BUILT_IN_CHKP_GET_PTR_UBOUND)
7709             return expand_normal (size_int (-1));
7710           else
7711             return const0_rtx;
7712         }
7713       /* FALLTHROUGH */
7714
7715     case BUILT_IN_CHKP_BNDMK:
7716     case BUILT_IN_CHKP_BNDSTX:
7717     case BUILT_IN_CHKP_BNDCL:
7718     case BUILT_IN_CHKP_BNDCU:
7719     case BUILT_IN_CHKP_BNDLDX:
7720     case BUILT_IN_CHKP_BNDRET:
7721     case BUILT_IN_CHKP_INTERSECT:
7722     case BUILT_IN_CHKP_NARROW:
7723     case BUILT_IN_CHKP_EXTRACT_LOWER:
7724     case BUILT_IN_CHKP_EXTRACT_UPPER:
7725       /* Software implementation of Pointer Bounds Checker is NYI.
7726          Target support is required.  */
7727       error ("Your target platform does not support -fcheck-pointer-bounds");
7728       break;
7729
7730     case BUILT_IN_ACC_ON_DEVICE:
7731       /* Do library call, if we failed to expand the builtin when
7732          folding.  */
7733       break;
7734
7735     default:    /* just do library call, if unknown builtin */
7736       break;
7737     }
7738
7739   /* The switch statement above can drop through to cause the function
7740      to be called normally.  */
7741   return expand_call (exp, target, ignore);
7742 }
7743
7744 /* Similar to expand_builtin but is used for instrumented calls.  */
7745
7746 rtx
7747 expand_builtin_with_bounds (tree exp, rtx target,
7748                             rtx subtarget ATTRIBUTE_UNUSED,
7749                             machine_mode mode, int ignore)
7750 {
7751   tree fndecl = get_callee_fndecl (exp);
7752   enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7753
7754   gcc_assert (CALL_WITH_BOUNDS_P (exp));
7755
7756   if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
7757     return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
7758
7759   gcc_assert (fcode > BEGIN_CHKP_BUILTINS
7760               && fcode < END_CHKP_BUILTINS);
7761
7762   switch (fcode)
7763     {
7764     case BUILT_IN_CHKP_MEMCPY_NOBND_NOCHK_CHKP:
7765       target = expand_builtin_memcpy_with_bounds (exp, target);
7766       if (target)
7767         return target;
7768       break;
7769
7770     case BUILT_IN_CHKP_MEMPCPY_NOBND_NOCHK_CHKP:
7771       target = expand_builtin_mempcpy_with_bounds (exp, target);
7772       if (target)
7773         return target;
7774       break;
7775
7776     case BUILT_IN_CHKP_MEMSET_NOBND_NOCHK_CHKP:
7777       target = expand_builtin_memset_with_bounds (exp, target, mode);
7778       if (target)
7779         return target;
7780       break;
7781
7782     case BUILT_IN_MEMCPY_CHKP:
7783     case BUILT_IN_MEMMOVE_CHKP:
7784     case BUILT_IN_MEMPCPY_CHKP:
7785       if (call_expr_nargs (exp) > 3)
7786         {
7787           /* memcpy_chkp (void *dst, size_t dstbnd,
7788                           const void *src, size_t srcbnd, size_t n)
7789              and others take a pointer bound argument just after each
7790              pointer argument.  */
7791           tree dest = CALL_EXPR_ARG (exp, 0);
7792           tree src = CALL_EXPR_ARG (exp, 2);
7793           tree len = CALL_EXPR_ARG (exp, 4);
7794
7795           check_memop_access (exp, dest, src, len);
7796           break;
7797         }
7798
7799     default:
7800       break;
7801     }
7802
7803   /* The switch statement above can drop through to cause the function
7804      to be called normally.  */
7805   return expand_call (exp, target, ignore);
7806  }
7807
7808 /* Determine whether a tree node represents a call to a built-in
7809    function.  If the tree T is a call to a built-in function with
7810    the right number of arguments of the appropriate types, return
7811    the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7812    Otherwise the return value is END_BUILTINS.  */
7813
7814 enum built_in_function
7815 builtin_mathfn_code (const_tree t)
7816 {
7817   const_tree fndecl, arg, parmlist;
7818   const_tree argtype, parmtype;
7819   const_call_expr_arg_iterator iter;
7820
7821   if (TREE_CODE (t) != CALL_EXPR
7822       || TREE_CODE (CALL_EXPR_FN (t)) != ADDR_EXPR)
7823     return END_BUILTINS;
7824
7825   fndecl = get_callee_fndecl (t);
7826   if (fndecl == NULL_TREE
7827       || TREE_CODE (fndecl) != FUNCTION_DECL
7828       || ! DECL_BUILT_IN (fndecl)
7829       || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
7830     return END_BUILTINS;
7831
7832   parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
7833   init_const_call_expr_arg_iterator (t, &iter);
7834   for (; parmlist; parmlist = TREE_CHAIN (parmlist))
7835     {
7836       /* If a function doesn't take a variable number of arguments,
7837          the last element in the list will have type `void'.  */
7838       parmtype = TREE_VALUE (parmlist);
7839       if (VOID_TYPE_P (parmtype))
7840         {
7841           if (more_const_call_expr_args_p (&iter))
7842             return END_BUILTINS;
7843           return DECL_FUNCTION_CODE (fndecl);
7844         }
7845
7846       if (! more_const_call_expr_args_p (&iter))
7847         return END_BUILTINS;
7848
7849       arg = next_const_call_expr_arg (&iter);
7850       argtype = TREE_TYPE (arg);
7851
7852       if (SCALAR_FLOAT_TYPE_P (parmtype))
7853         {
7854           if (! SCALAR_FLOAT_TYPE_P (argtype))
7855             return END_BUILTINS;
7856         }
7857       else if (COMPLEX_FLOAT_TYPE_P (parmtype))
7858         {
7859           if (! COMPLEX_FLOAT_TYPE_P (argtype))
7860             return END_BUILTINS;
7861         }
7862       else if (POINTER_TYPE_P (parmtype))
7863         {
7864           if (! POINTER_TYPE_P (argtype))
7865             return END_BUILTINS;
7866         }
7867       else if (INTEGRAL_TYPE_P (parmtype))
7868         {
7869           if (! INTEGRAL_TYPE_P (argtype))
7870             return END_BUILTINS;
7871         }
7872       else
7873         return END_BUILTINS;
7874     }
7875
7876   /* Variable-length argument list.  */
7877   return DECL_FUNCTION_CODE (fndecl);
7878 }
7879
7880 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7881    evaluate to a constant.  */
7882
7883 static tree
7884 fold_builtin_constant_p (tree arg)
7885 {
7886   /* We return 1 for a numeric type that's known to be a constant
7887      value at compile-time or for an aggregate type that's a
7888      literal constant.  */
7889   STRIP_NOPS (arg);
7890
7891   /* If we know this is a constant, emit the constant of one.  */
7892   if (CONSTANT_CLASS_P (arg)
7893       || (TREE_CODE (arg) == CONSTRUCTOR
7894           && TREE_CONSTANT (arg)))
7895     return integer_one_node;
7896   if (TREE_CODE (arg) == ADDR_EXPR)
7897     {
7898        tree op = TREE_OPERAND (arg, 0);
7899        if (TREE_CODE (op) == STRING_CST
7900            || (TREE_CODE (op) == ARRAY_REF
7901                && integer_zerop (TREE_OPERAND (op, 1))
7902                && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
7903          return integer_one_node;
7904     }
7905
7906   /* If this expression has side effects, show we don't know it to be a
7907      constant.  Likewise if it's a pointer or aggregate type since in
7908      those case we only want literals, since those are only optimized
7909      when generating RTL, not later.
7910      And finally, if we are compiling an initializer, not code, we
7911      need to return a definite result now; there's not going to be any
7912      more optimization done.  */
7913   if (TREE_SIDE_EFFECTS (arg)
7914       || AGGREGATE_TYPE_P (TREE_TYPE (arg))
7915       || POINTER_TYPE_P (TREE_TYPE (arg))
7916       || cfun == 0
7917       || folding_initializer
7918       || force_folding_builtin_constant_p)
7919     return integer_zero_node;
7920
7921   return NULL_TREE;
7922 }
7923
7924 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7925    return it as a truthvalue.  */
7926
7927 static tree
7928 build_builtin_expect_predicate (location_t loc, tree pred, tree expected,
7929                                 tree predictor)
7930 {
7931   tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
7932
7933   fn = builtin_decl_explicit (BUILT_IN_EXPECT);
7934   arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
7935   ret_type = TREE_TYPE (TREE_TYPE (fn));
7936   pred_type = TREE_VALUE (arg_types);
7937   expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
7938
7939   pred = fold_convert_loc (loc, pred_type, pred);
7940   expected = fold_convert_loc (loc, expected_type, expected);
7941   call_expr = build_call_expr_loc (loc, fn, predictor ? 3 : 2, pred, expected,
7942                                    predictor);
7943
7944   return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
7945                  build_int_cst (ret_type, 0));
7946 }
7947
7948 /* Fold a call to builtin_expect with arguments ARG0 and ARG1.  Return
7949    NULL_TREE if no simplification is possible.  */
7950
7951 tree
7952 fold_builtin_expect (location_t loc, tree arg0, tree arg1, tree arg2)
7953 {
7954   tree inner, fndecl, inner_arg0;
7955   enum tree_code code;
7956
7957   /* Distribute the expected value over short-circuiting operators.
7958      See through the cast from truthvalue_type_node to long.  */
7959   inner_arg0 = arg0;
7960   while (CONVERT_EXPR_P (inner_arg0)
7961          && INTEGRAL_TYPE_P (TREE_TYPE (inner_arg0))
7962          && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner_arg0, 0))))
7963     inner_arg0 = TREE_OPERAND (inner_arg0, 0);
7964
7965   /* If this is a builtin_expect within a builtin_expect keep the
7966      inner one.  See through a comparison against a constant.  It
7967      might have been added to create a thruthvalue.  */
7968   inner = inner_arg0;
7969
7970   if (COMPARISON_CLASS_P (inner)
7971       && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
7972     inner = TREE_OPERAND (inner, 0);
7973
7974   if (TREE_CODE (inner) == CALL_EXPR
7975       && (fndecl = get_callee_fndecl (inner))
7976       && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
7977       && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT)
7978     return arg0;
7979
7980   inner = inner_arg0;
7981   code = TREE_CODE (inner);
7982   if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
7983     {
7984       tree op0 = TREE_OPERAND (inner, 0);
7985       tree op1 = TREE_OPERAND (inner, 1);
7986
7987       op0 = build_builtin_expect_predicate (loc, op0, arg1, arg2);
7988       op1 = build_builtin_expect_predicate (loc, op1, arg1, arg2);
7989       inner = build2 (code, TREE_TYPE (inner), op0, op1);
7990
7991       return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
7992     }
7993
7994   /* If the argument isn't invariant then there's nothing else we can do.  */
7995   if (!TREE_CONSTANT (inner_arg0))
7996     return NULL_TREE;
7997
7998   /* If we expect that a comparison against the argument will fold to
7999      a constant return the constant.  In practice, this means a true
8000      constant or the address of a non-weak symbol.  */
8001   inner = inner_arg0;
8002   STRIP_NOPS (inner);
8003   if (TREE_CODE (inner) == ADDR_EXPR)
8004     {
8005       do
8006         {
8007           inner = TREE_OPERAND (inner, 0);
8008         }
8009       while (TREE_CODE (inner) == COMPONENT_REF
8010              || TREE_CODE (inner) == ARRAY_REF);
8011       if (VAR_OR_FUNCTION_DECL_P (inner) && DECL_WEAK (inner))
8012         return NULL_TREE;
8013     }
8014
8015   /* Otherwise, ARG0 already has the proper type for the return value.  */
8016   return arg0;
8017 }
8018
8019 /* Fold a call to __builtin_classify_type with argument ARG.  */
8020
8021 static tree
8022 fold_builtin_classify_type (tree arg)
8023 {
8024   if (arg == 0)
8025     return build_int_cst (integer_type_node, no_type_class);
8026
8027   return build_int_cst (integer_type_node, type_to_class (TREE_TYPE (arg)));
8028 }
8029
8030 /* Fold a call to __builtin_strlen with argument ARG.  */
8031
8032 static tree
8033 fold_builtin_strlen (location_t loc, tree type, tree arg)
8034 {
8035   if (!validate_arg (arg, POINTER_TYPE))
8036     return NULL_TREE;
8037   else
8038     {
8039       tree len = c_strlen (arg, 0);
8040
8041       if (len)
8042         return fold_convert_loc (loc, type, len);
8043
8044       return NULL_TREE;
8045     }
8046 }
8047
8048 /* Fold a call to __builtin_inf or __builtin_huge_val.  */
8049
8050 static tree
8051 fold_builtin_inf (location_t loc, tree type, int warn)
8052 {
8053   REAL_VALUE_TYPE real;
8054
8055   /* __builtin_inff is intended to be usable to define INFINITY on all
8056      targets.  If an infinity is not available, INFINITY expands "to a
8057      positive constant of type float that overflows at translation
8058      time", footnote "In this case, using INFINITY will violate the
8059      constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8060      Thus we pedwarn to ensure this constraint violation is
8061      diagnosed.  */
8062   if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
8063     pedwarn (loc, 0, "target format does not support infinity");
8064
8065   real_inf (&real);
8066   return build_real (type, real);
8067 }
8068
8069 /* Fold function call to builtin sincos, sincosf, or sincosl.  Return
8070    NULL_TREE if no simplification can be made.  */
8071
8072 static tree
8073 fold_builtin_sincos (location_t loc,
8074                      tree arg0, tree arg1, tree arg2)
8075 {
8076   tree type;
8077   tree fndecl, call = NULL_TREE;
8078
8079   if (!validate_arg (arg0, REAL_TYPE)
8080       || !validate_arg (arg1, POINTER_TYPE)
8081       || !validate_arg (arg2, POINTER_TYPE))
8082     return NULL_TREE;
8083
8084   type = TREE_TYPE (arg0);
8085
8086   /* Calculate the result when the argument is a constant.  */
8087   built_in_function fn = mathfn_built_in_2 (type, CFN_BUILT_IN_CEXPI);
8088   if (fn == END_BUILTINS)
8089     return NULL_TREE;
8090
8091   /* Canonicalize sincos to cexpi.  */
8092   if (TREE_CODE (arg0) == REAL_CST)
8093     {
8094       tree complex_type = build_complex_type (type);
8095       call = fold_const_call (as_combined_fn (fn), complex_type, arg0);
8096     }
8097   if (!call)
8098     {
8099       if (!targetm.libc_has_function (function_c99_math_complex)
8100           || !builtin_decl_implicit_p (fn))
8101         return NULL_TREE;
8102       fndecl = builtin_decl_explicit (fn);
8103       call = build_call_expr_loc (loc, fndecl, 1, arg0);
8104       call = builtin_save_expr (call);
8105     }
8106
8107   return build2 (COMPOUND_EXPR, void_type_node,
8108                  build2 (MODIFY_EXPR, void_type_node,
8109                          build_fold_indirect_ref_loc (loc, arg1),
8110                          fold_build1_loc (loc, IMAGPART_EXPR, type, call)),
8111                  build2 (MODIFY_EXPR, void_type_node,
8112                          build_fold_indirect_ref_loc (loc, arg2),
8113                          fold_build1_loc (loc, REALPART_EXPR, type, call)));
8114 }
8115
8116 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8117    Return NULL_TREE if no simplification can be made.  */
8118
8119 static tree
8120 fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
8121 {
8122   if (!validate_arg (arg1, POINTER_TYPE)
8123       || !validate_arg (arg2, POINTER_TYPE)
8124       || !validate_arg (len, INTEGER_TYPE))
8125     return NULL_TREE;
8126
8127   /* If the LEN parameter is zero, return zero.  */
8128   if (integer_zerop (len))
8129     return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
8130                               arg1, arg2);
8131
8132   /* If ARG1 and ARG2 are the same (and not volatile), return zero.  */
8133   if (operand_equal_p (arg1, arg2, 0))
8134     return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
8135
8136   /* If len parameter is one, return an expression corresponding to
8137      (*(const unsigned char*)arg1 - (const unsigned char*)arg2).  */
8138   if (tree_fits_uhwi_p (len) && tree_to_uhwi (len) == 1)
8139     {
8140       tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
8141       tree cst_uchar_ptr_node
8142         = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
8143
8144       tree ind1
8145         = fold_convert_loc (loc, integer_type_node,
8146                             build1 (INDIRECT_REF, cst_uchar_node,
8147                                     fold_convert_loc (loc,
8148                                                       cst_uchar_ptr_node,
8149                                                       arg1)));
8150       tree ind2
8151         = fold_convert_loc (loc, integer_type_node,
8152                             build1 (INDIRECT_REF, cst_uchar_node,
8153                                     fold_convert_loc (loc,
8154                                                       cst_uchar_ptr_node,
8155                                                       arg2)));
8156       return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
8157     }
8158
8159   return NULL_TREE;
8160 }
8161
8162 /* Fold a call to builtin isascii with argument ARG.  */
8163
8164 static tree
8165 fold_builtin_isascii (location_t loc, tree arg)
8166 {
8167   if (!validate_arg (arg, INTEGER_TYPE))
8168     return NULL_TREE;
8169   else
8170     {
8171       /* Transform isascii(c) -> ((c & ~0x7f) == 0).  */
8172       arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
8173                          build_int_cst (integer_type_node,
8174                                         ~ (unsigned HOST_WIDE_INT) 0x7f));
8175       return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
8176                               arg, integer_zero_node);
8177     }
8178 }
8179
8180 /* Fold a call to builtin toascii with argument ARG.  */
8181
8182 static tree
8183 fold_builtin_toascii (location_t loc, tree arg)
8184 {
8185   if (!validate_arg (arg, INTEGER_TYPE))
8186     return NULL_TREE;
8187
8188   /* Transform toascii(c) -> (c & 0x7f).  */
8189   return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
8190                           build_int_cst (integer_type_node, 0x7f));
8191 }
8192
8193 /* Fold a call to builtin isdigit with argument ARG.  */
8194
8195 static tree
8196 fold_builtin_isdigit (location_t loc, tree arg)
8197 {
8198   if (!validate_arg (arg, INTEGER_TYPE))
8199     return NULL_TREE;
8200   else
8201     {
8202       /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9.  */
8203       /* According to the C standard, isdigit is unaffected by locale.
8204          However, it definitely is affected by the target character set.  */
8205       unsigned HOST_WIDE_INT target_digit0
8206         = lang_hooks.to_target_charset ('0');
8207
8208       if (target_digit0 == 0)
8209         return NULL_TREE;
8210
8211       arg = fold_convert_loc (loc, unsigned_type_node, arg);
8212       arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
8213                          build_int_cst (unsigned_type_node, target_digit0));
8214       return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
8215                           build_int_cst (unsigned_type_node, 9));
8216     }
8217 }
8218
8219 /* Fold a call to fabs, fabsf or fabsl with argument ARG.  */
8220
8221 static tree
8222 fold_builtin_fabs (location_t loc, tree arg, tree type)
8223 {
8224   if (!validate_arg (arg, REAL_TYPE))
8225     return NULL_TREE;
8226
8227   arg = fold_convert_loc (loc, type, arg);
8228   return fold_build1_loc (loc, ABS_EXPR, type, arg);
8229 }
8230
8231 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG.  */
8232
8233 static tree
8234 fold_builtin_abs (location_t loc, tree arg, tree type)
8235 {
8236   if (!validate_arg (arg, INTEGER_TYPE))
8237     return NULL_TREE;
8238
8239   arg = fold_convert_loc (loc, type, arg);
8240   return fold_build1_loc (loc, ABS_EXPR, type, arg);
8241 }
8242
8243 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012].  */
8244
8245 static tree
8246 fold_builtin_fma (location_t loc, tree arg0, tree arg1, tree arg2, tree type)
8247 {
8248   /* ??? Only expand to FMA_EXPR if it's directly supported.  */
8249   if (validate_arg (arg0, REAL_TYPE)
8250       && validate_arg (arg1, REAL_TYPE)
8251       && validate_arg (arg2, REAL_TYPE)
8252       && optab_handler (fma_optab, TYPE_MODE (type)) != CODE_FOR_nothing)
8253     return fold_build3_loc (loc, FMA_EXPR, type, arg0, arg1, arg2);
8254
8255   return NULL_TREE;
8256 }
8257
8258 /* Fold a call to builtin carg(a+bi) -> atan2(b,a).  */
8259
8260 static tree
8261 fold_builtin_carg (location_t loc, tree arg, tree type)
8262 {
8263   if (validate_arg (arg, COMPLEX_TYPE)
8264       && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE)
8265     {
8266       tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
8267
8268       if (atan2_fn)
8269         {
8270           tree new_arg = builtin_save_expr (arg);
8271           tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
8272           tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
8273           return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
8274         }
8275     }
8276
8277   return NULL_TREE;
8278 }
8279
8280 /* Fold a call to builtin frexp, we can assume the base is 2.  */
8281
8282 static tree
8283 fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
8284 {
8285   if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
8286     return NULL_TREE;
8287
8288   STRIP_NOPS (arg0);
8289
8290   if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
8291     return NULL_TREE;
8292
8293   arg1 = build_fold_indirect_ref_loc (loc, arg1);
8294
8295   /* Proceed if a valid pointer type was passed in.  */
8296   if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
8297     {
8298       const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
8299       tree frac, exp;
8300
8301       switch (value->cl)
8302       {
8303       case rvc_zero:
8304         /* For +-0, return (*exp = 0, +-0).  */
8305         exp = integer_zero_node;
8306         frac = arg0;
8307         break;
8308       case rvc_nan:
8309       case rvc_inf:
8310         /* For +-NaN or +-Inf, *exp is unspecified, return arg0.  */
8311         return omit_one_operand_loc (loc, rettype, arg0, arg1);
8312       case rvc_normal:
8313         {
8314           /* Since the frexp function always expects base 2, and in
8315              GCC normalized significands are already in the range
8316              [0.5, 1.0), we have exactly what frexp wants.  */
8317           REAL_VALUE_TYPE frac_rvt = *value;
8318           SET_REAL_EXP (&frac_rvt, 0);
8319           frac = build_real (rettype, frac_rvt);
8320           exp = build_int_cst (integer_type_node, REAL_EXP (value));
8321         }
8322         break;
8323       default:
8324         gcc_unreachable ();
8325       }
8326
8327       /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8328       arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
8329       TREE_SIDE_EFFECTS (arg1) = 1;
8330       return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
8331     }
8332
8333   return NULL_TREE;
8334 }
8335
8336 /* Fold a call to builtin modf.  */
8337
8338 static tree
8339 fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
8340 {
8341   if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
8342     return NULL_TREE;
8343
8344   STRIP_NOPS (arg0);
8345
8346   if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
8347     return NULL_TREE;
8348
8349   arg1 = build_fold_indirect_ref_loc (loc, arg1);
8350
8351   /* Proceed if a valid pointer type was passed in.  */
8352   if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
8353     {
8354       const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
8355       REAL_VALUE_TYPE trunc, frac;
8356
8357       switch (value->cl)
8358       {
8359       case rvc_nan:
8360       case rvc_zero:
8361         /* For +-NaN or +-0, return (*arg1 = arg0, arg0).  */
8362         trunc = frac = *value;
8363         break;
8364       case rvc_inf:
8365         /* For +-Inf, return (*arg1 = arg0, +-0).  */
8366         frac = dconst0;
8367         frac.sign = value->sign;
8368         trunc = *value;
8369         break;
8370       case rvc_normal:
8371         /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)).  */
8372         real_trunc (&trunc, VOIDmode, value);
8373         real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
8374         /* If the original number was negative and already
8375            integral, then the fractional part is -0.0.  */
8376         if (value->sign && frac.cl == rvc_zero)
8377           frac.sign = value->sign;
8378         break;
8379       }
8380
8381       /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8382       arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
8383                           build_real (rettype, trunc));
8384       TREE_SIDE_EFFECTS (arg1) = 1;
8385       return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
8386                           build_real (rettype, frac));
8387     }
8388
8389   return NULL_TREE;
8390 }
8391
8392 /* Given a location LOC, an interclass builtin function decl FNDECL
8393    and its single argument ARG, return an folded expression computing
8394    the same, or NULL_TREE if we either couldn't or didn't want to fold
8395    (the latter happen if there's an RTL instruction available).  */
8396
8397 static tree
8398 fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
8399 {
8400   machine_mode mode;
8401
8402   if (!validate_arg (arg, REAL_TYPE))
8403     return NULL_TREE;
8404
8405   if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
8406     return NULL_TREE;
8407
8408   mode = TYPE_MODE (TREE_TYPE (arg));
8409
8410   bool is_ibm_extended = MODE_COMPOSITE_P (mode);
8411
8412   /* If there is no optab, try generic code.  */
8413   switch (DECL_FUNCTION_CODE (fndecl))
8414     {
8415       tree result;
8416
8417     CASE_FLT_FN (BUILT_IN_ISINF):
8418       {
8419         /* isinf(x) -> isgreater(fabs(x),DBL_MAX).  */
8420         tree const isgr_fn = builtin_decl_explicit (BUILT_IN_ISGREATER);
8421         tree type = TREE_TYPE (arg);
8422         REAL_VALUE_TYPE r;
8423         char buf[128];
8424
8425         if (is_ibm_extended)
8426           {
8427             /* NaN and Inf are encoded in the high-order double value
8428                only.  The low-order value is not significant.  */
8429             type = double_type_node;
8430             mode = DFmode;
8431             arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
8432           }
8433         get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
8434         real_from_string (&r, buf);
8435         result = build_call_expr (isgr_fn, 2,
8436                                   fold_build1_loc (loc, ABS_EXPR, type, arg),
8437                                   build_real (type, r));
8438         return result;
8439       }
8440     CASE_FLT_FN (BUILT_IN_FINITE):
8441     case BUILT_IN_ISFINITE:
8442       {
8443         /* isfinite(x) -> islessequal(fabs(x),DBL_MAX).  */
8444         tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
8445         tree type = TREE_TYPE (arg);
8446         REAL_VALUE_TYPE r;
8447         char buf[128];
8448
8449         if (is_ibm_extended)
8450           {
8451             /* NaN and Inf are encoded in the high-order double value
8452                only.  The low-order value is not significant.  */
8453             type = double_type_node;
8454             mode = DFmode;
8455             arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
8456           }
8457         get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
8458         real_from_string (&r, buf);
8459         result = build_call_expr (isle_fn, 2,
8460                                   fold_build1_loc (loc, ABS_EXPR, type, arg),
8461                                   build_real (type, r));
8462         /*result = fold_build2_loc (loc, UNGT_EXPR,
8463                                   TREE_TYPE (TREE_TYPE (fndecl)),
8464                                   fold_build1_loc (loc, ABS_EXPR, type, arg),
8465                                   build_real (type, r));
8466         result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8467                                   TREE_TYPE (TREE_TYPE (fndecl)),
8468                                   result);*/
8469         return result;
8470       }
8471     case BUILT_IN_ISNORMAL:
8472       {
8473         /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8474            islessequal(fabs(x),DBL_MAX).  */
8475         tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
8476         tree type = TREE_TYPE (arg);
8477         tree orig_arg, max_exp, min_exp;
8478         machine_mode orig_mode = mode;
8479         REAL_VALUE_TYPE rmax, rmin;
8480         char buf[128];
8481
8482         orig_arg = arg = builtin_save_expr (arg);
8483         if (is_ibm_extended)
8484           {
8485             /* Use double to test the normal range of IBM extended
8486                precision.  Emin for IBM extended precision is
8487                different to emin for IEEE double, being 53 higher
8488                since the low double exponent is at least 53 lower
8489                than the high double exponent.  */
8490             type = double_type_node;
8491             mode = DFmode;
8492             arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
8493           }
8494         arg = fold_build1_loc (loc, ABS_EXPR, type, arg);
8495
8496         get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf));
8497         real_from_string (&rmax, buf);
8498         sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (orig_mode)->emin - 1);
8499         real_from_string (&rmin, buf);
8500         max_exp = build_real (type, rmax);
8501         min_exp = build_real (type, rmin);
8502
8503         max_exp = build_call_expr (isle_fn, 2, arg, max_exp);
8504         if (is_ibm_extended)
8505           {
8506             /* Testing the high end of the range is done just using
8507                the high double, using the same test as isfinite().
8508                For the subnormal end of the range we first test the
8509                high double, then if its magnitude is equal to the
8510                limit of 0x1p-969, we test whether the low double is
8511                non-zero and opposite sign to the high double.  */
8512             tree const islt_fn = builtin_decl_explicit (BUILT_IN_ISLESS);
8513             tree const isgt_fn = builtin_decl_explicit (BUILT_IN_ISGREATER);
8514             tree gt_min = build_call_expr (isgt_fn, 2, arg, min_exp);
8515             tree eq_min = fold_build2 (EQ_EXPR, integer_type_node,
8516                                        arg, min_exp);
8517             tree as_complex = build1 (VIEW_CONVERT_EXPR,
8518                                       complex_double_type_node, orig_arg);
8519             tree hi_dbl = build1 (REALPART_EXPR, type, as_complex);
8520             tree lo_dbl = build1 (IMAGPART_EXPR, type, as_complex);
8521             tree zero = build_real (type, dconst0);
8522             tree hilt = build_call_expr (islt_fn, 2, hi_dbl, zero);
8523             tree lolt = build_call_expr (islt_fn, 2, lo_dbl, zero);
8524             tree logt = build_call_expr (isgt_fn, 2, lo_dbl, zero);
8525             tree ok_lo = fold_build1 (TRUTH_NOT_EXPR, integer_type_node,
8526                                       fold_build3 (COND_EXPR,
8527                                                    integer_type_node,
8528                                                    hilt, logt, lolt));
8529             eq_min = fold_build2 (TRUTH_ANDIF_EXPR, integer_type_node,
8530                                   eq_min, ok_lo);
8531             min_exp = fold_build2 (TRUTH_ORIF_EXPR, integer_type_node,
8532                                    gt_min, eq_min);
8533           }
8534         else
8535           {
8536             tree const isge_fn
8537               = builtin_decl_explicit (BUILT_IN_ISGREATEREQUAL);
8538             min_exp = build_call_expr (isge_fn, 2, arg, min_exp);
8539           }
8540         result = fold_build2 (BIT_AND_EXPR, integer_type_node,
8541                               max_exp, min_exp);
8542         return result;
8543       }
8544     default:
8545       break;
8546     }
8547
8548   return NULL_TREE;
8549 }
8550
8551 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8552    ARG is the argument for the call.  */
8553
8554 static tree
8555 fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
8556 {
8557   tree type = TREE_TYPE (TREE_TYPE (fndecl));
8558
8559   if (!validate_arg (arg, REAL_TYPE))
8560     return NULL_TREE;
8561
8562   switch (builtin_index)
8563     {
8564     case BUILT_IN_ISINF:
8565       if (!HONOR_INFINITIES (arg))
8566         return omit_one_operand_loc (loc, type, integer_zero_node, arg);
8567
8568       return NULL_TREE;
8569
8570     case BUILT_IN_ISINF_SIGN:
8571       {
8572         /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8573         /* In a boolean context, GCC will fold the inner COND_EXPR to
8574            1.  So e.g. "if (isinf_sign(x))" would be folded to just
8575            "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8576         tree signbit_fn = builtin_decl_explicit (BUILT_IN_SIGNBIT);
8577         tree isinf_fn = builtin_decl_explicit (BUILT_IN_ISINF);
8578         tree tmp = NULL_TREE;
8579
8580         arg = builtin_save_expr (arg);
8581
8582         if (signbit_fn && isinf_fn)
8583           {
8584             tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
8585             tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
8586
8587             signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
8588                                         signbit_call, integer_zero_node);
8589             isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
8590                                       isinf_call, integer_zero_node);
8591
8592             tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
8593                                integer_minus_one_node, integer_one_node);
8594             tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
8595                                isinf_call, tmp,
8596                                integer_zero_node);
8597           }
8598
8599         return tmp;
8600       }
8601
8602     case BUILT_IN_ISFINITE:
8603       if (!HONOR_NANS (arg)
8604           && !HONOR_INFINITIES (arg))
8605         return omit_one_operand_loc (loc, type, integer_one_node, arg);
8606
8607       return NULL_TREE;
8608
8609     case BUILT_IN_ISNAN:
8610       if (!HONOR_NANS (arg))
8611         return omit_one_operand_loc (loc, type, integer_zero_node, arg);
8612
8613       {
8614         bool is_ibm_extended = MODE_COMPOSITE_P (TYPE_MODE (TREE_TYPE (arg)));
8615         if (is_ibm_extended)
8616           {
8617             /* NaN and Inf are encoded in the high-order double value
8618                only.  The low-order value is not significant.  */
8619             arg = fold_build1_loc (loc, NOP_EXPR, double_type_node, arg);
8620           }
8621       }
8622       arg = builtin_save_expr (arg);
8623       return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
8624
8625     default:
8626       gcc_unreachable ();
8627     }
8628 }
8629
8630 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8631    This builtin will generate code to return the appropriate floating
8632    point classification depending on the value of the floating point
8633    number passed in.  The possible return values must be supplied as
8634    int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8635    FP_NORMAL, FP_SUBNORMAL and FP_ZERO.  The ellipses is for exactly
8636    one floating point argument which is "type generic".  */
8637
8638 static tree
8639 fold_builtin_fpclassify (location_t loc, tree *args, int nargs)
8640 {
8641   tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
8642     arg, type, res, tmp;
8643   machine_mode mode;
8644   REAL_VALUE_TYPE r;
8645   char buf[128];
8646
8647   /* Verify the required arguments in the original call.  */
8648   if (nargs != 6
8649       || !validate_arg (args[0], INTEGER_TYPE)
8650       || !validate_arg (args[1], INTEGER_TYPE)
8651       || !validate_arg (args[2], INTEGER_TYPE)
8652       || !validate_arg (args[3], INTEGER_TYPE)
8653       || !validate_arg (args[4], INTEGER_TYPE)
8654       || !validate_arg (args[5], REAL_TYPE))
8655     return NULL_TREE;
8656
8657   fp_nan = args[0];
8658   fp_infinite = args[1];
8659   fp_normal = args[2];
8660   fp_subnormal = args[3];
8661   fp_zero = args[4];
8662   arg = args[5];
8663   type = TREE_TYPE (arg);
8664   mode = TYPE_MODE (type);
8665   arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
8666
8667   /* fpclassify(x) ->
8668        isnan(x) ? FP_NAN :
8669          (fabs(x) == Inf ? FP_INFINITE :
8670            (fabs(x) >= DBL_MIN ? FP_NORMAL :
8671              (x == 0 ? FP_ZERO : FP_SUBNORMAL))).  */
8672
8673   tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
8674                      build_real (type, dconst0));
8675   res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
8676                      tmp, fp_zero, fp_subnormal);
8677
8678   sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
8679   real_from_string (&r, buf);
8680   tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
8681                      arg, build_real (type, r));
8682   res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, fp_normal, res);
8683
8684   if (HONOR_INFINITIES (mode))
8685     {
8686       real_inf (&r);
8687       tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
8688                          build_real (type, r));
8689       res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
8690                          fp_infinite, res);
8691     }
8692
8693   if (HONOR_NANS (mode))
8694     {
8695       tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
8696       res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, res, fp_nan);
8697     }
8698
8699   return res;
8700 }
8701
8702 /* Fold a call to an unordered comparison function such as
8703    __builtin_isgreater().  FNDECL is the FUNCTION_DECL for the function
8704    being called and ARG0 and ARG1 are the arguments for the call.
8705    UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8706    the opposite of the desired result.  UNORDERED_CODE is used
8707    for modes that can hold NaNs and ORDERED_CODE is used for
8708    the rest.  */
8709
8710 static tree
8711 fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
8712                             enum tree_code unordered_code,
8713                             enum tree_code ordered_code)
8714 {
8715   tree type = TREE_TYPE (TREE_TYPE (fndecl));
8716   enum tree_code code;
8717   tree type0, type1;
8718   enum tree_code code0, code1;
8719   tree cmp_type = NULL_TREE;
8720
8721   type0 = TREE_TYPE (arg0);
8722   type1 = TREE_TYPE (arg1);
8723
8724   code0 = TREE_CODE (type0);
8725   code1 = TREE_CODE (type1);
8726
8727   if (code0 == REAL_TYPE && code1 == REAL_TYPE)
8728     /* Choose the wider of two real types.  */
8729     cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
8730       ? type0 : type1;
8731   else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
8732     cmp_type = type0;
8733   else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE)
8734     cmp_type = type1;
8735
8736   arg0 = fold_convert_loc (loc, cmp_type, arg0);
8737   arg1 = fold_convert_loc (loc, cmp_type, arg1);
8738
8739   if (unordered_code == UNORDERED_EXPR)
8740     {
8741       if (!HONOR_NANS (arg0))
8742         return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
8743       return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
8744     }
8745
8746   code = HONOR_NANS (arg0) ? unordered_code : ordered_code;
8747   return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
8748                       fold_build2_loc (loc, code, type, arg0, arg1));
8749 }
8750
8751 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8752    arithmetics if it can never overflow, or into internal functions that
8753    return both result of arithmetics and overflowed boolean flag in
8754    a complex integer result, or some other check for overflow.
8755    Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8756    checking part of that.  */
8757
8758 static tree
8759 fold_builtin_arith_overflow (location_t loc, enum built_in_function fcode,
8760                              tree arg0, tree arg1, tree arg2)
8761 {
8762   enum internal_fn ifn = IFN_LAST;
8763   /* The code of the expression corresponding to the type-generic
8764      built-in, or ERROR_MARK for the type-specific ones.  */
8765   enum tree_code opcode = ERROR_MARK;
8766   bool ovf_only = false;
8767
8768   switch (fcode)
8769     {
8770     case BUILT_IN_ADD_OVERFLOW_P:
8771       ovf_only = true;
8772       /* FALLTHRU */
8773     case BUILT_IN_ADD_OVERFLOW:
8774       opcode = PLUS_EXPR;
8775       /* FALLTHRU */
8776     case BUILT_IN_SADD_OVERFLOW:
8777     case BUILT_IN_SADDL_OVERFLOW:
8778     case BUILT_IN_SADDLL_OVERFLOW:
8779     case BUILT_IN_UADD_OVERFLOW:
8780     case BUILT_IN_UADDL_OVERFLOW:
8781     case BUILT_IN_UADDLL_OVERFLOW:
8782       ifn = IFN_ADD_OVERFLOW;
8783       break;
8784     case BUILT_IN_SUB_OVERFLOW_P:
8785       ovf_only = true;
8786       /* FALLTHRU */
8787     case BUILT_IN_SUB_OVERFLOW:
8788       opcode = MINUS_EXPR;
8789       /* FALLTHRU */
8790     case BUILT_IN_SSUB_OVERFLOW:
8791     case BUILT_IN_SSUBL_OVERFLOW:
8792     case BUILT_IN_SSUBLL_OVERFLOW:
8793     case BUILT_IN_USUB_OVERFLOW:
8794     case BUILT_IN_USUBL_OVERFLOW:
8795     case BUILT_IN_USUBLL_OVERFLOW:
8796       ifn = IFN_SUB_OVERFLOW;
8797       break;
8798     case BUILT_IN_MUL_OVERFLOW_P:
8799       ovf_only = true;
8800       /* FALLTHRU */
8801     case BUILT_IN_MUL_OVERFLOW:
8802       opcode = MULT_EXPR;
8803       /* FALLTHRU */
8804     case BUILT_IN_SMUL_OVERFLOW:
8805     case BUILT_IN_SMULL_OVERFLOW:
8806     case BUILT_IN_SMULLL_OVERFLOW:
8807     case BUILT_IN_UMUL_OVERFLOW:
8808     case BUILT_IN_UMULL_OVERFLOW:
8809     case BUILT_IN_UMULLL_OVERFLOW:
8810       ifn = IFN_MUL_OVERFLOW;
8811       break;
8812     default:
8813       gcc_unreachable ();
8814     }
8815
8816   /* For the "generic" overloads, the first two arguments can have different
8817      types and the last argument determines the target type to use to check
8818      for overflow.  The arguments of the other overloads all have the same
8819      type.  */
8820   tree type = ovf_only ? TREE_TYPE (arg2) : TREE_TYPE (TREE_TYPE (arg2));
8821
8822   /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8823      arguments are constant, attempt to fold the built-in call into a constant
8824      expression indicating whether or not it detected an overflow.  */
8825   if (ovf_only
8826       && TREE_CODE (arg0) == INTEGER_CST
8827       && TREE_CODE (arg1) == INTEGER_CST)
8828     /* Perform the computation in the target type and check for overflow.  */
8829     return omit_one_operand_loc (loc, boolean_type_node,
8830                                  arith_overflowed_p (opcode, type, arg0, arg1)
8831                                  ? boolean_true_node : boolean_false_node,
8832                                  arg2);
8833
8834   tree ctype = build_complex_type (type);
8835   tree call = build_call_expr_internal_loc (loc, ifn, ctype,
8836                                             2, arg0, arg1);
8837   tree tgt = save_expr (call);
8838   tree intres = build1_loc (loc, REALPART_EXPR, type, tgt);
8839   tree ovfres = build1_loc (loc, IMAGPART_EXPR, type, tgt);
8840   ovfres = fold_convert_loc (loc, boolean_type_node, ovfres);
8841
8842   if (ovf_only)
8843     return omit_one_operand_loc (loc, boolean_type_node, ovfres, arg2);
8844
8845   tree mem_arg2 = build_fold_indirect_ref_loc (loc, arg2);
8846   tree store
8847     = fold_build2_loc (loc, MODIFY_EXPR, void_type_node, mem_arg2, intres);
8848   return build2_loc (loc, COMPOUND_EXPR, boolean_type_node, store, ovfres);
8849 }
8850
8851 /* Fold a call to __builtin_FILE to a constant string.  */
8852
8853 static inline tree
8854 fold_builtin_FILE (location_t loc)
8855 {
8856   if (const char *fname = LOCATION_FILE (loc))
8857     return build_string_literal (strlen (fname) + 1, fname);
8858
8859   return build_string_literal (1, "");
8860 }
8861
8862 /* Fold a call to __builtin_FUNCTION to a constant string.  */
8863
8864 static inline tree
8865 fold_builtin_FUNCTION ()
8866 {
8867   const char *name = "";
8868
8869   if (current_function_decl)
8870     name = lang_hooks.decl_printable_name (current_function_decl, 0);
8871
8872   return build_string_literal (strlen (name) + 1, name);
8873 }
8874
8875 /* Fold a call to __builtin_LINE to an integer constant.  */
8876
8877 static inline tree
8878 fold_builtin_LINE (location_t loc, tree type)
8879 {
8880   return build_int_cst (type, LOCATION_LINE (loc));
8881 }
8882
8883 /* Fold a call to built-in function FNDECL with 0 arguments.
8884    This function returns NULL_TREE if no simplification was possible.  */
8885
8886 static tree
8887 fold_builtin_0 (location_t loc, tree fndecl)
8888 {
8889   tree type = TREE_TYPE (TREE_TYPE (fndecl));
8890   enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
8891   switch (fcode)
8892     {
8893     case BUILT_IN_FILE:
8894       return fold_builtin_FILE (loc);
8895
8896     case BUILT_IN_FUNCTION:
8897       return fold_builtin_FUNCTION ();
8898
8899     case BUILT_IN_LINE:
8900       return fold_builtin_LINE (loc, type);
8901
8902     CASE_FLT_FN (BUILT_IN_INF):
8903     CASE_FLT_FN_FLOATN_NX (BUILT_IN_INF):
8904     case BUILT_IN_INFD32:
8905     case BUILT_IN_INFD64:
8906     case BUILT_IN_INFD128:
8907       return fold_builtin_inf (loc, type, true);
8908
8909     CASE_FLT_FN (BUILT_IN_HUGE_VAL):
8910     CASE_FLT_FN_FLOATN_NX (BUILT_IN_HUGE_VAL):
8911       return fold_builtin_inf (loc, type, false);
8912
8913     case BUILT_IN_CLASSIFY_TYPE:
8914       return fold_builtin_classify_type (NULL_TREE);
8915
8916     default:
8917       break;
8918     }
8919   return NULL_TREE;
8920 }
8921
8922 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8923    This function returns NULL_TREE if no simplification was possible.  */
8924
8925 static tree
8926 fold_builtin_1 (location_t loc, tree fndecl, tree arg0)
8927 {
8928   tree type = TREE_TYPE (TREE_TYPE (fndecl));
8929   enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
8930
8931   if (TREE_CODE (arg0) == ERROR_MARK)
8932     return NULL_TREE;
8933
8934   if (tree ret = fold_const_call (as_combined_fn (fcode), type, arg0))
8935     return ret;
8936
8937   switch (fcode)
8938     {
8939     case BUILT_IN_CONSTANT_P:
8940       {
8941         tree val = fold_builtin_constant_p (arg0);
8942
8943         /* Gimplification will pull the CALL_EXPR for the builtin out of
8944            an if condition.  When not optimizing, we'll not CSE it back.
8945            To avoid link error types of regressions, return false now.  */
8946         if (!val && !optimize)
8947           val = integer_zero_node;
8948
8949         return val;
8950       }
8951
8952     case BUILT_IN_CLASSIFY_TYPE:
8953       return fold_builtin_classify_type (arg0);
8954
8955     case BUILT_IN_STRLEN:
8956       return fold_builtin_strlen (loc, type, arg0);
8957
8958     CASE_FLT_FN (BUILT_IN_FABS):
8959     CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS):
8960     case BUILT_IN_FABSD32:
8961     case BUILT_IN_FABSD64:
8962     case BUILT_IN_FABSD128:
8963       return fold_builtin_fabs (loc, arg0, type);
8964
8965     case BUILT_IN_ABS:
8966     case BUILT_IN_LABS:
8967     case BUILT_IN_LLABS:
8968     case BUILT_IN_IMAXABS:
8969       return fold_builtin_abs (loc, arg0, type);
8970
8971     CASE_FLT_FN (BUILT_IN_CONJ):
8972       if (validate_arg (arg0, COMPLEX_TYPE)
8973         && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
8974         return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
8975     break;
8976
8977     CASE_FLT_FN (BUILT_IN_CREAL):
8978       if (validate_arg (arg0, COMPLEX_TYPE)
8979         && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
8980         return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));
8981     break;
8982
8983     CASE_FLT_FN (BUILT_IN_CIMAG):
8984       if (validate_arg (arg0, COMPLEX_TYPE)
8985           && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
8986         return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0));
8987     break;
8988
8989     CASE_FLT_FN (BUILT_IN_CARG):
8990       return fold_builtin_carg (loc, arg0, type);
8991
8992     case BUILT_IN_ISASCII:
8993       return fold_builtin_isascii (loc, arg0);
8994
8995     case BUILT_IN_TOASCII:
8996       return fold_builtin_toascii (loc, arg0);
8997
8998     case BUILT_IN_ISDIGIT:
8999       return fold_builtin_isdigit (loc, arg0);
9000
9001     CASE_FLT_FN (BUILT_IN_FINITE):
9002     case BUILT_IN_FINITED32:
9003     case BUILT_IN_FINITED64:
9004     case BUILT_IN_FINITED128:
9005     case BUILT_IN_ISFINITE:
9006       {
9007         tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
9008         if (ret)
9009           return ret;
9010         return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
9011       }
9012
9013     CASE_FLT_FN (BUILT_IN_ISINF):
9014     case BUILT_IN_ISINFD32:
9015     case BUILT_IN_ISINFD64:
9016     case BUILT_IN_ISINFD128:
9017       {
9018         tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
9019         if (ret)
9020           return ret;
9021         return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
9022       }
9023
9024     case BUILT_IN_ISNORMAL:
9025       return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
9026
9027     case BUILT_IN_ISINF_SIGN:
9028       return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
9029
9030     CASE_FLT_FN (BUILT_IN_ISNAN):
9031     case BUILT_IN_ISNAND32:
9032     case BUILT_IN_ISNAND64:
9033     case BUILT_IN_ISNAND128:
9034       return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
9035
9036     case BUILT_IN_FREE:
9037       if (integer_zerop (arg0))
9038         return build_empty_stmt (loc);
9039       break;
9040
9041     default:
9042       break;
9043     }
9044
9045   return NULL_TREE;
9046
9047 }
9048
9049 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9050    This function returns NULL_TREE if no simplification was possible.  */
9051
9052 static tree
9053 fold_builtin_2 (location_t loc, tree fndecl, tree arg0, tree arg1)
9054 {
9055   tree type = TREE_TYPE (TREE_TYPE (fndecl));
9056   enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9057
9058   if (TREE_CODE (arg0) == ERROR_MARK
9059       || TREE_CODE (arg1) == ERROR_MARK)
9060     return NULL_TREE;
9061
9062   if (tree ret = fold_const_call (as_combined_fn (fcode), type, arg0, arg1))
9063     return ret;
9064
9065   switch (fcode)
9066     {
9067     CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
9068     CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
9069       if (validate_arg (arg0, REAL_TYPE)
9070           && validate_arg (arg1, POINTER_TYPE))
9071         return do_mpfr_lgamma_r (arg0, arg1, type);
9072     break;
9073
9074     CASE_FLT_FN (BUILT_IN_FREXP):
9075       return fold_builtin_frexp (loc, arg0, arg1, type);
9076
9077     CASE_FLT_FN (BUILT_IN_MODF):
9078       return fold_builtin_modf (loc, arg0, arg1, type);
9079
9080     case BUILT_IN_STRSPN:
9081       return fold_builtin_strspn (loc, arg0, arg1);
9082
9083     case BUILT_IN_STRCSPN:
9084       return fold_builtin_strcspn (loc, arg0, arg1);
9085
9086     case BUILT_IN_STRPBRK:
9087       return fold_builtin_strpbrk (loc, arg0, arg1, type);
9088
9089     case BUILT_IN_EXPECT:
9090       return fold_builtin_expect (loc, arg0, arg1, NULL_TREE);
9091
9092     case BUILT_IN_ISGREATER:
9093       return fold_builtin_unordered_cmp (loc, fndecl,
9094                                          arg0, arg1, UNLE_EXPR, LE_EXPR);
9095     case BUILT_IN_ISGREATEREQUAL:
9096       return fold_builtin_unordered_cmp (loc, fndecl,
9097                                          arg0, arg1, UNLT_EXPR, LT_EXPR);
9098     case BUILT_IN_ISLESS:
9099       return fold_builtin_unordered_cmp (loc, fndecl,
9100                                          arg0, arg1, UNGE_EXPR, GE_EXPR);
9101     case BUILT_IN_ISLESSEQUAL:
9102       return fold_builtin_unordered_cmp (loc, fndecl,
9103                                          arg0, arg1, UNGT_EXPR, GT_EXPR);
9104     case BUILT_IN_ISLESSGREATER:
9105       return fold_builtin_unordered_cmp (loc, fndecl,
9106                                          arg0, arg1, UNEQ_EXPR, EQ_EXPR);
9107     case BUILT_IN_ISUNORDERED:
9108       return fold_builtin_unordered_cmp (loc, fndecl,
9109                                          arg0, arg1, UNORDERED_EXPR,
9110                                          NOP_EXPR);
9111
9112       /* We do the folding for va_start in the expander.  */
9113     case BUILT_IN_VA_START:
9114       break;
9115
9116     case BUILT_IN_OBJECT_SIZE:
9117       return fold_builtin_object_size (arg0, arg1);
9118
9119     case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
9120       return fold_builtin_atomic_always_lock_free (arg0, arg1);
9121
9122     case BUILT_IN_ATOMIC_IS_LOCK_FREE:
9123       return fold_builtin_atomic_is_lock_free (arg0, arg1);
9124
9125     default:
9126       break;
9127     }
9128   return NULL_TREE;
9129 }
9130
9131 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9132    and ARG2.
9133    This function returns NULL_TREE if no simplification was possible.  */
9134
9135 static tree
9136 fold_builtin_3 (location_t loc, tree fndecl,
9137                 tree arg0, tree arg1, tree arg2)
9138 {
9139   tree type = TREE_TYPE (TREE_TYPE (fndecl));
9140   enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
9141
9142   if (TREE_CODE (arg0) == ERROR_MARK
9143       || TREE_CODE (arg1) == ERROR_MARK
9144       || TREE_CODE (arg2) == ERROR_MARK)
9145     return NULL_TREE;
9146
9147   if (tree ret = fold_const_call (as_combined_fn (fcode), type,
9148                                   arg0, arg1, arg2))
9149     return ret;
9150
9151   switch (fcode)
9152     {
9153
9154     CASE_FLT_FN (BUILT_IN_SINCOS):
9155       return fold_builtin_sincos (loc, arg0, arg1, arg2);
9156
9157     CASE_FLT_FN (BUILT_IN_FMA):
9158     CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
9159       return fold_builtin_fma (loc, arg0, arg1, arg2, type);
9160
9161     CASE_FLT_FN (BUILT_IN_REMQUO):
9162       if (validate_arg (arg0, REAL_TYPE)
9163           && validate_arg (arg1, REAL_TYPE)
9164           && validate_arg (arg2, POINTER_TYPE))
9165         return do_mpfr_remquo (arg0, arg1, arg2);
9166     break;
9167
9168     case BUILT_IN_MEMCMP:
9169       return fold_builtin_memcmp (loc, arg0, arg1, arg2);
9170
9171     case BUILT_IN_EXPECT:
9172       return fold_builtin_expect (loc, arg0, arg1, arg2);
9173
9174     case BUILT_IN_ADD_OVERFLOW:
9175     case BUILT_IN_SUB_OVERFLOW:
9176     case BUILT_IN_MUL_OVERFLOW:
9177     case BUILT_IN_ADD_OVERFLOW_P:
9178     case BUILT_IN_SUB_OVERFLOW_P:
9179     case BUILT_IN_MUL_OVERFLOW_P:
9180     case BUILT_IN_SADD_OVERFLOW:
9181     case BUILT_IN_SADDL_OVERFLOW:
9182     case BUILT_IN_SADDLL_OVERFLOW:
9183     case BUILT_IN_SSUB_OVERFLOW:
9184     case BUILT_IN_SSUBL_OVERFLOW:
9185     case BUILT_IN_SSUBLL_OVERFLOW:
9186     case BUILT_IN_SMUL_OVERFLOW:
9187     case BUILT_IN_SMULL_OVERFLOW:
9188     case BUILT_IN_SMULLL_OVERFLOW:
9189     case BUILT_IN_UADD_OVERFLOW:
9190     case BUILT_IN_UADDL_OVERFLOW:
9191     case BUILT_IN_UADDLL_OVERFLOW:
9192     case BUILT_IN_USUB_OVERFLOW:
9193     case BUILT_IN_USUBL_OVERFLOW:
9194     case BUILT_IN_USUBLL_OVERFLOW:
9195     case BUILT_IN_UMUL_OVERFLOW:
9196     case BUILT_IN_UMULL_OVERFLOW:
9197     case BUILT_IN_UMULLL_OVERFLOW:
9198       return fold_builtin_arith_overflow (loc, fcode, arg0, arg1, arg2);
9199
9200     default:
9201       break;
9202     }
9203   return NULL_TREE;
9204 }
9205
9206 /* Fold a call to built-in function FNDECL.  ARGS is an array of NARGS
9207    arguments.  IGNORE is true if the result of the
9208    function call is ignored.  This function returns NULL_TREE if no
9209    simplification was possible.  */
9210
9211 tree
9212 fold_builtin_n (location_t loc, tree fndecl, tree *args, int nargs, bool)
9213 {
9214   tree ret = NULL_TREE;
9215
9216   switch (nargs)
9217     {
9218     case 0:
9219       ret = fold_builtin_0 (loc, fndecl);
9220       break;
9221     case 1:
9222       ret = fold_builtin_1 (loc, fndecl, args[0]);
9223       break;
9224     case 2:
9225       ret = fold_builtin_2 (loc, fndecl, args[0], args[1]);
9226       break;
9227     case 3:
9228       ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2]);
9229       break;
9230     default:
9231       ret = fold_builtin_varargs (loc, fndecl, args, nargs);
9232       break;
9233     }
9234   if (ret)
9235     {
9236       ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
9237       SET_EXPR_LOCATION (ret, loc);
9238       TREE_NO_WARNING (ret) = 1;
9239       return ret;
9240     }
9241   return NULL_TREE;
9242 }
9243
9244 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9245    list ARGS along with N new arguments in NEWARGS.  SKIP is the number
9246    of arguments in ARGS to be omitted.  OLDNARGS is the number of
9247    elements in ARGS.  */
9248
9249 static tree
9250 rewrite_call_expr_valist (location_t loc, int oldnargs, tree *args,
9251                           int skip, tree fndecl, int n, va_list newargs)
9252 {
9253   int nargs = oldnargs - skip + n;
9254   tree *buffer;
9255
9256   if (n > 0)
9257     {
9258       int i, j;
9259
9260       buffer = XALLOCAVEC (tree, nargs);
9261       for (i = 0; i < n; i++)
9262         buffer[i] = va_arg (newargs, tree);
9263       for (j = skip; j < oldnargs; j++, i++)
9264         buffer[i] = args[j];
9265     }
9266   else
9267     buffer = args + skip;
9268
9269   return build_call_expr_loc_array (loc, fndecl, nargs, buffer);
9270 }
9271
9272 /* Return true if FNDECL shouldn't be folded right now.
9273    If a built-in function has an inline attribute always_inline
9274    wrapper, defer folding it after always_inline functions have
9275    been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9276    might not be performed.  */
9277
9278 bool
9279 avoid_folding_inline_builtin (tree fndecl)
9280 {
9281   return (DECL_DECLARED_INLINE_P (fndecl)
9282           && DECL_DISREGARD_INLINE_LIMITS (fndecl)
9283           && cfun
9284           && !cfun->always_inline_functions_inlined
9285           && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
9286 }
9287
9288 /* A wrapper function for builtin folding that prevents warnings for
9289    "statement without effect" and the like, caused by removing the
9290    call node earlier than the warning is generated.  */
9291
9292 tree
9293 fold_call_expr (location_t loc, tree exp, bool ignore)
9294 {
9295   tree ret = NULL_TREE;
9296   tree fndecl = get_callee_fndecl (exp);
9297   if (fndecl
9298       && TREE_CODE (fndecl) == FUNCTION_DECL
9299       && DECL_BUILT_IN (fndecl)
9300       /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9301          yet.  Defer folding until we see all the arguments
9302          (after inlining).  */
9303       && !CALL_EXPR_VA_ARG_PACK (exp))
9304     {
9305       int nargs = call_expr_nargs (exp);
9306
9307       /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9308          instead last argument is __builtin_va_arg_pack ().  Defer folding
9309          even in that case, until arguments are finalized.  */
9310       if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
9311         {
9312           tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
9313           if (fndecl2
9314               && TREE_CODE (fndecl2) == FUNCTION_DECL
9315               && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
9316               && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
9317             return NULL_TREE;
9318         }
9319
9320       if (avoid_folding_inline_builtin (fndecl))
9321         return NULL_TREE;
9322
9323       if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
9324         return targetm.fold_builtin (fndecl, call_expr_nargs (exp),
9325                                      CALL_EXPR_ARGP (exp), ignore);
9326       else
9327         {
9328           tree *args = CALL_EXPR_ARGP (exp);
9329           ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
9330           if (ret)
9331             return ret;
9332         }
9333     }
9334   return NULL_TREE;
9335 }
9336
9337 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9338    N arguments are passed in the array ARGARRAY.  Return a folded
9339    expression or NULL_TREE if no simplification was possible.  */
9340
9341 tree
9342 fold_builtin_call_array (location_t loc, tree,
9343                          tree fn,
9344                          int n,
9345                          tree *argarray)
9346 {
9347   if (TREE_CODE (fn) != ADDR_EXPR)
9348     return NULL_TREE;
9349
9350   tree fndecl = TREE_OPERAND (fn, 0);
9351   if (TREE_CODE (fndecl) == FUNCTION_DECL
9352       && DECL_BUILT_IN (fndecl))
9353     {
9354       /* If last argument is __builtin_va_arg_pack (), arguments to this
9355          function are not finalized yet.  Defer folding until they are.  */
9356       if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
9357         {
9358           tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
9359           if (fndecl2
9360               && TREE_CODE (fndecl2) == FUNCTION_DECL
9361               && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL
9362               && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK)
9363             return NULL_TREE;
9364         }
9365       if (avoid_folding_inline_builtin (fndecl))
9366         return NULL_TREE;
9367       if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
9368         return targetm.fold_builtin (fndecl, n, argarray, false);
9369       else
9370         return fold_builtin_n (loc, fndecl, argarray, n, false);
9371     }
9372
9373   return NULL_TREE;
9374 }
9375
9376 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9377    along with N new arguments specified as the "..." parameters.  SKIP
9378    is the number of arguments in EXP to be omitted.  This function is used
9379    to do varargs-to-varargs transformations.  */
9380
9381 static tree
9382 rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
9383 {
9384   va_list ap;
9385   tree t;
9386
9387   va_start (ap, n);
9388   t = rewrite_call_expr_valist (loc, call_expr_nargs (exp),
9389                                 CALL_EXPR_ARGP (exp), skip, fndecl, n, ap);
9390   va_end (ap);
9391
9392   return t;
9393 }
9394
9395 /* Validate a single argument ARG against a tree code CODE representing
9396    a type.  Return true when argument is valid.  */
9397
9398 static bool
9399 validate_arg (const_tree arg, enum tree_code code)
9400 {
9401   if (!arg)
9402     return false;
9403   else if (code == POINTER_TYPE)
9404     return POINTER_TYPE_P (TREE_TYPE (arg));
9405   else if (code == INTEGER_TYPE)
9406     return INTEGRAL_TYPE_P (TREE_TYPE (arg));
9407   return code == TREE_CODE (TREE_TYPE (arg));
9408 }
9409
9410 /* This function validates the types of a function call argument list
9411    against a specified list of tree_codes.  If the last specifier is a 0,
9412    that represents an ellipses, otherwise the last specifier must be a
9413    VOID_TYPE.
9414
9415    This is the GIMPLE version of validate_arglist.  Eventually we want to
9416    completely convert builtins.c to work from GIMPLEs and the tree based
9417    validate_arglist will then be removed.  */
9418
9419 bool
9420 validate_gimple_arglist (const gcall *call, ...)
9421 {
9422   enum tree_code code;
9423   bool res = 0;
9424   va_list ap;
9425   const_tree arg;
9426   size_t i;
9427
9428   va_start (ap, call);
9429   i = 0;
9430
9431   do
9432     {
9433       code = (enum tree_code) va_arg (ap, int);
9434       switch (code)
9435         {
9436         case 0:
9437           /* This signifies an ellipses, any further arguments are all ok.  */
9438           res = true;
9439           goto end;
9440         case VOID_TYPE:
9441           /* This signifies an endlink, if no arguments remain, return
9442              true, otherwise return false.  */
9443           res = (i == gimple_call_num_args (call));
9444           goto end;
9445         default:
9446           /* If no parameters remain or the parameter's code does not
9447              match the specified code, return false.  Otherwise continue
9448              checking any remaining arguments.  */
9449           arg = gimple_call_arg (call, i++);
9450           if (!validate_arg (arg, code))
9451             goto end;
9452           break;
9453         }
9454     }
9455   while (1);
9456
9457   /* We need gotos here since we can only have one VA_CLOSE in a
9458      function.  */
9459  end: ;
9460   va_end (ap);
9461
9462   return res;
9463 }
9464
9465 /* Default target-specific builtin expander that does nothing.  */
9466
9467 rtx
9468 default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
9469                         rtx target ATTRIBUTE_UNUSED,
9470                         rtx subtarget ATTRIBUTE_UNUSED,
9471                         machine_mode mode ATTRIBUTE_UNUSED,
9472                         int ignore ATTRIBUTE_UNUSED)
9473 {
9474   return NULL_RTX;
9475 }
9476
9477 /* Returns true is EXP represents data that would potentially reside
9478    in a readonly section.  */
9479
9480 bool
9481 readonly_data_expr (tree exp)
9482 {
9483   STRIP_NOPS (exp);
9484
9485   if (TREE_CODE (exp) != ADDR_EXPR)
9486     return false;
9487
9488   exp = get_base_address (TREE_OPERAND (exp, 0));
9489   if (!exp)
9490     return false;
9491
9492   /* Make sure we call decl_readonly_section only for trees it
9493      can handle (since it returns true for everything it doesn't
9494      understand).  */
9495   if (TREE_CODE (exp) == STRING_CST
9496       || TREE_CODE (exp) == CONSTRUCTOR
9497       || (VAR_P (exp) && TREE_STATIC (exp)))
9498     return decl_readonly_section (exp, 0);
9499   else
9500     return false;
9501 }
9502
9503 /* Simplify a call to the strpbrk builtin.  S1 and S2 are the arguments
9504    to the call, and TYPE is its return type.
9505
9506    Return NULL_TREE if no simplification was possible, otherwise return the
9507    simplified form of the call as a tree.
9508
9509    The simplified form may be a constant or other expression which
9510    computes the same value, but in a more efficient manner (including
9511    calls to other builtin functions).
9512
9513    The call may contain arguments which need to be evaluated, but
9514    which are not useful to determine the result of the call.  In
9515    this case we return a chain of COMPOUND_EXPRs.  The LHS of each
9516    COMPOUND_EXPR will be an argument which must be evaluated.
9517    COMPOUND_EXPRs are chained through their RHS.  The RHS of the last
9518    COMPOUND_EXPR in the chain will contain the tree for the simplified
9519    form of the builtin function call.  */
9520
9521 static tree
9522 fold_builtin_strpbrk (location_t loc, tree s1, tree s2, tree type)
9523 {
9524   if (!validate_arg (s1, POINTER_TYPE)
9525       || !validate_arg (s2, POINTER_TYPE))
9526     return NULL_TREE;
9527   else
9528     {
9529       tree fn;
9530       const char *p1, *p2;
9531
9532       p2 = c_getstr (s2);
9533       if (p2 == NULL)
9534         return NULL_TREE;
9535
9536       p1 = c_getstr (s1);
9537       if (p1 != NULL)
9538         {
9539           const char *r = strpbrk (p1, p2);
9540           tree tem;
9541
9542           if (r == NULL)
9543             return build_int_cst (TREE_TYPE (s1), 0);
9544
9545           /* Return an offset into the constant string argument.  */
9546           tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
9547           return fold_convert_loc (loc, type, tem);
9548         }
9549
9550       if (p2[0] == '\0')
9551         /* strpbrk(x, "") == NULL.
9552            Evaluate and ignore s1 in case it had side-effects.  */
9553         return omit_one_operand_loc (loc, TREE_TYPE (s1), integer_zero_node, s1);
9554
9555       if (p2[1] != '\0')
9556         return NULL_TREE;  /* Really call strpbrk.  */
9557
9558       fn = builtin_decl_implicit (BUILT_IN_STRCHR);
9559       if (!fn)
9560         return NULL_TREE;
9561
9562       /* New argument list transforming strpbrk(s1, s2) to
9563          strchr(s1, s2[0]).  */
9564       return build_call_expr_loc (loc, fn, 2, s1,
9565                                   build_int_cst (integer_type_node, p2[0]));
9566     }
9567 }
9568
9569 /* Simplify a call to the strspn builtin.  S1 and S2 are the arguments
9570    to the call.
9571
9572    Return NULL_TREE if no simplification was possible, otherwise return the
9573    simplified form of the call as a tree.
9574
9575    The simplified form may be a constant or other expression which
9576    computes the same value, but in a more efficient manner (including
9577    calls to other builtin functions).
9578
9579    The call may contain arguments which need to be evaluated, but
9580    which are not useful to determine the result of the call.  In
9581    this case we return a chain of COMPOUND_EXPRs.  The LHS of each
9582    COMPOUND_EXPR will be an argument which must be evaluated.
9583    COMPOUND_EXPRs are chained through their RHS.  The RHS of the last
9584    COMPOUND_EXPR in the chain will contain the tree for the simplified
9585    form of the builtin function call.  */
9586
9587 static tree
9588 fold_builtin_strspn (location_t loc, tree s1, tree s2)
9589 {
9590   if (!validate_arg (s1, POINTER_TYPE)
9591       || !validate_arg (s2, POINTER_TYPE))
9592     return NULL_TREE;
9593   else
9594     {
9595       const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
9596
9597       /* If either argument is "", return NULL_TREE.  */
9598       if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
9599         /* Evaluate and ignore both arguments in case either one has
9600            side-effects.  */
9601         return omit_two_operands_loc (loc, size_type_node, size_zero_node,
9602                                   s1, s2);
9603       return NULL_TREE;
9604     }
9605 }
9606
9607 /* Simplify a call to the strcspn builtin.  S1 and S2 are the arguments
9608    to the call.
9609
9610    Return NULL_TREE if no simplification was possible, otherwise return the
9611    simplified form of the call as a tree.
9612
9613    The simplified form may be a constant or other expression which
9614    computes the same value, but in a more efficient manner (including
9615    calls to other builtin functions).
9616
9617    The call may contain arguments which need to be evaluated, but
9618    which are not useful to determine the result of the call.  In
9619    this case we return a chain of COMPOUND_EXPRs.  The LHS of each
9620    COMPOUND_EXPR will be an argument which must be evaluated.
9621    COMPOUND_EXPRs are chained through their RHS.  The RHS of the last
9622    COMPOUND_EXPR in the chain will contain the tree for the simplified
9623    form of the builtin function call.  */
9624
9625 static tree
9626 fold_builtin_strcspn (location_t loc, tree s1, tree s2)
9627 {
9628   if (!validate_arg (s1, POINTER_TYPE)
9629       || !validate_arg (s2, POINTER_TYPE))
9630     return NULL_TREE;
9631   else
9632     {
9633       /* If the first argument is "", return NULL_TREE.  */
9634       const char *p1 = c_getstr (s1);
9635       if (p1 && *p1 == '\0')
9636         {
9637           /* Evaluate and ignore argument s2 in case it has
9638              side-effects.  */
9639           return omit_one_operand_loc (loc, size_type_node,
9640                                    size_zero_node, s2);
9641         }
9642
9643       /* If the second argument is "", return __builtin_strlen(s1).  */
9644       const char *p2 = c_getstr (s2);
9645       if (p2 && *p2 == '\0')
9646         {
9647           tree fn = builtin_decl_implicit (BUILT_IN_STRLEN);
9648
9649           /* If the replacement _DECL isn't initialized, don't do the
9650              transformation.  */
9651           if (!fn)
9652             return NULL_TREE;
9653
9654           return build_call_expr_loc (loc, fn, 1, s1);
9655         }
9656       return NULL_TREE;
9657     }
9658 }
9659
9660 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9661    produced.  False otherwise.  This is done so that we don't output the error
9662    or warning twice or three times.  */
9663
9664 bool
9665 fold_builtin_next_arg (tree exp, bool va_start_p)
9666 {
9667   tree fntype = TREE_TYPE (current_function_decl);
9668   int nargs = call_expr_nargs (exp);
9669   tree arg;
9670   /* There is good chance the current input_location points inside the
9671      definition of the va_start macro (perhaps on the token for
9672      builtin) in a system header, so warnings will not be emitted.
9673      Use the location in real source code.  */
9674   source_location current_location =
9675     linemap_unwind_to_first_non_reserved_loc (line_table, input_location,
9676                                               NULL);
9677
9678   if (!stdarg_p (fntype))
9679     {
9680       error ("%<va_start%> used in function with fixed args");
9681       return true;
9682     }
9683
9684   if (va_start_p)
9685     {
9686       if (va_start_p && (nargs != 2))
9687         {
9688           error ("wrong number of arguments to function %<va_start%>");
9689           return true;
9690         }
9691       arg = CALL_EXPR_ARG (exp, 1);
9692     }
9693   /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9694      when we checked the arguments and if needed issued a warning.  */
9695   else
9696     {
9697       if (nargs == 0)
9698         {
9699           /* Evidently an out of date version of <stdarg.h>; can't validate
9700              va_start's second argument, but can still work as intended.  */
9701           warning_at (current_location,
9702                       OPT_Wvarargs,
9703                    "%<__builtin_next_arg%> called without an argument");
9704           return true;
9705         }
9706       else if (nargs > 1)
9707         {
9708           error ("wrong number of arguments to function %<__builtin_next_arg%>");
9709           return true;
9710         }
9711       arg = CALL_EXPR_ARG (exp, 0);
9712     }
9713
9714   if (TREE_CODE (arg) == SSA_NAME)
9715     arg = SSA_NAME_VAR (arg);
9716
9717   /* We destructively modify the call to be __builtin_va_start (ap, 0)
9718      or __builtin_next_arg (0) the first time we see it, after checking
9719      the arguments and if needed issuing a warning.  */
9720   if (!integer_zerop (arg))
9721     {
9722       tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
9723
9724       /* Strip off all nops for the sake of the comparison.  This
9725          is not quite the same as STRIP_NOPS.  It does more.
9726          We must also strip off INDIRECT_EXPR for C++ reference
9727          parameters.  */
9728       while (CONVERT_EXPR_P (arg)
9729              || TREE_CODE (arg) == INDIRECT_REF)
9730         arg = TREE_OPERAND (arg, 0);
9731       if (arg != last_parm)
9732         {
9733           /* FIXME: Sometimes with the tree optimizers we can get the
9734              not the last argument even though the user used the last
9735              argument.  We just warn and set the arg to be the last
9736              argument so that we will get wrong-code because of
9737              it.  */
9738           warning_at (current_location,
9739                       OPT_Wvarargs,
9740                       "second parameter of %<va_start%> not last named argument");
9741         }
9742
9743       /* Undefined by C99 7.15.1.4p4 (va_start):
9744          "If the parameter parmN is declared with the register storage
9745          class, with a function or array type, or with a type that is
9746          not compatible with the type that results after application of
9747          the default argument promotions, the behavior is undefined."
9748       */
9749       else if (DECL_REGISTER (arg))
9750         {
9751           warning_at (current_location,
9752                       OPT_Wvarargs,
9753                       "undefined behavior when second parameter of "
9754                       "%<va_start%> is declared with %<register%> storage");
9755         }
9756
9757       /* We want to verify the second parameter just once before the tree
9758          optimizers are run and then avoid keeping it in the tree,
9759          as otherwise we could warn even for correct code like:
9760          void foo (int i, ...)
9761          { va_list ap; i++; va_start (ap, i); va_end (ap); }  */
9762       if (va_start_p)
9763         CALL_EXPR_ARG (exp, 1) = integer_zero_node;
9764       else
9765         CALL_EXPR_ARG (exp, 0) = integer_zero_node;
9766     }
9767   return false;
9768 }
9769
9770
9771 /* Expand a call EXP to __builtin_object_size.  */
9772
9773 static rtx
9774 expand_builtin_object_size (tree exp)
9775 {
9776   tree ost;
9777   int object_size_type;
9778   tree fndecl = get_callee_fndecl (exp);
9779
9780   if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
9781     {
9782       error ("%Kfirst argument of %qD must be a pointer, second integer constant",
9783              exp, fndecl);
9784       expand_builtin_trap ();
9785       return const0_rtx;
9786     }
9787
9788   ost = CALL_EXPR_ARG (exp, 1);
9789   STRIP_NOPS (ost);
9790
9791   if (TREE_CODE (ost) != INTEGER_CST
9792       || tree_int_cst_sgn (ost) < 0
9793       || compare_tree_int (ost, 3) > 0)
9794     {
9795       error ("%Klast argument of %qD is not integer constant between 0 and 3",
9796              exp, fndecl);
9797       expand_builtin_trap ();
9798       return const0_rtx;
9799     }
9800
9801   object_size_type = tree_to_shwi (ost);
9802
9803   return object_size_type < 2 ? constm1_rtx : const0_rtx;
9804 }
9805
9806 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9807    FCODE is the BUILT_IN_* to use.
9808    Return NULL_RTX if we failed; the caller should emit a normal call,
9809    otherwise try to get the result in TARGET, if convenient (and in
9810    mode MODE if that's convenient).  */
9811
9812 static rtx
9813 expand_builtin_memory_chk (tree exp, rtx target, machine_mode mode,
9814                            enum built_in_function fcode)
9815 {
9816   if (!validate_arglist (exp,
9817                          POINTER_TYPE,
9818                          fcode == BUILT_IN_MEMSET_CHK
9819                          ? INTEGER_TYPE : POINTER_TYPE,
9820                          INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
9821     return NULL_RTX;
9822
9823   tree dest = CALL_EXPR_ARG (exp, 0);
9824   tree src = CALL_EXPR_ARG (exp, 1);
9825   tree len = CALL_EXPR_ARG (exp, 2);
9826   tree size = CALL_EXPR_ARG (exp, 3);
9827
9828   bool sizes_ok = check_access (exp, dest, src, len, /*maxread=*/NULL_TREE,
9829                                 /*str=*/NULL_TREE, size);
9830
9831   if (!tree_fits_uhwi_p (size))
9832     return NULL_RTX;
9833
9834   if (tree_fits_uhwi_p (len) || integer_all_onesp (size))
9835     {
9836       /* Avoid transforming the checking call to an ordinary one when
9837          an overflow has been detected or when the call couldn't be
9838          validated because the size is not constant.  */
9839       if (!sizes_ok && !integer_all_onesp (size) && tree_int_cst_lt (size, len))
9840         return NULL_RTX;
9841
9842       tree fn = NULL_TREE;
9843       /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9844          mem{cpy,pcpy,move,set} is available.  */
9845       switch (fcode)
9846         {
9847         case BUILT_IN_MEMCPY_CHK:
9848           fn = builtin_decl_explicit (BUILT_IN_MEMCPY);
9849           break;
9850         case BUILT_IN_MEMPCPY_CHK:
9851           fn = builtin_decl_explicit (BUILT_IN_MEMPCPY);
9852           break;
9853         case BUILT_IN_MEMMOVE_CHK:
9854           fn = builtin_decl_explicit (BUILT_IN_MEMMOVE);
9855           break;
9856         case BUILT_IN_MEMSET_CHK:
9857           fn = builtin_decl_explicit (BUILT_IN_MEMSET);
9858           break;
9859         default:
9860           break;
9861         }
9862
9863       if (! fn)
9864         return NULL_RTX;
9865
9866       fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 3, dest, src, len);
9867       gcc_assert (TREE_CODE (fn) == CALL_EXPR);
9868       CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
9869       return expand_expr (fn, target, mode, EXPAND_NORMAL);
9870     }
9871   else if (fcode == BUILT_IN_MEMSET_CHK)
9872     return NULL_RTX;
9873   else
9874     {
9875       unsigned int dest_align = get_pointer_alignment (dest);
9876
9877       /* If DEST is not a pointer type, call the normal function.  */
9878       if (dest_align == 0)
9879         return NULL_RTX;
9880
9881       /* If SRC and DEST are the same (and not volatile), do nothing.  */
9882       if (operand_equal_p (src, dest, 0))
9883         {
9884           tree expr;
9885
9886           if (fcode != BUILT_IN_MEMPCPY_CHK)
9887             {
9888               /* Evaluate and ignore LEN in case it has side-effects.  */
9889               expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
9890               return expand_expr (dest, target, mode, EXPAND_NORMAL);
9891             }
9892
9893           expr = fold_build_pointer_plus (dest, len);
9894           return expand_expr (expr, target, mode, EXPAND_NORMAL);
9895         }
9896
9897       /* __memmove_chk special case.  */
9898       if (fcode == BUILT_IN_MEMMOVE_CHK)
9899         {
9900           unsigned int src_align = get_pointer_alignment (src);
9901
9902           if (src_align == 0)
9903             return NULL_RTX;
9904
9905           /* If src is categorized for a readonly section we can use
9906              normal __memcpy_chk.  */
9907           if (readonly_data_expr (src))
9908             {
9909               tree fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
9910               if (!fn)
9911                 return NULL_RTX;
9912               fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 4,
9913                                           dest, src, len, size);
9914               gcc_assert (TREE_CODE (fn) == CALL_EXPR);
9915               CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
9916               return expand_expr (fn, target, mode, EXPAND_NORMAL);
9917             }
9918         }
9919       return NULL_RTX;
9920     }
9921 }
9922
9923 /* Emit warning if a buffer overflow is detected at compile time.  */
9924
9925 static void
9926 maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
9927 {
9928   /* The source string.  */
9929   tree srcstr = NULL_TREE;
9930   /* The size of the destination object.  */
9931   tree objsize = NULL_TREE;
9932   /* The string that is being concatenated with (as in __strcat_chk)
9933      or null if it isn't.  */
9934   tree catstr = NULL_TREE;
9935   /* The maximum length of the source sequence in a bounded operation
9936      (such as __strncat_chk) or null if the operation isn't bounded
9937      (such as __strcat_chk).  */
9938   tree maxread = NULL_TREE;
9939   /* The exact size of the access (such as in __strncpy_chk).  */
9940   tree size = NULL_TREE;
9941
9942   switch (fcode)
9943     {
9944     case BUILT_IN_STRCPY_CHK:
9945     case BUILT_IN_STPCPY_CHK:
9946       srcstr = CALL_EXPR_ARG (exp, 1);
9947       objsize = CALL_EXPR_ARG (exp, 2);
9948       break;
9949
9950     case BUILT_IN_STRCAT_CHK:
9951       /* For __strcat_chk the warning will be emitted only if overflowing
9952          by at least strlen (dest) + 1 bytes.  */
9953       catstr = CALL_EXPR_ARG (exp, 0);
9954       srcstr = CALL_EXPR_ARG (exp, 1);
9955       objsize = CALL_EXPR_ARG (exp, 2);
9956       break;
9957
9958     case BUILT_IN_STRNCAT_CHK:
9959       catstr = CALL_EXPR_ARG (exp, 0);
9960       srcstr = CALL_EXPR_ARG (exp, 1);
9961       maxread = CALL_EXPR_ARG (exp, 2);
9962       objsize = CALL_EXPR_ARG (exp, 3);
9963       break;
9964
9965     case BUILT_IN_STRNCPY_CHK:
9966     case BUILT_IN_STPNCPY_CHK:
9967       srcstr = CALL_EXPR_ARG (exp, 1);
9968       size = CALL_EXPR_ARG (exp, 2);
9969       objsize = CALL_EXPR_ARG (exp, 3);
9970       break;
9971
9972     case BUILT_IN_SNPRINTF_CHK:
9973     case BUILT_IN_VSNPRINTF_CHK:
9974       maxread = CALL_EXPR_ARG (exp, 1);
9975       objsize = CALL_EXPR_ARG (exp, 3);
9976       break;
9977     default:
9978       gcc_unreachable ();
9979     }
9980
9981   if (catstr && maxread)
9982     {
9983       /* Check __strncat_chk.  There is no way to determine the length
9984          of the string to which the source string is being appended so
9985          just warn when the length of the source string is not known.  */
9986       check_strncat_sizes (exp, objsize);
9987       return;
9988     }
9989
9990   /* The destination argument is the first one for all built-ins above.  */
9991   tree dst = CALL_EXPR_ARG (exp, 0);
9992
9993   check_access (exp, dst, srcstr, size, maxread, srcstr, objsize);
9994 }
9995
9996 /* Emit warning if a buffer overflow is detected at compile time
9997    in __sprintf_chk/__vsprintf_chk calls.  */
9998
9999 static void
10000 maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
10001 {
10002   tree size, len, fmt;
10003   const char *fmt_str;
10004   int nargs = call_expr_nargs (exp);
10005
10006   /* Verify the required arguments in the original call.  */
10007
10008   if (nargs < 4)
10009     return;
10010   size = CALL_EXPR_ARG (exp, 2);
10011   fmt = CALL_EXPR_ARG (exp, 3);
10012
10013   if (! tree_fits_uhwi_p (size) || integer_all_onesp (size))
10014     return;
10015
10016   /* Check whether the format is a literal string constant.  */
10017   fmt_str = c_getstr (fmt);
10018   if (fmt_str == NULL)
10019     return;
10020
10021   if (!init_target_chars ())
10022     return;
10023
10024   /* If the format doesn't contain % args or %%, we know its size.  */
10025   if (strchr (fmt_str, target_percent) == 0)
10026     len = build_int_cstu (size_type_node, strlen (fmt_str));
10027   /* If the format is "%s" and first ... argument is a string literal,
10028      we know it too.  */
10029   else if (fcode == BUILT_IN_SPRINTF_CHK
10030            && strcmp (fmt_str, target_percent_s) == 0)
10031     {
10032       tree arg;
10033
10034       if (nargs < 5)
10035         return;
10036       arg = CALL_EXPR_ARG (exp, 4);
10037       if (! POINTER_TYPE_P (TREE_TYPE (arg)))
10038         return;
10039
10040       len = c_strlen (arg, 1);
10041       if (!len || ! tree_fits_uhwi_p (len))
10042         return;
10043     }
10044   else
10045     return;
10046
10047   /* Add one for the terminating nul.  */
10048   len = fold_build2 (PLUS_EXPR, TREE_TYPE (len), len, size_one_node);
10049
10050   check_access (exp, /*dst=*/NULL_TREE, /*src=*/NULL_TREE, /*size=*/NULL_TREE,
10051                 /*maxread=*/NULL_TREE, len, size);
10052 }
10053
10054 /* Emit warning if a free is called with address of a variable.  */
10055
10056 static void
10057 maybe_emit_free_warning (tree exp)
10058 {
10059   tree arg = CALL_EXPR_ARG (exp, 0);
10060
10061   STRIP_NOPS (arg);
10062   if (TREE_CODE (arg) != ADDR_EXPR)
10063     return;
10064
10065   arg = get_base_address (TREE_OPERAND (arg, 0));
10066   if (arg == NULL || INDIRECT_REF_P (arg) || TREE_CODE (arg) == MEM_REF)
10067     return;
10068
10069   if (SSA_VAR_P (arg))
10070     warning_at (tree_nonartificial_location (exp), OPT_Wfree_nonheap_object,
10071                 "%Kattempt to free a non-heap object %qD", exp, arg);
10072   else
10073     warning_at (tree_nonartificial_location (exp), OPT_Wfree_nonheap_object,
10074                 "%Kattempt to free a non-heap object", exp);
10075 }
10076
10077 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10078    if possible.  */
10079
10080 static tree
10081 fold_builtin_object_size (tree ptr, tree ost)
10082 {
10083   unsigned HOST_WIDE_INT bytes;
10084   int object_size_type;
10085
10086   if (!validate_arg (ptr, POINTER_TYPE)
10087       || !validate_arg (ost, INTEGER_TYPE))
10088     return NULL_TREE;
10089
10090   STRIP_NOPS (ost);
10091
10092   if (TREE_CODE (ost) != INTEGER_CST
10093       || tree_int_cst_sgn (ost) < 0
10094       || compare_tree_int (ost, 3) > 0)
10095     return NULL_TREE;
10096
10097   object_size_type = tree_to_shwi (ost);
10098
10099   /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10100      if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10101      and (size_t) 0 for types 2 and 3.  */
10102   if (TREE_SIDE_EFFECTS (ptr))
10103     return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
10104
10105   if (TREE_CODE (ptr) == ADDR_EXPR)
10106     {
10107       compute_builtin_object_size (ptr, object_size_type, &bytes);
10108       if (wi::fits_to_tree_p (bytes, size_type_node))
10109         return build_int_cstu (size_type_node, bytes);
10110     }
10111   else if (TREE_CODE (ptr) == SSA_NAME)
10112     {
10113       /* If object size is not known yet, delay folding until
10114        later.  Maybe subsequent passes will help determining
10115        it.  */
10116       if (compute_builtin_object_size (ptr, object_size_type, &bytes)
10117           && wi::fits_to_tree_p (bytes, size_type_node))
10118         return build_int_cstu (size_type_node, bytes);
10119     }
10120
10121   return NULL_TREE;
10122 }
10123
10124 /* Builtins with folding operations that operate on "..." arguments
10125    need special handling; we need to store the arguments in a convenient
10126    data structure before attempting any folding.  Fortunately there are
10127    only a few builtins that fall into this category.  FNDECL is the
10128    function, EXP is the CALL_EXPR for the call.  */
10129
10130 static tree
10131 fold_builtin_varargs (location_t loc, tree fndecl, tree *args, int nargs)
10132 {
10133   enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10134   tree ret = NULL_TREE;
10135
10136   switch (fcode)
10137     {
10138     case BUILT_IN_FPCLASSIFY:
10139       ret = fold_builtin_fpclassify (loc, args, nargs);
10140       break;
10141
10142     default:
10143       break;
10144     }
10145   if (ret)
10146     {
10147       ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10148       SET_EXPR_LOCATION (ret, loc);
10149       TREE_NO_WARNING (ret) = 1;
10150       return ret;
10151     }
10152   return NULL_TREE;
10153 }
10154
10155 /* Initialize format string characters in the target charset.  */
10156
10157 bool
10158 init_target_chars (void)
10159 {
10160   static bool init;
10161   if (!init)
10162     {
10163       target_newline = lang_hooks.to_target_charset ('\n');
10164       target_percent = lang_hooks.to_target_charset ('%');
10165       target_c = lang_hooks.to_target_charset ('c');
10166       target_s = lang_hooks.to_target_charset ('s');
10167       if (target_newline == 0 || target_percent == 0 || target_c == 0
10168           || target_s == 0)
10169         return false;
10170
10171       target_percent_c[0] = target_percent;
10172       target_percent_c[1] = target_c;
10173       target_percent_c[2] = '\0';
10174
10175       target_percent_s[0] = target_percent;
10176       target_percent_s[1] = target_s;
10177       target_percent_s[2] = '\0';
10178
10179       target_percent_s_newline[0] = target_percent;
10180       target_percent_s_newline[1] = target_s;
10181       target_percent_s_newline[2] = target_newline;
10182       target_percent_s_newline[3] = '\0';
10183
10184       init = true;
10185     }
10186   return true;
10187 }
10188
10189 /* Helper function for do_mpfr_arg*().  Ensure M is a normal number
10190    and no overflow/underflow occurred.  INEXACT is true if M was not
10191    exactly calculated.  TYPE is the tree type for the result.  This
10192    function assumes that you cleared the MPFR flags and then
10193    calculated M to see if anything subsequently set a flag prior to
10194    entering this function.  Return NULL_TREE if any checks fail.  */
10195
10196 static tree
10197 do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
10198 {
10199   /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10200      overflow/underflow occurred.  If -frounding-math, proceed iff the
10201      result of calling FUNC was exact.  */
10202   if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
10203       && (!flag_rounding_math || !inexact))
10204     {
10205       REAL_VALUE_TYPE rr;
10206
10207       real_from_mpfr (&rr, m, type, GMP_RNDN);
10208       /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10209          check for overflow/underflow.  If the REAL_VALUE_TYPE is zero
10210          but the mpft_t is not, then we underflowed in the
10211          conversion.  */
10212       if (real_isfinite (&rr)
10213           && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
10214         {
10215           REAL_VALUE_TYPE rmode;
10216
10217           real_convert (&rmode, TYPE_MODE (type), &rr);
10218           /* Proceed iff the specified mode can hold the value.  */
10219           if (real_identical (&rmode, &rr))
10220             return build_real (type, rmode);
10221         }
10222     }
10223   return NULL_TREE;
10224 }
10225
10226 /* Helper function for do_mpc_arg*().  Ensure M is a normal complex
10227    number and no overflow/underflow occurred.  INEXACT is true if M
10228    was not exactly calculated.  TYPE is the tree type for the result.
10229    This function assumes that you cleared the MPFR flags and then
10230    calculated M to see if anything subsequently set a flag prior to
10231    entering this function.  Return NULL_TREE if any checks fail, if
10232    FORCE_CONVERT is true, then bypass the checks.  */
10233
10234 static tree
10235 do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
10236 {
10237   /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10238      overflow/underflow occurred.  If -frounding-math, proceed iff the
10239      result of calling FUNC was exact.  */
10240   if (force_convert
10241       || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
10242           && !mpfr_overflow_p () && !mpfr_underflow_p ()
10243           && (!flag_rounding_math || !inexact)))
10244     {
10245       REAL_VALUE_TYPE re, im;
10246
10247       real_from_mpfr (&re, mpc_realref (m), TREE_TYPE (type), GMP_RNDN);
10248       real_from_mpfr (&im, mpc_imagref (m), TREE_TYPE (type), GMP_RNDN);
10249       /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10250          check for overflow/underflow.  If the REAL_VALUE_TYPE is zero
10251          but the mpft_t is not, then we underflowed in the
10252          conversion.  */
10253       if (force_convert
10254           || (real_isfinite (&re) && real_isfinite (&im)
10255               && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
10256               && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
10257         {
10258           REAL_VALUE_TYPE re_mode, im_mode;
10259
10260           real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
10261           real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
10262           /* Proceed iff the specified mode can hold the value.  */
10263           if (force_convert
10264               || (real_identical (&re_mode, &re)
10265                   && real_identical (&im_mode, &im)))
10266             return build_complex (type, build_real (TREE_TYPE (type), re_mode),
10267                                   build_real (TREE_TYPE (type), im_mode));
10268         }
10269     }
10270   return NULL_TREE;
10271 }
10272
10273 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10274    the pointer *(ARG_QUO) and return the result.  The type is taken
10275    from the type of ARG0 and is used for setting the precision of the
10276    calculation and results.  */
10277
10278 static tree
10279 do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
10280 {
10281   tree const type = TREE_TYPE (arg0);
10282   tree result = NULL_TREE;
10283
10284   STRIP_NOPS (arg0);
10285   STRIP_NOPS (arg1);
10286
10287   /* To proceed, MPFR must exactly represent the target floating point
10288      format, which only happens when the target base equals two.  */
10289   if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
10290       && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
10291       && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
10292     {
10293       const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
10294       const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
10295
10296       if (real_isfinite (ra0) && real_isfinite (ra1))
10297         {
10298           const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
10299           const int prec = fmt->p;
10300           const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
10301           tree result_rem;
10302           long integer_quo;
10303           mpfr_t m0, m1;
10304
10305           mpfr_inits2 (prec, m0, m1, NULL);
10306           mpfr_from_real (m0, ra0, GMP_RNDN);
10307           mpfr_from_real (m1, ra1, GMP_RNDN);
10308           mpfr_clear_flags ();
10309           mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
10310           /* Remquo is independent of the rounding mode, so pass
10311              inexact=0 to do_mpfr_ckconv().  */
10312           result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
10313           mpfr_clears (m0, m1, NULL);
10314           if (result_rem)
10315             {
10316               /* MPFR calculates quo in the host's long so it may
10317                  return more bits in quo than the target int can hold
10318                  if sizeof(host long) > sizeof(target int).  This can
10319                  happen even for native compilers in LP64 mode.  In
10320                  these cases, modulo the quo value with the largest
10321                  number that the target int can hold while leaving one
10322                  bit for the sign.  */
10323               if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
10324                 integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
10325
10326               /* Dereference the quo pointer argument.  */
10327               arg_quo = build_fold_indirect_ref (arg_quo);
10328               /* Proceed iff a valid pointer type was passed in.  */
10329               if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
10330                 {
10331                   /* Set the value. */
10332                   tree result_quo
10333                     = fold_build2 (MODIFY_EXPR, TREE_TYPE (arg_quo), arg_quo,
10334                                    build_int_cst (TREE_TYPE (arg_quo),
10335                                                   integer_quo));
10336                   TREE_SIDE_EFFECTS (result_quo) = 1;
10337                   /* Combine the quo assignment with the rem.  */
10338                   result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
10339                                                     result_quo, result_rem));
10340                 }
10341             }
10342         }
10343     }
10344   return result;
10345 }
10346
10347 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10348    resulting value as a tree with type TYPE.  The mpfr precision is
10349    set to the precision of TYPE.  We assume that this mpfr function
10350    returns zero if the result could be calculated exactly within the
10351    requested precision.  In addition, the integer pointer represented
10352    by ARG_SG will be dereferenced and set to the appropriate signgam
10353    (-1,1) value.  */
10354
10355 static tree
10356 do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
10357 {
10358   tree result = NULL_TREE;
10359
10360   STRIP_NOPS (arg);
10361
10362   /* To proceed, MPFR must exactly represent the target floating point
10363      format, which only happens when the target base equals two.  Also
10364      verify ARG is a constant and that ARG_SG is an int pointer.  */
10365   if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
10366       && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
10367       && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
10368       && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
10369     {
10370       const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
10371
10372       /* In addition to NaN and Inf, the argument cannot be zero or a
10373          negative integer.  */
10374       if (real_isfinite (ra)
10375           && ra->cl != rvc_zero
10376           && !(real_isneg (ra) && real_isinteger (ra, TYPE_MODE (type))))
10377         {
10378           const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
10379           const int prec = fmt->p;
10380           const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN;
10381           int inexact, sg;
10382           mpfr_t m;
10383           tree result_lg;
10384
10385           mpfr_init2 (m, prec);
10386           mpfr_from_real (m, ra, GMP_RNDN);
10387           mpfr_clear_flags ();
10388           inexact = mpfr_lgamma (m, &sg, m, rnd);
10389           result_lg = do_mpfr_ckconv (m, type, inexact);
10390           mpfr_clear (m);
10391           if (result_lg)
10392             {
10393               tree result_sg;
10394
10395               /* Dereference the arg_sg pointer argument.  */
10396               arg_sg = build_fold_indirect_ref (arg_sg);
10397               /* Assign the signgam value into *arg_sg. */
10398               result_sg = fold_build2 (MODIFY_EXPR,
10399                                        TREE_TYPE (arg_sg), arg_sg,
10400                                        build_int_cst (TREE_TYPE (arg_sg), sg));
10401               TREE_SIDE_EFFECTS (result_sg) = 1;
10402               /* Combine the signgam assignment with the lgamma result.  */
10403               result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
10404                                                 result_sg, result_lg));
10405             }
10406         }
10407     }
10408
10409   return result;
10410 }
10411
10412 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10413    mpc function FUNC on it and return the resulting value as a tree
10414    with type TYPE.  The mpfr precision is set to the precision of
10415    TYPE.  We assume that function FUNC returns zero if the result
10416    could be calculated exactly within the requested precision.  If
10417    DO_NONFINITE is true, then fold expressions containing Inf or NaN
10418    in the arguments and/or results.  */
10419
10420 tree
10421 do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
10422              int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
10423 {
10424   tree result = NULL_TREE;
10425
10426   STRIP_NOPS (arg0);
10427   STRIP_NOPS (arg1);
10428
10429   /* To proceed, MPFR must exactly represent the target floating point
10430      format, which only happens when the target base equals two.  */
10431   if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
10432       && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE
10433       && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
10434       && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE
10435       && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
10436     {
10437       const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
10438       const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
10439       const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
10440       const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
10441
10442       if (do_nonfinite
10443           || (real_isfinite (re0) && real_isfinite (im0)
10444               && real_isfinite (re1) && real_isfinite (im1)))
10445         {
10446           const struct real_format *const fmt =
10447             REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
10448           const int prec = fmt->p;
10449           const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN;
10450           const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
10451           int inexact;
10452           mpc_t m0, m1;
10453
10454           mpc_init2 (m0, prec);
10455           mpc_init2 (m1, prec);
10456           mpfr_from_real (mpc_realref (m0), re0, rnd);
10457           mpfr_from_real (mpc_imagref (m0), im0, rnd);
10458           mpfr_from_real (mpc_realref (m1), re1, rnd);
10459           mpfr_from_real (mpc_imagref (m1), im1, rnd);
10460           mpfr_clear_flags ();
10461           inexact = func (m0, m0, m1, crnd);
10462           result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
10463           mpc_clear (m0);
10464           mpc_clear (m1);
10465         }
10466     }
10467
10468   return result;
10469 }
10470
10471 /* A wrapper function for builtin folding that prevents warnings for
10472    "statement without effect" and the like, caused by removing the
10473    call node earlier than the warning is generated.  */
10474
10475 tree
10476 fold_call_stmt (gcall *stmt, bool ignore)
10477 {
10478   tree ret = NULL_TREE;
10479   tree fndecl = gimple_call_fndecl (stmt);
10480   location_t loc = gimple_location (stmt);
10481   if (fndecl
10482       && TREE_CODE (fndecl) == FUNCTION_DECL
10483       && DECL_BUILT_IN (fndecl)
10484       && !gimple_call_va_arg_pack_p (stmt))
10485     {
10486       int nargs = gimple_call_num_args (stmt);
10487       tree *args = (nargs > 0
10488                     ? gimple_call_arg_ptr (stmt, 0)
10489                     : &error_mark_node);
10490
10491       if (avoid_folding_inline_builtin (fndecl))
10492         return NULL_TREE;
10493       if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
10494         {
10495           return targetm.fold_builtin (fndecl, nargs, args, ignore);
10496         }
10497       else
10498         {
10499           ret = fold_builtin_n (loc, fndecl, args, nargs, ignore);
10500           if (ret)
10501             {
10502               /* Propagate location information from original call to
10503                  expansion of builtin.  Otherwise things like
10504                  maybe_emit_chk_warning, that operate on the expansion
10505                  of a builtin, will use the wrong location information.  */
10506               if (gimple_has_location (stmt))
10507                 {
10508                   tree realret = ret;
10509                   if (TREE_CODE (ret) == NOP_EXPR)
10510                     realret = TREE_OPERAND (ret, 0);
10511                   if (CAN_HAVE_LOCATION_P (realret)
10512                       && !EXPR_HAS_LOCATION (realret))
10513                     SET_EXPR_LOCATION (realret, loc);
10514                   return realret;
10515                 }
10516               return ret;
10517             }
10518         }
10519     }
10520   return NULL_TREE;
10521 }
10522
10523 /* Look up the function in builtin_decl that corresponds to DECL
10524    and set ASMSPEC as its user assembler name.  DECL must be a
10525    function decl that declares a builtin.  */
10526
10527 void
10528 set_builtin_user_assembler_name (tree decl, const char *asmspec)
10529 {
10530   gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
10531               && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
10532               && asmspec != 0);
10533
10534   tree builtin = builtin_decl_explicit (DECL_FUNCTION_CODE (decl));
10535   set_user_assembler_name (builtin, asmspec);
10536
10537   if (DECL_FUNCTION_CODE (decl) == BUILT_IN_FFS
10538       && INT_TYPE_SIZE < BITS_PER_WORD)
10539     {
10540       scalar_int_mode mode = int_mode_for_size (INT_TYPE_SIZE, 0).require ();
10541       set_user_assembler_libfunc ("ffs", asmspec);
10542       set_optab_libfunc (ffs_optab, mode, "ffs");
10543     }
10544 }
10545
10546 /* Return true if DECL is a builtin that expands to a constant or similarly
10547    simple code.  */
10548 bool
10549 is_simple_builtin (tree decl)
10550 {
10551   if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
10552     switch (DECL_FUNCTION_CODE (decl))
10553       {
10554         /* Builtins that expand to constants.  */
10555       case BUILT_IN_CONSTANT_P:
10556       case BUILT_IN_EXPECT:
10557       case BUILT_IN_OBJECT_SIZE:
10558       case BUILT_IN_UNREACHABLE:
10559         /* Simple register moves or loads from stack.  */
10560       case BUILT_IN_ASSUME_ALIGNED:
10561       case BUILT_IN_RETURN_ADDRESS:
10562       case BUILT_IN_EXTRACT_RETURN_ADDR:
10563       case BUILT_IN_FROB_RETURN_ADDR:
10564       case BUILT_IN_RETURN:
10565       case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
10566       case BUILT_IN_FRAME_ADDRESS:
10567       case BUILT_IN_VA_END:
10568       case BUILT_IN_STACK_SAVE:
10569       case BUILT_IN_STACK_RESTORE:
10570         /* Exception state returns or moves registers around.  */
10571       case BUILT_IN_EH_FILTER:
10572       case BUILT_IN_EH_POINTER:
10573       case BUILT_IN_EH_COPY_VALUES:
10574         return true;
10575
10576       default:
10577         return false;
10578       }
10579
10580   return false;
10581 }
10582
10583 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10584    most probably expanded inline into reasonably simple code.  This is a
10585    superset of is_simple_builtin.  */
10586 bool
10587 is_inexpensive_builtin (tree decl)
10588 {
10589   if (!decl)
10590     return false;
10591   else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
10592     return true;
10593   else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
10594     switch (DECL_FUNCTION_CODE (decl))
10595       {
10596       case BUILT_IN_ABS:
10597       CASE_BUILT_IN_ALLOCA:
10598       case BUILT_IN_BSWAP16:
10599       case BUILT_IN_BSWAP32:
10600       case BUILT_IN_BSWAP64:
10601       case BUILT_IN_CLZ:
10602       case BUILT_IN_CLZIMAX:
10603       case BUILT_IN_CLZL:
10604       case BUILT_IN_CLZLL:
10605       case BUILT_IN_CTZ:
10606       case BUILT_IN_CTZIMAX:
10607       case BUILT_IN_CTZL:
10608       case BUILT_IN_CTZLL:
10609       case BUILT_IN_FFS:
10610       case BUILT_IN_FFSIMAX:
10611       case BUILT_IN_FFSL:
10612       case BUILT_IN_FFSLL:
10613       case BUILT_IN_IMAXABS:
10614       case BUILT_IN_FINITE:
10615       case BUILT_IN_FINITEF:
10616       case BUILT_IN_FINITEL:
10617       case BUILT_IN_FINITED32:
10618       case BUILT_IN_FINITED64:
10619       case BUILT_IN_FINITED128:
10620       case BUILT_IN_FPCLASSIFY:
10621       case BUILT_IN_ISFINITE:
10622       case BUILT_IN_ISINF_SIGN:
10623       case BUILT_IN_ISINF:
10624       case BUILT_IN_ISINFF:
10625       case BUILT_IN_ISINFL:
10626       case BUILT_IN_ISINFD32:
10627       case BUILT_IN_ISINFD64:
10628       case BUILT_IN_ISINFD128:
10629       case BUILT_IN_ISNAN:
10630       case BUILT_IN_ISNANF:
10631       case BUILT_IN_ISNANL:
10632       case BUILT_IN_ISNAND32:
10633       case BUILT_IN_ISNAND64:
10634       case BUILT_IN_ISNAND128:
10635       case BUILT_IN_ISNORMAL:
10636       case BUILT_IN_ISGREATER:
10637       case BUILT_IN_ISGREATEREQUAL:
10638       case BUILT_IN_ISLESS:
10639       case BUILT_IN_ISLESSEQUAL:
10640       case BUILT_IN_ISLESSGREATER:
10641       case BUILT_IN_ISUNORDERED:
10642       case BUILT_IN_VA_ARG_PACK:
10643       case BUILT_IN_VA_ARG_PACK_LEN:
10644       case BUILT_IN_VA_COPY:
10645       case BUILT_IN_TRAP:
10646       case BUILT_IN_SAVEREGS:
10647       case BUILT_IN_POPCOUNTL:
10648       case BUILT_IN_POPCOUNTLL:
10649       case BUILT_IN_POPCOUNTIMAX:
10650       case BUILT_IN_POPCOUNT:
10651       case BUILT_IN_PARITYL:
10652       case BUILT_IN_PARITYLL:
10653       case BUILT_IN_PARITYIMAX:
10654       case BUILT_IN_PARITY:
10655       case BUILT_IN_LABS:
10656       case BUILT_IN_LLABS:
10657       case BUILT_IN_PREFETCH:
10658       case BUILT_IN_ACC_ON_DEVICE:
10659         return true;
10660
10661       default:
10662         return is_simple_builtin (decl);
10663       }
10664
10665   return false;
10666 }
10667
10668 /* Return true if T is a constant and the value cast to a target char
10669    can be represented by a host char.
10670    Store the casted char constant in *P if so.  */
10671
10672 bool
10673 target_char_cst_p (tree t, char *p)
10674 {
10675   if (!tree_fits_uhwi_p (t) || CHAR_TYPE_SIZE != HOST_BITS_PER_CHAR)
10676     return false;
10677
10678   *p = (char)tree_to_uhwi (t);
10679   return true;
10680 }
10681
10682 /* Return the maximum object size.  */
10683
10684 tree
10685 max_object_size (void)
10686 {
10687   /* To do: Make this a configurable parameter.  */
10688   return TYPE_MAX_VALUE (ptrdiff_type_node);
10689 }