[deliverable/binutils-gdb.git] / gdb / m2-lang.c

/* Modula 2 language support routines for GDB, the GNU debugger.

   Copyright (C) 1992-2019 Free Software Foundation, Inc.

   This file is part of GDB.

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 3 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT 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
   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */

#include "defs.h"
#include "symtab.h"
#include "gdbtypes.h"
#include "expression.h"
#include "parser-defs.h"
#include "language.h"
#include "varobj.h"
#include "m2-lang.h"
#include "c-lang.h"
#include "valprint.h"
#include "gdbarch.h"

static void m2_printchar (int, struct type *, struct ui_file *);
static void m2_emit_char (int, struct type *, struct ui_file *, int);

/* Print the character C on STREAM as part of the contents of a literal
   string whose delimiter is QUOTER.  Note that that format for printing
   characters and strings is language specific.
   FIXME:  This is a copy of the same function from c-exp.y.  It should
   be replaced with a true Modula version.  */

static void
m2_emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
{

  c &= 0xFF;			/* Avoid sign bit follies.  */

  if (PRINT_LITERAL_FORM (c))
    {
      if (c == '\\' || c == quoter)
	{
	  fputs_filtered ("\\", stream);
	}
      fprintf_filtered (stream, "%c", c);
    }
  else
    {
      switch (c)
	{
	case '\n':
	  fputs_filtered ("\\n", stream);
	  break;
	case '\b':
	  fputs_filtered ("\\b", stream);
	  break;
	case '\t':
	  fputs_filtered ("\\t", stream);
	  break;
	case '\f':
	  fputs_filtered ("\\f", stream);
	  break;
	case '\r':
	  fputs_filtered ("\\r", stream);
	  break;
	case '\033':
	  fputs_filtered ("\\e", stream);
	  break;
	case '\007':
	  fputs_filtered ("\\a", stream);
	  break;
	default:
	  fprintf_filtered (stream, "\\%.3o", (unsigned int) c);
	  break;
	}
    }
}

/* FIXME:  This is a copy of the same function from c-exp.y.  It should
   be replaced with a true Modula version.  */

static void
m2_printchar (int c, struct type *type, struct ui_file *stream)
{
  fputs_filtered ("'", stream);
  LA_EMIT_CHAR (c, type, stream, '\'');
  fputs_filtered ("'", stream);
}

/* Print the character string STRING, printing at most LENGTH characters.
   Printing stops early if the number hits print_max; repeat counts
   are printed as appropriate.  Print ellipses at the end if we
   had to stop before printing LENGTH characters, or if FORCE_ELLIPSES.
   FIXME:  This is a copy of the same function from c-exp.y.  It should
   be replaced with a true Modula version.  */

static void
m2_printstr (struct ui_file *stream, struct type *type, const gdb_byte *string,
	     unsigned int length, const char *encoding, int force_ellipses,
	     const struct value_print_options *options)
{
  unsigned int i;
  unsigned int things_printed = 0;
  int in_quotes = 0;
  int need_comma = 0;

  if (length == 0)
    {
      fputs_filtered ("\"\"", gdb_stdout);
      return;
    }

  for (i = 0; i < length && things_printed < options->print_max; ++i)
    {
      /* Position of the character we are examining
         to see whether it is repeated.  */
      unsigned int rep1;
      /* Number of repetitions we have detected so far.  */
      unsigned int reps;

      QUIT;

      if (need_comma)
	{
	  fputs_filtered (", ", stream);
	  need_comma = 0;
	}

      rep1 = i + 1;
      reps = 1;
      while (rep1 < length && string[rep1] == string[i])
	{
	  ++rep1;
	  ++reps;
	}

      if (reps > options->repeat_count_threshold)
	{
	  if (in_quotes)
	    {
	      fputs_filtered ("\", ", stream);
	      in_quotes = 0;
	    }
	  m2_printchar (string[i], type, stream);
	  fprintf_filtered (stream, " <repeats %u times>", reps);
	  i = rep1 - 1;
	  things_printed += options->repeat_count_threshold;
	  need_comma = 1;
	}
      else
	{
	  if (!in_quotes)
	    {
	      fputs_filtered ("\"", stream);
	      in_quotes = 1;
	    }
	  LA_EMIT_CHAR (string[i], type, stream, '"');
	  ++things_printed;
	}
    }

  /* Terminate the quotes if necessary.  */
  if (in_quotes)
    fputs_filtered ("\"", stream);

  if (force_ellipses || i < length)
    fputs_filtered ("...", stream);
}

