1 |
102 |
dgisselq |
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/config.sub gcc-5.3.0-zip/config.sub
|
2 |
|
|
--- gcc-5.3.0-original/config.sub 2015-01-02 04:30:21.000000000 -0500
|
3 |
|
|
+++ gcc-5.3.0-zip/config.sub 2016-01-30 12:27:56.023073747 -0500
|
4 |
|
|
@@ -316,7 +316,7 @@
|
5 |
|
|
| visium \
|
6 |
|
|
| we32k \
|
7 |
|
|
| x86 | xc16x | xstormy16 | xtensa \
|
8 |
|
|
- | z8k | z80)
|
9 |
|
|
+ | z8k | z80 | zip)
|
10 |
|
|
basic_machine=$basic_machine-unknown
|
11 |
|
|
;;
|
12 |
|
|
c54x)
|
13 |
|
|
@@ -1547,6 +1547,9 @@
|
14 |
|
|
# system, and we'll never get to this point.
|
15 |
|
|
|
16 |
|
|
case $basic_machine in
|
17 |
|
|
+ zip-*)
|
18 |
|
|
+ os=-elf
|
19 |
|
|
+ ;;
|
20 |
|
|
score-*)
|
21 |
|
|
os=-elf
|
22 |
|
|
;;
|
23 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/configure gcc-5.3.0-zip/configure
|
24 |
|
|
--- gcc-5.3.0-original/configure 2015-05-03 13:29:57.000000000 -0400
|
25 |
|
|
+++ gcc-5.3.0-zip/configure 2016-01-30 16:19:48.264867231 -0500
|
26 |
|
|
@@ -3927,6 +3927,8 @@
|
27 |
|
|
vax-*-*)
|
28 |
|
|
noconfigdirs="$noconfigdirs target-newlib target-libgloss"
|
29 |
|
|
;;
|
30 |
|
|
+ zip*)
|
31 |
|
|
+ noconfigdirs="$noconfigdirs target-libffi target-boehm-gc gdb gprof"
|
32 |
|
|
esac
|
33 |
|
|
|
34 |
|
|
# If we aren't building newlib, then don't build libgloss, since libgloss
|
35 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/configure.ac gcc-5.3.0-zip/configure.ac
|
36 |
|
|
--- gcc-5.3.0-original/configure.ac 2015-05-03 13:29:57.000000000 -0400
|
37 |
|
|
+++ gcc-5.3.0-zip/configure.ac 2016-02-12 10:47:23.847194843 -0500
|
38 |
|
|
@@ -1274,6 +1274,10 @@
|
39 |
|
|
vax-*-*)
|
40 |
|
|
noconfigdirs="$noconfigdirs target-newlib target-libgloss"
|
41 |
|
|
;;
|
42 |
|
|
+ zip*)
|
43 |
|
|
+ noconfigdirs="$noconfigdirs target-libffi target-boehm-gc gdb gprof"
|
44 |
|
|
+ unsupported_languages="$unsupported_languages fortran java"
|
45 |
|
|
+ ;;
|
46 |
|
|
esac
|
47 |
|
|
|
48 |
|
|
# If we aren't building newlib, then don't build libgloss, since libgloss
|
49 |
117 |
dgisselq |
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/cfgexpand.c gcc-5.3.0-zip/gcc/cfgexpand.c
|
50 |
|
|
--- gcc-5.3.0-original/gcc/cfgexpand.c 2015-07-23 06:39:26.000000000 -0400
|
51 |
|
|
+++ gcc-5.3.0-zip/gcc/cfgexpand.c 2016-04-01 06:40:17.288326711 -0400
|
52 |
|
|
@@ -108,6 +108,14 @@
|
53 |
|
|
#include "tree-chkp.h"
|
54 |
|
|
#include "rtl-chkp.h"
|
55 |
|
|
|
56 |
|
|
+#ifdef DO_ZIP_DEBUGS
|
57 |
|
|
+#include <stdio.h>
|
58 |
|
|
+#define ZIP_DEBUG_LINE(STR,RTX) do{fprintf(stderr,"%s:%d/%s\n",__FILE__,__LINE__,STR); zip_debug_rtx(RTX);} while(0)
|
59 |
|
|
+extern void zip_debug_rtx(const_rtx);
|
60 |
|
|
+#else
|
61 |
|
|
+#define ZIP_DEBUG_LINE(STR,RTX)
|
62 |
|
|
+#endif
|
63 |
|
|
+
|
64 |
|
|
/* Some systems use __main in a way incompatible with its use in gcc, in these
|
65 |
|
|
cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
|
66 |
|
|
give the same symbol without quotes for an alternative entry point. You
|
67 |
111 |
dgisselq |
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/cgraphbuild.c gcc-5.3.0-zip/gcc/cgraphbuild.c
|
68 |
|
|
--- gcc-5.3.0-original/gcc/cgraphbuild.c 2015-01-09 15:18:42.000000000 -0500
|
69 |
|
|
+++ gcc-5.3.0-zip/gcc/cgraphbuild.c 2016-03-24 22:13:24.815287808 -0400
|
70 |
|
|
@@ -62,6 +62,13 @@
|
71 |
|
|
#include "ipa-prop.h"
|
72 |
|
|
#include "ipa-inline.h"
|
73 |
|
|
|
74 |
|
|
+#ifdef DO_ZIP_DEBUGS
|
75 |
|
|
+extern void zip_debug_rtx(const_rtx);
|
76 |
|
|
+#define ZIP_DEBUG_LINE(STR,RTX) do { fprintf(stderr, "%s:%d/%s\n", __FILE__,__LINE__,STR); zip_debug_rtx(RTX); } while(0)
|
77 |
|
|
+#else
|
78 |
|
|
+#define ZIP_DEBUG_LINE(STR,RTX)
|
79 |
|
|
+#endif
|
80 |
|
|
+
|
81 |
|
|
/* Context of record_reference. */
|
82 |
|
|
struct record_reference_ctx
|
83 |
|
|
{
|
84 |
102 |
dgisselq |
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/common/config/zip/zip-common.c gcc-5.3.0-zip/gcc/common/config/zip/zip-common.c
|
85 |
|
|
--- gcc-5.3.0-original/gcc/common/config/zip/zip-common.c 1969-12-31 19:00:00.000000000 -0500
|
86 |
|
|
+++ gcc-5.3.0-zip/gcc/common/config/zip/zip-common.c 2016-02-14 00:54:31.821055716 -0500
|
87 |
|
|
@@ -0,0 +1,52 @@
|
88 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
89 |
|
|
+//
|
90 |
|
|
+// Filename: common/config/zip/zip-common.c
|
91 |
|
|
+//
|
92 |
|
|
+// Project: Zip CPU backend for the GNU Compiler Collection
|
93 |
|
|
+//
|
94 |
|
|
+// Purpose: To eliminate the frame register automatically.
|
95 |
|
|
+//
|
96 |
|
|
+// Creator: Dan Gisselquist, Ph.D.
|
97 |
|
|
+// Gisselquist Technology, LLC
|
98 |
|
|
+//
|
99 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
100 |
|
|
+//
|
101 |
|
|
+// Copyright (C) 2016, Gisselquist Technology, LLC
|
102 |
|
|
+//
|
103 |
|
|
+// This program is free software (firmware): you can redistribute it and/or
|
104 |
|
|
+// modify it under the terms of the GNU General Public License as published
|
105 |
|
|
+// by the Free Software Foundation, either version 3 of the License, or (at
|
106 |
|
|
+// your option) any later version.
|
107 |
|
|
+//
|
108 |
|
|
+// This program is distributed in the hope that it will be useful, but WITHOUT
|
109 |
|
|
+// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
|
110 |
|
|
+// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
111 |
|
|
+// for more details.
|
112 |
|
|
+//
|
113 |
|
|
+// You should have received a copy of the GNU General Public License along
|
114 |
|
|
+// with this program. (It's in the $(ROOT)/doc directory, run make with no
|
115 |
|
|
+// target there if the PDF file isn't present.) If not, see
|
116 |
|
|
+// <http://www.gnu.org/licenses/> for a copy.
|
117 |
|
|
+//
|
118 |
|
|
+// License: GPL, v3, as defined and found on www.gnu.org,
|
119 |
|
|
+// http://www.gnu.org/licenses/gpl.html
|
120 |
|
|
+//
|
121 |
|
|
+//
|
122 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
123 |
|
|
+#include "config.h"
|
124 |
|
|
+#include "system.h"
|
125 |
|
|
+#include "coretypes.h"
|
126 |
|
|
+#include "tm.h"
|
127 |
|
|
+#include "common/common-target.h"
|
128 |
|
|
+#include "common/common-target-def.h"
|
129 |
|
|
+
|
130 |
|
|
+static const struct default_options zip_option_optimization_table[] =
|
131 |
|
|
+ {
|
132 |
|
|
+ { OPT_LEVELS_1_PLUS, OPT_fomit_frame_pointer, NULL, 1 },
|
133 |
|
|
+ { OPT_LEVELS_NONE, 0, NULL, 0 }
|
134 |
|
|
+ };
|
135 |
|
|
+
|
136 |
|
|
+#undef TARGET_OPTION_OPTIMIZATION_TABLE
|
137 |
|
|
+#define TARGET_OPTION_OPTIMIZATION_TABLE zip_option_optimization_table
|
138 |
|
|
+
|
139 |
|
|
+struct gcc_targetm_common targetm_common = TARGETM_COMMON_INITIALIZER;
|
140 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/aarch64/aarch64-linux.h gcc-5.3.0-zip/gcc/config/aarch64/aarch64-linux.h
|
141 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/aarch64/aarch64-linux.h 2016-04-21 20:04:11.745606740 -0400
|
142 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/aarch64/aarch64-linux.h 2015-07-24 12:00:26.000000000 -0400
|
143 |
|
|
@@ -21,7 +21,7 @@
|
144 |
|
|
#ifndef GCC_AARCH64_LINUX_H
|
145 |
|
|
#define GCC_AARCH64_LINUX_H
|
146 |
|
|
|
147 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld-linux-aarch64%{mbig-endian:_be}%{mabi=ilp32:_ilp32}.so.1"
|
148 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld-linux-aarch64%{mbig-endian:_be}%{mabi=ilp32:_ilp32}.so.1"
|
149 |
|
|
|
150 |
|
|
#undef ASAN_CC1_SPEC
|
151 |
|
|
#define ASAN_CC1_SPEC "%{%:sanitize(address):-funwind-tables}"
|
152 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/alpha/linux-elf.h gcc-5.3.0-zip/gcc/config/alpha/linux-elf.h
|
153 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/alpha/linux-elf.h 2016-04-21 20:04:11.761606648 -0400
|
154 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/alpha/linux-elf.h 2015-01-05 07:33:28.000000000 -0500
|
155 |
|
|
@@ -23,8 +23,8 @@
|
156 |
|
|
#define EXTRA_SPECS \
|
157 |
|
|
{ "elf_dynamic_linker", ELF_DYNAMIC_LINKER },
|
158 |
|
|
|
159 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld-linux.so.2"
|
160 |
|
|
-#define UCLIBC_DYNAMIC_LINKER "/tools/lib/ld-uClibc.so.0"
|
161 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld-linux.so.2"
|
162 |
|
|
+#define UCLIBC_DYNAMIC_LINKER "/lib/ld-uClibc.so.0"
|
163 |
|
|
#if DEFAULT_LIBC == LIBC_UCLIBC
|
164 |
|
|
#define CHOOSE_DYNAMIC_LINKER(G, U) "%{mglibc:" G ";:" U "}"
|
165 |
|
|
#elif DEFAULT_LIBC == LIBC_GLIBC
|
166 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/arm/linux-eabi.h gcc-5.3.0-zip/gcc/config/arm/linux-eabi.h
|
167 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/arm/linux-eabi.h 2016-04-21 20:04:11.761606648 -0400
|
168 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/arm/linux-eabi.h 2015-01-05 07:33:28.000000000 -0500
|
169 |
|
|
@@ -68,8 +68,8 @@
|
170 |
|
|
GLIBC_DYNAMIC_LINKER_DEFAULT and TARGET_DEFAULT_FLOAT_ABI. */
|
171 |
|
|
|
172 |
|
|
#undef GLIBC_DYNAMIC_LINKER
|
173 |
|
|
-#define GLIBC_DYNAMIC_LINKER_SOFT_FLOAT "/tools/lib/ld-linux.so.3"
|
174 |
|
|
-#define GLIBC_DYNAMIC_LINKER_HARD_FLOAT "/tools/lib/ld-linux-armhf.so.3"
|
175 |
|
|
+#define GLIBC_DYNAMIC_LINKER_SOFT_FLOAT "/lib/ld-linux.so.3"
|
176 |
|
|
+#define GLIBC_DYNAMIC_LINKER_HARD_FLOAT "/lib/ld-linux-armhf.so.3"
|
177 |
|
|
#define GLIBC_DYNAMIC_LINKER_DEFAULT GLIBC_DYNAMIC_LINKER_SOFT_FLOAT
|
178 |
|
|
|
179 |
|
|
#define GLIBC_DYNAMIC_LINKER \
|
180 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/arm/linux-elf.h gcc-5.3.0-zip/gcc/config/arm/linux-elf.h
|
181 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/arm/linux-elf.h 2016-04-21 20:04:11.761606648 -0400
|
182 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/arm/linux-elf.h 2015-06-23 05:26:54.000000000 -0400
|
183 |
|
|
@@ -62,7 +62,7 @@
|
184 |
|
|
|
185 |
|
|
#define LIBGCC_SPEC "%{mfloat-abi=soft*:-lfloat} -lgcc"
|
186 |
|
|
|
187 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld-linux.so.2"
|
188 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld-linux.so.2"
|
189 |
|
|
|
190 |
|
|
#define LINUX_TARGET_LINK_SPEC "%{h*} \
|
191 |
|
|
%{static:-Bstatic} \
|
192 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/bfin/linux.h gcc-5.3.0-zip/gcc/config/bfin/linux.h
|
193 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/bfin/linux.h 2016-04-21 20:04:11.761606648 -0400
|
194 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/bfin/linux.h 2015-01-05 07:33:28.000000000 -0500
|
195 |
|
|
@@ -45,7 +45,7 @@
|
196 |
|
|
%{shared:-G -Bdynamic} \
|
197 |
|
|
%{!shared: %{!static: \
|
198 |
|
|
%{rdynamic:-export-dynamic} \
|
199 |
|
|
- -dynamic-linker /tools/lib/ld-uClibc.so.0} \
|
200 |
|
|
+ -dynamic-linker /lib/ld-uClibc.so.0} \
|
201 |
|
|
%{static}} -init __init -fini __fini"
|
202 |
|
|
|
203 |
|
|
#undef TARGET_SUPPORTS_SYNC_CALLS
|
204 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/cris/linux.h gcc-5.3.0-zip/gcc/config/cris/linux.h
|
205 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/cris/linux.h 2016-04-21 20:04:11.761606648 -0400
|
206 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/cris/linux.h 2015-01-05 07:33:28.000000000 -0500
|
207 |
|
|
@@ -102,7 +102,7 @@
|
208 |
|
|
#undef CRIS_DEFAULT_CPU_VERSION
|
209 |
|
|
#define CRIS_DEFAULT_CPU_VERSION CRIS_CPU_NG
|
210 |
|
|
|
211 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
212 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld.so.1"
|
213 |
|
|
|
214 |
|
|
#undef CRIS_LINK_SUBTARGET_SPEC
|
215 |
|
|
#define CRIS_LINK_SUBTARGET_SPEC \
|
216 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/freebsd-spec.h gcc-5.3.0-zip/gcc/config/freebsd-spec.h
|
217 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/freebsd-spec.h 2016-04-21 20:04:11.761606648 -0400
|
218 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/freebsd-spec.h 2015-06-25 13:53:14.000000000 -0400
|
219 |
|
|
@@ -129,9 +129,9 @@
|
220 |
|
|
#endif
|
221 |
|
|
|
222 |
|
|
#if FBSD_MAJOR < 6
|
223 |
|
|
-#define FBSD_DYNAMIC_LINKER "/tools/libexec/ld-elf.so.1"
|
224 |
|
|
+#define FBSD_DYNAMIC_LINKER "/usr/libexec/ld-elf.so.1"
|
225 |
|
|
#else
|
226 |
|
|
-#define FBSD_DYNAMIC_LINKER "/tools/libexec/ld-elf.so.1"
|
227 |
|
|
+#define FBSD_DYNAMIC_LINKER "/libexec/ld-elf.so.1"
|
228 |
|
|
#endif
|
229 |
|
|
|
230 |
|
|
/* NOTE: The freebsd-spec.h header is included also for various
|
231 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/frv/linux.h gcc-5.3.0-zip/gcc/config/frv/linux.h
|
232 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/frv/linux.h 2016-04-21 20:04:11.761606648 -0400
|
233 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/frv/linux.h 2015-01-05 07:33:28.000000000 -0500
|
234 |
|
|
@@ -34,7 +34,7 @@
|
235 |
|
|
#define ENDFILE_SPEC \
|
236 |
|
|
"%{shared|pie:crtendS.o%s;:crtend.o%s} crtn.o%s"
|
237 |
|
|
|
238 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
239 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld.so.1"
|
240 |
|
|
|
241 |
|
|
#undef LINK_SPEC
|
242 |
|
|
#define LINK_SPEC "\
|
243 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/i386/gnu.h gcc-5.3.0-zip/gcc/config/i386/gnu.h
|
244 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/i386/gnu.h 2016-04-21 20:04:11.761606648 -0400
|
245 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/i386/gnu.h 2015-01-05 07:33:28.000000000 -0500
|
246 |
|
|
@@ -22,7 +22,7 @@
|
247 |
|
|
#define GNU_USER_LINK_EMULATION "elf_i386"
|
248 |
|
|
|
249 |
|
|
#undef GNU_USER_DYNAMIC_LINKER
|
250 |
|
|
-#define GNU_USER_DYNAMIC_LINKER "/tools/lib/ld.so"
|
251 |
|
|
+#define GNU_USER_DYNAMIC_LINKER "/lib/ld.so"
|
252 |
|
|
|
253 |
|
|
#undef STARTFILE_SPEC
|
254 |
|
|
#if defined HAVE_LD_PIE
|
255 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/i386/kfreebsd-gnu64.h gcc-5.3.0-zip/gcc/config/i386/kfreebsd-gnu64.h
|
256 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/i386/kfreebsd-gnu64.h 2016-04-21 20:04:11.761606648 -0400
|
257 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/i386/kfreebsd-gnu64.h 2015-01-05 07:33:28.000000000 -0500
|
258 |
|
|
@@ -22,6 +22,6 @@
|
259 |
|
|
#define GNU_USER_LINK_EMULATION64 "elf_x86_64_fbsd"
|
260 |
|
|
#define GNU_USER_LINK_EMULATIONX32 "elf32_x86_64_fbsd"
|
261 |
|
|
|
262 |
|
|
-#define GLIBC_DYNAMIC_LINKER32 "/tools/lib/ld.so.1"
|
263 |
|
|
-#define GLIBC_DYNAMIC_LINKER64 "/tools/lib/ld-kfreebsd-x86-64.so.1"
|
264 |
|
|
-#define GLIBC_DYNAMIC_LINKERX32 "/tools/lib/ld-kfreebsd-x32.so.1"
|
265 |
|
|
+#define GLIBC_DYNAMIC_LINKER32 "/lib/ld.so.1"
|
266 |
|
|
+#define GLIBC_DYNAMIC_LINKER64 "/lib/ld-kfreebsd-x86-64.so.1"
|
267 |
|
|
+#define GLIBC_DYNAMIC_LINKERX32 "/lib/ld-kfreebsd-x32.so.1"
|
268 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/i386/kfreebsd-gnu.h gcc-5.3.0-zip/gcc/config/i386/kfreebsd-gnu.h
|
269 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/i386/kfreebsd-gnu.h 2016-04-21 20:04:11.761606648 -0400
|
270 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/i386/kfreebsd-gnu.h 2015-01-05 07:33:28.000000000 -0500
|
271 |
|
|
@@ -19,4 +19,4 @@
|
272 |
|
|
<http://www.gnu.org/licenses/>. */
|
273 |
|
|
|
274 |
|
|
#define GNU_USER_LINK_EMULATION "elf_i386_fbsd"
|
275 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
276 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld.so.1"
|
277 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/i386/linux64.h gcc-5.3.0-zip/gcc/config/i386/linux64.h
|
278 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/i386/linux64.h 2016-04-21 20:04:11.761606648 -0400
|
279 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/i386/linux64.h 2015-01-05 07:33:28.000000000 -0500
|
280 |
|
|
@@ -27,6 +27,6 @@
|
281 |
|
|
#define GNU_USER_LINK_EMULATION64 "elf_x86_64"
|
282 |
|
|
#define GNU_USER_LINK_EMULATIONX32 "elf32_x86_64"
|
283 |
|
|
|
284 |
|
|
-#define GLIBC_DYNAMIC_LINKER32 "/tools/lib/ld-linux.so.2"
|
285 |
|
|
-#define GLIBC_DYNAMIC_LINKER64 "/tools/lib64/ld-linux-x86-64.so.2"
|
286 |
|
|
-#define GLIBC_DYNAMIC_LINKERX32 "/tools/libx32/ld-linux-x32.so.2"
|
287 |
|
|
+#define GLIBC_DYNAMIC_LINKER32 "/lib/ld-linux.so.2"
|
288 |
|
|
+#define GLIBC_DYNAMIC_LINKER64 "/lib64/ld-linux-x86-64.so.2"
|
289 |
|
|
+#define GLIBC_DYNAMIC_LINKERX32 "/libx32/ld-linux-x32.so.2"
|
290 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/i386/linux.h gcc-5.3.0-zip/gcc/config/i386/linux.h
|
291 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/i386/linux.h 2016-04-21 20:04:11.761606648 -0400
|
292 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/i386/linux.h 2015-01-05 07:33:28.000000000 -0500
|
293 |
|
|
@@ -20,4 +20,4 @@
|
294 |
|
|
<http://www.gnu.org/licenses/>. */
|
295 |
|
|
|
296 |
|
|
#define GNU_USER_LINK_EMULATION "elf_i386"
|
297 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld-linux.so.2"
|
298 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld-linux.so.2"
|
299 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/ia64/linux.h gcc-5.3.0-zip/gcc/config/ia64/linux.h
|
300 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/ia64/linux.h 2016-04-21 20:04:11.761606648 -0400
|
301 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/ia64/linux.h 2015-01-05 07:33:28.000000000 -0500
|
302 |
|
|
@@ -55,7 +55,7 @@
|
303 |
|
|
/* Define this for shared library support because it isn't in the main
|
304 |
|
|
linux.h file. */
|
305 |
|
|
|
306 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld-linux-ia64.so.2"
|
307 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld-linux-ia64.so.2"
|
308 |
|
|
|
309 |
|
|
#undef LINK_SPEC
|
310 |
|
|
#define LINK_SPEC "\
|
311 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/knetbsd-gnu.h gcc-5.3.0-zip/gcc/config/knetbsd-gnu.h
|
312 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/knetbsd-gnu.h 2016-04-21 20:04:11.761606648 -0400
|
313 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/knetbsd-gnu.h 2015-01-05 07:33:28.000000000 -0500
|
314 |
|
|
@@ -32,4 +32,4 @@
|
315 |
|
|
|
316 |
|
|
|
317 |
|
|
#undef GNU_USER_DYNAMIC_LINKER
|
318 |
|
|
-#define GNU_USER_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
319 |
|
|
+#define GNU_USER_DYNAMIC_LINKER "/lib/ld.so.1"
|
320 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/kopensolaris-gnu.h gcc-5.3.0-zip/gcc/config/kopensolaris-gnu.h
|
321 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/kopensolaris-gnu.h 2016-04-21 20:04:11.761606648 -0400
|
322 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/kopensolaris-gnu.h 2015-01-05 07:33:28.000000000 -0500
|
323 |
|
|
@@ -31,5 +31,4 @@
|
324 |
|
|
while (0)
|
325 |
|
|
|
326 |
|
|
#undef GNU_USER_DYNAMIC_LINKER
|
327 |
|
|
-#define GNU_USER_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
328 |
|
|
-
|
329 |
|
|
+#define GNU_USER_DYNAMIC_LINKER "/lib/ld.so.1"
|
330 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/linux.h gcc-5.3.0-zip/gcc/config/linux.h
|
331 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/linux.h 2016-04-21 20:04:11.761606648 -0400
|
332 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/linux.h 2015-01-05 07:33:28.000000000 -0500
|
333 |
|
|
@@ -73,10 +73,10 @@
|
334 |
|
|
GLIBC_DYNAMIC_LINKER must be defined for each target using them, or
|
335 |
|
|
GLIBC_DYNAMIC_LINKER32 and GLIBC_DYNAMIC_LINKER64 for targets
|
336 |
|
|
supporting both 32-bit and 64-bit compilation. */
|
337 |
|
|
-#define UCLIBC_DYNAMIC_LINKER "/tools/lib/ld-uClibc.so.0"
|
338 |
|
|
-#define UCLIBC_DYNAMIC_LINKER32 "/tools/lib/ld-uClibc.so.0"
|
339 |
|
|
-#define UCLIBC_DYNAMIC_LINKER64 "/tools/lib/ld64-uClibc.so.0"
|
340 |
|
|
-#define UCLIBC_DYNAMIC_LINKERX32 "/tools/lib/ldx32-uClibc.so.0"
|
341 |
|
|
+#define UCLIBC_DYNAMIC_LINKER "/lib/ld-uClibc.so.0"
|
342 |
|
|
+#define UCLIBC_DYNAMIC_LINKER32 "/lib/ld-uClibc.so.0"
|
343 |
|
|
+#define UCLIBC_DYNAMIC_LINKER64 "/lib/ld64-uClibc.so.0"
|
344 |
|
|
+#define UCLIBC_DYNAMIC_LINKERX32 "/lib/ldx32-uClibc.so.0"
|
345 |
|
|
#define BIONIC_DYNAMIC_LINKER "/system/bin/linker"
|
346 |
|
|
#define BIONIC_DYNAMIC_LINKER32 "/system/bin/linker"
|
347 |
|
|
#define BIONIC_DYNAMIC_LINKER64 "/system/bin/linker64"
|
348 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/lm32/uclinux-elf.h gcc-5.3.0-zip/gcc/config/lm32/uclinux-elf.h
|
349 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/lm32/uclinux-elf.h 2016-04-21 20:04:11.761606648 -0400
|
350 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/lm32/uclinux-elf.h 2015-01-05 07:33:28.000000000 -0500
|
351 |
|
|
@@ -67,7 +67,7 @@
|
352 |
|
|
%{shared:-shared} \
|
353 |
|
|
%{symbolic:-Bsymbolic} \
|
354 |
|
|
%{rdynamic:-export-dynamic} \
|
355 |
|
|
- -dynamic-linker /tools/lib/ld-linux.so.2"
|
356 |
|
|
+ -dynamic-linker /lib/ld-linux.so.2"
|
357 |
|
|
|
358 |
|
|
#define TARGET_OS_CPP_BUILTINS() GNU_USER_TARGET_OS_CPP_BUILTINS()
|
359 |
|
|
|
360 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/m68k/linux.h gcc-5.3.0-zip/gcc/config/m68k/linux.h
|
361 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/m68k/linux.h 2016-04-21 20:04:11.761606648 -0400
|
362 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/m68k/linux.h 2015-01-05 07:33:28.000000000 -0500
|
363 |
|
|
@@ -71,7 +71,7 @@
|
364 |
|
|
When the -shared link option is used a final link is not being
|
365 |
|
|
done. */
|
366 |
|
|
|
367 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
368 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld.so.1"
|
369 |
|
|
|
370 |
|
|
#undef LINK_SPEC
|
371 |
|
|
#define LINK_SPEC "-m m68kelf %{shared} \
|
372 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/microblaze/linux.h gcc-5.3.0-zip/gcc/config/microblaze/linux.h
|
373 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/microblaze/linux.h 2016-04-21 20:04:11.761606648 -0400
|
374 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/microblaze/linux.h 2015-05-28 10:08:19.000000000 -0400
|
375 |
|
|
@@ -28,7 +28,7 @@
|
376 |
|
|
#undef TLS_NEEDS_GOT
|
377 |
|
|
#define TLS_NEEDS_GOT 1
|
378 |
|
|
|
379 |
|
|
-#define DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
380 |
|
|
+#define DYNAMIC_LINKER "/lib/ld.so.1"
|
381 |
|
|
#undef SUBTARGET_EXTRA_SPECS
|
382 |
|
|
#define SUBTARGET_EXTRA_SPECS \
|
383 |
|
|
{ "dynamic_linker", DYNAMIC_LINKER }
|
384 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/mips/linux.h gcc-5.3.0-zip/gcc/config/mips/linux.h
|
385 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/mips/linux.h 2016-04-21 20:04:11.761606648 -0400
|
386 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/mips/linux.h 2015-01-05 07:33:28.000000000 -0500
|
387 |
|
|
@@ -22,20 +22,20 @@
|
388 |
|
|
#define GNU_USER_LINK_EMULATIONN32 "elf32%{EB:b}%{EL:l}tsmipn32"
|
389 |
|
|
|
390 |
|
|
#define GLIBC_DYNAMIC_LINKER32 \
|
391 |
|
|
- "%{mnan=2008:/tools/lib/ld-linux-mipsn8.so.1;:/tools/lib/ld.so.1}"
|
392 |
|
|
+ "%{mnan=2008:/lib/ld-linux-mipsn8.so.1;:/lib/ld.so.1}"
|
393 |
|
|
#define GLIBC_DYNAMIC_LINKER64 \
|
394 |
|
|
- "%{mnan=2008:/tools/lib64/ld-linux-mipsn8.so.1;:/tools/lib64/ld.so.1}"
|
395 |
|
|
+ "%{mnan=2008:/lib64/ld-linux-mipsn8.so.1;:/lib64/ld.so.1}"
|
396 |
|
|
#define GLIBC_DYNAMIC_LINKERN32 \
|
397 |
|
|
- "%{mnan=2008:/tools/lib32/ld-linux-mipsn8.so.1;:/tools/lib32/ld.so.1}"
|
398 |
|
|
+ "%{mnan=2008:/lib32/ld-linux-mipsn8.so.1;:/lib32/ld.so.1}"
|
399 |
|
|
|
400 |
|
|
#undef UCLIBC_DYNAMIC_LINKER32
|
401 |
|
|
#define UCLIBC_DYNAMIC_LINKER32 \
|
402 |
|
|
- "%{mnan=2008:/tools/lib/ld-uClibc-mipsn8.so.0;:/tools/lib/ld-uClibc.so.0}"
|
403 |
|
|
+ "%{mnan=2008:/lib/ld-uClibc-mipsn8.so.0;:/lib/ld-uClibc.so.0}"
|
404 |
|
|
#undef UCLIBC_DYNAMIC_LINKER64
|
405 |
|
|
#define UCLIBC_DYNAMIC_LINKER64 \
|
406 |
|
|
- "%{mnan=2008:/tools/lib/ld64-uClibc-mipsn8.so.0;:/tools/lib/ld64-uClibc.so.0}"
|
407 |
|
|
+ "%{mnan=2008:/lib/ld64-uClibc-mipsn8.so.0;:/lib/ld64-uClibc.so.0}"
|
408 |
|
|
#define UCLIBC_DYNAMIC_LINKERN32 \
|
409 |
|
|
- "%{mnan=2008:/tools/lib32/ld-uClibc-mipsn8.so.0;:/tools/lib32/ld-uClibc.so.0}"
|
410 |
|
|
+ "%{mnan=2008:/lib32/ld-uClibc-mipsn8.so.0;:/lib32/ld-uClibc.so.0}"
|
411 |
|
|
|
412 |
|
|
#define BIONIC_DYNAMIC_LINKERN32 "/system/bin/linker32"
|
413 |
|
|
#define GNU_USER_DYNAMIC_LINKERN32 \
|
414 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/mn10300/linux.h gcc-5.3.0-zip/gcc/config/mn10300/linux.h
|
415 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/mn10300/linux.h 2016-04-21 20:04:11.761606648 -0400
|
416 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/mn10300/linux.h 2015-01-05 07:33:28.000000000 -0500
|
417 |
|
|
@@ -32,7 +32,7 @@
|
418 |
|
|
#undef ASM_SPEC
|
419 |
|
|
#define ASM_SPEC ""
|
420 |
|
|
|
421 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
422 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld.so.1"
|
423 |
|
|
|
424 |
|
|
#undef LINK_SPEC
|
425 |
|
|
#define LINK_SPEC "%{mrelax:--relax} %{shared:-shared} \
|
426 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/pa/pa-linux.h gcc-5.3.0-zip/gcc/config/pa/pa-linux.h
|
427 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/pa/pa-linux.h 2016-04-21 20:04:11.761606648 -0400
|
428 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/pa/pa-linux.h 2015-09-24 20:04:26.000000000 -0400
|
429 |
|
|
@@ -37,7 +37,7 @@
|
430 |
|
|
/* Define this for shared library support because it isn't in the main
|
431 |
|
|
linux.h file. */
|
432 |
|
|
|
433 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
434 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld.so.1"
|
435 |
|
|
|
436 |
|
|
#undef LINK_SPEC
|
437 |
|
|
#define LINK_SPEC "\
|
438 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/rs6000/linux64.h gcc-5.3.0-zip/gcc/config/rs6000/linux64.h
|
439 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/rs6000/linux64.h 2016-04-21 20:04:11.761606648 -0400
|
440 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/rs6000/linux64.h 2015-03-09 19:18:57.000000000 -0400
|
441 |
|
|
@@ -357,14 +357,14 @@
|
442 |
|
|
#undef LINK_OS_DEFAULT_SPEC
|
443 |
|
|
#define LINK_OS_DEFAULT_SPEC "%(link_os_linux)"
|
444 |
|
|
|
445 |
|
|
-#define GLIBC_DYNAMIC_LINKER32 "/tools/lib/ld.so.1"
|
446 |
|
|
+#define GLIBC_DYNAMIC_LINKER32 "/lib/ld.so.1"
|
447 |
|
|
#ifdef LINUX64_DEFAULT_ABI_ELFv2
|
448 |
|
|
-#define GLIBC_DYNAMIC_LINKER64 "%{mabi=elfv1:/tools/lib64/ld64.so.1;:/tools/lib64/ld64.so.2}"
|
449 |
|
|
+#define GLIBC_DYNAMIC_LINKER64 "%{mabi=elfv1:/lib64/ld64.so.1;:/lib64/ld64.so.2}"
|
450 |
|
|
#else
|
451 |
|
|
-#define GLIBC_DYNAMIC_LINKER64 "%{mabi=elfv2:/tools/lib64/ld64.so.2;:/tools/lib64/ld64.so.1}"
|
452 |
|
|
+#define GLIBC_DYNAMIC_LINKER64 "%{mabi=elfv2:/lib64/ld64.so.2;:/lib64/ld64.so.1}"
|
453 |
|
|
#endif
|
454 |
|
|
-#define UCLIBC_DYNAMIC_LINKER32 "/tools/lib/ld-uClibc.so.0"
|
455 |
|
|
-#define UCLIBC_DYNAMIC_LINKER64 "/tools/lib/ld64-uClibc.so.0"
|
456 |
|
|
+#define UCLIBC_DYNAMIC_LINKER32 "/lib/ld-uClibc.so.0"
|
457 |
|
|
+#define UCLIBC_DYNAMIC_LINKER64 "/lib/ld64-uClibc.so.0"
|
458 |
|
|
#if DEFAULT_LIBC == LIBC_UCLIBC
|
459 |
|
|
#define CHOOSE_DYNAMIC_LINKER(G, U) "%{mglibc:" G ";:" U "}"
|
460 |
|
|
#elif DEFAULT_LIBC == LIBC_GLIBC
|
461 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/rs6000/sysv4.h gcc-5.3.0-zip/gcc/config/rs6000/sysv4.h
|
462 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/rs6000/sysv4.h 2016-04-21 20:04:11.761606648 -0400
|
463 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/rs6000/sysv4.h 2015-09-24 09:46:45.000000000 -0400
|
464 |
|
|
@@ -757,8 +757,8 @@
|
465 |
|
|
|
466 |
|
|
#define LINK_START_LINUX_SPEC ""
|
467 |
|
|
|
468 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
469 |
|
|
-#define UCLIBC_DYNAMIC_LINKER "/tools/lib/ld-uClibc.so.0"
|
470 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld.so.1"
|
471 |
|
|
+#define UCLIBC_DYNAMIC_LINKER "/lib/ld-uClibc.so.0"
|
472 |
|
|
#if DEFAULT_LIBC == LIBC_UCLIBC
|
473 |
|
|
#define CHOOSE_DYNAMIC_LINKER(G, U) "%{mglibc:" G ";:" U "}"
|
474 |
|
|
#elif !defined (DEFAULT_LIBC) || DEFAULT_LIBC == LIBC_GLIBC
|
475 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/s390/linux.h gcc-5.3.0-zip/gcc/config/s390/linux.h
|
476 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/s390/linux.h 2016-04-21 20:04:11.761606648 -0400
|
477 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/s390/linux.h 2015-05-11 03:14:10.000000000 -0400
|
478 |
|
|
@@ -60,8 +60,8 @@
|
479 |
|
|
#define MULTILIB_DEFAULTS { "m31" }
|
480 |
|
|
#endif
|
481 |
|
|
|
482 |
|
|
-#define GLIBC_DYNAMIC_LINKER32 "/tools/lib/ld.so.1"
|
483 |
|
|
-#define GLIBC_DYNAMIC_LINKER64 "/tools/lib/ld64.so.1"
|
484 |
|
|
+#define GLIBC_DYNAMIC_LINKER32 "/lib/ld.so.1"
|
485 |
|
|
+#define GLIBC_DYNAMIC_LINKER64 "/lib/ld64.so.1"
|
486 |
|
|
|
487 |
|
|
#undef LINK_SPEC
|
488 |
|
|
#define LINK_SPEC \
|
489 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/sh/linux.h gcc-5.3.0-zip/gcc/config/sh/linux.h
|
490 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/sh/linux.h 2016-04-21 20:04:11.761606648 -0400
|
491 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/sh/linux.h 2015-01-05 07:33:28.000000000 -0500
|
492 |
|
|
@@ -43,7 +43,7 @@
|
493 |
|
|
|
494 |
|
|
#define TARGET_ASM_FILE_END file_end_indicate_exec_stack
|
495 |
|
|
|
496 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld-linux.so.2"
|
497 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld-linux.so.2"
|
498 |
|
|
|
499 |
|
|
#undef SUBTARGET_LINK_EMUL_SUFFIX
|
500 |
|
|
#define SUBTARGET_LINK_EMUL_SUFFIX "_linux"
|
501 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/sparc/linux64.h gcc-5.3.0-zip/gcc/config/sparc/linux64.h
|
502 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/sparc/linux64.h 2016-04-21 20:04:11.761606648 -0400
|
503 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/sparc/linux64.h 2015-01-05 07:33:28.000000000 -0500
|
504 |
|
|
@@ -84,8 +84,8 @@
|
505 |
|
|
When the -shared link option is used a final link is not being
|
506 |
|
|
done. */
|
507 |
|
|
|
508 |
|
|
-#define GLIBC_DYNAMIC_LINKER32 "/tools/lib/ld-linux.so.2"
|
509 |
|
|
-#define GLIBC_DYNAMIC_LINKER64 "/tools/lib64/ld-linux.so.2"
|
510 |
|
|
+#define GLIBC_DYNAMIC_LINKER32 "/lib/ld-linux.so.2"
|
511 |
|
|
+#define GLIBC_DYNAMIC_LINKER64 "/lib64/ld-linux.so.2"
|
512 |
|
|
|
513 |
|
|
#ifdef SPARC_BI_ARCH
|
514 |
|
|
|
515 |
|
|
@@ -193,7 +193,7 @@
|
516 |
|
|
#else /* !SPARC_BI_ARCH */
|
517 |
|
|
|
518 |
|
|
#undef LINK_SPEC
|
519 |
|
|
-#define LINK_SPEC "-m elf64_sparc -Y P,%R/tools/lib64 %{shared:-shared} \
|
520 |
|
|
+#define LINK_SPEC "-m elf64_sparc -Y P,%R/usr/lib64 %{shared:-shared} \
|
521 |
|
|
%{!shared: \
|
522 |
|
|
%{!static: \
|
523 |
|
|
%{rdynamic:-export-dynamic} \
|
524 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/sparc/linux.h gcc-5.3.0-zip/gcc/config/sparc/linux.h
|
525 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/sparc/linux.h 2016-04-21 20:04:11.761606648 -0400
|
526 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/sparc/linux.h 2015-01-05 07:33:28.000000000 -0500
|
527 |
|
|
@@ -83,7 +83,7 @@
|
528 |
|
|
When the -shared link option is used a final link is not being
|
529 |
|
|
done. */
|
530 |
|
|
|
531 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld-linux.so.2"
|
532 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld-linux.so.2"
|
533 |
|
|
|
534 |
|
|
#undef LINK_SPEC
|
535 |
|
|
#define LINK_SPEC "-m elf32_sparc %{shared:-shared} \
|
536 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/vax/linux.h gcc-5.3.0-zip/gcc/config/vax/linux.h
|
537 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/vax/linux.h 2016-04-21 20:04:11.761606648 -0400
|
538 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/vax/linux.h 2015-01-05 07:33:28.000000000 -0500
|
539 |
|
|
@@ -41,7 +41,7 @@
|
540 |
|
|
%{!shared: \
|
541 |
|
|
%{!static: \
|
542 |
|
|
%{rdynamic:-export-dynamic} \
|
543 |
|
|
- -dynamic-linker /tools/lib/ld.so.1} \
|
544 |
|
|
+ -dynamic-linker /lib/ld.so.1} \
|
545 |
|
|
%{static:-static}}"
|
546 |
|
|
|
547 |
|
|
#undef WCHAR_TYPE
|
548 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/xtensa/linux.h gcc-5.3.0-zip/gcc/config/xtensa/linux.h
|
549 |
127 |
dgisselq |
--- gcc-5.3.0-original/gcc/config/xtensa/linux.h 2016-04-21 20:04:11.761606648 -0400
|
550 |
102 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/xtensa/linux.h 2015-01-05 07:33:28.000000000 -0500
|
551 |
|
|
@@ -44,7 +44,7 @@
|
552 |
|
|
%{mlongcalls:--longcalls} \
|
553 |
|
|
%{mno-longcalls:--no-longcalls}"
|
554 |
|
|
|
555 |
|
|
-#define GLIBC_DYNAMIC_LINKER "/tools/lib/ld.so.1"
|
556 |
|
|
+#define GLIBC_DYNAMIC_LINKER "/lib/ld.so.1"
|
557 |
|
|
|
558 |
|
|
#undef LINK_SPEC
|
559 |
|
|
#define LINK_SPEC \
|
560 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/zip/netbsd.h gcc-5.3.0-zip/gcc/config/zip/netbsd.h
|
561 |
|
|
--- gcc-5.3.0-original/gcc/config/zip/netbsd.h 1969-12-31 19:00:00.000000000 -0500
|
562 |
|
|
+++ gcc-5.3.0-zip/gcc/config/zip/netbsd.h 2016-01-30 15:04:14.796899050 -0500
|
563 |
|
|
@@ -0,0 +1,82 @@
|
564 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
565 |
|
|
+//
|
566 |
|
|
+// Filename: netbsd.h
|
567 |
|
|
+//
|
568 |
|
|
+// Project: Zip CPU backend for the GNU Compiler Collection
|
569 |
|
|
+//
|
570 |
|
|
+// Purpose:
|
571 |
|
|
+//
|
572 |
|
|
+// Creator: Dan Gisselquist, Ph.D.
|
573 |
|
|
+// Gisselquist Technology, LLC
|
574 |
|
|
+//
|
575 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
576 |
|
|
+//
|
577 |
|
|
+// Copyright (C) 2016, Gisselquist Technology, LLC
|
578 |
|
|
+//
|
579 |
|
|
+// This program is free software (firmware): you can redistribute it and/or
|
580 |
|
|
+// modify it under the terms of the GNU General Public License as published
|
581 |
|
|
+// by the Free Software Foundation, either version 3 of the License, or (at
|
582 |
|
|
+// your option) any later version.
|
583 |
|
|
+//
|
584 |
|
|
+// This program is distributed in the hope that it will be useful, but WITHOUT
|
585 |
|
|
+// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
|
586 |
|
|
+// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
587 |
|
|
+// for more details.
|
588 |
|
|
+//
|
589 |
|
|
+// You should have received a copy of the GNU General Public License along
|
590 |
|
|
+// with this program. (It's in the $(ROOT)/doc directory, run make with no
|
591 |
|
|
+// target there if the PDF file isn't present.) If not, see
|
592 |
|
|
+// <http://www.gnu.org/licenses/> for a copy.
|
593 |
|
|
+//
|
594 |
|
|
+// License: GPL, v3, as defined and found on www.gnu.org,
|
595 |
|
|
+// http://www.gnu.org/licenses/gpl.html
|
596 |
|
|
+//
|
597 |
|
|
+//
|
598 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
599 |
|
|
+#ifndef ZIP_NETBSD_H
|
600 |
|
|
+#define ZIP_NETBSD_H
|
601 |
|
|
+
|
602 |
|
|
+/* Define default target values. */
|
603 |
|
|
+
|
604 |
|
|
+#undef MACHINE_TYPE
|
605 |
|
|
+#define MACHINE_TYPE "NetBSD/Zip ELF"
|
606 |
|
|
+
|
607 |
|
|
+#undef TARGET_OS_CPP_BUILTINS
|
608 |
|
|
+#define TARGET_OS_CPP_BUILTINS() \
|
609 |
|
|
+ do { NETBSD_OS_CPP_BUILTINS_ELF(); \
|
610 |
|
|
+ builtin_define("__ZIPCPU__"); \
|
611 |
|
|
+ builtin_assert("cpu=zip"); \
|
612 |
|
|
+ builtin_assert("machine=zip"); \
|
613 |
|
|
+ } while(0);
|
614 |
|
|
+
|
615 |
|
|
+#undef CPP_SPEC
|
616 |
|
|
+#define CPP_SPEC NETBSD_CPP_SPEC
|
617 |
|
|
+
|
618 |
|
|
+#undef STARTFILE_SPEC
|
619 |
|
|
+#define STARTFILE_SPEC NETBSD_STARTFILE_SPEC
|
620 |
|
|
+
|
621 |
|
|
+#undef ENDFILE_SPEC
|
622 |
|
|
+#define ENDFILE_SPEC NETBSD_ENDFILE_SPEC
|
623 |
|
|
+
|
624 |
|
|
+#undef LIB_SPEC
|
625 |
|
|
+#define LIB_SPEC NETBSD_LIB_SPEC
|
626 |
|
|
+
|
627 |
|
|
+#undef TARGET_VERSION
|
628 |
|
|
+#define TARGET_VERSION fprintf(stderr, " (%s)", MACHINE_TYPE);
|
629 |
|
|
+
|
630 |
|
|
+/* Make gcc agree with <machine/ansi.h> */
|
631 |
|
|
+
|
632 |
|
|
+#undef WCHAR_TYPE
|
633 |
|
|
+#define WCHAR_TYPE "int"
|
634 |
|
|
+
|
635 |
|
|
+#undef WCHAR_TYPE_SIZE
|
636 |
|
|
+#define WCHAR_TYPE_SIZE 32
|
637 |
|
|
+
|
638 |
|
|
+#undef WINT_TYPE
|
639 |
|
|
+#define WINT_TYPE "int"
|
640 |
|
|
+
|
641 |
|
|
+/* Clean up after the generic Zip/ELF configuration. */
|
642 |
|
|
+#undef MD_EXEC_PREFIX
|
643 |
|
|
+#undef MD_STARTFILE_PREFIX
|
644 |
|
|
+
|
645 |
|
|
+#endif /* ZIP_NETBSD_H */
|
646 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/zip/t-zip gcc-5.3.0-zip/gcc/config/zip/t-zip
|
647 |
|
|
--- gcc-5.3.0-original/gcc/config/zip/t-zip 1969-12-31 19:00:00.000000000 -0500
|
648 |
|
|
+++ gcc-5.3.0-zip/gcc/config/zip/t-zip 2016-02-04 19:00:59.939652587 -0500
|
649 |
|
|
@@ -0,0 +1,47 @@
|
650 |
|
|
+################################################################################
|
651 |
|
|
+##
|
652 |
|
|
+## Filename: t-zip
|
653 |
|
|
+##
|
654 |
|
|
+## Project: Zip CPU backend for the GNU Compiler Collection
|
655 |
|
|
+##
|
656 |
|
|
+## Purpose:
|
657 |
|
|
+##
|
658 |
|
|
+## Creator: Dan Gisselquist, Ph.D.
|
659 |
|
|
+## Gisselquist Technology, LLC
|
660 |
|
|
+##
|
661 |
|
|
+################################################################################
|
662 |
|
|
+##
|
663 |
|
|
+## Copyright (C) 2016, Gisselquist Technology, LLC
|
664 |
|
|
+##
|
665 |
|
|
+## This program is free software (firmware): you can redistribute it and/or
|
666 |
|
|
+## modify it under the terms of the GNU General Public License as published
|
667 |
|
|
+## by the Free Software Foundation, either version 3 of the License, or (at
|
668 |
|
|
+## your option) any later version.
|
669 |
|
|
+##
|
670 |
|
|
+## This program is distributed in the hope that it will be useful, but WITHOUT
|
671 |
|
|
+## ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
|
672 |
|
|
+## FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
673 |
|
|
+## for more details.
|
674 |
|
|
+##
|
675 |
|
|
+## You should have received a copy of the GNU General Public License along
|
676 |
|
|
+## with this program. (It's in the $(ROOT)/doc directory, run make with no
|
677 |
|
|
+## target there if the PDF file isn't present.) If not, see
|
678 |
|
|
+## <http://www.gnu.org/licenses/> for a copy.
|
679 |
|
|
+##
|
680 |
|
|
+## License: GPL, v3, as defined and found on www.gnu.org,
|
681 |
|
|
+## http://www.gnu.org/licenses/gpl.html
|
682 |
|
|
+##
|
683 |
|
|
+##
|
684 |
|
|
+################################################################################
|
685 |
|
|
+
|
686 |
|
|
+FPBIT = fp-bit.c
|
687 |
|
|
+DPBIT = dp-bit.c
|
688 |
|
|
+
|
689 |
|
|
+# dp-bit.c: $(srcdir)/config/fp-bit.c
|
690 |
|
|
+ # cat $(srcdir)/config/fp-bit.c > dp-bit.c
|
691 |
|
|
+#
|
692 |
|
|
+# fp-bit.c: $(srcdir)/config/fp-bit.c
|
693 |
|
|
+ # echo '#define FLOAT" > fp-bit.c
|
694 |
|
|
+ # cat $(srcdir)/config/fp-bit.c >> fp-bit.c
|
695 |
|
|
+
|
696 |
|
|
+
|
697 |
|
|
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/zip/zip.c gcc-5.3.0-zip/gcc/config/zip/zip.c
|
698 |
|
|
--- gcc-5.3.0-original/gcc/config/zip/zip.c 1969-12-31 19:00:00.000000000 -0500
|
699 |
127 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/zip/zip.c 2016-04-21 16:52:37.544818916 -0400
|
700 |
|
|
@@ -0,0 +1,2174 @@
|
701 |
102 |
dgisselq |
+////////////////////////////////////////////////////////////////////////////////
|
702 |
|
|
+//
|
703 |
|
|
+// Filename: zip.c
|
704 |
|
|
+//
|
705 |
|
|
+// Project: Zip CPU backend for the GNU Compiler Collection
|
706 |
|
|
+//
|
707 |
|
|
+// Purpose:
|
708 |
|
|
+//
|
709 |
|
|
+// Creator: Dan Gisselquist, Ph.D.
|
710 |
|
|
+// Gisselquist Technology, LLC
|
711 |
|
|
+//
|
712 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
713 |
|
|
+//
|
714 |
|
|
+// Copyright (C) 2016, Gisselquist Technology, LLC
|
715 |
|
|
+//
|
716 |
|
|
+// This program is free software (firmware): you can redistribute it and/or
|
717 |
|
|
+// modify it under the terms of the GNU General Public License as published
|
718 |
|
|
+// by the Free Software Foundation, either version 3 of the License, or (at
|
719 |
|
|
+// your option) any later version.
|
720 |
|
|
+//
|
721 |
|
|
+// This program is distributed in the hope that it will be useful, but WITHOUT
|
722 |
|
|
+// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
|
723 |
|
|
+// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
724 |
|
|
+// for more details.
|
725 |
|
|
+//
|
726 |
|
|
+// You should have received a copy of the GNU General Public License along
|
727 |
|
|
+// with this program. (It's in the $(ROOT)/doc directory, run make with no
|
728 |
|
|
+// target there if the PDF file isn't present.) If not, see
|
729 |
|
|
+// <http://www.gnu.org/licenses/> for a copy.
|
730 |
|
|
+//
|
731 |
|
|
+// License: GPL, v3, as defined and found on www.gnu.org,
|
732 |
|
|
+// http://www.gnu.org/licenses/gpl.html
|
733 |
|
|
+//
|
734 |
|
|
+//
|
735 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
736 |
|
|
+#include "config.h"
|
737 |
|
|
+#include "system.h"
|
738 |
|
|
+#include "coretypes.h"
|
739 |
|
|
+#include "tm.h"
|
740 |
|
|
+#include "rtl.h"
|
741 |
|
|
+#include "dominance.h"
|
742 |
|
|
+#include "cfg.h"
|
743 |
|
|
+#include "cfgrtl.h"
|
744 |
|
|
+#include "cfganal.h"
|
745 |
|
|
+#include "lcm.h"
|
746 |
|
|
+#include "cfgbuild.h"
|
747 |
|
|
+#include "cfgcleanup.h"
|
748 |
|
|
+#include "predict.h"
|
749 |
|
|
+#include "basic-block.h"
|
750 |
|
|
+#include "df.h"
|
751 |
|
|
+#include "hashtab.h"
|
752 |
|
|
+#include "hash-set.h"
|
753 |
|
|
+#include "machmode.h"
|
754 |
|
|
+#include "symtab.h"
|
755 |
|
|
+#include "rtlhash.h"
|
756 |
|
|
+#include "tree.h"
|
757 |
|
|
+#include "regs.h"
|
758 |
|
|
+#include "hard-reg-set.h"
|
759 |
|
|
+#include "real.h"
|
760 |
|
|
+#include "insn-config.h"
|
761 |
|
|
+#include "conditions.h"
|
762 |
|
|
+#include "output.h"
|
763 |
|
|
+#include "insn-attr.h"
|
764 |
|
|
+#include "flags.h"
|
765 |
|
|
+#include "expr.h"
|
766 |
|
|
+#include "function.h"
|
767 |
|
|
+#include "recog.h"
|
768 |
|
|
+#include "toplev.h"
|
769 |
|
|
+#include "ggc.h"
|
770 |
|
|
+#include "builtins.h"
|
771 |
|
|
+#include "calls.h"
|
772 |
|
|
+#include "langhooks.h"
|
773 |
|
|
+#include "optabs.h"
|
774 |
|
|
+#include "explow.h"
|
775 |
|
|
+#include "emit-rtl.h"
|
776 |
122 |
dgisselq |
+#include "ifcvt.h"
|
777 |
102 |
dgisselq |
+
|
778 |
|
|
+// #include "tmp_p.h"
|
779 |
|
|
+#include "target.h"
|
780 |
|
|
+#include "target-def.h"
|
781 |
|
|
+// #include "tm-constrs.h"
|
782 |
122 |
dgisselq |
+#include "tm-preds.h"
|
783 |
102 |
dgisselq |
+
|
784 |
|
|
+#include "diagnostic.h"
|
785 |
|
|
+// #include "integrate.h"
|
786 |
|
|
+
|
787 |
|
|
+// static int zip_arg_partial_bytes(CUMULATIVE_ARGS *, enum machine_mode, tree, bool);
|
788 |
|
|
+// static bool zip_pass_by_reference(CUMULATIVE_ARGS *, enum machine_mode, const_tree, bool);
|
789 |
|
|
+static bool zip_return_in_memory(const_tree, const_tree);
|
790 |
|
|
+static bool zip_frame_pointer_required(void);
|
791 |
|
|
+
|
792 |
|
|
+static void zip_function_arg_advance(cumulative_args_t ca, enum machine_mode mode,
|
793 |
|
|
+ const_tree type, bool named);
|
794 |
|
|
+static rtx zip_function_arg(cumulative_args_t ca, enum machine_mode mode, const_tree type, bool named);
|
795 |
|
|
+
|
796 |
|
|
+static void zip_asm_trampoline_template(FILE *);
|
797 |
|
|
+static void zip_trampoline_init(rtx, tree, rtx);
|
798 |
|
|
+static void zip_init_builtins(void);
|
799 |
|
|
+static tree zip_builtin_decl(unsigned, bool);
|
800 |
|
|
+// static void zip_asm_output_anchor(rtx x);
|
801 |
|
|
+ void zip_asm_output_def(FILE *s, const char *n, const char *v);
|
802 |
|
|
+static rtx zip_expand_builtin(tree exp, rtx target, rtx subtarget,
|
803 |
|
|
+ enum machine_mode tmode, int ignore);
|
804 |
|
|
+static bool zip_scalar_mode_supported_p(enum machine_mode mode);
|
805 |
|
|
+static bool zip_libgcc_floating_mode_supported_p(enum machine_mode mode);
|
806 |
|
|
+static int zip_address_cost(rtx addr, enum machine_mode mode, addr_space_t as, bool spd);
|
807 |
|
|
+static bool zip_mode_dependent_address_p(const_rtx addr, addr_space_t);
|
808 |
|
|
+static unsigned HOST_WIDE_INT zip_const_anchor = 0x20000;
|
809 |
122 |
dgisselq |
+static HOST_WIDE_INT zip_min_opb_imm = -0x20000;
|
810 |
|
|
+static HOST_WIDE_INT zip_max_opb_imm = 0x1ffff;
|
811 |
102 |
dgisselq |
+static HOST_WIDE_INT zip_min_anchor_offset = -0x20000;
|
812 |
|
|
+static HOST_WIDE_INT zip_max_anchor_offset = 0x1ffff;
|
813 |
|
|
+static HOST_WIDE_INT zip_min_mov_offset = -0x1000;
|
814 |
|
|
+static HOST_WIDE_INT zip_max_mov_offset = 0x0fff;
|
815 |
|
|
+static int zip_sched_issue_rate(void) { return 1; }
|
816 |
|
|
+static bool zip_legitimate_address_p(machine_mode, rtx, bool);
|
817 |
|
|
+static bool zip_legitimate_move_operand_p(machine_mode, rtx, bool);
|
818 |
|
|
+ void zip_debug_rtx_pfx(const char *, const_rtx x);
|
819 |
|
|
+ void zip_debug_rtx(const_rtx x);
|
820 |
|
|
+static void zip_override_options(void);
|
821 |
|
|
+static bool zip_can_eliminate(int from ATTRIBUTE_UNUSED, int to);
|
822 |
|
|
+static int zip_memory_move_cost(machine_mode, reg_class_t, bool);
|
823 |
111 |
dgisselq |
+static rtx zip_legitimize_address(rtx x, rtx oldx, machine_mode mode);
|
824 |
117 |
dgisselq |
+static bool zip_cannot_modify_jumps_p(void);
|
825 |
122 |
dgisselq |
+#ifdef HAVE_cc0
|
826 |
|
|
+ void zip_update_cc_notice(rtx exp, rtx_insn *insn);
|
827 |
|
|
+#error "We're not supposed to have CC0 anymore"
|
828 |
|
|
+#else
|
829 |
|
|
+static bool zip_fixed_condition_code_regs(unsigned int *a, unsigned int *b);
|
830 |
|
|
+#endif
|
831 |
102 |
dgisselq |
+
|
832 |
|
|
+
|
833 |
103 |
dgisselq |
+#define ALL_DEBUG_OFF false
|
834 |
102 |
dgisselq |
+#define ALL_DEBUG_ON false
|
835 |
|
|
+
|
836 |
|
|
+enum ZIP_BUILTIN_ID_CODE {
|
837 |
|
|
+ ZIP_BUILTIN_RTU,
|
838 |
|
|
+ ZIP_BUILTIN_HALT,
|
839 |
|
|
+ ZIP_BUILTIN_IDLE,
|
840 |
|
|
+ ZIP_BUILTIN_SYSCALL,
|
841 |
|
|
+ ZIP_BUILTIN_SAVE_CONTEXT,
|
842 |
|
|
+ ZIP_BUILTIN_RESTORE_CONTEXT,
|
843 |
|
|
+ ZIP_BUILTIN_BITREV,
|
844 |
|
|
+ ZIP_BUILTIN_CC,
|
845 |
117 |
dgisselq |
+ ZIP_BUILTIN_UCC,
|
846 |
102 |
dgisselq |
+ ZIP_BUILTIN_MAX
|
847 |
|
|
+};
|
848 |
|
|
+
|
849 |
|
|
+static GTY (()) tree zip_builtins[(int)ZIP_BUILTIN_MAX];
|
850 |
|
|
+static enum insn_code zip_builtins_icode[(int)ZIP_BUILTIN_MAX];
|
851 |
|
|
+
|
852 |
|
|
+
|
853 |
|
|
+#include "gt-zip.h"
|
854 |
|
|
+
|
855 |
|
|
+/* The Global 'targetm' Variable. */
|
856 |
|
|
+struct gcc_target targetm = TARGET_INITIALIZER;
|
857 |
|
|
+
|
858 |
|
|
+
|
859 |
|
|
+enum reg_class zip_reg_class(int);
|
860 |
|
|
+
|
861 |
|
|
+#define LOSE_AND_RETURN(msgid, x) \
|
862 |
|
|
+ do { \
|
863 |
|
|
+ zip_operand_lossage(msgid, x); \
|
864 |
|
|
+ return; \
|
865 |
|
|
+ } while(0)
|
866 |
|
|
+
|
867 |
|
|
+/* Per-function machine data. */
|
868 |
|
|
+struct GTY(()) machine_function
|
869 |
|
|
+{
|
870 |
|
|
+ /* number of pretented arguments for varargs */
|
871 |
|
|
+ int pretend_size;
|
872 |
|
|
+
|
873 |
|
|
+ /* Number of bytes saved on the stack for local variables. */
|
874 |
|
|
+ int local_vars_size;
|
875 |
|
|
+
|
876 |
|
|
+ /* Number of bytes saved on stack for register save area */
|
877 |
|
|
+ int saved_reg_size;
|
878 |
|
|
+ int save_ret;
|
879 |
|
|
+
|
880 |
|
|
+ int sp_fp_offset;
|
881 |
|
|
+ bool fp_needed;
|
882 |
|
|
+ int size_for_adjusting_sp;
|
883 |
|
|
+};
|
884 |
|
|
+
|
885 |
|
|
+/* Allocate a chunk of memory for per-function machine-dependent data. */
|
886 |
|
|
+
|
887 |
|
|
+static struct machine_function *
|
888 |
|
|
+zip_init_machine_status(void) {
|
889 |
|
|
+ return ggc_cleared_alloc<machine_function>();
|
890 |
|
|
+}
|
891 |
|
|
+
|
892 |
|
|
+static void
|
893 |
|
|
+zip_override_options(void)
|
894 |
|
|
+{
|
895 |
|
|
+ init_machine_status = zip_init_machine_status;
|
896 |
|
|
+}
|
897 |
|
|
+
|
898 |
|
|
+enum reg_class
|
899 |
|
|
+zip_reg_class(int regno)
|
900 |
|
|
+{
|
901 |
|
|
+ if (is_ZIP_GENERAL_REG(regno)) {
|
902 |
|
|
+ return GENERAL_REGS;
|
903 |
|
|
+ } else if (is_ZIP_REG(regno)) {
|
904 |
|
|
+ return ALL_REGS;
|
905 |
|
|
+ } return NO_REGS;
|
906 |
|
|
+}
|
907 |
|
|
+
|
908 |
|
|
+/* Worker function for TARGET_RETURN_IN_MEMORY. */
|
909 |
|
|
+static bool
|
910 |
|
|
+zip_return_in_memory(const_tree type, const_tree fntype ATTRIBUTE_UNUSED) {
|
911 |
|
|
+ const HOST_WIDE_INT size = int_size_in_bytes(type);
|
912 |
|
|
+ return (size == -1)||(size > UNITS_PER_WORD);
|
913 |
|
|
+}
|
914 |
|
|
+
|
915 |
|
|
+/* Emit an error emssage when we're in an asm, and a fatal error for "normal"
|
916 |
|
|
+ * insn. Formatted output isn't easily implemented, since we use output operand
|
917 |
|
|
+ * lossage to output the actual message and handle the categorization of the
|
918 |
|
|
+ * error. */
|
919 |
|
|
+
|
920 |
|
|
+static void
|
921 |
|
|
+zip_operand_lossage(const char *msgid, rtx op) {
|
922 |
|
|
+ fprintf(stderr, "Operand lossage??\n");
|
923 |
|
|
+ debug_rtx(op);
|
924 |
|
|
+ zip_debug_rtx(op);
|
925 |
|
|
+ output_operand_lossage("%s", msgid);
|
926 |
|
|
+}
|
927 |
|
|
+
|
928 |
|
|
+/* The PRINT_OPERAND_ADDRESS worker. */
|
929 |
|
|
+void
|
930 |
|
|
+zip_print_operand_address(FILE *file, rtx x) {
|
931 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
932 |
|
|
+
|
933 |
|
|
+ if (dbg) zip_debug_rtx(x);
|
934 |
|
|
+ switch(GET_CODE(x)) {
|
935 |
|
|
+ case REG:
|
936 |
127 |
dgisselq |
+ gcc_assert(is_ZIP_REG(REGNO(x)));
|
937 |
102 |
dgisselq |
+ fprintf(file, "(%s)", reg_names[REGNO(x)]);
|
938 |
|
|
+ break;
|
939 |
|
|
+ case SYMBOL_REF:
|
940 |
|
|
+ fprintf(file, "%s", XSTR(x,0));
|
941 |
|
|
+ break;
|
942 |
|
|
+ case LABEL_REF:
|
943 |
|
|
+ x = LABEL_REF_LABEL(x);
|
944 |
|
|
+ case CODE_LABEL:
|
945 |
|
|
+ { char buf[256];
|
946 |
|
|
+ ASM_GENERATE_INTERNAL_LABEL(buf, "L", CODE_LABEL_NUMBER(x));
|
947 |
|
|
+#ifdef ASM_OUTPUT_LABEL_REF
|
948 |
|
|
+ ASM_OUTPUT_LABEL_REF(file, buf);
|
949 |
|
|
+#else
|
950 |
|
|
+ assemble_name(file, buf);
|
951 |
|
|
+#endif
|
952 |
|
|
+ }
|
953 |
|
|
+ break;
|
954 |
|
|
+ case PLUS:
|
955 |
111 |
dgisselq |
+ if (!REG_P(XEXP(x, 0))) {
|
956 |
|
|
+ fprintf(stderr, "Unsupported address construct\n");
|
957 |
|
|
+ zip_debug_rtx(x);
|
958 |
102 |
dgisselq |
+ abort();
|
959 |
127 |
dgisselq |
+ } gcc_assert(is_ZIP_REG(REGNO(XEXP(x,0))));
|
960 |
|
|
+ if (CONST_INT_P(XEXP(x, 1))) {
|
961 |
102 |
dgisselq |
+ if (INTVAL(XEXP(x,1))!=0) {
|
962 |
|
|
+ fprintf(file, "%ld(%s)",
|
963 |
|
|
+ INTVAL(XEXP(x, 1)),
|
964 |
|
|
+ reg_names[REGNO(XEXP(x, 0))]);
|
965 |
|
|
+ } else {
|
966 |
|
|
+ fprintf(file, "(%s)",
|
967 |
|
|
+ reg_names[REGNO(XEXP(x, 0))]);
|
968 |
|
|
+ }
|
969 |
|
|
+ } else if (GET_CODE(XEXP(x,1)) == SYMBOL_REF) {
|
970 |
|
|
+ fprintf(file, "%s(%s)", XSTR(x,0),
|
971 |
|
|
+ reg_names[REGNO(XEXP(x, 0))]);
|
972 |
|
|
+ } else if ((GET_CODE(XEXP(x, 1)) == MINUS)
|
973 |
|
|
+ && (GET_CODE(XEXP(XEXP(x, 1), 0))==SYMBOL_REF)
|
974 |
|
|
+ && (GET_CODE(XEXP(XEXP(x, 1), 1))==SYMBOL_REF)) {
|
975 |
|
|
+ fprintf(file, "%s-%s(%s)",
|
976 |
|
|
+ XSTR(XEXP(XEXP(x, 1),0),0),
|
977 |
|
|
+ XSTR(XEXP(XEXP(x, 1),1),0),
|
978 |
|
|
+ reg_names[REGNO(XEXP(x, 0))]);
|
979 |
|
|
+ } else
|
980 |
|
|
+ fprintf(file, "#INVALID(%s)",
|
981 |
|
|
+ reg_names[REGNO(XEXP(x, 0))]);
|
982 |
|
|
+ /*
|
983 |
|
|
+ else if (GET_CODE(XEXP(addr, 1)) == LABEL)
|
984 |
|
|
+ fprintf(file, "%s(%s)",
|
985 |
|
|
+ GET_CODE(XEXP(addr, 1)),
|
986 |
|
|
+ reg_names[REGNO(GET_CODE(XEXP(addr, 0)))]);
|
987 |
|
|
+ else if ((GET_CODE(XEXP(addr, 1)) == MINUS)
|
988 |
|
|
+ && (GET_CODE(XEXP(GET_CODE(XEXP(addr, 1)), 0))==LABEL)
|
989 |
|
|
+ && (GET_CODE(XEXP(GET_CODE(XEXP(addr, 1)), 1))==LABEL)) {
|
990 |
|
|
+ fprintf(file, "%s-%s(%s)",
|
991 |
|
|
+ reg_names[REGNO(GET_CODE(XEXP(addr, 0)))]);
|
992 |
|
|
+ reg_names[REGNO(GET_CODE(XEXP(addr, 0)))]);
|
993 |
|
|
+ reg_names[REGNO(GET_CODE(XEXP(addr, 0)))]);
|
994 |
|
|
+ }
|
995 |
|
|
+ */
|
996 |
|
|
+ break;
|
997 |
|
|
+ // We don't support direct memory addressing within our
|
998 |
|
|
+ // instruction set, even though the instructions themselves
|
999 |
|
|
+ // would support direct memory addressing of the lower 18 bits
|
1000 |
|
|
+ // of memory space.
|
1001 |
|
|
+ case MEM:
|
1002 |
|
|
+ if (dbg) zip_debug_rtx(x);
|
1003 |
|
|
+ zip_print_operand_address(file, XEXP(x, 0));
|
1004 |
|
|
+ break;
|
1005 |
111 |
dgisselq |
+ case CONST_INT:
|
1006 |
|
|
+ fprintf(file, "%ld",INTVAL(x));
|
1007 |
|
|
+ break;
|
1008 |
102 |
dgisselq |
+ default:
|
1009 |
111 |
dgisselq |
+ fprintf(stderr, "Unknown address format\n");
|
1010 |
|
|
+ zip_debug_rtx(x);
|
1011 |
102 |
dgisselq |
+ abort(); break;
|
1012 |
|
|
+ // output_addr_const(file, x);
|
1013 |
|
|
+ break;
|
1014 |
|
|
+ }
|
1015 |
|
|
+}
|
1016 |
|
|
+
|
1017 |
|
|
+/* The PRINT_OPERAND worker. */
|
1018 |
|
|
+
|
1019 |
|
|
+void
|
1020 |
|
|
+zip_print_operand(FILE *file, rtx x, int code)
|
1021 |
|
|
+{
|
1022 |
|
|
+ rtx operand = x;
|
1023 |
|
|
+ int rgoff = 0;
|
1024 |
|
|
+
|
1025 |
|
|
+ // fprintf(file, "Print Operand!\n");
|
1026 |
|
|
+
|
1027 |
|
|
+ /* New code entries should just be added to the switch below. If
|
1028 |
|
|
+ * handling is finished, just return. If handling was just a
|
1029 |
|
|
+ * modification of the operand, the modified operand should be put in
|
1030 |
|
|
+ * "operand", and then do a break to let default handling
|
1031 |
|
|
+ * (zero-modifier) output the operand.
|
1032 |
|
|
+ */
|
1033 |
|
|
+ switch(code) {
|
1034 |
|
|
+ case 0:
|
1035 |
|
|
+ /* No code, print as usual. */
|
1036 |
|
|
+ break;
|
1037 |
|
|
+ case 'L':
|
1038 |
|
|
+ /* Lower of two registers, print one up */
|
1039 |
|
|
+ rgoff = 1;
|
1040 |
|
|
+ break;
|
1041 |
|
|
+ case 'R':
|
1042 |
|
|
+ case 'H':
|
1043 |
|
|
+ /* Higher of a register pair, print normal */
|
1044 |
|
|
+ break;
|
1045 |
|
|
+
|
1046 |
|
|
+ default:
|
1047 |
|
|
+ LOSE_AND_RETURN("invalid operand modifier letter", x);
|
1048 |
|
|
+ }
|
1049 |
|
|
+
|
1050 |
|
|
+ /* Print an operand as without a modifier letter. */
|
1051 |
|
|
+ switch (GET_CODE(operand)) {
|
1052 |
|
|
+ case REG:
|
1053 |
|
|
+ if (REGNO(operand)+rgoff >= FIRST_PSEUDO_REGISTER)
|
1054 |
|
|
+ internal_error("internal error: bad register: %d", REGNO(operand));
|
1055 |
|
|
+ fprintf(file, "%s", reg_names[REGNO(operand)+rgoff]);
|
1056 |
|
|
+ return;
|
1057 |
|
|
+ case SCRATCH:
|
1058 |
|
|
+ LOSE_AND_RETURN("Need a scratch register", x);
|
1059 |
|
|
+ return;
|
1060 |
|
|
+
|
1061 |
|
|
+ case CODE_LABEL:
|
1062 |
|
|
+ case LABEL_REF:
|
1063 |
|
|
+ case SYMBOL_REF:
|
1064 |
|
|
+ case PLUS:
|
1065 |
|
|
+ PRINT_OPERAND_ADDRESS(file, operand);
|
1066 |
|
|
+ return;
|
1067 |
|
|
+ case MEM:
|
1068 |
|
|
+ PRINT_OPERAND_ADDRESS(file, XEXP(operand, 0));
|
1069 |
|
|
+ return;
|
1070 |
|
|
+
|
1071 |
|
|
+ default:
|
1072 |
|
|
+ /* No need to handle all strange variants, let
|
1073 |
|
|
+ * output_addr_const do it for us.
|
1074 |
|
|
+ */
|
1075 |
|
|
+ if (CONSTANT_P(operand)) {
|
1076 |
|
|
+ output_addr_const(file, operand);
|
1077 |
|
|
+ return;
|
1078 |
|
|
+ }
|
1079 |
|
|
+
|
1080 |
|
|
+ LOSE_AND_RETURN("unexpected operand", x);
|
1081 |
|
|
+ }
|
1082 |
|
|
+}
|
1083 |
|
|
+
|
1084 |
|
|
+static bool
|
1085 |
|
|
+zip_frame_pointer_required(void)
|
1086 |
|
|
+{
|
1087 |
|
|
+ // This should really depend upon whether we have variable sized
|
1088 |
|
|
+ // arguments in our frame or not. Once this fails, let's look
|
1089 |
|
|
+ // at what the problem was and then whether or not we can detect
|
1090 |
|
|
+ // it.
|
1091 |
|
|
+ //
|
1092 |
|
|
+ // Use a GCC global to determine our answer
|
1093 |
103 |
dgisselq |
+ if (cfun->calls_alloca)
|
1094 |
|
|
+ return true;
|
1095 |
102 |
dgisselq |
+ return (frame_pointer_needed);
|
1096 |
|
|
+/*
|
1097 |
|
|
+*/
|
1098 |
|
|
+}
|
1099 |
|
|
+
|
1100 |
|
|
+/* Determine whether or not a register needs to be saved on the stack or not.
|
1101 |
|
|
+ */
|
1102 |
|
|
+static bool
|
1103 |
|
|
+zip_save_reg(int regno) {
|
1104 |
|
|
+ if (regno == 0)
|
1105 |
|
|
+ return ((!crtl->is_leaf)
|
1106 |
|
|
+ ||((df_regs_ever_live_p(0))&&(!call_used_regs[0])));
|
1107 |
|
|
+ else if ((regno == zip_GOT)&&(!ZIP_PIC))
|
1108 |
|
|
+ return ((df_regs_ever_live_p(regno))
|
1109 |
|
|
+ &&(!call_used_regs[regno]));
|
1110 |
|
|
+ else if (regno == zip_FP)
|
1111 |
|
|
+ return((zip_frame_pointer_required())||((df_regs_ever_live_p(regno))
|
1112 |
|
|
+ &&(!call_used_regs[regno])));
|
1113 |
|
|
+ else if (regno < zip_FP)
|
1114 |
|
|
+ return ((df_regs_ever_live_p(regno))
|
1115 |
|
|
+ &&(!call_used_regs[regno]));
|
1116 |
|
|
+ return false;
|
1117 |
|
|
+}
|
1118 |
|
|
+
|
1119 |
|
|
+/* Compute the size of the local area and the size to be adjusted by the
|
1120 |
|
|
+ * prologue and epilogue.
|
1121 |
|
|
+ *
|
1122 |
|
|
+ * Here's what we are looking at (top is the current, bottom is the last ...)
|
1123 |
|
|
+ *
|
1124 |
|
|
+ * Stack Pointer ->
|
1125 |
124 |
dgisselq |
+ * Outgoing arguments
|
1126 |
102 |
dgisselq |
+ * Local variables (could be variable size)
|
1127 |
|
|
+ * Frame Pointer -> (= Stack Pointer + sp_fp_offset)
|
1128 |
|
|
+ * Saved return address, if saved
|
1129 |
|
|
+ * Other Saved registers
|
1130 |
|
|
+ * Saved frame pointer (if used)
|
1131 |
|
|
+ * Saved R12, if used
|
1132 |
|
|
+ * (Stack pointer is not saved)
|
1133 |
|
|
+ * Original stack pointer -> (= Stack_Pointer +size_for_adjusting_sp)
|
1134 |
|
|
+ * Called arguments (not passed in registers)
|
1135 |
|
|
+ * Return arguments (not R1, args.pretend_args_size)
|
1136 |
|
|
+ * (Prior function's stack frame ... )
|
1137 |
|
|
+ *
|
1138 |
|
|
+ */
|
1139 |
|
|
+static void
|
1140 |
|
|
+zip_compute_frame(void) {
|
1141 |
|
|
+ int regno;
|
1142 |
|
|
+ int args_size;
|
1143 |
124 |
dgisselq |
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
1144 |
102 |
dgisselq |
+
|
1145 |
124 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-COMPUTE-FRAME\n");
|
1146 |
102 |
dgisselq |
+ // gcc_assert(crtl);
|
1147 |
|
|
+ gcc_assert(cfun);
|
1148 |
|
|
+ gcc_assert(cfun->machine);
|
1149 |
|
|
+
|
1150 |
|
|
+ args_size=(ACCUMULATE_OUTGOING_ARGS ? crtl->outgoing_args_size : 0);
|
1151 |
|
|
+
|
1152 |
|
|
+ if(crtl->args.pretend_args_size > 0) {
|
1153 |
|
|
+ args_size += crtl->args.pretend_args_size;
|
1154 |
|
|
+ // printf("%s pretend_args_size : %d\n", current_function_name(),
|
1155 |
|
|
+ // crtl->args.pretend_args_size);
|
1156 |
|
|
+ cfun->machine->pretend_size = crtl->args.pretend_args_size;
|
1157 |
|
|
+ }
|
1158 |
|
|
+
|
1159 |
|
|
+ cfun->machine->local_vars_size = get_frame_size();
|
1160 |
|
|
+
|
1161 |
|
|
+ // Save callee-saved registers.
|
1162 |
|
|
+ cfun->machine->saved_reg_size = 0;
|
1163 |
|
|
+ for(regno=0; regno < FIRST_PSEUDO_REGISTER; regno++) {
|
1164 |
|
|
+ if (zip_save_reg(regno))
|
1165 |
|
|
+ cfun->machine->saved_reg_size ++;
|
1166 |
|
|
+ }
|
1167 |
|
|
+
|
1168 |
|
|
+ cfun->machine->fp_needed = (zip_frame_pointer_required());
|
1169 |
|
|
+
|
1170 |
|
|
+ if ((cfun->machine->fp_needed)&&
|
1171 |
|
|
+ (!df_regs_ever_live_p(zip_FP))) {
|
1172 |
|
|
+ cfun->machine->saved_reg_size ++;
|
1173 |
|
|
+ }
|
1174 |
|
|
+
|
1175 |
|
|
+ cfun->machine->sp_fp_offset = args_size + cfun->machine->local_vars_size;
|
1176 |
|
|
+ cfun->machine->size_for_adjusting_sp = cfun->machine->local_vars_size
|
1177 |
|
|
+ + cfun->machine->saved_reg_size
|
1178 |
|
|
+ + args_size;
|
1179 |
124 |
dgisselq |
+ if(dbg) {
|
1180 |
|
|
+ fprintf(stderr, "\tFRAME-POINTR: %s\n",
|
1181 |
|
|
+ cfun->machine->fp_needed?"Yes":"No");
|
1182 |
|
|
+ fprintf(stderr, "\tARGS-SIZE : %d\n",
|
1183 |
|
|
+ args_size);
|
1184 |
|
|
+ fprintf(stderr, "\tLOCALS-SIZE : %d\n",
|
1185 |
|
|
+ cfun->machine->local_vars_size);
|
1186 |
|
|
+ fprintf(stderr, "\tREGISTERS : %d\n",
|
1187 |
|
|
+ cfun->machine->saved_reg_size);
|
1188 |
|
|
+ fprintf(stderr, "\tSP_FP_OFFSET: %d\n",
|
1189 |
|
|
+ cfun->machine->sp_fp_offset);
|
1190 |
|
|
+ fprintf(stderr, "\tSP-ADJUSTMNT: %d\n",
|
1191 |
|
|
+ cfun->machine->size_for_adjusting_sp);
|
1192 |
|
|
+ }
|
1193 |
102 |
dgisselq |
+}
|
1194 |
|
|
+
|
1195 |
|
|
+void
|
1196 |
|
|
+zip_expand_prologue(void) {
|
1197 |
|
|
+ rtx insn;
|
1198 |
|
|
+
|
1199 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
1200 |
|
|
+ zip_compute_frame();
|
1201 |
|
|
+
|
1202 |
124 |
dgisselq |
+ if (dbg) fprintf(stderr, "PROLOGUE: Computing Prologue instructions\n");
|
1203 |
127 |
dgisselq |
+ if (dbg) fprintf(stderr, "PROLOGUE: SP-FP offset is %d\n",
|
1204 |
|
|
+ cfun->machine->sp_fp_offset);
|
1205 |
102 |
dgisselq |
+ if (cfun->machine->size_for_adjusting_sp != 0) {
|
1206 |
|
|
+ insn = emit_insn(gen_subsi3(stack_pointer_rtx,
|
1207 |
|
|
+ stack_pointer_rtx,
|
1208 |
|
|
+ gen_int_mode(cfun->machine->size_for_adjusting_sp,
|
1209 |
|
|
+ SImode)));
|
1210 |
|
|
+ // cfun->machine->sp_fp_offset
|
1211 |
|
|
+
|
1212 |
|
|
+ RTX_FRAME_RELATED_P(insn) = 1;
|
1213 |
|
|
+ }
|
1214 |
|
|
+
|
1215 |
|
|
+ {
|
1216 |
|
|
+ int offset = 0, regno;
|
1217 |
|
|
+ for(regno=0; regno < FIRST_PSEUDO_REGISTER; regno++) {
|
1218 |
|
|
+ if (zip_save_reg(regno)) {
|
1219 |
127 |
dgisselq |
+ if (dbg) fprintf(stderr,
|
1220 |
|
|
+ "PROLOGUE: Saving R%d in %d+%d(SP)\n",
|
1221 |
|
|
+ regno, cfun->machine->sp_fp_offset,
|
1222 |
|
|
+ offset);
|
1223 |
124 |
dgisselq |
+ insn=emit_insn(gen_movsi_sto_off(
|
1224 |
|
|
+ stack_pointer_rtx,
|
1225 |
|
|
+ GEN_INT(cfun->machine->sp_fp_offset
|
1226 |
|
|
+ +offset++),
|
1227 |
102 |
dgisselq |
+ gen_rtx_REG(SImode, regno)));
|
1228 |
|
|
+ RTX_FRAME_RELATED_P(insn) = 1;
|
1229 |
|
|
+ }
|
1230 |
|
|
+ }
|
1231 |
103 |
dgisselq |
+ if (dbg) fprintf(stderr, "%d registers saved%s\n", offset,
|
1232 |
|
|
+ (crtl->saves_all_registers)?", should be all of them":", less than all");
|
1233 |
102 |
dgisselq |
+ }
|
1234 |
|
|
+
|
1235 |
|
|
+ if (cfun->machine->fp_needed) {
|
1236 |
|
|
+ if (dbg) zip_debug_rtx(stack_pointer_rtx);
|
1237 |
|
|
+ if (dbg) zip_debug_rtx(frame_pointer_rtx);
|
1238 |
|
|
+ insn = emit_insn(gen_movsi_reg_off(frame_pointer_rtx,
|
1239 |
124 |
dgisselq |
+ stack_pointer_rtx,
|
1240 |
|
|
+ GEN_INT(cfun->machine->sp_fp_offset)));
|
1241 |
102 |
dgisselq |
+ RTX_FRAME_RELATED_P(insn) = 1;
|
1242 |
103 |
dgisselq |
+ if (dbg) fprintf(stderr, "sp_fp_offset is %d\n", cfun->machine->sp_fp_offset);
|
1243 |
102 |
dgisselq |
+ }
|
1244 |
|
|
+}
|
1245 |
|
|
+
|
1246 |
|
|
+bool
|
1247 |
|
|
+zip_use_return_insn(void)
|
1248 |
|
|
+{
|
1249 |
|
|
+ if ((!reload_completed)||(cfun->machine->fp_needed)
|
1250 |
|
|
+ ||(get_frame_size()!=0)) {
|
1251 |
|
|
+ // If R0 ever gets pushed to the stack, then we cannot
|
1252 |
|
|
+ // use a master return from anywhere. We need to clean up the
|
1253 |
|
|
+ // stack first.
|
1254 |
|
|
+ if ((!crtl->is_leaf)||((df_regs_ever_live_p(0))
|
1255 |
|
|
+ &&(!call_used_regs[0]))) {
|
1256 |
|
|
+ return false;
|
1257 |
|
|
+ }
|
1258 |
|
|
+ }
|
1259 |
|
|
+ zip_compute_frame();
|
1260 |
|
|
+ return (cfun->machine->size_for_adjusting_sp == 0);
|
1261 |
|
|
+}
|
1262 |
|
|
+
|
1263 |
|
|
+/* As per the notes in M68k.c, quote the function epilogue should not depend
|
1264 |
|
|
+ * upon the current stack pointer. It should use the frame poitner only,
|
1265 |
|
|
+ * if there is a frame pointer. This is mandatory because of alloca; we also
|
1266 |
|
|
+ * take advantage of it to omit stack adjustments before returning ...
|
1267 |
|
|
+ *
|
1268 |
|
|
+ * Let's see if we can use their approach here.
|
1269 |
|
|
+ *
|
1270 |
|
|
+ * We can't. Consider our choices:
|
1271 |
|
|
+ * LOD (FP),R0
|
1272 |
|
|
+ * LOD 1(FP),R4
|
1273 |
|
|
+ * LOD 2(FP),R5
|
1274 |
|
|
+ * LOD 3(FP),R6
|
1275 |
|
|
+ * LOD 4(FP),FP
|
1276 |
|
|
+ * ... Then what is the stack pointer?
|
1277 |
|
|
+ * or
|
1278 |
|
|
+ * LOD (FP),R0
|
1279 |
|
|
+ * LOD 1(FP),R4
|
1280 |
|
|
+ * LOD 2(FP),R5
|
1281 |
|
|
+ * LOD 3(FP),R6
|
1282 |
|
|
+ * MOV FP,SP
|
1283 |
|
|
+ * LOD 4(SP),FP
|
1284 |
|
|
+ * ... Which suffers unnecessary pipeline stalls, and certainly doesn't
|
1285 |
|
|
+ * exploit our pipeline memory function
|
1286 |
|
|
+ * or
|
1287 |
|
|
+ * MOV FP,SP
|
1288 |
|
|
+ * LOD (SP),R0
|
1289 |
|
|
+ * LOD 1(SP),R4
|
1290 |
|
|
+ * LOD 2(SP),R5
|
1291 |
|
|
+ * LOD 3(SP),R6
|
1292 |
|
|
+ * LOD 4(SP),FP
|
1293 |
|
|
+ * Which will be our choice. Note that we do use the stack pointer, eventually.
|
1294 |
|
|
+ *
|
1295 |
|
|
+ */
|
1296 |
|
|
+void
|
1297 |
|
|
+zip_expand_epilogue(void) {
|
1298 |
|
|
+ int regno, offset;
|
1299 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
1300 |
|
|
+
|
1301 |
|
|
+ zip_compute_frame();
|
1302 |
|
|
+
|
1303 |
|
|
+ if (dbg) fprintf(stderr, "EPILOG::\n");
|
1304 |
|
|
+ if (cfun->machine->fp_needed) {
|
1305 |
124 |
dgisselq |
+ // This is done special--if you can't trust the stack pointer
|
1306 |
|
|
+ // enough so that you must have a frame pointer, then you can't
|
1307 |
|
|
+ // trust its offset enough to restore from it. Hence, we start
|
1308 |
|
|
+ // by moving the frame pointer to the stack pointer to recover
|
1309 |
|
|
+ // the stack pointer back to a usable value.
|
1310 |
102 |
dgisselq |
+ if (dbg) fprintf(stderr, "EPILOG::Moving frame pointer to stack register\n");
|
1311 |
|
|
+ emit_insn(gen_movsi_reg(stack_pointer_rtx, frame_pointer_rtx));
|
1312 |
|
|
+ }
|
1313 |
|
|
+
|
1314 |
|
|
+ if (cfun->machine->saved_reg_size != 0) {
|
1315 |
124 |
dgisselq |
+ if (cfun->machine->fp_needed)
|
1316 |
|
|
+ offset = 0;
|
1317 |
|
|
+ else
|
1318 |
|
|
+ offset = cfun->machine->sp_fp_offset;
|
1319 |
102 |
dgisselq |
+ if (dbg) fprintf(stderr, "EPILOG::Saved_REG_Size = %d\n", cfun->machine->saved_reg_size);
|
1320 |
|
|
+ for(regno=0; regno < FIRST_PSEUDO_REGISTER; regno++) {
|
1321 |
|
|
+ if (zip_save_reg(regno)) {
|
1322 |
|
|
+ if (dbg) fprintf(stderr, "EPILOG::RESTORING R%d\n", regno);
|
1323 |
124 |
dgisselq |
+ emit_insn(gen_movsi_lod_off(
|
1324 |
102 |
dgisselq |
+ gen_rtx_REG(SImode, regno),
|
1325 |
124 |
dgisselq |
+ stack_pointer_rtx,
|
1326 |
|
|
+ GEN_INT(offset++)));
|
1327 |
102 |
dgisselq |
+ }
|
1328 |
|
|
+ }
|
1329 |
|
|
+ }
|
1330 |
|
|
+
|
1331 |
124 |
dgisselq |
+ if (cfun->machine->fp_needed) {
|
1332 |
|
|
+ // Restore the stack pointer back to the original, the
|
1333 |
|
|
+ // difference being the difference from the frame pointer
|
1334 |
|
|
+ // to the original stack
|
1335 |
|
|
+ emit_insn(gen_addsi3(stack_pointer_rtx, stack_pointer_rtx,
|
1336 |
|
|
+ GEN_INT(cfun->machine->size_for_adjusting_sp
|
1337 |
|
|
+ -cfun->machine->sp_fp_offset)));
|
1338 |
|
|
+ } else {
|
1339 |
|
|
+ // else now the difference is between the stack pointer and
|
1340 |
|
|
+ // the original stack pointer.
|
1341 |
102 |
dgisselq |
+ if (dbg) fprintf(stderr, "EPILOG::ADDSI3(StackPtr, %d)\n",
|
1342 |
|
|
+ cfun->machine->size_for_adjusting_sp);
|
1343 |
|
|
+ emit_insn(gen_addsi3(stack_pointer_rtx, stack_pointer_rtx,
|
1344 |
124 |
dgisselq |
+ GEN_INT(cfun->machine->size_for_adjusting_sp)));
|
1345 |
102 |
dgisselq |
+ }
|
1346 |
|
|
+ if (dbg) fprintf(stderr, "EPILOG::EMITTING-RETURN\n");
|
1347 |
|
|
+
|
1348 |
|
|
+ emit_jump_insn(ret_rtx);
|
1349 |
|
|
+}
|
1350 |
|
|
+
|
1351 |
|
|
+/* Implement RETURN_ADDR_RTX(COUNT, FRAMEADDR).
|
1352 |
|
|
+ *
|
1353 |
|
|
+ * We currently only support calculating the return address for the current
|
1354 |
|
|
+ * frame.
|
1355 |
|
|
+ */
|
1356 |
|
|
+
|
1357 |
|
|
+/*
|
1358 |
|
|
+rtx
|
1359 |
|
|
+zip_return_addr_rtx(int count, rtx frame ATTRIBUTE_UNUSED)
|
1360 |
|
|
+{
|
1361 |
|
|
+ if (count)
|
1362 |
|
|
+ return NULL_RTX;
|
1363 |
|
|
+
|
1364 |
|
|
+ zip_compute_frame();
|
1365 |
|
|
+
|
1366 |
|
|
+ // saved return address for current function is at fp - 1
|
1367 |
|
|
+ if (cfun->machine->save_ret)
|
1368 |
|
|
+ return gen_rtx_MEM(Pmode, plus_constant(frame_pointer_rtx,
|
1369 |
|
|
+ -UNITS_PER_WORD));
|
1370 |
|
|
+ return get_hard_reg_initial_val(Pmode, RETURN_ADDRESS_REGNUM);
|
1371 |
|
|
+}
|
1372 |
|
|
+*/
|
1373 |
|
|
+
|
1374 |
|
|
+/* Implements the macro INITIAL_ELIMINATION_OFFSET,
|
1375 |
|
|
+ * return the OFFSET.
|
1376 |
|
|
+ */
|
1377 |
|
|
+int
|
1378 |
|
|
+zip_initial_elimination_offset(int from, int to) {
|
1379 |
|
|
+ int ret = 0;
|
1380 |
|
|
+ zip_compute_frame();
|
1381 |
|
|
+
|
1382 |
|
|
+ if (((from) == FRAME_POINTER_REGNUM)&&((to) == STACK_POINTER_REGNUM)) {
|
1383 |
|
|
+ ret = cfun->machine->sp_fp_offset;
|
1384 |
117 |
dgisselq |
+ } else if (((from)=ARG_POINTER_REGNUM)&&((to)==STACK_POINTER_REGNUM)) {
|
1385 |
|
|
+ ret = cfun->machine->sp_fp_offset;
|
1386 |
102 |
dgisselq |
+ } else if (((from)=ARG_POINTER_REGNUM)&&((to)==FRAME_POINTER_REGNUM)) {
|
1387 |
117 |
dgisselq |
+ // ret = cfun->machine->local_vars_size;
|
1388 |
|
|
+ ret = 0;
|
1389 |
102 |
dgisselq |
+ } else {
|
1390 |
|
|
+ abort();
|
1391 |
|
|
+ }
|
1392 |
|
|
+
|
1393 |
|
|
+ return ret;
|
1394 |
|
|
+}
|
1395 |
|
|
+
|
1396 |
|
|
+/*
|
1397 |
|
|
+ * Code taken from m68k ...
|
1398 |
|
|
+ */
|
1399 |
|
|
+static bool
|
1400 |
|
|
+zip_can_eliminate(int from, int to)
|
1401 |
|
|
+{
|
1402 |
|
|
+ // fprintf(stderr, "CAN_ELIMINATE::QUERYING(%d,%d)\n", from, to);
|
1403 |
|
|
+ if ((from == zip_FP)&&(to == zip_SP))
|
1404 |
|
|
+ return !cfun->machine->fp_needed;
|
1405 |
|
|
+ return true;
|
1406 |
|
|
+}
|
1407 |
|
|
+
|
1408 |
|
|
+/*
|
1409 |
|
|
+static void
|
1410 |
|
|
+zip_basic_check(void)
|
1411 |
|
|
+{
|
1412 |
|
|
+ gcc_assert(mode_base_align[SImode]==4);
|
1413 |
|
|
+ if ((BITS_PER_UNIT != 32)
|
1414 |
|
|
+ ||(GET_MODE_SIZE(SImode)!=1)
|
1415 |
|
|
+ ||(GET_MODE_SIZE(DImode)!=1)
|
1416 |
|
|
+ ||(HARD_REGNO_NREGS(0,SImode)!=1)) {
|
1417 |
|
|
+ printf("SIZEOF(SIMode) == %d\n", GET_MODE_SIZE(SImode));
|
1418 |
|
|
+ printf("BITS_PER_UNIT == %d\n", BITS_PER_UNIT);
|
1419 |
|
|
+ gcc_assert(BITS_PER_UNIT==32);
|
1420 |
|
|
+ gcc_assert(GET_MODE_SIZE(SImode)==1);
|
1421 |
|
|
+ gcc_assert(HARD_REGNO_NREGS(0,SImode)==1);
|
1422 |
|
|
+ }
|
1423 |
|
|
+}
|
1424 |
|
|
+*/
|
1425 |
|
|
+
|
1426 |
|
|
+#define zip_basic_check()
|
1427 |
|
|
+
|
1428 |
|
|
+/* Compute the number of word sized regiters needed to hold a function
|
1429 |
|
|
+ * argument of mode INT_MODE and tree type TYPE.
|
1430 |
|
|
+ */
|
1431 |
|
|
+int
|
1432 |
|
|
+zip_num_arg_regs(enum machine_mode mode, const_tree type) {
|
1433 |
|
|
+ int size;
|
1434 |
|
|
+
|
1435 |
|
|
+ zip_basic_check();
|
1436 |
|
|
+
|
1437 |
|
|
+ if (targetm.calls.must_pass_in_stack(mode, type))
|
1438 |
|
|
+ return 0;
|
1439 |
|
|
+
|
1440 |
|
|
+ if ((type)&&(mode == BLKmode))
|
1441 |
|
|
+ size = int_size_in_bytes(type);
|
1442 |
|
|
+ else
|
1443 |
|
|
+ size = GET_MODE_SIZE(mode);
|
1444 |
|
|
+
|
1445 |
|
|
+ return (size + UNITS_PER_WORD - 1)/UNITS_PER_WORD;
|
1446 |
|
|
+}
|
1447 |
|
|
+
|
1448 |
|
|
+/* pushed in function prologue */
|
1449 |
|
|
+/*
|
1450 |
|
|
+static int
|
1451 |
|
|
+zip_arg_partial_bytes(CUMULATIVE_ARGS *cum, enum machine_mode mode,
|
1452 |
|
|
+ tree type, bool name ATTRIBUTE_UNUSED) {
|
1453 |
|
|
+ int words;
|
1454 |
|
|
+ unsigned int regs = zip_num_arg_regs(mode, type);
|
1455 |
|
|
+
|
1456 |
|
|
+ if (*cum >= ZIP_LAST_ARG_REGNO + 1)
|
1457 |
|
|
+ words = 0;
|
1458 |
|
|
+ else if ((*cum + regs) > ZIP_LAST_ARG_REGNO + 1)
|
1459 |
|
|
+ words = (*cum + regs) - ZIP_LAST_ARG_REGNO + 1;
|
1460 |
|
|
+ else
|
1461 |
|
|
+ words = 0;
|
1462 |
|
|
+
|
1463 |
|
|
+ return words * UNITS_PER_WORD;
|
1464 |
|
|
+}
|
1465 |
|
|
+*/
|
1466 |
|
|
+
|
1467 |
|
|
+static void
|
1468 |
|
|
+zip_function_arg_advance(cumulative_args_t ca, machine_mode mode,
|
1469 |
|
|
+ const_tree type, bool named ATTRIBUTE_UNUSED) {
|
1470 |
|
|
+ CUMULATIVE_ARGS *cum;
|
1471 |
|
|
+ int nreg;
|
1472 |
|
|
+
|
1473 |
|
|
+ zip_basic_check();
|
1474 |
|
|
+
|
1475 |
|
|
+ cum = get_cumulative_args(ca);
|
1476 |
|
|
+ nreg = zip_num_arg_regs(mode, type);
|
1477 |
|
|
+ if (((*cum)+nreg) > NUM_ARG_REGS)
|
1478 |
|
|
+ (*cum) = NUM_ARG_REGS;
|
1479 |
|
|
+ else
|
1480 |
|
|
+ (*cum) += nreg;
|
1481 |
|
|
+}
|
1482 |
|
|
+
|
1483 |
|
|
+static rtx
|
1484 |
|
|
+zip_function_arg(cumulative_args_t ca, machine_mode mode,
|
1485 |
|
|
+ const_tree type ATTRIBUTE_UNUSED, bool named) {
|
1486 |
|
|
+ CUMULATIVE_ARGS *cum;
|
1487 |
|
|
+
|
1488 |
|
|
+ zip_basic_check();
|
1489 |
|
|
+
|
1490 |
|
|
+
|
1491 |
|
|
+ if (!named)
|
1492 |
|
|
+ return NULL_RTX;
|
1493 |
|
|
+ //if (targetm.calls.must_pass_in_stack(mode, type))
|
1494 |
|
|
+ //return NULL_RTX;
|
1495 |
|
|
+ cum = get_cumulative_args(ca);
|
1496 |
|
|
+
|
1497 |
|
|
+ if ((*cum) >= NUM_ARG_REGS)
|
1498 |
|
|
+ return NULL_RTX;
|
1499 |
|
|
+ return
|
1500 |
|
|
+ gen_rtx_REG(mode, (*cum)+1);
|
1501 |
|
|
+}
|
1502 |
|
|
+
|
1503 |
122 |
dgisselq |
+#ifdef HAVE_cc0
|
1504 |
102 |
dgisselq |
+/* NOTICE_UPDATE_CC sends us here
|
1505 |
|
|
+ */
|
1506 |
|
|
+void
|
1507 |
|
|
+zip_update_cc_notice(rtx exp, rtx_insn *insn)
|
1508 |
|
|
+{
|
1509 |
122 |
dgisselq |
+#error "The CC0 code was supposed to be removed"
|
1510 |
102 |
dgisselq |
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
1511 |
|
|
+ enum attr_ccresult ccr;
|
1512 |
|
|
+ enum attr_conditional conditionally_executed;
|
1513 |
|
|
+
|
1514 |
|
|
+ // The default is that nothing has changed.
|
1515 |
|
|
+ // cc_status = cc_status_prev;
|
1516 |
|
|
+ rtx src, dest;
|
1517 |
|
|
+
|
1518 |
|
|
+ if (dbg) fprintf(stderr, "CC-NOTICE ...\n");
|
1519 |
|
|
+ if (dbg) zip_debug_rtx_pfx("CC :", exp);
|
1520 |
|
|
+ if (dbg) debug_rtx(exp);
|
1521 |
|
|
+
|
1522 |
|
|
+ ccr = get_attr_ccresult(insn);
|
1523 |
|
|
+ if (ccr == CCRESULT_UNKNOWN) {
|
1524 |
|
|
+ CC_STATUS_INIT;
|
1525 |
|
|
+ if (dbg) fprintf(stderr, "\tINIT-CC\n");
|
1526 |
|
|
+ return;
|
1527 |
|
|
+ }
|
1528 |
|
|
+
|
1529 |
|
|
+ if ((GET_CODE(exp) == PARALLEL)&&(GET_CODE(XVECEXP(exp, 0, 0))==SET)) {
|
1530 |
|
|
+ // This works up and until we add cc0 parallel instructions
|
1531 |
|
|
+ // to our instruction set.
|
1532 |
|
|
+ dest = SET_DEST(XVECEXP(exp, 0, 0));
|
1533 |
|
|
+ src = SET_SRC (XVECEXP(exp, 0, 0));
|
1534 |
|
|
+ } else if (GET_CODE(exp) == SET) {
|
1535 |
|
|
+ dest = SET_DEST(exp);
|
1536 |
|
|
+ src = SET_SRC (exp);
|
1537 |
|
|
+ } else {
|
1538 |
|
|
+ // First, do nothing if we haven't touched the condition codes.
|
1539 |
|
|
+ // Condition codes can only be changed as a result of a set
|
1540 |
|
|
+ // expression ...?
|
1541 |
|
|
+ if (dbg) fprintf(stderr, "Non-set expression, doesn\'t touch condition codes\n");
|
1542 |
|
|
+ return;
|
1543 |
|
|
+ }
|
1544 |
|
|
+
|
1545 |
111 |
dgisselq |
+
|
1546 |
|
|
+ if (ccr == CCRESULT_UNCHANGED) {
|
1547 |
|
|
+ if (dbg) fprintf(stderr, "\tUnchanged CC\n");
|
1548 |
|
|
+
|
1549 |
|
|
+ // We can't just run away here ... even though the CC result
|
1550 |
|
|
+ // hasn't changed, GCC's ability to recognize it as a valid
|
1551 |
|
|
+ // result has changed. In other words, if we just 'set' a
|
1552 |
|
|
+ // value contained within either value1 or value2, then we'll
|
1553 |
|
|
+ // need to update those values so that they are no longer looked
|
1554 |
|
|
+ // upon as potentially containing the current CC values.
|
1555 |
|
|
+
|
1556 |
|
|
+ if (dest) {
|
1557 |
|
|
+ if (dest == cc0_rtx)
|
1558 |
|
|
+ CC_STATUS_INIT;
|
1559 |
|
|
+ else if ((REG_P(dest))&&(dest != pc_rtx)) {
|
1560 |
|
|
+ // An example here might be a load instruction
|
1561 |
|
|
+ if (reg_mentioned_p(dest, cc_status.value1))
|
1562 |
|
|
+ cc_status.value1 = NULL_RTX;
|
1563 |
|
|
+ if (reg_mentioned_p(dest, cc_status.value2))
|
1564 |
|
|
+ cc_status.value2 = NULL_RTX;
|
1565 |
|
|
+ }
|
1566 |
|
|
+ }
|
1567 |
|
|
+ return;
|
1568 |
|
|
+ }
|
1569 |
|
|
+
|
1570 |
102 |
dgisselq |
+ // Gotta wait on this test, until we know whether or not the
|
1571 |
|
|
+ // conditionally executed instruction was designed to set the
|
1572 |
|
|
+ // CC0 register.
|
1573 |
|
|
+ conditionally_executed = get_attr_conditional(insn);
|
1574 |
|
|
+ if ((conditionally_executed == CONDITIONAL_YES)&&(dest != cc0_rtx)) {
|
1575 |
|
|
+ // cc_status is unchanged
|
1576 |
111 |
dgisselq |
+ // However, GCC's vision of it may have changed
|
1577 |
|
|
+ //
|
1578 |
|
|
+ // Initialize CC_STATUS
|
1579 |
102 |
dgisselq |
+ if (dbg) fprintf(stderr, "\tCC -- unchanged (conditional exec)\n");
|
1580 |
111 |
dgisselq |
+ CC_STATUS_INIT;
|
1581 |
102 |
dgisselq |
+ return;
|
1582 |
111 |
dgisselq |
+ } else if (GET_CODE(src)==IF_THEN_ELSE) {
|
1583 |
|
|
+ // Same thing as above
|
1584 |
|
|
+ CC_STATUS_INIT;
|
1585 |
|
|
+ return;
|
1586 |
102 |
dgisselq |
+ }
|
1587 |
|
|
+
|
1588 |
|
|
+ if (ccr == CCRESULT_VALIDZN)
|
1589 |
|
|
+ cc_status.flags = CC_NO_OVERFLOW;
|
1590 |
|
|
+ else
|
1591 |
|
|
+ cc_status.flags = 0;
|
1592 |
|
|
+ cc_status.value1 = dest;
|
1593 |
|
|
+ if (dest == cc0_rtx)
|
1594 |
|
|
+ cc_status.value2 = src;
|
1595 |
|
|
+ else if((REG_P(dest))&&(!reg_mentioned_p(dest, src)))
|
1596 |
|
|
+ cc_status.value2 = src;
|
1597 |
|
|
+ else if((SUBREG_P(dest))&&(!reg_mentioned_p(XEXP(dest,0), src)))
|
1598 |
|
|
+ cc_status.value2 = src;
|
1599 |
|
|
+ else
|
1600 |
|
|
+ cc_status.value2 = 0;
|
1601 |
|
|
+ if (dbg) fprintf(stderr, "\tCC -- Set flags for\n");
|
1602 |
|
|
+ if (dbg) zip_debug_rtx_pfx("V1: ", dest);
|
1603 |
|
|
+ if ((dbg)&&(cc_status.value2)) zip_debug_rtx_pfx("V2: ", src);
|
1604 |
|
|
+ else if (dbg) fprintf(stderr, "V2: (No SRC)\n");
|
1605 |
|
|
+ if ((dbg)&&(REG_P(dest))) fprintf(stderr, "src refers to dest ?? %s\n",
|
1606 |
|
|
+ refers_to_regno_p(REGNO(dest),REGNO(dest),src,NULL)?"Yes":"No");
|
1607 |
|
|
+ if ((dbg)&&(REG_P(dest))) fprintf(stderr, "Occurrs %d times\n",
|
1608 |
|
|
+ count_occurrences(dest,src,0));
|
1609 |
|
|
+ if ((dbg)&&(REG_P(dest))) fprintf(stderr, "%s mentioned\n",
|
1610 |
|
|
+ reg_mentioned_p(dest,src)?"Is":"Is not");
|
1611 |
|
|
+ if ((dbg)&&(REG_P(dest))) fprintf(stderr, "%s referenced\n",
|
1612 |
|
|
+ reg_referenced_p(dest,src)?"Is":"Is not");
|
1613 |
|
|
+
|
1614 |
|
|
+//
|
1615 |
|
|
+// These results are only used in final.c, where they are used to remove
|
1616 |
|
|
+// compare instructions if the optimizer is on. If I produce nothing, no
|
1617 |
|
|
+// compare instructions will be removed. If I produce something, a smart
|
1618 |
|
|
+// decision may be made to remove compare instructions.
|
1619 |
|
|
+//
|
1620 |
|
|
+// cc_status will be compared with subsequent
|
1621 |
|
|
+// (set (cc0) (something)) (i.e. compare only) instructions
|
1622 |
|
|
+//
|
1623 |
|
|
+// (set (cc0) (compare (x) (y)))
|
1624 |
|
|
+// dst = cc0 -- the destination of the set is ignored, save that it must be
|
1625 |
|
|
+// cc0
|
1626 |
|
|
+// src1 = (compare (x) (y))
|
1627 |
|
|
+// if (src1 == compare)&&(y == (const_int 0))
|
1628 |
|
|
+// src2 = (x)
|
1629 |
|
|
+// else
|
1630 |
|
|
+// src2 = null
|
1631 |
|
|
+//
|
1632 |
|
|
+// Four conditions:
|
1633 |
|
|
+// 1. if (val1)&&(src1 == val1)
|
1634 |
|
|
+// This would be true if I had seen a (set (val1) (src1)) insn
|
1635 |
|
|
+// If I have seen a (set (val1) (src1))
|
1636 |
|
|
+// or equivalently a (set (val1) (compare (x) (y)))
|
1637 |
|
|
+// or
|
1638 |
|
|
+// 2. if (val2)&&(src1 == val2)
|
1639 |
|
|
+// This would be true if I had seen a (set (val1) (src1)) insn,
|
1640 |
|
|
+// and only if val2 was still valid.
|
1641 |
|
|
+// or
|
1642 |
|
|
+// 3. if (src2)&&(value1)&&(src2 == value1)
|
1643 |
|
|
+// This would be true if we are comparing against zero, and the
|
1644 |
|
|
+// number we are comparing against zero is value 1
|
1645 |
|
|
+// or
|
1646 |
|
|
+// 4. if (src2)&&(value2)&&(src2 == value2)
|
1647 |
|
|
+// ... or value2. This is the common ZipCPU case.
|
1648 |
|
|
+//
|
1649 |
|
|
+// then delete the compare.
|
1650 |
|
|
+//
|
1651 |
|
|
+}
|
1652 |
122 |
dgisselq |
+#else
|
1653 |
102 |
dgisselq |
+
|
1654 |
122 |
dgisselq |
+void zip_canonicalize_comparison(int *code, rtx *op0, rtx *op1,
|
1655 |
|
|
+ bool preserve_op0)
|
1656 |
|
|
+{
|
1657 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
1658 |
102 |
dgisselq |
+
|
1659 |
122 |
dgisselq |
+ if (dbg) fprintf(stderr, "CANONICALIZE ...%s\n", (preserve_op0)?"(Preserve Op0)":"");
|
1660 |
|
|
+ if (dbg) zip_debug_rtx_pfx("CODE", gen_rtx_fmt_ee((rtx_code)*code, VOIDmode, gen_rtx_REG(CCmode,zip_CC), const0_rtx));
|
1661 |
|
|
+ if (dbg) zip_debug_rtx_pfx("OP0 ", *op0);
|
1662 |
|
|
+ if (dbg) zip_debug_rtx_pfx("OP1 ", *op1);
|
1663 |
|
|
+
|
1664 |
|
|
+ if ((!preserve_op0)&&((*code == LE)||(*code == GTU)||(*code == GEU))) {
|
1665 |
|
|
+ rtx tem = *op0;
|
1666 |
|
|
+ *op0 = *op1;
|
1667 |
|
|
+ *op1 = tem;
|
1668 |
|
|
+ *code = (int)swap_condition((enum rtx_code)*code);
|
1669 |
|
|
+ }
|
1670 |
|
|
+
|
1671 |
|
|
+ if ((*code == LE)||(*code == LEU)||(*code == GTU)) {
|
1672 |
|
|
+ int offset = 1; // (*code == GTU) ? 1 : -1;
|
1673 |
|
|
+ bool swap = false;
|
1674 |
|
|
+
|
1675 |
|
|
+ if (CONST_INT_P(*op1)) {
|
1676 |
|
|
+ *op1 = GEN_INT(INTVAL(*op1)+offset);
|
1677 |
|
|
+ swap = true;
|
1678 |
|
|
+ } else if (REG_P(*op1)) {
|
1679 |
|
|
+ *op1 = plus_constant(SImode, *op1, offset, true);
|
1680 |
|
|
+ swap = true;
|
1681 |
|
|
+ } else if ((GET_CODE(*op1)==PLUS)&&(CONST_INT_P(XEXP(*op1,1)))){
|
1682 |
|
|
+ *op1 = plus_constant(GET_MODE(*op1),XEXP(*op1,0),
|
1683 |
|
|
+ INTVAL(XEXP(*op1,1))+offset);
|
1684 |
|
|
+ swap = true;
|
1685 |
|
|
+ } if (swap) {
|
1686 |
|
|
+ if (*code == LE)
|
1687 |
|
|
+ (*code)= LT;
|
1688 |
|
|
+ else if (*code == LEU)
|
1689 |
|
|
+ (*code)= LTU;
|
1690 |
|
|
+ else // (*code == GTU)
|
1691 |
|
|
+ (*code) = GEU;
|
1692 |
|
|
+ }
|
1693 |
|
|
+ }
|
1694 |
|
|
+}
|
1695 |
|
|
+
|
1696 |
|
|
+static bool
|
1697 |
|
|
+zip_fixed_condition_code_regs(unsigned int *a, unsigned int *b) {
|
1698 |
|
|
+ *a = zip_CC;
|
1699 |
|
|
+ *b = INVALID_REGNUM;
|
1700 |
|
|
+ return true;
|
1701 |
|
|
+}
|
1702 |
|
|
+
|
1703 |
|
|
+#endif
|
1704 |
|
|
+
|
1705 |
|
|
+
|
1706 |
102 |
dgisselq |
+/* totally buggy - we can't return pointers to nested functions */
|
1707 |
|
|
+static void
|
1708 |
|
|
+zip_asm_trampoline_template(FILE *f) {
|
1709 |
|
|
+ // Whereas at one time I thought I wouldn't need it, now I know I
|
1710 |
|
|
+ // need this trampoline function, although it is for a completely
|
1711 |
|
|
+ // different purpose than the one I was familiar with.
|
1712 |
|
|
+ fprintf(f, "\tldihi 0,r1\n");
|
1713 |
|
|
+ fprintf(f, "\tldilo 0,r1\n");
|
1714 |
|
|
+ fprintf(f, "\tjmp r1\n");
|
1715 |
|
|
+}
|
1716 |
|
|
+
|
1717 |
|
|
+/* Worker function for TARGET_TRAMPOLINE_INIT. */
|
1718 |
|
|
+static void
|
1719 |
|
|
+zip_trampoline_init(rtx m_tramp ATTRIBUTE_UNUSED,
|
1720 |
|
|
+ tree fndecl ATTRIBUTE_UNUSED,
|
1721 |
|
|
+ rtx chain_value ATTRIBUTE_UNUSED) {
|
1722 |
|
|
+// #warning "This needs to be filled out"
|
1723 |
|
|
+ abort();
|
1724 |
|
|
+}
|
1725 |
|
|
+
|
1726 |
|
|
+static tree
|
1727 |
|
|
+def_builtin(const char *name, enum insn_code icode, enum ZIP_BUILTIN_ID_CODE code,
|
1728 |
|
|
+ tree type)
|
1729 |
|
|
+{
|
1730 |
|
|
+ tree t = add_builtin_function(name,type,code,BUILT_IN_MD, NULL, NULL_TREE);
|
1731 |
|
|
+ zip_basic_check();
|
1732 |
|
|
+
|
1733 |
|
|
+ if(t) {
|
1734 |
|
|
+ zip_builtins[code] = t;
|
1735 |
|
|
+ zip_builtins_icode[code] = icode;
|
1736 |
|
|
+ }
|
1737 |
|
|
+
|
1738 |
|
|
+ return t;
|
1739 |
|
|
+
|
1740 |
|
|
+}
|
1741 |
|
|
+
|
1742 |
|
|
+void zip_init_builtins(void) {
|
1743 |
|
|
+ zip_basic_check();
|
1744 |
|
|
+
|
1745 |
|
|
+ tree void_ftype_void = build_function_type_list(void_type_node, NULL_TREE);
|
1746 |
|
|
+#ifdef HAVE_zip_rtu
|
1747 |
|
|
+ def_builtin("zip_rtu", CODE_FOR_zip_rtu, ZIP_BUILTIN_RTU, void_ftype_void);
|
1748 |
|
|
+#endif
|
1749 |
|
|
+#ifdef HAVE_zip_halt
|
1750 |
|
|
+ def_builtin("zip_halt", CODE_FOR_zip_halt, ZIP_BUILTIN_HALT, void_ftype_void);
|
1751 |
|
|
+#endif
|
1752 |
|
|
+#ifdef HAVE_zip_idle
|
1753 |
|
|
+ def_builtin("zip_idle", CODE_FOR_zip_idle, ZIP_BUILTIN_IDLE, void_ftype_void);
|
1754 |
|
|
+#endif
|
1755 |
|
|
+
|
1756 |
|
|
+#ifdef HAVE_zip_syscall
|
1757 |
|
|
+// Support int SYSCALL(callID, int a, int b, int c);
|
1758 |
|
|
+ def_builtin("zip_syscall", CODE_FOR_zip_syscall, ZIP_BUILTIN_SYSCALL,
|
1759 |
|
|
+ build_function_type_list(void_type_node, NULL_TREE));
|
1760 |
|
|
+#endif
|
1761 |
|
|
+
|
1762 |
|
|
+#ifdef HAVE_zip_save_context
|
1763 |
|
|
+ def_builtin("zip_save_context", CODE_FOR_zip_save_context, ZIP_BUILTIN_SAVE_CONTEXT,
|
1764 |
|
|
+ build_function_type_list(void_type_node, ptr_type_node, 0));
|
1765 |
|
|
+#endif
|
1766 |
|
|
+
|
1767 |
|
|
+#ifdef HAVE_zip_restore_context
|
1768 |
|
|
+ def_builtin("zip_restore_context", CODE_FOR_zip_restore_context, ZIP_BUILTIN_RESTORE_CONTEXT,
|
1769 |
|
|
+ build_function_type_list(void_type_node, ptr_type_node, 0));
|
1770 |
|
|
+#endif
|
1771 |
|
|
+
|
1772 |
|
|
+#ifdef HAVE_zip_bitrev
|
1773 |
|
|
+ def_builtin("zip_bitrev", CODE_FOR_zip_bitrev, ZIP_BUILTIN_BITREV,
|
1774 |
|
|
+ build_function_type_list(unsigned_type_node, unsigned_type_node,
|
1775 |
|
|
+ NULL_TREE));
|
1776 |
|
|
+#endif
|
1777 |
|
|
+
|
1778 |
|
|
+#ifdef HAVE_zip_cc
|
1779 |
|
|
+ def_builtin("zip_cc", CODE_FOR_zip_cc, ZIP_BUILTIN_CC,
|
1780 |
|
|
+ build_function_type_list(unsigned_type_node, NULL_TREE));
|
1781 |
|
|
+#endif
|
1782 |
|
|
+
|
1783 |
117 |
dgisselq |
+#ifdef HAVE_zip_ucc
|
1784 |
|
|
+ def_builtin("zip_ucc", CODE_FOR_zip_ucc, ZIP_BUILTIN_UCC,
|
1785 |
|
|
+ build_function_type_list(unsigned_type_node, NULL_TREE));
|
1786 |
|
|
+#endif
|
1787 |
|
|
+
|
1788 |
102 |
dgisselq |
+}
|
1789 |
|
|
+
|
1790 |
|
|
+static tree
|
1791 |
|
|
+zip_builtin_decl(unsigned zip_builtin_code, bool initialize_p ATTRIBUTE_UNUSED)
|
1792 |
|
|
+{
|
1793 |
|
|
+ if (zip_builtin_code >= ZIP_BUILTIN_MAX)
|
1794 |
|
|
+ return error_mark_node;
|
1795 |
|
|
+
|
1796 |
|
|
+ return zip_builtins[zip_builtin_code];
|
1797 |
|
|
+}
|
1798 |
|
|
+
|
1799 |
|
|
+static rtx
|
1800 |
|
|
+zip_expand_builtin(tree exp, rtx target,
|
1801 |
|
|
+ rtx subtarget ATTRIBUTE_UNUSED,
|
1802 |
|
|
+ machine_mode tmode ATTRIBUTE_UNUSED,
|
1803 |
|
|
+ int ignore ATTRIBUTE_UNUSED) {
|
1804 |
|
|
+
|
1805 |
|
|
+ tree fndecl = TREE_OPERAND(CALL_EXPR_FN(exp), 0);
|
1806 |
|
|
+ bool nonvoid = (TREE_TYPE(TREE_TYPE(fndecl)) != void_type_node);
|
1807 |
|
|
+ enum ZIP_BUILTIN_ID_CODE code=(enum ZIP_BUILTIN_ID_CODE)DECL_FUNCTION_CODE(fndecl);
|
1808 |
|
|
+ enum insn_code icode = zip_builtins_icode[code];
|
1809 |
|
|
+ rtx pat, op[5];
|
1810 |
|
|
+ call_expr_arg_iterator iter;
|
1811 |
|
|
+ tree arg;
|
1812 |
|
|
+
|
1813 |
|
|
+ if ((code == ZIP_BUILTIN_SAVE_CONTEXT)
|
1814 |
|
|
+ ||(code == ZIP_BUILTIN_RESTORE_CONTEXT)) {
|
1815 |
|
|
+ arg = first_call_expr_arg(exp, &iter);
|
1816 |
|
|
+ if (arg == error_mark_node)
|
1817 |
|
|
+ return NULL_RTX;
|
1818 |
|
|
+ op[0] = expand_normal(arg);
|
1819 |
|
|
+ if (GET_CODE(op[0]) != REG)
|
1820 |
|
|
+ op[0] = force_reg(Pmode, op[0]);
|
1821 |
|
|
+ pat = GEN_FCN(icode)(op[0]);
|
1822 |
|
|
+ } else if (code == ZIP_BUILTIN_BITREV) {
|
1823 |
|
|
+ arg = first_call_expr_arg(exp, &iter);
|
1824 |
|
|
+ if (arg == error_mark_node) {
|
1825 |
|
|
+ return NULL_RTX;
|
1826 |
|
|
+ }
|
1827 |
|
|
+ op[0] = expand_normal(arg);
|
1828 |
|
|
+ if (!target)
|
1829 |
|
|
+ target = gen_reg_rtx(SImode);
|
1830 |
|
|
+ pat = GEN_FCN(icode)(target, op[0]);
|
1831 |
117 |
dgisselq |
+ } else if ((code == ZIP_BUILTIN_CC)||(code == ZIP_BUILTIN_UCC)) {
|
1832 |
102 |
dgisselq |
+ if (!target)
|
1833 |
|
|
+ target = gen_reg_rtx(SImode);
|
1834 |
|
|
+ pat = GEN_FCN(icode)(target);
|
1835 |
|
|
+ } else // RTU, HALT, IDLE
|
1836 |
|
|
+ pat = GEN_FCN(icode)();
|
1837 |
|
|
+ if (!pat)
|
1838 |
|
|
+ return NULL_RTX;
|
1839 |
|
|
+ emit_insn(pat);
|
1840 |
|
|
+ return (nonvoid ? target : const0_rtx);
|
1841 |
|
|
+}
|
1842 |
|
|
+
|
1843 |
|
|
+static bool
|
1844 |
|
|
+zip_scalar_mode_supported_p(enum machine_mode mode) {
|
1845 |
|
|
+ zip_basic_check();
|
1846 |
|
|
+
|
1847 |
|
|
+ return ((mode)==SImode)||((mode)==DImode); // ||((mode)==SFmode);
|
1848 |
|
|
+}
|
1849 |
|
|
+
|
1850 |
|
|
+static bool
|
1851 |
|
|
+zip_libgcc_floating_mode_supported_p(enum machine_mode mode) {
|
1852 |
|
|
+ return ((mode)==SFmode)||((mode)==DFmode);
|
1853 |
|
|
+}
|
1854 |
|
|
+
|
1855 |
|
|
+static int
|
1856 |
|
|
+zip_address_cost(rtx addr ATTRIBUTE_UNUSED,
|
1857 |
|
|
+ enum machine_mode mode ATTRIBUTE_UNUSED,
|
1858 |
|
|
+ addr_space_t as ATTRIBUTE_UNUSED, bool spd ATTRIBUTE_UNUSED) {
|
1859 |
|
|
+ return 1;
|
1860 |
|
|
+}
|
1861 |
|
|
+
|
1862 |
|
|
+static bool
|
1863 |
|
|
+zip_mode_dependent_address_p(const_rtx addr ATTRIBUTE_UNUSED,
|
1864 |
|
|
+ addr_space_t as ATTRIBUTE_UNUSED) {
|
1865 |
|
|
+ return false;
|
1866 |
|
|
+}
|
1867 |
|
|
+
|
1868 |
|
|
+/*
|
1869 |
|
|
+static void
|
1870 |
|
|
+zip_asm_output_anchor(rtx x) {
|
1871 |
|
|
+ printf("ANCHOR: OP(%d)\n", GET_CODE(x));
|
1872 |
|
|
+}
|
1873 |
|
|
+*/
|
1874 |
|
|
+
|
1875 |
|
|
+static void
|
1876 |
|
|
+zip_debug_print(const char *pfx, int lvl, const char *str) {
|
1877 |
|
|
+ int i;
|
1878 |
|
|
+ i = lvl;
|
1879 |
|
|
+ if ((true)||(lvl == 0))
|
1880 |
|
|
+ fprintf(stderr, "%s", pfx);
|
1881 |
|
|
+ else
|
1882 |
|
|
+ i += strlen(pfx);
|
1883 |
|
|
+ while(i-->0)
|
1884 |
|
|
+ fprintf(stderr, " ");
|
1885 |
|
|
+ fprintf(stderr, "%s\n", str);
|
1886 |
|
|
+}
|
1887 |
|
|
+
|
1888 |
|
|
+static void
|
1889 |
|
|
+zip_debug_print_m(const char *pfx, int lvl, const char *str, enum machine_mode m) {
|
1890 |
|
|
+ int i;
|
1891 |
|
|
+
|
1892 |
|
|
+ i = lvl;
|
1893 |
|
|
+ if ((true)||(lvl == 0))
|
1894 |
|
|
+ fprintf(stderr, "%s", pfx);
|
1895 |
|
|
+ else
|
1896 |
|
|
+ i = lvl+strlen(pfx);
|
1897 |
|
|
+ while(i-->0)
|
1898 |
|
|
+ fprintf(stderr, " ");
|
1899 |
|
|
+ switch(m) {
|
1900 |
|
|
+ case VOIDmode:
|
1901 |
|
|
+ fprintf(stderr, "%s:V\n", str);
|
1902 |
|
|
+ break;
|
1903 |
|
|
+ case BLKmode:
|
1904 |
|
|
+ fprintf(stderr, "%s:BLK\n", str);
|
1905 |
|
|
+ break;
|
1906 |
|
|
+ case BImode:
|
1907 |
|
|
+ fprintf(stderr, "%s:BI\n", str);
|
1908 |
|
|
+ break;
|
1909 |
|
|
+#ifdef HAVE_QImode
|
1910 |
|
|
+ case QImode:
|
1911 |
|
|
+ fprintf(stderr, "%s:QI\n", str);
|
1912 |
|
|
+ break;
|
1913 |
|
|
+#endif
|
1914 |
|
|
+#ifdef HAVE_HImode
|
1915 |
|
|
+ case HImode:
|
1916 |
|
|
+ fprintf(stderr, "%s:HI\n", str);
|
1917 |
|
|
+ break;
|
1918 |
|
|
+#endif
|
1919 |
|
|
+ case SImode:
|
1920 |
|
|
+ fprintf(stderr, "%s:SI\n", str);
|
1921 |
|
|
+ break;
|
1922 |
122 |
dgisselq |
+ case CCmode:
|
1923 |
|
|
+ fprintf(stderr, "%s:CC\n", str);
|
1924 |
|
|
+ break;
|
1925 |
102 |
dgisselq |
+ case DImode:
|
1926 |
|
|
+ fprintf(stderr, "%s:DI\n", str);
|
1927 |
|
|
+ break;
|
1928 |
|
|
+ default:
|
1929 |
|
|
+ fprintf(stderr, "%s:?\n", str);
|
1930 |
|
|
+ }
|
1931 |
|
|
+}
|
1932 |
|
|
+
|
1933 |
|
|
+static void
|
1934 |
|
|
+zip_debug_rtx_1(const char *pfx, const_rtx x, int lvl) {
|
1935 |
|
|
+ if (x == NULL_RTX) {
|
1936 |
|
|
+ zip_debug_print(pfx, lvl, "(NULL-RTX)");
|
1937 |
|
|
+ return;
|
1938 |
|
|
+ } else if (GET_CODE(x) > NUM_RTX_CODE) {
|
1939 |
|
|
+ char buf[64];
|
1940 |
|
|
+ sprintf(buf, "(BAD-RTX-CODE %d)", GET_CODE(x));
|
1941 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
1942 |
117 |
dgisselq |
+ gcc_assert(0 && "Bad RTX Code");
|
1943 |
102 |
dgisselq |
+ return;
|
1944 |
|
|
+ } switch(GET_CODE(x)) { // rtl.def
|
1945 |
122 |
dgisselq |
+ case PARALLEL:
|
1946 |
|
|
+ zip_debug_print(pfx, lvl, "(PARALLEL");
|
1947 |
|
|
+ for(int j=0; j<XVECLEN(x,0);j++)
|
1948 |
|
|
+ zip_debug_rtx_1(pfx, XVECEXP(x,0,j), lvl+1);
|
1949 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
1950 |
|
|
+ debug_rtx(x);
|
1951 |
|
|
+ break;
|
1952 |
102 |
dgisselq |
+ case INT_LIST: zip_debug_print(pfx, lvl, "(INT-LIST"); break;
|
1953 |
122 |
dgisselq |
+ case SEQUENCE:
|
1954 |
|
|
+ zip_debug_print(pfx, lvl, "(SEQUENCE");
|
1955 |
|
|
+ for(int j=0; j<XVECLEN(x,0);j++)
|
1956 |
|
|
+ zip_debug_rtx_1(pfx, XVECEXP(x,0,j), lvl+1);
|
1957 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
1958 |
|
|
+ debug_rtx(x);
|
1959 |
|
|
+ break;
|
1960 |
102 |
dgisselq |
+ case ADDRESS: zip_debug_print(pfx, lvl, "(ADDRESS"); break;
|
1961 |
|
|
+ case DEBUG_INSN: zip_debug_print(pfx, lvl, "(DEBUG-INSN"); break;
|
1962 |
|
|
+ case INSN:
|
1963 |
|
|
+ zip_debug_print(pfx, lvl, "(INSN");
|
1964 |
|
|
+ /*
|
1965 |
|
|
+ { const rtx_insn *tmp_rtx;
|
1966 |
|
|
+ for(tmp_rtx = as_a <const rtx_insn *>(x); tmp_rtx != 0; tmp_rtx = NEXT_INSN(tmp_rtx)) {
|
1967 |
|
|
+ zip_debug_rtx_1(tmp_rtx, lvl+1);
|
1968 |
|
|
+ }}
|
1969 |
|
|
+ */
|
1970 |
|
|
+ zip_debug_rtx_1(pfx, PATTERN(x), lvl+1);
|
1971 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
1972 |
117 |
dgisselq |
+ debug_rtx(x);
|
1973 |
102 |
dgisselq |
+ break;
|
1974 |
|
|
+ case JUMP_INSN: zip_debug_print(pfx, lvl, "(JUMP-INSN");
|
1975 |
111 |
dgisselq |
+ zip_debug_rtx_1(pfx, PATTERN(x), lvl+1);
|
1976 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
1977 |
|
|
+ /*
|
1978 |
102 |
dgisselq |
+ if (JUMP_LABEL(x)) {
|
1979 |
111 |
dgisselq |
+ if (GET_CODE(JUMP_LABEL(x)) == LABEL_REF) {
|
1980 |
|
|
+ char buf[64];
|
1981 |
|
|
+ sprintf(buf, "(LABEL *.L%d))", CODE_LABEL_NUMBER(LABEL_REF_LABEL(JUMP_LABEL(x))));
|
1982 |
|
|
+ zip_debug_print(pfx, lvl+1, buf);
|
1983 |
|
|
+ } else if (GET_CODE(JUMP_LABEL(x))==CODE_LABEL) {
|
1984 |
|
|
+ char buf[64];
|
1985 |
|
|
+ sprintf(buf, "(CODE_LABEL *.L%d))", CODE_LABEL_NUMBER(JUMP_LABEL(x)));
|
1986 |
|
|
+ zip_debug_print(pfx, lvl+1, buf);
|
1987 |
|
|
+ } else
|
1988 |
|
|
+ zip_debug_print(pfx, lvl+1, "(w/Label))");
|
1989 |
102 |
dgisselq |
+ } else
|
1990 |
111 |
dgisselq |
+ zip_debug_print(pfx, lvl+1, "(NO label))");
|
1991 |
|
|
+ debug_rtx(x);
|
1992 |
|
|
+ */
|
1993 |
102 |
dgisselq |
+ break;
|
1994 |
|
|
+ case CALL:
|
1995 |
|
|
+ zip_debug_print(pfx, lvl, "(CALL (Adr) (Args)");
|
1996 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0), lvl+1);
|
1997 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1), lvl+1);
|
1998 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
1999 |
|
|
+ break;
|
2000 |
|
|
+ case CALL_INSN: zip_debug_print(pfx, lvl, "(CALL-INSN");
|
2001 |
|
|
+ debug_rtx(x);
|
2002 |
|
|
+ break;
|
2003 |
|
|
+ case BARRIER: zip_debug_print(pfx, lvl, "(BARRIER)"); break;
|
2004 |
|
|
+ case RETURN: zip_debug_print(pfx, lvl, "(RETURN)"); break;
|
2005 |
|
|
+ case NOTE:
|
2006 |
|
|
+ { char buf[128];
|
2007 |
|
|
+ sprintf(buf, "(NOTE %s)", GET_REG_NOTE_NAME(GET_MODE(x)));
|
2008 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
2009 |
|
|
+ }break;
|
2010 |
|
|
+ case COND_EXEC: zip_debug_print(pfx, lvl, "(COND_EXEC)");
|
2011 |
|
|
+ debug_rtx(x);
|
2012 |
|
|
+ break;
|
2013 |
|
|
+ case ASM_INPUT: zip_debug_print(pfx, lvl, "(ASM INPUT)"); break;
|
2014 |
|
|
+ case ASM_OPERANDS: zip_debug_print(pfx, lvl, "(ASM OPERANDS)"); break;
|
2015 |
|
|
+ case UNSPEC: zip_debug_print(pfx, lvl, "(UNSPEC)"); break;
|
2016 |
|
|
+ case UNSPEC_VOLATILE: zip_debug_print(pfx, lvl, "(UNSPEC_VOLATILE)"); break;
|
2017 |
|
|
+ case CODE_LABEL:
|
2018 |
|
|
+ {
|
2019 |
|
|
+ char buf[64];
|
2020 |
111 |
dgisselq |
+ sprintf(buf, "(CODE_LABEL *.L%d)", CODE_LABEL_NUMBER(x));
|
2021 |
102 |
dgisselq |
+ zip_debug_print_m(pfx, lvl, buf, GET_MODE(x));
|
2022 |
|
|
+ } break;
|
2023 |
|
|
+ case SET:
|
2024 |
|
|
+ zip_debug_print_m(pfx, lvl, "(SET", GET_MODE(x));
|
2025 |
117 |
dgisselq |
+ zip_debug_rtx_1(pfx, SET_DEST(x),lvl+1);
|
2026 |
|
|
+ zip_debug_rtx_1(pfx, SET_SRC(x),lvl+1);
|
2027 |
102 |
dgisselq |
+ zip_debug_print(pfx, lvl, ")");
|
2028 |
117 |
dgisselq |
+ debug_rtx(x);
|
2029 |
102 |
dgisselq |
+ break;
|
2030 |
122 |
dgisselq |
+ case REG: {
|
2031 |
127 |
dgisselq |
+ char buf[25], mstr[4];
|
2032 |
|
|
+ mstr[0] = '\0';
|
2033 |
|
|
+ if (GET_MODE(x) == SImode)
|
2034 |
|
|
+ strcpy(mstr, ":SI");
|
2035 |
|
|
+ else if (GET_MODE(x) == DImode)
|
2036 |
|
|
+ strcpy(mstr, ":DI");
|
2037 |
|
|
+ else if (GET_MODE(x) == VOIDmode)
|
2038 |
|
|
+ strcpy(mstr, ":V");
|
2039 |
102 |
dgisselq |
+ if (REGNO(x) == zip_PC)
|
2040 |
127 |
dgisselq |
+ sprintf(buf, "(PC%s)", mstr);
|
2041 |
102 |
dgisselq |
+ else if (REGNO(x) == zip_CC)
|
2042 |
127 |
dgisselq |
+ sprintf(buf, "(CC%s)", mstr);
|
2043 |
102 |
dgisselq |
+ else if (REGNO(x) == zip_SP)
|
2044 |
127 |
dgisselq |
+ sprintf(buf, "(SP%s)", mstr);
|
2045 |
102 |
dgisselq |
+ else if (REGNO(x) == zip_FP)
|
2046 |
127 |
dgisselq |
+ sprintf(buf, "(REG%s FP)", mstr);
|
2047 |
102 |
dgisselq |
+ else if (REGNO(x) == zip_GOT)
|
2048 |
127 |
dgisselq |
+ sprintf(buf, "(REG%s GBL)", mstr);
|
2049 |
102 |
dgisselq |
+ else if (FUNCTION_VALUE_REGNO_P(REGNO(x)))
|
2050 |
127 |
dgisselq |
+ sprintf(buf, "(REG%s RTN-VL)", mstr);
|
2051 |
102 |
dgisselq |
+ else if (REGNO(x) == RETURN_ADDRESS_REGNUM)
|
2052 |
127 |
dgisselq |
+ sprintf(buf, "(REG%s RTN-AD)", mstr);
|
2053 |
122 |
dgisselq |
+ else
|
2054 |
127 |
dgisselq |
+ sprintf(buf, "(REG%s %d)", mstr, REGNO(x));
|
2055 |
|
|
+ if (mstr[0])
|
2056 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
2057 |
|
|
+ else
|
2058 |
|
|
+ zip_debug_print_m(pfx, lvl, buf, GET_MODE(x));
|
2059 |
102 |
dgisselq |
+ } break;
|
2060 |
|
|
+ case IF_THEN_ELSE: // 51
|
2061 |
|
|
+ zip_debug_print(pfx, lvl, "(IF-THEN-ELSE");
|
2062 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2063 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2064 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,2),lvl+1);
|
2065 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2066 |
|
|
+ break;
|
2067 |
|
|
+ case PC:
|
2068 |
|
|
+ zip_debug_print(pfx, lvl, "(PC)");
|
2069 |
|
|
+ break;
|
2070 |
|
|
+ case CC0:
|
2071 |
|
|
+ zip_debug_print(pfx, lvl, "(CC0)");
|
2072 |
|
|
+ break;
|
2073 |
|
|
+ case COMPARE:
|
2074 |
127 |
dgisselq |
+ zip_debug_print_m(pfx, lvl, "(COMPARE", GET_MODE(x));
|
2075 |
102 |
dgisselq |
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2076 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2077 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2078 |
|
|
+ break;
|
2079 |
111 |
dgisselq |
+ case CONST:
|
2080 |
|
|
+ zip_debug_print_m(pfx, lvl, "(CONST", GET_MODE(x));
|
2081 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2082 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2083 |
|
|
+ break;
|
2084 |
102 |
dgisselq |
+ case CONST_INT:
|
2085 |
|
|
+ { char buf[25];
|
2086 |
|
|
+ if (GET_MODE(x)==SImode)
|
2087 |
111 |
dgisselq |
+ sprintf(buf, "(CONST_INT:SI %ld)", INTVAL(x));
|
2088 |
102 |
dgisselq |
+ else if (GET_MODE(x)==VOIDmode)
|
2089 |
111 |
dgisselq |
+ sprintf(buf, "(CONST_INT:V %ld)", INTVAL(x));
|
2090 |
102 |
dgisselq |
+ else
|
2091 |
111 |
dgisselq |
+ sprintf(buf, "(CONST_INT:? %ld)", INTVAL(x));
|
2092 |
102 |
dgisselq |
+ zip_debug_print(pfx, lvl, buf);
|
2093 |
|
|
+ } break;
|
2094 |
|
|
+ case LABEL_REF:
|
2095 |
122 |
dgisselq |
+ { char buf[256];
|
2096 |
111 |
dgisselq |
+ sprintf(buf, "(LABEL *.L%d)", CODE_LABEL_NUMBER(LABEL_REF_LABEL(x)));
|
2097 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
2098 |
|
|
+ }
|
2099 |
102 |
dgisselq |
+ break;
|
2100 |
|
|
+ case SYMBOL_REF:
|
2101 |
|
|
+ {
|
2102 |
|
|
+ char buf[64];
|
2103 |
|
|
+ sprintf(buf, "(SYMBOL: %s)", XSTR(x,0));
|
2104 |
|
|
+ // fprintf(file, "%s", XSTR(x,0));
|
2105 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
2106 |
|
|
+ }
|
2107 |
|
|
+ break;
|
2108 |
|
|
+ case MEM:
|
2109 |
|
|
+ zip_debug_print_m(pfx, lvl, "(MEM", GET_MODE(x));
|
2110 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2111 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2112 |
|
|
+ break;
|
2113 |
|
|
+ /*
|
2114 |
|
|
+ case VALUE:
|
2115 |
|
|
+ {
|
2116 |
|
|
+ char buf[64];
|
2117 |
|
|
+ sprintf(buf, "(VALUE: %d)", INTVAL(XEXP,0));
|
2118 |
|
|
+ zip_debug_print_m(pfx, lvl, "buf", GET_MODE(x));
|
2119 |
|
|
+ }
|
2120 |
|
|
+ break;
|
2121 |
|
|
+ */
|
2122 |
|
|
+ case PLUS:
|
2123 |
|
|
+ zip_debug_print_m(pfx, lvl, "(PLUS", GET_MODE(x));
|
2124 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2125 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2126 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2127 |
|
|
+ break;
|
2128 |
|
|
+ case MINUS:
|
2129 |
|
|
+ zip_debug_print_m(pfx, lvl, "(MINUS", GET_MODE(x));
|
2130 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2131 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2132 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2133 |
|
|
+ break;
|
2134 |
|
|
+ case AND:
|
2135 |
|
|
+ zip_debug_print_m(pfx, lvl, "(AND", GET_MODE(x));
|
2136 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2137 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2138 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2139 |
|
|
+ break;
|
2140 |
|
|
+ case IOR:
|
2141 |
|
|
+ zip_debug_print_m(pfx, lvl, "(OR", GET_MODE(x));
|
2142 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2143 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2144 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2145 |
|
|
+ break;
|
2146 |
|
|
+ case XOR:
|
2147 |
|
|
+ zip_debug_print_m(pfx, lvl, "(XOR", GET_MODE(x));
|
2148 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2149 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2150 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2151 |
|
|
+ break;
|
2152 |
|
|
+ case MULT:
|
2153 |
|
|
+ zip_debug_print_m(pfx, lvl, "(MULT", GET_MODE(x));
|
2154 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2155 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2156 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2157 |
|
|
+ break;
|
2158 |
|
|
+ case EQ: //
|
2159 |
|
|
+ zip_debug_print_m(pfx, lvl, "(EQ", GET_MODE(x));
|
2160 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2161 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2162 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2163 |
|
|
+ break;
|
2164 |
|
|
+ case NE: //
|
2165 |
|
|
+ zip_debug_print_m(pfx, lvl, "(NE", GET_MODE(x));
|
2166 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2167 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2168 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2169 |
|
|
+ break;
|
2170 |
|
|
+ case GE: //
|
2171 |
|
|
+ zip_debug_print_m(pfx, lvl, "(GE", GET_MODE(x));
|
2172 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2173 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2174 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2175 |
|
|
+ break;
|
2176 |
|
|
+ case GT: //
|
2177 |
|
|
+ zip_debug_print_m(pfx, lvl, "(GT", GET_MODE(x));
|
2178 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2179 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2180 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2181 |
|
|
+ break;
|
2182 |
|
|
+ case LE: //
|
2183 |
|
|
+ zip_debug_print_m(pfx, lvl, "(LE", GET_MODE(x));
|
2184 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2185 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2186 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2187 |
|
|
+ break;
|
2188 |
|
|
+ case LT: //
|
2189 |
|
|
+ zip_debug_print_m(pfx, lvl, "(LT", GET_MODE(x));
|
2190 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2191 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2192 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2193 |
|
|
+ break;
|
2194 |
|
|
+ case GEU: //
|
2195 |
|
|
+ zip_debug_print_m(pfx, lvl, "(GEU", GET_MODE(x));
|
2196 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2197 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2198 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2199 |
|
|
+ break;
|
2200 |
|
|
+ case GTU: //
|
2201 |
|
|
+ zip_debug_print_m(pfx, lvl, "(GTU", GET_MODE(x));
|
2202 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2203 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2204 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2205 |
|
|
+ break;
|
2206 |
|
|
+ case LEU: //
|
2207 |
|
|
+ zip_debug_print_m(pfx, lvl, "(LEU", GET_MODE(x));
|
2208 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2209 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2210 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2211 |
|
|
+ break;
|
2212 |
|
|
+ case LTU: //
|
2213 |
|
|
+ zip_debug_print_m(pfx, lvl, "(LTU", GET_MODE(x));
|
2214 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2215 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2216 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2217 |
|
|
+ break;
|
2218 |
|
|
+ case SCRATCH: //
|
2219 |
|
|
+ zip_debug_print_m(pfx, lvl, "(SCRATCH)", GET_MODE(x));
|
2220 |
|
|
+ break;
|
2221 |
|
|
+ case SUBREG:
|
2222 |
|
|
+ { char buf[25];
|
2223 |
111 |
dgisselq |
+ if (REG_P(XEXP(x,0))) {
|
2224 |
|
|
+ sprintf(buf, "(SUBREG %d/%d)", REGNO(XEXP(x,0)),
|
2225 |
|
|
+ SUBREG_BYTE(x));
|
2226 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
2227 |
|
|
+ } else if (MEM_P(XEXP(x,0))) {
|
2228 |
|
|
+ sprintf(buf, "(SUBREG /%d", SUBREG_BYTE(x));
|
2229 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
2230 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2231 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2232 |
|
|
+ } else {
|
2233 |
|
|
+ sprintf(buf, "(SUBREG UNK /%d", SUBREG_BYTE(x));
|
2234 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
2235 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2236 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2237 |
|
|
+ }}
|
2238 |
|
|
+ break;
|
2239 |
127 |
dgisselq |
+ case ASHIFT:
|
2240 |
|
|
+ zip_debug_print_m(pfx, lvl, "(ASHIFT", GET_MODE(x));
|
2241 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2242 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2243 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2244 |
|
|
+ break;
|
2245 |
|
|
+ case ASHIFTRT:
|
2246 |
|
|
+ zip_debug_print_m(pfx, lvl, "(ASHIFTRT", GET_MODE(x));
|
2247 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2248 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2249 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2250 |
|
|
+ break;
|
2251 |
|
|
+ case LSHIFTRT:
|
2252 |
|
|
+ zip_debug_print_m(pfx, lvl, "(LSHIFTRT", GET_MODE(x));
|
2253 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,0),lvl+1);
|
2254 |
|
|
+ zip_debug_rtx_1(pfx, XEXP(x,1),lvl+1);
|
2255 |
|
|
+ zip_debug_print(pfx, lvl, ")");
|
2256 |
|
|
+ break;
|
2257 |
102 |
dgisselq |
+ default:
|
2258 |
111 |
dgisselq |
+ { char buf[128];
|
2259 |
102 |
dgisselq |
+ sprintf(buf, "(? = %d) -- calling DEBUG-RTX", GET_CODE(x));
|
2260 |
|
|
+ zip_debug_print(pfx, lvl, buf);
|
2261 |
|
|
+ debug_rtx(x);
|
2262 |
|
|
+ } break;
|
2263 |
|
|
+ }
|
2264 |
|
|
+}
|
2265 |
|
|
+
|
2266 |
|
|
+void
|
2267 |
|
|
+zip_debug_rtx_pfx(const char *pfx, const_rtx x) {
|
2268 |
|
|
+ zip_debug_rtx_1(pfx, x, 0);
|
2269 |
|
|
+}
|
2270 |
|
|
+
|
2271 |
|
|
+void
|
2272 |
|
|
+zip_debug_rtx(const_rtx x) {
|
2273 |
|
|
+ zip_debug_rtx_pfx("", x);
|
2274 |
|
|
+}
|
2275 |
|
|
+
|
2276 |
|
|
+void
|
2277 |
|
|
+zip_debug_insn(rtx_insn *insn ATTRIBUTE_UNUSED) {
|
2278 |
|
|
+}
|
2279 |
|
|
+
|
2280 |
|
|
+void
|
2281 |
|
|
+zip_debug_bb(basic_block bb) {
|
2282 |
|
|
+ rtx_insn *insn;
|
2283 |
|
|
+
|
2284 |
|
|
+ fprintf(stderr, "************ BASIC-BLOCK ***************\n");
|
2285 |
|
|
+ FOR_BB_INSNS(bb, insn)
|
2286 |
|
|
+ {
|
2287 |
|
|
+ zip_debug_rtx(insn);
|
2288 |
|
|
+ }
|
2289 |
|
|
+}
|
2290 |
|
|
+
|
2291 |
|
|
+
|
2292 |
|
|
+static bool
|
2293 |
122 |
dgisselq |
+zip_legitimate_opb(rtx x, bool strict)
|
2294 |
102 |
dgisselq |
+{
|
2295 |
103 |
dgisselq |
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2296 |
102 |
dgisselq |
+
|
2297 |
111 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB\n");
|
2298 |
102 |
dgisselq |
+ if (dbg) zip_debug_rtx_pfx("Test: ", x);
|
2299 |
|
|
+
|
2300 |
|
|
+ if (NULL_RTX == x)
|
2301 |
|
|
+ return false;
|
2302 |
122 |
dgisselq |
+ else if ((GET_MODE(x) != SImode)&&(GET_MODE(x) != VOIDmode)) {
|
2303 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB -> Mode failure\n");
|
2304 |
102 |
dgisselq |
+ return false;
|
2305 |
122 |
dgisselq |
+ } else if ((strict)&&(REG_P(x))) {
|
2306 |
|
|
+ if (REGNO(x)<zip_CC) {
|
2307 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB -> (Reg)\n");
|
2308 |
|
|
+ return true;
|
2309 |
|
|
+ } else return false;
|
2310 |
|
|
+ } else if (register_operand(x, GET_MODE(x))) {
|
2311 |
|
|
+ // This also handles subregs
|
2312 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB -> (Reg)\n");
|
2313 |
|
|
+ return true;
|
2314 |
111 |
dgisselq |
+ } else if ((CONST_INT_P(x))
|
2315 |
|
|
+ &&(INTVAL(x) >= zip_min_opb_imm)
|
2316 |
|
|
+ &&(INTVAL(x) <= zip_max_opb_imm)) {
|
2317 |
122 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB -> YES! (Const) %ld <= %ld <= %ld\n", zip_min_opb_imm, INTVAL(x), zip_max_opb_imm);
|
2318 |
111 |
dgisselq |
+ return true;
|
2319 |
122 |
dgisselq |
+ // } else if ((GET_CODE(x) == LABEL_REF)||(GET_CODE(x)==CODE_LABEL)) {
|
2320 |
|
|
+ // return true;
|
2321 |
102 |
dgisselq |
+ } else if (GET_CODE(x) == PLUS) {
|
2322 |
|
|
+ // Is it a valid register?
|
2323 |
122 |
dgisselq |
+ if ((!strict)&&(!register_operand((rtx)XEXP((rtx)x,0), GET_MODE(x)))) {
|
2324 |
111 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB -> No (No reg in +%s)\n",
|
2325 |
102 |
dgisselq |
+ (GET_CODE(XEXP(x,1))==REG)?", reg in op[1]":"");
|
2326 |
|
|
+ return false;
|
2327 |
122 |
dgisselq |
+ } else if ((strict)&&((!REG_P(XEXP(x,0)))||(REGNO(XEXP(x,0))>=zip_CC))) {
|
2328 |
102 |
dgisselq |
+ return false;
|
2329 |
|
|
+ } if ((GET_CODE(XEXP(x, 1)) == CONST_INT)
|
2330 |
|
|
+ &&(INTVAL(XEXP(x, 1)) <= zip_max_anchor_offset)
|
2331 |
|
|
+ &&(INTVAL(XEXP(x, 1)) >= zip_min_anchor_offset)) {
|
2332 |
111 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB -> YES! (reg+int)\n");
|
2333 |
103 |
dgisselq |
+ // if((INTVAL(XEXP(x,1))<0)&&(REGNO(XEXP(x,0))==zip_SP))
|
2334 |
|
|
+ // gcc_unreachable();
|
2335 |
102 |
dgisselq |
+ return true;
|
2336 |
|
|
+ } if ((GET_CODE(XEXP(x, 1)) == LABEL_REF)
|
2337 |
122 |
dgisselq |
+ ||(GET_CODE(XEXP(x, 1)) == CODE_LABEL)
|
2338 |
102 |
dgisselq |
+ ||(GET_CODE(XEXP(x, 1)) == SYMBOL_REF)) {
|
2339 |
|
|
+ // While we can technically support this, the problem
|
2340 |
|
|
+ // is that the symbol address could be anywhere, and we
|
2341 |
|
|
+ // have no way of recovering if it's outside of our
|
2342 |
|
|
+ // 14 allowable bits.
|
2343 |
111 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB -> No. (reg+lbl)\n");
|
2344 |
102 |
dgisselq |
+ return false;
|
2345 |
|
|
+ }
|
2346 |
|
|
+ }
|
2347 |
|
|
+
|
2348 |
111 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-LEGITIMATE-OPB -> No\n");
|
2349 |
102 |
dgisselq |
+ if (dbg) zip_debug_rtx(x);
|
2350 |
|
|
+ return false;
|
2351 |
|
|
+}
|
2352 |
|
|
+
|
2353 |
|
|
+static bool
|
2354 |
|
|
+zip_legitimate_move_operand_p(machine_mode mode ATTRIBUTE_UNUSED, rtx x, bool strict) {
|
2355 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2356 |
|
|
+
|
2357 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-VALID-MOVE-OPERAND\n");
|
2358 |
|
|
+ if (dbg) zip_debug_rtx_pfx("VMov?: ", x);
|
2359 |
|
|
+
|
2360 |
122 |
dgisselq |
+ if (!zip_legitimate_opb(x, strict))
|
2361 |
102 |
dgisselq |
+ return false;
|
2362 |
122 |
dgisselq |
+ else if ((GET_CODE(x)==PLUS)&&(CONST_INT_P(XEXP(x,1)))) {
|
2363 |
|
|
+ if ((INTVAL(XEXP(x, 1)) > zip_max_mov_offset)
|
2364 |
|
|
+ ||(INTVAL(XEXP(x, 1)) < zip_min_mov_offset)) {
|
2365 |
124 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-VALID-MOVE-OPERAND -> NO! (reg+int), int out of bounds: %ld\n", INTVAL(XEXP(x,1)));
|
2366 |
102 |
dgisselq |
+ return false;
|
2367 |
|
|
+ }
|
2368 |
|
|
+ }
|
2369 |
|
|
+
|
2370 |
122 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-VALID-MOVE-OPERAND -> Yes\n");
|
2371 |
102 |
dgisselq |
+ if (dbg) zip_debug_rtx(x);
|
2372 |
122 |
dgisselq |
+ return true;
|
2373 |
102 |
dgisselq |
+}
|
2374 |
|
|
+
|
2375 |
|
|
+int
|
2376 |
|
|
+zip_pd_mov_operand(rtx op)
|
2377 |
|
|
+{
|
2378 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2379 |
|
|
+
|
2380 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-VALID-MOV(predicate) for OPERAND\n");
|
2381 |
|
|
+ return zip_legitimate_move_operand_p(VOIDmode, op, !can_create_pseudo_p());
|
2382 |
|
|
+}
|
2383 |
|
|
+
|
2384 |
|
|
+int
|
2385 |
111 |
dgisselq |
+zip_pd_mvimm_operand(rtx op)
|
2386 |
|
|
+{
|
2387 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2388 |
|
|
+
|
2389 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-VALID-MVIMM(predicate) for OPERAND\n");
|
2390 |
|
|
+ if (!CONST_INT_P(op))
|
2391 |
|
|
+ return false;
|
2392 |
|
|
+ if (INTVAL(op) > zip_max_mov_offset)
|
2393 |
|
|
+ return false;
|
2394 |
|
|
+ if (INTVAL(op) < zip_min_mov_offset)
|
2395 |
|
|
+ return false;
|
2396 |
|
|
+ return true;
|
2397 |
|
|
+}
|
2398 |
|
|
+
|
2399 |
|
|
+int
|
2400 |
|
|
+zip_pd_imm_operand(rtx op)
|
2401 |
|
|
+{
|
2402 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2403 |
|
|
+
|
2404 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-VALID-IMM(predicate) for OPERAND\n");
|
2405 |
|
|
+ if (!CONST_INT_P(op))
|
2406 |
|
|
+ return false;
|
2407 |
|
|
+ if (INTVAL(op) > zip_max_anchor_offset)
|
2408 |
|
|
+ return false;
|
2409 |
|
|
+ if (INTVAL(op) < zip_min_anchor_offset)
|
2410 |
|
|
+ return false;
|
2411 |
|
|
+ return true;
|
2412 |
|
|
+}
|
2413 |
|
|
+
|
2414 |
|
|
+int
|
2415 |
102 |
dgisselq |
+zip_address_operand(rtx op)
|
2416 |
|
|
+{
|
2417 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2418 |
|
|
+
|
2419 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-ADDRESS for OPERAND\n");
|
2420 |
111 |
dgisselq |
+ if ((REG_P(op))&&(REGNO(op)==zip_CC))
|
2421 |
|
|
+ return false;
|
2422 |
|
|
+ else if ((GET_CODE(op) == PLUS)&&(REG_P(XEXP(op,0)))
|
2423 |
|
|
+ &&(REGNO(XEXP(op,0))==zip_CC))
|
2424 |
|
|
+ return false;
|
2425 |
|
|
+ else
|
2426 |
|
|
+ return zip_legitimate_opb(op, !can_create_pseudo_p());
|
2427 |
102 |
dgisselq |
+}
|
2428 |
|
|
+
|
2429 |
|
|
+int
|
2430 |
111 |
dgisselq |
+zip_pd_opb_operand(rtx op)
|
2431 |
102 |
dgisselq |
+{
|
2432 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2433 |
|
|
+
|
2434 |
111 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP-OPB(predicate) for OPERAND\n");
|
2435 |
122 |
dgisselq |
+ return zip_legitimate_opb(op, false); //, !can_create_pseudo_p());
|
2436 |
102 |
dgisselq |
+}
|
2437 |
|
|
+
|
2438 |
|
|
+int
|
2439 |
|
|
+zip_ct_address_operand(rtx op)
|
2440 |
|
|
+{
|
2441 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2442 |
|
|
+
|
2443 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-ADDRESS(constraint) for OPERAND\n");
|
2444 |
111 |
dgisselq |
+ return zip_legitimate_opb(op, !can_create_pseudo_p());
|
2445 |
102 |
dgisselq |
+}
|
2446 |
|
|
+
|
2447 |
|
|
+int
|
2448 |
|
|
+zip_const_address_operand(rtx x) {
|
2449 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2450 |
|
|
+
|
2451 |
|
|
+ if (dbg) fprintf(stderr, "is ZIP-CONST-ADDRESS?\n");
|
2452 |
|
|
+ if (dbg) zip_debug_rtx(x);
|
2453 |
127 |
dgisselq |
+ if ((GET_MODE(x) != SImode)&&(GET_MODE(x) != VOIDmode)) {
|
2454 |
|
|
+ fprintf(stderr, "is ZIP-CONST-ADDRESS? -> NO, BAD MODE\n");
|
2455 |
102 |
dgisselq |
+ return false;
|
2456 |
127 |
dgisselq |
+ }
|
2457 |
102 |
dgisselq |
+ if ((GET_CODE(x) == LABEL_REF)
|
2458 |
|
|
+ ||(GET_CODE(x) == CODE_LABEL)
|
2459 |
|
|
+ ||(GET_CODE(x) == SYMBOL_REF)) {
|
2460 |
127 |
dgisselq |
+ if (dbg) fprintf(stderr, "is ZIP-CONST-ADDRESS? -> YES! (LBL)\n");
|
2461 |
102 |
dgisselq |
+ return true;
|
2462 |
|
|
+ } else if (CONST_INT_P(x)) {
|
2463 |
127 |
dgisselq |
+ if (dbg) fprintf(stderr, "is ZIP-CONST-ADDRESS? -> YES! (INT)\n");
|
2464 |
102 |
dgisselq |
+ return true;
|
2465 |
|
|
+ } else if (GET_CODE(x) == PLUS) {
|
2466 |
|
|
+ if (dbg) fprintf(stderr, "is ZIP-CONST-ADDRESS(PLUS)\n");
|
2467 |
|
|
+ return ((zip_const_address_operand(XEXP(x,0)))
|
2468 |
|
|
+ &&(CONST_INT_P(XEXP(x,1))));
|
2469 |
|
|
+ } else if (GET_CODE(x) == MINUS) {
|
2470 |
|
|
+ if (dbg) fprintf(stderr, "is ZIP-CONST-ADDRESS(MINUS)\n");
|
2471 |
|
|
+ return ((zip_const_address_operand(XEXP(x,0)))
|
2472 |
|
|
+ &&(zip_const_address_operand(XEXP(x,1))));
|
2473 |
|
|
+ }
|
2474 |
|
|
+
|
2475 |
|
|
+ if (dbg) fprintf(stderr, "is ZIP-CONST-ADDRESS? -> No\n");
|
2476 |
|
|
+ if (dbg) zip_debug_rtx(x);
|
2477 |
|
|
+ return false;
|
2478 |
|
|
+}
|
2479 |
|
|
+
|
2480 |
|
|
+int
|
2481 |
|
|
+zip_ct_const_address_operand(rtx x) {
|
2482 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2483 |
|
|
+
|
2484 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-CONST-ADDRESS(constraint)\n");
|
2485 |
|
|
+ return zip_const_address_operand(x);
|
2486 |
|
|
+}
|
2487 |
|
|
+
|
2488 |
|
|
+int
|
2489 |
|
|
+zip_pd_const_address_operand(rtx x) {
|
2490 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2491 |
|
|
+
|
2492 |
|
|
+ if (dbg) fprintf(stderr, "ZIP-CONST-ADDRESS(predicate)\n");
|
2493 |
|
|
+ return zip_const_address_operand(x);
|
2494 |
|
|
+}
|
2495 |
|
|
+
|
2496 |
|
|
+
|
2497 |
|
|
+static bool
|
2498 |
|
|
+zip_legitimate_address_p(machine_mode mode ATTRIBUTE_UNUSED, rtx x, bool strict)
|
2499 |
|
|
+{
|
2500 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2501 |
|
|
+
|
2502 |
|
|
+ if (dbg) fprintf(stderr, "Zip-LEGITIMATE-ADDRESS-P\n");
|
2503 |
|
|
+ if (dbg) zip_debug_rtx(x);
|
2504 |
|
|
+
|
2505 |
|
|
+ // Only insist the register be a valid register if strict is true
|
2506 |
111 |
dgisselq |
+ if (zip_legitimate_opb(x, strict))
|
2507 |
102 |
dgisselq |
+ return true;
|
2508 |
111 |
dgisselq |
+ // else if (zip_const_address_operand(x))
|
2509 |
|
|
+ // return true;
|
2510 |
102 |
dgisselq |
+
|
2511 |
|
|
+ return false;
|
2512 |
|
|
+}
|
2513 |
|
|
+
|
2514 |
111 |
dgisselq |
+static rtx
|
2515 |
|
|
+zip_legitimize_address(rtx x, rtx oldx ATTRIBUTE_UNUSED, machine_mode mode ATTRIBUTE_UNUSED) {
|
2516 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2517 |
|
|
+
|
2518 |
|
|
+ if (dbg) zip_debug_rtx_pfx("LEGITIMIZE: ", x);
|
2519 |
|
|
+ if (zip_legitimate_address_p(mode, x, !can_create_pseudo_p()))
|
2520 |
|
|
+ return x;
|
2521 |
|
|
+
|
2522 |
|
|
+ if (GET_CODE(x)==PLUS) {
|
2523 |
|
|
+ if (!REG_P(XEXP(x,0)))
|
2524 |
|
|
+ XEXP(x,0) = force_reg(GET_MODE(x),XEXP(x,0));
|
2525 |
|
|
+ if ((!zip_legitimate_address_p(mode, x, !can_create_pseudo_p()))
|
2526 |
|
|
+ &&(!CONST_INT_P(XEXP(x,1))))
|
2527 |
|
|
+ x = force_reg(GET_MODE(x),x);
|
2528 |
|
|
+ } else if (MEM_P(x))
|
2529 |
|
|
+ x = force_reg(GET_MODE(x),x);
|
2530 |
|
|
+
|
2531 |
|
|
+ if (dbg) zip_debug_rtx_pfx("LEGITIMATE: ", x);
|
2532 |
|
|
+ return x;
|
2533 |
|
|
+}
|
2534 |
|
|
+
|
2535 |
102 |
dgisselq |
+void
|
2536 |
|
|
+zip_asm_output_def(FILE *stream, const char *name, const char *value)
|
2537 |
|
|
+{
|
2538 |
|
|
+ assemble_name(stream, name);
|
2539 |
|
|
+ fprintf(stream, "\t.equ ");
|
2540 |
|
|
+ assemble_name(stream, value);
|
2541 |
|
|
+ fputc('\n', stream);
|
2542 |
|
|
+}
|
2543 |
|
|
+
|
2544 |
111 |
dgisselq |
+#define USE_SUBREG
|
2545 |
|
|
+#ifdef USE_SUBREG
|
2546 |
|
|
+#define SREG_P(RTX) ((SUBREG_P(RTX))&&(REG_P(XEXP(RTX,0))))
|
2547 |
|
|
+#define SMEM_P(RTX) ((SUBREG_P(RTX))&&(MEM_P(XEXP(RTX,0))))
|
2548 |
|
|
+#else
|
2549 |
|
|
+#define SREG_P(RTX) false
|
2550 |
|
|
+#define SMEM_P(RTX) false
|
2551 |
|
|
+#endif
|
2552 |
102 |
dgisselq |
+
|
2553 |
|
|
+const char *zip_set_zero_or_one(rtx condition, rtx dst) {
|
2554 |
103 |
dgisselq |
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2555 |
102 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP::SET-ZERO-OR-ONE\n");
|
2556 |
|
|
+ if (dbg) zip_debug_rtx_pfx("CND", condition);
|
2557 |
|
|
+ if (dbg) zip_debug_rtx_pfx("REG", dst);
|
2558 |
|
|
+ switch(GET_CODE(condition)) {
|
2559 |
|
|
+ case EQ: return "LDI\t0,%0\n\tLDILO.Z\t1,%0";
|
2560 |
|
|
+ case NE: return "LDI\t0,%0\n\tLDILO.NZ\t1,%0";
|
2561 |
|
|
+ case LT: return "LDI\t0,%0\n\tLDILO.LT\t1,%0";
|
2562 |
|
|
+ case GT: return "LDI\t0,%0\n\tLDILO.GT\t1,%0";
|
2563 |
|
|
+ case LE: return "LDI\t1,%0\n\tLDILO.GT\t0,%0";
|
2564 |
|
|
+ case GE: return "LDI\t0,%0\n\tLDILO.GE\t1,%0";
|
2565 |
|
|
+ case LTU: return "LDI\t0,%0\n\tLDILO.C\t1,%0";
|
2566 |
|
|
+ case GTU: return "LDI\t1,%0\n\tLDILO.C\t0,%0\n\tLDILO.Z\t0,%0";
|
2567 |
|
|
+ case LEU: return "LDI\t0,%0\n\tLDILO.C\t1,%0\n\tLDILO.Z\t1,%0";
|
2568 |
|
|
+ case GEU: return "LDI\t1,%0\n\tLDILO.C\t0,%0";
|
2569 |
|
|
+ default:
|
2570 |
|
|
+ zip_debug_rtx(condition);
|
2571 |
|
|
+ internal_error("CSTORE Unsupported condition");
|
2572 |
|
|
+ return NULL;
|
2573 |
|
|
+ }
|
2574 |
|
|
+}
|
2575 |
|
|
+
|
2576 |
127 |
dgisselq |
+/*
|
2577 |
102 |
dgisselq |
+const char *zip_binary_movsicc(rtx_code condition, const char *op, const int opno) {
|
2578 |
|
|
+ static char result[64] = "";
|
2579 |
|
|
+ switch(condition) {
|
2580 |
|
|
+ //
|
2581 |
|
|
+ // Result already exists in the iffalse register
|
2582 |
|
|
+ // Can't change it. Therefore, on the
|
2583 |
|
|
+ // condition ... move true register to the
|
2584 |
|
|
+ // destination
|
2585 |
|
|
+ //
|
2586 |
|
|
+ case EQ: sprintf(result, "%s.Z\t%%%d,%%0", op, opno); break;
|
2587 |
|
|
+ case NE: sprintf(result, "%s.NZ\t%%%d,%%0", op, opno); break;
|
2588 |
|
|
+ case LT: sprintf(result, "%s.LT\t%%%d,%%0", op, opno); break;
|
2589 |
|
|
+ case GT: sprintf(result, "%s.GT\t%%%d,%%0", op, opno); break;
|
2590 |
|
|
+ // .LE doesn't exist on Zip CPU--turn this into two instructions
|
2591 |
|
|
+ case LE: sprintf(result, "%s.LT\t%%%d,%%0\n\t%s.Z\t%%%d,%%0", op, opno, op, opno); break;
|
2592 |
|
|
+ case GE: sprintf(result, "%s.GE\t%%%d,%%0", op, opno); break;
|
2593 |
|
|
+ case LTU: sprintf(result, "%s.C\t%%%d,%%0", op, opno); break;
|
2594 |
|
|
+ //
|
2595 |
|
|
+ // .GTU doesn't exist on the Zip CPU either. We also note that
|
2596 |
|
|
+ // .C will never be set on an equal condition. Therefore, we
|
2597 |
|
|
+ // turn this into a XOR.NZ 2,CC, which will set the .C condition
|
2598 |
|
|
+ // as long as .Z wasn't true. We then undo this when we're
|
2599 |
|
|
+ // done. This is possible since none of these instructions
|
2600 |
|
|
+ // (LDI/MOV/Lod conditional, nor Xor conditional) will ever set
|
2601 |
|
|
+ // the condition codes.
|
2602 |
|
|
+ //
|
2603 |
|
|
+ // This is obviously not very optimal. Avoid this by all means
|
2604 |
|
|
+ // if you can
|
2605 |
|
|
+ case GTU: sprintf(result, "XOR.NZ\t2,CC\n%s.C\t%%%d,%%0\n\tXOR.NZ\t2,CC", op, opno); break;
|
2606 |
|
|
+ // .LEU doesn't exist on Zip CPU either--turn this into another
|
2607 |
|
|
+ // two instructions
|
2608 |
|
|
+ case LEU: sprintf(result, "%s.C\t%%%d,%%0\n\t%s.Z\t%%%d,%%0", op, opno, op, opno); break;
|
2609 |
|
|
+ //
|
2610 |
|
|
+ // .GEU doesn't exist on Zip CPU. Implementing it her is
|
2611 |
|
|
+ // painful. We can change the condition codes to make it so,
|
2612 |
|
|
+ // but the instruction requires the condition codes not be
|
2613 |
|
|
+ // changed. Hence, we must change them back if we do so.
|
2614 |
|
|
+ //
|
2615 |
|
|
+ // .C will be set on less than but not equal. Hence !.C will
|
2616 |
|
|
+ // be true on greater than or equal.
|
2617 |
|
|
+ case GEU: sprintf(result, "XOR\t2,CC\n%s.C\t%%%d,%%0\n\tXOR\t2,CC", op, opno); break;
|
2618 |
|
|
+ default:
|
2619 |
|
|
+ internal_error("MOVSICC(BINARY) Unsupported condition");
|
2620 |
|
|
+ return NULL;
|
2621 |
|
|
+ } return result;
|
2622 |
|
|
+}
|
2623 |
127 |
dgisselq |
+*/
|
2624 |
102 |
dgisselq |
+
|
2625 |
127 |
dgisselq |
+bool
|
2626 |
|
|
+zip_supported_condition(int c) {
|
2627 |
|
|
+ switch(c) {
|
2628 |
|
|
+ case NE: case LT: case EQ: case GT: case GE: case LTU:
|
2629 |
|
|
+ return true;
|
2630 |
|
|
+ break;
|
2631 |
|
|
+ default:
|
2632 |
|
|
+ break;
|
2633 |
|
|
+ } return false;
|
2634 |
102 |
dgisselq |
+}
|
2635 |
|
|
+
|
2636 |
127 |
dgisselq |
+bool
|
2637 |
|
|
+zip_signed_comparison(int c) {
|
2638 |
|
|
+ switch(c) {
|
2639 |
|
|
+ case NE: case LT: case EQ: case GT: case GE:
|
2640 |
|
|
+ return true;
|
2641 |
|
|
+ default:
|
2642 |
|
|
+ break;
|
2643 |
|
|
+ } return false;
|
2644 |
|
|
+}
|
2645 |
|
|
+
|
2646 |
|
|
+void
|
2647 |
|
|
+zip_expand_movsicc(rtx dst, rtx condition, rtx iftrue, rtx iffalse) {
|
2648 |
103 |
dgisselq |
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2649 |
102 |
dgisselq |
+ if (dbg) fprintf(stderr, "ZIP::MOVSICC\n");
|
2650 |
|
|
+ if (dbg) zip_debug_rtx_pfx("DST", dst);
|
2651 |
|
|
+ if (dbg) zip_debug_rtx_pfx("CND", condition);
|
2652 |
|
|
+ if (dbg) zip_debug_rtx_pfx("TRU", iftrue);
|
2653 |
|
|
+ if (dbg) zip_debug_rtx_pfx("FAL", iffalse);
|
2654 |
127 |
dgisselq |
+
|
2655 |
|
|
+ // Start with the condition
|
2656 |
|
|
+ rtx cmpa = XEXP(condition,0), cmpb=XEXP(condition,1);
|
2657 |
|
|
+ enum rtx_code cmpcode = GET_CODE(condition);
|
2658 |
|
|
+
|
2659 |
|
|
+ //; Do we need to swap or adjust the condition?
|
2660 |
|
|
+ if (zip_supported_condition((int)cmpcode)) {
|
2661 |
|
|
+ // Keep everything as is
|
2662 |
|
|
+ } else if ((zip_supported_condition(reverse_condition(cmpcode)))
|
2663 |
|
|
+ &&(!MEM_P(iffalse))) {
|
2664 |
|
|
+ rtx tem = iffalse;
|
2665 |
|
|
+ iffalse = iftrue;
|
2666 |
|
|
+ iftrue = tem;
|
2667 |
|
|
+
|
2668 |
|
|
+ cmpcode = reverse_condition(cmpcode);
|
2669 |
|
|
+ } else if ((zip_supported_condition((int)swap_condition(cmpcode)))
|
2670 |
|
|
+ &&((REG_P(cmpb))||(can_create_pseudo_p()))) {
|
2671 |
|
|
+ rtx tem = cmpa;
|
2672 |
|
|
+ cmpa = cmpb;
|
2673 |
|
|
+ cmpa = tem;
|
2674 |
|
|
+ cmpcode = swap_condition(cmpcode);
|
2675 |
|
|
+
|
2676 |
|
|
+ if ((GET_CODE(cmpa)==PLUS)&&(zip_signed_comparison((int)cmpcode))
|
2677 |
|
|
+ &&(REG_P(XEXP(cmpa,0)))
|
2678 |
|
|
+ &&(CONST_INT_P(XEXP(cmpa,1)))
|
2679 |
|
|
+ &&(abs(INTVAL(XEXP(cmpa,1)))<(1<<17))) {
|
2680 |
|
|
+
|
2681 |
|
|
+ // If we were doing CMP x(Rb),Ra
|
2682 |
|
|
+ // and we just changed it to CMP Ra,x(Rb)
|
2683 |
|
|
+ // adjust it to CMP -x(Ra),Rb
|
2684 |
|
|
+ cmpb = plus_constant(SImode, cmpb, -INTVAL(XEXP(cmpa,1)));
|
2685 |
|
|
+ cmpa = XEXP(cmpa,0);
|
2686 |
|
|
+ } else if (!REG_P(cmpa)) {
|
2687 |
|
|
+ // Otherwise, if we had anything else in Rb other than
|
2688 |
|
|
+ // a register ... such as a constant, then load it into
|
2689 |
|
|
+ // a register before comparing it. So
|
2690 |
|
|
+ // CMP x,Ra
|
2691 |
|
|
+ // became
|
2692 |
|
|
+ // CMP Ra,x
|
2693 |
|
|
+ // now becomes
|
2694 |
|
|
+ // LDI x,Rt
|
2695 |
|
|
+ // CMP Ra,Rt
|
2696 |
|
|
+ // (We already tested for can_create_pseudo_p() above..)
|
2697 |
|
|
+ tem = gen_reg_rtx(SImode);
|
2698 |
|
|
+ emit_move_insn(tem, cmpa);
|
2699 |
|
|
+ cmpa = tem;
|
2700 |
102 |
dgisselq |
+ }
|
2701 |
127 |
dgisselq |
+ } else {
|
2702 |
|
|
+ // Here's our last chance.
|
2703 |
|
|
+ // This will adjust for less than equal types of stuff
|
2704 |
|
|
+ int cod = (int)cmpcode;
|
2705 |
|
|
+ zip_canonicalize_comparison(&cod, &cmpa, &cmpb, false);
|
2706 |
|
|
+ cmpcode = (enum rtx_code)cod;
|
2707 |
102 |
dgisselq |
+ }
|
2708 |
|
|
+
|
2709 |
127 |
dgisselq |
+ gcc_assert(zip_supported_condition((int)cmpcode));
|
2710 |
|
|
+
|
2711 |
|
|
+ //; Always do the default move
|
2712 |
|
|
+ emit_move_insn(dst, iffalse);
|
2713 |
|
|
+
|
2714 |
|
|
+ rtx cc_rtx = gen_rtx_REG(CCmode, zip_CC);
|
2715 |
|
|
+
|
2716 |
|
|
+ //; Now let's get our comparison right
|
2717 |
|
|
+ emit_insn(gen_rtx_SET(VOIDmode, cc_rtx,
|
2718 |
|
|
+ gen_rtx_COMPARE(CCmode, cmpa, cmpb)));
|
2719 |
|
|
+
|
2720 |
|
|
+ //; Finally, let's load the value on true
|
2721 |
|
|
+ emit_insn(gen_movsicc_bare(dst,
|
2722 |
|
|
+ gen_rtx_fmt_ee(cmpcode, SImode, NULL_RTX, NULL_RTX),
|
2723 |
|
|
+ iftrue, dst));
|
2724 |
102 |
dgisselq |
+}
|
2725 |
|
|
+
|
2726 |
|
|
+const char *zip_addsicc(rtx dst, rtx condition, rtx ifsrc, rtx addv ATTRIBUTE_UNUSED) {
|
2727 |
|
|
+ // We know upon entry that REG_P(dst) must be true
|
2728 |
|
|
+ if (!REG_P(dst))
|
2729 |
|
|
+ internal_error("%s","ADDSICC into something other than register");
|
2730 |
|
|
+ if ((REG_P(ifsrc))&&(REGNO(dst)==REGNO(ifsrc))) {
|
2731 |
|
|
+ switch (GET_CODE(condition)) {
|
2732 |
|
|
+ case EQ: return "ADD.Z\t%3,%0";
|
2733 |
|
|
+ case NE: return "ADD.NZ\t%3,%0";
|
2734 |
|
|
+ case LT: return "ADD.LT\t%3,%0";
|
2735 |
|
|
+ case GT: return "ADD.GT\t%3,%0";
|
2736 |
|
|
+ case LE: return "ADD.LT\t%3,%0\n\tADD.Z\t%3,%0";
|
2737 |
|
|
+ case GE: return "ADD.GE\t%3,%0";
|
2738 |
|
|
+ case LTU: return "ADD.C\t%3,%0";
|
2739 |
|
|
+ case LEU: return "ADD.C\t%3,%0\n\tADD.Z\t%3,%0";
|
2740 |
|
|
+ case GEU: return "XOR\t2,CC\n\tADD.C\t%3,%0\n\tXOR\t2,CC";
|
2741 |
|
|
+ // Can do a GEU comparison, and then undo on the Zero condition
|
2742 |
|
|
+ case GTU: return "XOR\t2,CC\n\tADD.C\t%3,%0\n\tSUB.Z\t%3,%0\n\tXOR\t2,CC";
|
2743 |
|
|
+ default:
|
2744 |
|
|
+ internal_error("%s", "Zip/No usable addsi expansion");
|
2745 |
|
|
+ break;
|
2746 |
|
|
+ }
|
2747 |
|
|
+ } else {
|
2748 |
|
|
+ // MOV A+REG,REG
|
2749 |
|
|
+ switch (GET_CODE(condition)) {
|
2750 |
|
|
+ case EQ: return "MOV.Z\t%3+%2,%0";
|
2751 |
|
|
+ case NE: return "MOV.NZ\t%3+%2,%0";
|
2752 |
|
|
+ case LT: return "MOV.LT\t%3+%2,%0";
|
2753 |
|
|
+ case GT: return "MOV.GT\t%3+%2,%0";
|
2754 |
|
|
+ case LE: return "MOV.LT\t%3+%2,%0\n\tMOV.Z\t%3+%2,%0";
|
2755 |
|
|
+ case GE: return "MOV.GE\t%3+%2,%0";
|
2756 |
|
|
+ case LTU: return "MOV.C\t%3+%2,%0";
|
2757 |
|
|
+ case LEU: return "MOV.C\t%3+%2,%0\n\tMOV.Z\t%3+%2,%0";
|
2758 |
|
|
+ case GEU: return "XOR\t2,CC\n\tMOV.C\t%3+%2,%0\n\tXOR\t2,CC";
|
2759 |
|
|
+ // Can do a GEU comparison, and then undo on the Zero condition
|
2760 |
|
|
+ // EXCEPT: with a move instruction, what's there to undo? We
|
2761 |
|
|
+ // just clobbered our register!
|
2762 |
|
|
+ // case GTU: return "XOR\t2,CC\n\tMOV.C\t%3,%0\n\tSUB.Z\t%3,%0XOR\t2,CC";
|
2763 |
|
|
+ default:
|
2764 |
|
|
+ internal_error("%s", "Zip/No usable addsi(reg,reg) expansion");
|
2765 |
|
|
+ break;
|
2766 |
|
|
+ }
|
2767 |
|
|
+ }
|
2768 |
|
|
+
|
2769 |
|
|
+ return "BREAK";
|
2770 |
|
|
+}
|
2771 |
|
|
+
|
2772 |
103 |
dgisselq |
+static int zip_memory_move_cost(machine_mode mode, reg_class_t ATTRIBUTE_UNUSED, bool in ATTRIBUTE_UNUSED) {
|
2773 |
102 |
dgisselq |
+ int rv = 14;
|
2774 |
|
|
+ if ((mode == DImode)||(mode == DFmode))
|
2775 |
|
|
+ rv += 2;
|
2776 |
|
|
+ return rv;
|
2777 |
|
|
+}
|
2778 |
|
|
+
|
2779 |
103 |
dgisselq |
+// #warning "How do we tell the compiler LDI label is expensive as 2 ops"?
|
2780 |
117 |
dgisselq |
+static bool zip_cannot_modify_jumps_p(void) {
|
2781 |
|
|
+ // Let's try their suggested approach, keeping us from modifying jumps
|
2782 |
|
|
+ // after reload. This should also allow our peephole2 optimizations
|
2783 |
|
|
+ // to adjust things back to what they need to be if necessary.
|
2784 |
|
|
+ return (reload_completed || reload_in_progress);
|
2785 |
|
|
+}
|
2786 |
122 |
dgisselq |
+
|
2787 |
|
|
+rtx_insn *zip_ifcvt_info;
|
2788 |
|
|
+
|
2789 |
|
|
+void
|
2790 |
|
|
+zip_ifcvt_modify_tests(ce_if_block *ce_info ATTRIBUTE_UNUSED, rtx *true_expr, rtx *false_expr) {
|
2791 |
|
|
+ const bool dbg = ((ALL_DEBUG_ON)||(false))&&(!ALL_DEBUG_OFF);
|
2792 |
|
|
+ if (dbg) fprintf(stderr, "IFCVT-MODIFY-TESTS\n");
|
2793 |
|
|
+ if (*true_expr) switch(GET_CODE(*true_expr)) {
|
2794 |
|
|
+ case LE:
|
2795 |
|
|
+ case GTU:
|
2796 |
|
|
+ case GEU:
|
2797 |
|
|
+ case LEU:
|
2798 |
|
|
+ if (dbg) fprintf(stderr, "TRUE, missing expr\n");
|
2799 |
|
|
+ if (dbg) zip_debug_rtx(*true_expr);
|
2800 |
|
|
+ *true_expr = NULL_RTX;
|
2801 |
|
|
+ break;
|
2802 |
|
|
+ default: // LT, GT, GTE, LTU, NE, EQ
|
2803 |
|
|
+ break;
|
2804 |
|
|
+ }
|
2805 |
|
|
+
|
2806 |
|
|
+ if (*false_expr) switch(GET_CODE(*false_expr)) {
|
2807 |
|
|
+ case LE:
|
2808 |
|
|
+ case GTU:
|
2809 |
|
|
+ case GEU:
|
2810 |
|
|
+ case LEU:
|
2811 |
|
|
+ if (dbg) fprintf(stderr, "FALSE, missing expr\n");
|
2812 |
|
|
+ if (dbg) zip_debug_rtx(*false_expr);
|
2813 |
|
|
+ *false_expr = NULL_RTX;
|
2814 |
|
|
+ default:
|
2815 |
|
|
+ break;
|
2816 |
|
|
+ }
|
2817 |
|
|
+ if ((dbg)&&((!*true_expr)||(!*false_expr)))
|
2818 |
|
|
+ fprintf(stderr, "IFCVT-MODIFY-TESTS -- FAIL\n");
|
2819 |
|
|
+}
|
2820 |
|
|
+
|
2821 |
|
|
+void
|
2822 |
|
|
+zip_ifcvt_modify_cancel(struct ce_if_block *ceinfo ATTRIBUTE_UNUSED) {
|
2823 |
|
|
+/*
|
2824 |
|
|
+ fprintf(stderr, "IFCVT -- CANCEL\n");
|
2825 |
|
|
+ zip_ifcvt_info = NULL;
|
2826 |
|
|
+*/
|
2827 |
|
|
+}
|
2828 |
|
|
+
|
2829 |
|
|
+void
|
2830 |
|
|
+zip_ifcvt_modify_final(struct ce_if_block *ceinfo ATTRIBUTE_UNUSED) {
|
2831 |
|
|
+/*
|
2832 |
|
|
+rtx_insn *insn;
|
2833 |
|
|
+FOR_BB_INSNS(ceinfo->test_bb, insn)
|
2834 |
|
|
+ fprintf(stderr, "IFCVT -- FINAL\n");
|
2835 |
|
|
+ zip_debug_rtx_pfx("FINAL-TEST-BB", insn);
|
2836 |
|
|
+ zip_ifcvt_info = NULL;
|
2837 |
|
|
+*/
|
2838 |
|
|
+}
|
2839 |
|
|
+
|
2840 |
|
|
+void
|
2841 |
|
|
+zip_ifcvt_machdep_init(struct ce_if_block *ceinfo ATTRIBUTE_UNUSED) {
|
2842 |
|
|
+/*
|
2843 |
|
|
+ zip_ifcvt_info = NULL;
|
2844 |
|
|
+ rtx_insn *insn, *ifinsn = NULL;
|
2845 |
|
|
+ FOR_BB_INSNS(ceinfo->test_bb, insn) {
|
2846 |
|
|
+ rtx p;
|
2847 |
|
|
+ p = single_set(insn);
|
2848 |
|
|
+ if (!p) continue;
|
2849 |
|
|
+ if (SET_DEST(p)==pc_rtx) {
|
2850 |
|
|
+ ifinsn = insn;
|
2851 |
|
|
+ }
|
2852 |
|
|
+ if (!REG_P(SET_DEST(p)))
|
2853 |
|
|
+ continue;
|
2854 |
|
|
+ if (GET_MODE(SET_DEST(p))!=CCmode)
|
2855 |
|
|
+ continue;
|
2856 |
|
|
+ if (REGNO(SET_DEST(p))!=zip_CC)
|
2857 |
|
|
+ continue;
|
2858 |
|
|
+ zip_ifcvt_info = insn;
|
2859 |
|
|
+ }
|
2860 |
|
|
+
|
2861 |
|
|
+ if (zip_ifcvt_info)
|
2862 |
|
|
+ zip_debug_rtx_pfx("PUTATIVE-CMP",zip_ifcvt_info);
|
2863 |
|
|
+ if (ifinsn)
|
2864 |
|
|
+ zip_debug_rtx_pfx("PRIOR-JMP",ifinsn);
|
2865 |
|
|
+*/
|
2866 |
|
|
+}
|
2867 |
|
|
+
|
2868 |
127 |
dgisselq |
+int zip_insn_sets_cc(rtx_insn *insn) {
|
2869 |
|
|
+ return (get_attr_ccresult(insn)==CCRESULT_SET);
|
2870 |
|
|
+}
|
2871 |
|
|
+
|
2872 |
|
|
+int zip_is_conditional(rtx_insn *insn) {
|
2873 |
|
|
+ return (get_attr_conditional(insn)==CONDITIONAL_YES);
|
2874 |
|
|
+}
|
2875 |
102 |
dgisselq |
diff -Naur '--exclude=*.swp' gcc-5.3.0-original/gcc/config/zip/zip.h gcc-5.3.0-zip/gcc/config/zip/zip.h
|
2876 |
|
|
--- gcc-5.3.0-original/gcc/config/zip/zip.h 1969-12-31 19:00:00.000000000 -0500
|
2877 |
127 |
dgisselq |
+++ gcc-5.3.0-zip/gcc/config/zip/zip.h 2016-04-21 16:49:43.785679680 -0400
|
2878 |
|
|
@@ -0,0 +1,4058 @@
|
2879 |
102 |
dgisselq |
+////////////////////////////////////////////////////////////////////////////////
|
2880 |
|
|
+//
|
2881 |
|
|
+// Filename: gcc/config/zip/zip.h
|
2882 |
|
|
+//
|
2883 |
|
|
+// Project: Zip CPU backend for the GNU Compiler Collection
|
2884 |
|
|
+//
|
2885 |
|
|
+// Purpose:
|
2886 |
|
|
+//
|
2887 |
|
|
+// Creator: Dan Gisselquist, Ph.D.
|
2888 |
|
|
+// Gisselquist Technology, LLC
|
2889 |
|
|
+//
|
2890 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
2891 |
|
|
+//
|
2892 |
|
|
+// Copyright (C) 2016, Gisselquist Technology, LLC
|
2893 |
|
|
+//
|
2894 |
|
|
+// This program is free software (firmware): you can redistribute it and/or
|
2895 |
|
|
+// modify it under the terms of the GNU General Public License as published
|
2896 |
|
|
+// by the Free Software Foundation, either version 3 of the License, or (at
|
2897 |
|
|
+// your option) any later version.
|
2898 |
|
|
+//
|
2899 |
|
|
+// This program is distributed in the hope that it will be useful, but WITHOUT
|
2900 |
|
|
+// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
|
2901 |
|
|
+// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
2902 |
|
|
+// for more details.
|
2903 |
|
|
+//
|
2904 |
|
|
+// You should have received a copy of the GNU General Public License along
|
2905 |
|
|
+// with this program. (It's in the $(ROOT)/doc directory, run make with no
|
2906 |
|
|
+// target there if the PDF file isn't present.) If not, see
|
2907 |
|
|
+// <http://www.gnu.org/licenses/> for a copy.
|
2908 |
|
|
+//
|
2909 |
|
|
+// License: GPL, v3, as defined and found on www.gnu.org,
|
2910 |
|
|
+// http://www.gnu.org/licenses/gpl.html
|
2911 |
|
|
+//
|
2912 |
|
|
+//
|
2913 |
|
|
+////////////////////////////////////////////////////////////////////////////////
|
2914 |
|
|
+#ifndef GCC_ZIP_H
|
2915 |
|
|
+#define GCC_ZIP_H
|
2916 |
|
|
+
|
2917 |
|
|
+
|
2918 |
|
|
+//
|
2919 |
|
|
+//
|
2920 |
127 |
dgisselq |
+// Zip CPU configuration defines
|
2921 |
102 |
dgisselq |
+//
|
2922 |
|
|
+//
|
2923 |
|
|
+#define ZIP_USER 0 // Assume we are in supervisor mode
|
2924 |
|
|
+#define ZIP_MULTIPLY 1 // Assume we have multiply instructions
|
2925 |
|
|
+#define ZIP_DIVIDE 1 // Assume we have divide instructions
|
2926 |
|
|
+#define ZIP_FPU 0 // Assume we have no floating point instructions
|
2927 |
|
|
+#define ZIP_PIPELINED 1 // Assume our instructions are pipelined
|
2928 |
|
|
+#define ZIP_VLIW 1 // Assume we have the VLIW feature
|
2929 |
|
|
+#define ZIP_ATOMIC ((ZIP_PIPELINED)&&(ZIP_VLIW))
|
2930 |
|
|
+#define ZIP_PIC 0 // Attempting to produce PIC code, with GOT
|
2931 |
|
|
+#define ZIP_HAS_DI 1
|
2932 |
127 |
dgisselq |
+// Should we use the peephole optimizations?
|
2933 |
|
|
+#define ZIP_PEEPHOLE 1 // 0 means no peephole optimizations.
|
2934 |
102 |
dgisselq |
+
|
2935 |
|
|
+// Zip has 16 registers in each user mode.
|
2936 |
|
|
+// Register 15 is the program counter (PC)
|
2937 |
|
|
+// Register 14 is the condition codes (CC)
|
2938 |
|
|
+// Register 13 is the stack pointer (SP)
|
2939 |
|
|
+// Register 12 (may be) the Global Offset Table pointer (GOT)
|
2940 |
|
|
+// Register 0 (may be) the return address pointer
|
2941 |
|
|
+// Registers 16-31 may only be used in supervisor mode.
|
2942 |
|
|
+#define is_ZIP_GENERAL_REG(REGNO) ((REGNO)<13)
|
2943 |
|
|
+#define is_ZIP_REG(REGNO) ((REGNO)<16)
|
2944 |
|
|
+
|
2945 |
103 |
dgisselq |
+// #define zip_FP_PSEUDO 16
|
2946 |
|
|
+#define zip_PC 15
|
2947 |
|
|
+#define zip_CC 14
|
2948 |
|
|
+#define zip_SP 13
|
2949 |
|
|
+#define zip_FP 12
|
2950 |
|
|
+#define zip_GOT 11
|
2951 |
|
|
+#define zip_AP 10
|
2952 |
|
|
+#define zip_R1 1
|
2953 |
|
|
+#define zip_R0 0
|
2954 |
102 |
dgisselq |
+
|
2955 |
|
|
+#define ZIP_FIRST_ARG_REGNO 1
|
2956 |
|
|
+#define ZIP_LAST_ARG_REGNO 5
|
2957 |
111 |
dgisselq |
+#define NUM_ARG_REGS (ZIP_LAST_ARG_REGNO-ZIP_FIRST_ARG_REGNO+1)
|
2958 |
|
|
+#define MAX_PARM_REGS (ZIP_LAST_ARG_REGNO-ZIP_FIRST_ARG_REGNO+1)
|
2959 |
102 |
dgisselq |
+
|
2960 |
|
|
+/* The overall framework of an assembler file */
|
2961 |
|
|
+
|
2962 |
|
|
+#define ASM_COMMENT_START ";"
|
2963 |
|
|
+#define ASM_APP_ON ""
|
2964 |
|
|
+#define ASM_APP_OFF ""
|
2965 |
|
|
+
|
2966 |
|
|
+#define FILE_ASM_OP "\t.file\n"
|
2967 |
|
|
+
|
2968 |
|
|
+/* Output and Generation of Labels */
|
2969 |
|
|
+#define GLOBAL_ASM_OP "\t.global\t"
|
2970 |
|
|
+
|
2971 |
|
|
+#undef BITS_PER_UNIT
|
2972 |
|
|
+#define BITS_PER_UNIT (32)
|
2973 |
|
|
+
|
2974 |
|
|
+/* Assembler Commands for Alignment */
|
2975 |
|
|
+#define ASM_OUTPUT_ALIGN(STREAM,POWER) \
|
2976 |
127 |
dgisselq |
+ { int pwr = POWER; fprintf(STREAM, "\t.p2align %d\n", (pwr<2)?2:pwr); }
|
2977 |
102 |
dgisselq |
+
|
2978 |
|
|
+
|
2979 |
|
|
+/* A C compound statement to output to stdio stream STREAM the assembler syntax
|
2980 |
|
|
+ * for an instruction operand X. */
|
2981 |
|
|
+#define PRINT_OPERAND(STREAM, X, CODE) zip_print_operand(STREAM, X, CODE)
|
2982 |
|
|
+#define PRINT_OPERAND_ADDRESS(STREAM, X) zip_print_operand_address(STREAM, X)
|
2983 |
|
|
+
|
2984 |
|
|
+/* Passing arguments in registers */
|
2985 |
|
|
+#define FUNCTION_VALUE_REGNO_P(REGNO) ((REGNO)==zip_R1)
|
2986 |
|
|
+
|
2987 |
|
|
+/* Define how to find the value returned by a function. VALTYPE is the data
|
2988 |
|
|
+ * type of the value (as a tree). If the precise function being called is known
|
2989 |
|
|
+ * FUNC is its FUNCTION_DECL; otherwise, FUNC is 0. */
|
2990 |
|
|
+#define FUNCTION_VALUE(VALTYPE, FUNC) gen_rtx_REG(TYPE_MODE(VALTYPE), zip_R1)
|
2991 |
|
|
+
|
2992 |
|
|
+/* Define how to find the value returned by a library function assuming the
|
2993 |
|
|
+ * value has mode MODE.
|
2994 |
|
|
+ */
|
2995 |
|
|
+#define LIBCALL_VALUE(MODE) gen_rtx_REG(MODE, zip_R1)
|
2996 |
|
|
+
|
2997 |
|
|
+
|
2998 |
|
|
+/* STACK AND CALLING */
|
2999 |
|
|
+
|
3000 |
|
|
+
|
3001 |
|
|
+/* Define this macro as a C expression that is nonzero for registers that are
|
3002 |
|
|
+ * used by the epilogue or the return pattern. The stack and frame pointer
|
3003 |
|
|
+ * registers are already assumed to be used as needed.
|
3004 |
|
|
+ */
|
3005 |
|
|
+#define EPILOGUE_USES(R) (R == RETURN_ADDRESS_REGNUM)
|
3006 |
|
|
+
|
3007 |
|
|
+
|
3008 |
|
|
+/* The best alignment to use in cases where we have a choice. */
|
3009 |
127 |
dgisselq |
+#define FASTEST_ALIGNMENT BITS_PER_WORD
|
3010 |
102 |
dgisselq |
+
|
3011 |
|
|
+/* MAX_FIXED_MODE_SIZE -- An integer expression for the size in bits of the
|
3012 |
|
|
+ * largest integer machine mode that should actually be used. All integer
|
3013 |
|
|
+ * machine modes of this size and smaller can be used for structures and unions
|
3014 |
|
|
+ * with the appropriate sizes. If this macro is undefined,
|
3015 |
|
|
+ * GET_MODE_BITSIZE(DImode) is assumed.
|
3016 |
|
|
+ *
|
3017 |
|
|
+ * ZipCPU -- The default looks good enough for us.
|
3018 |
|
|
+ */
|
3019 |
|
|
+
|
3020 |
|
|
+/* Generate Code for Profiling
|
3021 |
|
|
+ */
|
3022 |
|
|
+#define FUNCTION_PROFILER(FILE,LABELNO) (abort(), 0)
|
3023 |
|
|
+
|
3024 |
|
|
+
|
3025 |
|
|
+/* A C expression which is nonzero if register number NUM is suitable for use
|
3026 |
|
|
+ * as an index register in operand addresses.
|
3027 |
|
|
+ */
|
3028 |
|
|
+#define REGNO_OK_FOR_INDEX_P(NUM) 0
|
3029 |
|
|
+
|
3030 |
|
|
+
|
3031 |
|
|
+/* A C compound statement with a conditional 'goto LABEL;' executed if X
|
3032 |
|
|
+ * (an RTX) is a legitimate memory address on the target machine for a memory
|
3033 |
|
|
+ * operand of mode MODE.
|
3034 |
|
|
+ */
|
3035 |
111 |
dgisselq |
+/* 17.03 Controlling the Compilation Driver, 'gcc' */
|
3036 |
|
|
+// DRIVER_SELF_SPECS
|
3037 |
|
|
+// OPTION_DEFAULT_SPECS
|
3038 |
|
|
+// CPP_SPEC
|
3039 |
|
|
+// CPLUSPLUS_CPP_SPEC
|
3040 |
|
|
+// CC1_SPEC
|
3041 |
|
|
+// CC1PLUS_SPEC
|
3042 |
|
|
+/* ASM_SPEC ... A C string constant that tells the GCC driver program options
|
3043 |
|
|
+ * to pass to the assembler. It can also specify how to translate options you
|
3044 |
|
|
+ * give to GCC into options for GCC to pass to the assembler. See the file
|
3045 |
|
|
+ * 'sun3.h' for an example of this.
|
3046 |
|
|
+ *
|
3047 |
|
|
+ * Do not define thismacro if it does not need to do anything.
|
3048 |
|
|
+ */
|
3049 |
|
|
+// #undef ASM_SPEC
|
3050 |
|
|
+// ASM_FINAL_SPEC
|
3051 |
|
|
+// ASM_NEEDS_DASH_FOR_PIPED_INPUT
|
3052 |
|
|
+
|
3053 |
|
|
+/* LINK_SPEC ... A C string constant that tells the GCC driver program options
|
3054 |
|
|
+ * to pass to the linker. It can also specify how to translate options you give
|
3055 |
|
|
+ * to GCC into options for GCC to pass to the linker.
|
3056 |
|
|
+ *
|
3057 |
|
|
+ * Do not define this macro if it does not need to do anything.
|
3058 |
|
|
+ */
|
3059 |
|
|
+
|
3060 |
|
|
+/* LIB_SPEC ... Another C string constant very much like LINK_SPEC. The
|
3061 |
|
|
+ * difference between the two is that LIB_SPEC is used at the end of the
|
3062 |
|
|
+ * command given to the linker.
|
3063 |
|
|
+ *
|
3064 |
|
|
+ * If this macro is not defined, a default is provided that loads the standard
|
3065 |
|
|
+ * C library from the usual place. See 'gcc.c'.
|
3066 |
|
|
+ */
|
3067 |
|
|
+#undef LIB_SPEC
|
3068 |
|
|
+// #define LIB_SPEC "%{!g:-lc} %{g:-lg} -lzip"
|
3069 |
|
|
+#define LIB_SPEC ""
|
3070 |
|
|
+
|
3071 |
|
|
+/* LIBGCC_SPEC ... Another C string constant that tells the GCC driver program
|
3072 |
|
|
+ * hoow and when to place a reference to 'libgcc.a' into the linker command
|
3073 |
|
|
+ * line. This constant is placed both before and after the value of LIB_SPEC.
|
3074 |
|
|
+ *
|
3075 |
|
|
+ * If this macro is not defined, the GCC driver provides a default that passes
|
3076 |
|
|
+ * the string '-lgcc' to the linker.
|
3077 |
|
|
+ */
|
3078 |
|
|
+#undef LIBGCC_SPEC
|
3079 |
|
|
+#define LIBGCC_SPEC ""
|
3080 |
|
|
+
|
3081 |
|
|
+/* REAL_LIBGCC_SPEC ... By default, if ENABLE_SHARED_LIBGCC is defined, the
|
3082 |
|
|
+ * LIBGCC_SPEC is not directly used by the driver program but is instead
|
3083 |
|
|
+ * modified to refer to different versions of 'libgcc.a' depending on the
|
3084 |
|
|
+ * values of the command line flags '-static', '-shared', '-static-libgcc',
|
3085 |
|
|
+ * and '-shared-libgcc'. On targets where these modifications are
|
3086 |
|
|
+ * inappropriate, define REAL_LIBGCC_SPEC instead. REAL_LIBGCC_SPEC tells the
|
3087 |
|
|
+ * driver how to place a reference to 'libgcc' on the link command line, but
|
3088 |
|
|
+ * unlike LIBGCC_SPEC, it is used unmodified.
|
3089 |
|
|
+ */
|
3090 |
|
|
+#define REAL_LIBGCC_SPEC ""
|
3091 |
|
|
+
|
3092 |
|
|
+// USE_LD_AS_NEEDED
|
3093 |
|
|
+// LINK_EH_SPEC
|
3094 |
|
|
+
|
3095 |
|
|
+/* STARTFILE_SPEC ... Another C string constant used much like LINK_SPEC. The
|
3096 |
|
|
+ * difference between the two is that STARTFILE_SPEC is used at the very
|
3097 |
|
|
+ * beginning of the command given to the linker.
|
3098 |
|
|
+ *
|
3099 |
|
|
+ * If this macro is not defined, a default is provided that loads the standard
|
3100 |
|
|
+ * C startup file from the usual place. See 'gcc.c'
|
3101 |
|
|
+ */
|
3102 |
|
|
+#undef STARTFILE_SPEC
|
3103 |
|
|
+#define STARTFILE_SPEC ""
|
3104 |
|
|
+
|
3105 |
|
|
+/* ENDFILE_SPEC ... Another C string constant used much like LINK_SPEC. The
|
3106 |
|
|
+ * difference between the two is that ENDFILE_SPEC is used at the very end
|
3107 |
|
|
+ * of the command given to the linker.
|
3108 |
|
|
+ *
|
3109 |
|
|
+ * Do not define this macro if it does not do anything.
|
3110 |
|
|
+ */
|
3111 |
|
|
+// #undef ENDFILE_SPEC
|
3112 |
|
|
+// #define ENDFILE_SPEC ""
|
3113 |
|
|
+
|
3114 |
|
|
+// THREAD_MODEL_SPEC
|
3115 |
|
|
+// SYSROOT_SUFFIX_SPEC
|
3116 |
|
|
+// SYSROOT_HEADERS_SUFFIX_SPEC
|
3117 |
|
|
+// EXTRA_SPECS
|
3118 |
|
|
+// LINK_LIBGCC_SPECIAL_1
|
3119 |
|
|
+// LINK_GCC_C_SEQUENCE_SPEC
|
3120 |
|
|
+// LINK_COMMAND_SPEC
|
3121 |
|
|
+// TARGET_ALWAYS_STRIP_DOTDOT
|
3122 |
|
|
+// MULTILIB_DEFAULTS
|
3123 |
|
|
+// RELATIVE_PREFIX_NOT_LINKDIR
|
3124 |
|
|
+// MD_EXEC_PREFIX
|
3125 |
|
|
+// STANDARD_STARTFILE_PREFIX
|
3126 |
|
|
+// STANDARD_STARTFILE_PREFIX_1
|
3127 |
|
|
+// STANDARD_STARTFILE_PREFIX_2
|
3128 |
|
|
+// MD_STARTFILE_PREFIX
|
3129 |
|
|
+// MD_STARTFILE_PREFIX_1
|
3130 |
|
|
+// INIT_ENVIRONMENT
|
3131 |
|
|
+// LOCAL_INCLUDE_DIR
|
3132 |
|
|
+#undef LOCAL_INCLUDE_DIR
|
3133 |
|
|
+
|
3134 |
|
|
+// NATIVE_SYSTEM_HEADER_COMPONENT
|
3135 |
|
|
+// INCLUDE_DEFAULTS
|
3136 |
|
|
+
|
3137 |
102 |
dgisselq |
+/* 17.03 Run-time Target Specification */
|
3138 |
|
|
+
|
3139 |
|
|
+/* TARGET_CPU_CPP_BUILTINS() ... This function-like macro expands to a block of
|
3140 |
|
|
+ * code that defines built-in preprocessor macros and assertions for the target
|
3141 |
|
|
+ * CPU, using the functions builtin_define, builtin_define_std, and
|
3142 |
|
|
+ * builtin_assert. When the front end calls this macro it provides a trailing
|
3143 |
|
|
+ * semicolon, and since it has finished command line option proccessing your
|
3144 |
|
|
+ * code can use those results freely.
|
3145 |
|
|
+ *
|
3146 |
|
|
+ * ZipCPU --- We should probably capture in this macro what capabilities the
|
3147 |
|
|
+ * command line parameters we've been given indicate that our CPU has. That
|
3148 |
|
|
+ * way, code can be adjusted depending upon the CPU's capabilities.
|
3149 |
|
|
+ */
|
3150 |
|
|
+#define TARGET_CPU_CPP_BUILTINS() \
|
3151 |
|
|
+ { builtin_define("__ZIPCPU__"); \
|
3152 |
|
|
+ if (ZIP_FPU) builtin_define("__ZIPFPU__"); \
|
3153 |
|
|
+ if (ZIP_ATOMIC) builtin_define("__ZIPATOMIC__"); \
|
3154 |
|
|
+ }
|
3155 |
|
|
+ // If (zip_param_has_fpu) builtin_define("__ZIPFPU__");
|
3156 |
|
|
+ // If (zip_param_has_div) builtin_define("__ZIPDIV__");
|
3157 |
|
|
+ // If (zip_param_has_mpy) builtin_define("__ZIPMPY__");
|
3158 |
|
|
+ // If (zip_param_has_lock) builtin_define("__ZIPLOCK__");
|
3159 |
|
|
+ // If (zip_param_supervisor) builtin_define("__ZIPUREGS__");
|
3160 |
|
|
+ // If (we support int64s) builtin_define("___int64_t_defined");
|
3161 |
|
|
+
|
3162 |
|
|
+/* TARGET_OS_CPP_BUILTINS() ... Similarly to TARGET_CPU_CPP_BUILTINS but this
|
3163 |
|
|
+ * macro is optional and is used for the target operating system instead.
|
3164 |
|
|
+ */
|
3165 |
|
|
+
|
3166 |
|
|
+/* Option macros: (we need to define these eventually ... )
|
3167 |
|
|
+ *
|
3168 |
|
|
+ * TARGET_HANDLE_OPTION
|
3169 |
|
|
+ * TARGET_HANDLE_C_OPTION
|
3170 |
|
|
+ * TARGET_OBJ_CONSTRUCT_STRING_OBJECT
|
3171 |
|
|
+ * TARGET_OBJ_DECLARE_UNRESOLVED_CLASS_REFERENCE
|
3172 |
|
|
+ * TARGET_OBJ_DECLARE_CLASS_DEFINITION
|
3173 |
|
|
+ * TARGET_STRING_OBJECT_REF_TYPE_P
|
3174 |
|
|
+ * TARGET_CHECK_STRING_OBJECT_FORMAT_ARG
|
3175 |
|
|
+ * TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE(VOID)
|
3176 |
|
|
+ * C_COMMON_OVERRIDE_OTPTIONS
|
3177 |
|
|
+ * TARGET_OPTION_OPTIMIZATION_TABLE
|
3178 |
|
|
+ * TARGET_OPTION_INIT_STRUCT
|
3179 |
|
|
+ * TARGET_OPTION_DEFAULT_PARAMS
|
3180 |
|
|
+ */
|
3181 |
|
|
+
|
3182 |
|
|
+/* SWITCHABLE_TARGET
|
3183 |
|
|
+ *
|
3184 |
|
|
+ * Zip CPU doesn't need this, so it defaults to zero. No need to change it
|
3185 |
|
|
+ * here.
|
3186 |
|
|
+ */
|
3187 |
|
|
+
|
3188 |
|
|
+/* TARGET_FLOAT_EXCEPTIONS_ROUNDING_SUPPORTED_P(VOID) ... Returns true if the
|
3189 |
|
|
+ * target supports IEEE 754 floating-point exceptions and rounding modes, false
|
3190 |
|
|
+ * otherwise. This is intended to relate to the float and double types, but not
|
3191 |
|
|
+ * necessarily "long double". By default, returns true if the adddf3
|
3192 |
|
|
+ * instruction pattern is available and false otherwise, on the assumption that
|
3193 |
|
|
+ * hardware floating point supports exceptions and rounding modes but software
|
3194 |
|
|
+ * floating point does not.
|
3195 |
|
|
+ *
|
3196 |
|
|
+ * ZipCPU floating point is barely going to be functional, I doubt it will
|
3197 |
|
|
+ * support all of these bells and whistles when full functionality is even
|
3198 |
|
|
+ * achieved. Therefore, we won't support these modes. However, we can't just
|
3199 |
|
|
+ * set this to zero, so let's come back to this.
|
3200 |
|
|
+ */
|
3201 |
|
|
+// #warning "Wrong answer encoded to date"
|
3202 |
103 |
dgisselq |
+// #undef TARGET_FLOAT_EXCEPTIONS_ROUNDING_SUPPORTED_P
|
3203 |
102 |
dgisselq |
+// #define TARGET_FLOAT_EXCEPTIONS_ROUNDING_SUPPORTED_P(X) 0
|
3204 |
|
|
+
|
3205 |
|
|
+/* 17.04 Defining data structures for per-function information */
|
3206 |
|
|
+
|
3207 |
|
|
+/* INIT_EXPANDERS ... Macro called to initialize any target specific
|
3208 |
|
|
+ * information. This macro is called once per function, before generation of
|
3209 |
|
|
+ * any RTL has begun. The intention is to allow the initialization of the
|
3210 |
|
|
+ * function pointer init_machine_status.
|
3211 |
|
|
+ */
|
3212 |
|
|
+// #warning "I may need to define this to handle function return addresses ..."
|
3213 |
|
|
+
|
3214 |
|
|
+/* 17.05 Storage Layout */
|
3215 |
|
|
+
|
3216 |
|
|
+/* Storage Layout */
|
3217 |
|
|
+#define BITS_BIG_ENDIAN 0 // MSB has highest number
|
3218 |
|
|
+#define BYTES_BIG_ENDIAN 1 // 1 if MSB is lowest number
|
3219 |
|
|
+#define WORDS_BIG_ENDIAN 1 // 1 if MSW is lowest number
|
3220 |
|
|
+#define FLOAT_WORDS_BIG_ENDIAN 1
|
3221 |
|
|
+#define BITS_PER_WORD 32
|
3222 |
|
|
+// #define MAX_BITS_PER_WORD // defaults to BITS_PER_WORD
|
3223 |
|
|
+#define UNITS_PER_WORD 1 // Storage units in a word, pwr of 2:1-8
|
3224 |
|
|
+#define MIN_UNITS_PER_WORD 1 // Default is UNITS_PER_WORD
|
3225 |
|
|
+/* POINTER_SIZE ... Width of a pointer in bits. You must specify a value no
|
3226 |
|
|
+ * wider than the width of Pmode. If it is not equal to the width of Pmode,
|
3227 |
|
|
+ * you must define POINTERS_EXTEND_UNSIGNED. If you do not specify a value the
|
3228 |
|
|
+ * default is BITS_PER_WORD.
|
3229 |
|
|
+ *
|
3230 |
|
|
+ * ZipCPU --- All of our pointers are 32-bits, the width of our address bus.
|
3231 |
|
|
+ */
|
3232 |
|
|
+#define POINTER_SIZE 32 // Ptr width in bits
|
3233 |
|
|
+/* POINTERS_EXTEND_UNSIGNED ... A C expression that determines how pointers
|
3234 |
|
|
+ * should be extended from ptr_mode to either Pmode or word_mode. It is greater
|
3235 |
|
|
+ * than zero if pointers should be zero-extended, zero if they should be sign
|
3236 |
|
|
+ * extended, and negative if some other conversion is needed. In the last case,
|
3237 |
|
|
+ * the extension is done by the target's ptr_extend instruction.
|
3238 |
|
|
+ *
|
3239 |
|
|
+ * You need not define this macro if the ptr_mode, Pmode, and word_mode are all
|
3240 |
|
|
+ * the same width.
|
3241 |
|
|
+ *
|
3242 |
|
|
+ * ZipCPU --- While we shouldn't need this, QImode and HImode have the same
|
3243 |
|
|
+ * number of bits as SImode. Therefore, one might wish to convert between the
|
3244 |
|
|
+ * two. Hence, we specify how we would do that here.
|
3245 |
|
|
+ */
|
3246 |
127 |
dgisselq |
+#define POINTERS_EXTEND_UNSIGNED 1
|
3247 |
102 |
dgisselq |
+
|
3248 |
|
|
+/* PROMOTE_MODE(m,unsignedp,type) ... A macro to update m and unsignedp when an
|
3249 |
|
|
+ * object whose type is type and which has he specified mode and signedness is
|
3250 |
|
|
+ * to be stored in a register. This macro is only called when type is a scalar
|
3251 |
|
|
+ * type.
|
3252 |
|
|
+ *
|
3253 |
|
|
+ * On most RISC machines, which only have operations that operate on a full
|
3254 |
|
|
+ * register, define this macro to set m to word_mode if m is an integer mode
|
3255 |
|
|
+ * narrower than BITS_PER_WORD. In most cases, only integer modes should be
|
3256 |
|
|
+ * widened because wider precision floating-point operations are usually more
|
3257 |
|
|
+ * expensive than their narrower counterparts.
|
3258 |
|
|
+ *
|
3259 |
|
|
+ * For most machines, the macro definition does not change unsigndep. However,
|
3260 |
|
|
+ * some machines, have instructions that preferentially handle either signed or
|
3261 |
|
|
+ * unsigned quantities of certain modes. For example, on the DEC Alpha, 32-bit
|
3262 |
|
|
+ * loads from memory and 32-bit add instructions sign-extend the result to
|
3263 |
|
|
+ * 64-bits. On such machines, set unsignedp according to which kind of extension
|
3264 |
|
|
+ * is more efficient.
|
3265 |
|
|
+ *
|
3266 |
|
|
+ * Do not define this macro if it would never modify m.
|
3267 |
|
|
+ *
|
3268 |
|
|
+ * ZipCPU --- We need to always (if possible) promote everything to SImode where
|
3269 |
|
|
+ * we can handle things. HImode and QImode just don't make sense on this CPU.
|
3270 |
|
|
+ */
|
3271 |
|
|
+#define PROMOTE_MODE(M,U,T) if ((GET_MODE_CLASS(M)==MODE_INT)&&(GET_MODE_SIZE(M)<2)) (M)=SImode;
|
3272 |
|
|
+
|
3273 |
|
|
+// TARGET_PROMOTE_FUNCTION_MODE
|
3274 |
|
|
+/* PARM_BOUNDARY ... Normal alignment required for function parameters on the
|
3275 |
|
|
+ * stack, in bits. All stack parameters receive at least this much alignment
|
3276 |
|
|
+ * regardless of data type. On most machines, this is the same as the size of
|
3277 |
|
|
+ * an integer.
|
3278 |
|
|
+ */
|
3279 |
|
|
+#define PARM_BOUNDARY 32
|
3280 |
|
|
+
|
3281 |
|
|
+/* STACK_BOUNDARY ... Define this macro to the minimum alignment enforced by
|
3282 |
|
|
+ * hardware for the stack pointer on this machine. The definition is a C
|
3283 |
|
|
+ * expression for the desired alignment (measured in bits). This value is used
|
3284 |
|
|
+ * as a default if PREFERRED_STACK_BOUNDARY is not defined. On most machines,
|
3285 |
|
|
+ * this should be the same as PARM_BOUNDARY.
|
3286 |
|
|
+ */
|
3287 |
|
|
+#define STACK_BOUNDARY PARM_BOUNDARY
|
3288 |
|
|
+
|
3289 |
|
|
+/* PREFERRED_STACK_BOUNDARY ... Define this ... */
|
3290 |
127 |
dgisselq |
+#define PREFERRED_STACK_BOUNDARY STACK_BOUNDARY
|
3291 |
102 |
dgisselq |
+
|
3292 |
127 |
dgisselq |
+/* INCOMING_STACK_BOUNDARY ... Define this macro if the incoming stack boundary
|
3293 |
|
|
+ * may be different from PREFERRED_STACK_BOUNDARY. This macro must evaluate
|
3294 |
|
|
+ * to a value equal to or larger than STACK_BOUNDARY.
|
3295 |
102 |
dgisselq |
+ */
|
3296 |
127 |
dgisselq |
+#define INCOMING_STACK_BOUNDARY STACK_BOUNDARY
|
3297 |
102 |
dgisselq |
+
|
3298 |
|
|
+/* FUNCTION_BOUNDARY ... Alignment required for a function entry point, in bits.
|
3299 |
|
|
+ */
|
3300 |
|
|
+#define FUNCTION_BOUNDARY 32
|
3301 |
|
|
+
|
3302 |
|
|
+/* BIGGEST_ALIGNMENT ... Biggest alignment that any data type can require on
|
3303 |
|
|
+ * this machine, in bits. Note that this is not the biggest alignment that is
|
3304 |
|
|
+ * supported, just the biggest alignment that, when violated, may cause a fault.
|
3305 |
|
|
+ */
|
3306 |
|
|
+#define BIGGEST_ALIGNMENT 32
|
3307 |
|
|
+
|
3308 |
127 |
dgisselq |
+/* MALLOC_ABI_ALIGNMENT
|
3309 |
|
|
+ */
|
3310 |
|
|
+
|
3311 |
|
|
+/* ATTRIBUTE_ALIGNED_VALUE
|
3312 |
|
|
+ */
|
3313 |
|
|
+
|
3314 |
102 |
dgisselq |
+/* MINIMUM_ATOMIC_ALIGNMENT ... If defined, the smallest alignment, that can be
|
3315 |
|
|
+ * given to an object that can be referenced in one operation, without
|
3316 |
|
|
+ * disturbing any nearby object. Normally, this is BITS_PER_UNIT, but may be
|
3317 |
|
|
+ * larger on machines that don't have byte or halfword store operations.
|
3318 |
|
|
+ */
|
3319 |
|
|
+#define MINIMUM_ATOMIC_ALIGNMENT BITS_PER_UNIT
|
3320 |
|
|
+
|
3321 |
127 |
dgisselq |
+/* BIGGEST_FIELD_ALIGNMENT ... Biggest alignment that any structure or union
|
3322 |
|
|
+ * field can require on this machine, in bits. If defined, this overrides
|
3323 |
|
|
+ * BIGGEST_ALIGNMENT for structure and union fields only, unless the field
|
3324 |
|
|
+ * alignment has been set by the __attribute__((aligned(n))) construct.
|
3325 |
|
|
+ */
|
3326 |
|
|
+#define BIGGEST_FIELD_ALIGNMENT BITS_PER_UNIT
|
3327 |
|
|
+
|
3328 |
|
|
+/* ADJUST_FIELD_ALIGN
|
3329 |
|
|
+ */
|
3330 |
|
|
+#define ADJUST_FIELD_ALIGN(A,B) BITS_PER_WORD
|
3331 |
|
|
+
|
3332 |
|
|
+/* MAX_STACK_ALIGNMENT
|
3333 |
|
|
+ */
|
3334 |
|
|
+#define MAX_STACK_ALIGNMENT BITS_PER_WORD
|
3335 |
|
|
+
|
3336 |
|
|
+/* MAX_OFILE_ALIGNMENT
|
3337 |
|
|
+ */
|
3338 |
|
|
+
|
3339 |
|
|
+/* DATA_ALIGNMENT(TYPE, BASIC-ALIGN) ... If defined, a C expression to compute
|
3340 |
|
|
+ * the alignment for a variable in the static store. TYPE is the data type, and
|
3341 |
|
|
+ * BASIC-ALIGN is the alignment that the object would ordinarily have. The
|
3342 |
|
|
+ * value of this macro is used instead of that alignment to align the object.
|
3343 |
|
|
+ *
|
3344 |
|
|
+ * If this macro is not defined, then BASIC-ALIGN is used.
|
3345 |
|
|
+ *
|
3346 |
|
|
+ * ZipCPU -- in hindsight, if this macro is not defined then the compiler is
|
3347 |
|
|
+ * broken. So we define it to be our fastest alignment, or 32-bits.
|
3348 |
|
|
+ */
|
3349 |
|
|
+#define DATA_ALIGNMENT(TYPE, ALIGN) BITS_PER_WORD
|
3350 |
|
|
+
|
3351 |
|
|
+
|
3352 |
|
|
+/* DATA_ABI_ALIGNMENT(TYPE,BASIC-ALIGN)
|
3353 |
|
|
+ */
|
3354 |
|
|
+
|
3355 |
|
|
+/* CONSTANT_ALIGNMENT(CONST, BASIC-ALIGN) ... If defined, a C expression to
|
3356 |
|
|
+ * compute the alignment given to a constant that is being placed in memory.
|
3357 |
|
|
+ * CONST is the constant and BASIC-ALIGN is the alignment that the object
|
3358 |
|
|
+ * would ordinarily have. The value of this macro is used instead of that
|
3359 |
|
|
+ * alignment to align the object.
|
3360 |
|
|
+ *
|
3361 |
|
|
+ * If this macro is not defined, then BASIC-ALIGN is used.
|
3362 |
|
|
+ *
|
3363 |
|
|
+ * ZipCPU -- in hindsiht, if this macro is not defined then the compiler is
|
3364 |
|
|
+ * broken. We'll define it as above.
|
3365 |
|
|
+ *
|
3366 |
|
|
+ */
|
3367 |
|
|
+#define CONSTANT_ALIGNMENT(EXP, ALIGN) BITS_PER_WORD
|
3368 |
|
|
+
|
3369 |
|
|
+/* LOCAL_ALIGNMENT(TYPE,BASIC-ALIGN) ... If defined ...
|
3370 |
|
|
+ */
|
3371 |
|
|
+#define LOCAL_ALIGNMENT(TYP,ALIGN) BITS_PER_WORD
|
3372 |
|
|
+
|
3373 |
|
|
+/* TARGET_VECTOR_ALIGNMENT
|
3374 |
|
|
+ */
|
3375 |
|
|
+
|
3376 |
|
|
+/* STACK_SLOT_ALIGNMENT
|
3377 |
|
|
+ */
|
3378 |
|
|
+#define STACK_SLOT_ALIGNMENT(T,M,B) BITS_PER_WORD
|
3379 |
|
|
+
|
3380 |
|
|
+/* LOCAL_DECL_ALIGNMEN(DECL)
|
3381 |
|
|
+ */
|
3382 |
|
|
+#define LOCAL_DECL_ALIGNMENT(DECL) BITS_PER_WORD
|
3383 |
|
|
+
|
3384 |
|
|
+/* MINIMUM_ALIGNMENT
|
3385 |
|
|
+ */
|
3386 |
|
|
+#define MINIMUM_ALIGNMENT(EXP,MOD,ALIGN) BITS_PER_WORD
|
3387 |
|
|
+
|
3388 |
|
|
+/* EMPTY_FIELD_BOUNDARY
|
3389 |
|
|
+ * Alignment of field after 'int : 0' in a structure.
|
3390 |
|
|
+ */
|
3391 |
|
|
+#define EMPTY_FIELD_BOUNDARY BITS_PER_WORD
|
3392 |
|
|
+
|
3393 |
|
|
+/* STRUCTURE_SIE_BOUNDARY
|
3394 |
|
|
+ * ZipCPU -- Every structures size must be a multiple of 32-bits.
|
3395 |
|
|
+ */
|
3396 |
|
|
+#define STRUCTURE_SIZE_BOUNDARY BITS_PER_WORD
|
3397 |
|
|
+
|
3398 |
102 |
dgisselq |
+/* STRICT_ALIGNMENT ... Set this nonzero if move instructions will actually
|
3399 |
|
|
+ * fail to work when given unaligned data. If instructions will merely go
|
3400 |
|
|
+ * slower in that case, define this macro as 0.
|
3401 |
125 |
dgisselq |
+ *
|
3402 |
|
|
+ * ZipCPU -- Since we have defined our smallest addressable unit to be a 32-bit
|
3403 |
|
|
+ * word (one byte, on our machine), and since reading any amount of 32-bit words
|
3404 |
|
|
+ * is easy, then there really are no instructions that will ever fail.
|
3405 |
102 |
dgisselq |
+ */
|
3406 |
125 |
dgisselq |
+#define STRICT_ALIGNMENT 0
|
3407 |
102 |
dgisselq |
+
|
3408 |
127 |
dgisselq |
+/* PCC_BITFIELD_TYPE_MATTERS -- define this if you wish to imitate the the way
|
3409 |
|
|
+ * other C compilers handle alignment of bit-fields and the structures that
|
3410 |
|
|
+ * contain them.
|
3411 |
|
|
+ *
|
3412 |
|
|
+ * The behavior is that the type written for a named bit-field (int, short, or
|
3413 |
|
|
+ * other integer type) imposes an alignment for the entire structure, as if the
|
3414 |
|
|
+ * structure really did contain an ordinary field of that type. In addition,
|
3415 |
|
|
+ * the bit-field is placed within the structure so that it would fit within
|
3416 |
|
|
+ * such a field, not crossing a boundary for it.
|
3417 |
|
|
+ *
|
3418 |
|
|
+ * Thus, no most machines, a named bit-field whose type is written as int would
|
3419 |
|
|
+ * not cross a four-byte boundary, and would force four-byte alignment for the
|
3420 |
|
|
+ * whole structure. (The alignment used may not be four bytes; it is controlled
|
3421 |
|
|
+ * by other alignment parameters.)
|
3422 |
|
|
+ *
|
3423 |
|
|
+ * An unnamed bit-field will not affect the alignment of the containing
|
3424 |
|
|
+ * structure.
|
3425 |
|
|
+ *
|
3426 |
|
|
+ * If the macro is defined, its definition should be a C expression, a non
|
3427 |
|
|
+ * zero value for the expression enables this behavior.
|
3428 |
|
|
+ * Look at the fundamental type that is used for a bit-field and use that to
|
3429 |
|
|
+ * impose alignment on the enclosing structure. struct s{int a:8}; should
|
3430 |
|
|
+ * have the same alignment as 'int', not 'char'.
|
3431 |
|
|
+ */
|
3432 |
|
|
+#undef PCC_BITFIELD_TYPE_MATTERS
|
3433 |
|
|
+#define PCC_BITFIELD_TYPE_MATTERS 0
|
3434 |
|
|
+
|
3435 |
102 |
dgisselq |
+/* MAX_FIXED_MODE_SIZE ... An integer expression for the size in bits of the
|
3436 |
|
|
+ * largest integer machine mode that should actually be used. All integer
|
3437 |
|
|
+ * machine modes of this size or smaller can be used for structures and unions
|
3438 |
|
|
+ * with the appropriate sizes. If this macro is undefined,
|
3439 |
|
|
+ * GET_MODE_BITSIZE(DImode) is assumed.
|
3440 |
|
|
+ *
|
3441 |
|
|
+ * ZipCPU ... Get_MOD_BITSIZE(DImode) will be 64, and this is really not the
|
3442 |
|
|
+ * size on bits of the largest integer machine mode. However, that's the case
|
3443 |
|
|
+ * with most DI implementations: A long is two words, spliced together. We'd
|
3444 |
|
|
+ * like to support that eventually, but we need to get there. Hence, let's use
|
3445 |
|
|
+ * compile time flag (ZIP_HAS_DI) that we can enable when we're ready.
|
3446 |
|
|
+ */
|
3447 |
|
|
+#if (ZIP_HAS_DI != 0)
|
3448 |
|
|
+#define MAX_FIXED_MODE_SIZE 64
|
3449 |
|
|
+#else
|
3450 |
|
|
+#define MAX_FIXED_MODE_SIZE 32
|
3451 |
|
|
+#endif
|
3452 |
|
|
+
|
3453 |
|
|
+
|
3454 |
|
|
+/* 17.06 Layout of Source Language Data Types */
|
3455 |
|
|
+
|
3456 |
|
|
+#undef CHAR_TYPE_SIZE
|
3457 |
|
|
+#undef SHORT_TYPE_SIZE
|
3458 |
|
|
+#undef INT_TYPE_SIZE
|
3459 |
|
|
+#undef LONG_TYPE_SIZE
|
3460 |
|
|
+#undef LONG_LONG_TYPE_SIZE
|
3461 |
|
|
+//
|
3462 |
|
|
+#define CHAR_TYPE_SIZE 32
|
3463 |
|
|
+#define SHORT_TYPE_SIZE 32
|
3464 |
|
|
+#define INT_TYPE_SIZE 32
|
3465 |
|
|
+#define LONG_TYPE_SIZE 32
|
3466 |
|
|
+#define LONG_LONG_TYPE_SIZE 64
|
3467 |
|
|
+// BOOL_TYPE_SIZE defaults to CHAR_TYPE_SIZE
|
3468 |
|
|
+#undef FLOAT_TYPE_SIZE
|
3469 |
|
|
+#undef DOUBLE_TYPE_SIZE
|
3470 |
|
|
+#undef LONG_DOUBLE_TYPE_SIZE
|
3471 |
|
|
+#define FLOAT_TYPE_SIZE 32
|
3472 |
|
|
+#define DOUBLE_TYPE_SIZE FLOAT_TYPE_SIZE // Zip CPU doesn't support dbls
|
3473 |
|
|
+#define LONG_DOUBLE_TYPE_SIZE 64 // This'll need to be done via emulation
|
3474 |
|
|
+// SHORT_FRAC_TYPE_SIZE
|
3475 |
|
|
+// LONG_FFRACT_TYPE_SIZE
|
3476 |
|
|
+// LONG_LONG_FRACT_TIME_SIZE
|
3477 |
|
|
+#undef SHORT_ACCUM_TYPE_SIZE
|
3478 |
|
|
+#undef ACCUM_TYPE_SIZE
|
3479 |
|
|
+#undef LONG_ACCUM_TYPE_SIZE
|
3480 |
|
|
+#define SHORT_ACCUM_TYPE_SIZE SHORT_TYPE_SIZE
|
3481 |
|
|
+#define ACCUM_TYPE_SIZE INT_TYPE_SIZE
|
3482 |
|
|
+#define LONG_ACCUM_TYPE_SIZE LONG_TYPE_SIZE
|
3483 |
|
|
+
|
3484 |
|
|
+/* LIBGCC2_GNU_PREFIX ... This macro corresponds to the TARGET_GNU_PREFIX target
|
3485 |
|
|
+ * hook and should be defined if that hook is overriden to be true. It causes
|
3486 |
|
|
+ * function names in libgcc to be changed to use a __gnu_ prefix for their name
|
3487 |
|
|
+ * rather than the default __. A port which uses this macro should also arrange
|
3488 |
|
|
+ * to use t-gnu-prefix in the libgcc config.host.
|
3489 |
|
|
+ *
|
3490 |
|
|
+ * ZipCPU -- I see no reason to define and therefore change this behavior.
|
3491 |
|
|
+ */
|
3492 |
|
|
+
|
3493 |
|
|
+/* TARGET_FLT_EVAL_METHOD ... A C expression for the value for FLT_EVAL_METHOD
|
3494 |
|
|
+ * in float.h,, assuming, if applicable, that the floating-point control word
|
3495 |
|
|
+ * is in its default state. If you do not define this macro the value of
|
3496 |
|
|
+ * FLT_EVAL_METHOD will be zero.
|
3497 |
|
|
+ *
|
3498 |
|
|
+ * ZipCPU --- ???
|
3499 |
|
|
+ */
|
3500 |
|
|
+
|
3501 |
|
|
+/* WIDEST_HARDWARE_FP_SIZE ... A C expression for the size in bits of the widest
|
3502 |
|
|
+ * floating-point format supported by the hardware. If you define this macro,
|
3503 |
|
|
+ * you must specify a value less than or equal to the value of LONG_DOUBLE_...
|
3504 |
|
|
+ * If you do not define this macro, the value of LONG_DOUBLE_TYPE_SIZE is the
|
3505 |
|
|
+ * default.
|
3506 |
|
|
+ *
|
3507 |
|
|
+ * ZipCPU supports 32-bit IEEE floats--IF THE SUPPORT IS COMPILED IN! This
|
3508 |
|
|
+ * really needs to be determined, then, based upon a compile time parameter
|
3509 |
|
|
+ * where the one compiling the code states whether or not the H/W even has
|
3510 |
|
|
+ * floating point support.
|
3511 |
|
|
+ *
|
3512 |
|
|
+ * For now, we'll assume it does--but once we implement GCC parameters, we'll
|
3513 |
|
|
+ * need to change this.
|
3514 |
|
|
+ */
|
3515 |
|
|
+#undef WIDEST_HARDWARE_FP_SIZE
|
3516 |
|
|
+// #warning "Definition needs to change if no FPU present"
|
3517 |
|
|
+#define WIDEST_HARDWARE_FP_SIZE FLOAT_TYPE_SIZE
|
3518 |
|
|
+
|
3519 |
|
|
+/* DEFAULT_SIGNED_CHAR ... An expression whose value is 1 or 0, according to
|
3520 |
|
|
+ * whether the type char should be signed or unsigned by default. The user
|
3521 |
|
|
+ * can always override this default with the options -fsigned-char and
|
3522 |
|
|
+ * -funsigned-char.
|
3523 |
|
|
+ *
|
3524 |
|
|
+ * ZipCPU--let's go with the default behavior.
|
3525 |
|
|
+ */
|
3526 |
|
|
+#define DEFAULT_SIGNED_CHAR 1
|
3527 |
|
|
+
|
3528 |
|
|
+/* TARGET_DEFAULT_SHORT_ENUMS(VOID) ... This target hook should return true if
|
3529 |
103 |
dgisselq |
+ * the compiler should give an enum type only as many bytes as it takes to
|
3530 |
102 |
dgisselq |
+ * represent the range of possible values of that type. It should return
|
3531 |
|
|
+ * false if all enum types should be allocated like int.
|
3532 |
|
|
+ *
|
3533 |
|
|
+ * The default is to return false. This is what the ZipCPU needs, so we won't
|
3534 |
|
|
+ * override it.
|
3535 |
|
|
+ */
|
3536 |
|
|
+
|
3537 |
|
|
+/* SIZE_TYPE ... A C expression for a string describing the name of the data
|
3538 |
|
|
+ * type to use for size values. The typedef name size_t is defined using the
|
3539 |
|
|
+ * contents of the string.
|
3540 |
|
|
+ *
|
3541 |
|
|
+ * If you don't define this macro, the default is "long unsigned int". Since
|
3542 |
|
|
+ * on the ZipCPU this is a 32-bit number, and all ZipCPU values are 32-bits,
|
3543 |
|
|
+ * the default seems perfect for us.
|
3544 |
|
|
+ */
|
3545 |
|
|
+#define SIZE_TYPE "unsigned int"
|
3546 |
|
|
+
|
3547 |
|
|
+/* SIZETYPE ... GCC defines internal types () for expressions dealing with size.
|
3548 |
|
|
+ * This macro is a C expression for a string describing the name of the data
|
3549 |
|
|
+ * type from which the precision of sizetype is extracted. The string has the
|
3550 |
|
|
+ * same restrictions as SIZE_TYPE string. If you don't define this macro, the
|
3551 |
|
|
+ * default is SIZE_TYPE --- which seems good enough for us.
|
3552 |
|
|
+ */
|
3553 |
|
|
+
|
3554 |
|
|
+/* PTRDIFF_TYPE ... A C expression for a string describing the name of the data
|
3555 |
127 |
dgisselq |
+ * type to use for the result of subtracting two pointers. The typedef name
|
3556 |
102 |
dgisselq |
+ * ptrdiff_t is defined using the contents of the string. See SIZE_TYPE for
|
3557 |
|
|
+ * more information.
|
3558 |
|
|
+ *
|
3559 |
|
|
+ * The default is "long int" which for the ZipCPU is 32-bits---still good enough
|
3560 |
|
|
+ * for us.
|
3561 |
|
|
+ */
|
3562 |
|
|
+#define PTRDIFF_TYPE "int"
|
3563 |
|
|
+
|
3564 |
|
|
+/* WCHAR_TYPE ... A C expression for a string describing the name of the data
|
3565 |
|
|
+ * type to use for wide characters. The typedef name wchar_t is defined using
|
3566 |
|
|
+ * the contents of the string. If you don't define this macro, the default is
|
3567 |
|
|
+ * 'int'--good enough for ZipCPU.
|
3568 |
|
|
+ */
|
3569 |
|
|
+
|
3570 |
|
|
+/* WCHAR_TYPE_SIZE ... A C expression for the size in bits of the data type for
|
3571 |
|
|
+ * wide characters. This is used in cpp, which cannot make use of WCHAR_TYPE.
|
3572 |
|
|
+ */
|
3573 |
|
|
+#undef WCHAR_TYPE_SIZE
|
3574 |
|
|
+#define WCHAR_TYPE_SIZE 32
|
3575 |
|
|
+
|
3576 |
|
|
+/* WINT_TYPE ... A C expression for a string describing the name of the data
|
3577 |
|
|
+ * type to use for wide characters passed to printf and returned from getwc.
|
3578 |
|
|
+ * The typedef name wint_t is defined using the contents of the string. See
|
3579 |
|
|
+ *
|
3580 |
103 |
dgisselq |
+ * ZipCPU -- If you don't define this macro, the default is "unsigned int"--also
|
3581 |
|
|
+ * best for us again.
|
3582 |
102 |
dgisselq |
+ */
|
3583 |
|
|
+
|
3584 |
|
|
+/* INTMAX_TYPE ... A C expression for a string describing the name of the
|
3585 |
|
|
+ * data type that can represent any value of any standard or extended signed
|
3586 |
|
|
+ * integer type. The typedef name intmax_t is defined using the contents of
|
3587 |
|
|
+ * the string.
|
3588 |
|
|
+ *
|
3589 |
|
|
+ * If you don't define this macro, the default is the first of "int", "long int"
|
3590 |
|
|
+ * or "long long int" that has as much precision as "long long int".
|
3591 |
|
|
+ */
|
3592 |
|
|
+
|
3593 |
|
|
+/* UINTMAX_TYPE ... same as INTMAX_TYPE, but for unsigned
|
3594 |
|
|
+ */
|
3595 |
|
|
+
|
3596 |
|
|
+#undef SIG_ATOMIC_TYPE
|
3597 |
|
|
+#if (ZIP_ATOMIC != 0)
|
3598 |
|
|
+#define SIG_ATOMIC_TYPE "int"
|
3599 |
|
|
+#else
|
3600 |
|
|
+#define SIG_ATOMIC_TYPE NULL // We have no atomic types, but registers
|
3601 |
|
|
+#endif
|
3602 |
|
|
+#undef INT8_TYPE
|
3603 |
|
|
+#define INT8_TYPE NULL // We have no 8-bit integer type
|
3604 |
|
|
+#undef INT16_TYPE
|
3605 |
|
|
+#define INT16_TYPE NULL
|
3606 |
|
|
+#undef INT32_TYPE
|
3607 |
|
|
+#define INT32_TYPE "int"
|
3608 |
|
|
+#undef UINT8_TYPE
|
3609 |
|
|
+#define UINT8_TYPE NULL
|
3610 |
|
|
+#undef UINT16_TYPE
|
3611 |
|
|
+#define UINT16_TYPE NULL
|
3612 |
|
|
+#undef UINT32_TYPE
|
3613 |
|
|
+#define UINT32_TYPE "unsigned int"
|
3614 |
|
|
+#undef INT_LEAST8_TYPE
|
3615 |
|
|
+#define INT_LEAST8_TYPE "int"
|
3616 |
|
|
+#undef INT_LEAST16_TYPE
|
3617 |
|
|
+#define INT_LEAST16_TYPE "int"
|
3618 |
|
|
+#undef INT_LEAST32_TYPE
|
3619 |
|
|
+#define INT_LEAST32_TYPE "int"
|
3620 |
|
|
+#undef UINT_LEAST8_TYPE
|
3621 |
|
|
+#define UINT_LEAST8_TYPE "unsigned int"
|
3622 |
|
|
+#undef UINT_LEAST16_TYPE
|
3623 |
|
|
+#define UINT_LEAST16_TYPE "unsigned int"
|
3624 |
|
|
+#undef UINT_LEAST32_TYPE
|
3625 |
|
|
+#define UINT_LEAST32_TYPE "unsigned int"
|
3626 |
|
|
+#undef INT_FAST8_TYPE
|
3627 |
|
|
+#define INT_FAST8_TYPE "int"
|
3628 |
|
|
+#undef INT_FAST16_TYPE
|
3629 |
|
|
+#define INT_FAST16_TYPE "int"
|
3630 |
|
|
+#undef INT_FAST32_TYPE
|
3631 |
|
|
+#define INT_FAST32_TYPE "int"
|
3632 |
|
|
+#undef UINT_FAST8_TYPE
|
3633 |
|
|
+#define UINT_FAST8_TYPE "unsigned int"
|
3634 |
|
|
+#undef UINT_FAST16_TYPE
|
3635 |
|
|
+#define UINT_FAST16_TYPE "unsigned int"
|
3636 |
|
|
+#undef UINT_FAST32_TYPE
|
3637 |
|
|
+#define UINT_FAST32_TYPE "unsigned int"
|
3638 |
|
|
+#undef INTPTR_TYPE
|
3639 |
|
|
+#define INTPTR_TYPE "unsigned int"
|
3640 |
|
|
+#undef UINTPTR_TYPE
|
3641 |
|
|
+#define UINTPTR_TYPE "unsigned int"
|
3642 |
|
|
+
|
3643 |
|
|
+#undef INT64_TYPE
|
3644 |
|
|
+#undef UINT64_TYPE
|
3645 |
|
|
+#undef INT_LEAST64_TYPE
|
3646 |
|
|
+#undef UINT_LEAST64_TYPE
|
3647 |
|
|
+#undef INT_FAST64_TYPE
|
3648 |
|
|
+#undef UINT_FAST64_TYPE
|
3649 |
|
|
+
|
3650 |
|
|
+#if (ZIP_HAS_DI != 0)
|
3651 |
|
|
+#define INT64_TYPE "long int"
|
3652 |
|
|
+#define UINT64_TYPE "long unsigned int"
|
3653 |
|
|
+#define INT_LEAST64_TYPE "long int"
|
3654 |
|
|
+#define UINT_LEAST64_TYPE "long unsigned int"
|
3655 |
|
|
+#define INT_FAST64_TYPE "long int"
|
3656 |
|
|
+#define UINT_FAST64_TYPE "long unsigned int"
|
3657 |
|
|
+#else
|
3658 |
|
|
+#define INT64_TYPE NULL
|
3659 |
|
|
+#define UINT64_TYPE NULL
|
3660 |
|
|
+#define INT_LEAST64_TYPE NULL
|
3661 |
|
|
+#define UINT_LEAST64_TYPE NULL
|
3662 |
|
|
+#define INT_FAST64_TYPE NULL
|
3663 |
|
|
+#define UINT_FAST64_TYPE NULL
|
3664 |
|
|
+#endif
|
3665 |
|
|
+
|
3666 |
|
|
+#define TARGET_PTRMEMFUNC_VBI_LOCATION ptrmemfunc_vbit_in_pfn
|
3667 |
|
|
+
|
3668 |
|
|
+
|
3669 |
|
|
+/* 17.07 Register Usage / Register definitions */
|
3670 |
|
|
+
|
3671 |
|
|
+/* FIRST_PSEUDO_REGISTER ... Number of hardware registers known to the compiler.
|
3672 |
|
|
+ * They receive numbers 0 through FIRST_PSEUDO_REGISTER-1; thus the first
|
3673 |
|
|
+ * pseudo register's numbrer really is assigned the number
|
3674 |
|
|
+ * FIRST_PSEUDO_REGISTER.
|
3675 |
|
|
+ *
|
3676 |
|
|
+ * ZipCPU---There are 16 registers in the ZipCPU, numbered 0-15 with the CC
|
3677 |
|
|
+ * and PC register being numbered 14 and 15 respectively. Therefore, the
|
3678 |
|
|
+ * compiler can take register number 16 and above and do whatever it wants
|
3679 |
|
|
+ * with it.
|
3680 |
|
|
+ */
|
3681 |
|
|
+#ifdef DEFINE_USER_REGS
|
3682 |
103 |
dgisselq |
+# define FIRST_PSEUDO_REGISTER 32
|
3683 |
102 |
dgisselq |
+#else
|
3684 |
103 |
dgisselq |
+# ifdef zip_FP_PSEUDO
|
3685 |
|
|
+# define FIRST_PSEUDO_REGISTER (zip_FP_PSEUDO+1)
|
3686 |
|
|
+# else
|
3687 |
|
|
+# define FIRST_PSEUDO_REGISTER 16
|
3688 |
|
|
+# endif
|
3689 |
102 |
dgisselq |
+#endif
|
3690 |
|
|
+
|
3691 |
|
|
+/* FIXED_REGISTERS ... An initializer that says which registers are used for
|
3692 |
|
|
+ * fixed purposes all throughout the compiled code and are therefore not
|
3693 |
|
|
+ * available for general allocation. These would include the stack pointer, the
|
3694 |
|
|
+ * frame pointer (except on machines where that can be used as a general
|
3695 |
|
|
+ * register when no frame pointer is needed), the program counter on machines
|
3696 |
|
|
+ * where that is considered one of the addressable registers, and any other
|
3697 |
|
|
+ * numbered register with a standard use.
|
3698 |
|
|
+ *
|
3699 |
|
|
+ * This information is expressed as a sequence of numbers, separated by commas,
|
3700 |
|
|
+ * and surrounded by braces. The nth number is 1 if register n is fixed, 0
|
3701 |
|
|
+ * otherwise.
|
3702 |
|
|
+ *
|
3703 |
|
|
+ * For the Zip CPU, we have three fixed registers that are not available for
|
3704 |
|
|
+ * general allocation:
|
3705 |
|
|
+ *
|
3706 |
|
|
+ * SP The stack pointer
|
3707 |
|
|
+ * CC The condition codes and CPU state register
|
3708 |
|
|
+ * PC The program counter
|
3709 |
|
|
+ *
|
3710 |
|
|
+ * Other registers, such as FP (the frame pointer) or GBL (the global offset
|
3711 |
|
|
+ * table pointer) are registers that we hope will not be so fixed.
|
3712 |
|
|
+ */
|
3713 |
127 |
dgisselq |
+#ifdef DEFINE_USER_REGS
|
3714 |
|
|
+# define FIXED_REGISTERS { 0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1 }
|
3715 |
103 |
dgisselq |
+#else
|
3716 |
127 |
dgisselq |
+# ifdef zip_FP_PSEUDO
|
3717 |
|
|
+# define FIXED_REGISTERS { 0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1 }
|
3718 |
|
|
+# else
|
3719 |
|
|
+# define FIXED_REGISTERS { 0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1 }
|
3720 |
|
|
+# endif
|
3721 |
103 |
dgisselq |
+#endif
|
3722 |
102 |
dgisselq |
+
|
3723 |
|
|
+/* CALL_USED_REGISTERS ... like FIXED_REGISTERS but has 1 for each register
|
3724 |
|
|
+ * that is clobbered (in general) by function calls as well as for fixed
|
3725 |
|
|
+ * registers. This macro therefore identifies the registers that are not
|
3726 |
|
|
+ * available for general allocation of values that must live across function
|
3727 |
|
|
+ * calls.
|
3728 |
|
|
+ *
|
3729 |
|
|
+ * If a register has 0 in CALL_USED_REGISTERS, the compiler automatically saves
|
3730 |
|
|
+ * it on function entry and restores it on function exit, if the register is
|
3731 |
|
|
+ * used within the function.
|
3732 |
|
|
+ *
|
3733 |
|
|
+ * On the Zip CPU, we must save R0 (the return address), and (let's pick) any
|
3734 |
|
|
+ * register above R5.
|
3735 |
|
|
+ */
|
3736 |
127 |
dgisselq |
+#ifdef DEFINE_USER_REGS
|
3737 |
|
|
+# define CALL_USED_REGISTERS { 0,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1 }
|
3738 |
103 |
dgisselq |
+#else
|
3739 |
127 |
dgisselq |
+# ifdef zip_FP_PSEUDO
|
3740 |
|
|
+# define CALL_USED_REGISTERS { 0,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1 }
|
3741 |
|
|
+# else
|
3742 |
|
|
+# define CALL_USED_REGISTERS { 0,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1 }
|
3743 |
|
|
+# endif
|
3744 |
103 |
dgisselq |
+#endif
|
3745 |
102 |
dgisselq |
+
|
3746 |
|
|
+/* CALL_REALLY_USED_REGISTERS ... optional macro that, if not defined, defaults
|
3747 |
|
|
+ * to the value of CALL_USED_REGISTERS.
|
3748 |
|
|
+ */
|
3749 |
|
|
+
|
3750 |
|
|
+/* HARD_REGNO_CALL_PART_CLOBBERED(REGNO,MODE) ... A C expression that is nonzero
|
3751 |
|
|
+ * if it is not permissible to store a value of mode MODE in hard register REGNO
|
3752 |
|
|
+ * across a call without some part of it being clobbbered. For most machines,
|
3753 |
|
|
+ * this macro need not be defined. It is only required for machines that do
|
3754 |
103 |
dgisselq |
+ * not preserve the entire contents of a register across a call.
|
3755 |
102 |
dgisselq |
+ *
|
3756 |
127 |
dgisselq |
+ * ZipCPU--Always preserves the entire contents of those registers that are
|
3757 |
|
|
+ * preserved across calls, so this shouldnt need to be defined.
|
3758 |
102 |
dgisselq |
+ */
|
3759 |
127 |
dgisselq |
+// #define HARD_REGNO_CALL_PART_CLOBBERED(REGNO,MODE) (REGNO==0)
|
3760 |
102 |
dgisselq |
+
|
3761 |
|
|
+/* TARGET_CONDITIONAL_REGISTER_USAGE(VOID) ... This hook may conditionally
|
3762 |
|
|
+ * modify five variables fixed_regs, call_used_regs, global_regs, reg_names, and
|
3763 |
|
|
+ * reg_class_contents, to take into account any dependence of these register
|
3764 |
|
|
+ * sets on target flags. The first three of these are of type char[]
|
3765 |
|
|
+ * (interpreted as Boolean vectors). global_regs is a const char *[] and
|
3766 |
|
|
+ * reg_class_contents is a HARD_REG_SET. Before the macro is called,
|
3767 |
|
|
+ * fixed_regs, call_used_regs, reg_class_contents, and reg_names have been
|
3768 |
|
|
+ * initialized from FIXED_REGISTERS, CALL_USED_REGISTERS, REG_CLASS_CONTENTS,
|
3769 |
|
|
+ * and REGISTER_NAMES, respectively. global_regs has been cleared, and any
|
3770 |
|
|
+ * -ffixed-reg, -fcall-used-reg, and -fcall-saved-reg command options have been
|
3771 |
|
|
+ * applied.
|
3772 |
|
|
+ *
|
3773 |
|
|
+ * ZipCPU -- I may need to return and define this depending upon how FP and
|
3774 |
|
|
+ * GBL register allocation go. But for now, we'll leave this at its default
|
3775 |
|
|
+ * value.
|
3776 |
|
|
+ */
|
3777 |
|
|
+// #warning "Revisit me after FP and GBL allocation"
|
3778 |
|
|
+
|
3779 |
|
|
+/* INCOMING_REGNO(out) ... Define this macro if the target machine has register
|
3780 |
|
|
+ * windows. ...
|
3781 |
|
|
+ *
|
3782 |
|
|
+ * Zip CPU has no register windows.
|
3783 |
|
|
+ */
|
3784 |
|
|
+
|
3785 |
|
|
+/* OUTGOING_REGNO ... same thing.
|
3786 |
|
|
+ */
|
3787 |
|
|
+
|
3788 |
|
|
+/* LOCAL_REGNO ... same thing.
|
3789 |
|
|
+ */
|
3790 |
|
|
+
|
3791 |
|
|
+/* PC_REGNUM ... If the program counter has a register number, define this as
|
3792 |
|
|
+ * that register number. Otherwise do not define it.
|
3793 |
|
|
+ */
|
3794 |
|
|
+#define PC_REGNUM zip_PC
|
3795 |
|
|
+
|
3796 |
|
|
+
|
3797 |
|
|
+/* REG_ALLOC_ORDER ... If defined, an initializer for a vector of integers,
|
3798 |
|
|
+ * containing the number of hard registers in the order in which GCC should
|
3799 |
|
|
+ * prefer to use them (from most preferred to least.
|
3800 |
|
|
+ *
|
3801 |
103 |
dgisselq |
+ * If this macro is not defined, registers are used lowest numbered first (all
|
3802 |
102 |
dgisselq |
+ * else being equal).
|
3803 |
|
|
+ *
|
3804 |
|
|
+ * Since the default is the ZipCPU desired case, we won't define this here.
|
3805 |
|
|
+ */
|
3806 |
|
|
+
|
3807 |
|
|
+/* ADJUST_REG_ALLOC_ORDER ... on most machines it is not necessary to define
|
3808 |
|
|
+ * this macro, so we won't either.
|
3809 |
|
|
+ */
|
3810 |
|
|
+
|
3811 |
|
|
+/* HONOR_REG_ALLOC_ORDER ...
|
3812 |
|
|
+ */
|
3813 |
|
|
+
|
3814 |
|
|
+/* HONOR_REG_ALLOC_ORDER ... on most machines it is not necessary to define
|
3815 |
|
|
+ * this macro, so we won't either.
|
3816 |
|
|
+ */
|
3817 |
|
|
+
|
3818 |
|
|
+/* HARD_REGNO_NREGS(REGNO, MODE) ... A C expression for the number of
|
3819 |
|
|
+ * consecutive hard registers, starting at register number REGNO, required to
|
3820 |
|
|
+ * hold a value of mode MODE.
|
3821 |
|
|
+ *
|
3822 |
|
|
+ * On a machine where all registers are exactly one word, a suitable definition
|
3823 |
|
|
+ * is given of ((GET_MODE_SIZE(MODE)+UNITS_PER_WORD-1)/UNITS_PER_WORD.
|
3824 |
|
|
+ *
|
3825 |
|
|
+ * On ZipCPU, we might do
|
3826 |
|
|
+ * ((((MODE)==DImode)||((MODE)==DFmode))?2:1)
|
3827 |
|
|
+ * but I think the default (above) code should work as well. Hence, let's stick
|
3828 |
|
|
+ * with the default, lest someone try to create larger modes (TImode, OImode,
|
3829 |
|
|
+ * XImode) and expect us to follow them properly some how.
|
3830 |
|
|
+ *
|
3831 |
|
|
+ * Okay, now in hind sight, we know that the default doesn't work for our
|
3832 |
|
|
+ * architecture, since GET_MODE_SIZE(SImode)=4, not 1. Thus, let's rearrange
|
3833 |
|
|
+ * this expression to work in bits rather than in bytes and we'll know more
|
3834 |
|
|
+ * of what we are doing.
|
3835 |
|
|
+ */
|
3836 |
|
|
+#undef HARD_REGNO_NREGS
|
3837 |
|
|
+#define HARD_REGNO_NREGS(REGNO, MODE) ((GET_MODE_SIZE(MODE)+UNITS_PER_WORD-1)\
|
3838 |
|
|
+ / (UNITS_PER_WORD))
|
3839 |
|
|
+
|
3840 |
|
|
+/* HARD_REGNO_NREGS_HAS_PADDING(REGNO,MODE) ... A C expression that is nonzero
|
3841 |
|
|
+ * if a value of mode MODE, stored in memory, ends with padding that causes it
|
3842 |
|
|
+ * to take up more space than in registers starting at register number REGNO
|
3843 |
|
|
+ * (as determined by multiplying GCC's notion of the size of the register when
|
3844 |
|
|
+ * containing this mode by the number of registers returned by HARD_REGNO_NREGS)
|
3845 |
|
|
+ * By default this is zero.
|
3846 |
|
|
+ *
|
3847 |
|
|
+ * Zip CPU --- The default looks good enough to me.
|
3848 |
|
|
+ */
|
3849 |
|
|
+
|
3850 |
|
|
+/* HARD_REGNO_NREGS_WITH_PADDING(REGNO, MODE)
|
3851 |
|
|
+ *
|
3852 |
|
|
+ * ZipCPU ---
|
3853 |
|
|
+ */
|
3854 |
|
|
+
|
3855 |
|
|
+/* REGMODE_NATURAL_SIZE(MODE) -- Define this macro if the natural size of
|
3856 |
|
|
+ * registers that hold values of mode mode is not the word size. It is a C
|
3857 |
|
|
+ * expression that should give the natural size in bytes for the specified mode.
|
3858 |
|
|
+ * It is used by the register allocator to try to optimize its results.
|
3859 |
|
|
+ *
|
3860 |
|
|
+ * ZipCPU ---
|
3861 |
|
|
+ */
|
3862 |
|
|
+// #define REGMODE_NATURAL_SIZE(MODE) (((MODE)==DImode)?2:1)
|
3863 |
|
|
+
|
3864 |
|
|
+/* HARD_REGNO_MODE_OK ... A C expression that is nonzero if it is permissible
|
3865 |
103 |
dgisselq |
+ * to store a value of mode MODE in a hard register number REGNO (or in several
|
3866 |
102 |
dgisselq |
+ * registers starting with that one). For a machine where all registers are
|
3867 |
|
|
+ * equivalent, a suitable definition is '1'. You need not include code to check
|
3868 |
|
|
+ * for the numbers of fixed registers, because the allocation mechanism
|
3869 |
|
|
+ * considered them to be always occupied.
|
3870 |
|
|
+ *
|
3871 |
|
|
+ * ZipCPU --- As long as you are already avoiding the fixed registers, the
|
3872 |
|
|
+ * suitable default definition mentioned above should be sufficient.
|
3873 |
|
|
+ */
|
3874 |
|
|
+#undef HARD_REGNO_MODE_OK
|
3875 |
103 |
dgisselq |
+#define HARD_REGNO_MODE_OK(R,M) (R<zip_CC)
|
3876 |
102 |
dgisselq |
+
|
3877 |
|
|
+/* HARD_REGNO_RENAME_OK(FROM,TO) ... A C expression that is nonzero if it is
|
3878 |
|
|
+ * okay to rename a hard register FROM to another hard register TO. One common
|
3879 |
|
|
+ * use of this macro is to prevernt renaming of a register to another register
|
3880 |
|
|
+ * that is not saved by a prologue in an interrupt handler. The default is
|
3881 |
|
|
+ * always nonzero.
|
3882 |
|
|
+ *
|
3883 |
|
|
+ * ZipCPU --- The default looks good enough to us.
|
3884 |
|
|
+ */
|
3885 |
|
|
+#undef HARD_REGNO_RENAME_OK
|
3886 |
|
|
+#define HARD_REGNO_RENAME_OK(FROM,TO) ((is_ZIP_GENERAL_REG(FROM))&&(is_ZIP_GENERAL_REG(TO)))
|
3887 |
|
|
+
|
3888 |
|
|
+
|
3889 |
|
|
+/* MODES_TIABLE_P(M1, M2) ... A C expression that is nonzero if a value of mode
|
3890 |
|
|
+ * M1 is accessible in mode M2 without copying.
|
3891 |
|
|
+ *
|
3892 |
|
|
+ * ZipCPU --- well, that's true for us (although we support scant few modes) ...
|
3893 |
|
|
+ * so lets' set to one.
|
3894 |
|
|
+ */
|
3895 |
|
|
+#define MODES_TIEABLE_P(M1,M2) 1
|
3896 |
|
|
+
|
3897 |
|
|
+/* TARGET_HARD_REGNO_SCRATCH_OK(REGNO)
|
3898 |
|
|
+ * This target hook should return true if it is OK to use a hard register
|
3899 |
|
|
+ * REGNO has a scratch register in peephole2. One common use of this macro is
|
3900 |
|
|
+ * to prevent using of a register that is not saved by a prologue in an
|
3901 |
|
|
+ * interrupt handler. The default version of this hook always returns true.
|
3902 |
|
|
+ *
|
3903 |
|
|
+ * ZipCPU --- the default works for us as well. If you are in an interrupt
|
3904 |
|
|
+ * context, you have an entirely new set of registers (the supervisor set), so
|
3905 |
|
|
+ * this is a non-issue.
|
3906 |
|
|
+ */
|
3907 |
|
|
+
|
3908 |
|
|
+/* AVOID_CCMODE_COPIES ... define this macro if the compiler should avoid
|
3909 |
|
|
+ * copies to/from CCmode register(s). You should only define this macro if
|
3910 |
|
|
+ * support for copying to/from CCmode is incomplete.
|
3911 |
|
|
+ *
|
3912 |
|
|
+ * ZipCPU --- CCmode register copies work like any other, so we'll keep with the
|
3913 |
|
|
+ * default definition.
|
3914 |
|
|
+ */
|
3915 |
|
|
+
|
3916 |
|
|
+/* STACK_REGS ... Define this if the machine has any stack-like registers.
|
3917 |
|
|
+ *
|
3918 |
|
|
+ * Zip CPU has no stack-like registers, as their definition is different from
|
3919 |
|
|
+ * the ZipCPU stack pointer register.
|
3920 |
|
|
+ */
|
3921 |
|
|
+
|
3922 |
127 |
dgisselq |
+// #define ZIP_REG_BYTE_SIZE 1
|
3923 |
102 |
dgisselq |
+
|
3924 |
|
|
+/* 17.08 Register Classes */
|
3925 |
|
|
+
|
3926 |
|
|
+/* enum reg_class ... An enumerate type that must be defined with all the
|
3927 |
|
|
+ * register class names as enumerated values. NO_REGS must be first. ALL_REGS
|
3928 |
|
|
+ * must be the last register class, followed by one more enumerated value,
|
3929 |
|
|
+ * LIM_REG_CLASSES, which is not a register class but rather tells how many
|
3930 |
|
|
+ * classes there are.
|
3931 |
|
|
+ *
|
3932 |
|
|
+ * ZipCPU --- We'll defined register 0-13 as general registers, 14-15 in
|
3933 |
|
|
+ * all_regs, and go from there.
|
3934 |
|
|
+ */
|
3935 |
|
|
+enum reg_class {
|
3936 |
|
|
+ NO_REGS, GENERAL_REGS,
|
3937 |
|
|
+#ifdef DEFINE_USER_REGS
|
3938 |
|
|
+ USER_REGS,
|
3939 |
|
|
+#endif
|
3940 |
|
|
+ ALL_REGS, LIM_REG_CLASSES
|
3941 |
|
|
+};
|
3942 |
|
|
+
|
3943 |
|
|
+/* N_REG_CLASSES ... the number of distinct register classes, defined as follows
|
3944 |
|
|
+ */
|
3945 |
|
|
+#define N_REG_CLASSES (int)LIM_REG_CLASSES
|
3946 |
|
|
+
|
3947 |
|
|
+/* REG_CLASS_NAMES ... An initializer containing the names of the register
|
3948 |
|
|
+ * classes as C string constants. These names are used in writing some of the
|
3949 |
|
|
+ * debugging dumps.
|
3950 |
|
|
+ */
|
3951 |
127 |
dgisselq |
+#ifdef DEFINE_USER_REGS
|
3952 |
|
|
+# define REG_CLASS_NAMES { "NO_REGS", "GENERAL_REGS", "USER_REGS", "ALL_REGS" }
|
3953 |
|
|
+#else
|
3954 |
|
|
+# define REG_CLASS_NAMES { "NO_REGS", "GENERAL_REGS", "ALL_REGS" }
|
3955 |
|
|
+#endif
|
3956 |
102 |
dgisselq |
+
|
3957 |
|
|
+/* REG_CLASS_CONTENTS ... An initializer containing the contents of the register
|
3958 |
127 |
dgisselq |
+ * classes, as integers which are bit masks. The nth integer specifies the
|
3959 |
102 |
dgisselq |
+ * contents of class n. That way the integer mask is interpreted as that
|
3960 |
|
|
+ * register r is in the class if (mask&(1<<r)) is 1.
|
3961 |
|
|
+ *
|
3962 |
|
|
+ * When the machine has more than 32 registers ... that's not us.
|
3963 |
|
|
+ *
|
3964 |
|
|
+ * ZipCPU --- This is straight forward, three register classes, etc.
|
3965 |
|
|
+ */
|
3966 |
127 |
dgisselq |
+#ifdef DEFINE_USER_REGS
|
3967 |
|
|
+# define REG_CLASS_CONTENTS { { 0x000000000}, {0x00003fff}, {0x0ffff0000l}, {0x0ffffffffl} }
|
3968 |
103 |
dgisselq |
+#else
|
3969 |
127 |
dgisselq |
+# ifdef zip_FP_PSEUDO
|
3970 |
|
|
+# define REG_CLASS_CONTENTS { { 0x00000}, {0x13fff}, {0x1ffff} }
|
3971 |
|
|
+# else
|
3972 |
|
|
+# define REG_CLASS_CONTENTS { { 0x00000}, {0x03fff}, {0x0ffff} }
|
3973 |
|
|
+# endif
|
3974 |
103 |
dgisselq |
+#endif
|
3975 |
102 |
dgisselq |
+
|
3976 |
|
|
+/* REGNO_REG_CLASS ... A C expression whose value is a register class
|
3977 |
|
|
+ * containing hard register REGNO. In general there is more than one such
|
3978 |
|
|
+ * class; Choose a class which is minimal, meaning that no smaller class also
|
3979 |
|
|
+ * contains the register.
|
3980 |
|
|
+ */
|
3981 |
|
|
+#undef REGNO_REG_CLASS
|
3982 |
103 |
dgisselq |
+#ifdef zip_FP_PSEUDO
|
3983 |
|
|
+#define REGNO_REG_CLASS(R) (is_ZIP_REG(R)?((((R)<=13)||((R)==zip_FP_PSEUDO))?GENERAL_REGS:ALL_REGS):NO_REGS)
|
3984 |
|
|
+#else
|
3985 |
102 |
dgisselq |
+#define REGNO_REG_CLASS(R) (is_ZIP_REG(R)?((R<=13)?GENERAL_REGS:ALL_REGS):NO_REGS)
|
3986 |
103 |
dgisselq |
+#endif
|
3987 |
102 |
dgisselq |
+
|
3988 |
|
|
+/* BASE_REG_CLASS ... A macro whose definition is the name of the class to which
|
3989 |
|
|
+ * a valid base register must belong. A base register is one used in an address
|
3990 |
|
|
+ * which is the register value plus a displacement.
|
3991 |
|
|
+ */
|
3992 |
|
|
+#undef BASE_REG_CLASS
|
3993 |
|
|
+#define BASE_REG_CLASS GENERAL_REGS
|
3994 |
|
|
+
|
3995 |
|
|
+/* MODE_BASE_CLASS(MODE) ... This is a variation of the BASE_REG_CLASS macro
|
3996 |
|
|
+ * which allows the selection of a bse register in a mode dependent manner. If
|
3997 |
|
|
+ * mode is VOIDmode then it should return the same value as BASE_REG_CLASS.
|
3998 |
|
|
+ */
|
3999 |
|
|
+#undef MODE_BASE_CLASS
|
4000 |
|
|
+#define MODE_BASE_CLASS(MODE) GENERAL_REGS
|
4001 |
|
|
+
|
4002 |
|
|
+/* MODE_BASE_REG_REG_CLASS(MODE) ... A C expression whose value is the register
|
4003 |
|
|
+ * class to which a valid base register must belong in order to be used in a
|
4004 |
|
|
+ * base plus index register address. You should define this macro if base plus
|
4005 |
|
|
+ * index addresses have different requirements than other base register uses.
|
4006 |
|
|
+ *
|
4007 |
|
|
+ * Zip CPU does not support the base plus index addressing mode, thus ...
|
4008 |
|
|
+ */
|
4009 |
111 |
dgisselq |
+// #undef MODE_BASE_REG_REG_CLASS
|
4010 |
|
|
+// #define MODE_BASE_REG_REG_CLASS(MODE) NO_REGS
|
4011 |
102 |
dgisselq |
+
|
4012 |
|
|
+/* INDEX_REG_CLASS ... A macro whose definition is the name of the class to
|
4013 |
|
|
+ * which a valid index register must belong. An index register is one used in
|
4014 |
|
|
+ * an address where its value is either multiplied by a scale factor or added
|
4015 |
|
|
+ * to another register (as well as added to a displacement).
|
4016 |
|
|
+ *
|
4017 |
|
|
+ * ZipCPU -- Has no index registers.
|
4018 |
|
|
+ */
|
4019 |
|
|
+#undef INDEX_REG_CLASS
|
4020 |
|
|
+#define INDEX_REG_CLASS NO_REGS
|
4021 |
|
|
+
|
4022 |
|
|
+/* REGNO_OK_FOR_BASE_P(NUM) ... A C expression which is nonzero if register
|
4023 |
|
|
+ * number num is suitable for use as a base register in operand addresses.
|
4024 |
|
|
+ */
|
4025 |
|
|
+#undef REGNO_OK_FOR_BASE_P
|
4026 |
127 |
dgisselq |
+# define REGNO_OK_FOR_BASE_P(NUM) ((NUM>=FIRST_PSEUDO_REGISTER)||(NUM != zip_CC))
|
4027 |
102 |
dgisselq |
+
|
4028 |
|
|
+/* REGNO_MODE_OK_FOR_BASE_P ... A C expressison that is just like
|
4029 |
|
|
+ * REGNO_OK_FOR_BASE_P, except that that expression may examine the mode of the
|
4030 |
111 |
dgisselq |
+ * memory reference in MODE. You should define this macro if the mode of the
|
4031 |
102 |
dgisselq |
+ * memory reference affects whether a register may be used as a base register.
|
4032 |
|
|
+ *
|
4033 |
|
|
+ * ZipCPU --- the mode doesn't affect anything, so we don't define this.
|
4034 |
|
|
+ */
|
4035 |
|
|
+
|
4036 |
|
|
+/* REGNO_MODE_OK_FOR_REG_BASE_P(NUM, MODE) ... base plus index operand
|
4037 |
|
|
+ * addresses, accessing memory in mode mode.
|
4038 |
|
|
+ *
|
4039 |
|
|
+ * Use of this macro is deprecated.
|
4040 |
|
|
+ */
|
4041 |
|
|
+
|
4042 |
111 |
dgisselq |
+/* REGNO_MODE_CODE_OK_FOR_BASE_P(N,M,AS,OC,IC) ... A C expression which is
|
4043 |
102 |
dgisselq |
+ * nonzero if a register number N is suitable for use as a base register in
|
4044 |
|
|
+ * operand addresses, accessing memory in mode M in address space AS. This is
|
4045 |
|
|
+ * similar to REGNO_MODE_OK_FOR_BASE_P, except that the expression may examine
|
4046 |
|
|
+ * the context in which the register appears in the memory reference.
|
4047 |
|
|
+ *
|
4048 |
|
|
+ * ZipCPU---We aren't specific in how we use our registers.
|
4049 |
|
|
+ */
|
4050 |
|
|
+#define REGNO_MODE_CODE_OK_FOR_BASE_P(N,M,AS,OC,IC) REGNO_OK_FOR_BASE_P(N)
|
4051 |
|
|
+
|
4052 |
|
|
+/* REGNO_OK_FOR_INDEX_P(REGNO) ... A C expression which is nonzero if register
|
4053 |
|
|
+ * num is suitable for use as an index register in opernad addressess. It may
|
4054 |
|
|
+ * be either a suitable hard register or a pseudo register that has been
|
4055 |
111 |
dgisselq |
+ * allocated such as a hard register.
|
4056 |
102 |
dgisselq |
+ *
|
4057 |
|
|
+ * ZipCPU has no index registers, therefore we declare this to be zero.
|
4058 |
|
|
+ */
|
4059 |
|
|
+#undef REGNO_OK_FOR_INDEX_P
|
4060 |
|
|
+#define REGNO_OK_FOR_INDEX_P(REGNO) 0
|
4061 |
|
|
+
|
4062 |
|
|
+/* TARGET_PREFERRED_RENAME_CLASS(RCLASS) ... A target hook that places
|
4063 |
|
|
+ * additional preference on the register class to use when it is necessary to
|
4064 |
|
|
+ * rename a register in class RCLASS to another class, or perhaps NO_REGS, if no
|
4065 |
|
|
+ * preferred register class is found or hook preferred_rename_class is not
|
4066 |
|
|
+ * implemented. SOmething returning a more restrictive class makes better code.
|
4067 |
|
|
+ * For example, on ARM, thumb-2 instructions using LO_REGS may be smaller than
|
4068 |
|
|
+ * instructions using GENERIC_REGS. By returning LO_REGS from
|
4069 |
|
|
+ * preferred_rename_class, code size can be reduced.
|
4070 |
|
|
+ */
|
4071 |
|
|
+// #undef TARGET_PREFERRED_RENAME_CLASS
|
4072 |
|
|
+// #define TARGET_PREFERRED_RENAME_CLASS(RCLASS) RCLASS
|
4073 |
|
|
+
|
4074 |
|
|
+/* TARGET_PREFERRED_RELOAD_CLASS(X,RC) ... A target hook that places additional
|
4075 |
|
|
+ * restri tions on the register class to use when it is necessary to copy value
|
4076 |
|
|
+ * X into a register in class RC. The value is a register class; rehaps RC, or
|
4077 |
|
|
+ * perhaps a smaller class.
|
4078 |
|
|
+ *
|
4079 |
|
|
+ * The default fversion of this hook always returns value of RC argument, which
|
4080 |
|
|
+ * sounds quite appropriate for the ZipCPU.
|
4081 |
|
|
+ */
|
4082 |
|
|
+
|
4083 |
|
|
+/* PREFERRED_RELOAD_CLASS(X,CLASS) ... A C expression that places additional
|
4084 |
|
|
+ * restrictions on the register class to use when it is necessary to copy
|
4085 |
|
|
+ * value X into a register in class CLASS. On many machines, the following
|
4086 |
|
|
+ * definition is safe: PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
|
4087 |
|
|
+ * Sometimes returning a more restrictive class makes better code. For example,
|
4088 |
|
|
+ * on the 68k, when x is an integer constant that is in range for a moveq
|
4089 |
|
|
+ * instruction, the value of this macro is always DATA_REGS as long as CLASS
|
4090 |
111 |
dgisselq |
+ * includes the data registers. Requiring a data register guarantees that a
|
4091 |
102 |
dgisselq |
+ * 'moveq' will be used.
|
4092 |
|
|
+ *
|
4093 |
|
|
+ * ZipCPU --- you can't load certain values into all members of ALL_REGS. For
|
4094 |
|
|
+ * example, loading (sleep and !gie) into the CC register could halt the CPU.
|
4095 |
|
|
+ * Hence, we only allow loads into the GENERAL_REG class.
|
4096 |
|
|
+ */
|
4097 |
|
|
+#define PREFERRED_RELOAD_CLASS(X, CLASS) GENERAL_REGS
|
4098 |
|
|
+
|
4099 |
|
|
+/* TARGET_PREFERRED_OUTPUT_RELOAD_CLASS(RTX,RCLASS) ... Like TARGET_PREFERRED_..
|
4100 |
|
|
+ * RELOAD_CLASS, but for output instead of input reloads.
|
4101 |
|
|
+ *
|
4102 |
|
|
+ * ZipCPU --- there's gotta be a valid default behaviour for this.
|
4103 |
|
|
+ */
|
4104 |
|
|
+
|
4105 |
|
|
+/* LIMIT_RELOAD_CLASS(MODE, CL) ...
|
4106 |
|
|
+ *
|
4107 |
|
|
+ * Don't define this macro unless the target machine has limitations which
|
4108 |
|
|
+ * require the macro to do something nontrivial. ZipCPU doesn't, so we won't.
|
4109 |
|
|
+ */
|
4110 |
|
|
+
|
4111 |
|
|
+/* TARGET_SECONDARY_RELOAD
|
4112 |
|
|
+ * SECONDARY_ ...
|
4113 |
|
|
+ * Don't think we need these ...
|
4114 |
|
|
+ */
|
4115 |
|
|
+
|
4116 |
|
|
+/* CLASS_MAX_NREGS(CLASS,MODE) ... A C expression for the maximum number of
|
4117 |
|
|
+ * consecutive registers of class CLASS needed to hold a value of mode MODE.
|
4118 |
|
|
+ *
|
4119 |
|
|
+ * This is closely related to the macro HARD_REGNO_NREGS. In fact, the value
|
4120 |
|
|
+ * of the macro CLASS_MAX_REGS(CL,M) should be the maximum value of
|
4121 |
|
|
+ * HARD_REGNO_NREGS(REGNO,MODE) for all REGNO values in the class CLASS.
|
4122 |
|
|
+ *
|
4123 |
|
|
+ * This macro helps control the handling of multiple word values in the reload
|
4124 |
|
|
+ * pass.
|
4125 |
|
|
+ *
|
4126 |
|
|
+ * ZipCPU --- We'll just use HARDNO_REGNO_NREGS, since CLASS is independent for
|
4127 |
|
|
+ * us. We'll also choose register R0, since ... well, since it simply doesn't
|
4128 |
|
|
+ * matter. (HARD_REGNO_NREGS ignores this anyway)
|
4129 |
|
|
+ */
|
4130 |
|
|
+#define CLASS_MAX_NREGS(CLASS, MODE) HARD_REGNO_NREGS(0,MODE)
|
4131 |
|
|
+
|
4132 |
|
|
+/* CANNOT_CHANGE_MODE_CLASS
|
4133 |
|
|
+ * ???
|
4134 |
|
|
+ */
|
4135 |
|
|
+
|
4136 |
|
|
+/* TARGET_IRA_CHANGE_PSEUDO_ALLOCNO_CLASS
|
4137 |
|
|
+ */
|
4138 |
|
|
+
|
4139 |
|
|
+/* TARRGET_LRA_P
|
4140 |
|
|
+ * Default looks good.
|
4141 |
|
|
+ */
|
4142 |
|
|
+
|
4143 |
|
|
+/* TARGET_REGISTER_PRIORITY(INT) ... A target hook which returns the register
|
4144 |
111 |
dgisselq |
+ * priority number to which the register HARD_REGNO belongs to. The bigger the
|
4145 |
102 |
dgisselq |
+ * number
|
4146 |
|
|
+ *
|
4147 |
|
|
+ * The default version of this target hook returns always zero---good enough for
|
4148 |
|
|
+ * the ZipCPU.
|
4149 |
|
|
+ */
|
4150 |
|
|
+
|
4151 |
|
|
+/* TARGET_REGISTER_USAGE_LEVELING_P(VOID) ... A target hook which returns true
|
4152 |
|
|
+ * if we need register usage leveling. That means if a few hard registers are
|
4153 |
|
|
+ * equally good for the assignment, we choose the least used hard register. The
|
4154 |
|
|
+ * register usage leveling may be profitable for some targets. Don't use usage
|
4155 |
|
|
+ * leveling for targets with conditional execution or targets with big register
|
4156 |
|
|
+ * files as it hurts if-conversion and cross-jumping optimizations. The default
|
4157 |
|
|
+ * version of this target hook returns always false.
|
4158 |
|
|
+ *
|
4159 |
|
|
+ * ZipCPU --- Default is the right answer.
|
4160 |
|
|
+ */
|
4161 |
|
|
+
|
4162 |
|
|
+/* TARGET_DIFFERENT_ADDR_DISPLACEMENT_P ...
|
4163 |
|
|
+ * Default looks good.
|
4164 |
|
|
+ */
|
4165 |
|
|
+
|
4166 |
|
|
+/* TARGET_CANNOT_SUBSTITUTE_MEM_EQUIV_P ...
|
4167 |
|
|
+ * Default looks good.
|
4168 |
|
|
+ */
|
4169 |
|
|
+
|
4170 |
|
|
+/* TARGET_LEGITIMIZE_ADDRESS_DISPLACEMENT ....
|
4171 |
|
|
+ */
|
4172 |
|
|
+
|
4173 |
|
|
+/* TARGET_SPILL_CLASS
|
4174 |
|
|
+ *
|
4175 |
|
|
+ * ZipCPU --- If we were running in supervisor mode only, this might be the
|
4176 |
|
|
+ * user set of registers. However, we're not building for that mode (now),
|
4177 |
|
|
+ * so we'll leave this at the default of NO_REGS.
|
4178 |
|
|
+ */
|
4179 |
|
|
+
|
4180 |
|
|
+/* TARGET_CSTORE_MODE(ICODE) ... Defines the machine mode to use for the
|
4181 |
|
|
+ * boolean result of conditional store patterns. The OCIDE argument is the
|
4182 |
|
|
+ * instruction code for the cstore being performed. Not defining this hook is
|
4183 |
|
|
+ * the same as accepting the mode encoded into operand 0 of the cstore expander
|
4184 |
|
|
+ * patterns.
|
4185 |
|
|
+ *
|
4186 |
|
|
+ * ??? ZipCPU --- I don't follow this documentation. We'll leave this at the
|
4187 |
|
|
+ * default therefore.
|
4188 |
|
|
+ */
|
4189 |
|
|
+
|
4190 |
|
|
+/* 17.09 Stack Layout and Calling Conventions */
|
4191 |
|
|
+
|
4192 |
|
|
+
|
4193 |
|
|
+/* STACK_GROWS_DOWNWARD ... Define this macro if pushing a word onto the stack
|
4194 |
|
|
+ * moves the stack pointer to a smaller address, and false otherwise.
|
4195 |
|
|
+ *
|
4196 |
|
|
+ * ZipCPU ... well, our stack does grow downward, but it doesn't do so auto-
|
4197 |
|
|
+ * magically. We have to move the stack pointer ourselves. However, since this
|
4198 |
|
|
+ * is our convention, we'll define it as such.
|
4199 |
|
|
+ */
|
4200 |
|
|
+#undef STACK_GROWS_DOWNWARD
|
4201 |
|
|
+#define STACK_GROWS_DOWNWARD 1
|
4202 |
|
|
+
|
4203 |
|
|
+/* STACK_PUSH_CODE ... This macro defines the operation used when something is
|
4204 |
|
|
+ * pushed on the stack. In RTL, a push operation will be
|
4205 |
|
|
+ * (set (mem( STACK_PUSH_CODE(reg sp))) ...) The choiecs are PRE_DEC, POST_DEC,
|
4206 |
|
|
+ * PRE_INC, and POST_INC. Which of these is correct depends on the stack
|
4207 |
|
|
+ * direction and on whether the stack pointer points to the last item on the
|
4208 |
|
|
+ * stack or whether it points to the space for the next item on the stack.
|
4209 |
|
|
+ * The default is PRE_DECC when STACK_GROWS_DOWNWARD is true, which is almost
|
4210 |
|
|
+ * always right, and PRE_INC otherwise, which is often wrong.
|
4211 |
|
|
+ *
|
4212 |
|
|
+ * ZipCPU --- None of these is right, so let's leave this at the default and
|
4213 |
|
|
+ * see how badly we get mangled. In particular, ZipCPU doesn't have any of the
|
4214 |
|
|
+ * PRE_DEC, POST_DEC, PRE_INC, or POST_INC addressing modes used here.
|
4215 |
|
|
+ */
|
4216 |
|
|
+
|
4217 |
|
|
+/* FRAME_GROWS_DOWNWARD ... Define this macro to nonzero if the addresses of
|
4218 |
|
|
+ * local variable slots are at negative offsets from the frame pointer.
|
4219 |
|
|
+ *
|
4220 |
|
|
+ * ZipCPU --- If the frame pointer is defined as the stack pointer upon the
|
4221 |
103 |
dgisselq |
+ * start of function execution, and that stack pointer grows downward, then
|
4222 |
102 |
dgisselq |
+ * this should be the case as well.
|
4223 |
|
|
+ */
|
4224 |
|
|
+#undef FRAME_GROWS_DOWNWARD
|
4225 |
|
|
+#define FRAME_GROWS_DOWNWARD 1
|
4226 |
|
|
+// #define FRAME_GROWS_DOWNWARD 0 // This was ECO32's value
|
4227 |
|
|
+
|
4228 |
|
|
+
|
4229 |
|
|
+/* ARGS_GROW_DOWNWARD ... Define this macro if successive arguments to a
|
4230 |
|
|
+ * function occupy decreasing addresses on the stack.
|
4231 |
|
|
+ *
|
4232 |
|
|
+ * ZipCPU -- we can leave this up to the compiler's preferred implementation,
|
4233 |
|
|
+ * it is of no consequence to the hardware.
|
4234 |
|
|
+ */
|
4235 |
|
|
+
|
4236 |
|
|
+/* STARTING_FRAME_OFFSET ... Offset from the frame pointer to the first local
|
4237 |
|
|
+ * variable slot to be allocated. If FRAME_GROWS_DOWNWARD, find the next slot's
|
4238 |
|
|
+ * offset by subtracting the firstt slot's length from STARTING_FRAME_OFFSET.
|
4239 |
|
|
+ * Otherwise it is found by adding the length of the first slot to the value
|
4240 |
|
|
+ * START_FRAME_OFFSET.
|
4241 |
|
|
+ *
|
4242 |
|
|
+ * ZipCPU --- I'm not certain on this, let's come back after we look at how
|
4243 |
|
|
+ * the code is getting generated. However, the ECO32 code I am copying from
|
4244 |
|
|
+ * suggests that 0 is the right value, so we'll use that here.
|
4245 |
|
|
+ */
|
4246 |
|
|
+// #warning "Re-evaluate me"
|
4247 |
|
|
+#define STARTING_FRAME_OFFSET 0
|
4248 |
|
|
+
|
4249 |
|
|
+/* STACK_ALIGNMENT_NEEDED ... Define to zero to disable final alignment of the
|
4250 |
|
|
+ * stack during reload. The nonzero default for this macro is suitable for most
|
4251 |
|
|
+ * ports.
|
4252 |
|
|
+ *
|
4253 |
|
|
+ * ZipCPU --- we'll leave this at the default, although if any alignment code
|
4254 |
|
|
+ * shows up on the stack we may need to adjust it.
|
4255 |
|
|
+ */
|
4256 |
|
|
+
|
4257 |
|
|
+/* STACK_POINTER_OFFSET ... Offset from the SP register to the first location at
|
4258 |
|
|
+ * which outgoing arguments are placed. If not specified, the default value
|
4259 |
|
|
+ * of zero is used. This is the proper value for most machines.
|
4260 |
|
|
+ */
|
4261 |
|
|
+#define STACK_POINTER_OFFSET 0
|
4262 |
|
|
+
|
4263 |
|
|
+/* FIRST_PARM_OFFSET ... Offset from the argument pointer register to the first
|
4264 |
|
|
+ * argument's address. On some machines it may depend on the data type of the
|
4265 |
|
|
+ * function.
|
4266 |
|
|
+ */
|
4267 |
|
|
+#define FIRST_PARM_OFFSET(F) 0
|
4268 |
|
|
+
|
4269 |
|
|
+/* STACK_DYNAMIC_OFFSET(F) ... Offset from the stack pointer register to an item
|
4270 |
|
|
+ * dynamically allocated on the stack, e.g., by alloca. The default value for
|
4271 |
|
|
+ * this macro is STACK_POINTER_OFFSET plus the length of the outgoing arguments.
|
4272 |
|
|
+ * The default is correct for most machines, ...
|
4273 |
|
|
+ *
|
4274 |
|
|
+ * ZipCPU --- so we'll use it for the ZipCPU.
|
4275 |
|
|
+ */
|
4276 |
|
|
+
|
4277 |
|
|
+/* INITIAL_FRAME_ADDRESS_RTX ... A C expression whose value is RTL representing
|
4278 |
|
|
+ * the address of the initial stack frame. This address is passed to
|
4279 |
|
|
+ * RETURN_ADDR_RTX and DYNAMIC_CHAIN_ADDRESS. If you don't define this macro,
|
4280 |
|
|
+ * a reasonable default value will be used. Define this macro in order to make
|
4281 |
|
|
+ * frame pointer elimination work in the presence of __builtin_frame_address(C)
|
4282 |
|
|
+ * and __builtin_return_address(C) for (C) not equal to zero.
|
4283 |
|
|
+ *
|
4284 |
|
|
+ * ZipCPU --- Let's try the reasonable default and see what happens.
|
4285 |
|
|
+ */
|
4286 |
|
|
+
|
4287 |
|
|
+/* SETUP_FRAME_ADDRESSES ... A C expression that produces the machine-specific
|
4288 |
|
|
+ * code to setup the stack so that arbitrary frames can be accessed. For
|
4289 |
|
|
+ * example, on the SPARC, we must flush all of the register windows to the stack
|
4290 |
|
|
+ * before we can access arbitrary stack frames. You will seldom need to define
|
4291 |
|
|
+ * this macro. The default is to do nothing.
|
4292 |
|
|
+ *
|
4293 |
|
|
+ * ZipCPU --- which is what we shall do here.
|
4294 |
|
|
+ */
|
4295 |
|
|
+
|
4296 |
|
|
+/* TARGET_BUILTIN_SETJMP_FRAME_VALUE(VOID) ... This target hook should return
|
4297 |
|
|
+ * an RTX that is used to store the address of the current frame into the
|
4298 |
|
|
+ * builtin setjmp buffer. The default value, virtual_stack_vars_rtx, is correct
|
4299 |
|
|
+ * for most machines. One reason you may need to define this target hook is if
|
4300 |
|
|
+ * hard_frame_pointer_rtx is the appropriate value on your machine.
|
4301 |
|
|
+ *
|
4302 |
|
|
+ * ZipCPU --- leave this undefined, since the default value should be correct
|
4303 |
|
|
+ * for "most" machines.
|
4304 |
|
|
+ */
|
4305 |
|
|
+
|
4306 |
|
|
+/* FRAME_ADDR_RTX ... most machines do not need to define it.
|
4307 |
|
|
+ */
|
4308 |
|
|
+
|
4309 |
|
|
+/* RETURN_ADDR_RTX(COUNT,FRAMEADDR) ... A C expression whose value is RTL
|
4310 |
|
|
+ * representing the value of the return address for the frame COUNT steps up
|
4311 |
|
|
+ * from the current frame, after the prologue. FRAMEADDR is the frame pointer
|
4312 |
|
|
+ * of the COUNT frame, or the frame pointer of the COUNT-1 frame if
|
4313 |
|
|
+ * RETURN_ADDR_IN_PREVIOUS_FRAME is nonzero. The value of the expression must
|
4314 |
|
|
+ * always be the correct address when COUNT is nonzero, but may be NULL_RTX if
|
4315 |
|
|
+ * there is no way to determine the return address of other frames.
|
4316 |
|
|
+ *
|
4317 |
|
|
+ * ZipCPU --- I have no idea how we'd do this, so let's just return NULL_RTX.
|
4318 |
|
|
+ */
|
4319 |
|
|
+#undef RETURN_ADDR_RTX
|
4320 |
|
|
+#define RETURN_ADDR_RTX(COUNT,FRAMEADDR) NULL_RTX
|
4321 |
|
|
+
|
4322 |
|
|
+/* RETURN_ADDR_IN_PREVIOUS_FRAME ... Define this macro to nonzero value if the
|
4323 |
|
|
+ * return address of a particular stack frame is accessed from the frame pointer
|
4324 |
|
|
+ * of the previous stack frame. The zero default for this macro is suitable
|
4325 |
|
|
+ * for most ports.
|
4326 |
|
|
+ *
|
4327 |
|
|
+ * ZipCPU---Default works here as well.
|
4328 |
|
|
+ */
|
4329 |
|
|
+
|
4330 |
|
|
+/* INCOMING_RETURN_ADDR_RTX ... A C expression whose value is RTL representing
|
4331 |
|
|
+ * the location of the incoming return address at the beginning of any function,
|
4332 |
|
|
+ * before the prologue. This RTL is either a REG, indicating that the return
|
4333 |
|
|
+ * value is saved in 'REG', or a MEM representing the location in the stack.
|
4334 |
|
|
+ * If this RTL is a REG, you should define DWARF_RETURN_COLUMN to
|
4335 |
|
|
+ * DWARF_FRAME_REGNUM(REGNO).
|
4336 |
|
|
+ *
|
4337 |
|
|
+ * ZipCPU --- While our incoming return address could theoretically be in any
|
4338 |
|
|
+ * register, our machine description file is going to place it into register
|
4339 |
|
|
+ * R0, so that's what we return here.
|
4340 |
|
|
+ */
|
4341 |
|
|
+#undef INCOMING_RETURN_ADDR_RTX
|
4342 |
|
|
+#define INCOMING_RETURN_ADDR_RTX gen_rtx_REG(SImode, zip_R0)
|
4343 |
|
|
+
|
4344 |
|
|
+
|
4345 |
|
|
+/* DWARF_ALT_FRAME_RETURN_COLUMN
|
4346 |
|
|
+ */
|
4347 |
|
|
+
|
4348 |
|
|
+/* DWARF_ZERO_REG ... A C exrpession whose value is an integer giving a DWARF2
|
4349 |
|
|
+ * register number that is considered to always have the value zero. This
|
4350 |
|
|
+ * should only be defined if the target has an architected zero register (ZipCPU
|
4351 |
|
|
+ * does not), and someone decided it was a good idea to use that register number
|
4352 |
|
|
+ * to terminate the stack backtrace. New ports should avoid this (so the
|
4353 |
|
|
+ * ZipCPU port will avoid it as well).
|
4354 |
|
|
+ *
|
4355 |
|
|
+ */
|
4356 |
|
|
+
|
4357 |
|
|
+/* TARGET_DWARF_HANDLE_FRAME_UNSPEC
|
4358 |
|
|
+ */
|
4359 |
|
|
+
|
4360 |
|
|
+/* INCOMING_FRAME_SP_OFFSET
|
4361 |
|
|
+ */
|
4362 |
|
|
+#define INCOMING_FRAME_SP_OFFSET 0
|
4363 |
|
|
+
|
4364 |
|
|
+/* ARG_POINTER_CFA_OFFSET
|
4365 |
|
|
+ */
|
4366 |
|
|
+
|
4367 |
|
|
+/* FRAME_POINTER_CFA_OFFSET
|
4368 |
|
|
+ */
|
4369 |
|
|
+
|
4370 |
|
|
+/* CFA_FRAME_BASE_OFFSET
|
4371 |
|
|
+ */
|
4372 |
|
|
+
|
4373 |
|
|
+/* 17.09.02 Exception handling support */
|
4374 |
|
|
+
|
4375 |
|
|
+/* EH_RETURN_DATA_REGNO(N) ... A C expression whose value is the Nth register
|
4376 |
|
|
+ * number used for data by exception handlers, or INVALID_REGNUM if fewer than
|
4377 |
|
|
+ * N registers are usable. The exception handling library routines communicate
|
4378 |
|
|
+ * with the exception handlers via a set of agreed upon registers. Ideally
|
4379 |
|
|
+ * these registers should be call clobbered; it is possible to use call-saved
|
4380 |
|
|
+ * registers, but may negatively impact code size. The target must support at
|
4381 |
|
|
+ * least 2 data registers, but should define 4 if their are enough free
|
4382 |
|
|
+ * registers.
|
4383 |
|
|
+ *
|
4384 |
|
|
+ * You must define this macro if you want to support call frame exception
|
4385 |
|
|
+ * handling like that provided by DWARF 2.
|
4386 |
|
|
+ */
|
4387 |
|
|
+#define EH_RETURN_DATA_REGNO(N) (((N<ZIP_FIRST_ARG_REGNO)||(N>ZIP_LAST_ARG_REGNO))?(N-1):INVALID_REGNUM)
|
4388 |
|
|
+
|
4389 |
|
|
+/* EH_RETURN_STACKADJ_RTX ... A C expression whose value is RTL representing
|
4390 |
|
|
+ * a location in which to store a stack adjustment to be applied before function
|
4391 |
|
|
+ * return. This is used to unwind the stack to an exception handler's call
|
4392 |
|
|
+ * frame. It will be assigned zero on code paths that return normally.
|
4393 |
|
|
+ *
|
4394 |
|
|
+ * Do not define this macro if the stack pointer is saved and restored by the
|
4395 |
|
|
+ * regular prolog and epilog code in the call frame itself (which it is for the
|
4396 |
|
|
+ * ZipCPU); in this case, the exception handling library routines will update
|
4397 |
|
|
+ * the stack location to be restored in place. Otherwise, you must define this
|
4398 |
|
|
+ * macro if you want to support call frame exception handling like that provided
|
4399 |
|
|
+ * by DWARF 2.
|
4400 |
|
|
+ *
|
4401 |
|
|
+ */
|
4402 |
|
|
+
|
4403 |
|
|
+/* EH_RETURN_HANDLER_RTX ... A C expression whose value is RTL representing a
|
4404 |
|
|
+ * location in which to store the address of an exception handler to which we
|
4405 |
|
|
+ * should return. It will not be assigned on code paths that return normally.
|
4406 |
|
|
+ *
|
4407 |
|
|
+ * Typcally this is the location in the call frame at which the normal return
|
4408 |
|
|
+ * address is stored. For targets that return by popping an address of the
|
4409 |
|
|
+ * stack, this might be a memory address just below the target callf rame
|
4410 |
|
|
+ * rather than inside the current call frame. If defined,
|
4411 |
|
|
+ * EH_RETURN_STACKADJ_RTX will have already been assigned, so it may be used
|
4412 |
|
|
+ * to calculate the location of the target call frame.
|
4413 |
|
|
+ *
|
4414 |
|
|
+ * If you want to support call frame exception handling, you must define either
|
4415 |
|
|
+ * this macro or the eh_return instruction pattern.
|
4416 |
|
|
+ */
|
4417 |
|
|
+// #warning "I don't know what to do here."
|
4418 |
|
|
+
|
4419 |
|
|
+/*
|
4420 |
|
|
+ *
|
4421 |
|
|
+ *
|
4422 |
|
|
+ *
|
4423 |
|
|
+ * REST OF SECTION SKIPPED ...
|
4424 |
|
|
+ *
|
4425 |
|
|
+ *
|
4426 |
|
|
+ *
|
4427 |
|
|
+ */
|
4428 |
|
|
+
|
4429 |
|
|
+/* 17.09.03 Specifying how stack checking is done */
|
4430 |
|
|
+
|
4431 |
|
|
+/* STACK_CHECK_BUILTIN ... a non-zero value if stack checking is done by the
|
4432 |
|
|
+ * configuration files in a machine-dependent manner. You should define this
|
4433 |
|
|
+ * macro if stack checking is required by the ABI of your machine or if you
|
4434 |
|
|
+ * would like to do stack checking in some more efficient way than the generic
|
4435 |
|
|
+ * appraoch. The default value of this macro is zero.
|
4436 |
|
|
+ *
|
4437 |
|
|
+ * ZipCPU --- The default makes sense for us.
|
4438 |
|
|
+ */
|
4439 |
|
|
+// #define STACK_CHECK_BUILTIN 0
|
4440 |
|
|
+
|
4441 |
|
|
+/* STACK_CHECK_STATIC_BUILTIN ... A nonzero value if static stack checking is
|
4442 |
|
|
+ * done by the configuration files in a machine-dependent manner. You should
|
4443 |
|
|
+ * define this macro if you would like to do static stack checking in some more
|
4444 |
|
|
+ * efficient way than the generic approach. The default value of this macro
|
4445 |
|
|
+ * is zero.
|
4446 |
|
|
+ *
|
4447 |
|
|
+ * ZipCPU --- The default makes sense for us.
|
4448 |
|
|
+ */
|
4449 |
|
|
+
|
4450 |
|
|
+/* STACK_CHECK_PROBE_INTERVAL_EXP ... An integer specifying the interval at
|
4451 |
|
|
+ * which GCC must generate stack probe instructions, defined as 2 raised to this
|
4452 |
|
|
+ * interval. You will normally define this macro so that the interval is no
|
4453 |
|
|
+ * larger than the size of the "guard pages" at the end of a stack area. The
|
4454 |
|
|
+ * default value of 12 (4096-byte interval) is suitable for most systems.
|
4455 |
|
|
+ *
|
4456 |
|
|
+ * ZipCPU --- Default.
|
4457 |
|
|
+ */
|
4458 |
|
|
+
|
4459 |
|
|
+/* STACK_CHECK_MOVING_SP ... An integer which is non-zero if GCC should move
|
4460 |
|
|
+ * the stack pointer page by page when doing probes. This can be necessary
|
4461 |
|
|
+ * on systems where the stack pointer contains the bottom address of the memory
|
4462 |
|
|
+ * area accessible to the executing thread at any point in time. In this
|
4463 |
|
|
+ * situation, an alternate signal stack is required in order to be able to
|
4464 |
|
|
+ * recover from a stack overflow. The default value of this macro is zero.
|
4465 |
|
|
+ *
|
4466 |
|
|
+ * ZipCPU -- Default.
|
4467 |
|
|
+ */
|
4468 |
|
|
+
|
4469 |
|
|
+/* STACK_CHECK_PROTECT
|
4470 |
|
|
+ */
|
4471 |
|
|
+/* STACK_CHECK_MAX_FRAME_SIZE
|
4472 |
|
|
+ * ... you should normally not change the default value of this macro.
|
4473 |
|
|
+ */
|
4474 |
|
|
+/* STACK_CHECK_FIXED_FRAME_SIZE
|
4475 |
|
|
+ * ... you ... will normally use the default of four words.
|
4476 |
|
|
+ */
|
4477 |
|
|
+
|
4478 |
|
|
+/* STACK_CHECK_MAX_VAR_SIZE
|
4479 |
|
|
+ * ... you will normally not need to override that default.
|
4480 |
|
|
+ */
|
4481 |
|
|
+
|
4482 |
|
|
+/* 17.09.04 Registers that Address the Stack Frame*/
|
4483 |
|
|
+
|
4484 |
|
|
+/* STACK_POINTER_REGNUM ... The register number of the stack pointer register,
|
4485 |
|
|
+ * which must also be a fixed register according to FIXED_REGISTERS. On most
|
4486 |
|
|
+ * machines, the hardware determines which register this is.
|
4487 |
|
|
+ */
|
4488 |
|
|
+#undef STACK_POINTER_REGNUM
|
4489 |
|
|
+#define STACK_POINTER_REGNUM zip_SP
|
4490 |
|
|
+
|
4491 |
|
|
+/* FRAME_POINTER_REGNUM ... The register number of the frame pointer register,
|
4492 |
|
|
+ * which is used to access certain automatic variables in the stack frame. On
|
4493 |
|
|
+ * some machines, the hardware determines which register this is. On other
|
4494 |
|
|
+ * machines you can choose any register you wish for this purpose.
|
4495 |
|
|
+ *
|
4496 |
|
|
+ * ZipCPU --- While I'd like to dump this pointer, since I don't really see
|
4497 |
|
|
+ * a need for it, alloca() requires it. Therefore let's assine a register to
|
4498 |
|
|
+ * this purpose and watch what the compiler does with it.
|
4499 |
|
|
+ */
|
4500 |
103 |
dgisselq |
+#ifdef zip_FP_PSEUDO
|
4501 |
|
|
+#define FRAME_POINTER_REGNUM zip_FP_PSEUDO
|
4502 |
|
|
+#else
|
4503 |
102 |
dgisselq |
+#define FRAME_POINTER_REGNUM zip_FP
|
4504 |
103 |
dgisselq |
+#endif
|
4505 |
102 |
dgisselq |
+
|
4506 |
|
|
+/* HARD_FRAME_POINTER_REGNUM ... On some machines the offset between the frame
|
4507 |
|
|
+ * pointer and starting offset of the automatic variables is not known until
|
4508 |
|
|
+ * after register allocation has been done (for example, because the saved
|
4509 |
|
|
+ * registers are between these two locations). On those machines, define
|
4510 |
|
|
+ * FRAME_POINTER_REGNUM the number of a special, fixed register to be used
|
4511 |
|
|
+ * internally until the offset is known, and define HARD_FRAME_POINTER_REGNUM
|
4512 |
|
|
+ * to be the actual hard register number used for the frame pointer.
|
4513 |
|
|
+ *
|
4514 |
|
|
+ * Do not define this macro if it would be the same as FRAME_POINTER_REGNUM
|
4515 |
|
|
+ *
|
4516 |
|
|
+ * ZipCPU --- we do not define this macro.
|
4517 |
|
|
+ */
|
4518 |
103 |
dgisselq |
+#if (zip_FP == FRAME_POINTER_REGNUM)
|