f1333dbd55f80b6d3cf6c9236fd16d714b72d4e4
[deliverable/binutils-gdb.git] / bfd / cpu-i960.c
1 /* BFD library support routines for the i960 architecture.
2 Copyright (C) 1990-2018 Free Software Foundation, Inc.
3 Hacked by Steve Chamberlain of Cygnus Support.
4
5 This file is part of BFD, the Binary File Descriptor library.
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
20 MA 02110-1301, USA. */
21
22 #include "sysdep.h"
23 #include "bfd.h"
24 #include "libbfd.h"
25
26 /* This routine is provided a string, and tries to work out if it
27 could possibly refer to the i960 machine pointed at in the
28 info_struct pointer */
29
30 static bfd_boolean
31 scan_960_mach (const bfd_arch_info_type *ap,
32 const char *string)
33 {
34 unsigned long machine;
35 int fail_because_not_80960 = FALSE;
36
37 /* Look for the string i960 at the front of the string. */
38 if (strncasecmp ("i960", string, 4) == 0)
39 {
40 string += 4;
41
42 /* i960 on it's own means core to us. */
43 if (* string == 0)
44 return ap->mach == bfd_mach_i960_core;
45
46 /* "i960:*" is valid, anything else is not. */
47 if (* string != ':')
48 return FALSE;
49
50 string ++;
51 }
52 /* In some bfds the cpu-id is written as "80960KA", "80960KB",
53 "80960CA" or "80960MC". */
54 else if (CONST_STRNEQ (string, "80960"))
55 {
56 string += 5;
57
58 /* Set this to TRUE here. If a correct matching postfix
59 is detected below it will be reset to FALSE. */
60 fail_because_not_80960 = TRUE;
61 }
62 /* No match, can't be us. */
63 else
64 return FALSE;
65
66 if (* string == '\0')
67 return FALSE;
68
69 if (string[0] == 'c' && string[1] == 'o' && string[2] == 'r' &&
70 string[3] == 'e' && string[4] == '\0')
71 machine = bfd_mach_i960_core;
72 else if (strcasecmp (string, "ka_sa") == 0)
73 machine = bfd_mach_i960_ka_sa;
74 else if (strcasecmp (string, "kb_sb") == 0)
75 machine = bfd_mach_i960_kb_sb;
76 else if (string[1] == '\0' || string[2] != '\0') /* rest are 2-char. */
77 return FALSE;
78 else if (string[0] == 'k' && string[1] == 'b')
79 { machine = bfd_mach_i960_kb_sb; fail_because_not_80960 = FALSE; }
80 else if (string[0] == 's' && string[1] == 'b')
81 machine = bfd_mach_i960_kb_sb;
82 else if (string[0] == 'm' && string[1] == 'c')
83 { machine = bfd_mach_i960_mc; fail_because_not_80960 = FALSE; }
84 else if (string[0] == 'x' && string[1] == 'a')
85 machine = bfd_mach_i960_xa;
86 else if (string[0] == 'c' && string[1] == 'a')
87 { machine = bfd_mach_i960_ca; fail_because_not_80960 = FALSE; }
88 else if (string[0] == 'k' && string[1] == 'a')
89 { machine = bfd_mach_i960_ka_sa; fail_because_not_80960 = FALSE; }
90 else if (string[0] == 's' && string[1] == 'a')
91 machine = bfd_mach_i960_ka_sa;
92 else if (string[0] == 'j' && string[1] == 'x')
93 machine = bfd_mach_i960_jx;
94 else if (string[0] == 'h' && string[1] == 'x')
95 machine = bfd_mach_i960_hx;
96 else
97 return FALSE;
98
99 if (fail_because_not_80960)
100 return FALSE;
101
102 if (machine == ap->mach)
103 return TRUE;
104
105 return FALSE;
106 }
107
108 /* This routine is provided two arch_infos and works out the i960
109 machine which would be compatible with both and returns a pointer
110 to its info structure */
111
112 static const bfd_arch_info_type *
113 compatible (const bfd_arch_info_type *a,
114 const bfd_arch_info_type *b)
115 {
116
117 /* The i960 has distinct subspecies which may not interbreed:
118 CORE CA
119 CORE KA KB MC XA
120 CORE HX JX
121 Any architecture on the same line is compatible, the one on
122 the right is the least restrictive.
123
124 We represent this information in an array, each machine to a side */
125
126 #define ERROR 0
127 #define CORE bfd_mach_i960_core /*1*/
128 #define KA bfd_mach_i960_ka_sa /*2*/
129 #define KB bfd_mach_i960_kb_sb /*3*/
130 #define MC bfd_mach_i960_mc /*4*/
131 #define XA bfd_mach_i960_xa /*5*/
132 #define CA bfd_mach_i960_ca /*6*/
133 #define JX bfd_mach_i960_jx /*7*/
134 #define HX bfd_mach_i960_hx /*8*/
135 #define MAX_ARCH ((int)HX)
136
137 static const unsigned long matrix[MAX_ARCH+1][MAX_ARCH+1] =
138 {
139 { ERROR, CORE, KA, KB, MC, XA, CA, JX, HX },
140 { CORE, CORE, KA, KB, MC, XA, CA, JX, HX },
141 { KA, KA, KA, KB, MC, XA, ERROR, ERROR, ERROR},
142 { KB, KB, KB, KB, MC, XA, ERROR, ERROR, ERROR},
143 { MC, MC, MC, MC, MC, XA, ERROR, ERROR, ERROR},
144 { XA, XA, XA, XA, XA, XA, ERROR, ERROR, ERROR},
145 { CA, CA, ERROR, ERROR, ERROR, ERROR, CA, ERROR, ERROR},
146 { JX, JX, ERROR, ERROR, ERROR, ERROR, ERROR, JX, HX },
147 { HX, HX, ERROR, ERROR, ERROR, ERROR, ERROR, HX, HX },
148 };
149
150 if (a->arch != b->arch || matrix[a->mach][b->mach] == ERROR)
151 return NULL;
152
153 return (a->mach == matrix[a->mach][b->mach]) ? a : b;
154 }
155
156 #define N(a,b,d,n) \
157 { 32, 32, 8,bfd_arch_i960,a,"i960",b,3,d,compatible,scan_960_mach, \
158 bfd_arch_default_fill, n,}
159
160 static const bfd_arch_info_type arch_info_struct[] =
161 {
162 N(bfd_mach_i960_ka_sa,"i960:ka_sa",FALSE, &arch_info_struct[1]),
163 N(bfd_mach_i960_kb_sb,"i960:kb_sb",FALSE, &arch_info_struct[2]),
164 N(bfd_mach_i960_mc, "i960:mc", FALSE, &arch_info_struct[3]),
165 N(bfd_mach_i960_xa, "i960:xa", FALSE, &arch_info_struct[4]),
166 N(bfd_mach_i960_ca, "i960:ca", FALSE, &arch_info_struct[5]),
167 N(bfd_mach_i960_jx, "i960:jx", FALSE, &arch_info_struct[6]),
168 N(bfd_mach_i960_hx, "i960:hx", FALSE, 0),
169 };
170
171 const bfd_arch_info_type bfd_i960_arch =
172 N(bfd_mach_i960_core, "i960:core", TRUE, &arch_info_struct[0]);
This page took 0.034653 seconds and 3 git commands to generate.