/* Return true if TYPE is a string.  */

static bool
m2_is_string_type_p (struct type *type)
{
  type = check_typedef (type);
  if (TYPE_CODE (type) == TYPE_CODE_ARRAY
      && TYPE_LENGTH (type) > 0
      && TYPE_LENGTH (TYPE_TARGET_TYPE (type)) > 0)
    {
      struct type *elttype = check_typedef (TYPE_TARGET_TYPE (type));

      if (TYPE_LENGTH (elttype) == 1
	  && (TYPE_CODE (elttype) == TYPE_CODE_INT
	      || TYPE_CODE (elttype) == TYPE_CODE_CHAR))
	return true;
    }

  return false;
}

static struct value *
evaluate_subexp_modula2 (struct type *expect_type, struct expression *exp,
			 int *pos, enum noside noside)
{
  enum exp_opcode op = exp->elts[*pos].opcode;
  struct value *arg1;
  struct value *arg2;
  struct type *type;

  switch (op)
    {
    case UNOP_HIGH:
      (*pos)++;
      arg1 = evaluate_subexp_with_coercion (exp, pos, noside);

      if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
	return arg1;
      else
	{
	  arg1 = coerce_ref (arg1);
	  type = check_typedef (value_type (arg1));

	  if (m2_is_unbounded_array (type))
	    {
	      struct value *temp = arg1;

	      type = TYPE_FIELD_TYPE (type, 1);
	      /* i18n: Do not translate the "_m2_high" part!  */
	      arg1 = value_struct_elt (&temp, NULL, "_m2_high", NULL,
				       _("unbounded structure "
					 "missing _m2_high field"));
	  
	      if (value_type (arg1) != type)
		arg1 = value_cast (type, arg1);
	    }
	}
      return arg1;

    case BINOP_SUBSCRIPT:
      (*pos)++;
      arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
      arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
      if (noside == EVAL_SKIP)
	goto nosideret;
      /* If the user attempts to subscript something that is not an
         array or pointer type (like a plain int variable for example),
         then report this as an error.  */

      arg1 = coerce_ref (arg1);
      type = check_typedef (value_type (arg1));

      if (m2_is_unbounded_array (type))
	{
	  struct value *temp = arg1;
	  type = TYPE_FIELD_TYPE (type, 0);
	  if (type == NULL || (TYPE_CODE (type) != TYPE_CODE_PTR))
	    {
	      warning (_("internal error: unbounded "
			 "array structure is unknown"));
	      return evaluate_subexp_standard (expect_type, exp, pos, noside);
	    }
	  /* i18n: Do not translate the "_m2_contents" part!  */
	  arg1 = value_struct_elt (&temp, NULL, "_m2_contents", NULL,
				   _("unbounded structure "
				     "missing _m2_contents field"));
	  
	  if (value_type (arg1) != type)
	    arg1 = value_cast (type, arg1);

	  check_typedef (value_type (arg1));
	  return value_ind (value_ptradd (arg1, value_as_long (arg2)));
	}
      else
	if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
	  {
	    if (TYPE_NAME (type))
	      error (_("cannot subscript something of type `%s'"),
		     TYPE_NAME (type));
	    else
	      error (_("cannot subscript requested type"));
	  }

      if (noside == EVAL_AVOID_SIDE_EFFECTS)
	return value_zero (TYPE_TARGET_TYPE (type), VALUE_LVAL (arg1));
      else
	return value_subscript (arg1, value_as_long (arg2));

    default:
      return evaluate_subexp_standard (expect_type, exp, pos, noside);
    }

 nosideret:
  return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
}
\f

/* Table of operators and their precedences for printing expressions.  */

