nmat.pas 32 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042
  1. {
  2. Copyright (c) 2000-2005 by Florian Klaempfl
  3. Type checking and register allocation for math nodes
  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. unit nmat;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. node;
  22. type
  23. tmoddivnode = class(tbinopnode)
  24. function pass_1 : tnode;override;
  25. function pass_typecheck:tnode;override;
  26. function simplify(forinline : boolean) : tnode;override;
  27. protected
  28. {$ifndef cpu64bitalu}
  29. { override the following if you want to implement }
  30. { parts explicitely in the code generator (JM) }
  31. function first_moddiv64bitint: tnode; virtual;
  32. {$endif not cpu64bitalu}
  33. function firstoptimize: tnode; virtual;
  34. function first_moddivint: tnode; virtual;
  35. end;
  36. tmoddivnodeclass = class of tmoddivnode;
  37. tshlshrnode = class(tbinopnode)
  38. function pass_1 : tnode;override;
  39. function pass_typecheck:tnode;override;
  40. function simplify(forinline : boolean) : tnode;override;
  41. {$ifndef cpu64bitalu}
  42. { override the following if you want to implement }
  43. { parts explicitely in the code generator (CEC)
  44. Should return nil, if everything will be handled
  45. in the code generator
  46. }
  47. function first_shlshr64bitint: tnode; virtual;
  48. {$endif not cpu64bitalu}
  49. end;
  50. tshlshrnodeclass = class of tshlshrnode;
  51. tunaryminusnode = class(tunarynode)
  52. constructor create(expr : tnode);virtual;
  53. function pass_1 : tnode;override;
  54. function pass_typecheck:tnode;override;
  55. function simplify(forinline : boolean) : tnode;override;
  56. end;
  57. tunaryminusnodeclass = class of tunaryminusnode;
  58. tunaryplusnode = class(tunarynode)
  59. constructor create(expr : tnode);virtual;
  60. function pass_1 : tnode;override;
  61. function pass_typecheck:tnode;override;
  62. end;
  63. tunaryplusnodeclass = class of tunaryplusnode;
  64. tnotnode = class(tunarynode)
  65. constructor create(expr : tnode);virtual;
  66. function pass_1 : tnode;override;
  67. function pass_typecheck:tnode;override;
  68. function simplify(forinline : boolean) : tnode;override;
  69. {$ifdef state_tracking}
  70. function track_state_pass(exec_known:boolean):boolean;override;
  71. {$endif}
  72. end;
  73. tnotnodeclass = class of tnotnode;
  74. var
  75. cmoddivnode : tmoddivnodeclass = tmoddivnode;
  76. cshlshrnode : tshlshrnodeclass = tshlshrnode;
  77. cunaryminusnode : tunaryminusnodeclass = tunaryminusnode;
  78. cunaryplusnode : tunaryplusnodeclass = tunaryplusnode;
  79. cnotnode : tnotnodeclass = tnotnode;
  80. implementation
  81. uses
  82. systems,
  83. verbose,globals,cutils,
  84. globtype,constexp,
  85. symconst,symtype,symdef,symtable,
  86. defutil,
  87. htypechk,pass_1,
  88. cgbase,
  89. ncon,ncnv,ncal,nadd,
  90. nutils;
  91. {****************************************************************************
  92. TMODDIVNODE
  93. ****************************************************************************}
  94. function tmoddivnode.simplify(forinline : boolean):tnode;
  95. var
  96. t : tnode;
  97. rv,lv : tconstexprint;
  98. begin
  99. result:=nil;
  100. if is_constintnode(right) then
  101. begin
  102. if tordconstnode(right).value = 1 then
  103. begin
  104. case nodetype of
  105. modn:
  106. result := cordconstnode.create(0,left.resultdef,true);
  107. divn:
  108. result := left.getcopy;
  109. end;
  110. exit;
  111. end;
  112. if tordconstnode(right).value = 0 then
  113. begin
  114. Message(parser_e_division_by_zero);
  115. { recover }
  116. tordconstnode(right).value := 1;
  117. end;
  118. end;
  119. if is_constintnode(right) and is_constintnode(left) then
  120. begin
  121. rv:=tordconstnode(right).value;
  122. lv:=tordconstnode(left).value;
  123. case nodetype of
  124. modn:
  125. t:=create_simplified_ord_const(lv mod rv,resultdef,forinline);
  126. divn:
  127. t:=create_simplified_ord_const(lv div rv,resultdef,forinline);
  128. end;
  129. result:=t;
  130. exit;
  131. end;
  132. end;
  133. function tmoddivnode.pass_typecheck:tnode;
  134. var
  135. hp,t : tnode;
  136. rd,ld : torddef;
  137. begin
  138. result:=nil;
  139. typecheckpass(left);
  140. typecheckpass(right);
  141. set_varstate(left,vs_read,[vsf_must_be_valid]);
  142. set_varstate(right,vs_read,[vsf_must_be_valid]);
  143. if codegenerror then
  144. exit;
  145. { tp procvar support }
  146. maybe_call_procvar(left,true);
  147. maybe_call_procvar(right,true);
  148. result:=simplify(false);
  149. if assigned(result) then
  150. exit;
  151. { allow operator overloading }
  152. t:=self;
  153. if isbinaryoverloaded(t) then
  154. begin
  155. result:=t;
  156. exit;
  157. end;
  158. { we need 2 orddefs always }
  159. if (left.resultdef.typ<>orddef) then
  160. inserttypeconv(right,sinttype);
  161. if (right.resultdef.typ<>orddef) then
  162. inserttypeconv(right,sinttype);
  163. if codegenerror then
  164. exit;
  165. rd:=torddef(right.resultdef);
  166. ld:=torddef(left.resultdef);
  167. { if one operand is a cardinal and the other is a positive constant, convert the }
  168. { constant to a cardinal as well so we don't have to do a 64bit division (JM) }
  169. { Do the same for qwords and positive constants as well, otherwise things like }
  170. { "qword mod 10" are evaluated with int64 as result, which is wrong if the }
  171. { "qword" was > high(int64) (JM) }
  172. { Additionally, do the same for cardinal/qwords and other positive types, but }
  173. { always in a way that a smaller type is converted to a bigger type }
  174. { (webtbs/tw8870) }
  175. if (rd.ordtype in [u32bit,u64bit]) and
  176. ((is_constintnode(left) and
  177. (tordconstnode(left).value >= 0)) or
  178. (not is_signed(ld) and
  179. (rd.size >= ld.size))) then
  180. begin
  181. inserttypeconv(left,right.resultdef);
  182. ld:=torddef(left.resultdef);
  183. end;
  184. if (ld.ordtype in [u32bit,u64bit]) and
  185. ((is_constintnode(right) and
  186. (tordconstnode(right).value >= 0)) or
  187. (not is_signed(rd) and
  188. (ld.size >= rd.size))) then
  189. begin
  190. inserttypeconv(right,left.resultdef);
  191. rd:=torddef(right.resultdef);
  192. end;
  193. { when there is one currency value, everything is done
  194. using currency }
  195. if (ld.ordtype=scurrency) or
  196. (rd.ordtype=scurrency) then
  197. begin
  198. if (ld.ordtype<>scurrency) then
  199. inserttypeconv(left,s64currencytype);
  200. if (rd.ordtype<>scurrency) then
  201. inserttypeconv(right,s64currencytype);
  202. resultdef:=left.resultdef;
  203. end
  204. else
  205. {$ifndef cpu64bitaddr}
  206. { when there is one 64bit value, everything is done
  207. in 64bit }
  208. if (is_64bitint(left.resultdef) or
  209. is_64bitint(right.resultdef)) then
  210. begin
  211. if is_signed(rd) or is_signed(ld) then
  212. begin
  213. if (ld.ordtype<>s64bit) then
  214. inserttypeconv(left,s64inttype);
  215. if (rd.ordtype<>s64bit) then
  216. inserttypeconv(right,s64inttype);
  217. end
  218. else
  219. begin
  220. if (ld.ordtype<>u64bit) then
  221. inserttypeconv(left,u64inttype);
  222. if (rd.ordtype<>u64bit) then
  223. inserttypeconv(right,u64inttype);
  224. end;
  225. resultdef:=left.resultdef;
  226. end
  227. else
  228. { when mixing cardinals and signed numbers, convert everythign to 64bit (JM) }
  229. if ((rd.ordtype = u32bit) and
  230. is_signed(ld)) or
  231. ((ld.ordtype = u32bit) and
  232. is_signed(rd)) then
  233. begin
  234. CGMessage(type_h_mixed_signed_unsigned);
  235. if (ld.ordtype<>s64bit) then
  236. inserttypeconv(left,s64inttype);
  237. if (rd.ordtype<>s64bit) then
  238. inserttypeconv(right,s64inttype);
  239. resultdef:=left.resultdef;
  240. end
  241. else
  242. {$endif not cpu64bitaddr}
  243. begin
  244. { Make everything always default singed int }
  245. if not(rd.ordtype in [torddef(sinttype).ordtype,torddef(uinttype).ordtype]) then
  246. inserttypeconv(right,sinttype);
  247. if not(ld.ordtype in [torddef(sinttype).ordtype,torddef(uinttype).ordtype]) then
  248. inserttypeconv(left,sinttype);
  249. resultdef:=right.resultdef;
  250. end;
  251. { when the result is currency we need some extra code for
  252. division. this should not be done when the divn node is
  253. created internally }
  254. if (nodetype=divn) and
  255. not(nf_is_currency in flags) and
  256. is_currency(resultdef) then
  257. begin
  258. hp:=caddnode.create(muln,getcopy,cordconstnode.create(10000,s64currencytype,false));
  259. include(hp.flags,nf_is_currency);
  260. result:=hp;
  261. end;
  262. end;
  263. function tmoddivnode.first_moddivint: tnode;
  264. {$ifdef cpuneedsdiv32helper}
  265. var
  266. procname: string[31];
  267. begin
  268. result := nil;
  269. { otherwise create a call to a helper }
  270. if nodetype = divn then
  271. procname := 'fpc_div_'
  272. else
  273. procname := 'fpc_mod_';
  274. { only qword needs the unsigned code, the
  275. signed code is also used for currency }
  276. if is_signed(resultdef) then
  277. procname := procname + 'longint'
  278. else
  279. procname := procname + 'dword';
  280. result := ccallnode.createintern(procname,ccallparanode.create(left,
  281. ccallparanode.create(right,nil)));
  282. left := nil;
  283. right := nil;
  284. firstpass(result);
  285. end;
  286. {$else cpuneedsdiv32helper}
  287. begin
  288. result:=nil;
  289. end;
  290. {$endif cpuneedsdiv32helper}
  291. {$ifndef cpu64bitalu}
  292. function tmoddivnode.first_moddiv64bitint: tnode;
  293. var
  294. procname: string[31];
  295. begin
  296. result := nil;
  297. { when currency is used set the result of the
  298. parameters to s64bit, so they are not converted }
  299. if is_currency(resultdef) then
  300. begin
  301. left.resultdef:=s64inttype;
  302. right.resultdef:=s64inttype;
  303. end;
  304. { otherwise create a call to a helper }
  305. if nodetype = divn then
  306. procname := 'fpc_div_'
  307. else
  308. procname := 'fpc_mod_';
  309. { only qword needs the unsigned code, the
  310. signed code is also used for currency }
  311. if is_signed(resultdef) then
  312. procname := procname + 'int64'
  313. else
  314. procname := procname + 'qword';
  315. result := ccallnode.createintern(procname,ccallparanode.create(left,
  316. ccallparanode.create(right,nil)));
  317. left := nil;
  318. right := nil;
  319. firstpass(result);
  320. end;
  321. {$endif not cpu64bitalu}
  322. function tmoddivnode.firstoptimize: tnode;
  323. var
  324. power{,shiftval} : longint;
  325. newtype: tnodetype;
  326. begin
  327. result := nil;
  328. { divide/mod a number by a constant which is a power of 2? }
  329. if (cs_opt_peephole in current_settings.optimizerswitches) and
  330. (right.nodetype = ordconstn) and
  331. { ((nodetype = divn) or
  332. not is_signed(resultdef)) and}
  333. (not is_signed(resultdef)) and
  334. ispowerof2(tordconstnode(right).value,power) then
  335. begin
  336. if nodetype = divn then
  337. begin
  338. (*
  339. if is_signed(resultdef) then
  340. begin
  341. if is_64bitint(left.resultdef) then
  342. if not (cs_opt_size in current_settings.optimizerswitches) then
  343. shiftval := 63
  344. else
  345. { the shift code is a lot bigger than the call to }
  346. { the divide helper }
  347. exit
  348. else
  349. shiftval := 31;
  350. { we reuse left twice, so create once a copy of it }
  351. { !!! if left is a call is -> call gets executed twice }
  352. left := caddnode.create(addn,left,
  353. caddnode.create(andn,
  354. cshlshrnode.create(sarn,left.getcopy,
  355. cordconstnode.create(shiftval,sinttype,false)),
  356. cordconstnode.create(tordconstnode(right).value-1,
  357. right.resultdef,false)));
  358. newtype := sarn;
  359. end
  360. else
  361. *)
  362. newtype := shrn;
  363. tordconstnode(right).value := power;
  364. result := cshlshrnode.create(newtype,left,right)
  365. end
  366. else
  367. begin
  368. dec(tordconstnode(right).value.uvalue);
  369. result := caddnode.create(andn,left,right);
  370. end;
  371. { left and right are reused }
  372. left := nil;
  373. right := nil;
  374. firstpass(result);
  375. exit;
  376. end;
  377. end;
  378. function tmoddivnode.pass_1 : tnode;
  379. begin
  380. result:=nil;
  381. firstpass(left);
  382. firstpass(right);
  383. if codegenerror then
  384. exit;
  385. { Try to optimize mod/div }
  386. result := firstoptimize;
  387. if assigned(result) then
  388. exit;
  389. {$ifndef cpu64bitalu}
  390. { 64bit }
  391. if (left.resultdef.typ=orddef) and
  392. (right.resultdef.typ=orddef) and
  393. (is_64bitint(left.resultdef) or is_64bitint(right.resultdef)) then
  394. begin
  395. result := first_moddiv64bitint;
  396. if assigned(result) then
  397. exit;
  398. expectloc:=LOC_REGISTER;
  399. end
  400. else
  401. {$endif not cpu64bitalu}
  402. begin
  403. result := first_moddivint;
  404. if assigned(result) then
  405. exit;
  406. end;
  407. expectloc:=LOC_REGISTER;
  408. end;
  409. {****************************************************************************
  410. TSHLSHRNODE
  411. ****************************************************************************}
  412. function tshlshrnode.simplify(forinline : boolean):tnode;
  413. var
  414. t : tnode;
  415. begin
  416. result:=nil;
  417. { constant folding }
  418. if is_constintnode(left) and is_constintnode(right) then
  419. begin
  420. case nodetype of
  421. shrn:
  422. t:=create_simplified_ord_const(tordconstnode(left).value shr tordconstnode(right).value,resultdef,forinline);
  423. shln:
  424. t:=create_simplified_ord_const(tordconstnode(left).value shl tordconstnode(right).value,resultdef,forinline);
  425. end;
  426. result:=t;
  427. exit;
  428. end;
  429. end;
  430. function tshlshrnode.pass_typecheck:tnode;
  431. var
  432. t : tnode;
  433. {$ifdef cpunodefaultint}
  434. nd : tdef;
  435. {$endif cpunodefaultint}
  436. begin
  437. result:=nil;
  438. typecheckpass(left);
  439. typecheckpass(right);
  440. set_varstate(right,vs_read,[vsf_must_be_valid]);
  441. set_varstate(left,vs_read,[vsf_must_be_valid]);
  442. if codegenerror then
  443. exit;
  444. { tp procvar support }
  445. maybe_call_procvar(left,true);
  446. maybe_call_procvar(right,true);
  447. result:=simplify(false);
  448. if assigned(result) then
  449. exit;
  450. { allow operator overloading }
  451. t:=self;
  452. if isbinaryoverloaded(t) then
  453. begin
  454. result:=t;
  455. exit;
  456. end;
  457. {$ifdef cpunodefaultint}
  458. { for small cpus we use the smallest common type }
  459. if (left.resultdef.typ=orddef) and (right.resultdef.typ=orddef) then
  460. nd:=get_common_intdef(torddef(left.resultdef),torddef(right.resultdef),false)
  461. else
  462. nd:=s32inttype;
  463. {$endif cpunodefaultint}
  464. { calculations for ordinals < 32 bit have to be done in
  465. 32 bit for backwards compatibility. That way 'shl 33' is
  466. the same as 'shl 1'. It's ugly but compatible with delphi/tp/gcc }
  467. if (not is_64bit(left.resultdef)) and
  468. (torddef(left.resultdef).ordtype<>u32bit) then
  469. begin
  470. { keep singness of orignal type }
  471. if is_signed(left.resultdef) then
  472. {$ifdef cpunodefaultint}
  473. inserttypeconv(left,nd)
  474. {$else cpunodefaultint}
  475. inserttypeconv(left,s32inttype)
  476. {$endif cpunodefaultint}
  477. else
  478. begin
  479. {$ifdef cpunodefaultint}
  480. inserttypeconv(left,nd)
  481. {$else cpunodefaultint}
  482. inserttypeconv(left,u32inttype);
  483. {$endif cpunodefaultint}
  484. end
  485. end;
  486. {$ifdef cpunodefaultint}
  487. inserttypeconv(right,nd);
  488. {$else cpunodefaultint}
  489. inserttypeconv(right,sinttype);
  490. {$endif cpunodefaultint}
  491. resultdef:=left.resultdef;
  492. end;
  493. {$ifndef cpu64bitalu}
  494. function tshlshrnode.first_shlshr64bitint: tnode;
  495. var
  496. procname: string[31];
  497. begin
  498. result := nil;
  499. { otherwise create a call to a helper }
  500. if nodetype = shln then
  501. procname := 'fpc_shl_int64'
  502. else
  503. procname := 'fpc_shr_int64';
  504. { this order of parameters works at least for the arm,
  505. however it should work for any calling conventions (FK) }
  506. result := ccallnode.createintern(procname,ccallparanode.create(right,
  507. ccallparanode.create(left,nil)));
  508. left := nil;
  509. right := nil;
  510. firstpass(result);
  511. end;
  512. {$endif not cpu64bitalu}
  513. function tshlshrnode.pass_1 : tnode;
  514. var
  515. regs : longint;
  516. begin
  517. result:=nil;
  518. firstpass(left);
  519. firstpass(right);
  520. if codegenerror then
  521. exit;
  522. {$ifndef cpu64bitalu}
  523. { 64 bit ints have their own shift handling }
  524. if is_64bit(left.resultdef) then
  525. begin
  526. result := first_shlshr64bitint;
  527. if assigned(result) then
  528. exit;
  529. regs:=2;
  530. end
  531. else
  532. {$endif not cpu64bitalu}
  533. begin
  534. regs:=1
  535. end;
  536. if (right.nodetype<>ordconstn) then
  537. inc(regs);
  538. expectloc:=LOC_REGISTER;
  539. end;
  540. {****************************************************************************
  541. TUNARYMINUSNODE
  542. ****************************************************************************}
  543. constructor tunaryminusnode.create(expr : tnode);
  544. begin
  545. inherited create(unaryminusn,expr);
  546. end;
  547. function tunaryminusnode.simplify(forinline : boolean):tnode;
  548. begin
  549. result:=nil;
  550. { constant folding }
  551. if is_constintnode(left) then
  552. begin
  553. result:=create_simplified_ord_const(-tordconstnode(left).value,resultdef,forinline);
  554. exit;
  555. end;
  556. if is_constrealnode(left) then
  557. begin
  558. trealconstnode(left).value_real:=-trealconstnode(left).value_real;
  559. trealconstnode(left).value_currency:=-trealconstnode(left).value_currency;
  560. result:=left;
  561. left:=nil;
  562. exit;
  563. end;
  564. end;
  565. function tunaryminusnode.pass_typecheck : tnode;
  566. var
  567. t : tnode;
  568. begin
  569. result:=nil;
  570. typecheckpass(left);
  571. set_varstate(left,vs_read,[vsf_must_be_valid]);
  572. if codegenerror then
  573. exit;
  574. result:=simplify(false);
  575. if assigned(result) then
  576. exit;
  577. resultdef:=left.resultdef;
  578. if (left.resultdef.typ=floatdef) or
  579. is_currency(left.resultdef) then
  580. begin
  581. end
  582. {$ifdef SUPPORT_MMX}
  583. else if (cs_mmx in current_settings.localswitches) and
  584. is_mmx_able_array(left.resultdef) then
  585. begin
  586. { if saturation is on, left.resultdef isn't
  587. "mmx able" (FK)
  588. if (cs_mmx_saturation in current_settings.localswitches^) and
  589. (torddef(tarraydef(resultdef).definition).typ in
  590. [s32bit,u32bit]) then
  591. CGMessage(type_e_mismatch);
  592. }
  593. end
  594. {$endif SUPPORT_MMX}
  595. {$ifndef cpu64bitaddr}
  596. else if is_64bit(left.resultdef) then
  597. begin
  598. inserttypeconv(left,s64inttype);
  599. resultdef:=left.resultdef
  600. end
  601. {$endif not cpu64bitaddr}
  602. else if (left.resultdef.typ=orddef) then
  603. begin
  604. inserttypeconv(left,sinttype);
  605. resultdef:=left.resultdef
  606. end
  607. else
  608. begin
  609. { allow operator overloading }
  610. t:=self;
  611. if isunaryoverloaded(t) then
  612. begin
  613. result:=t;
  614. exit;
  615. end;
  616. CGMessage(type_e_mismatch);
  617. end;
  618. end;
  619. { generic code }
  620. { overridden by: }
  621. { i386 }
  622. function tunaryminusnode.pass_1 : tnode;
  623. var
  624. procname: string[31];
  625. fdef : tdef;
  626. begin
  627. result:=nil;
  628. firstpass(left);
  629. if codegenerror then
  630. exit;
  631. if (cs_fp_emulation in current_settings.moduleswitches) and (left.resultdef.typ=floatdef) then
  632. begin
  633. if not(target_info.system in systems_wince) then
  634. begin
  635. case tfloatdef(resultdef).floattype of
  636. s32real:
  637. begin
  638. procname:='float32_sub';
  639. fdef:=search_system_type('FLOAT32REC').typedef;
  640. end;
  641. s64real:
  642. begin
  643. procname:='float64_sub';
  644. fdef:=search_system_type('FLOAT64').typedef;
  645. end;
  646. {!!! not yet implemented
  647. s128real:
  648. }
  649. else
  650. internalerror(2005082801);
  651. end;
  652. result:=ctypeconvnode.create_internal(ccallnode.createintern(procname,ccallparanode.create(
  653. ctypeconvnode.create_internal(left,fDef),
  654. ccallparanode.create(ctypeconvnode.create_internal(crealconstnode.create(0,resultdef),fdef),nil))),resultdef);
  655. end
  656. else
  657. begin
  658. case tfloatdef(resultdef).floattype of
  659. s32real:
  660. procname:='NEGS';
  661. s64real:
  662. procname:='NEGD';
  663. {!!! not yet implemented
  664. s128real:
  665. }
  666. else
  667. internalerror(2005082802);
  668. end;
  669. result:=ccallnode.createintern(procname,ccallparanode.create(left,nil));
  670. end;
  671. left:=nil;
  672. end
  673. else
  674. begin
  675. if (left.resultdef.typ=floatdef) then
  676. expectloc:=LOC_FPUREGISTER
  677. {$ifdef SUPPORT_MMX}
  678. else if (cs_mmx in current_settings.localswitches) and
  679. is_mmx_able_array(left.resultdef) then
  680. expectloc:=LOC_MMXREGISTER
  681. {$endif SUPPORT_MMX}
  682. else if (left.resultdef.typ=orddef) then
  683. expectloc:=LOC_REGISTER;
  684. end;
  685. end;
  686. {****************************************************************************
  687. TUNARYPLUSNODE
  688. ****************************************************************************}
  689. constructor tunaryplusnode.create(expr: tnode);
  690. begin
  691. inherited create(unaryplusn,expr);
  692. end;
  693. function tunaryplusnode.pass_1: tnode;
  694. begin
  695. result:=nil;
  696. { can never happen because all the conversions happen
  697. in pass_typecheck }
  698. internalerror(201012250);
  699. end;
  700. function tunaryplusnode.pass_typecheck: tnode;
  701. var
  702. t:tnode;
  703. begin
  704. result:=nil;
  705. typecheckpass(left);
  706. set_varstate(left,vs_read,[vsf_must_be_valid]);
  707. if codegenerror then
  708. exit;
  709. if is_constintnode(left) or
  710. is_constrealnode(left) or
  711. (left.resultdef.typ=floatdef) or
  712. is_currency(left.resultdef)
  713. {$ifdef SUPPORT_MMX}
  714. or ((cs_mmx in current_settings.localswitches) and
  715. is_mmx_able_array(left.resultdef))
  716. {$endif SUPPORT_MMX}
  717. then
  718. begin
  719. result:=left;
  720. left:=nil;
  721. end
  722. {$ifndef cpu64bitaddr}
  723. else if is_64bit(left.resultdef) then
  724. begin
  725. inserttypeconv(left,s64inttype);
  726. result:=left;
  727. left:=nil;
  728. end
  729. {$endif not cpu64bitaddr}
  730. else if (left.resultdef.typ=orddef) then
  731. begin
  732. inserttypeconv(left,sinttype);
  733. result:=left;
  734. left:=nil;
  735. end
  736. else
  737. begin
  738. { allow operator overloading }
  739. t:=self;
  740. if isunaryoverloaded(t) then
  741. begin
  742. result:=t;
  743. exit;
  744. end;
  745. CGMessage(type_e_mismatch);
  746. end;
  747. end;
  748. {****************************************************************************
  749. TNOTNODE
  750. ****************************************************************************}
  751. const
  752. boolean_reverse:array[ltn..unequaln] of Tnodetype=(
  753. gten,gtn,lten,ltn,unequaln,equaln
  754. );
  755. constructor tnotnode.create(expr : tnode);
  756. begin
  757. inherited create(notn,expr);
  758. end;
  759. function tnotnode.simplify(forinline : boolean):tnode;
  760. var
  761. v : tconstexprint;
  762. t : tnode;
  763. def : tdef;
  764. begin
  765. result:=nil;
  766. { Try optmimizing ourself away }
  767. if left.nodetype=notn then
  768. begin
  769. { Double not. Remove both }
  770. result:=Tnotnode(left).left;
  771. tnotnode(left).left:=nil;
  772. exit;
  773. end;
  774. if (left.nodetype in [ltn,lten,equaln,unequaln,gtn,gten]) then
  775. begin
  776. { Not of boolean expression. Turn around the operator and remove
  777. the not. This is not allowed for sets with the gten/lten,
  778. because there is no ltn/gtn support }
  779. if (taddnode(left).left.resultdef.typ<>setdef) or
  780. (left.nodetype in [equaln,unequaln]) then
  781. begin
  782. result:=left;
  783. left.nodetype:=boolean_reverse[left.nodetype];
  784. left:=nil;
  785. exit;
  786. end;
  787. end;
  788. { constant folding }
  789. if (left.nodetype=ordconstn) then
  790. begin
  791. v:=tordconstnode(left).value;
  792. def:=left.resultdef;
  793. case torddef(left.resultdef).ordtype of
  794. pasbool,
  795. bool8bit,
  796. bool16bit,
  797. bool32bit,
  798. bool64bit:
  799. begin
  800. v:=byte(not(boolean(int64(v))));
  801. if (torddef(left.resultdef).ordtype<>pasbool) then
  802. v:=-v;
  803. end;
  804. uchar,
  805. uwidechar,
  806. u8bit,
  807. s8bit,
  808. u16bit,
  809. s16bit,
  810. s32bit,
  811. {$ifdef cpu64bitaddr}
  812. u32bit,
  813. {$endif cpu64bitaddr}
  814. s64bit:
  815. begin
  816. v:=int64(not int64(v));
  817. if (torddef(left.resultdef).ordtype<>s64bit) then
  818. def:=sinttype
  819. else
  820. def:=s64inttype;
  821. end;
  822. {$ifndef cpu64bitaddr}
  823. u32bit,
  824. {$endif not cpu64bitaddr}
  825. u64bit :
  826. begin
  827. { Delphi-compatible: not dword = dword (not word = longint) }
  828. { Extension: not qword = qword }
  829. v:=qword(not qword(v));
  830. { will be truncated by the ordconstnode for u32bit }
  831. end;
  832. else
  833. CGMessage(type_e_mismatch);
  834. end;
  835. if not forinline then
  836. t:=cordconstnode.create(v,def,false)
  837. else
  838. t:=create_simplified_ord_const(v,resultdef,true);
  839. result:=t;
  840. exit;
  841. end;
  842. end;
  843. function tnotnode.pass_typecheck : tnode;
  844. var
  845. t : tnode;
  846. begin
  847. result:=nil;
  848. typecheckpass(left);
  849. set_varstate(left,vs_read,[vsf_must_be_valid]);
  850. if codegenerror then
  851. exit;
  852. { tp procvar support }
  853. maybe_call_procvar(left,true);
  854. resultdef:=left.resultdef;
  855. result:=simplify(false);
  856. if assigned(result) then
  857. exit;
  858. if is_boolean(resultdef) then
  859. begin
  860. end
  861. else
  862. {$ifdef SUPPORT_MMX}
  863. if (cs_mmx in current_settings.localswitches) and
  864. is_mmx_able_array(left.resultdef) then
  865. begin
  866. end
  867. else
  868. {$endif SUPPORT_MMX}
  869. {$ifndef cpu64bitaddr}
  870. if is_64bitint(left.resultdef) then
  871. begin
  872. end
  873. else
  874. {$endif not cpu64bitaddr}
  875. if is_integer(left.resultdef) then
  876. begin
  877. end
  878. else
  879. begin
  880. { allow operator overloading }
  881. t:=self;
  882. if isunaryoverloaded(t) then
  883. begin
  884. result:=t;
  885. exit;
  886. end;
  887. CGMessage(type_e_mismatch);
  888. end;
  889. end;
  890. function tnotnode.pass_1 : tnode;
  891. begin
  892. result:=nil;
  893. firstpass(left);
  894. if codegenerror then
  895. exit;
  896. expectloc:=left.expectloc;
  897. if is_boolean(resultdef) then
  898. begin
  899. if (expectloc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  900. expectloc:=LOC_REGISTER;
  901. { before loading it into flags we need to load it into
  902. a register thus 1 register is need PM }
  903. {$ifdef cpuflags}
  904. if left.expectloc<>LOC_JUMP then
  905. expectloc:=LOC_FLAGS;
  906. {$endif def cpuflags}
  907. end
  908. else
  909. {$ifdef SUPPORT_MMX}
  910. if (cs_mmx in current_settings.localswitches) and
  911. is_mmx_able_array(left.resultdef) then
  912. expectloc:=LOC_MMXREGISTER
  913. else
  914. {$endif SUPPORT_MMX}
  915. {$ifndef cpu64bitalu}
  916. if is_64bit(left.resultdef) then
  917. begin
  918. if (expectloc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  919. expectloc:=LOC_REGISTER;
  920. end
  921. else
  922. {$endif not cpu64bitalu}
  923. if is_integer(left.resultdef) then
  924. expectloc:=LOC_REGISTER;
  925. end;
  926. {$ifdef state_tracking}
  927. function Tnotnode.track_state_pass(exec_known:boolean):boolean;
  928. begin
  929. track_state_pass:=true;
  930. if left.track_state_pass(exec_known) then
  931. begin
  932. left.resultdef:=nil;
  933. do_typecheckpass(left);
  934. end;
  935. end;
  936. {$endif}
  937. end.