nmat.pas 31 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016
  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. begin
  434. result:=nil;
  435. typecheckpass(left);
  436. typecheckpass(right);
  437. set_varstate(right,vs_read,[vsf_must_be_valid]);
  438. set_varstate(left,vs_read,[vsf_must_be_valid]);
  439. if codegenerror then
  440. exit;
  441. { tp procvar support }
  442. maybe_call_procvar(left,true);
  443. maybe_call_procvar(right,true);
  444. result:=simplify(false);
  445. if assigned(result) then
  446. exit;
  447. { allow operator overloading }
  448. t:=self;
  449. if isbinaryoverloaded(t) then
  450. begin
  451. result:=t;
  452. exit;
  453. end;
  454. { calculations for ordinals < 32 bit have to be done in
  455. 32 bit for backwards compatibility. That way 'shl 33' is
  456. the same as 'shl 1'. It's ugly but compatible with delphi/tp/gcc }
  457. if (not is_64bit(left.resultdef)) and
  458. (torddef(left.resultdef).ordtype<>u32bit) then
  459. begin
  460. { keep singness of orignal type }
  461. if is_signed(left.resultdef) then
  462. inserttypeconv(left,s32inttype)
  463. else
  464. inserttypeconv(left,u32inttype);
  465. end;
  466. inserttypeconv(right,sinttype);
  467. resultdef:=left.resultdef;
  468. end;
  469. {$ifndef cpu64bitalu}
  470. function tshlshrnode.first_shlshr64bitint: tnode;
  471. var
  472. procname: string[31];
  473. begin
  474. result := nil;
  475. { otherwise create a call to a helper }
  476. if nodetype = shln then
  477. procname := 'fpc_shl_int64'
  478. else
  479. procname := 'fpc_shr_int64';
  480. { this order of parameters works at least for the arm,
  481. however it should work for any calling conventions (FK) }
  482. result := ccallnode.createintern(procname,ccallparanode.create(right,
  483. ccallparanode.create(left,nil)));
  484. left := nil;
  485. right := nil;
  486. firstpass(result);
  487. end;
  488. {$endif not cpu64bitalu}
  489. function tshlshrnode.pass_1 : tnode;
  490. var
  491. regs : longint;
  492. begin
  493. result:=nil;
  494. firstpass(left);
  495. firstpass(right);
  496. if codegenerror then
  497. exit;
  498. {$ifndef cpu64bitalu}
  499. { 64 bit ints have their own shift handling }
  500. if is_64bit(left.resultdef) then
  501. begin
  502. result := first_shlshr64bitint;
  503. if assigned(result) then
  504. exit;
  505. regs:=2;
  506. end
  507. else
  508. {$endif not cpu64bitalu}
  509. begin
  510. regs:=1
  511. end;
  512. if (right.nodetype<>ordconstn) then
  513. inc(regs);
  514. expectloc:=LOC_REGISTER;
  515. end;
  516. {****************************************************************************
  517. TUNARYMINUSNODE
  518. ****************************************************************************}
  519. constructor tunaryminusnode.create(expr : tnode);
  520. begin
  521. inherited create(unaryminusn,expr);
  522. end;
  523. function tunaryminusnode.simplify(forinline : boolean):tnode;
  524. begin
  525. result:=nil;
  526. { constant folding }
  527. if is_constintnode(left) then
  528. begin
  529. result:=create_simplified_ord_const(-tordconstnode(left).value,resultdef,forinline);
  530. exit;
  531. end;
  532. if is_constrealnode(left) then
  533. begin
  534. trealconstnode(left).value_real:=-trealconstnode(left).value_real;
  535. trealconstnode(left).value_currency:=-trealconstnode(left).value_currency;
  536. result:=left;
  537. left:=nil;
  538. exit;
  539. end;
  540. end;
  541. function tunaryminusnode.pass_typecheck : tnode;
  542. var
  543. t : tnode;
  544. begin
  545. result:=nil;
  546. typecheckpass(left);
  547. set_varstate(left,vs_read,[vsf_must_be_valid]);
  548. if codegenerror then
  549. exit;
  550. result:=simplify(false);
  551. if assigned(result) then
  552. exit;
  553. resultdef:=left.resultdef;
  554. if (left.resultdef.typ=floatdef) or
  555. is_currency(left.resultdef) then
  556. begin
  557. end
  558. {$ifdef SUPPORT_MMX}
  559. else if (cs_mmx in current_settings.localswitches) and
  560. is_mmx_able_array(left.resultdef) then
  561. begin
  562. { if saturation is on, left.resultdef isn't
  563. "mmx able" (FK)
  564. if (cs_mmx_saturation in current_settings.localswitches^) and
  565. (torddef(tarraydef(resultdef).definition).typ in
  566. [s32bit,u32bit]) then
  567. CGMessage(type_e_mismatch);
  568. }
  569. end
  570. {$endif SUPPORT_MMX}
  571. {$ifndef cpu64bitaddr}
  572. else if is_64bit(left.resultdef) then
  573. begin
  574. inserttypeconv(left,s64inttype);
  575. resultdef:=left.resultdef
  576. end
  577. {$endif not cpu64bitaddr}
  578. else if (left.resultdef.typ=orddef) then
  579. begin
  580. inserttypeconv(left,sinttype);
  581. resultdef:=left.resultdef
  582. end
  583. else
  584. begin
  585. { allow operator overloading }
  586. t:=self;
  587. if isunaryoverloaded(t) then
  588. begin
  589. result:=t;
  590. exit;
  591. end;
  592. CGMessage(type_e_mismatch);
  593. end;
  594. end;
  595. { generic code }
  596. { overridden by: }
  597. { i386 }
  598. function tunaryminusnode.pass_1 : tnode;
  599. var
  600. procname: string[31];
  601. fdef : tdef;
  602. begin
  603. result:=nil;
  604. firstpass(left);
  605. if codegenerror then
  606. exit;
  607. if (cs_fp_emulation in current_settings.moduleswitches) and (left.resultdef.typ=floatdef) then
  608. begin
  609. if not(target_info.system in systems_wince) then
  610. begin
  611. case tfloatdef(resultdef).floattype of
  612. s32real:
  613. begin
  614. procname:='float32_sub';
  615. fdef:=search_system_type('FLOAT32REC').typedef;
  616. end;
  617. s64real:
  618. begin
  619. procname:='float64_sub';
  620. fdef:=search_system_type('FLOAT64').typedef;
  621. end;
  622. {!!! not yet implemented
  623. s128real:
  624. }
  625. else
  626. internalerror(2005082801);
  627. end;
  628. result:=ctypeconvnode.create_internal(ccallnode.createintern(procname,ccallparanode.create(
  629. ctypeconvnode.create_internal(left,fDef),
  630. ccallparanode.create(ctypeconvnode.create_internal(crealconstnode.create(0,resultdef),fdef),nil))),resultdef);
  631. end
  632. else
  633. begin
  634. case tfloatdef(resultdef).floattype of
  635. s32real:
  636. procname:='NEGS';
  637. s64real:
  638. procname:='NEGD';
  639. {!!! not yet implemented
  640. s128real:
  641. }
  642. else
  643. internalerror(2005082802);
  644. end;
  645. result:=ccallnode.createintern(procname,ccallparanode.create(left,nil));
  646. end;
  647. left:=nil;
  648. end
  649. else
  650. begin
  651. if (left.resultdef.typ=floatdef) then
  652. expectloc:=LOC_FPUREGISTER
  653. {$ifdef SUPPORT_MMX}
  654. else if (cs_mmx in current_settings.localswitches) and
  655. is_mmx_able_array(left.resultdef) then
  656. expectloc:=LOC_MMXREGISTER
  657. {$endif SUPPORT_MMX}
  658. else if (left.resultdef.typ=orddef) then
  659. expectloc:=LOC_REGISTER;
  660. end;
  661. end;
  662. {****************************************************************************
  663. TUNARYPLUSNODE
  664. ****************************************************************************}
  665. constructor tunaryplusnode.create(expr: tnode);
  666. begin
  667. inherited create(unaryplusn,expr);
  668. end;
  669. function tunaryplusnode.pass_1: tnode;
  670. begin
  671. { can never happen because all the conversions happen
  672. in pass_typecheck }
  673. internalerror(201012250);
  674. end;
  675. function tunaryplusnode.pass_typecheck: tnode;
  676. var
  677. t:tnode;
  678. begin
  679. result:=nil;
  680. typecheckpass(left);
  681. set_varstate(left,vs_read,[vsf_must_be_valid]);
  682. if codegenerror then
  683. exit;
  684. if is_constintnode(left) or
  685. is_constrealnode(left) or
  686. (left.resultdef.typ=floatdef) or
  687. is_currency(left.resultdef)
  688. {$ifdef SUPPORT_MMX}
  689. or ((cs_mmx in current_settings.localswitches) and
  690. is_mmx_able_array(left.resultdef))
  691. {$endif SUPPORT_MMX}
  692. then
  693. begin
  694. result:=left;
  695. left:=nil;
  696. end
  697. {$ifndef cpu64bitaddr}
  698. else if is_64bit(left.resultdef) then
  699. begin
  700. inserttypeconv(left,s64inttype);
  701. result:=left;
  702. left:=nil;
  703. end
  704. {$endif not cpu64bitaddr}
  705. else if (left.resultdef.typ=orddef) then
  706. begin
  707. inserttypeconv(left,sinttype);
  708. result:=left;
  709. left:=nil;
  710. end
  711. else
  712. begin
  713. { allow operator overloading }
  714. t:=self;
  715. if isunaryoverloaded(t) then
  716. begin
  717. result:=t;
  718. exit;
  719. end;
  720. CGMessage(type_e_mismatch);
  721. end;
  722. end;
  723. {****************************************************************************
  724. TNOTNODE
  725. ****************************************************************************}
  726. const
  727. boolean_reverse:array[ltn..unequaln] of Tnodetype=(
  728. gten,gtn,lten,ltn,unequaln,equaln
  729. );
  730. constructor tnotnode.create(expr : tnode);
  731. begin
  732. inherited create(notn,expr);
  733. end;
  734. function tnotnode.simplify(forinline : boolean):tnode;
  735. var
  736. v : tconstexprint;
  737. t : tnode;
  738. def : tdef;
  739. begin
  740. result:=nil;
  741. { Try optmimizing ourself away }
  742. if left.nodetype=notn then
  743. begin
  744. { Double not. Remove both }
  745. result:=Tnotnode(left).left;
  746. tnotnode(left).left:=nil;
  747. exit;
  748. end;
  749. if (left.nodetype in [ltn,lten,equaln,unequaln,gtn,gten]) then
  750. begin
  751. { Not of boolean expression. Turn around the operator and remove
  752. the not. This is not allowed for sets with the gten/lten,
  753. because there is no ltn/gtn support }
  754. if (taddnode(left).left.resultdef.typ<>setdef) or
  755. (left.nodetype in [equaln,unequaln]) then
  756. begin
  757. result:=left;
  758. left.nodetype:=boolean_reverse[left.nodetype];
  759. left:=nil;
  760. exit;
  761. end;
  762. end;
  763. { constant folding }
  764. if (left.nodetype=ordconstn) then
  765. begin
  766. v:=tordconstnode(left).value;
  767. def:=left.resultdef;
  768. case torddef(left.resultdef).ordtype of
  769. pasbool,
  770. bool8bit,
  771. bool16bit,
  772. bool32bit,
  773. bool64bit:
  774. begin
  775. v:=byte(not(boolean(int64(v))));
  776. if (torddef(left.resultdef).ordtype<>pasbool) then
  777. v:=-v;
  778. end;
  779. uchar,
  780. uwidechar,
  781. u8bit,
  782. s8bit,
  783. u16bit,
  784. s16bit,
  785. s32bit,
  786. {$ifdef cpu64bitaddr}
  787. u32bit,
  788. {$endif cpu64bitaddr}
  789. s64bit:
  790. begin
  791. v:=int64(not int64(v));
  792. if (torddef(left.resultdef).ordtype<>s64bit) then
  793. def:=sinttype
  794. else
  795. def:=s64inttype;
  796. end;
  797. {$ifndef cpu64bitaddr}
  798. u32bit,
  799. {$endif not cpu64bitaddr}
  800. u64bit :
  801. begin
  802. { Delphi-compatible: not dword = dword (not word = longint) }
  803. { Extension: not qword = qword }
  804. v:=qword(not qword(v));
  805. { will be truncated by the ordconstnode for u32bit }
  806. end;
  807. else
  808. CGMessage(type_e_mismatch);
  809. end;
  810. if not forinline then
  811. t:=cordconstnode.create(v,def,false)
  812. else
  813. t:=create_simplified_ord_const(v,resultdef,true);
  814. result:=t;
  815. exit;
  816. end;
  817. end;
  818. function tnotnode.pass_typecheck : tnode;
  819. var
  820. t : tnode;
  821. begin
  822. result:=nil;
  823. typecheckpass(left);
  824. set_varstate(left,vs_read,[vsf_must_be_valid]);
  825. if codegenerror then
  826. exit;
  827. { tp procvar support }
  828. maybe_call_procvar(left,true);
  829. resultdef:=left.resultdef;
  830. result:=simplify(false);
  831. if assigned(result) then
  832. exit;
  833. if is_boolean(resultdef) then
  834. begin
  835. end
  836. else
  837. {$ifdef SUPPORT_MMX}
  838. if (cs_mmx in current_settings.localswitches) and
  839. is_mmx_able_array(left.resultdef) then
  840. begin
  841. end
  842. else
  843. {$endif SUPPORT_MMX}
  844. {$ifndef cpu64bitaddr}
  845. if is_64bitint(left.resultdef) then
  846. begin
  847. end
  848. else
  849. {$endif not cpu64bitaddr}
  850. if is_integer(left.resultdef) then
  851. begin
  852. end
  853. else
  854. begin
  855. { allow operator overloading }
  856. t:=self;
  857. if isunaryoverloaded(t) then
  858. begin
  859. result:=t;
  860. exit;
  861. end;
  862. CGMessage(type_e_mismatch);
  863. end;
  864. end;
  865. function tnotnode.pass_1 : tnode;
  866. begin
  867. result:=nil;
  868. firstpass(left);
  869. if codegenerror then
  870. exit;
  871. expectloc:=left.expectloc;
  872. if is_boolean(resultdef) then
  873. begin
  874. if (expectloc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  875. expectloc:=LOC_REGISTER;
  876. { before loading it into flags we need to load it into
  877. a register thus 1 register is need PM }
  878. {$ifdef cpuflags}
  879. if left.expectloc<>LOC_JUMP then
  880. expectloc:=LOC_FLAGS;
  881. {$endif def cpuflags}
  882. end
  883. else
  884. {$ifdef SUPPORT_MMX}
  885. if (cs_mmx in current_settings.localswitches) and
  886. is_mmx_able_array(left.resultdef) then
  887. expectloc:=LOC_MMXREGISTER
  888. else
  889. {$endif SUPPORT_MMX}
  890. {$ifndef cpu64bitalu}
  891. if is_64bit(left.resultdef) then
  892. begin
  893. if (expectloc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  894. expectloc:=LOC_REGISTER;
  895. end
  896. else
  897. {$endif not cpu64bitalu}
  898. if is_integer(left.resultdef) then
  899. expectloc:=LOC_REGISTER;
  900. end;
  901. {$ifdef state_tracking}
  902. function Tnotnode.track_state_pass(exec_known:boolean):boolean;
  903. begin
  904. track_state_pass:=true;
  905. if left.track_state_pass(exec_known) then
  906. begin
  907. left.resultdef:=nil;
  908. do_typecheckpass(left);
  909. end;
  910. end;
  911. {$endif}
  912. end.