1 /* Semantics ops support for CGEN-based simulators.
2 Copyright (C) 1996-2014 Free Software Foundation, Inc.
3 Contributed by Cygnus Solutions.
5 This file is part of the GNU Simulators.
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.
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.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
22 #ifndef CGEN_SEM_OPS_H
23 #define CGEN_SEM_OPS_H
27 #if defined (__GNUC__) && ! defined (SEMOPS_DEFINE_INLINE)
28 #define SEMOPS_DEFINE_INLINE
29 #define SEMOPS_INLINE extern inline
34 /* Semantic operations.
35 At one point this file was machine generated. Maybe it will be again. */
37 /* TODO: Lazy encoding/decoding of fp values. */
39 /* These don't really have a mode. */
40 #define ANDIF(x, y) ((x) && (y))
41 #define ORIF(x, y) ((x) || (y))
43 #define SUBBI(x, y) ((x) - (y))
44 #define ANDBI(x, y) ((x) & (y))
45 #define ORBI(x, y) ((x) | (y))
46 #define XORBI(x, y) ((x) ^ (y))
47 #define NEGBI(x) (- (x))
48 #define NOTBI(x) (! (BI) (x))
49 #define INVBI(x) (~ (x))
50 #define EQBI(x, y) ((BI) (x) == (BI) (y))
51 #define NEBI(x, y) ((BI) (x) != (BI) (y))
52 #define LTBI(x, y) ((BI) (x) < (BI) (y))
53 #define LEBI(x, y) ((BI) (x) <= (BI) (y))
54 #define GTBI(x, y) ((BI) (x) > (BI) (y))
55 #define GEBI(x, y) ((BI) (x) >= (BI) (y))
56 #define LTUBI(x, y) ((BI) (x) < (BI) (y))
57 #define LEUBI(x, y) ((BI) (x) <= (BI) (y))
58 #define GTUBI(x, y) ((BI) (x) > (BI) (y))
59 #define GEUBI(x, y) ((BI) (x) >= (BI) (y))
61 #define ADDQI(x, y) ((QI) ((UQI) (x) + (UQI) (y)))
62 #define SUBQI(x, y) ((QI) ((UQI) (x) - (UQI) (y)))
63 #define MULQI(x, y) ((QI) ((UQI) (x) * (UQI) (y)))
64 #define DIVQI(x, y) ((QI) (x) / (QI) (y))
65 #define UDIVQI(x, y) ((UQI) (x) / (UQI) (y))
66 #define MODQI(x, y) ((QI) (x) % (QI) (y))
67 #define UMODQI(x, y) ((UQI) (x) % (UQI) (y))
68 #define SRAQI(x, y) ((QI) (x) >> (y))
69 #define SRLQI(x, y) ((UQI) (x) >> (y))
70 #define SLLQI(x, y) ((UQI) (x) << (y))
71 extern QI
RORQI (QI
, int);
72 extern QI
ROLQI (QI
, int);
73 #define ANDQI(x, y) ((x) & (y))
74 #define ORQI(x, y) ((x) | (y))
75 #define XORQI(x, y) ((x) ^ (y))
76 #define NEGQI(x) ((QI) (- (UQI) (x)))
77 #define NOTQI(x) (! (QI) (x))
78 #define INVQI(x) (~ (x))
79 #define ABSQI(x) ((QI) ((QI) (x) < 0 ? -(UQI) (x) : (UQI) (x)))
80 #define EQQI(x, y) ((QI) (x) == (QI) (y))
81 #define NEQI(x, y) ((QI) (x) != (QI) (y))
82 #define LTQI(x, y) ((QI) (x) < (QI) (y))
83 #define LEQI(x, y) ((QI) (x) <= (QI) (y))
84 #define GTQI(x, y) ((QI) (x) > (QI) (y))
85 #define GEQI(x, y) ((QI) (x) >= (QI) (y))
86 #define LTUQI(x, y) ((UQI) (x) < (UQI) (y))
87 #define LEUQI(x, y) ((UQI) (x) <= (UQI) (y))
88 #define GTUQI(x, y) ((UQI) (x) > (UQI) (y))
89 #define GEUQI(x, y) ((UQI) (x) >= (UQI) (y))
91 #define ADDHI(x, y) ((HI) ((UHI) (x) + (UHI) (y)))
92 #define SUBHI(x, y) ((HI) ((UHI) (x) - (UHI) (y)))
93 #define MULHI(x, y) ((HI) ((UHI) (x) * (UHI) (y)))
94 #define DIVHI(x, y) ((HI) (x) / (HI) (y))
95 #define UDIVHI(x, y) ((UHI) (x) / (UHI) (y))
96 #define MODHI(x, y) ((HI) (x) % (HI) (y))
97 #define UMODHI(x, y) ((UHI) (x) % (UHI) (y))
98 #define SRAHI(x, y) ((HI) (x) >> (y))
99 #define SRLHI(x, y) ((UHI) (x) >> (y))
100 #define SLLHI(x, y) ((UHI) (x) << (y))
101 extern HI
RORHI (HI
, int);
102 extern HI
ROLHI (HI
, int);
103 #define ANDHI(x, y) ((x) & (y))
104 #define ORHI(x, y) ((x) | (y))
105 #define XORHI(x, y) ((x) ^ (y))
106 #define NEGHI(x) ((HI) (- (UHI) (x)))
107 #define NOTHI(x) (! (HI) (x))
108 #define INVHI(x) (~ (x))
109 #define ABSHI(x) ((HI) ((HI) (x) < 0 ? -(UHI) (x) : (UHI) (x)))
110 #define EQHI(x, y) ((HI) (x) == (HI) (y))
111 #define NEHI(x, y) ((HI) (x) != (HI) (y))
112 #define LTHI(x, y) ((HI) (x) < (HI) (y))
113 #define LEHI(x, y) ((HI) (x) <= (HI) (y))
114 #define GTHI(x, y) ((HI) (x) > (HI) (y))
115 #define GEHI(x, y) ((HI) (x) >= (HI) (y))
116 #define LTUHI(x, y) ((UHI) (x) < (UHI) (y))
117 #define LEUHI(x, y) ((UHI) (x) <= (UHI) (y))
118 #define GTUHI(x, y) ((UHI) (x) > (UHI) (y))
119 #define GEUHI(x, y) ((UHI) (x) >= (UHI) (y))
121 #define ADDSI(x, y) ((SI) ((USI) (x) + (USI) (y)))
122 #define SUBSI(x, y) ((SI) ((USI) (x) - (USI) (y)))
123 #define MULSI(x, y) ((SI) ((USI) (x) * (USI) (y)))
124 #define DIVSI(x, y) ((SI) (x) / (SI) (y))
125 #define UDIVSI(x, y) ((USI) (x) / (USI) (y))
126 #define MODSI(x, y) ((SI) (x) % (SI) (y))
127 #define UMODSI(x, y) ((USI) (x) % (USI) (y))
128 #define SRASI(x, y) ((SI) (x) >> (y))
129 #define SRLSI(x, y) ((USI) (x) >> (y))
130 #define SLLSI(x, y) ((USI) (x) << (y))
131 extern SI
RORSI (SI
, int);
132 extern SI
ROLSI (SI
, int);
133 #define ANDSI(x, y) ((x) & (y))
134 #define ORSI(x, y) ((x) | (y))
135 #define XORSI(x, y) ((x) ^ (y))
136 #define NEGSI(x) ((SI) (- (USI) (x)))
137 #define NOTSI(x) (! (SI) (x))
138 #define INVSI(x) (~ (x))
139 #define ABSSI(x) ((SI) ((SI) (x) < 0 ? -(USI) (x) : (USI) (x)))
140 #define EQSI(x, y) ((SI) (x) == (SI) (y))
141 #define NESI(x, y) ((SI) (x) != (SI) (y))
142 #define LTSI(x, y) ((SI) (x) < (SI) (y))
143 #define LESI(x, y) ((SI) (x) <= (SI) (y))
144 #define GTSI(x, y) ((SI) (x) > (SI) (y))
145 #define GESI(x, y) ((SI) (x) >= (SI) (y))
146 #define LTUSI(x, y) ((USI) (x) < (USI) (y))
147 #define LEUSI(x, y) ((USI) (x) <= (USI) (y))
148 #define GTUSI(x, y) ((USI) (x) > (USI) (y))
149 #define GEUSI(x, y) ((USI) (x) >= (USI) (y))
152 extern DI
ADDDI (DI
, DI
);
153 extern DI
SUBDI (DI
, DI
);
154 extern DI
MULDI (DI
, DI
);
155 extern DI
DIVDI (DI
, DI
);
156 extern DI
UDIVDI (DI
, DI
);
157 extern DI
MODDI (DI
, DI
);
158 extern DI
UMODDI (DI
, DI
);
159 extern DI
SRADI (DI
, int);
160 extern UDI
SRLDI (UDI
, int);
161 extern UDI
SLLDI (UDI
, int);
162 extern DI
RORDI (DI
, int);
163 extern DI
ROLDI (DI
, int);
164 extern DI
ANDDI (DI
, DI
);
165 extern DI
ORDI (DI
, DI
);
166 extern DI
XORDI (DI
, DI
);
167 extern DI
NEGDI (DI
);
168 extern int NOTDI (DI
);
169 extern DI
INVDI (DI
);
170 extern int EQDI (DI
, DI
);
171 extern int NEDI (DI
, DI
);
172 extern int LTDI (DI
, DI
);
173 extern int LEDI (DI
, DI
);
174 extern int GTDI (DI
, DI
);
175 extern int GEDI (DI
, DI
);
176 extern int LTUDI (UDI
, UDI
);
177 extern int LEUDI (UDI
, UDI
);
178 extern int GTUDI (UDI
, UDI
);
179 extern int GEUDI (UDI
, UDI
);
180 #else /* ! DI_FN_SUPPORT */
181 #define ADDDI(x, y) ((DI) ((UDI) (x) + (UDI) (y)))
182 #define SUBDI(x, y) ((DI) ((UDI) (x) - (UDI) (y)))
183 #define MULDI(x, y) ((DI) ((UDI) (x) * (UDI) (y)))
184 #define DIVDI(x, y) ((DI) (x) / (DI) (y))
185 #define UDIVDI(x, y) ((UDI) (x) / (UDI) (y))
186 #define MODDI(x, y) ((DI) (x) % (DI) (y))
187 #define UMODDI(x, y) ((UDI) (x) % (UDI) (y))
188 #define SRADI(x, y) ((DI) (x) >> (y))
189 #define SRLDI(x, y) ((UDI) (x) >> (y))
190 #define SLLDI(x, y) ((UDI) (x) << (y))
191 extern DI
RORDI (DI
, int);
192 extern DI
ROLDI (DI
, int);
193 #define ANDDI(x, y) ((x) & (y))
194 #define ORDI(x, y) ((x) | (y))
195 #define XORDI(x, y) ((x) ^ (y))
196 #define NEGDI(x) ((DI) (- (UDI) (x)))
197 #define NOTDI(x) (! (DI) (x))
198 #define INVDI(x) (~ (x))
199 #define ABSDI(x) ((DI) ((DI) (x) < 0 ? -(UDI) (x) : (UDI) (x)))
200 #define EQDI(x, y) ((DI) (x) == (DI) (y))
201 #define NEDI(x, y) ((DI) (x) != (DI) (y))
202 #define LTDI(x, y) ((DI) (x) < (DI) (y))
203 #define LEDI(x, y) ((DI) (x) <= (DI) (y))
204 #define GTDI(x, y) ((DI) (x) > (DI) (y))
205 #define GEDI(x, y) ((DI) (x) >= (DI) (y))
206 #define LTUDI(x, y) ((UDI) (x) < (UDI) (y))
207 #define LEUDI(x, y) ((UDI) (x) <= (UDI) (y))
208 #define GTUDI(x, y) ((UDI) (x) > (UDI) (y))
209 #define GEUDI(x, y) ((UDI) (x) >= (UDI) (y))
210 #endif /* DI_FN_SUPPORT */
212 #define EXTBIQI(x) ((QI) (BI) (x))
213 #define EXTBIHI(x) ((HI) (BI) (x))
214 #define EXTBISI(x) ((SI) (BI) (x))
215 #if defined (DI_FN_SUPPORT)
216 extern DI
EXTBIDI (BI
);
218 #define EXTBIDI(x) ((DI) (BI) (x))
220 #define EXTQIHI(x) ((HI) (QI) (x))
221 #define EXTQISI(x) ((SI) (QI) (x))
222 #if defined (DI_FN_SUPPORT)
223 extern DI
EXTQIDI (QI
);
225 #define EXTQIDI(x) ((DI) (QI) (x))
227 #define EXTHIHI(x) ((HI) (HI) (x))
228 #define EXTHISI(x) ((SI) (HI) (x))
229 #define EXTSISI(x) ((SI) (SI) (x))
230 #if defined (DI_FN_SUPPORT)
231 extern DI
EXTHIDI (HI
);
233 #define EXTHIDI(x) ((DI) (HI) (x))
235 #if defined (DI_FN_SUPPORT)
236 extern DI
EXTSIDI (SI
);
238 #define EXTSIDI(x) ((DI) (SI) (x))
241 #define ZEXTBIQI(x) ((QI) (BI) (x))
242 #define ZEXTBIHI(x) ((HI) (BI) (x))
243 #define ZEXTBISI(x) ((SI) (BI) (x))
244 #if defined (DI_FN_SUPPORT)
245 extern DI
ZEXTBIDI (BI
);
247 #define ZEXTBIDI(x) ((DI) (BI) (x))
249 #define ZEXTQIHI(x) ((HI) (UQI) (x))
250 #define ZEXTQISI(x) ((SI) (UQI) (x))
251 #if defined (DI_FN_SUPPORT)
252 extern DI
ZEXTQIDI (QI
);
254 #define ZEXTQIDI(x) ((DI) (UQI) (x))
256 #define ZEXTHISI(x) ((SI) (UHI) (x))
257 #define ZEXTHIHI(x) ((HI) (UHI) (x))
258 #define ZEXTSISI(x) ((SI) (USI) (x))
259 #if defined (DI_FN_SUPPORT)
260 extern DI
ZEXTHIDI (HI
);
262 #define ZEXTHIDI(x) ((DI) (UHI) (x))
264 #if defined (DI_FN_SUPPORT)
265 extern DI
ZEXTSIDI (SI
);
267 #define ZEXTSIDI(x) ((DI) (USI) (x))
270 #define TRUNCQIBI(x) ((BI) (QI) (x))
271 #define TRUNCHIBI(x) ((BI) (HI) (x))
272 #define TRUNCHIQI(x) ((QI) (HI) (x))
273 #define TRUNCSIBI(x) ((BI) (SI) (x))
274 #define TRUNCSIQI(x) ((QI) (SI) (x))
275 #define TRUNCSIHI(x) ((HI) (SI) (x))
276 #define TRUNCSISI(x) ((SI) (SI) (x))
277 #if defined (DI_FN_SUPPORT)
278 extern BI
TRUNCDIBI (DI
);
280 #define TRUNCDIBI(x) ((BI) (DI) (x))
282 #if defined (DI_FN_SUPPORT)
283 extern QI
TRUNCDIQI (DI
);
285 #define TRUNCDIQI(x) ((QI) (DI) (x))
287 #if defined (DI_FN_SUPPORT)
288 extern HI
TRUNCDIHI (DI
);
290 #define TRUNCDIHI(x) ((HI) (DI) (x))
292 #if defined (DI_FN_SUPPORT)
293 extern SI
TRUNCDISI (DI
);
295 #define TRUNCDISI(x) ((SI) (DI) (x))
298 /* Composing/decomposing the various types.
299 Word ordering is endian-independent. Words are specified most to least
300 significant and word number 0 is the most significant word.
301 ??? May also wish an endian-dependent version. Later. */
303 #ifdef SEMOPS_DEFINE_INLINE
308 union { SI in
; SF out
; } x
;
316 union { DI in
; DF out
; } x
;
322 SUBWORDSIQI (SI in
, int byte
)
324 assert (byte
>= 0 && byte
<= 3);
325 return (UQI
) (in
>> (8 * (3 - byte
))) & 0xFF;
329 SUBWORDSIUQI (SI in
, int byte
)
331 assert (byte
>= 0 && byte
<= 3);
332 return (UQI
) (in
>> (8 * (3 - byte
))) & 0xFF;
336 SUBWORDDIQI (DI in
, int byte
)
338 assert (byte
>= 0 && byte
<= 7);
339 return (UQI
) (in
>> (8 * (7 - byte
))) & 0xFF;
343 SUBWORDDIHI (DI in
, int word
)
345 assert (word
>= 0 && word
<= 3);
346 return (UHI
) (in
>> (16 * (3 - word
))) & 0xFFFF;
350 SUBWORDSIHI (SI in
, int word
)
353 return (USI
) in
>> 16;
361 union { SF in
; SI out
; } x
;
369 union { DF in
; DI out
; } x
;
375 SUBWORDDIUQI (DI in
, int byte
)
377 assert (byte
>= 0 && byte
<= 7);
378 return (UQI
) (in
>> (8 * (7 - byte
)));
382 SUBWORDDISI (DI in
, int word
)
385 return (UDI
) in
>> 32;
391 SUBWORDDFSI (DF in
, int word
)
393 /* Note: typedef UDI DF; */
395 return (UDI
) in
>> 32;
401 SUBWORDXFSI (XF in
, int word
)
403 /* Note: typedef struct { SI parts[3]; } XF; */
404 union { XF in
; SI out
[3]; } x
;
406 if (CURRENT_TARGET_BYTE_ORDER
== BIG_ENDIAN
)
409 return x
.out
[2 - word
];
413 SUBWORDTFSI (TF in
, int word
)
415 /* Note: typedef struct { SI parts[4]; } TF; */
416 union { TF in
; SI out
[4]; } x
;
418 if (CURRENT_TARGET_BYTE_ORDER
== BIG_ENDIAN
)
421 return x
.out
[3 - word
];
425 JOINSIDI (SI x0
, SI x1
)
427 return MAKEDI (x0
, x1
);
431 JOINSIDF (SI x0
, SI x1
)
433 union { SI in
[2]; DF out
; } x
;
434 if (CURRENT_TARGET_BYTE_ORDER
== BIG_ENDIAN
)
435 x
.in
[0] = x0
, x
.in
[1] = x1
;
437 x
.in
[1] = x0
, x
.in
[0] = x1
;
442 JOINSIXF (SI x0
, SI x1
, SI x2
)
444 union { SI in
[3]; XF out
; } x
;
445 if (CURRENT_TARGET_BYTE_ORDER
== BIG_ENDIAN
)
446 x
.in
[0] = x0
, x
.in
[1] = x1
, x
.in
[2] = x2
;
448 x
.in
[2] = x0
, x
.in
[1] = x1
, x
.in
[0] = x2
;
453 JOINSITF (SI x0
, SI x1
, SI x2
, SI x3
)
455 union { SI in
[4]; TF out
; } x
;
456 if (CURRENT_TARGET_BYTE_ORDER
== BIG_ENDIAN
)
457 x
.in
[0] = x0
, x
.in
[1] = x1
, x
.in
[2] = x2
, x
.in
[3] = x3
;
459 x
.in
[3] = x0
, x
.in
[2] = x1
, x
.in
[1] = x2
, x
.in
[0] = x3
;
471 QI
SUBWORDDIQI (DI
, int);
472 HI
SUBWORDDIHI (DI
, int);
473 SI
SUBWORDDISI (DI
, int);
474 SI
SUBWORDDFSI (DF
, int);
475 SI
SUBWORDXFSI (XF
, int);
476 SI
SUBWORDTFSI (TF
, int);
478 UQI
SUBWORDSIUQI (SI
);
479 UQI
SUBWORDDIUQI (DI
);
481 DI
JOINSIDI (SI
, SI
);
482 DF
JOINSIDF (SI
, SI
);
483 XF
JOINSIXF (SI
, SI
, SI
);
484 TF
JOINSITF (SI
, SI
, SI
, SI
);
486 #endif /* SUBWORD,JOIN */
488 /* Semantic support utilities. */
490 #ifdef SEMOPS_DEFINE_INLINE
493 ADDCSI (SI a
, SI b
, BI c
)
495 SI res
= ADDSI (a
, ADDSI (b
, c
));
500 ADDCFSI (SI a
, SI b
, BI c
)
502 SI tmp
= ADDSI (a
, ADDSI (b
, c
));
503 BI res
= ((USI
) tmp
< (USI
) a
) || (c
&& tmp
== a
);
508 ADDOFSI (SI a
, SI b
, BI c
)
510 SI tmp
= ADDSI (a
, ADDSI (b
, c
));
511 BI res
= (((a
< 0) == (b
< 0))
512 && ((a
< 0) != (tmp
< 0)));
517 SUBCSI (SI a
, SI b
, BI c
)
519 SI res
= SUBSI (a
, ADDSI (b
, c
));
524 SUBCFSI (SI a
, SI b
, BI c
)
526 BI res
= ((USI
) a
< (USI
) b
) || (c
&& a
== b
);
531 SUBOFSI (SI a
, SI b
, BI c
)
533 SI tmp
= SUBSI (a
, ADDSI (b
, c
));
534 BI res
= (((a
< 0) != (b
< 0))
535 && ((a
< 0) != (tmp
< 0)));
540 ADDCHI (HI a
, HI b
, BI c
)
542 HI res
= ADDHI (a
, ADDHI (b
, c
));
547 ADDCFHI (HI a
, HI b
, BI c
)
549 HI tmp
= ADDHI (a
, ADDHI (b
, c
));
550 BI res
= ((UHI
) tmp
< (UHI
) a
) || (c
&& tmp
== a
);
555 ADDOFHI (HI a
, HI b
, BI c
)
557 HI tmp
= ADDHI (a
, ADDHI (b
, c
));
558 BI res
= (((a
< 0) == (b
< 0))
559 && ((a
< 0) != (tmp
< 0)));
564 SUBCHI (HI a
, HI b
, BI c
)
566 HI res
= SUBHI (a
, ADDHI (b
, c
));
571 SUBCFHI (HI a
, HI b
, BI c
)
573 BI res
= ((UHI
) a
< (UHI
) b
) || (c
&& a
== b
);
578 SUBOFHI (HI a
, HI b
, BI c
)
580 HI tmp
= SUBHI (a
, ADDHI (b
, c
));
581 BI res
= (((a
< 0) != (b
< 0))
582 && ((a
< 0) != (tmp
< 0)));
587 ADDCQI (QI a
, QI b
, BI c
)
589 QI res
= ADDQI (a
, ADDQI (b
, c
));
594 ADDCFQI (QI a
, QI b
, BI c
)
596 QI tmp
= ADDQI (a
, ADDQI (b
, c
));
597 BI res
= ((UQI
) tmp
< (UQI
) a
) || (c
&& tmp
== a
);
602 ADDOFQI (QI a
, QI b
, BI c
)
604 QI tmp
= ADDQI (a
, ADDQI (b
, c
));
605 BI res
= (((a
< 0) == (b
< 0))
606 && ((a
< 0) != (tmp
< 0)));
611 SUBCQI (QI a
, QI b
, BI c
)
613 QI res
= SUBQI (a
, ADDQI (b
, c
));
618 SUBCFQI (QI a
, QI b
, BI c
)
620 BI res
= ((UQI
) a
< (UQI
) b
) || (c
&& a
== b
);
625 SUBOFQI (QI a
, QI b
, BI c
)
627 QI tmp
= SUBQI (a
, ADDQI (b
, c
));
628 BI res
= (((a
< 0) != (b
< 0))
629 && ((a
< 0) != (tmp
< 0)));
635 SI
ADDCSI (SI
, SI
, BI
);
636 UBI
ADDCFSI (SI
, SI
, BI
);
637 UBI
ADDOFSI (SI
, SI
, BI
);
638 SI
SUBCSI (SI
, SI
, BI
);
639 UBI
SUBCFSI (SI
, SI
, BI
);
640 UBI
SUBOFSI (SI
, SI
, BI
);
641 HI
ADDCHI (HI
, HI
, BI
);
642 UBI
ADDCFHI (HI
, HI
, BI
);
643 UBI
ADDOFHI (HI
, HI
, BI
);
644 HI
SUBCHI (HI
, HI
, BI
);
645 UBI
SUBCFHI (HI
, HI
, BI
);
646 UBI
SUBOFHI (HI
, HI
, BI
);
647 QI
ADDCQI (QI
, QI
, BI
);
648 UBI
ADDCFQI (QI
, QI
, BI
);
649 UBI
ADDOFQI (QI
, QI
, BI
);
650 QI
SUBCQI (QI
, QI
, BI
);
651 UBI
SUBCFQI (QI
, QI
, BI
);
652 UBI
SUBOFQI (QI
, QI
, BI
);
656 #endif /* CGEN_SEM_OPS_H */