static const struct op_print m2_op_print_tab[] =
{
  {"+", BINOP_ADD, PREC_ADD, 0},
  {"+", UNOP_PLUS, PREC_PREFIX, 0},
  {"-", BINOP_SUB, PREC_ADD, 0},
  {"-", UNOP_NEG, PREC_PREFIX, 0},
  {"*", BINOP_MUL, PREC_MUL, 0},
  {"/", BINOP_DIV, PREC_MUL, 0},
  {"DIV", BINOP_INTDIV, PREC_MUL, 0},
  {"MOD", BINOP_REM, PREC_MUL, 0},
  {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
  {"OR", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
  {"AND", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
  {"NOT", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
  {"=", BINOP_EQUAL, PREC_EQUAL, 0},
  {"<>", BINOP_NOTEQUAL, PREC_EQUAL, 0},
  {"<=", BINOP_LEQ, PREC_ORDER, 0},
  {">=", BINOP_GEQ, PREC_ORDER, 0},
  {">", BINOP_GTR, PREC_ORDER, 0},
  {"<", BINOP_LESS, PREC_ORDER, 0},
  {"^", UNOP_IND, PREC_PREFIX, 0},
  {"@", BINOP_REPEAT, PREC_REPEAT, 0},
  {"CAP", UNOP_CAP, PREC_BUILTIN_FUNCTION, 0},
  {"CHR", UNOP_CHR, PREC_BUILTIN_FUNCTION, 0},
  {"ORD", UNOP_ORD, PREC_BUILTIN_FUNCTION, 0},
  {"FLOAT", UNOP_FLOAT, PREC_BUILTIN_FUNCTION, 0},
  {"HIGH", UNOP_HIGH, PREC_BUILTIN_FUNCTION, 0},
  {"MAX", UNOP_MAX, PREC_BUILTIN_FUNCTION, 0},
  {"MIN", UNOP_MIN, PREC_BUILTIN_FUNCTION, 0},
  {"ODD", UNOP_ODD, PREC_BUILTIN_FUNCTION, 0},
  {"TRUNC", UNOP_TRUNC, PREC_BUILTIN_FUNCTION, 0},
  {NULL, OP_NULL, PREC_BUILTIN_FUNCTION, 0}
};
\f
/* The built-in types of Modula-2.  */

enum m2_primitive_types {
  m2_primitive_type_char,
  m2_primitive_type_int,
  m2_primitive_type_card,
  m2_primitive_type_real,
  m2_primitive_type_bool,
  nr_m2_primitive_types
};

static void
m2_language_arch_info (struct gdbarch *gdbarch,
		       struct language_arch_info *lai)
{
  const struct builtin_m2_type *builtin = builtin_m2_type (gdbarch);

  lai->string_char_type = builtin->builtin_char;
  lai->primitive_type_vector
    = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_m2_primitive_types + 1,
                              struct type *);

  lai->primitive_type_vector [m2_primitive_type_char]
    = builtin->builtin_char;
  lai->primitive_type_vector [m2_primitive_type_int]
    = builtin->builtin_int;
  lai->primitive_type_vector [m2_primitive_type_card]
    = builtin->builtin_card;
  lai->primitive_type_vector [m2_primitive_type_real]
    = builtin->builtin_real;
  lai->primitive_type_vector [m2_primitive_type_bool]
    = builtin->builtin_bool;

  lai->bool_type_symbol = "BOOLEAN";
  lai->bool_type_default = builtin->builtin_bool;
}

const struct exp_descriptor exp_descriptor_modula2 = 
{
  print_subexp_standard,
  operator_length_standard,
  operator_check_standard,
  op_name_standard,
  dump_subexp_body_standard,
  evaluate_subexp_modula2
};

extern const struct language_defn m2_language_defn =
{
  "modula-2",
  "Modula-2",
  language_m2,
  range_check_on,
  case_sensitive_on,
  array_row_major,
  macro_expansion_no,
  NULL,
  &exp_descriptor_modula2,
  m2_parse,			/* parser */
  null_post_parser,
  m2_printchar,			/* Print character constant */
  m2_printstr,			/* function to print string constant */
  m2_emit_char,			/* Function to print a single character */
  m2_print_type,		/* Print a type using appropriate syntax */
  m2_print_typedef,		/* Print a typedef using appropriate syntax */
  m2_val_print,			/* Print a value using appropriate syntax */
  c_value_print,		/* Print a top-level value */
  default_read_var_value,	/* la_read_var_value */
  NULL,				/* Language specific skip_trampoline */
  NULL,		                /* name_of_this */
  false,			/* la_store_sym_names_in_linkage_form_p */
  basic_lookup_symbol_nonlocal,	/* lookup_symbol_nonlocal */
  basic_lookup_transparent_type,/* lookup_transparent_type */
  NULL,				/* Language specific symbol demangler */
  NULL,
  NULL,				/* Language specific
				   class_name_from_physname */
  m2_op_print_tab,		/* expression operators for printing */
  0,				/* arrays are first-class (not c-style) */
  0,				/* String lower bound */
  default_word_break_characters,
  default_collect_symbol_completion_matches,
  m2_language_arch_info,
  default_print_array_index,
  default_pass_by_reference,
  c_watch_location_expression,
  NULL,				/* la_get_symbol_name_matcher */
  iterate_over_symbols,
  default_search_name_hash,
  &default_varobj_ops,
  NULL,
  NULL,
  m2_is_string_type_p,
  "{...}"			/* la_struct_too_deep_ellipsis */
};

static void *
build_m2_types (struct gdbarch *gdbarch)
{
  struct builtin_m2_type *builtin_m2_type
    = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct builtin_m2_type);

  /* Modula-2 "pervasive" types.  NOTE:  these can be redefined!!! */
  builtin_m2_type->builtin_int
    = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), 0, "INTEGER");
  builtin_m2_type->builtin_card
    = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), 1, "CARDINAL");
  builtin_m2_type->builtin_real
    = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch), "REAL",
		       gdbarch_float_format (gdbarch));
  builtin_m2_type->builtin_char
    = arch_character_type (gdbarch, TARGET_CHAR_BIT, 1, "CHAR");
  builtin_m2_type->builtin_bool
    = arch_boolean_type (gdbarch, gdbarch_int_bit (gdbarch), 1, "BOOLEAN");

  return builtin_m2_type;
}

