|
|
1.1 root 1: /* Machine mode definitions for GNU C-Compiler; included by rtl.h and tree.h.
2: Copyright (C) 1991, 1993 Free Software Foundation, Inc.
3:
4: This file is part of GNU CC.
5:
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)
9: any later version.
10:
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.
15:
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, 675 Mass Ave, Cambridge, MA 02139, USA. */
19:
20:
21: /* Add prototype support. */
22: #ifndef PROTO
23: #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
24: #define PROTO(ARGS) ARGS
25: #else
26: #define PROTO(ARGS) ()
27: #endif
28: #endif
29:
30: #ifndef HAVE_MACHINE_MODES
31:
32: /* Strictly speaking, this isn't the proper place to include these definitions,
33: but this file is included by every GCC file.
34:
35: Some systems define these in, e.g., param.h. We undefine these names
36: here to avoid the warnings. We prefer to use our definitions since we
37: know they are correct. */
38:
39: #undef MIN
40: #undef MAX
41:
42: #define MIN(X,Y) ((X) < (Y) ? (X) : (Y))
43: #define MAX(X,Y) ((X) > (Y) ? (X) : (Y))
44:
45: /* Find the largest host integer type and set its size and type. */
46:
47: #ifndef HOST_BITS_PER_WIDE_INT
48:
49: #if HOST_BITS_PER_LONG > HOST_BITS_PER_INT
50: #define HOST_BITS_PER_WIDE_INT HOST_BITS_PER_LONG
51: #define HOST_WIDE_INT long
52: #else
53: #define HOST_BITS_PER_WIDE_INT HOST_BITS_PER_INT
54: #define HOST_WIDE_INT int
55: #endif
56:
57: #endif
58:
59: /* Define the number of entries in an 8-bit `shorts' array needed to represent
60: the largest supported constant, which is twice the width of the largest
61: host integer type. */
62:
63: #ifndef MAX_SHORTS
64: #define MAX_SHORTS (HOST_BITS_PER_WIDE_INT * 2 / 8)
65: #endif
66:
67: /* Provide a default way to print an address in hex via printf. */
68:
69: #ifndef HOST_PTR_PRINTF
70: #define HOST_PTR_PRINTF sizeof (int) == sizeof (char *) ? "%x" : "%lx"
71: #endif
72:
73: /* Make an enum class that gives all the machine modes. */
74:
75: #define DEF_MACHMODE(SYM, NAME, TYPE, SIZE, UNIT, WIDER) SYM,
76:
77: enum machine_mode {
78: #include "machmode.def"
79:
80: #ifdef EXTRA_CC_MODES
81: EXTRA_CC_MODES,
82: #endif
83: MAX_MACHINE_MODE };
84:
85: #undef DEF_MACHMODE
86:
87: #define HAVE_MACHINE_MODES
88:
89: #ifndef NUM_MACHINE_MODES
90: #define NUM_MACHINE_MODES (int) MAX_MACHINE_MODE
91: #endif
92:
93: /* Get the name of mode MODE as a string. */
94:
95: extern char *mode_name[];
96: #define GET_MODE_NAME(MODE) (mode_name[(int)(MODE)])
97:
98: enum mode_class { MODE_RANDOM, MODE_INT, MODE_FLOAT, MODE_PARTIAL_INT, MODE_CC,
99: MODE_COMPLEX_INT, MODE_COMPLEX_FLOAT, MAX_MODE_CLASS};
100:
101: /* Get the general kind of object that mode MODE represents
102: (integer, floating, complex, etc.) */
103:
104: extern enum mode_class mode_class[];
105: #define GET_MODE_CLASS(MODE) (mode_class[(int)(MODE)])
106:
107: /* Nonzero if MODE is an integral mode. */
108: #define INTEGRAL_MODE_P(MODE) \
109: (GET_MODE_CLASS (MODE) == MODE_INT \
110: || GET_MODE_CLASS (MODE) == MODE_PARTIAL_INT \
111: || GET_MODE_CLASS (MODE) == MODE_COMPLEX_INT)
112:
113: /* Nonzero if MODE is a floating-point mode. */
114: #define FLOAT_MODE_P(MODE) \
115: (GET_MODE_CLASS (MODE) == MODE_FLOAT \
116: || GET_MODE_CLASS (MODE) == MODE_COMPLEX_FLOAT)
117:
118: /* Get the size in bytes of an object of mode MODE. */
119:
120: extern int mode_size[];
121: #define GET_MODE_SIZE(MODE) (mode_size[(int)(MODE)])
122:
123: /* Get the size in bytes of the basic parts of an object of mode MODE. */
124:
125: extern int mode_unit_size[];
126: #define GET_MODE_UNIT_SIZE(MODE) (mode_unit_size[(int)(MODE)])
127:
128: /* Get the number of units in the object. */
129:
130: #define GET_MODE_NUNITS(MODE) \
131: ((GET_MODE_UNIT_SIZE ((MODE)) == 0) ? 0 \
132: : (GET_MODE_SIZE ((MODE)) / GET_MODE_UNIT_SIZE ((MODE))))
133:
134: /* Get the size in bits of an object of mode MODE. */
135:
136: #define GET_MODE_BITSIZE(MODE) (BITS_PER_UNIT * mode_size[(int)(MODE)])
137:
138: /* Get a bitmask containing 1 for all bits in a word
139: that fit within mode MODE. */
140:
141: #define GET_MODE_MASK(MODE) \
142: ((GET_MODE_BITSIZE (MODE) >= HOST_BITS_PER_WIDE_INT) \
143: ?(HOST_WIDE_INT) ~0 : (((HOST_WIDE_INT) 1 << GET_MODE_BITSIZE (MODE)) - 1))
144:
145: /* Get the next wider natural mode (eg, QI -> HI -> SI -> DI -> TI). */
146:
147: extern enum machine_mode mode_wider_mode[];
148: #define GET_MODE_WIDER_MODE(MODE) (mode_wider_mode[(int)(MODE)])
149:
150: /* Return the mode for data of a given size SIZE and mode class CLASS.
151: If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
152: The value is BLKmode if no other mode is found. */
153:
154: extern enum machine_mode mode_for_size PROTO((unsigned int, enum mode_class, int));
155:
156: /* Find the best mode to use to access a bit field. */
157:
158: extern enum machine_mode get_best_mode PROTO((int, int, int, enum machine_mode, int));
159:
160: /* Determine alignment, 1<=result<=BIGGEST_ALIGNMENT. */
161:
162: #define GET_MODE_ALIGNMENT(MODE) \
163: MIN (BIGGEST_ALIGNMENT, \
164: MAX (1, (GET_MODE_UNIT_SIZE (MODE) * BITS_PER_UNIT)))
165:
166: /* For each class, get the narrowest mode in that class. */
167:
168: extern enum machine_mode class_narrowest_mode[];
169: #define GET_CLASS_NARROWEST_MODE(CLASS) class_narrowest_mode[(int)(CLASS)]
170:
171: /* Define the integer modes whose sizes are BITS_PER_UNIT
172: and BITS_PER_WORD. */
173:
174: extern enum machine_mode byte_mode;
175: extern enum machine_mode word_mode;
176:
177: #endif /* not HAVE_MACHINE_MODES */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.