cpubase.pas 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl
  3. Contains the base types for the PowerPC
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. { This Unit contains the base types for the PowerPC
  18. }
  19. unit cpubase;
  20. {$i fpcdefs.inc}
  21. interface
  22. uses
  23. strings,globtype,
  24. cutils,cclasses,aasmbase,cpuinfo,cgbase;
  25. {*****************************************************************************
  26. Assembler Opcodes
  27. *****************************************************************************}
  28. type
  29. TAsmOp=(A_None,
  30. { normal opcodes }
  31. a_add, a_add_, a_addo, a_addo_, a_addc, a_addc_, a_addco, a_addco_,
  32. a_adde, a_adde_, a_addeo, a_addeo_, a_addi, a_addic, a_addic_, a_addis,
  33. a_addme, a_addme_, a_addmeo, a_addmeo_, a_addze, a_addze_, a_addzeo,
  34. a_addzeo_, a_and, a_and_, a_andc, a_andc_, a_andi_, a_andis_, a_b,
  35. a_ba, a_bl, a_bla, a_bc, a_bca, a_bcl, a_bcla, a_bcctr, a_bcctrl, a_bclr,
  36. a_bclrl, a_cmp, a_cmpi, a_cmpl, a_cmpli, a_cntlzw, a_cntlzw_, a_crand,
  37. a_crandc, a_creqv, a_crnand, a_crnor, a_cror, a_crorc, a_crxor, a_dcba,
  38. a_dcbf, a_dcbi, a_dcbst, a_dcbt, a_dcbtst, a_dcbz, a_divw, a_divw_, a_divwo, a_divwo_,
  39. a_divwu, a_divwu_, a_divwuo, a_divwuo_, a_eciwx, a_ecowx, a_eieio, a_eqv,
  40. a_eqv_, a_extsb, a_extsb_, a_extsh, a_extsh_, a_fabs, a_fabs_, a_fadd,
  41. a_fadd_, a_fadds, a_fadds_, a_fcmpo, a_fcmpu, a_fctid, a_fctid_,
  42. a_fctidz, a_fctidz_, a_fctiw, a_fctiw_, a_fctiwz, a_fctiwz_,
  43. a_fdiv, a_fdiv_, a_fdivs, a_fdivs_, a_fmadd, a_fmadd_, a_fmadds,
  44. a_fmadds_, a_fmr, a_fmsub, a_fmsub_, a_fmsubs, a_fmsubs_, a_fmul, a_fmul_,
  45. a_fmuls, a_fmuls_, a_fnabs, a_fnabs_, a_fneg, a_fneg_, a_fnmadd,
  46. a_fnmadd_, a_fnmadds, a_fnmadds_, a_fnmsub, a_fnmsub_, a_fnmsubs,
  47. a_fnmsubs_, a_fres, a_fres_, a_frsp, a_frsp_, a_frsqrte, a_frsqrte_,
  48. a_fsel, a_fsel_, a_fsqrt, a_fsqrt_, a_fsqrts, a_fsqrts_, a_fsub, a_fsub_,
  49. a_fsubs, a_fsubs_, a_icbi, a_isync, a_lbz, a_lbzu, a_lbzux, a_lbzx,
  50. a_lfd, a_lfdu, a_lfdux, a_lfdx, a_lfs, a_lfsu, a_lfsux, a_lfsx, a_lha,
  51. a_lhau, a_lhaux, a_lhax, a_lhbrx, a_lhz, a_lhzu, a_lhzux, a_lhzx, a_lmw,
  52. a_lswi, a_lswx, a_lwarx, a_lwbrx, a_lwz, a_lwzu, a_lwzux, a_lwzx, a_mcrf,
  53. a_mcrfs, a_mcrxr, a_mfcr, a_mffs, a_mffs_, a_mfmsr, a_mfspr, a_mfsr,
  54. a_mfsrin, a_mftb, a_mtcrf, a_mtfsb0, a_mtfsb1, a_mtfsf, a_mtfsf_,
  55. a_mtfsfi, a_mtfsfi_, a_mtmsr, a_mtspr, a_mtsr, a_mtsrin, a_mulhw,
  56. a_mulhw_, a_mulhwu, a_mulhwu_, a_mulli, a_mullw, a_mullw_, a_mullwo,
  57. a_mullwo_, a_nand, a_nand_, a_neg, a_neg_, a_nego, a_nego_, a_nor, a_nor_,
  58. a_or, a_or_, a_orc, a_orc_, a_ori, a_oris, a_rfi, a_rlwimi, a_rlwimi_,
  59. a_rlwinm, a_rlwinm_, a_rlwnm, a_rlwnm_, a_sc, a_slw, a_slw_, a_sraw, a_sraw_,
  60. a_srawi, a_srawi_,a_srw, a_srw_, a_stb, a_stbu, a_stbux, a_stbx, a_stfd,
  61. a_stfdu, a_stfdux, a_stfdx, a_stfiwx, a_stfs, a_stfsu, a_stfsux, a_stfsx,
  62. a_sth, a_sthbrx, a_sthu, a_sthux, a_sthx, a_stmw, a_stswi, a_stswx, a_stw,
  63. a_stwbrx, a_stwcx_, a_stwu, a_stwux, a_stwx, a_subf, a_subf_, a_subfo,
  64. a_subfo_, a_subfc, a_subfc_, a_subfco, a_subfco_, a_subfe, a_subfe_,
  65. a_subfeo, a_subfeo_, a_subfic, a_subfme, a_subfme_, a_subfmeo, a_subfmeo_,
  66. a_subfze, a_subfze_, a_subfzeo, a_subfzeo_, a_sync, a_tlbia, a_tlbie,
  67. a_tlbsync, a_tw, a_twi, a_xor, a_xor_, a_xori, a_xoris,
  68. { simplified mnemonics }
  69. a_subi, a_subis, a_subic, a_subic_, a_sub, a_sub_, a_subo, a_subo_,
  70. a_subc, a_subc_, a_subco, a_subco_, a_cmpwi, a_cmpw, a_cmplwi, a_cmplw,
  71. a_extlwi, a_extlwi_, a_extrwi, a_extrwi_, a_inslwi, a_inslwi_, a_insrwi,
  72. a_insrwi_, a_rotlwi, a_rotlwi_, a_rotlw, a_rotlw_, a_slwi, a_slwi_,
  73. a_srwi, a_srwi_, a_clrlwi, a_clrlwi_, a_clrrwi, a_clrrwi_, a_clrslwi,
  74. a_clrslwi_, a_blr, a_bctr, a_blrl, a_bctrl, a_crset, a_crclr, a_crmove,
  75. a_crnot, a_mt {move to special purpose reg}, a_mf {move from special purpose reg},
  76. a_nop, a_li, a_lis, a_la, a_mr, a_mr_, a_not, a_not_, a_mtcr, a_mtlr, a_mflr,
  77. a_mtctr, a_mfctr, a_mftbu, a_mfxer,
  78. a_mfpvr, a_mfdcr, a_mtdcr, a_mfdec, mtdec);
  79. {# This should define the array of instructions as string }
  80. op2strtable=array[tasmop] of string[8];
  81. Const
  82. {# First value of opcode enumeration }
  83. firstop = low(tasmop);
  84. {# Last value of opcode enumeration }
  85. lastop = high(tasmop);
  86. {*****************************************************************************
  87. Registers
  88. *****************************************************************************}
  89. type
  90. { Number of registers used for indexing in tables }
  91. tregisterindex=0..{$i rppcnor.inc}-1;
  92. const
  93. maxvarregs = 32-6; { 32 int registers - r0 - stackpointer - r2 - 3 scratch registers }
  94. maxfpuvarregs = 28; { 32 fpuregisters - some scratch registers (minimally 2) }
  95. { Available Superregisters }
  96. {$i rppcsup.inc}
  97. { No Subregisters }
  98. R_SUBWHOLE=R_SUBNONE;
  99. { Available Registers }
  100. {$i rppccon.inc}
  101. { Integer Super registers first and last }
  102. first_int_imreg = $20;
  103. { Float Super register first and last }
  104. first_fpu_imreg = $20;
  105. { MM Super register first and last }
  106. first_mm_imreg = $20;
  107. { TODO: Calculate bsstart}
  108. regnumber_count_bsstart = 64;
  109. regnumber_table : array[tregisterindex] of tregister = (
  110. {$i rppcnum.inc}
  111. );
  112. regstabs_table : array[tregisterindex] of shortint = (
  113. {$i rppcstab.inc}
  114. );
  115. regdwarf_table : array[tregisterindex] of shortint = (
  116. {$i rppcdwrf.inc}
  117. );
  118. {*****************************************************************************
  119. Conditions
  120. *****************************************************************************}
  121. type
  122. TAsmCondFlag = (C_None { unconditional jumps },
  123. { conditions when not using ctr decrement etc }
  124. C_LT,C_LE,C_EQ,C_GE,C_GT,C_NL,C_NE,C_NG,C_SO,C_NS,C_UN,C_NU,
  125. { conditions when using ctr decrement etc }
  126. C_T,C_F,C_DNZ,C_DNZT,C_DNZF,C_DZ,C_DZT,C_DZF);
  127. TDirHint = (DH_None,DH_Minus,DH_Plus);
  128. const
  129. { these are in the XER, but when moved to CR_x they correspond with the }
  130. { bits below }
  131. C_OV = C_GT;
  132. C_CA = C_EQ;
  133. C_NO = C_NG;
  134. C_NC = C_NE;
  135. type
  136. TAsmCond = packed record
  137. dirhint : tdirhint;
  138. case simple: boolean of
  139. false: (BO, BI: byte);
  140. true: (
  141. cond: TAsmCondFlag;
  142. case byte of
  143. 0: ();
  144. { specifies in which part of the cr the bit has to be }
  145. { tested for blt,bgt,beq,..,bnu }
  146. 1: (cr: RS_CR0..RS_CR7);
  147. { specifies the bit to test for bt,bf,bdz,..,bdzf }
  148. 2: (crbit: byte)
  149. );
  150. end;
  151. const
  152. AsmCondFlag2BO: Array[C_T..C_DZF] of Byte =
  153. (12,4,16,8,0,18,10,2);
  154. AsmCondFlag2BOLT_NU: Array[C_LT..C_NU] of Byte =
  155. (12,4,12,4,12,4,4,4,12,4,12,4);
  156. AsmCondFlag2BI: Array[C_LT..C_NU] of Byte =
  157. (0,1,2,0,1,0,2,1,3,3,3,3);
  158. AsmCondFlagTF: Array[TAsmCondFlag] of Boolean =
  159. (false,true,false,true,false,true,false,false,false,true,false,true,false,
  160. true,false,false,true,false,false,true,false);
  161. AsmCondFlag2Str: Array[TAsmCondFlag] of string[4] = ({cf_none}'',
  162. { conditions when not using ctr decrement etc}
  163. 'lt','le','eq','ge','gt','nl','ne','ng','so','ns','un','nu',
  164. 't','f','dnz','dnzt','dnzf','dz','dzt','dzf');
  165. UpperAsmCondFlag2Str: Array[TAsmCondFlag] of string[4] = ({cf_none}'',
  166. { conditions when not using ctr decrement etc}
  167. 'LT','LE','EQ','GE','GT','NL','NE','NG','SO','NS','UN','NU',
  168. 'T','F','DNZ','DNZT','DNZF','DZ','DZT','DZF');
  169. {*****************************************************************************
  170. Flags
  171. *****************************************************************************}
  172. type
  173. TResFlagsEnum = (F_EQ,F_NE,F_LT,F_LE,F_GT,F_GE,F_SO,F_FX,F_FEX,F_VX,F_OX,
  174. { For IEEE-compliant floating-point compares, only <= and >=
  175. are actually needed but the other two are for inverse. }
  176. F_FA,F_FAE,F_FB,F_FBE);
  177. TResFlags = record
  178. cr: RS_CR0..RS_CR7;
  179. flag: TResFlagsEnum;
  180. end;
  181. (*
  182. const
  183. { arrays for boolean location conversions }
  184. flag_2_cond : array[TResFlags] of TAsmCond =
  185. (C_E,C_NE,C_LT,C_LE,C_GT,C_GE,???????????????);
  186. *)
  187. {*****************************************************************************
  188. Reference
  189. *****************************************************************************}
  190. const
  191. { MacOS only. Whether the direct data area (TOC) directly contain
  192. global variables. Otherwise it contains pointers to global variables. }
  193. macos_direct_globals = false;
  194. {*****************************************************************************
  195. Operand Sizes
  196. *****************************************************************************}
  197. {*****************************************************************************
  198. Constants
  199. *****************************************************************************}
  200. const
  201. max_operands = 5;
  202. {*****************************************************************************
  203. Default generic sizes
  204. *****************************************************************************}
  205. {# Defines the default address size for a processor, }
  206. OS_ADDR = OS_32;
  207. {# the natural int size for a processor,
  208. has to match osuinttype/ossinttype as initialized in psystem }
  209. OS_INT = OS_32;
  210. OS_SINT = OS_S32;
  211. {# the maximum float size for a processor, }
  212. OS_FLOAT = OS_F64;
  213. {# the size of a vector register for a processor }
  214. OS_VECTOR = OS_M128;
  215. {*****************************************************************************
  216. GDB Information
  217. *****************************************************************************}
  218. {# Register indexes for stabs information, when some
  219. parameters or variables are stored in registers.
  220. Taken from rs6000.h (DBX_REGISTER_NUMBER)
  221. from GCC 3.x source code. PowerPC has 1:1 mapping
  222. according to the order of the registers defined
  223. in GCC
  224. }
  225. stab_regindex : array[tregisterindex] of shortint = (
  226. {$i rppcstab.inc}
  227. );
  228. {*****************************************************************************
  229. Generic Register names
  230. *****************************************************************************}
  231. {# Stack pointer register }
  232. NR_STACK_POINTER_REG = NR_R1;
  233. RS_STACK_POINTER_REG = RS_R1;
  234. { old stack pointer register used during copying variables from the caller
  235. stack frame
  236. }
  237. NR_OLD_STACK_POINTER_REG = NR_R12;
  238. {# Frame pointer register }
  239. NR_FRAME_POINTER_REG = NR_STACK_POINTER_REG;
  240. RS_FRAME_POINTER_REG = RS_STACK_POINTER_REG;
  241. {# Register for addressing absolute data in a position independant way,
  242. such as in PIC code. The exact meaning is ABI specific. For
  243. further information look at GCC source : PIC_OFFSET_TABLE_REGNUM
  244. Taken from GCC rs6000.h
  245. }
  246. { TODO: As indicated in rs6000.h, but can't find it anywhere else!}
  247. NR_PIC_OFFSET_REG = NR_R30;
  248. { Return address of a function }
  249. NR_RETURN_ADDRESS_REG = NR_R0;
  250. { Results are returned in this register (32-bit values) }
  251. NR_FUNCTION_RETURN_REG = NR_R3;
  252. RS_FUNCTION_RETURN_REG = RS_R3;
  253. { Low part of 64bit return value }
  254. NR_FUNCTION_RETURN64_LOW_REG = NR_R4;
  255. RS_FUNCTION_RETURN64_LOW_REG = RS_R4;
  256. { High part of 64bit return value }
  257. NR_FUNCTION_RETURN64_HIGH_REG = NR_R3;
  258. RS_FUNCTION_RETURN64_HIGH_REG = RS_R3;
  259. { The value returned from a function is available in this register }
  260. NR_FUNCTION_RESULT_REG = NR_FUNCTION_RETURN_REG;
  261. RS_FUNCTION_RESULT_REG = RS_FUNCTION_RETURN_REG;
  262. { The lowh part of 64bit value returned from a function }
  263. NR_FUNCTION_RESULT64_LOW_REG = NR_FUNCTION_RETURN64_LOW_REG;
  264. RS_FUNCTION_RESULT64_LOW_REG = RS_FUNCTION_RETURN64_LOW_REG;
  265. { The high part of 64bit value returned from a function }
  266. NR_FUNCTION_RESULT64_HIGH_REG = NR_FUNCTION_RETURN64_HIGH_REG;
  267. RS_FUNCTION_RESULT64_HIGH_REG = RS_FUNCTION_RETURN64_HIGH_REG;
  268. NR_FPU_RESULT_REG = NR_F1;
  269. NR_MM_RESULT_REG = NR_M0;
  270. NR_DEFAULTFLAGS = NR_CR;
  271. RS_DEFAULTFLAGS = RS_CR;
  272. {*****************************************************************************
  273. GCC /ABI linking information
  274. *****************************************************************************}
  275. {# Required parameter alignment when calling a routine declared as
  276. stdcall and cdecl. The alignment value should be the one defined
  277. by GCC or the target ABI.
  278. The value of this constant is equal to the constant
  279. PARM_BOUNDARY / BITS_PER_UNIT in the GCC source.
  280. }
  281. std_param_align = 4; { for 32-bit version only }
  282. {*****************************************************************************
  283. CPU Dependent Constants
  284. *****************************************************************************}
  285. LinkageAreaSizeAIX = 24;
  286. LinkageAreaSizeSYSV = 8;
  287. { offset in the linkage area for the saved stack pointer }
  288. LA_SP = 0;
  289. { offset in the linkage area for the saved conditional register}
  290. LA_CR_AIX = 4;
  291. { offset in the linkage area for the saved link register}
  292. LA_LR_AIX = 8;
  293. LA_LR_SYSV = 4;
  294. { offset in the linkage area for the saved RTOC register}
  295. LA_RTOC_AIX = 20;
  296. LA_RTOC_ELFV2 = 12;
  297. PARENT_FRAMEPOINTER_OFFSET = 12;
  298. NR_RTOC = NR_R2;
  299. maxfpuregs = 8;
  300. { minimum size of the stack frame if one exists }
  301. MINIMUM_STACKFRAME_SIZE = 56;
  302. {*****************************************************************************
  303. Helpers
  304. *****************************************************************************}
  305. function is_calljmp(o:tasmop):boolean;
  306. procedure inverse_flags(var r : TResFlags);
  307. function flags_to_cond(const f: TResFlags) : TAsmCond;
  308. procedure create_cond_imm(BO,BI:byte;var r : TAsmCond);
  309. procedure create_cond_norm(cond: TAsmCondFlag; cr: byte;var r : TasmCond);
  310. function cgsize2subreg(regtype: tregistertype; s:Tcgsize):Tsubregister;
  311. { Returns the tcgsize corresponding with the size of reg.}
  312. function reg_cgsize(const reg: tregister) : tcgsize;
  313. function findreg_by_number(r:Tregister):tregisterindex;
  314. function std_regnum_search(const s:string):Tregister;
  315. function std_regname(r:Tregister):string;
  316. function is_condreg(r : tregister):boolean;
  317. function inverse_cond(const c: TAsmCond): Tasmcond; {$ifdef USEINLINE}inline;{$endif USEINLINE}
  318. function conditions_equal(const c1, c2: TAsmCond): boolean;
  319. function dwarf_reg(r:tregister):shortint;
  320. function dwarf_reg_no_error(r:tregister):shortint;
  321. function eh_return_data_regno(nr: longint): longint;
  322. implementation
  323. uses
  324. rgbase,verbose;
  325. const
  326. std_regname_table : TRegNameTable = (
  327. {$i rppcstd.inc}
  328. );
  329. regnumber_index : array[tregisterindex] of tregisterindex = (
  330. {$i rppcrni.inc}
  331. );
  332. std_regname_index : array[tregisterindex] of tregisterindex = (
  333. {$i rppcsri.inc}
  334. );
  335. {*****************************************************************************
  336. Helpers
  337. *****************************************************************************}
  338. function is_calljmp(o:tasmop):boolean;
  339. begin
  340. is_calljmp:=false;
  341. case o of
  342. A_B,A_BA,A_BL,A_BLA,A_BC,A_BCA,A_BCL,A_BCLA,A_BCCTR,A_BCCTRL,A_BCLR,
  343. A_BCLRL,A_TW,A_TWI: is_calljmp:=true;
  344. else
  345. ;
  346. end;
  347. end;
  348. procedure inverse_flags(var r: TResFlags);
  349. const
  350. inv_flags: array[F_EQ..F_GE] of TResFlagsEnum =
  351. (F_NE,F_EQ,F_GE,F_GE,F_LE,F_LT);
  352. inv_fpuflags: array[F_FA..F_FBE] of TResFlagsEnum =
  353. (F_FBE,F_FB,F_FAE,F_FA);
  354. begin
  355. if r.flag in [F_EQ..F_GE] then
  356. r.flag := inv_flags[r.flag]
  357. else if r.flag in [F_FA..F_FBE] then
  358. r.flag := inv_fpuflags[r.flag]
  359. else
  360. internalerror(2014041901);
  361. end;
  362. function inverse_cond(const c: TAsmCond): Tasmcond; {$ifdef USEINLINE}inline;{$endif USEINLINE}
  363. const
  364. inv_condflags:array[TAsmCondFlag] of TAsmCondFlag=(C_None,
  365. C_GE,C_GT,C_NE,C_LT,C_LE,C_LT,C_EQ,C_GT,C_NS,C_SO,C_NU,C_UN,
  366. C_F,C_T,C_DNZ,C_DNZF,C_DNZT,C_DZ,C_DZF,C_DZT);
  367. begin
  368. if (c.cond in [C_DNZ,C_DZ]) then
  369. internalerror(2005022501);
  370. result := c;
  371. result.cond := inv_condflags[c.cond];
  372. end;
  373. function conditions_equal(const c1, c2: TAsmCond): boolean;
  374. begin
  375. result :=
  376. (c1.simple and c2.simple) and
  377. (c1.cond = c2.cond) and
  378. ((not(c1.cond in [C_T..C_DZF]) and
  379. (c1.cr = c2.cr)) or
  380. (c1.crbit = c2.crbit));
  381. end;
  382. function flags_to_cond(const f: TResFlags) : TAsmCond;
  383. const
  384. flag_2_cond: array[F_EQ..F_SO] of TAsmCondFlag =
  385. (C_EQ,C_NE,C_LT,C_LE,C_GT,C_GE,C_SO);
  386. begin
  387. if f.flag > high(flag_2_cond) then
  388. internalerror(200112301);
  389. result.simple := true;
  390. result.cr := f.cr;
  391. result.cond := flag_2_cond[f.flag];
  392. end;
  393. procedure create_cond_imm(BO,BI:byte;var r : TAsmCond);
  394. begin
  395. r.simple := false;
  396. r.bo := bo;
  397. r.bi := bi;
  398. end;
  399. procedure create_cond_norm(cond: TAsmCondFlag; cr: byte;var r : TasmCond);
  400. begin
  401. r.dirhint := DH_None;
  402. r.simple := true;
  403. r.cond := cond;
  404. case cond of
  405. C_NONE:;
  406. C_T..C_DZF: r.crbit := cr
  407. else r.cr := RS_CR0+cr;
  408. end;
  409. end;
  410. function is_condreg(r : tregister):boolean;
  411. var
  412. supreg: tsuperregister;
  413. begin
  414. result := false;
  415. if (getregtype(r) = R_SPECIALREGISTER) then
  416. begin
  417. supreg := getsupreg(r);
  418. result := (supreg >= RS_CR0) and (supreg <= RS_CR7);
  419. end;
  420. end;
  421. function reg_cgsize(const reg: tregister): tcgsize;
  422. begin
  423. case getregtype(reg) of
  424. R_INTREGISTER :
  425. result:=OS_32;
  426. R_MMREGISTER:
  427. result:=OS_M128;
  428. R_FPUREGISTER:
  429. result:=OS_F64;
  430. else
  431. internalerror(200303181);
  432. end;
  433. end;
  434. function cgsize2subreg(regtype: tregistertype; s:Tcgsize):Tsubregister;
  435. begin
  436. cgsize2subreg:=R_SUBWHOLE;
  437. end;
  438. function findreg_by_number(r:Tregister):tregisterindex;
  439. begin
  440. result:=rgBase.findreg_by_number_table(r,regnumber_index);
  441. end;
  442. function std_regnum_search(const s:string):Tregister;
  443. begin
  444. result:=regnumber_table[findreg_by_name_table(s,std_regname_table,std_regname_index)];
  445. end;
  446. function std_regname(r:Tregister):string;
  447. var
  448. p : tregisterindex;
  449. begin
  450. p:=findreg_by_number_table(r,regnumber_index);
  451. if p<>0 then
  452. result:=std_regname_table[p]
  453. else
  454. result:=generic_regname(r);
  455. end;
  456. function dwarf_reg(r:tregister):shortint;
  457. begin
  458. result:=regdwarf_table[findreg_by_number(r)];
  459. if result=-1 then
  460. internalerror(200603251);
  461. end;
  462. function dwarf_reg_no_error(r:tregister):shortint;
  463. begin
  464. result:=regdwarf_table[findreg_by_number(r)];
  465. end;
  466. function eh_return_data_regno(nr: longint): longint;
  467. begin
  468. if (nr>=0) and (nr<2) then
  469. result:=nr+3
  470. else
  471. result:=-1;
  472. end;
  473. end.