static struct gdbarch_data *m2_type_data;

const struct builtin_m2_type *
builtin_m2_type (struct gdbarch *gdbarch)
{
  return (const struct builtin_m2_type *) gdbarch_data (gdbarch, m2_type_data);
}


/* Initialization for Modula-2 */

void
_initialize_m2_language (void)
{
  m2_type_data = gdbarch_data_register_post_init (build_m2_types);
}
Commit	Line	Data
c906108c	1	/* Modula 2 language support routines for GDB, the GNU debugger.
ce27fb25	2
42a4f53d	3	Copyright (C) 1992-2019 Free Software Foundation, Inc.
c906108c	4
c5aa993b	5	This file is part of GDB.
c906108c	6
c5aa993b JM	7	This program is free software; you can redistribute it and/or modify
c5aa993b JM	8	it under the terms of the GNU General Public License as published by
a9762ec7	9	the Free Software Foundation; either version 3 of the License, or
c5aa993b	10	(at your option) any later version.
c906108c	11
c5aa993b JM	12	This program is distributed in the hope that it will be useful,
	13	but WITHOUT ANY WARRANTY; without even the implied warranty of
	14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	15	GNU General Public License for more details.
c906108c	16
c5aa993b	17	You should have received a copy of the GNU General Public License
a9762ec7	18	along with this program. If not, see <http://www.gnu.org/licenses/>. */
c906108c SS	19
	20	#include "defs.h"
	21	#include "symtab.h"
	22	#include "gdbtypes.h"
	23	#include "expression.h"
	24	#include "parser-defs.h"
	25	#include "language.h"
