1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
|
/****************************************************************************/
/* */
/* GNAT COMPILER COMPONENTS */
/* */
/* A - M I S C */
/* */
/* C Implementation File */
/* */
/* $Revision: 1.127 $ */
/* */
/* Copyright (C) 1992-1997 Free Software Foundation, Inc. */
/* */
/* GNAT is free software; you can redistribute it and/or modify it under */
/* terms of the GNU General Public License as published by the Free Soft- */
/* ware Foundation; either version 2, or (at your option) any later ver- */
/* sion. GNAT is distributed in the hope that it will be useful, but WITH- */
/* OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY */
/* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License */
/* for more details. You should have received a copy of the GNU General */
/* Public License distributed with GNAT; see file COPYING. If not, write */
/* to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, */
/* MA 02111-1307, USA. */
/* */
/* As a special exception, if you link this file with other files to */
/* produce an executable, this file does not by itself cause the resulting */
/* executable to be covered by the GNU General Public License. This except- */
/* ion does not however invalidate any other reasons why the executable */
/* file might be covered by the GNU Public License. */
/* */
/* GNAT was originally developed by the GNAT team at New York University. */
/* It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). */
/* */
/****************************************************************************/
#include "config.h"
#include <stdio.h>
#include <string.h>
#include "tree.h"
#include "rtl.h"
#include "expr.h"
#include "insn-flags.h"
#include "insn-config.h"
#include "recog.h"
#include "a-ada.h"
#include "a-types.h"
#include "a-atree.h"
#include "a-nlists.h"
#include "a-elists.h"
#include "a-sinfo.h"
#include "a-einfo.h"
#include "a-namet.h"
#include "a-string.h"
#include "a-uintp.h"
#include "a-gtran3.h"
#include "a-trans.h"
#include "a-trans3.h"
#include "a-trans4.h"
#include "a-misc.h"
#include "a-rtree.h"
#include "flags.h"
extern char *xmalloc ();
extern char *main_input_filename;
/* Tables describing GCC tree codes used only by GNAT.
Table indexed by tree code giving a string containing a character
classifying the tree code. Possibilities are
t, d, s, c, r, <, 1 and 2. See cp-tree.def for details. */
#define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
char *gnat_tree_code_type[] = {
"x",
#include "a-tree.def"
};
#undef DEFTREECODE
/* Table indexed by tree code giving number of expression
operands beyond the fixed part of the node structure.
Not used for types or decls. */
#define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
int gnat_tree_code_length[] = {
0,
#include "a-tree.def"
};
#undef DEFTREECODE
/* Names of tree components.
Used for printing out the tree and error messages. */
#define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
char *gnat_tree_code_name[] = {
"@@dummy",
#include "a-tree.def"
};
#undef DEFTREECODE
/* gnat standard argc argv */
extern int gnat_argc;
extern char **gnat_argv;
/* Global Variables Expected by gcc: */
char *language_string = "GNU Ada";
int current_function_returns_null;
int flag_traditional; /* Used by dwarfout.c. */
/* Routines Expected by gcc: */
/* For most front-ends, this is the parser for the language. For us, we
process the GNAT tree. */
int
yyparse ()
{
/* Make up what Gigi uses as a jmpbuf. */
size_t jmpbuf[10];
/* call the target specific initializations */
__gnat_initialize();
/* Call the front-end elaboration procedures */
adainit ();
/* Set up to catch unhandled exceptions. */
if (__builtin_setjmp (jmpbuf))
abort ();
system__task_specific_data__set_jmpbuf_address (jmpbuf);
immediate_size_expand = 1;
/* Call the front end */
_ada_gnat1drv ();
return 0;
}
/* init gnat_argc and gnat_argv */
void
init_gnat_args ()
{
extern int save_argc;
extern char **save_argv;
/* initialize gnat_argv with save_argv size */
gnat_argv = (char **) malloc ((save_argc + 1) * sizeof (gnat_argv[0]));
gnat_argv [0] = save_argv[0]; /* name of the command */
gnat_argc = 1;
}
/* Decode all the language specific options that cannot be decoded by GCC.
The option decoding phase of GCC calls this routine on the flags that
it cannot decode. This routine returns 1 if it is successful, otherwise
it returns 0. */
int
lang_decode_option (p)
char *p;
{
extern int save_argc;
extern char **save_argv;
int i;
if (!gnat_argc) init_gnat_args ();
if (!strncmp (p, "-I", 2))
{
/* pass the -I switches as-is */
gnat_argv[gnat_argc] = p;
gnat_argc ++;
return 1;
}
if (!strncmp (p, "-gnat", 5))
{
/* recopy the switches without the 'gnat' prefix */
gnat_argv[gnat_argc] = (char *) malloc (strlen (p) - 3);
gnat_argv[gnat_argc][0] = '-';
strcpy (gnat_argv[gnat_argc] + 1, p + 5);
gnat_argc ++;
if (p[5] == 'O')
for (i = 1; i < save_argc - 1; i++)
if (!strncmp (save_argv[i], "-gnatO", 6))
if (save_argv[++i][0] != '-')
{
/* preserve output filename as GCC doesn't save it for
GNAT */
gnat_argv[gnat_argc] = save_argv[i];
gnat_argc++;
break;
}
return 1;
}
return 0;
}
/* Perform all the initialization steps that are language-specific. */
void
lang_init ()
{
if (!gnat_argc) init_gnat_args ();
gnat_argv [gnat_argc] = input_filename; /* name of the main source */
gnat_argc++;
gnat_argv [gnat_argc] = 0; /* end of argv */
main_input_filename = input_filename;
}
/* Perform all the finalization steps that are language-specific. */
void
lang_finish ()
{}
/* Return a short string identifying this language to the debugger. */
char *
lang_identify ()
{
return "ada";
}
/* If DECL has a cleanup, build and return that cleanup here.
This is a callback called by expand_expr. */
tree
maybe_build_cleanup (decl)
tree decl;
{
/* There are no cleanups in C. */
return NULL_TREE;
}
/* Print any language-specific compilation statistics. */
void
print_lang_statistics ()
{}
/* integrate_decl_tree calls this function, but since we don't use the
DECL_LANG_SPECIFIC field, this is a no-op. */
void
copy_lang_decl (node)
tree node;
{
}
/* Hooks for print-tree.c: */
void
print_lang_decl (file, node, indent)
FILE *file;
tree node;
int indent;
{}
void
print_lang_type (file, node, indent)
FILE *file;
tree node;
int indent;
{
switch (TREE_CODE (node))
{
case FUNCTION_TYPE:
print_node (file, "ci_co_list", TYPE_CI_CO_LIST (node), indent + 4);
break;
case ENUMERAL_TYPE:
print_node (file, "RM size", TYPE_RM_SIZE_ENUM (node), indent + 4);
break;
case INTEGER_TYPE:
if (TYPE_MODULAR_P (node))
print_node (file, "modulus", TYPE_MODULUS (node), indent + 4);
else if (TYPE_HAS_ACTUAL_BOUNDS_P (node))
print_node (file, "actual bounds", TYPE_ACTUAL_BOUNDS (node),
indent + 4);
else if (TYPE_VAX_FLOATING_POINT_P (node))
;
else
print_node (file, "index type", TYPE_INDEX_TYPE (node), indent + 4);
print_node (file, "RM size", TYPE_RM_SIZE_INT (node), indent + 4);
break;
case ARRAY_TYPE:
print_node (file,"actual bounds", TYPE_ACTUAL_BOUNDS (node), indent + 4);
break;
case RECORD_TYPE:
if (TYPE_IS_FAT_POINTER_P (node) || TYPE_CONTAINS_TEMPLATE_P (node))
print_node (file, "unconstrained array",
TYPE_UNCONSTRAINED_ARRAY (node), indent + 4);
else
print_node (file, "Ada size", TYPE_ADA_SIZE (node), indent + 4);
break;
}
}
void
print_lang_identifier (file, node, indent)
FILE *file;
tree node;
int indent;
{}
/* Expands GNAT-specific GCC tree nodes. The only ones we support here are
TRANSFORM_EXPR, UNCHECKED_CONVERT_EXPR, and NULL_EXPR. */
static rtx
gnat_expand_expr (exp, target, tmode, modifier)
tree exp;
rtx target;
enum machine_mode tmode;
enum expand_modifier modifier;
{
tree type = TREE_TYPE (exp);
tree new;
rtx result;
/* Update EXP to be the new expression to expand. */
switch (TREE_CODE (exp))
{
case TRANSFORM_EXPR:
/* If we will ignore our result, just generate code. Otherwise,
expand it. */
if (target == const0_rtx || TREE_CODE (type) == VOID_TYPE)
{
gnat_to_code (TREE_COMPLEXITY (exp));
return target;
}
new = gnat_to_gnu (TREE_COMPLEXITY (exp));
/* If we were to take the address of this node, do it now. */
if (TREE_TRANSFORM_ADDR (exp))
new = build_unary_op (ADDR_EXPR, NULL_TREE, new);
/* If convert was called on this TRANSFORM_EXPR, it will now have a type,
so we must do the conversion now. */
if (type != error_mark_node)
new = convert (type, new);
break;
case UNCHECKED_CONVERT_EXPR:
/* If we're converting between an aggregate and non-aggregate type
and we have a MEM TARGET, we can't use it, since MEM_IN_STRUCT_P
would be set incorrect. */
if (target != 0 && GET_CODE (target) == MEM
&& (MEM_IN_STRUCT_P (target)
!= AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0)))))
target = 0;
/* If the input and output are both the same mode (usually BLKmode),
just return the expanded input since we want just the bits. But
we can't do this if the output is more strictly aligned than
the input. */
if (TYPE_MODE (type) == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))
&& ((TYPE_ALIGN (type)
<= TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
|| (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
>= BIGGEST_ALIGNMENT)))
new = TREE_OPERAND (exp, 0);
/* If either mode is BLKmode, memory will be involved, so do this
via pointer punning. Likewise, this doesn't work if there
is an alignment issue. But we must do it for types that are known
to be aligned properly. */
else if ((TYPE_MODE (type) == BLKmode
|| TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == BLKmode)
&& ((TYPE_ALIGN (type)
<= TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
|| (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
>= BIGGEST_ALIGNMENT)
|| TYPE_ALIGN_OK_P (type)
|| TYPE_ALIGN_OK_P (TREE_TYPE (TREE_OPERAND (exp, 0)))))
{
new = build_unary_op (INDIRECT_REF, NULL_TREE,
convert
(build_pointer_type (type),
build_unary_op (ADDR_EXPR, NULL_TREE,
TREE_OPERAND (exp, 0))));
result = expand_expr (new, target, tmode, modifier);
if (GET_CODE (result) != MEM)
gigi_abort (204);
/* Since this is really the underlying object, set the flags from
the underlying type. */
MEM_VOLATILE_P (result) = TREE_THIS_VOLATILE (TREE_OPERAND (exp, 0));
RTX_UNCHANGING_P (result) = TREE_READONLY (TREE_OPERAND (exp, 0));
MEM_IN_STRUCT_P (result)
= AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0)));
return result;
}
/* Otherwise make a union of the two types, convert to the union, and
extract the other value. */
else
{
tree in_type, union_type, in_field, out_field;
/* If this is inside the LHS of an assignment, this would generate
bad code, so abort. */
if (TREE_ADDRESSABLE (exp))
gigi_abort (202);
in_type = TREE_TYPE (TREE_OPERAND (exp, 0));
union_type = make_node (UNION_TYPE);
in_field = create_field_decl (get_identifier ("in"),
in_type, union_type, 0, 0, 0);
out_field = create_field_decl (get_identifier ("out"),
type, union_type, 0, 0, 0);
TYPE_FIELDS (union_type) = chainon (in_field, out_field);
layout_type (union_type);
/* Though this is a "union", we can treat its size as that of
the output type in case the size of the input type is variable.
If the output size is a variable, use the input size. */
TYPE_SIZE (union_type) = TYPE_SIZE (type);
if (TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST
&& TREE_CODE (TYPE_SIZE (in_type)) == INTEGER_CST)
TYPE_SIZE (union_type) = TYPE_SIZE (in_type);
new = build (COMPONENT_REF, type,
build1 (CONVERT_EXPR, union_type,
TREE_OPERAND (exp, 0)),
out_field);
}
break;
case NULL_EXPR:
expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
/* Now make a temporary RTL the same as expr.c does. For
now, don't support variable-sized objects. */
if (TYPE_MODE (type) == BLKmode || TREE_ADDRESSABLE (type))
{
int size = int_size_in_bytes (type);
rtx tem;
/* We really can't handle variable-sized objects here, but we're
not going to do anything with it, so just allocate 1 byte. */
if (size == -1)
size = 1;
tem = assign_stack_temp (TYPE_MODE (type), size, 0);
MEM_IN_STRUCT_P (tem) = AGGREGATE_TYPE_P (type);
return tem;
}
else
return gen_reg_rtx (TYPE_MODE (type));
case USE_EXPR:
if (target != const0_rtx)
gigi_abort (203);
/* First write a volatile ASM_INPUT to prevent anything from being
moved. */
result = gen_rtx (ASM_INPUT, VOIDmode, "");
MEM_VOLATILE_P (result) = 1;
emit_insn (result);
result = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode,
modifier);
emit_insn (gen_rtx (USE, VOIDmode, result));
return target;
case GNAT_NOP_EXPR:
return expand_expr (build1 (NOP_EXPR, type, TREE_OPERAND (exp, 0)),
target, tmode, modifier);
case UNCONSTRAINED_ARRAY_REF:
/* If we are evaluating just for side-effects, just evaluate our
operand. Otherwise, abort since this code should never appear
in a tree to be evaluated (objects aren't unconstrained). */
if (target == const0_rtx || TREE_CODE (type) == VOID_TYPE)
return expand_expr (TREE_OPERAND (exp, 0), const0_rtx,
VOIDmode, modifier);
/* ... fall through ... */
default:
gigi_abort (201);
}
return expand_expr (new, target, tmode, modifier);
}
/* Make a TRANSFORM_EXPR to later expand GNAT_NODE into an object
of GNU_TYPE. */
tree
make_transform_expr (gnat_node, gnu_type)
Node_Id gnat_node;
tree gnu_type;
{
tree gnu_result = build (TRANSFORM_EXPR, gnu_type);
TREE_SIDE_EFFECTS (gnu_result) = 1;
TREE_COMPLEXITY (gnu_result) = gnat_node;
return gnu_result;
}
/* Update the setjmp buffer BUF with the current stack pointer. We assume
here that a __builtin_setjmp was done to BUF. */
void
update_setjmp_buf (buf)
tree buf;
{
enum machine_mode sa_mode = Pmode;
rtx stack_save;
#ifdef HAVE_save_stack_nonlocal
if (HAVE_save_stack_nonlocal)
sa_mode = insn_operand_mode[(int) CODE_FOR_save_stack_nonlocal][0];
#endif
stack_save
= gen_rtx (MEM, sa_mode,
memory_address
(sa_mode,
plus_constant (expand_expr (build_unary_op (ADDR_EXPR,
NULL_TREE, buf),
NULL_RTX, VOIDmode, 0),
2 * GET_MODE_SIZE (Pmode))));
#ifdef HAVE_setjmp
if (HAVE_setjmp)
emit_insn (gen_setjmp ());
#endif
emit_stack_save (SAVE_NONLOCAL, &stack_save, NULL_RTX);
}
/* Record the current code position in GNAT_NODE. */
void
record_code_position (gnat_node)
Node_Id gnat_node;
{
if (global_bindings_p ())
save_gnu_tree (gnat_node, get_elaboration_location (), 1);
else
/* Always emit another insn in case marking the last insn
addressable needs some fixups. */
save_gnu_tree (gnat_node,
(tree) emit_note (NULL_PTR, NOTE_INSN_DELETED), 1);
}
/* Insert the code for GNAT_NODE at the position saved for that node. */
void
insert_code_for (gnat_node)
Node_Id gnat_node;
{
if (global_bindings_p ())
{
push_pending_elaborations ();
gnat_to_code (gnat_node);
insert_elaboration_list (get_gnu_tree (gnat_node));
pop_pending_elaborations ();
}
else
{
rtx insns;
start_sequence ();
mark_all_temps_used ();
gnat_to_code (gnat_node);
insns = get_insns ();
end_sequence ();
emit_insns_after (insns, (rtx) get_gnu_tree (gnat_node));
}
}
/* Performs whatever initialization steps needed by the language-dependent
lexical analyzer.
Define the additional tree codes here. This isn't the best place to put
it, but it's where g++ does it. */
void
init_lex ()
{
lang_expand_expr = gnat_expand_expr;
tree_code_type
= (char **) realloc (tree_code_type,
sizeof (char *) * LAST_GNAT_TREE_CODE);
tree_code_length
= (int *) realloc (tree_code_length,
sizeof (int) * LAST_GNAT_TREE_CODE);
tree_code_name
= (char **) realloc (tree_code_name,
sizeof (char *) * LAST_GNAT_TREE_CODE);
bcopy ((char *) gnat_tree_code_type,
(char *) (tree_code_type + (int) LAST_AND_UNUSED_TREE_CODE),
((LAST_GNAT_TREE_CODE - (int) LAST_AND_UNUSED_TREE_CODE)
* sizeof (char *)));
bcopy ((char *)gnat_tree_code_length,
(char *) (tree_code_length + (int) LAST_AND_UNUSED_TREE_CODE),
((LAST_GNAT_TREE_CODE - (int) LAST_AND_UNUSED_TREE_CODE)
* sizeof (int)));
bcopy ((char *) gnat_tree_code_name,
(char *) (tree_code_name + (int) LAST_AND_UNUSED_TREE_CODE),
((LAST_GNAT_TREE_CODE - (int) LAST_AND_UNUSED_TREE_CODE)
* sizeof (char *)));
}
/* Sets some debug flags for the parsed. It does nothing here. */
void
set_yydebug (value)
int value;
{}
/* Override the regular abort to call gigi_abort since it gives more useful
crash error messages. If abort is a macro, we can't do this. */
#ifndef abort
void
abort ()
{
gigi_abort (999);
}
#endif
/* Return the alignment for GNAT_TYPE. */
int
get_type_alignment (gnat_type)
Entity_Id gnat_type;
{
return TYPE_ALIGN (gnat_to_gnu_type (gnat_type)) / BITS_PER_UNIT;
}
/* GNU_TYPE is a type. Determine if it should be passed by reference by
default. */
int
default_pass_by_ref (gnu_type)
tree gnu_type;
{
/* We pass aggregates by reference if they are sufficiently large.
The choice of constant here is somewhat arbitrary. */
return (AGGREGATE_TYPE_P (gnu_type)
&& (TREE_CODE (TYPE_SIZE (gnu_type)) != INTEGER_CST
|| TREE_INT_CST_HIGH (TYPE_SIZE (gnu_type)) != 0
|| (TREE_INT_CST_LOW (TYPE_SIZE (gnu_type))
> (HOST_WIDE_INT) 8 * BITS_PER_WORD)
|| TREE_OVERFLOW (TYPE_SIZE (gnu_type))));
}
/* GNU_TYPE is the type of a subprogram parameter. Determine from the type if
it should be passed by reference. */
int
must_pass_by_ref (gnu_type)
tree gnu_type;
{
/* We pass only unconstrained objects, those required by the language
to be passed by reference, and objects of variable size. The latter
is more efficient, avoids problems with variable size temporaries,
and does not produce compatibility problems with C, since C does
not have such objects. */
return (TREE_CODE (gnu_type) == UNCONSTRAINED_ARRAY_TYPE
|| (AGGREGATE_TYPE_P (gnu_type) && TYPE_BY_REFERENCE_P (gnu_type))
|| (TYPE_SIZE (gnu_type) != 0
&& TREE_CODE (TYPE_SIZE (gnu_type)) != INTEGER_CST));
}
|