1/* Semantics ops support for CGEN-based opcode libraries. 2 Copyright (C) 2005 Free Software Foundation, Inc. 3 Contributed by Red Hat. 4 5This file is part of the GNU opcodes library. 6 7This program is free software; you can redistribute it and/or modify 8it under the terms of the GNU General Public License as published by 9the Free Software Foundation; either version 2, or (at your option) 10any later version. 11 12This program is distributed in the hope that it will be useful, 13but WITHOUT ANY WARRANTY; without even the implied warranty of 14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15GNU General Public License for more details. 16 17You should have received a copy of the GNU General Public License along 18with this program; if not, write to the Free Software Foundation, Inc., 1959 Temple Place - Suite 330, Boston, MA 02111-1307, USA. 20 21*/ 22 23#ifndef CGEN_SEM_OPS_H 24#define CGEN_SEM_OPS_H 25 26#include <assert.h> 27 28#if defined (__GNUC__) && ! defined (SEMOPS_DEFINE_INLINE) 29#define SEMOPS_DEFINE_INLINE 30#define SEMOPS_INLINE extern inline 31#else 32#define SEMOPS_INLINE 33#endif 34 35/* TODO: Lazy encoding/decoding of fp values. */ 36 37/* These don't really have a mode. */ 38#define ANDIF(x, y) ((x) && (y)) 39#define ORIF(x, y) ((x) || (y)) 40 41#define SUBBI(x, y) ((x) - (y)) 42#define ANDBI(x, y) ((x) & (y)) 43#define ORBI(x, y) ((x) | (y)) 44#define XORBI(x, y) ((x) ^ (y)) 45#define NEGBI(x) (- (x)) 46#define NOTBI(x) (! (BI) (x)) 47#define INVBI(x) (~ (x)) 48#define EQBI(x, y) ((BI) (x) == (BI) (y)) 49#define NEBI(x, y) ((BI) (x) != (BI) (y)) 50#define LTBI(x, y) ((BI) (x) < (BI) (y)) 51#define LEBI(x, y) ((BI) (x) <= (BI) (y)) 52#define GTBI(x, y) ((BI) (x) > (BI) (y)) 53#define GEBI(x, y) ((BI) (x) >= (BI) (y)) 54#define LTUBI(x, y) ((BI) (x) < (BI) (y)) 55#define LEUBI(x, y) ((BI) (x) <= (BI) (y)) 56#define GTUBI(x, y) ((BI) (x) > (BI) (y)) 57#define GEUBI(x, y) ((BI) (x) >= (BI) (y)) 58 59#define ADDQI(x, y) ((x) + (y)) 60#define SUBQI(x, y) ((x) - (y)) 61#define MULQI(x, y) ((x) * (y)) 62#define DIVQI(x, y) ((QI) (x) / (QI) (y)) 63#define UDIVQI(x, y) ((UQI) (x) / (UQI) (y)) 64#define MODQI(x, y) ((QI) (x) % (QI) (y)) 65#define UMODQI(x, y) ((UQI) (x) % (UQI) (y)) 66#define SRAQI(x, y) ((QI) (x) >> (y)) 67#define SRLQI(x, y) ((UQI) (x) >> (y)) 68#define SLLQI(x, y) ((UQI) (x) << (y)) 69extern QI RORQI (QI, int); 70extern QI ROLQI (QI, int); 71#define ANDQI(x, y) ((x) & (y)) 72#define ORQI(x, y) ((x) | (y)) 73#define XORQI(x, y) ((x) ^ (y)) 74#define NEGQI(x) (- (x)) 75#define NOTQI(x) (! (QI) (x)) 76#define INVQI(x) (~ (x)) 77#define ABSQI(x) ((x) < 0 ? -(x) : (x)) 78#define EQQI(x, y) ((QI) (x) == (QI) (y)) 79#define NEQI(x, y) ((QI) (x) != (QI) (y)) 80#define LTQI(x, y) ((QI) (x) < (QI) (y)) 81#define LEQI(x, y) ((QI) (x) <= (QI) (y)) 82#define GTQI(x, y) ((QI) (x) > (QI) (y)) 83#define GEQI(x, y) ((QI) (x) >= (QI) (y)) 84#define LTUQI(x, y) ((UQI) (x) < (UQI) (y)) 85#define LEUQI(x, y) ((UQI) (x) <= (UQI) (y)) 86#define GTUQI(x, y) ((UQI) (x) > (UQI) (y)) 87#define GEUQI(x, y) ((UQI) (x) >= (UQI) (y)) 88 89#define ADDHI(x, y) ((x) + (y)) 90#define SUBHI(x, y) ((x) - (y)) 91#define MULHI(x, y) ((x) * (y)) 92#define DIVHI(x, y) ((HI) (x) / (HI) (y)) 93#define UDIVHI(x, y) ((UHI) (x) / (UHI) (y)) 94#define MODHI(x, y) ((HI) (x) % (HI) (y)) 95#define UMODHI(x, y) ((UHI) (x) % (UHI) (y)) 96#define SRAHI(x, y) ((HI) (x) >> (y)) 97#define SRLHI(x, y) ((UHI) (x) >> (y)) 98#define SLLHI(x, y) ((UHI) (x) << (y)) 99extern HI RORHI (HI, int); 100extern HI ROLHI (HI, int); 101#define ANDHI(x, y) ((x) & (y)) 102#define ORHI(x, y) ((x) | (y)) 103#define XORHI(x, y) ((x) ^ (y)) 104#define NEGHI(x) (- (x)) 105#define NOTHI(x) (! (HI) (x)) 106#define INVHI(x) (~ (x)) 107#define ABSHI(x) ((x) < 0 ? -(x) : (x)) 108#define EQHI(x, y) ((HI) (x) == (HI) (y)) 109#define NEHI(x, y) ((HI) (x) != (HI) (y)) 110#define LTHI(x, y) ((HI) (x) < (HI) (y)) 111#define LEHI(x, y) ((HI) (x) <= (HI) (y)) 112#define GTHI(x, y) ((HI) (x) > (HI) (y)) 113#define GEHI(x, y) ((HI) (x) >= (HI) (y)) 114#define LTUHI(x, y) ((UHI) (x) < (UHI) (y)) 115#define LEUHI(x, y) ((UHI) (x) <= (UHI) (y)) 116#define GTUHI(x, y) ((UHI) (x) > (UHI) (y)) 117#define GEUHI(x, y) ((UHI) (x) >= (UHI) (y)) 118 119#define ADDSI(x, y) ((x) + (y)) 120#define SUBSI(x, y) ((x) - (y)) 121#define MULSI(x, y) ((x) * (y)) 122#define DIVSI(x, y) ((SI) (x) / (SI) (y)) 123#define UDIVSI(x, y) ((USI) (x) / (USI) (y)) 124#define MODSI(x, y) ((SI) (x) % (SI) (y)) 125#define UMODSI(x, y) ((USI) (x) % (USI) (y)) 126#define SRASI(x, y) ((SI) (x) >> (y)) 127#define SRLSI(x, y) ((USI) (x) >> (y)) 128#define SLLSI(x, y) ((USI) (x) << (y)) 129extern SI RORSI (SI, int); 130extern SI ROLSI (SI, int); 131#define ANDSI(x, y) ((x) & (y)) 132#define ORSI(x, y) ((x) | (y)) 133#define XORSI(x, y) ((x) ^ (y)) 134#define NEGSI(x) (- (x)) 135#define NOTSI(x) (! (SI) (x)) 136#define INVSI(x) (~ (x)) 137#define ABSSI(x) ((x) < 0 ? -(x) : (x)) 138#define EQSI(x, y) ((SI) (x) == (SI) (y)) 139#define NESI(x, y) ((SI) (x) != (SI) (y)) 140#define LTSI(x, y) ((SI) (x) < (SI) (y)) 141#define LESI(x, y) ((SI) (x) <= (SI) (y)) 142#define GTSI(x, y) ((SI) (x) > (SI) (y)) 143#define GESI(x, y) ((SI) (x) >= (SI) (y)) 144#define LTUSI(x, y) ((USI) (x) < (USI) (y)) 145#define LEUSI(x, y) ((USI) (x) <= (USI) (y)) 146#define GTUSI(x, y) ((USI) (x) > (USI) (y)) 147#define GEUSI(x, y) ((USI) (x) >= (USI) (y)) 148 149#ifdef DI_FN_SUPPORT 150extern DI ADDDI (DI, DI); 151extern DI SUBDI (DI, DI); 152extern DI MULDI (DI, DI); 153extern DI DIVDI (DI, DI); 154extern DI UDIVDI (DI, DI); 155extern DI MODDI (DI, DI); 156extern DI UMODDI (DI, DI); 157extern DI SRADI (DI, int); 158extern UDI SRLDI (UDI, int); 159extern UDI SLLDI (UDI, int); 160extern DI RORDI (DI, int); 161extern DI ROLDI (DI, int); 162extern DI ANDDI (DI, DI); 163extern DI ORDI (DI, DI); 164extern DI XORDI (DI, DI); 165extern DI NEGDI (DI); 166extern int NOTDI (DI); 167extern DI INVDI (DI); 168extern int EQDI (DI, DI); 169extern int NEDI (DI, DI); 170extern int LTDI (DI, DI); 171extern int LEDI (DI, DI); 172extern int GTDI (DI, DI); 173extern int GEDI (DI, DI); 174extern int LTUDI (UDI, UDI); 175extern int LEUDI (UDI, UDI); 176extern int GTUDI (UDI, UDI); 177extern int GEUDI (UDI, UDI); 178#else /* ! DI_FN_SUPPORT */ 179#define ADDDI(x, y) ((x) + (y)) 180#define SUBDI(x, y) ((x) - (y)) 181#define MULDI(x, y) ((x) * (y)) 182#define DIVDI(x, y) ((DI) (x) / (DI) (y)) 183#define UDIVDI(x, y) ((UDI) (x) / (UDI) (y)) 184#define MODDI(x, y) ((DI) (x) % (DI) (y)) 185#define UMODDI(x, y) ((UDI) (x) % (UDI) (y)) 186#define SRADI(x, y) ((DI) (x) >> (y)) 187#define SRLDI(x, y) ((UDI) (x) >> (y)) 188#define SLLDI(x, y) ((UDI) (x) << (y)) 189extern DI RORDI (DI, int); 190extern DI ROLDI (DI, int); 191#define ANDDI(x, y) ((x) & (y)) 192#define ORDI(x, y) ((x) | (y)) 193#define XORDI(x, y) ((x) ^ (y)) 194#define NEGDI(x) (- (x)) 195#define NOTDI(x) (! (DI) (x)) 196#define INVDI(x) (~ (x)) 197#define ABSDI(x) ((x) < 0 ? -(x) : (x)) 198#define EQDI(x, y) ((DI) (x) == (DI) (y)) 199#define NEDI(x, y) ((DI) (x) != (DI) (y)) 200#define LTDI(x, y) ((DI) (x) < (DI) (y)) 201#define LEDI(x, y) ((DI) (x) <= (DI) (y)) 202#define GTDI(x, y) ((DI) (x) > (DI) (y)) 203#define GEDI(x, y) ((DI) (x) >= (DI) (y)) 204#define LTUDI(x, y) ((UDI) (x) < (UDI) (y)) 205#define LEUDI(x, y) ((UDI) (x) <= (UDI) (y)) 206#define GTUDI(x, y) ((UDI) (x) > (UDI) (y)) 207#define GEUDI(x, y) ((UDI) (x) >= (UDI) (y)) 208#endif /* DI_FN_SUPPORT */ 209 210#define EXTBIQI(x) ((QI) (BI) (x)) 211#define EXTBIHI(x) ((HI) (BI) (x)) 212#define EXTBISI(x) ((SI) (BI) (x)) 213#if defined (DI_FN_SUPPORT) 214extern DI EXTBIDI (BI); 215#else 216#define EXTBIDI(x) ((DI) (BI) (x)) 217#endif 218#define EXTQIHI(x) ((HI) (QI) (x)) 219#define EXTQISI(x) ((SI) (QI) (x)) 220#if defined (DI_FN_SUPPORT) 221extern DI EXTQIDI (QI); 222#else 223#define EXTQIDI(x) ((DI) (QI) (x)) 224#endif 225#define EXTHIHI(x) ((HI) (HI) (x)) 226#define EXTHISI(x) ((SI) (HI) (x)) 227#define EXTSISI(x) ((SI) (SI) (x)) 228#if defined (DI_FN_SUPPORT) 229extern DI EXTHIDI (HI); 230#else 231#define EXTHIDI(x) ((DI) (HI) (x)) 232#endif 233#if defined (DI_FN_SUPPORT) 234extern DI EXTSIDI (SI); 235#else 236#define EXTSIDI(x) ((DI) (SI) (x)) 237#endif 238 239#define ZEXTBIQI(x) ((QI) (BI) (x)) 240#define ZEXTBIHI(x) ((HI) (BI) (x)) 241#define ZEXTBISI(x) ((SI) (BI) (x)) 242#if defined (DI_FN_SUPPORT) 243extern DI ZEXTBIDI (BI); 244#else 245#define ZEXTBIDI(x) ((DI) (BI) (x)) 246#endif 247#define ZEXTQIHI(x) ((HI) (UQI) (x)) 248#define ZEXTQISI(x) ((SI) (UQI) (x)) 249#if defined (DI_FN_SUPPORT) 250extern DI ZEXTQIDI (QI); 251#else 252#define ZEXTQIDI(x) ((DI) (UQI) (x)) 253#endif 254#define ZEXTHISI(x) ((SI) (UHI) (x)) 255#define ZEXTHIHI(x) ((HI) (UHI) (x)) 256#define ZEXTSISI(x) ((SI) (USI) (x)) 257#if defined (DI_FN_SUPPORT) 258extern DI ZEXTHIDI (HI); 259#else 260#define ZEXTHIDI(x) ((DI) (UHI) (x)) 261#endif 262#if defined (DI_FN_SUPPORT) 263extern DI ZEXTSIDI (SI); 264#else 265#define ZEXTSIDI(x) ((DI) (USI) (x)) 266#endif 267 268#define TRUNCQIBI(x) ((BI) (QI) (x)) 269#define TRUNCHIBI(x) ((BI) (HI) (x)) 270#define TRUNCHIQI(x) ((QI) (HI) (x)) 271#define TRUNCSIBI(x) ((BI) (SI) (x)) 272#define TRUNCSIQI(x) ((QI) (SI) (x)) 273#define TRUNCSIHI(x) ((HI) (SI) (x)) 274#define TRUNCSISI(x) ((SI) (SI) (x)) 275#if defined (DI_FN_SUPPORT) 276extern BI TRUNCDIBI (DI); 277#else 278#define TRUNCDIBI(x) ((BI) (DI) (x)) 279#endif 280#if defined (DI_FN_SUPPORT) 281extern QI TRUNCDIQI (DI); 282#else 283#define TRUNCDIQI(x) ((QI) (DI) (x)) 284#endif 285#if defined (DI_FN_SUPPORT) 286extern HI TRUNCDIHI (DI); 287#else 288#define TRUNCDIHI(x) ((HI) (DI) (x)) 289#endif 290#if defined (DI_FN_SUPPORT) 291extern SI TRUNCDISI (DI); 292#else 293#define TRUNCDISI(x) ((SI) (DI) (x)) 294#endif 295 296/* Composing/decomposing the various types. 297 Word ordering is endian-independent. Words are specified most to least 298 significant and word number 0 is the most significant word. 299 ??? May also wish an endian-dependent version. Later. */ 300 301QI SUBWORDSIQI (SI, int); 302HI SUBWORDSIHI (SI, int); 303SI SUBWORDSFSI (SF); 304SF SUBWORDSISF (SI); 305DI SUBWORDDFDI (DF); 306DF SUBWORDDIDF (DI); 307QI SUBWORDDIQI (DI, int); 308HI SUBWORDDIHI (DI, int); 309SI SUBWORDDISI (DI, int); 310SI SUBWORDDFSI (DF, int); 311SI SUBWORDXFSI (XF, int); 312SI SUBWORDTFSI (TF, int); 313 314UQI SUBWORDSIUQI (SI, int); 315UQI SUBWORDDIUQI (DI, int); 316 317#ifdef SEMOPS_DEFINE_INLINE 318 319SEMOPS_INLINE SF 320SUBWORDSISF (SI in) 321{ 322 union { SI in; SF out; } x; 323 x.in = in; 324 return x.out; 325} 326 327SEMOPS_INLINE DF 328SUBWORDDIDF (DI in) 329{ 330 union { DI in; DF out; } x; 331 x.in = in; 332 return x.out; 333} 334 335SEMOPS_INLINE QI 336SUBWORDSIQI (SI in, int byte) 337{ 338 assert (byte >= 0 && byte <= 3); 339 return (UQI) (in >> (8 * (3 - byte))) & 0xFF; 340} 341 342SEMOPS_INLINE UQI 343SUBWORDSIUQI (SI in, int byte) 344{ 345 assert (byte >= 0 && byte <= 3); 346 return (UQI) (in >> (8 * (3 - byte))) & 0xFF; 347} 348 349SEMOPS_INLINE QI 350SUBWORDDIQI (DI in, int byte) 351{ 352 assert (byte >= 0 && byte <= 7); 353 return (UQI) (in >> (8 * (7 - byte))) & 0xFF; 354} 355 356SEMOPS_INLINE HI 357SUBWORDDIHI (DI in, int word) 358{ 359 assert (word >= 0 && word <= 3); 360 return (UHI) (in >> (16 * (3 - word))) & 0xFFFF; 361} 362 363SEMOPS_INLINE HI 364SUBWORDSIHI (SI in, int word) 365{ 366 if (word == 0) 367 return (USI) in >> 16; 368 else 369 return in; 370} 371 372SEMOPS_INLINE SI 373SUBWORDSFSI (SF in) 374{ 375 union { SF in; SI out; } x; 376 x.in = in; 377 return x.out; 378} 379 380SEMOPS_INLINE DI 381SUBWORDDFDI (DF in) 382{ 383 union { DF in; DI out; } x; 384 x.in = in; 385 return x.out; 386} 387 388SEMOPS_INLINE UQI 389SUBWORDDIUQI (DI in, int byte) 390{ 391 assert (byte >= 0 && byte <= 7); 392 return (UQI) (in >> (8 * (7 - byte))); 393} 394 395SEMOPS_INLINE SI 396SUBWORDDISI (DI in, int word) 397{ 398 if (word == 0) 399 return (UDI) in >> 32; 400 else 401 return in; 402} 403 404SEMOPS_INLINE SI 405SUBWORDDFSI (DF in, int word) 406{ 407 /* Note: typedef UDI DF; */ 408 if (word == 0) 409 return (UDI) in >> 32; 410 else 411 return in; 412} 413 414SEMOPS_INLINE SI 415SUBWORDXFSI (XF in, int word) 416{ 417 /* Note: typedef struct { SI parts[3]; } XF; */ 418 union { XF in; SI out[3]; } x; 419 x.in = in; 420 return x.out[word]; 421} 422 423SEMOPS_INLINE SI 424SUBWORDTFSI (TF in, int word) 425{ 426 /* Note: typedef struct { SI parts[4]; } TF; */ 427 union { TF in; SI out[4]; } x; 428 x.in = in; 429 return x.out[word]; 430} 431 432#endif /* SUBWORD,JOIN */ 433 434#endif /* CGEN_SEM_OPS_H */ 435