a53b64ea	26	#include "varobj.h"
c906108c SS	27	#include "m2-lang.h"
c906108c SS	28	#include "c-lang.h"
745b8ca0	29	#include "valprint.h"
0d12e84c	30	#include "gdbarch.h"
c906108c	31
6c7a06a3 TT	32	static void m2_printchar (int, struct type , struct ui_file );
6c7a06a3 TT	33	static void m2_emit_char (int, struct type , struct ui_file , int);
c906108c SS	34
	35	/* Print the character C on STREAM as part of the contents of a literal
	36	string whose delimiter is QUOTER. Note that that format for printing
	37	characters and strings is language specific.
	38	FIXME: This is a copy of the same function from c-exp.y. It should
844781a1	39	be replaced with a true Modula version. */
c906108c SS	40
c906108c SS	41	static void
6c7a06a3	42	m2_emit_char (int c, struct type type, struct ui_file stream, int quoter)
c906108c SS	43	{
c906108c SS	44
025bb325	45	c &= 0xFF; /* Avoid sign bit follies. */
c906108c SS	46
	47	if (PRINT_LITERAL_FORM (c))
	48	{
	49	if (c == '\\' \|\| c == quoter)
	50	{
	51	fputs_filtered ("\\", stream);
	52	}
	53	fprintf_filtered (stream, "%c", c);
	54	}
	55	else
	56	{
	57	switch (c)
	58	{
	59	case '\n':
	60	fputs_filtered ("\\n", stream);
	61	break;
	62	case '\b':
	63	fputs_filtered ("\\b", stream);
	64	break;
	65	case '\t':
	66	fputs_filtered ("\\t", stream);
	67	break;
	68	case '\f':
	69	fputs_filtered ("\\f", stream);
	70	break;
	71	case '\r':
	72	fputs_filtered ("\\r", stream);
	73	break;
	74	case '\033':
	75	fputs_filtered ("\\e", stream);
	76	break;
	77	case '\007':
	78	fputs_filtered ("\\a", stream);
	79	break;
	80	default:
	81	fprintf_filtered (stream, "\\%.3o", (unsigned int) c);
	82	break;
	83	}
	84	}
	85	}
	86
	87	/* FIXME: This is a copy of the same function from c-exp.y. It should
844781a1	88	be replaced with a true Modula version. */
c906108c SS	89
c906108c SS	90	static void
6c7a06a3	91	m2_printchar (int c, struct type type, struct ui_file stream)
c906108c SS	92	{
c906108c SS	93	fputs_filtered ("'", stream);
6c7a06a3	94	LA_EMIT_CHAR (c, type, stream, '\'');
c906108c SS	95	fputs_filtered ("'", stream);
	96	}
	97
	98	/* Print the character string STRING, printing at most LENGTH characters.
	99	Printing stops early if the number hits print_max; repeat counts
	100	are printed as appropriate. Print ellipses at the end if we
	101	had to stop before printing LENGTH characters, or if FORCE_ELLIPSES.
	102	FIXME: This is a copy of the same function from c-exp.y. It should
844781a1	103	be replaced with a true Modula version. */
c906108c SS	104
c906108c SS	105	static void
6c7a06a3	106	m2_printstr (struct ui_file stream, struct type type, const gdb_byte *string,
be759fcf	107	unsigned int length, const char *encoding, int force_ellipses,
79a45b7d	108	const struct value_print_options *options)
c906108c	109	{
f86f5ca3	110	unsigned int i;
c906108c SS	111	unsigned int things_printed = 0;
	112	int in_quotes = 0;
	113	int need_comma = 0;
c906108c SS	114
	115	if (length == 0)
	116	{
	117	fputs_filtered ("\"\"", gdb_stdout);
	118	return;
	119	}
	120
79a45b7d	121	for (i = 0; i < length && things_printed < options->print_max; ++i)
c906108c SS	122	{
c906108c SS	123	/* Position of the character we are examining
c5aa993b	124	to see whether it is repeated. */
c906108c SS	125	unsigned int rep1;
	126	/* Number of repetitions we have detected so far. */
	127	unsigned int reps;
	128
	129	QUIT;
	130
	131	if (need_comma)
	132	{
	133	fputs_filtered (", ", stream);
	134	need_comma = 0;
	135	}
	136
	137	rep1 = i + 1;
	138	reps = 1;
	139	while (rep1 < length && string[rep1] == string[i])
	140	{
	141	++rep1;
	142	++reps;
	143	}
	144
79a45b7d	145	if (reps > options->repeat_count_threshold)
c906108c SS	146	{
	147	if (in_quotes)
	148	{
e93a8774	149	fputs_filtered ("\", ", stream);
c906108c SS	150	in_quotes = 0;
c906108c SS	151	}
6c7a06a3	152	m2_printchar (string[i], type, stream);
c906108c SS	153	fprintf_filtered (stream, " <repeats %u times>", reps);
c906108c SS	154	i = rep1 - 1;
79a45b7d	155	things_printed += options->repeat_count_threshold;
c906108c SS	156	need_comma = 1;
	157	}
	158	else
	159	{
	160	if (!in_quotes)
	161	{
e93a8774	162	fputs_filtered ("\"", stream);
c906108c SS	163	in_quotes = 1;
c906108c SS	164	}
6c7a06a3	165	LA_EMIT_CHAR (string[i], type, stream, '"');
c906108c SS	166	++things_printed;
	167	}
	168	}
	169
	170	/* Terminate the quotes if necessary. */
	171	if (in_quotes)
e93a8774	172	fputs_filtered ("\"", stream);
c906108c SS	173
	174	if (force_ellipses \|\| i < length)
	175	fputs_filtered ("...", stream);
	176	}
	177
