mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-01-09 17:25:13 +08:00
987009bf0d
1999-08-25 22:10 -0700 Zack Weinberg <zack@bitmover.com> * system.h: Don't redefine abort or trim_filename. * rtl.h: Define abort to fancy_abort (__FILE__, __LINE__, 0) or fancy_abort (__FILE__, __LINE__, __FUNCTION__) depending on whether or not __FUNCTION__ is available. * tree.h: Duplicate rtl.h's definition of abort, for files that don't include rtl.h. Delete all code to perform type checking with a compiler other than GCC. * varray.h: Delete all code to perform type checking with a compiler other than GCC. Make VARRAY_CHECK() always evaluate its arguments exactly once, using a statement expression. Adjust the VARRAY_<type> accessor macros to match. * toplev.h (fatal_insn, fatal_insn_not_found): Kill. (_fatal_insn, _fatal_insn_not_found): New fns, take info on caller's location. Define fatal_insn and fatal_insn_not_found as macros that use _fatal_insn and _fatal_insn_not_found. (fancy_abort, trim_filename): Kill prototypes. * rtl.c (trim_filename): Move here from toplev.c. (fancy_abort): New function. (DIR_SEPARATOR): Provide default definition. * tree.c (tree_check_failed, tree_class_check_failed): Go through fancy_abort. (tree_check, tree_class_check, cst_or_constructor_check, expr_check): Delete. * varray.c (varray_check_failed): New function. * toplev.c (fatal_insn, fatal_insn_not_found): Replace with _fatal_insn and _fatal_insn_not_found. Go through fancy_abort. (trim_filename, fancy_abort): Delete. * builtins.c (expand_builtin_args_info): Report ICE with abort. * except.c (start_catch_handler): Report ICE with error/abort combo. * final.c (output_operand_lossage): Likewise. * flow.c (verify_flow_info): Likewise. * gcc.c: Prototype fatal. * gengenrtl.c: Undef abort after including rtl.h not system.h. * genattr.c, genattrtab.c, genemit.c, genextract.c, genflags.c, genopinit.c, genoutput.c, genpeep.c, genrecog.c: Don't define fancy_abort. From-SVN: r28889
203 lines
7.2 KiB
C
203 lines
7.2 KiB
C
/* Virtual array support.
|
|
Copyright (C) 1998 Free Software Foundation, Inc.
|
|
Contributed by Cygnus Solutions.
|
|
|
|
This file is part of GNU CC.
|
|
|
|
GNU CC 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 2, or (at your option)
|
|
any later version.
|
|
|
|
GNU CC 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 GNU CC; see the file COPYING. If not, write to the Free
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
#ifndef _VARRAY_H_
|
|
#define _VARRAY_H_
|
|
|
|
#ifndef HOST_WIDE_INT
|
|
#include "machmode.h"
|
|
#endif
|
|
|
|
#ifndef __GCC_SYSTEM_H__
|
|
#include "system.h"
|
|
#endif
|
|
|
|
/* Auxiliary structure used inside the varray structure, used for
|
|
function integration data. */
|
|
|
|
struct const_equiv_data {
|
|
/* Map pseudo reg number in calling function to equivalent constant. We
|
|
cannot in general substitute constants into parameter pseudo registers,
|
|
since some machine descriptions (many RISCs) won't always handle
|
|
the resulting insns. So if an incoming parameter has a constant
|
|
equivalent, we record it here, and if the resulting insn is
|
|
recognizable, we go with it.
|
|
|
|
We also use this mechanism to convert references to incoming arguments
|
|
and stacked variables. copy_rtx_and_substitute will replace the virtual
|
|
incoming argument and virtual stacked variables registers with new
|
|
pseudos that contain pointers into the replacement area allocated for
|
|
this inline instance. These pseudos are then marked as being equivalent
|
|
to the appropriate address and substituted if valid. */
|
|
rtx rtx;
|
|
|
|
/* Record the valid age for each entry. The entry is invalid if its
|
|
age is less than const_age. */
|
|
unsigned age;
|
|
};
|
|
|
|
/* Union of various array types that are used. */
|
|
typedef union varray_data_tag {
|
|
char c[1];
|
|
unsigned char uc[1];
|
|
short s[1];
|
|
unsigned short us[1];
|
|
int i[1];
|
|
unsigned int u[1];
|
|
long l[1];
|
|
unsigned long ul[1];
|
|
HOST_WIDE_INT hint[1];
|
|
unsigned HOST_WIDE_INT uhint[1];
|
|
GENERIC_PTR generic[1];
|
|
char *cptr[1];
|
|
struct rtx_def *rtx[1];
|
|
struct rtvec_def *rtvec[1];
|
|
union tree_node *tree[1];
|
|
struct bitmap_head_def *bitmap[1];
|
|
struct sched_info_tag *sched[1];
|
|
struct reg_info_def *reg[1];
|
|
struct const_equiv_data const_equiv[1];
|
|
struct basic_block_def *bb[1];
|
|
} varray_data;
|
|
|
|
/* Virtual array of pointers header. */
|
|
typedef struct varray_head_tag {
|
|
size_t num_elements; /* maximum element number allocated */
|
|
size_t element_size; /* size of each data element */
|
|
const char *name; /* name of the varray for reporting errors */
|
|
varray_data data; /* data elements follow, must be last */
|
|
} *varray_type;
|
|
|
|
/* Allocate a virtual array with NUM elements, each of which is SIZE bytes
|
|
long, named NAME. Array elements are zeroed. */
|
|
extern varray_type varray_init PROTO ((size_t, size_t, const char *));
|
|
|
|
#define VARRAY_CHAR_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (char), name)
|
|
|
|
#define VARRAY_UCHAR_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (unsigned char), name)
|
|
|
|
#define VARRAY_SHORT_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (short), name)
|
|
|
|
#define VARRAY_USHORT_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (unsigned short), name)
|
|
|
|
#define VARRAY_INT_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (int), name)
|
|
|
|
#define VARRAY_UINT_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (unsigned int), name)
|
|
|
|
#define VARRAY_LONG_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (long), name)
|
|
|
|
#define VARRAY_ULONG_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (unsigned long), name)
|
|
|
|
#define VARRAY_WIDE_INT_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (HOST_WIDE_INT), name)
|
|
|
|
#define VARRAY_UWIDE_INT_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (unsigned HOST_WIDE_INT), name)
|
|
|
|
#define VARRAY_GENERIC_PTR_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (GENERIC_PTR), name)
|
|
|
|
#define VARRAY_CHAR_PTR_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (char *), name)
|
|
|
|
#define VARRAY_RTX_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (struct rtx_def *), name)
|
|
|
|
#define VARRAY_RTVEC_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (struct rtvec_def), name)
|
|
|
|
#define VARRAY_TREE_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (union tree_node *), name)
|
|
|
|
#define VARRAY_BITMAP_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (struct bitmap_head_def *), name)
|
|
|
|
#define VARRAY_SCHED_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (struct sched_info_tag *), name)
|
|
|
|
#define VARRAY_REG_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (struct reg_info_def *), name)
|
|
|
|
#define VARRAY_CONST_EQUIV_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (struct const_equiv_data), name)
|
|
|
|
#define VARRAY_BB_INIT(va, num, name) \
|
|
va = varray_init (num, sizeof (struct basic_block_def *), name)
|
|
|
|
/* Free up memory allocated by the virtual array, but do not free any of the
|
|
elements involved. */
|
|
#define VARRAY_FREE(vp) \
|
|
do { if (vp) { free (vp); vp = (varray_type)0; } } while (0)
|
|
|
|
/* Grow/shrink the virtual array VA to N elements. */
|
|
extern varray_type varray_grow PROTO((varray_type, size_t));
|
|
|
|
#define VARRAY_GROW(VA, N) ((VA) = varray_grow (VA, N))
|
|
|
|
#define VARRAY_SIZE(VA) ((VA)->num_elements)
|
|
|
|
/* Check for VARRAY_xxx macros being in bound. */
|
|
#if defined ENABLE_CHECKING && (__GNUC__ > 2 || __GNUC_MINOR__ > 6)
|
|
extern void varray_check_failed PROTO ((varray_type, size_t,
|
|
const char *, int,
|
|
const char *)) ATTRIBUTE_NORETURN;
|
|
#define VARRAY_CHECK(VA, N, T) \
|
|
(*({ varray_type _va = VA; \
|
|
size_t _n = N; \
|
|
if (_n >= _va->num_elements) \
|
|
varray_check_failed (_va, _n, __FILE__, __LINE__, \
|
|
__PRETTY_FUNCTION__); \
|
|
&_va->data.T[_n]; }))
|
|
#else
|
|
#define VARRAY_CHECK(VA, N, T) ((VA)->data.T[N])
|
|
#endif
|
|
|
|
#define VARRAY_CHAR(VA, N) VARRAY_CHECK (VA, N, c)
|
|
#define VARRAY_UCHAR(VA, N) VARRAY_CHECK (VA, N, uc)
|
|
#define VARRAY_SHORT(VA, N) VARRAY_CHECK (VA, N, s)
|
|
#define VARRAY_USHORT(VA, N) VARRAY_CHECK (VA, N, us)
|
|
#define VARRAY_INT(VA, N) VARRAY_CHECK (VA, N, i)
|
|
#define VARRAY_UINT(VA, N) VARRAY_CHECK (VA, N, u)
|
|
#define VARRAY_LONG(VA, N) VARRAY_CHECK (VA, N, l)
|
|
#define VARRAY_ULONG(VA, N) VARRAY_CHECK (VA, N, ul)
|
|
#define VARRAY_WIDE_INT(VA, N) VARRAY_CHECK (VA, N, hint)
|
|
#define VARRAY_UWIDE_INT(VA, N) VARRAY_CHECK (VA, N, uhint)
|
|
#define VARRAY_GENERIC_PTR(VA,N) VARRAY_CHECK (VA, N, generic)
|
|
#define VARRAY_CHAR_PTR(VA,N) VARRAY_CHECK (VA, N, cptr)
|
|
#define VARRAY_RTX(VA, N) VARRAY_CHECK (VA, N, rtx)
|
|
#define VARRAY_RTVEC(VA, N) VARRAY_CHECK (VA, N, rtvec)
|
|
#define VARRAY_TREE(VA, N) VARRAY_CHECK (VA, N, tree)
|
|
#define VARRAY_BITMAP(VA, N) VARRAY_CHECK (VA, N, bitmap)
|
|
#define VARRAY_SCHED(VA, N) VARRAY_CHECK (VA, N, sched)
|
|
#define VARRAY_REG(VA, N) VARRAY_CHECK (VA, N, reg)
|
|
#define VARRAY_CONST_EQUIV(VA, N) VARRAY_CHECK (VA, N, const_equiv)
|
|
#define VARRAY_BB(VA, N) VARRAY_CHECK (VA, N, bb)
|
|
|
|
#endif /* _VARRAY_H_ */
|