cgutils.pas 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608
  1. {
  2. Copyright (c) 1998-2004 by Florian Klaempfl
  3. Some basic types and constants for the code generation
  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 exports some helper routines which are used across the code generator }
  18. unit cgutils;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. globtype,
  23. cclasses,
  24. aasmbase,
  25. cpubase,cgbase;
  26. const
  27. {$ifdef MOS6502}
  28. { temporary hack, due to the lack of large sets support }
  29. maxcpuregister = 255;
  30. {$else MOS6502}
  31. { implementation of max function using only functionality that can be
  32. evaluated as a constant expression by the compiler -- this is
  33. basically maxcpureg = max(max(first_int_imreg,first_fpu_imreg),first_mm_imreg)-1 }
  34. tmpmaxcpufpuintreg = first_int_imreg + ((first_fpu_imreg - first_int_imreg) * ord(first_int_imreg < first_fpu_imreg));
  35. maxcpuregister = (tmpmaxcpufpuintreg + ((first_mm_imreg - tmpmaxcpufpuintreg) * ord(tmpmaxcpufpuintreg < first_mm_imreg)))-1;
  36. {$endif MOS6502}
  37. type
  38. { Set type definition for cpuregisters }
  39. tcpuregisterset = set of 0..maxcpuregister;
  40. tcpuregisterarray = array of tsuperregister;
  41. { use record for type-safety; should only be accessed directly by temp
  42. manager }
  43. treftemppos = record
  44. val: asizeint;
  45. end;
  46. {$packset 1}
  47. { a reference may be volatile for reading, writing, or both. E.g., local variables
  48. inside try-blocks are volatile for writes (writes must not be removed, because at
  49. any point an exception may be triggered and then all previous writes to the
  50. variable must have been performed), but not for reads (these variables' values
  51. won't be changed behind the back of the current code just because they're in a
  52. try-block) }
  53. tvolatility = (vol_read,vol_write);
  54. tvolatilityset = set of tvolatility;
  55. {$packset default}
  56. { reference record, reordered for best alignment }
  57. preference = ^treference;
  58. treference = record
  59. offset : asizeint;
  60. symbol,
  61. relsymbol : tasmsymbol;
  62. temppos : treftemppos;
  63. {$if defined(x86)}
  64. segment,
  65. {$endif defined(x86)}
  66. base,
  67. index : tregister;
  68. refaddr : trefaddr;
  69. scalefactor : byte;
  70. {$if defined(riscv32) or defined(riscv64)}
  71. symboldata : tlinkedlistitem;
  72. {$endif riscv32/64}
  73. {$ifdef arm}
  74. symboldata : tlinkedlistitem;
  75. signindex : shortint;
  76. shiftimm : byte;
  77. addressmode : taddressmode;
  78. shiftmode : tshiftmode;
  79. {$endif arm}
  80. {$ifdef aarch64}
  81. symboldata : tlinkedlistitem;
  82. shiftimm : byte;
  83. addressmode : taddressmode;
  84. shiftmode : tshiftmode;
  85. {$endif aarch64}
  86. {$ifdef avr}
  87. addressmode : taddressmode;
  88. {$endif avr}
  89. {$ifdef m68k}
  90. { indexed increment and decrement mode }
  91. { (An)+ and -(An) }
  92. direction : tdirection;
  93. {$endif m68k}
  94. {$ifdef jvm}
  95. arrayreftype: tarrayreftype;
  96. indexbase: tregister;
  97. indexsymbol: tasmsymbol;
  98. indexoffset: aint;
  99. checkcast: boolean;
  100. {$endif jvm}
  101. {$ifdef mos6502}
  102. addressmode : taddressmode;
  103. {$endif mos6502}
  104. volatility: tvolatilityset;
  105. alignment : byte;
  106. end;
  107. const
  108. ctempposinvalid: treftemppos = (val: low(treftemppos.val));
  109. type
  110. tsubsetregister = record
  111. subsetreg : tregister;
  112. startbit, bitlen: byte;
  113. subsetregsize: tcgsize;
  114. end;
  115. tsubsetreference = record
  116. ref: treference;
  117. bitindexreg: tregister;
  118. startbit, bitlen: byte;
  119. end;
  120. tlocation = record
  121. loc : TCGLoc;
  122. size : TCGSize;
  123. case TCGLoc of
  124. {$ifdef cpuflags}
  125. LOC_FLAGS : (resflags : tresflags);
  126. {$endif cpuflags}
  127. LOC_CONSTANT : (
  128. case longint of
  129. {$if defined(cpu64bitalu) or defined(cpuhighleveltarget)}
  130. 1 : (value : Int64);
  131. {$else cpu64bitalu or cpuhighleveltarget}
  132. {$ifdef FPC_BIG_ENDIAN}
  133. 1 : (_valuedummy,value : longint);
  134. {$else FPC_BIG_ENDIAN}
  135. 1 : (value : longint);
  136. {$endif FPC_BIG_ENDIAN}
  137. {$endif cpu64bitalu or cpuhighleveltarget}
  138. 2 : (value64 : Int64);
  139. );
  140. LOC_CREFERENCE,
  141. LOC_REFERENCE : (reference : treference);
  142. { segment in reference at the same place as in loc_register }
  143. LOC_REGISTER,
  144. LOC_CREGISTER : (
  145. case longint of
  146. 1 : (register : tregister;
  147. { some x86_64 targets require two function result registers }
  148. registerhi : tregister;
  149. {$ifdef m68k}
  150. { some m68k OSes require that the result is returned in d0 and a0
  151. the second location must be stored here }
  152. registeralias : tregister;
  153. {$endif m68k}
  154. );
  155. {$ifdef cpu64bitalu}
  156. { overlay a 128 Bit register type }
  157. 2 : (register128 : tregister128);
  158. {$else if not defined(cpuhighleveltarget}
  159. { overlay a 64 Bit register type }
  160. 2 : (register64 : tregister64);
  161. {$endif cpu64bitalu and not cpuhighleveltarget}
  162. );
  163. LOC_SUBSETREG,
  164. LOC_CSUBSETREG : (
  165. sreg: tsubsetregister;
  166. );
  167. LOC_SUBSETREF : (
  168. sref: tsubsetreference;
  169. );
  170. LOC_JUMP : (
  171. truelabel, falselabel: tasmlabel;
  172. );
  173. end;
  174. { trerefence handling }
  175. {# Clear to zero a treference }
  176. procedure reference_reset(var ref : treference; alignment: longint; volatility: tvolatilityset);
  177. {# Clear to zero a treference, and set is base address
  178. to base register.
  179. }
  180. procedure reference_reset_base(var ref: treference; base: tregister; offset: asizeint; temppos: treftemppos; alignment: longint; volatility: tvolatilityset);
  181. procedure reference_reset_symbol(var ref: treference;sym: tasmsymbol; offset: asizeint; alignment : longint; volatility: tvolatilityset);
  182. { This routine verifies if two references are the same, and
  183. if so, returns TRUE, otherwise returns false.
  184. }
  185. function references_equal(const sref,dref : treference) : boolean; {$ifdef USEINLINE}inline;{$endif USEINLINE}
  186. { tlocation handling }
  187. { cannot be used for loc_(c)reference, because that one requires an alignment }
  188. procedure location_reset(var l : tlocation;lt:TCGNonRefLoc;lsize:TCGSize);
  189. { for loc_(c)reference }
  190. procedure location_reset_ref(var l : tlocation;lt:TCGRefLoc;lsize:TCGSize; alignment: longint; volatility: tvolatilityset);
  191. { for loc_jump }
  192. procedure location_reset_jump(out l: tlocation; truelab, falselab: tasmlabel);
  193. procedure location_copy(var destloc:tlocation; const sourceloc : tlocation);
  194. procedure location_swap(var destloc,sourceloc : tlocation);
  195. function location_reg2string(const locreg: tlocation): string;
  196. { returns r with the given alignment }
  197. function setalignment(const r : treference;b : byte) : treference;
  198. { Helper function which calculate "magic" values for replacement of division
  199. by constant operation by multiplication. See the "PowerPC compiler developer
  200. manual" for more information.
  201. N is number of bits to handle, functionality tested for values 32 and 64. }
  202. procedure calc_divconst_magic_signed(N: byte; d: aInt; out magic_m: aInt; out magic_s: byte);
  203. procedure calc_divconst_magic_unsigned(N: byte; d: aWord; out magic_m: aWord; out magic_add: boolean; out magic_shift: byte);
  204. { Functions for calculating the multiplicative inverse, or reciprocal, of
  205. a divisor mod 2^N. That is, a number r such that dr = 1 (mod 2^N).
  206. WARNING: d must not be a power of 2 (including 2^0 = 1) }
  207. procedure calc_mul_inverse(N: byte; d: aWord; out reciprocal: aWord; out shift: Byte);
  208. { returns true if the CPU architecture we are currently compiling for needs
  209. software checks for fpu exceptions }
  210. function needs_check_for_fpu_exceptions : boolean;
  211. implementation
  212. uses
  213. systems,
  214. verbose,
  215. globals,
  216. cpuinfo,
  217. cgobj;
  218. {****************************************************************************
  219. TReference
  220. ****************************************************************************}
  221. procedure reference_reset(var ref: treference; alignment: longint; volatility: tvolatilityset);
  222. begin
  223. FillChar(ref,sizeof(treference),0);
  224. {$ifdef arm}
  225. ref.signindex:=1;
  226. {$endif arm}
  227. ref.alignment:=alignment;
  228. ref.volatility:=volatility;
  229. ref.temppos:=ctempposinvalid;
  230. end;
  231. procedure reference_reset_base(var ref: treference; base: tregister; offset: asizeint; temppos: treftemppos ; alignment: longint; volatility: tvolatilityset);
  232. begin
  233. reference_reset(ref,alignment,volatility);
  234. ref.base:=base;
  235. ref.offset:=offset;
  236. ref.temppos:=temppos;
  237. end;
  238. procedure reference_reset_symbol(var ref: treference; sym: tasmsymbol; offset: asizeint; alignment: longint; volatility: tvolatilityset);
  239. begin
  240. reference_reset(ref,alignment,volatility);
  241. ref.symbol:=sym;
  242. ref.offset:=offset;
  243. ref.temppos:=ctempposinvalid;
  244. end;
  245. function references_equal(const sref,dref : treference):boolean; {$ifdef USEINLINE}inline;{$endif USEINLINE}
  246. begin
  247. references_equal:=CompareByte(sref,dref,sizeof(treference))=0;
  248. end;
  249. { returns r with the given alignment }
  250. function setalignment(const r : treference;b : byte) : treference;
  251. begin
  252. result:=r;
  253. result.alignment:=b;
  254. end;
  255. {****************************************************************************
  256. TLocation
  257. ****************************************************************************}
  258. procedure location_reset(var l : tlocation;lt:TCGNonRefLoc;lsize:TCGSize);
  259. begin
  260. FillChar(l,sizeof(tlocation),0);
  261. l.loc:=lt;
  262. l.size:=lsize;
  263. if l.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_JUMP] then
  264. { call location_reset_ref/jump instead }
  265. internalerror(2009020705);
  266. end;
  267. procedure location_reset_ref(var l: tlocation; lt: TCGRefLoc; lsize: TCGSize; alignment: longint; volatility: tvolatilityset);
  268. begin
  269. FillChar(l,sizeof(tlocation),0);
  270. l.loc:=lt;
  271. l.size:=lsize;
  272. {$ifdef arm}
  273. l.reference.signindex:=1;
  274. {$endif arm}
  275. l.reference.alignment:=alignment;
  276. l.reference.volatility:=volatility;
  277. l.reference.temppos:=ctempposinvalid;
  278. end;
  279. procedure location_reset_jump(out l: tlocation; truelab, falselab: tasmlabel);
  280. begin
  281. FillChar(l,sizeof(tlocation),0);
  282. l.loc:=LOC_JUMP;
  283. l.size:=OS_NO;
  284. l.truelabel:=truelab;
  285. l.falselabel:=falselab;
  286. end;
  287. procedure location_copy(var destloc:tlocation; const sourceloc : tlocation);
  288. begin
  289. destloc:=sourceloc;
  290. end;
  291. procedure location_swap(var destloc,sourceloc : tlocation);
  292. var
  293. swapl : tlocation;
  294. begin
  295. swapl := destloc;
  296. destloc := sourceloc;
  297. sourceloc := swapl;
  298. end;
  299. function location_reg2string(const locreg: tlocation): string;
  300. begin
  301. if not (locreg.loc in [LOC_REGISTER,LOC_CREGISTER,
  302. LOC_MMXREGISTER,LOC_CMMXREGISTER,
  303. LOC_MMREGISTER,LOC_CMMREGISTER,
  304. LOC_FPUREGISTER,LOC_CFPUREGISTER]) then
  305. internalerror(2013122301);
  306. if locreg.loc in [LOC_REGISTER,LOC_CREGISTER] then
  307. begin
  308. case locreg.size of
  309. {$if defined(cpu64bitalu)}
  310. OS_128,OS_S128:
  311. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register);
  312. {$elseif defined(cpu32bitalu)}
  313. OS_64,OS_S64:
  314. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register);
  315. {$elseif defined(cpu16bitalu)}
  316. OS_64,OS_S64:
  317. if getsupreg(locreg.register)<first_int_imreg then
  318. result:='??:'+std_regname(locreg.registerhi)
  319. +':??:'+std_regname(locreg.register)
  320. else
  321. result:=std_regname(cg.GetNextReg(locreg.registerhi))+':'+std_regname(locreg.registerhi)
  322. +':'+std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  323. OS_32,OS_S32:
  324. if getsupreg(locreg.register)<first_int_imreg then
  325. result:='??:'+std_regname(locreg.register)
  326. else
  327. result:=std_regname(cg.GetNextReg(locreg.register))
  328. +':'+std_regname(locreg.register);
  329. {$elseif defined(cpu8bitalu)}
  330. OS_64,OS_S64:
  331. if getsupreg(locreg.register)<first_int_imreg then
  332. result:='??:??:??:'+std_regname(locreg.registerhi)
  333. +':??:??:??:'+std_regname(locreg.register)
  334. else
  335. result:=std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.registerhi))))
  336. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.registerhi)))
  337. +':'+std_regname(cg.GetNextReg(locreg.registerhi))
  338. +':'+std_regname(locreg.registerhi)
  339. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.register))))
  340. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.register)))
  341. +':'+std_regname(cg.GetNextReg(locreg.register))
  342. +':'+std_regname(locreg.register);
  343. OS_32,OS_S32:
  344. if getsupreg(locreg.register)<first_int_imreg then
  345. result:='??:??:??:'+std_regname(locreg.register)
  346. else
  347. result:=std_regname(cg.GetNextReg(cg.GetNextReg(cg.GetNextReg(locreg.register))))
  348. +':'+std_regname(cg.GetNextReg(cg.GetNextReg(locreg.register)))
  349. +':'+std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  350. OS_16,OS_S16:
  351. if getsupreg(locreg.register)<first_int_imreg then
  352. result:='??:'+std_regname(locreg.register)
  353. else
  354. result:=std_regname(cg.GetNextReg(locreg.register))+':'+std_regname(locreg.register);
  355. {$endif}
  356. else
  357. result:=std_regname(locreg.register);
  358. end;
  359. end
  360. else
  361. begin
  362. if locreg.registerhi<>NR_NO then
  363. result:=std_regname(locreg.registerhi)+':'+std_regname(locreg.register)
  364. else
  365. result:=std_regname(locreg.register);
  366. end;
  367. end;
  368. {$push}
  369. {$r-,q-}
  370. procedure calc_divconst_magic_signed(N: byte; d: aInt; out magic_m: aInt; out magic_s: byte);
  371. var
  372. p, sign_corrective_shift: aInt;
  373. ad,anc,delta,q1,r1,q2,r2,t: aWord;
  374. two_N_minus_1: aWord;
  375. begin
  376. if (d>=-1) and (d<=1) then
  377. { Division by unity, -1 or 0 should have been caught earlier }
  378. InternalError(2022081801);
  379. two_N_minus_1:=aWord(1) shl (N-1);
  380. ad:=abs(d);
  381. t:=two_N_minus_1+(aWord(d) shr (N-1));
  382. anc:=t-1-t mod ad; { absolute value of nc }
  383. p:=(N-1); { initialize p }
  384. q1:=two_N_minus_1 div anc; { initialize q1 = 2**p/abs(nc) }
  385. r1:=two_N_minus_1-q1*anc; { initialize r1 = rem(2**p,abs(nc)) }
  386. q2:=two_N_minus_1 div ad; { initialize q2 = 2**p/abs(d) }
  387. r2:=two_N_minus_1-q2*ad; { initialize r2 = rem(2**p,abs(d)) }
  388. repeat
  389. inc(p);
  390. q1:=2*q1; { update q1 = 2**p/abs(nc) }
  391. r1:=2*r1; { update r1 = rem(2**p/abs(nc)) }
  392. if (r1>=anc) then { must be unsigned comparison }
  393. begin
  394. inc(q1);
  395. dec(r1,anc);
  396. end;
  397. q2:=2*q2; { update q2 = 2p/abs(d) }
  398. r2:=2*r2; { update r2 = rem(2p/abs(d)) }
  399. if (r2>=ad) then { must be unsigned comparison }
  400. begin
  401. inc(q2);
  402. dec(r2,ad);
  403. end;
  404. delta:=ad-r2;
  405. until not ((q1<delta) or ((q1=delta) and (r1=0)));
  406. magic_m:=q2+1;
  407. { Sign-extend magic_m to the full size of aint - fixes #39834 }
  408. if N < (SizeOf(aint) * 8) then
  409. begin
  410. sign_corrective_shift := (SizeOf(aint) * 8) - N;
  411. magic_m := SarInt64(magic_m shl sign_corrective_shift, sign_corrective_shift);
  412. end;
  413. if (d<0) then
  414. magic_m:=-magic_m; { resulting magic number }
  415. magic_s:=p-N; { resulting shift }
  416. end;
  417. procedure calc_divconst_magic_unsigned(N: byte; d: aWord; out magic_m: aWord; out magic_add: boolean; out magic_shift: byte);
  418. var
  419. p: aInt;
  420. nc,delta,q1,r1,q2,r2,two_N_minus_1 : aWord;
  421. mask: aWord;
  422. begin
  423. two_N_minus_1:=aWord(1) shl (N-1);
  424. magic_add:=false;
  425. {$push}
  426. {$warnings off }
  427. mask:=aWord(not 0) shr ((64-N) and (sizeof(aWord)*8-1));
  428. nc:=(mask-(-d) mod aInt(d));
  429. {$pop}
  430. p:=N-1; { initialize p }
  431. q1:=two_N_minus_1 div nc; { initialize q1 = 2**p/nc }
  432. r1:=two_N_minus_1-q1*nc; { initialize r1 = rem(2**p,nc) }
  433. q2:=(two_N_minus_1-1) div d; { initialize q2 = (2**p-1)/d }
  434. r2:=(two_N_minus_1-1)-q2*d; { initialize r2 = rem((2**p-1),d) }
  435. repeat
  436. inc(p);
  437. if (r1>=(nc-r1)) then
  438. begin
  439. q1:=2*q1+1; { update q1 }
  440. r1:=2*r1-nc; { update r1 }
  441. end
  442. else
  443. begin
  444. q1:=2*q1; { update q1 }
  445. r1:=2*r1; { update r1 }
  446. end;
  447. if ((r2+1)>=(d-r2)) then
  448. begin
  449. if (q2>=(two_N_minus_1-1)) then
  450. magic_add:=true;
  451. q2:=2*q2+1; { update q2 }
  452. r2:=2*r2+1-d; { update r2 }
  453. end
  454. else
  455. begin
  456. if (q2>=two_N_minus_1) then
  457. magic_add:=true;
  458. q2:=2*q2; { update q2 }
  459. r2:=2*r2+1; { update r2 }
  460. end;
  461. delta:=d-1-r2;
  462. until not ((p<(2*N)) and ((q1<delta) or ((q1=delta) and (r1=0))));
  463. magic_m:=(q2+1) and mask; { resulting magic number }
  464. magic_shift:=p-N; { resulting shift }
  465. end;
  466. procedure calc_mul_inverse(N: byte; d: aWord; out reciprocal: aWord; out shift: Byte);
  467. var
  468. mask, oldr, newd, swap_r, swap_d, q: aWord;
  469. begin
  470. { WARNING: d must not be a power of 2 (including 2^0 = 1) }
  471. {$push}
  472. {$warnings off }
  473. if N=(SizeOf(aWord) * 8) then
  474. newd:=0
  475. else
  476. newd:=aWord(1) shl N; { Used later }
  477. mask:=newd-1;
  478. oldr:=mask;
  479. {$pop}
  480. { Trim off powers of 2 so d is an odd number }
  481. {$if defined(cpu64bitalu)}
  482. shift:=BsfQWord(d);
  483. {$elseif defined(cpu32bitalu)}
  484. shift:=BsfDWord(d);
  485. {$elseif defined(cpu16bitalu)}
  486. shift:=BsfWord(d);
  487. {$elseif defined(cpu8bitalu)}
  488. shift:=BsfByte(d);
  489. {$else}
  490. {$error ALU not defined}
  491. {$endif}
  492. if shift = 255 then
  493. { This is a divide by zero that should have been caught earlier }
  494. InternalError(2021091001);
  495. d := d shr shift;
  496. { Calculate reciprocal using the Extended Euclidean Algorithm as
  497. described on page 244 of Hacker's Delight, Second Edition.
  498. x1 = oldr
  499. x2 = reciprocal
  500. x3 = swap_r
  501. v1 = newd
  502. v2 = d
  503. v3 = swap_d
  504. }
  505. newd:=newd-d; { -d }
  506. reciprocal:=1;
  507. repeat
  508. q := newd div d;
  509. swap_d:=(newd-(q*d)) and mask;
  510. newd:=d;
  511. d:=swap_d;
  512. swap_r:=(oldr-(q*reciprocal)) and mask;
  513. oldr:=reciprocal;
  514. reciprocal:=swap_r;
  515. until d<=1;
  516. end;
  517. function needs_check_for_fpu_exceptions: boolean;
  518. begin
  519. {$if defined(AARCH64)}
  520. result:=cs_check_fpu_exceptions in current_settings.localswitches;
  521. {$elseif defined(ARM)}
  522. result:=(cs_check_fpu_exceptions in current_settings.localswitches) and
  523. not(FPUARM_HAS_EXCEPTION_TRAPPING in fpu_capabilities[current_settings.fputype]);
  524. {$elseif defined(RISCV)}
  525. result:=cs_check_fpu_exceptions in current_settings.localswitches;
  526. {$elseif defined(XTENSA)}
  527. result:=cs_check_fpu_exceptions in current_settings.localswitches;
  528. {$else}
  529. result:=false;
  530. {$endif}
  531. end;
  532. {$pop}
  533. end.