4be290b2 AB	178	/* Return true if TYPE is a string. */
	179
	180	static bool
	181	m2_is_string_type_p (struct type *type)
	182	{
	183	type = check_typedef (type);
	184	if (TYPE_CODE (type) == TYPE_CODE_ARRAY
	185	&& TYPE_LENGTH (type) > 0
	186	&& TYPE_LENGTH (TYPE_TARGET_TYPE (type)) > 0)
	187	{
	188	struct type *elttype = check_typedef (TYPE_TARGET_TYPE (type));
	189
	190	if (TYPE_LENGTH (elttype) == 1
	191	&& (TYPE_CODE (elttype) == TYPE_CODE_INT
	192	\|\| TYPE_CODE (elttype) == TYPE_CODE_CHAR))
	193	return true;
	194	}
	195
	196	return false;
	197	}
	198
844781a1 GM	199	static struct value *
	200	evaluate_subexp_modula2 (struct type expect_type, struct expression exp,
	201	int *pos, enum noside noside)
	202	{
	203	enum exp_opcode op = exp->elts[*pos].opcode;
	204	struct value *arg1;
	205	struct value *arg2;
	206	struct type *type;
b8d56208	207
844781a1 GM	208	switch (op)
	209	{
	210	case UNOP_HIGH:
	211	(*pos)++;
	212	arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
	213
	214	if (noside == EVAL_SKIP \|\| noside == EVAL_AVOID_SIDE_EFFECTS)
	215	return arg1;
	216	else
	217	{
	218	arg1 = coerce_ref (arg1);
	219	type = check_typedef (value_type (arg1));
	220
	221	if (m2_is_unbounded_array (type))
	222	{
	223	struct value *temp = arg1;
b8d56208	224
844781a1 GM	225	type = TYPE_FIELD_TYPE (type, 1);
	226	/* i18n: Do not translate the "_m2_high" part! */
	227	arg1 = value_struct_elt (&temp, NULL, "_m2_high", NULL,
	228	_("unbounded structure "
	229	"missing _m2_high field"));
	230
	231	if (value_type (arg1) != type)
	232	arg1 = value_cast (type, arg1);
	233	}
	234	}
	235	return arg1;
	236
	237	case BINOP_SUBSCRIPT:
	238	(*pos)++;
	239	arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
	240	arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
	241	if (noside == EVAL_SKIP)
	242	goto nosideret;
	243	/* If the user attempts to subscript something that is not an
	244	array or pointer type (like a plain int variable for example),
	245	then report this as an error. */
	246
	247	arg1 = coerce_ref (arg1);
	248	type = check_typedef (value_type (arg1));
	249
	250	if (m2_is_unbounded_array (type))
	251	{
	252	struct value *temp = arg1;
	253	type = TYPE_FIELD_TYPE (type, 0);
b8d56208 MS	254	if (type == NULL \|\| (TYPE_CODE (type) != TYPE_CODE_PTR))
b8d56208 MS	255	{
025bb325 MS	256	warning (_("internal error: unbounded "
025bb325 MS	257	"array structure is unknown"));
b8d56208 MS	258	return evaluate_subexp_standard (expect_type, exp, pos, noside);
b8d56208 MS	259	}
844781a1 GM	260	/* i18n: Do not translate the "_m2_contents" part! */
	261	arg1 = value_struct_elt (&temp, NULL, "_m2_contents", NULL,
	262	_("unbounded structure "
	263	"missing _m2_contents field"));
	264
	265	if (value_type (arg1) != type)
	266	arg1 = value_cast (type, arg1);
	267
976aa66e	268	check_typedef (value_type (arg1));
2497b498	269	return value_ind (value_ptradd (arg1, value_as_long (arg2)));
844781a1 GM	270	}
	271	else
	272	if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
	273	{
	274	if (TYPE_NAME (type))
	275	error (_("cannot subscript something of type `%s'"),
	276	TYPE_NAME (type));
	277	else
	278	error (_("cannot subscript requested type"));
	279	}
	280
	281	if (noside == EVAL_AVOID_SIDE_EFFECTS)
	282	return value_zero (TYPE_TARGET_TYPE (type), VALUE_LVAL (arg1));
	283	else
2497b498	284	return value_subscript (arg1, value_as_long (arg2));
844781a1 GM	285
	286	default:
	287	return evaluate_subexp_standard (expect_type, exp, pos, noside);
	288	}
	289
	290	nosideret:
22601c15	291	return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
844781a1	292	}
c906108c	293	\f
c5aa993b	294
c906108c SS	295	/* Table of operators and their precedences for printing expressions. */
c906108c SS	296
c5aa993b JM	297	static const struct op_print m2_op_print_tab[] =
	298	{
	299	{"+", BINOP_ADD, PREC_ADD, 0},
	300	{"+", UNOP_PLUS, PREC_PREFIX, 0},
	301	{"-", BINOP_SUB, PREC_ADD, 0},
	302	{"-", UNOP_NEG, PREC_PREFIX, 0},
	303	{"*", BINOP_MUL, PREC_MUL, 0},
	304	{"/", BINOP_DIV, PREC_MUL, 0},
	305	{"DIV", BINOP_INTDIV, PREC_MUL, 0},
	306	{"MOD", BINOP_REM, PREC_MUL, 0},
	307	{":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
	308	{"OR", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
	309	{"AND", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
	310	{"NOT", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
	311	{"=", BINOP_EQUAL, PREC_EQUAL, 0},
	312	{"<>", BINOP_NOTEQUAL, PREC_EQUAL, 0},
	313	{"<=", BINOP_LEQ, PREC_ORDER, 0},
	314	{">=", BINOP_GEQ, PREC_ORDER, 0},
	315	{">", BINOP_GTR, PREC_ORDER, 0},
	316	{"<", BINOP_LESS, PREC_ORDER, 0},
	317	{"^", UNOP_IND, PREC_PREFIX, 0},
	318	{"@", BINOP_REPEAT, PREC_REPEAT, 0},
	319	{"CAP", UNOP_CAP, PREC_BUILTIN_FUNCTION, 0},
	320	{"CHR", UNOP_CHR, PREC_BUILTIN_FUNCTION, 0},
	321	{"ORD", UNOP_ORD, PREC_BUILTIN_FUNCTION, 0},
	322	{"FLOAT", UNOP_FLOAT, PREC_BUILTIN_FUNCTION, 0},
	323	{"HIGH", UNOP_HIGH, PREC_BUILTIN_FUNCTION, 0},
	324	{"MAX", UNOP_MAX, PREC_BUILTIN_FUNCTION, 0},
	325	{"MIN", UNOP_MIN, PREC_BUILTIN_FUNCTION, 0},
	326	{"ODD", UNOP_ODD, PREC_BUILTIN_FUNCTION, 0},
	327	{"TRUNC", UNOP_TRUNC, PREC_BUILTIN_FUNCTION, 0},
f486487f	328	{NULL, OP_NULL, PREC_BUILTIN_FUNCTION, 0}
c906108c SS	329	};
	330	\f
	331	/* The built-in types of Modula-2. */
	332
cad351d1 UW	333	enum m2_primitive_types {
	334	m2_primitive_type_char,
	335	m2_primitive_type_int,
	336	m2_primitive_type_card,
	337	m2_primitive_type_real,
	338	m2_primitive_type_bool,
	339	nr_m2_primitive_types
c906108c SS	340	};
c906108c SS	341
cad351d1 UW	342	static void
	343	m2_language_arch_info (struct gdbarch *gdbarch,
	344	struct language_arch_info *lai)
	345	{
5760b90a UW	346	const struct builtin_m2_type *builtin = builtin_m2_type (gdbarch);
	347
	348	lai->string_char_type = builtin->builtin_char;
cad351d1 UW	349	lai->primitive_type_vector
	350	= GDBARCH_OBSTACK_CALLOC (gdbarch, nr_m2_primitive_types + 1,
	351	struct type *);
	352
	353	lai->primitive_type_vector [m2_primitive_type_char]
5760b90a	354	= builtin->builtin_char;
cad351d1	355	lai->primitive_type_vector [m2_primitive_type_int]
5760b90a	356	= builtin->builtin_int;
cad351d1	357	lai->primitive_type_vector [m2_primitive_type_card]
5760b90a	358	= builtin->builtin_card;
cad351d1	359	lai->primitive_type_vector [m2_primitive_type_real]
5760b90a	360	= builtin->builtin_real;
cad351d1	361	lai->primitive_type_vector [m2_primitive_type_bool]
5760b90a	362	= builtin->builtin_bool;
fbb06eb1 UW	363
	364	lai->bool_type_symbol = "BOOLEAN";
	365	lai->bool_type_default = builtin->builtin_bool;
cad351d1 UW	366	}
cad351d1 UW	367
844781a1 GM	368	const struct exp_descriptor exp_descriptor_modula2 =
	369	{
	370	print_subexp_standard,
	371	operator_length_standard,
c0201579	372	operator_check_standard,
844781a1 GM	373	op_name_standard,
	374	dump_subexp_body_standard,
	375	evaluate_subexp_modula2
	376	};
	377
47e77640	378	extern const struct language_defn m2_language_defn =
c5aa993b	379	{
c906108c	380	"modula-2",
6abde28f	381	"Modula-2",
c906108c	382	language_m2,
c906108c	383	range_check_on,
63872f9d	384	case_sensitive_on,
7ca2d3a3	385	array_row_major,
9a044a89	386	macro_expansion_no,
56618e20	387	NULL,
844781a1	388	&exp_descriptor_modula2,
c906108c	389	m2_parse, /* parser */
e85c3284	390	null_post_parser,
c906108c SS	391	m2_printchar, /* Print character constant */
	392	m2_printstr, /* function to print string constant */
	393	m2_emit_char, /* Function to print a single character */
c906108c	394	m2_print_type, /* Print a type using appropriate syntax */
5c6ce71d	395	m2_print_typedef, /* Print a typedef using appropriate syntax */
c906108c SS	396	m2_val_print, /* Print a value using appropriate syntax */
c906108c SS	397	c_value_print, /* Print a top-level value */
a5ee536b	398	default_read_var_value, /* la_read_var_value */
f636b87d	399	NULL, /* Language specific skip_trampoline */
2b2d9e11	400	NULL, /* name_of_this */
59cc4834	401	false, /* la_store_sym_names_in_linkage_form_p */
5f9a71c3	402	basic_lookup_symbol_nonlocal, /* lookup_symbol_nonlocal */
b368761e	403	basic_lookup_transparent_type,/* lookup_transparent_type */
9a3d7dfd	404	NULL, /* Language specific symbol demangler */
8b302db8	405	NULL,
025bb325 MS	406	NULL, /* Language specific
025bb325 MS	407	class_name_from_physname */
c906108c SS	408	m2_op_print_tab, /* expression operators for printing */
	409	0, /* arrays are first-class (not c-style) */
	410	0, /* String lower bound */
6084f43a	411	default_word_break_characters,
eb3ff9a5	412	default_collect_symbol_completion_matches,
cad351d1	413	m2_language_arch_info,
e79af960	414	default_print_array_index,
41f1b697	415	default_pass_by_reference,
43cc5389	416	c_watch_location_expression,
b5ec771e	417	NULL, /* la_get_symbol_name_matcher */
f8eba3c6	418	iterate_over_symbols,
5ffa0793	419	default_search_name_hash,
a53b64ea	420	&default_varobj_ops,
bb2ec1b3	421	NULL,
721b08c6	422	NULL,
4be290b2	423	m2_is_string_type_p,
721b08c6	424	"{...}" /* la_struct_too_deep_ellipsis */
c906108c SS	425	};
c906108c SS	426
5760b90a UW	427	static void *
5760b90a UW	428	build_m2_types (struct gdbarch *gdbarch)
c906108c	429	{
5760b90a UW	430	struct builtin_m2_type *builtin_m2_type
	431	= GDBARCH_OBSTACK_ZALLOC (gdbarch, struct builtin_m2_type);
	432
c906108c	433	/* Modula-2 "pervasive" types. NOTE: these can be redefined!!! */
e9bb382b UW	434	builtin_m2_type->builtin_int
	435	= arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), 0, "INTEGER");
	436	builtin_m2_type->builtin_card
	437	= arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), 1, "CARDINAL");
	438	builtin_m2_type->builtin_real
49f190bc UW	439	= arch_float_type (gdbarch, gdbarch_float_bit (gdbarch), "REAL",
49f190bc UW	440	gdbarch_float_format (gdbarch));
e9bb382b UW	441	builtin_m2_type->builtin_char
	442	= arch_character_type (gdbarch, TARGET_CHAR_BIT, 1, "CHAR");
	443	builtin_m2_type->builtin_bool
	444	= arch_boolean_type (gdbarch, gdbarch_int_bit (gdbarch), 1, "BOOLEAN");
c906108c	445
5760b90a UW	446	return builtin_m2_type;
	447	}
	448
	449	static struct gdbarch_data *m2_type_data;
	450
	451	const struct builtin_m2_type *
	452	builtin_m2_type (struct gdbarch *gdbarch)
	453	{
9a3c8263	454	return (const struct builtin_m2_type *) gdbarch_data (gdbarch, m2_type_data);
5760b90a UW	455	}
	456
	457
	458	/* Initialization for Modula-2 */
	459
	460	void
	461	_initialize_m2_language (void)
	462	{
	463	m2_type_data = gdbarch_data_register_post_init (build_m2_types);
c906108c	464	}