1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
30 #ifndef WCHAR_TYPE_SIZE
32 #define WCHAR_TYPE_SIZE INT_TYPE_SIZE
34 #define WCHAR_TYPE_SIZE BITS_PER_WORD
38 extern struct obstack permanent_obstack;
40 enum attrs {A_PACKED, A_NOCOMMON, A_COMMON, A_NORETURN, A_CONST, A_T_UNION,
41 A_CONSTRUCTOR, A_DESTRUCTOR, A_MODE, A_SECTION, A_ALIGNED,
42 A_UNUSED, A_FORMAT, A_WEAK, A_ALIAS};
44 static void declare_hidden_char_array PROTO((char *, char *));
45 static void add_attribute PROTO((enum attrs, char *,
47 static void init_attributes PROTO((void));
49 /* Make bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
52 declare_function_name ()
54 char *name, *printable_name;
56 if (current_function_decl == NULL)
59 printable_name = "top level";
63 char *kind = "function";
64 if (TREE_CODE (TREE_TYPE (current_function_decl)) == METHOD_TYPE)
66 /* Allow functions to be nameless (such as artificial ones). */
67 if (DECL_NAME (current_function_decl))
68 name = IDENTIFIER_POINTER (DECL_NAME (current_function_decl));
71 printable_name = (*decl_printable_name) (current_function_decl, &kind);
74 declare_hidden_char_array ("__FUNCTION__", name);
75 declare_hidden_char_array ("__PRETTY_FUNCTION__", printable_name);
79 declare_hidden_char_array (name, value)
82 tree decl, type, init;
85 /* If the default size of char arrays isn't big enough for the name,
86 or if we want to give warnings for large objects, make a bigger one. */
87 vlen = strlen (value) + 1;
88 type = char_array_type_node;
89 if (TREE_INT_CST_LOW (TYPE_MAX_VALUE (TREE_TYPE (type))) < vlen
91 type = build_array_type (char_type_node,
92 build_index_type (build_int_2 (vlen, 0)));
93 push_obstacks_nochange ();
94 decl = build_decl (VAR_DECL, get_identifier (name), type);
95 TREE_STATIC (decl) = 1;
96 TREE_READONLY (decl) = 1;
97 TREE_ASM_WRITTEN (decl) = 1;
98 DECL_SOURCE_LINE (decl) = 0;
99 DECL_ARTIFICIAL (decl) = 1;
100 DECL_IN_SYSTEM_HEADER (decl) = 1;
101 DECL_IGNORED_P (decl) = 1;
102 init = build_string (vlen, value);
103 TREE_TYPE (init) = type;
104 DECL_INITIAL (decl) = init;
105 finish_decl (pushdecl (decl), init, NULL_TREE);
108 /* Given a chain of STRING_CST nodes,
109 concatenate them into one STRING_CST
110 and give it a suitable array-of-chars data type. */
113 combine_strings (strings)
116 register tree value, t;
117 register int length = 1;
120 int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
123 if (TREE_CHAIN (strings))
125 /* More than one in the chain, so concatenate. */
126 register char *p, *q;
128 /* Don't include the \0 at the end of each substring,
129 except for the last one.
130 Count wide strings and ordinary strings separately. */
131 for (t = strings; t; t = TREE_CHAIN (t))
133 if (TREE_TYPE (t) == wchar_array_type_node)
135 wide_length += (TREE_STRING_LENGTH (t) - wchar_bytes);
139 length += (TREE_STRING_LENGTH (t) - 1);
142 /* If anything is wide, the non-wides will be converted,
143 which makes them take more space. */
145 length = length * wchar_bytes + wide_length;
147 p = savealloc (length);
149 /* Copy the individual strings into the new combined string.
150 If the combined string is wide, convert the chars to ints
151 for any individual strings that are not wide. */
154 for (t = strings; t; t = TREE_CHAIN (t))
156 int len = (TREE_STRING_LENGTH (t)
157 - ((TREE_TYPE (t) == wchar_array_type_node)
159 if ((TREE_TYPE (t) == wchar_array_type_node) == wide_flag)
161 bcopy (TREE_STRING_POINTER (t), q, len);
167 for (i = 0; i < len; i++)
169 if (WCHAR_TYPE_SIZE == HOST_BITS_PER_SHORT)
170 ((short *) q)[i] = TREE_STRING_POINTER (t)[i];
172 ((int *) q)[i] = TREE_STRING_POINTER (t)[i];
174 q += len * wchar_bytes;
180 for (i = 0; i < wchar_bytes; i++)
186 value = make_node (STRING_CST);
187 TREE_STRING_POINTER (value) = p;
188 TREE_STRING_LENGTH (value) = length;
189 TREE_CONSTANT (value) = 1;
194 length = TREE_STRING_LENGTH (value);
195 if (TREE_TYPE (value) == wchar_array_type_node)
199 /* Compute the number of elements, for the array type. */
200 nchars = wide_flag ? length / wchar_bytes : length;
202 /* Create the array type for the string constant.
203 -Wwrite-strings says make the string constant an array of const char
204 so that copying it to a non-const pointer will get a warning. */
205 if (warn_write_strings
206 && (! flag_traditional && ! flag_writable_strings))
209 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
212 = build_array_type (elements,
213 build_index_type (build_int_2 (nchars - 1, 0)));
217 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
218 build_index_type (build_int_2 (nchars - 1, 0)));
219 TREE_CONSTANT (value) = 1;
220 TREE_STATIC (value) = 1;
224 /* To speed up processing of attributes, we maintain an array of
225 IDENTIFIER_NODES and the corresponding attribute types. */
227 /* Array to hold attribute information. */
229 static struct {enum attrs id; tree name; int min, max, decl_req;} attrtab[50];
231 static int attrtab_idx = 0;
233 /* Add an entry to the attribute table above. */
236 add_attribute (id, string, min_len, max_len, decl_req)
239 int min_len, max_len;
244 attrtab[attrtab_idx].id = id;
245 attrtab[attrtab_idx].name = get_identifier (string);
246 attrtab[attrtab_idx].min = min_len;
247 attrtab[attrtab_idx].max = max_len;
248 attrtab[attrtab_idx++].decl_req = decl_req;
250 sprintf (buf, "__%s__", string);
252 attrtab[attrtab_idx].id = id;
253 attrtab[attrtab_idx].name = get_identifier (buf);
254 attrtab[attrtab_idx].min = min_len;
255 attrtab[attrtab_idx].max = max_len;
256 attrtab[attrtab_idx++].decl_req = decl_req;
259 /* Initialize attribute table. */
264 add_attribute (A_PACKED, "packed", 0, 0, 0);
265 add_attribute (A_NOCOMMON, "nocommon", 0, 0, 1);
266 add_attribute (A_COMMON, "common", 0, 0, 1);
267 add_attribute (A_NORETURN, "noreturn", 0, 0, 1);
268 add_attribute (A_NORETURN, "volatile", 0, 0, 1);
269 add_attribute (A_UNUSED, "unused", 0, 0, 1);
270 add_attribute (A_CONST, "const", 0, 0, 1);
271 add_attribute (A_T_UNION, "transparent_union", 0, 0, 0);
272 add_attribute (A_CONSTRUCTOR, "constructor", 0, 0, 1);
273 add_attribute (A_DESTRUCTOR, "destructor", 0, 0, 1);
274 add_attribute (A_MODE, "mode", 1, 1, 1);
275 add_attribute (A_SECTION, "section", 1, 1, 1);
276 add_attribute (A_ALIGNED, "aligned", 0, 1, 0);
277 add_attribute (A_FORMAT, "format", 3, 3, 1);
278 add_attribute (A_WEAK, "weak", 0, 0, 1);
279 add_attribute (A_ALIAS, "alias", 1, 1, 1);
282 /* Process the attributes listed in ATTRIBUTES and PREFIX_ATTRIBUTES
283 and install them in NODE, which is either a DECL (including a TYPE_DECL)
284 or a TYPE. PREFIX_ATTRIBUTES can appear after the declaration specifiers
285 and declaration modifiers but before the declaration proper. */
288 decl_attributes (node, attributes, prefix_attributes)
289 tree node, attributes, prefix_attributes;
295 if (attrtab_idx == 0)
298 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'd')
301 type = TREE_TYPE (decl);
302 is_type = TREE_CODE (node) == TYPE_DECL;
304 else if (TREE_CODE_CLASS (TREE_CODE (node)) == 't')
305 type = node, is_type = 1;
307 attributes = chainon (prefix_attributes, attributes);
309 for (a = attributes; a; a = TREE_CHAIN (a))
311 tree name = TREE_PURPOSE (a);
312 tree args = TREE_VALUE (a);
316 for (i = 0; i < attrtab_idx; i++)
317 if (attrtab[i].name == name)
320 if (i == attrtab_idx)
322 if (! valid_machine_attribute (name, args, decl, type))
323 warning ("`%s' attribute directive ignored",
324 IDENTIFIER_POINTER (name));
326 type = TREE_TYPE (decl);
329 else if (attrtab[i].decl_req && decl == 0)
331 warning ("`%s' attribute does not apply to types",
332 IDENTIFIER_POINTER (name));
335 else if (list_length (args) < attrtab[i].min
336 || list_length (args) > attrtab[i].max)
338 error ("wrong number of arguments specified for `%s' attribute",
339 IDENTIFIER_POINTER (name));
348 TYPE_PACKED (type) = 1;
349 else if (TREE_CODE (decl) == FIELD_DECL)
350 DECL_PACKED (decl) = 1;
351 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
352 used for DECL_REGISTER. It wouldn't mean anything anyway. */
354 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
358 if (TREE_CODE (decl) == VAR_DECL)
359 DECL_COMMON (decl) = 0;
361 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
365 if (TREE_CODE (decl) == VAR_DECL)
366 DECL_COMMON (decl) = 1;
368 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
372 if (TREE_CODE (decl) == FUNCTION_DECL)
373 TREE_THIS_VOLATILE (decl) = 1;
374 else if (TREE_CODE (type) == POINTER_TYPE
375 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
376 TREE_TYPE (decl) = type
378 (build_type_variant (TREE_TYPE (type),
379 TREE_READONLY (TREE_TYPE (type)), 1));
381 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
385 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL
386 || TREE_CODE (decl) == FUNCTION_DECL)
387 TREE_USED (decl) = 1;
389 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
393 if (TREE_CODE (decl) == FUNCTION_DECL)
394 TREE_READONLY (decl) = 1;
395 else if (TREE_CODE (type) == POINTER_TYPE
396 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
397 TREE_TYPE (decl) = type
399 (build_type_variant (TREE_TYPE (type), 1,
400 TREE_THIS_VOLATILE (TREE_TYPE (type))));
402 warning ( "`%s' attribute ignored", IDENTIFIER_POINTER (name));
407 && TREE_CODE (type) == UNION_TYPE
409 || TYPE_MODE (type) == DECL_MODE (TYPE_FIELDS (type))))
410 TYPE_TRANSPARENT_UNION (type) = 1;
411 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
412 && TREE_CODE (type) == UNION_TYPE
413 && TYPE_MODE (type) == DECL_MODE (TYPE_FIELDS (type)))
414 DECL_TRANSPARENT_UNION (decl) = 1;
416 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
420 if (TREE_CODE (decl) == FUNCTION_DECL
421 && TREE_CODE (type) == FUNCTION_TYPE
422 && decl_function_context (decl) == 0)
424 DECL_STATIC_CONSTRUCTOR (decl) = 1;
425 TREE_USED (decl) = 1;
428 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
432 if (TREE_CODE (decl) == FUNCTION_DECL
433 && TREE_CODE (type) == FUNCTION_TYPE
434 && decl_function_context (decl) == 0)
436 DECL_STATIC_DESTRUCTOR (decl) = 1;
437 TREE_USED (decl) = 1;
440 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
444 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
445 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
449 char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
450 int len = strlen (p);
451 enum machine_mode mode = VOIDmode;
454 if (len > 4 && p[0] == '_' && p[1] == '_'
455 && p[len - 1] == '_' && p[len - 2] == '_')
457 char *newp = (char *) alloca (len - 1);
459 strcpy (newp, &p[2]);
460 newp[len - 4] = '\0';
464 /* Give this decl a type with the specified mode.
465 First check for the special modes. */
466 if (! strcmp (p, "byte"))
468 else if (!strcmp (p, "word"))
470 else if (! strcmp (p, "pointer"))
473 for (j = 0; j < NUM_MACHINE_MODES; j++)
474 if (!strcmp (p, GET_MODE_NAME (j)))
475 mode = (enum machine_mode) j;
477 if (mode == VOIDmode)
478 error ("unknown machine mode `%s'", p);
479 else if (0 == (typefm = type_for_mode (mode,
480 TREE_UNSIGNED (type))))
481 error ("no data type for mode `%s'", p);
484 TREE_TYPE (decl) = type = typefm;
485 DECL_SIZE (decl) = 0;
486 layout_decl (decl, 0);
492 #ifdef ASM_OUTPUT_SECTION_NAME
493 if ((TREE_CODE (decl) == FUNCTION_DECL
494 || TREE_CODE (decl) == VAR_DECL)
495 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
497 if (TREE_CODE (decl) == VAR_DECL
498 && current_function_decl != NULL_TREE)
499 error_with_decl (decl,
500 "section attribute cannot be specified for local variables");
501 /* The decl may have already been given a section attribute from
502 a previous declaration. Ensure they match. */
503 else if (DECL_SECTION_NAME (decl) != NULL_TREE
504 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
505 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
506 error_with_decl (node,
507 "section of `%s' conflicts with previous declaration");
509 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
512 error_with_decl (node,
513 "section attribute not allowed for `%s'");
515 error_with_decl (node,
516 "section attributes are not supported for this target");
523 = (args ? TREE_VALUE (args)
524 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
527 /* Strip any NOPs of any kind. */
528 while (TREE_CODE (align_expr) == NOP_EXPR
529 || TREE_CODE (align_expr) == CONVERT_EXPR
530 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
531 align_expr = TREE_OPERAND (align_expr, 0);
533 if (TREE_CODE (align_expr) != INTEGER_CST)
535 error ("requested alignment is not a constant");
539 align = TREE_INT_CST_LOW (align_expr) * BITS_PER_UNIT;
541 if (exact_log2 (align) == -1)
542 error ("requested alignment is not a power of 2");
544 TYPE_ALIGN (type) = align;
545 else if (TREE_CODE (decl) != VAR_DECL
546 && TREE_CODE (decl) != FIELD_DECL)
547 error_with_decl (decl,
548 "alignment may not be specified for `%s'");
550 DECL_ALIGN (decl) = align;
556 tree format_type = TREE_VALUE (args);
557 tree format_num_expr = TREE_VALUE (TREE_CHAIN (args));
558 tree first_arg_num_expr
559 = TREE_VALUE (TREE_CHAIN (TREE_CHAIN (args)));
566 if (TREE_CODE (decl) != FUNCTION_DECL)
568 error_with_decl (decl,
569 "argument format specified for non-function `%s'");
573 if (TREE_CODE (format_type) == IDENTIFIER_NODE
574 && (!strcmp (IDENTIFIER_POINTER (format_type), "printf")
575 || !strcmp (IDENTIFIER_POINTER (format_type),
578 else if (TREE_CODE (format_type) == IDENTIFIER_NODE
579 && (!strcmp (IDENTIFIER_POINTER (format_type), "scanf")
580 || !strcmp (IDENTIFIER_POINTER (format_type),
585 error ("unrecognized format specifier for `%s'");
589 /* Strip any conversions from the string index and first arg number
590 and verify they are constants. */
591 while (TREE_CODE (format_num_expr) == NOP_EXPR
592 || TREE_CODE (format_num_expr) == CONVERT_EXPR
593 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
594 format_num_expr = TREE_OPERAND (format_num_expr, 0);
596 while (TREE_CODE (first_arg_num_expr) == NOP_EXPR
597 || TREE_CODE (first_arg_num_expr) == CONVERT_EXPR
598 || TREE_CODE (first_arg_num_expr) == NON_LVALUE_EXPR)
599 first_arg_num_expr = TREE_OPERAND (first_arg_num_expr, 0);
601 if (TREE_CODE (format_num_expr) != INTEGER_CST
602 || TREE_CODE (first_arg_num_expr) != INTEGER_CST)
604 error ("format string has non-constant operand number");
608 format_num = TREE_INT_CST_LOW (format_num_expr);
609 first_arg_num = TREE_INT_CST_LOW (first_arg_num_expr);
610 if (first_arg_num != 0 && first_arg_num <= format_num)
612 error ("format string arg follows the args to be formatted");
616 /* If a parameter list is specified, verify that the format_num
617 argument is actually a string, in case the format attribute
619 argument = TYPE_ARG_TYPES (type);
622 for (arg_num = 1; ; ++arg_num)
624 if (argument == 0 || arg_num == format_num)
626 argument = TREE_CHAIN (argument);
629 || TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE
630 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (argument)))
633 error ("format string arg not a string type");
636 if (first_arg_num != 0)
638 /* Verify that first_arg_num points to the last arg,
641 arg_num++, argument = TREE_CHAIN (argument);
642 if (arg_num != first_arg_num)
644 error ("args to be formatted is not ...");
650 record_function_format (DECL_NAME (decl),
651 DECL_ASSEMBLER_NAME (decl),
652 is_scan, format_num, first_arg_num);
661 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
662 || TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl))
663 error_with_decl (decl,
664 "`%s' defined both normally and as an alias");
665 else if (decl_function_context (decl) == 0)
667 tree id = get_identifier (TREE_STRING_POINTER
668 (TREE_VALUE (args)));
669 if (TREE_CODE (decl) == FUNCTION_DECL)
670 DECL_INITIAL (decl) = error_mark_node;
672 DECL_EXTERNAL (decl) = 0;
673 assemble_alias (decl, id);
676 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
682 /* Check a printf/fprintf/sprintf/scanf/fscanf/sscanf format against
685 #define T_I &integer_type_node
686 #define T_L &long_integer_type_node
687 #define T_LL &long_long_integer_type_node
688 #define T_S &short_integer_type_node
689 #define T_UI &unsigned_type_node
690 #define T_UL &long_unsigned_type_node
691 #define T_ULL &long_long_unsigned_type_node
692 #define T_US &short_unsigned_type_node
693 #define T_F &float_type_node
694 #define T_D &double_type_node
695 #define T_LD &long_double_type_node
696 #define T_C &char_type_node
697 #define T_V &void_type_node
698 #define T_W &wchar_type_node
699 #define T_ST &sizetype
704 /* Type of argument if no length modifier is used. */
706 /* Type of argument if length modifier for shortening is used.
707 If NULL, then this modifier is not allowed. */
709 /* Type of argument if length modifier `l' is used.
710 If NULL, then this modifier is not allowed. */
712 /* Type of argument if length modifier `q' or `ll' is used.
713 If NULL, then this modifier is not allowed. */
715 /* Type of argument if length modifier `L' is used.
716 If NULL, then this modifier is not allowed. */
718 /* List of other modifier characters allowed with these options. */
722 static format_char_info print_char_table[] = {
723 { "di", 0, T_I, T_I, T_L, T_LL, T_LL, "-wp0 +" },
724 { "oxX", 0, T_UI, T_UI, T_UL, T_ULL, T_ULL, "-wp0#" },
725 { "u", 0, T_UI, T_UI, T_UL, T_ULL, T_ULL, "-wp0" },
726 /* Two GNU extensions. */
727 { "Z", 0, T_ST, NULL, NULL, NULL, NULL, "-wp0" },
728 { "m", 0, T_V, NULL, NULL, NULL, NULL, "-wp" },
729 { "feEgG", 0, T_D, NULL, NULL, NULL, T_LD, "-wp0 +#" },
730 { "c", 0, T_I, NULL, T_W, NULL, NULL, "-w" },
731 { "C", 0, T_W, NULL, NULL, NULL, NULL, "-w" },
732 { "s", 1, T_C, NULL, T_W, NULL, NULL, "-wp" },
733 { "S", 1, T_W, NULL, NULL, NULL, NULL, "-wp" },
734 { "p", 1, T_V, NULL, NULL, NULL, NULL, "-w" },
735 { "n", 1, T_I, T_S, T_L, T_LL, NULL, "" },
739 static format_char_info scan_char_table[] = {
740 { "di", 1, T_I, T_S, T_L, T_LL, T_LL, "*" },
741 { "ouxX", 1, T_UI, T_US, T_UL, T_ULL, T_ULL, "*" },
742 { "efgEG", 1, T_F, NULL, T_D, NULL, T_LD, "*" },
743 { "sc", 1, T_C, NULL, T_W, NULL, NULL, "*a" },
744 { "[", 1, T_C, NULL, NULL, NULL, NULL, "*a" },
745 { "C", 1, T_W, NULL, NULL, NULL, NULL, "*" },
746 { "S", 1, T_W, NULL, NULL, NULL, NULL, "*" },
747 { "p", 2, T_V, NULL, NULL, NULL, NULL, "*" },
748 { "n", 1, T_I, T_S, T_L, T_LL, NULL, "" },
752 typedef struct function_format_info {
753 struct function_format_info *next; /* next structure on the list */
754 tree name; /* identifier such as "printf" */
755 tree assembler_name; /* optional mangled identifier (for C++) */
756 int is_scan; /* TRUE if *scanf */
757 int format_num; /* number of format argument */
758 int first_arg_num; /* number of first arg (zero for varargs) */
759 } function_format_info;
761 static function_format_info *function_format_list = NULL;
763 static void check_format_info PROTO((function_format_info *, tree));
765 /* Initialize the table of functions to perform format checking on.
766 The ANSI functions are always checked (whether <stdio.h> is
767 included or not), since it is common to call printf without
768 including <stdio.h>. There shouldn't be a problem with this,
769 since ANSI reserves these function names whether you include the
770 header file or not. In any case, the checking is harmless. */
773 init_function_format_info ()
775 record_function_format (get_identifier ("printf"), NULL_TREE, 0, 1, 2);
776 record_function_format (get_identifier ("fprintf"), NULL_TREE, 0, 2, 3);
777 record_function_format (get_identifier ("sprintf"), NULL_TREE, 0, 2, 3);
778 record_function_format (get_identifier ("scanf"), NULL_TREE, 1, 1, 2);
779 record_function_format (get_identifier ("fscanf"), NULL_TREE, 1, 2, 3);
780 record_function_format (get_identifier ("sscanf"), NULL_TREE, 1, 2, 3);
781 record_function_format (get_identifier ("vprintf"), NULL_TREE, 0, 1, 0);
782 record_function_format (get_identifier ("vfprintf"), NULL_TREE, 0, 2, 0);
783 record_function_format (get_identifier ("vsprintf"), NULL_TREE, 0, 2, 0);
786 /* Record information for argument format checking. FUNCTION_IDENT is
787 the identifier node for the name of the function to check (its decl
788 need not exist yet). IS_SCAN is true for scanf-type format checking;
789 false indicates printf-style format checking. FORMAT_NUM is the number
790 of the argument which is the format control string (starting from 1).
791 FIRST_ARG_NUM is the number of the first actual argument to check
792 against teh format string, or zero if no checking is not be done
793 (e.g. for varargs such as vfprintf). */
796 record_function_format (name, assembler_name, is_scan,
797 format_num, first_arg_num)
804 function_format_info *info;
806 /* Re-use existing structure if it's there. */
808 for (info = function_format_list; info; info = info->next)
810 if (info->name == name && info->assembler_name == assembler_name)
815 info = (function_format_info *) xmalloc (sizeof (function_format_info));
816 info->next = function_format_list;
817 function_format_list = info;
820 info->assembler_name = assembler_name;
823 info->is_scan = is_scan;
824 info->format_num = format_num;
825 info->first_arg_num = first_arg_num;
828 static char tfaff[] = "too few arguments for format";
830 /* Check the argument list of a call to printf, scanf, etc.
831 NAME is the function identifier.
832 ASSEMBLER_NAME is the function's assembler identifier.
833 (Either NAME or ASSEMBLER_NAME, but not both, may be NULL_TREE.)
834 PARAMS is the list of argument values. */
837 check_function_format (name, assembler_name, params)
842 function_format_info *info;
844 /* See if this function is a format function. */
845 for (info = function_format_list; info; info = info->next)
847 if (info->assembler_name
848 ? (info->assembler_name == assembler_name)
849 : (info->name == name))
852 check_format_info (info, params);
858 /* Check the argument list of a call to printf, scanf, etc.
859 INFO points to the function_format_info structure.
860 PARAMS is the list of argument values. */
863 check_format_info (info, params)
864 function_format_info *info;
869 int suppressed, wide, precise;
877 tree first_fillin_param;
879 format_char_info *fci;
880 static char message[132];
882 int has_operand_number = 0;
884 /* Skip to format argument. If the argument isn't available, there's
885 no work for us to do; prototype checking will catch the problem. */
886 for (arg_num = 1; ; ++arg_num)
890 if (arg_num == info->format_num)
892 params = TREE_CHAIN (params);
894 format_tree = TREE_VALUE (params);
895 params = TREE_CHAIN (params);
896 if (format_tree == 0)
898 /* We can only check the format if it's a string constant. */
899 while (TREE_CODE (format_tree) == NOP_EXPR)
900 format_tree = TREE_OPERAND (format_tree, 0); /* strip coercion */
901 if (integer_zerop (format_tree))
903 warning ("null format string");
906 if (TREE_CODE (format_tree) != ADDR_EXPR)
908 format_tree = TREE_OPERAND (format_tree, 0);
909 if (TREE_CODE (format_tree) != STRING_CST)
911 format_chars = TREE_STRING_POINTER (format_tree);
912 format_length = TREE_STRING_LENGTH (format_tree);
913 if (format_length <= 1)
914 warning ("zero-length format string");
915 if (format_chars[--format_length] != 0)
917 warning ("unterminated format string");
920 /* Skip to first argument to check. */
921 while (arg_num + 1 < info->first_arg_num)
925 params = TREE_CHAIN (params);
929 first_fillin_param = params;
933 if (*format_chars == 0)
935 if (format_chars - TREE_STRING_POINTER (format_tree) != format_length)
936 warning ("embedded `\\0' in format");
937 if (info->first_arg_num != 0 && params != 0 && ! has_operand_number)
938 warning ("too many arguments for format");
941 if (*format_chars++ != '%')
943 if (*format_chars == 0)
945 warning ("spurious trailing `%%' in format");
948 if (*format_chars == '%')
954 suppressed = wide = precise = FALSE;
957 suppressed = *format_chars == '*';
960 while (isdigit (*format_chars))
965 /* See if we have a number followed by a dollar sign. If we do,
966 it is an operand number, so set PARAMS to that operand. */
967 if (*format_chars >= '0' && *format_chars <= '9')
969 char *p = format_chars;
971 while (*p >= '0' && *p++ <= '9')
976 int opnum = atoi (format_chars);
978 params = first_fillin_param;
979 format_chars = p + 1;
980 has_operand_number = 1;
982 for (i = 1; i < opnum && params != 0; i++)
983 params = TREE_CHAIN (params);
985 if (opnum == 0 || params == 0)
987 warning ("operand number out of range in format");
993 while (*format_chars != 0 && index (" +#0-", *format_chars) != 0)
995 if (index (flag_chars, *format_chars) != 0)
997 sprintf (message, "repeated `%c' flag in format",
1001 i = strlen (flag_chars);
1002 flag_chars[i++] = *format_chars++;
1005 /* "If the space and + flags both appear,
1006 the space flag will be ignored." */
1007 if (index (flag_chars, ' ') != 0
1008 && index (flag_chars, '+') != 0)
1009 warning ("use of both ` ' and `+' flags in format");
1010 /* "If the 0 and - flags both appear,
1011 the 0 flag will be ignored." */
1012 if (index (flag_chars, '0') != 0
1013 && index (flag_chars, '-') != 0)
1014 warning ("use of both `0' and `-' flags in format");
1015 if (*format_chars == '*')
1018 /* "...a field width...may be indicated by an asterisk.
1019 In this case, an int argument supplies the field width..." */
1026 if (info->first_arg_num != 0)
1028 cur_param = TREE_VALUE (params);
1029 params = TREE_CHAIN (params);
1031 /* size_t is generally not valid here.
1032 It will work on most machines, because size_t and int
1033 have the same mode. But might as well warn anyway,
1034 since it will fail on other machines. */
1035 if ((TYPE_MAIN_VARIANT (TREE_TYPE (cur_param))
1036 != integer_type_node)
1038 (TYPE_MAIN_VARIANT (TREE_TYPE (cur_param))
1039 != unsigned_type_node))
1042 "field width is not type int (arg %d)",
1050 while (isdigit (*format_chars))
1056 if (*format_chars == '.')
1060 if (*format_chars != '*' && !isdigit (*format_chars))
1061 warning ("`.' not followed by `*' or digit in format");
1062 /* "...a...precision...may be indicated by an asterisk.
1063 In this case, an int argument supplies the...precision." */
1064 if (*format_chars == '*')
1066 if (info->first_arg_num != 0)
1074 cur_param = TREE_VALUE (params);
1075 params = TREE_CHAIN (params);
1077 if (TYPE_MAIN_VARIANT (TREE_TYPE (cur_param))
1078 != integer_type_node)
1081 "field width is not type int (arg %d)",
1089 while (isdigit (*format_chars))
1094 if (*format_chars == 'h' || *format_chars == 'l')
1095 length_char = *format_chars++;
1096 else if (*format_chars == 'q' || *format_chars == 'L')
1098 length_char = *format_chars++;
1100 pedwarn ("ANSI C does not support the `%c' length modifier",
1105 if (length_char == 'l' && *format_chars == 'l')
1107 length_char = 'q', format_chars++;
1109 pedwarn ("ANSI C does not support the `ll' length modifier");
1112 if (*format_chars == 'a')
1117 if (suppressed && length_char != 0)
1120 "use of `*' and `%c' together in format",
1124 format_char = *format_chars;
1125 if (format_char == 0 || format_char == '%')
1127 warning ("conversion lacks type at end of format");
1131 fci = info->is_scan ? scan_char_table : print_char_table;
1132 while (fci->format_chars != 0
1133 && index (fci->format_chars, format_char) == 0)
1135 if (fci->format_chars == 0)
1137 if (format_char >= 040 && format_char < 0177)
1139 "unknown conversion type character `%c' in format",
1143 "unknown conversion type character 0x%x in format",
1148 if (wide && index (fci->flag_chars, 'w') == 0)
1150 sprintf (message, "width used with `%c' format",
1154 if (precise && index (fci->flag_chars, 'p') == 0)
1156 sprintf (message, "precision used with `%c' format",
1160 if (aflag && index (fci->flag_chars, 'a') == 0)
1162 sprintf (message, "`a' flag used with `%c' format",
1166 if (info->is_scan && format_char == '[')
1168 /* Skip over scan set, in case it happens to have '%' in it. */
1169 if (*format_chars == '^')
1171 /* Find closing bracket; if one is hit immediately, then
1172 it's part of the scan set rather than a terminator. */
1173 if (*format_chars == ']')
1175 while (*format_chars && *format_chars != ']')
1177 if (*format_chars != ']')
1178 /* The end of the format string was reached. */
1179 warning ("no closing `]' for `%%[' format");
1183 if (index (fci->flag_chars, '*') == 0)
1186 "suppression of `%c' conversion in format",
1192 for (i = 0; flag_chars[i] != 0; ++i)
1194 if (index (fci->flag_chars, flag_chars[i]) == 0)
1196 sprintf (message, "flag `%c' used with type `%c'",
1197 flag_chars[i], format_char);
1201 if (precise && index (flag_chars, '0') != 0
1202 && (format_char == 'd' || format_char == 'i'
1203 || format_char == 'o' || format_char == 'u'
1204 || format_char == 'x' || format_char == 'x'))
1207 "precision and `0' flag not both allowed with `%c' format",
1211 switch (length_char)
1213 default: wanted_type = fci->nolen ? *(fci->nolen) : 0; break;
1214 case 'h': wanted_type = fci->hlen ? *(fci->hlen) : 0; break;
1215 case 'l': wanted_type = fci->llen ? *(fci->llen) : 0; break;
1216 case 'q': wanted_type = fci->qlen ? *(fci->qlen) : 0; break;
1217 case 'L': wanted_type = fci->bigllen ? *(fci->bigllen) : 0; break;
1219 if (wanted_type == 0)
1222 "use of `%c' length character with `%c' type character",
1223 length_char, format_char);
1228 ** XXX -- should kvetch about stuff such as
1232 ** scanf ("%d", &i);
1236 /* Finally. . .check type of argument against desired type! */
1237 if (info->first_arg_num == 0)
1239 if (fci->pointer_count == 0 && wanted_type == void_type_node)
1240 /* This specifier takes no argument. */
1247 cur_param = TREE_VALUE (params);
1248 params = TREE_CHAIN (params);
1250 cur_type = TREE_TYPE (cur_param);
1252 /* Check the types of any additional pointer arguments
1253 that precede the "real" argument. */
1254 for (i = 0; i < fci->pointer_count; ++i)
1256 if (TREE_CODE (cur_type) == POINTER_TYPE)
1258 cur_type = TREE_TYPE (cur_type);
1261 if (TREE_CODE (cur_type) != ERROR_MARK)
1264 "format argument is not a %s (arg %d)",
1265 ((fci->pointer_count == 1) ? "pointer" : "pointer to a pointer"),
1272 /* Check the type of the "real" argument, if there's a type we want. */
1273 if (i == fci->pointer_count && wanted_type != 0
1274 && TREE_CODE (cur_type) != ERROR_MARK
1275 && wanted_type != TYPE_MAIN_VARIANT (cur_type)
1276 /* If we want `void *', allow any pointer type.
1277 (Anything else would already have got a warning.) */
1278 && ! (wanted_type == void_type_node
1279 && fci->pointer_count > 0)
1280 /* Don't warn about differences merely in signedness. */
1281 && !(TREE_CODE (wanted_type) == INTEGER_TYPE
1282 && TREE_CODE (TYPE_MAIN_VARIANT (cur_type)) == INTEGER_TYPE
1283 && (TREE_UNSIGNED (wanted_type)
1284 ? wanted_type == (cur_type = unsigned_type (cur_type))
1285 : wanted_type == (cur_type = signed_type (cur_type))))
1286 /* Likewise, "signed char", "unsigned char" and "char" are
1287 equivalent but the above test won't consider them equivalent. */
1288 && ! (wanted_type == char_type_node
1289 && (TYPE_MAIN_VARIANT (cur_type) == signed_char_type_node
1290 || TYPE_MAIN_VARIANT (cur_type) == unsigned_char_type_node)))
1292 register char *this;
1293 register char *that;
1295 this = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (wanted_type)));
1297 if (TREE_CODE (cur_type) != ERROR_MARK
1298 && TYPE_NAME (cur_type) != 0
1299 && TREE_CODE (cur_type) != INTEGER_TYPE
1300 && !(TREE_CODE (cur_type) == POINTER_TYPE
1301 && TREE_CODE (TREE_TYPE (cur_type)) == INTEGER_TYPE))
1303 if (TREE_CODE (TYPE_NAME (cur_type)) == TYPE_DECL
1304 && DECL_NAME (TYPE_NAME (cur_type)) != 0)
1305 that = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (cur_type)));
1307 that = IDENTIFIER_POINTER (TYPE_NAME (cur_type));
1310 /* A nameless type can't possibly match what the format wants.
1311 So there will be a warning for it.
1312 Make up a string to describe vaguely what it is. */
1315 if (TREE_CODE (cur_type) == POINTER_TYPE)
1318 that = "different type";
1321 /* Make the warning better in case of mismatch of int vs long. */
1322 if (TREE_CODE (cur_type) == INTEGER_TYPE
1323 && TREE_CODE (wanted_type) == INTEGER_TYPE
1324 && TYPE_PRECISION (cur_type) == TYPE_PRECISION (wanted_type)
1325 && TYPE_NAME (cur_type) != 0
1326 && TREE_CODE (TYPE_NAME (cur_type)) == TYPE_DECL)
1327 that = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (cur_type)));
1329 if (strcmp (this, that) != 0)
1331 sprintf (message, "%s format, %s arg (arg %d)",
1332 this, that, arg_num);
1339 /* Print a warning if a constant expression had overflow in folding.
1340 Invoke this function on every expression that the language
1341 requires to be a constant expression.
1342 Note the ANSI C standard says it is erroneous for a
1343 constant expression to overflow. */
1346 constant_expression_warning (value)
1349 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1350 || TREE_CODE (value) == COMPLEX_CST)
1351 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1352 pedwarn ("overflow in constant expression");
1355 /* Print a warning if an expression had overflow in folding.
1356 Invoke this function on every expression that
1357 (1) appears in the source code, and
1358 (2) might be a constant expression that overflowed, and
1359 (3) is not already checked by convert_and_check;
1360 however, do not invoke this function on operands of explicit casts. */
1363 overflow_warning (value)
1366 if ((TREE_CODE (value) == INTEGER_CST
1367 || (TREE_CODE (value) == COMPLEX_CST
1368 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1369 && TREE_OVERFLOW (value))
1371 TREE_OVERFLOW (value) = 0;
1372 warning ("integer overflow in expression");
1374 else if ((TREE_CODE (value) == REAL_CST
1375 || (TREE_CODE (value) == COMPLEX_CST
1376 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1377 && TREE_OVERFLOW (value))
1379 TREE_OVERFLOW (value) = 0;
1380 warning ("floating point overflow in expression");
1384 /* Print a warning if a large constant is truncated to unsigned,
1385 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1386 Invoke this function on every expression that might be implicitly
1387 converted to an unsigned type. */
1390 unsigned_conversion_warning (result, operand)
1391 tree result, operand;
1393 if (TREE_CODE (operand) == INTEGER_CST
1394 && TREE_CODE (TREE_TYPE (result)) == INTEGER_TYPE
1395 && TREE_UNSIGNED (TREE_TYPE (result))
1396 && !int_fits_type_p (operand, TREE_TYPE (result)))
1398 if (!int_fits_type_p (operand, signed_type (TREE_TYPE (result))))
1399 /* This detects cases like converting -129 or 256 to unsigned char. */
1400 warning ("large integer implicitly truncated to unsigned type");
1401 else if (warn_conversion)
1402 warning ("negative integer implicitly converted to unsigned type");
1406 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1407 Invoke this function on every expression that is converted implicitly,
1408 i.e. because of language rules and not because of an explicit cast. */
1411 convert_and_check (type, expr)
1414 tree t = convert (type, expr);
1415 if (TREE_CODE (t) == INTEGER_CST)
1417 if (TREE_OVERFLOW (t))
1419 TREE_OVERFLOW (t) = 0;
1421 /* Do not diagnose overflow in a constant expression merely
1422 because a conversion overflowed. */
1423 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1425 /* No warning for converting 0x80000000 to int. */
1426 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1427 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1428 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1429 /* If EXPR fits in the unsigned version of TYPE,
1430 don't warn unless pedantic. */
1432 || TREE_UNSIGNED (type)
1433 || ! int_fits_type_p (expr, unsigned_type (type)))
1434 warning ("overflow in implicit constant conversion");
1437 unsigned_conversion_warning (t, expr);
1443 c_expand_expr_stmt (expr)
1446 /* Do default conversion if safe and possibly important,
1447 in case within ({...}). */
1448 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE && lvalue_p (expr))
1449 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1450 expr = default_conversion (expr);
1452 if (TREE_TYPE (expr) != error_mark_node
1453 && TYPE_SIZE (TREE_TYPE (expr)) == 0
1454 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1455 error ("expression statement has incomplete type");
1457 expand_expr_stmt (expr);
1460 /* Validate the expression after `case' and apply default promotions. */
1463 check_case_value (value)
1466 if (value == NULL_TREE)
1469 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1470 STRIP_TYPE_NOPS (value);
1472 if (TREE_CODE (value) != INTEGER_CST
1473 && value != error_mark_node)
1475 error ("case label does not reduce to an integer constant");
1476 value = error_mark_node;
1479 /* Promote char or short to int. */
1480 value = default_conversion (value);
1482 constant_expression_warning (value);
1487 /* Return an integer type with BITS bits of precision,
1488 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1491 type_for_size (bits, unsignedp)
1495 if (bits == TYPE_PRECISION (integer_type_node))
1496 return unsignedp ? unsigned_type_node : integer_type_node;
1498 if (bits == TYPE_PRECISION (signed_char_type_node))
1499 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1501 if (bits == TYPE_PRECISION (short_integer_type_node))
1502 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1504 if (bits == TYPE_PRECISION (long_integer_type_node))
1505 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1507 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1508 return (unsignedp ? long_long_unsigned_type_node
1509 : long_long_integer_type_node);
1511 if (bits <= TYPE_PRECISION (intQI_type_node))
1512 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1514 if (bits <= TYPE_PRECISION (intHI_type_node))
1515 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1517 if (bits <= TYPE_PRECISION (intSI_type_node))
1518 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1520 if (bits <= TYPE_PRECISION (intDI_type_node))
1521 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1526 /* Return a data type that has machine mode MODE.
1527 If the mode is an integer,
1528 then UNSIGNEDP selects between signed and unsigned types. */
1531 type_for_mode (mode, unsignedp)
1532 enum machine_mode mode;
1535 if (mode == TYPE_MODE (integer_type_node))
1536 return unsignedp ? unsigned_type_node : integer_type_node;
1538 if (mode == TYPE_MODE (signed_char_type_node))
1539 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1541 if (mode == TYPE_MODE (short_integer_type_node))
1542 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1544 if (mode == TYPE_MODE (long_integer_type_node))
1545 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1547 if (mode == TYPE_MODE (long_long_integer_type_node))
1548 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1550 if (mode == TYPE_MODE (intQI_type_node))
1551 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1553 if (mode == TYPE_MODE (intHI_type_node))
1554 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1556 if (mode == TYPE_MODE (intSI_type_node))
1557 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1559 if (mode == TYPE_MODE (intDI_type_node))
1560 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1562 if (mode == TYPE_MODE (float_type_node))
1563 return float_type_node;
1565 if (mode == TYPE_MODE (double_type_node))
1566 return double_type_node;
1568 if (mode == TYPE_MODE (long_double_type_node))
1569 return long_double_type_node;
1571 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1572 return build_pointer_type (char_type_node);
1574 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1575 return build_pointer_type (integer_type_node);
1580 /* Return the minimum number of bits needed to represent VALUE in a
1581 signed or unsigned type, UNSIGNEDP says which. */
1584 min_precision (value, unsignedp)
1590 /* If the value is negative, compute its negative minus 1. The latter
1591 adjustment is because the absolute value of the largest negative value
1592 is one larger than the largest positive value. This is equivalent to
1593 a bit-wise negation, so use that operation instead. */
1595 if (tree_int_cst_sgn (value) < 0)
1596 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
1598 /* Return the number of bits needed, taking into account the fact
1599 that we need one more bit for a signed than unsigned type. */
1601 if (integer_zerop (value))
1603 else if (TREE_INT_CST_HIGH (value) != 0)
1604 log = HOST_BITS_PER_WIDE_INT + floor_log2 (TREE_INT_CST_HIGH (value));
1606 log = floor_log2 (TREE_INT_CST_LOW (value));
1608 return log + 1 + ! unsignedp;
1611 /* Print an error message for invalid operands to arith operation CODE.
1612 NOP_EXPR is used as a special case (see truthvalue_conversion). */
1615 binary_op_error (code)
1616 enum tree_code code;
1618 register char *opname = "unknown";
1623 error ("invalid truth-value expression");
1627 opname = "+"; break;
1629 opname = "-"; break;
1631 opname = "*"; break;
1633 opname = "max"; break;
1635 opname = "min"; break;
1637 opname = "=="; break;
1639 opname = "!="; break;
1641 opname = "<="; break;
1643 opname = ">="; break;
1645 opname = "<"; break;
1647 opname = ">"; break;
1649 opname = "<<"; break;
1651 opname = ">>"; break;
1652 case TRUNC_MOD_EXPR:
1653 case FLOOR_MOD_EXPR:
1654 opname = "%"; break;
1655 case TRUNC_DIV_EXPR:
1656 case FLOOR_DIV_EXPR:
1657 opname = "/"; break;
1659 opname = "&"; break;
1661 opname = "|"; break;
1662 case TRUTH_ANDIF_EXPR:
1663 opname = "&&"; break;
1664 case TRUTH_ORIF_EXPR:
1665 opname = "||"; break;
1667 opname = "^"; break;
1670 opname = "rotate"; break;
1672 error ("invalid operands to binary %s", opname);
1675 /* Subroutine of build_binary_op, used for comparison operations.
1676 See if the operands have both been converted from subword integer types
1677 and, if so, perhaps change them both back to their original type.
1678 This function is also responsible for converting the two operands
1679 to the proper common type for comparison.
1681 The arguments of this function are all pointers to local variables
1682 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1683 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1685 If this function returns nonzero, it means that the comparison has
1686 a constant value. What this function returns is an expression for
1690 shorten_compare (op0_ptr, op1_ptr, restype_ptr, rescode_ptr)
1691 tree *op0_ptr, *op1_ptr;
1693 enum tree_code *rescode_ptr;
1696 tree op0 = *op0_ptr;
1697 tree op1 = *op1_ptr;
1698 int unsignedp0, unsignedp1;
1700 tree primop0, primop1;
1701 enum tree_code code = *rescode_ptr;
1703 /* Throw away any conversions to wider types
1704 already present in the operands. */
1706 primop0 = get_narrower (op0, &unsignedp0);
1707 primop1 = get_narrower (op1, &unsignedp1);
1709 /* Handle the case that OP0 does not *contain* a conversion
1710 but it *requires* conversion to FINAL_TYPE. */
1712 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
1713 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
1714 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
1715 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
1717 /* If one of the operands must be floated, we cannot optimize. */
1718 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
1719 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
1721 /* If first arg is constant, swap the args (changing operation
1722 so value is preserved), for canonicalization. Don't do this if
1723 the second arg is 0. */
1725 if (TREE_CONSTANT (primop0)
1726 && ! integer_zerop (primop1) && ! real_zerop (primop1))
1728 register tree tem = primop0;
1729 register int temi = unsignedp0;
1737 unsignedp0 = unsignedp1;
1758 *rescode_ptr = code;
1761 /* If comparing an integer against a constant more bits wide,
1762 maybe we can deduce a value of 1 or 0 independent of the data.
1763 Or else truncate the constant now
1764 rather than extend the variable at run time.
1766 This is only interesting if the constant is the wider arg.
1767 Also, it is not safe if the constant is unsigned and the
1768 variable arg is signed, since in this case the variable
1769 would be sign-extended and then regarded as unsigned.
1770 Our technique fails in this case because the lowest/highest
1771 possible unsigned results don't follow naturally from the
1772 lowest/highest possible values of the variable operand.
1773 For just EQ_EXPR and NE_EXPR there is another technique that
1774 could be used: see if the constant can be faithfully represented
1775 in the other operand's type, by truncating it and reextending it
1776 and see if that preserves the constant's value. */
1778 if (!real1 && !real2
1779 && TREE_CODE (primop1) == INTEGER_CST
1780 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
1782 int min_gt, max_gt, min_lt, max_lt;
1783 tree maxval, minval;
1784 /* 1 if comparison is nominally unsigned. */
1785 int unsignedp = TREE_UNSIGNED (*restype_ptr);
1788 type = signed_or_unsigned_type (unsignedp0, TREE_TYPE (primop0));
1790 maxval = TYPE_MAX_VALUE (type);
1791 minval = TYPE_MIN_VALUE (type);
1793 if (unsignedp && !unsignedp0)
1794 *restype_ptr = signed_type (*restype_ptr);
1796 if (TREE_TYPE (primop1) != *restype_ptr)
1797 primop1 = convert (*restype_ptr, primop1);
1798 if (type != *restype_ptr)
1800 minval = convert (*restype_ptr, minval);
1801 maxval = convert (*restype_ptr, maxval);
1804 if (unsignedp && unsignedp0)
1806 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
1807 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
1808 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
1809 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
1813 min_gt = INT_CST_LT (primop1, minval);
1814 max_gt = INT_CST_LT (primop1, maxval);
1815 min_lt = INT_CST_LT (minval, primop1);
1816 max_lt = INT_CST_LT (maxval, primop1);
1820 /* This used to be a switch, but Genix compiler can't handle that. */
1821 if (code == NE_EXPR)
1823 if (max_lt || min_gt)
1824 val = boolean_true_node;
1826 else if (code == EQ_EXPR)
1828 if (max_lt || min_gt)
1829 val = boolean_false_node;
1831 else if (code == LT_EXPR)
1834 val = boolean_true_node;
1836 val = boolean_false_node;
1838 else if (code == GT_EXPR)
1841 val = boolean_true_node;
1843 val = boolean_false_node;
1845 else if (code == LE_EXPR)
1848 val = boolean_true_node;
1850 val = boolean_false_node;
1852 else if (code == GE_EXPR)
1855 val = boolean_true_node;
1857 val = boolean_false_node;
1860 /* If primop0 was sign-extended and unsigned comparison specd,
1861 we did a signed comparison above using the signed type bounds.
1862 But the comparison we output must be unsigned.
1864 Also, for inequalities, VAL is no good; but if the signed
1865 comparison had *any* fixed result, it follows that the
1866 unsigned comparison just tests the sign in reverse
1867 (positive values are LE, negative ones GE).
1868 So we can generate an unsigned comparison
1869 against an extreme value of the signed type. */
1871 if (unsignedp && !unsignedp0)
1878 primop1 = TYPE_MIN_VALUE (type);
1884 primop1 = TYPE_MAX_VALUE (type);
1888 type = unsigned_type (type);
1891 if (!max_gt && !unsignedp0 && TREE_CODE (primop0) != INTEGER_CST)
1893 /* This is the case of (char)x >?< 0x80, which people used to use
1894 expecting old C compilers to change the 0x80 into -0x80. */
1895 if (val == boolean_false_node)
1896 warning ("comparison is always 0 due to limited range of data type");
1897 if (val == boolean_true_node)
1898 warning ("comparison is always 1 due to limited range of data type");
1901 if (!min_lt && unsignedp0 && TREE_CODE (primop0) != INTEGER_CST)
1903 /* This is the case of (unsigned char)x >?< -1 or < 0. */
1904 if (val == boolean_false_node)
1905 warning ("comparison is always 0 due to limited range of data type");
1906 if (val == boolean_true_node)
1907 warning ("comparison is always 1 due to limited range of data type");
1912 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
1913 if (TREE_SIDE_EFFECTS (primop0))
1914 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
1918 /* Value is not predetermined, but do the comparison
1919 in the type of the operand that is not constant.
1920 TYPE is already properly set. */
1922 else if (real1 && real2
1923 && (TYPE_PRECISION (TREE_TYPE (primop0))
1924 == TYPE_PRECISION (TREE_TYPE (primop1))))
1925 type = TREE_TYPE (primop0);
1927 /* If args' natural types are both narrower than nominal type
1928 and both extend in the same manner, compare them
1929 in the type of the wider arg.
1930 Otherwise must actually extend both to the nominal
1931 common type lest different ways of extending
1933 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
1935 else if (unsignedp0 == unsignedp1 && real1 == real2
1936 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
1937 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
1939 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
1940 type = signed_or_unsigned_type (unsignedp0
1941 || TREE_UNSIGNED (*restype_ptr),
1943 /* Make sure shorter operand is extended the right way
1944 to match the longer operand. */
1945 primop0 = convert (signed_or_unsigned_type (unsignedp0, TREE_TYPE (primop0)),
1947 primop1 = convert (signed_or_unsigned_type (unsignedp1, TREE_TYPE (primop1)),
1952 /* Here we must do the comparison on the nominal type
1953 using the args exactly as we received them. */
1954 type = *restype_ptr;
1958 if (!real1 && !real2 && integer_zerop (primop1)
1959 && TREE_UNSIGNED (*restype_ptr))
1965 /* All unsigned values are >= 0, so we warn if extra warnings
1966 are requested. However, if OP0 is a constant that is
1967 >= 0, the signedness of the comparison isn't an issue,
1968 so suppress the warning. */
1970 && ! (TREE_CODE (primop0) == INTEGER_CST
1971 && ! TREE_OVERFLOW (convert (signed_type (type),
1973 warning ("unsigned value >= 0 is always 1");
1974 value = boolean_true_node;
1979 && ! (TREE_CODE (primop0) == INTEGER_CST
1980 && ! TREE_OVERFLOW (convert (signed_type (type),
1982 warning ("unsigned value < 0 is always 0");
1983 value = boolean_false_node;
1988 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
1989 if (TREE_SIDE_EFFECTS (primop0))
1990 return build (COMPOUND_EXPR, TREE_TYPE (value),
1997 *op0_ptr = convert (type, primop0);
1998 *op1_ptr = convert (type, primop1);
2000 *restype_ptr = boolean_type_node;
2005 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2006 or validate its data type for an `if' or `while' statement or ?..: exp.
2008 This preparation consists of taking the ordinary
2009 representation of an expression expr and producing a valid tree
2010 boolean expression describing whether expr is nonzero. We could
2011 simply always do build_binary_op (NE_EXPR, expr, boolean_false_node, 1),
2012 but we optimize comparisons, &&, ||, and !.
2014 The resulting type should always be `boolean_type_node'. */
2017 truthvalue_conversion (expr)
2020 if (TREE_CODE (expr) == ERROR_MARK)
2023 #if 0 /* This appears to be wrong for C++. */
2024 /* These really should return error_mark_node after 2.4 is stable.
2025 But not all callers handle ERROR_MARK properly. */
2026 switch (TREE_CODE (TREE_TYPE (expr)))
2029 error ("struct type value used where scalar is required");
2030 return boolean_false_node;
2033 error ("union type value used where scalar is required");
2034 return boolean_false_node;
2037 error ("array type value used where scalar is required");
2038 return boolean_false_node;
2045 switch (TREE_CODE (expr))
2047 /* It is simpler and generates better code to have only TRUTH_*_EXPR
2048 or comparison expressions as truth values at this level. */
2051 /* A one-bit unsigned bit-field is already acceptable. */
2052 if (1 == TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (expr, 1)))
2053 && TREE_UNSIGNED (TREE_OPERAND (expr, 1)))
2059 /* It is simpler and generates better code to have only TRUTH_*_EXPR
2060 or comparison expressions as truth values at this level. */
2062 if (integer_zerop (TREE_OPERAND (expr, 1)))
2063 return build_unary_op (TRUTH_NOT_EXPR, TREE_OPERAND (expr, 0), 0);
2065 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2066 case TRUTH_ANDIF_EXPR:
2067 case TRUTH_ORIF_EXPR:
2068 case TRUTH_AND_EXPR:
2070 case TRUTH_XOR_EXPR:
2071 case TRUTH_NOT_EXPR:
2072 TREE_TYPE (expr) = boolean_type_node;
2079 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
2082 return real_zerop (expr) ? boolean_false_node : boolean_true_node;
2085 /* If we are taking the address of a external decl, it might be zero
2086 if it is weak, so we cannot optimize. */
2087 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (expr, 0))) == 'd'
2088 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2091 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2092 return build (COMPOUND_EXPR, boolean_type_node,
2093 TREE_OPERAND (expr, 0), boolean_true_node);
2095 return boolean_true_node;
2098 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2099 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2100 truthvalue_conversion (TREE_OPERAND (expr, 0)),
2101 truthvalue_conversion (TREE_OPERAND (expr, 1)),
2108 /* These don't change whether an object is non-zero or zero. */
2109 return truthvalue_conversion (TREE_OPERAND (expr, 0));
2113 /* These don't change whether an object is zero or non-zero, but
2114 we can't ignore them if their second arg has side-effects. */
2115 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2116 return build (COMPOUND_EXPR, boolean_type_node, TREE_OPERAND (expr, 1),
2117 truthvalue_conversion (TREE_OPERAND (expr, 0)));
2119 return truthvalue_conversion (TREE_OPERAND (expr, 0));
2122 /* Distribute the conversion into the arms of a COND_EXPR. */
2123 return fold (build (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
2124 truthvalue_conversion (TREE_OPERAND (expr, 1)),
2125 truthvalue_conversion (TREE_OPERAND (expr, 2))));
2128 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2129 since that affects how `default_conversion' will behave. */
2130 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2131 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2133 /* fall through... */
2135 /* If this is widening the argument, we can ignore it. */
2136 if (TYPE_PRECISION (TREE_TYPE (expr))
2137 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2138 return truthvalue_conversion (TREE_OPERAND (expr, 0));
2142 /* With IEEE arithmetic, x - x may not equal 0, so we can't optimize
2144 if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT
2145 && TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE)
2147 /* fall through... */
2149 /* This and MINUS_EXPR can be changed into a comparison of the
2151 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2152 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2153 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2154 TREE_OPERAND (expr, 1), 1);
2155 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2156 fold (build1 (NOP_EXPR,
2157 TREE_TYPE (TREE_OPERAND (expr, 0)),
2158 TREE_OPERAND (expr, 1))), 1);
2161 if (integer_onep (TREE_OPERAND (expr, 1))
2162 && TREE_TYPE (expr) != boolean_type_node)
2163 /* Using convert here would cause infinite recursion. */
2164 return build1 (NOP_EXPR, boolean_type_node, expr);
2168 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2169 warning ("suggest parentheses around assignment used as truth value");
2173 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2174 return (build_binary_op
2175 ((TREE_SIDE_EFFECTS (expr)
2176 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2177 truthvalue_conversion (build_unary_op (REALPART_EXPR, expr, 0)),
2178 truthvalue_conversion (build_unary_op (IMAGPART_EXPR, expr, 0)),
2181 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2184 /* Read the rest of a #-directive from input stream FINPUT.
2185 In normal use, the directive name and the white space after it
2186 have already been read, so they won't be included in the result.
2187 We allow for the fact that the directive line may contain
2188 a newline embedded within a character or string literal which forms
2189 a part of the directive.
2191 The value is a string in a reusable buffer. It remains valid
2192 only until the next time this function is called.
2194 The terminating character ('\n' or EOF) is left in FINPUT for the
2195 caller to re-read. */
2198 get_directive_line (finput)
2199 register FILE *finput;
2201 static char *directive_buffer = NULL;
2202 static unsigned buffer_length = 0;
2204 register char *buffer_limit;
2205 register int looking_for = 0;
2206 register int char_escaped = 0;
2208 if (buffer_length == 0)
2210 directive_buffer = (char *)xmalloc (128);
2211 buffer_length = 128;
2214 buffer_limit = &directive_buffer[buffer_length];
2216 for (p = directive_buffer; ; )
2220 /* Make buffer bigger if it is full. */
2221 if (p >= buffer_limit)
2223 register unsigned bytes_used = (p - directive_buffer);
2227 = (char *)xrealloc (directive_buffer, buffer_length);
2228 p = &directive_buffer[bytes_used];
2229 buffer_limit = &directive_buffer[buffer_length];
2234 /* Discard initial whitespace. */
2235 if ((c == ' ' || c == '\t') && p == directive_buffer)
2238 /* Detect the end of the directive. */
2239 if (looking_for == 0
2240 && (c == '\n' || c == EOF))
2249 return directive_buffer;
2251 /* Handle string and character constant syntax. */
2254 if (looking_for == c && !char_escaped)
2255 looking_for = 0; /* Found terminator... stop looking. */
2258 if (c == '\'' || c == '"')
2259 looking_for = c; /* Don't stop buffering until we see another
2260 another one of these (or an EOF). */
2262 /* Handle backslash. */
2263 char_escaped = (c == '\\' && ! char_escaped);
2267 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2268 down to the element type of an array. */
2271 c_build_type_variant (type, constp, volatilep)
2273 int constp, volatilep;
2275 if (TREE_CODE (type) == ARRAY_TYPE)
2277 tree real_main_variant = TYPE_MAIN_VARIANT (type);
2279 push_obstacks (TYPE_OBSTACK (real_main_variant),
2280 TYPE_OBSTACK (real_main_variant));
2281 type = build_array_type (c_build_type_variant (TREE_TYPE (type),
2283 TYPE_DOMAIN (type));
2285 /* TYPE must be on same obstack as REAL_MAIN_VARIANT. If not,
2286 make a copy. (TYPE might have come from the hash table and
2287 REAL_MAIN_VARIANT might be in some function's obstack.) */
2289 if (TYPE_OBSTACK (type) != TYPE_OBSTACK (real_main_variant))
2291 type = copy_node (type);
2292 TYPE_POINTER_TO (type) = TYPE_REFERENCE_TO (type) = 0;
2295 TYPE_MAIN_VARIANT (type) = real_main_variant;
2298 return build_type_variant (type, constp, volatilep);