cg386add.pas 92 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Generate i386 assembler for in add node
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit cg386add;
  19. interface
  20. {$define usecreateset}
  21. uses
  22. tree;
  23. procedure secondadd(var p : ptree);
  24. implementation
  25. uses
  26. globtype,systems,
  27. cobjects,verbose,globals,
  28. symtable,aasm,types,
  29. hcodegen,temp_gen,pass_2,
  30. i386,cgai386,tgeni386;
  31. {*****************************************************************************
  32. Helpers
  33. *****************************************************************************}
  34. function getresflags(p : ptree;unsigned : boolean) : tresflags;
  35. begin
  36. if not(unsigned) then
  37. begin
  38. if p^.swaped then
  39. case p^.treetype of
  40. equaln : getresflags:=F_E;
  41. unequaln : getresflags:=F_NE;
  42. ltn : getresflags:=F_G;
  43. lten : getresflags:=F_GE;
  44. gtn : getresflags:=F_L;
  45. gten : getresflags:=F_LE;
  46. end
  47. else
  48. case p^.treetype of
  49. equaln : getresflags:=F_E;
  50. unequaln : getresflags:=F_NE;
  51. ltn : getresflags:=F_L;
  52. lten : getresflags:=F_LE;
  53. gtn : getresflags:=F_G;
  54. gten : getresflags:=F_GE;
  55. end;
  56. end
  57. else
  58. begin
  59. if p^.swaped then
  60. case p^.treetype of
  61. equaln : getresflags:=F_E;
  62. unequaln : getresflags:=F_NE;
  63. ltn : getresflags:=F_A;
  64. lten : getresflags:=F_AE;
  65. gtn : getresflags:=F_B;
  66. gten : getresflags:=F_BE;
  67. end
  68. else
  69. case p^.treetype of
  70. equaln : getresflags:=F_E;
  71. unequaln : getresflags:=F_NE;
  72. ltn : getresflags:=F_B;
  73. lten : getresflags:=F_BE;
  74. gtn : getresflags:=F_A;
  75. gten : getresflags:=F_AE;
  76. end;
  77. end;
  78. end;
  79. procedure SetResultLocation(cmpop,unsigned:boolean;var p :ptree);
  80. begin
  81. { remove temporary location if not a set or string }
  82. { that's a bad hack (FK) who did this ? }
  83. if (p^.left^.resulttype^.deftype<>stringdef) and
  84. ((p^.left^.resulttype^.deftype<>setdef) or (psetdef(p^.left^.resulttype)^.settype=smallset)) and
  85. (p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE]) then
  86. ungetiftemp(p^.left^.location.reference);
  87. if (p^.right^.resulttype^.deftype<>stringdef) and
  88. ((p^.right^.resulttype^.deftype<>setdef) or (psetdef(p^.right^.resulttype)^.settype=smallset)) and
  89. (p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE]) then
  90. ungetiftemp(p^.right^.location.reference);
  91. { in case of comparison operation the put result in the flags }
  92. if cmpop then
  93. begin
  94. clear_location(p^.location);
  95. p^.location.loc:=LOC_FLAGS;
  96. p^.location.resflags:=getresflags(p,unsigned);
  97. end;
  98. end;
  99. {*****************************************************************************
  100. Addstring
  101. *****************************************************************************}
  102. procedure addstring(var p : ptree);
  103. var
  104. pushedregs : tpushed;
  105. href : treference;
  106. pushed,
  107. cmpop : boolean;
  108. savedunused : tregisterset;
  109. hr : treference;
  110. oldrl : plinkedlist;
  111. begin
  112. { string operations are not commutative }
  113. if p^.swaped then
  114. swaptree(p);
  115. case pstringdef(p^.left^.resulttype)^.string_typ of
  116. st_ansistring:
  117. begin
  118. case p^.treetype of
  119. addn:
  120. begin
  121. oldrl:=temptoremove;
  122. temptoremove:=new(plinkedlist,init);
  123. cmpop:=false;
  124. secondpass(p^.left);
  125. pushed:=maybe_push(p^.right^.registers32,p);
  126. secondpass(p^.right);
  127. if pushed then restore(p);
  128. { release used registers }
  129. case p^.right^.location.loc of
  130. LOC_REFERENCE,LOC_MEM:
  131. del_reference(p^.right^.location.reference);
  132. LOC_REGISTER,LOC_CREGISTER:
  133. ungetregister32(p^.right^.location.register);
  134. end;
  135. case p^.left^.location.loc of
  136. LOC_REFERENCE,LOC_MEM:
  137. del_reference(p^.left^.location.reference);
  138. LOC_REGISTER,LOC_CREGISTER:
  139. ungetregister32(p^.left^.location.register);
  140. end;
  141. savedunused:=unused;
  142. { push the still used registers }
  143. pushusedregisters(pushedregs,$ff);
  144. { push data }
  145. emit_push_loc(p^.right^.location);
  146. emit_push_loc(p^.left^.location);
  147. emitcall('FPC_ANSISTR_CONCAT',true);
  148. unused:=savedunused;
  149. clear_location(p^.location);
  150. p^.location.register:=getexplicitregister32(R_EAX);
  151. p^.location.loc:=LOC_REGISTER;
  152. emit_reg_reg(A_MOV,S_L,R_EAX,p^.location.register);
  153. { unused:=unused-[R_EAX]; }
  154. removetemps(exprasmlist,temptoremove);
  155. dispose(temptoremove,done);
  156. temptoremove:=oldrl;
  157. { unused:=unused+[R_EAX]; }
  158. popusedregisters(pushedregs);
  159. maybe_loadesi;
  160. ungetiftemp(p^.left^.location.reference);
  161. ungetiftemp(p^.right^.location.reference);
  162. reset_reference(hr);
  163. gettempansistringreference(hr);
  164. addtemptodestroy(p^.resulttype,hr);
  165. exprasmlist^.concat(new(pai386,op_reg_ref(A_MOV,S_L,p^.location.register,
  166. newreference(hr))));
  167. end;
  168. ltn,lten,gtn,gten,
  169. equaln,unequaln:
  170. begin
  171. oldrl:=temptoremove;
  172. temptoremove:=new(plinkedlist,init);
  173. secondpass(p^.left);
  174. pushed:=maybe_push(p^.right^.registers32,p);
  175. secondpass(p^.right);
  176. if pushed then restore(p);
  177. { release used registers }
  178. case p^.right^.location.loc of
  179. LOC_REFERENCE,LOC_MEM:
  180. del_reference(p^.right^.location.reference);
  181. LOC_REGISTER,LOC_CREGISTER:
  182. ungetregister32(p^.right^.location.register);
  183. end;
  184. case p^.left^.location.loc of
  185. LOC_REFERENCE,LOC_MEM:
  186. del_reference(p^.left^.location.reference);
  187. LOC_REGISTER,LOC_CREGISTER:
  188. ungetregister32(p^.left^.location.register);
  189. end;
  190. { push the still used registers }
  191. pushusedregisters(pushedregs,$ff);
  192. { push data }
  193. case p^.right^.location.loc of
  194. LOC_REFERENCE,LOC_MEM:
  195. emit_push_mem(p^.right^.location.reference);
  196. LOC_REGISTER,LOC_CREGISTER:
  197. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,p^.right^.location.register)));
  198. end;
  199. case p^.left^.location.loc of
  200. LOC_REFERENCE,LOC_MEM:
  201. emit_push_mem(p^.left^.location.reference);
  202. LOC_REGISTER,LOC_CREGISTER:
  203. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,p^.left^.location.register)));
  204. end;
  205. emitcall('FPC_ANSISTR_COMPARE',true);
  206. unused:=unused-[R_EAX];
  207. removetemps(exprasmlist,temptoremove);
  208. dispose(temptoremove,done);
  209. temptoremove:=oldrl;
  210. unused:=unused+[R_EAX];
  211. emit_reg_reg(A_OR,S_L,R_EAX,R_EAX);
  212. popusedregisters(pushedregs);
  213. maybe_loadesi;
  214. ungetiftemp(p^.left^.location.reference);
  215. ungetiftemp(p^.right^.location.reference);
  216. end;
  217. end;
  218. { the result of ansicompare is signed }
  219. SetResultLocation(cmpop,false,p);
  220. end;
  221. st_shortstring:
  222. begin
  223. case p^.treetype of
  224. addn:
  225. begin
  226. cmpop:=false;
  227. secondpass(p^.left);
  228. { if str_concat is set in expr
  229. s:=s+ ... no need to create a temp string (PM) }
  230. if (p^.left^.treetype<>addn) and not (p^.use_strconcat) then
  231. begin
  232. { can only reference be }
  233. { string in register would be funny }
  234. { therefore produce a temporary string }
  235. { release the registers }
  236. del_reference(p^.left^.location.reference);
  237. gettempofsizereference(256,href);
  238. copyshortstring(href,p^.left^.location.reference,255,false);
  239. ungetiftemp(p^.left^.location.reference);
  240. { does not hurt: }
  241. clear_location(p^.left^.location);
  242. p^.left^.location.loc:=LOC_MEM;
  243. p^.left^.location.reference:=href;
  244. end;
  245. secondpass(p^.right);
  246. { on the right we do not need the register anymore too }
  247. del_reference(p^.right^.location.reference);
  248. pushusedregisters(pushedregs,$ff);
  249. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  250. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  251. emitcall('FPC_SHORTSTR_CONCAT',true);
  252. maybe_loadesi;
  253. popusedregisters(pushedregs);
  254. set_location(p^.location,p^.left^.location);
  255. ungetiftemp(p^.right^.location.reference);
  256. end;
  257. ltn,lten,gtn,gten,
  258. equaln,unequaln :
  259. begin
  260. cmpop:=true;
  261. { generate better code for s='' and s<>'' }
  262. if (p^.treetype in [equaln,unequaln]) and
  263. (((p^.left^.treetype=stringconstn) and (str_length(p^.left)=0)) or
  264. ((p^.right^.treetype=stringconstn) and (str_length(p^.right)=0))) then
  265. begin
  266. secondpass(p^.left);
  267. { are too few registers free? }
  268. pushed:=maybe_push(p^.right^.registers32,p);
  269. secondpass(p^.right);
  270. if pushed then restore(p);
  271. del_reference(p^.right^.location.reference);
  272. del_reference(p^.left^.location.reference);
  273. { only one node can be stringconstn }
  274. { else pass 1 would have evaluted }
  275. { this node }
  276. if p^.left^.treetype=stringconstn then
  277. exprasmlist^.concat(new(pai386,op_const_ref(
  278. A_CMP,S_B,0,newreference(p^.right^.location.reference))))
  279. else
  280. exprasmlist^.concat(new(pai386,op_const_ref(
  281. A_CMP,S_B,0,newreference(p^.left^.location.reference))));
  282. end
  283. else
  284. begin
  285. pushusedregisters(pushedregs,$ff);
  286. secondpass(p^.left);
  287. del_reference(p^.left^.location.reference);
  288. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  289. secondpass(p^.right);
  290. del_reference(p^.right^.location.reference);
  291. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  292. emitcall('FPC_SHORTSTR_COMPARE',true);
  293. maybe_loadesi;
  294. popusedregisters(pushedregs);
  295. end;
  296. ungetiftemp(p^.left^.location.reference);
  297. ungetiftemp(p^.right^.location.reference);
  298. end;
  299. else CGMessage(type_e_mismatch);
  300. end;
  301. SetResultLocation(cmpop,true,p);
  302. end;
  303. end;
  304. end;
  305. {*****************************************************************************
  306. Addset
  307. *****************************************************************************}
  308. procedure addset(var p : ptree);
  309. var
  310. createset,
  311. cmpop,
  312. pushed : boolean;
  313. href : treference;
  314. pushedregs : tpushed;
  315. begin
  316. cmpop:=false;
  317. { not commutative }
  318. if p^.swaped then
  319. swaptree(p);
  320. { optimize first loading of a set }
  321. {$ifdef usecreateset}
  322. if (p^.right^.treetype=setelementn) and
  323. is_emptyset(p^.left) then
  324. createset:=true
  325. else
  326. {$endif}
  327. begin
  328. createset:=false;
  329. secondpass(p^.left);
  330. end;
  331. { are too few registers free? }
  332. pushed:=maybe_push(p^.right^.registers32,p);
  333. secondpass(p^.right);
  334. if codegenerror then
  335. exit;
  336. if pushed then
  337. restore(p);
  338. set_location(p^.location,p^.left^.location);
  339. { handle operations }
  340. case p^.treetype of
  341. equaln,
  342. unequaln
  343. {$IfNDef NoSetInclusion}
  344. ,lten, gten
  345. {$EndIf NoSetInclusion}
  346. : begin
  347. cmpop:=true;
  348. del_reference(p^.left^.location.reference);
  349. del_reference(p^.right^.location.reference);
  350. pushusedregisters(pushedregs,$ff);
  351. {$IfNDef NoSetInclusion}
  352. If (p^.treetype in [equaln, unequaln, lten]) Then
  353. Begin
  354. {$EndIf NoSetInclusion}
  355. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  356. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  357. {$IfNDef NoSetInclusion}
  358. End
  359. Else {gten = lten, if the arguments are reversed}
  360. Begin
  361. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  362. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  363. End;
  364. Case p^.treetype of
  365. equaln, unequaln:
  366. {$EndIf NoSetInclusion}
  367. emitcall('FPC_SET_COMP_SETS',true);
  368. {$IfNDef NoSetInclusion}
  369. lten, gten: emitcall('FPC_SET_CONTAINS_SETS',true)
  370. End;
  371. {$EndIf NoSetInclusion}
  372. maybe_loadesi;
  373. popusedregisters(pushedregs);
  374. ungetiftemp(p^.left^.location.reference);
  375. ungetiftemp(p^.right^.location.reference);
  376. end;
  377. addn : begin
  378. { add can be an other SET or Range or Element ! }
  379. del_reference(p^.left^.location.reference);
  380. del_reference(p^.right^.location.reference);
  381. pushusedregisters(pushedregs,$ff);
  382. href.symbol:=nil;
  383. gettempofsizereference(32,href);
  384. if createset then
  385. begin
  386. pushsetelement(p^.right^.left);
  387. emitpushreferenceaddr(exprasmlist,href);
  388. emitcall('FPC_SET_CREATE_ELEMENT',true);
  389. end
  390. else
  391. begin
  392. { add a range or a single element? }
  393. if p^.right^.treetype=setelementn then
  394. begin
  395. concatcopy(p^.left^.location.reference,href,32,false,false);
  396. if assigned(p^.right^.right) then
  397. begin
  398. pushsetelement(p^.right^.right);
  399. pushsetelement(p^.right^.left);
  400. emitpushreferenceaddr(exprasmlist,href);
  401. emitcall('FPC_SET_SET_RANGE',true);
  402. end
  403. else
  404. begin
  405. pushsetelement(p^.right^.left);
  406. emitpushreferenceaddr(exprasmlist,href);
  407. emitcall('FPC_SET_SET_BYTE',true);
  408. end;
  409. end
  410. else
  411. begin
  412. { must be an other set }
  413. emitpushreferenceaddr(exprasmlist,href);
  414. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  415. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  416. emitcall('FPC_SET_ADD_SETS',true);
  417. end;
  418. end;
  419. maybe_loadesi;
  420. popusedregisters(pushedregs);
  421. ungetiftemp(p^.left^.location.reference);
  422. ungetiftemp(p^.right^.location.reference);
  423. p^.location.loc:=LOC_MEM;
  424. stringdispose(p^.location.reference.symbol);
  425. p^.location.reference:=href;
  426. end;
  427. subn,
  428. symdifn,
  429. muln : begin
  430. del_reference(p^.left^.location.reference);
  431. del_reference(p^.right^.location.reference);
  432. href.symbol:=nil;
  433. pushusedregisters(pushedregs,$ff);
  434. gettempofsizereference(32,href);
  435. emitpushreferenceaddr(exprasmlist,href);
  436. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  437. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  438. case p^.treetype of
  439. subn : emitcall('FPC_SET_SUB_SETS',true);
  440. symdifn : emitcall('FPC_SET_SYMDIF_SETS',true);
  441. muln : emitcall('FPC_SET_MUL_SETS',true);
  442. end;
  443. maybe_loadesi;
  444. popusedregisters(pushedregs);
  445. ungetiftemp(p^.left^.location.reference);
  446. ungetiftemp(p^.right^.location.reference);
  447. p^.location.loc:=LOC_MEM;
  448. stringdispose(p^.location.reference.symbol);
  449. p^.location.reference:=href;
  450. end;
  451. else
  452. CGMessage(type_e_mismatch);
  453. end;
  454. SetResultLocation(cmpop,true,p);
  455. end;
  456. {*****************************************************************************
  457. SecondAdd
  458. *****************************************************************************}
  459. procedure secondadd(var p : ptree);
  460. { is also being used for xor, and "mul", "sub, or and comparative }
  461. { operators }
  462. label do_normal;
  463. var
  464. hregister,hregister2 : tregister;
  465. noswap,popeax,popedx,
  466. pushed,mboverflow,cmpop : boolean;
  467. op,op2 : tasmop;
  468. flags : tresflags;
  469. otl,ofl : plabel;
  470. power : longint;
  471. opsize : topsize;
  472. hl4: plabel;
  473. hr : preference;
  474. { true, if unsigned types are compared }
  475. unsigned : boolean;
  476. { true, if a small set is handled with the longint code }
  477. is_set : boolean;
  478. { is_in_dest if the result is put directly into }
  479. { the resulting refernce or varregister }
  480. is_in_dest : boolean;
  481. { true, if for sets subtractions the extra not should generated }
  482. extra_not : boolean;
  483. {$ifdef SUPPORT_MMX}
  484. mmxbase : tmmxtype;
  485. {$endif SUPPORT_MMX}
  486. pushedreg : tpushed;
  487. begin
  488. { to make it more readable, string and set (not smallset!) have their
  489. own procedures }
  490. case p^.left^.resulttype^.deftype of
  491. stringdef : begin
  492. addstring(p);
  493. exit;
  494. end;
  495. setdef : begin
  496. { normalsets are handled separate }
  497. if not(psetdef(p^.left^.resulttype)^.settype=smallset) then
  498. begin
  499. addset(p);
  500. exit;
  501. end;
  502. end;
  503. end;
  504. { defaults }
  505. unsigned:=false;
  506. is_in_dest:=false;
  507. extra_not:=false;
  508. noswap:=false;
  509. opsize:=S_L;
  510. { are we a (small)set, must be set here because the side can be
  511. swapped ! (PFV) }
  512. is_set:=(p^.left^.resulttype^.deftype=setdef);
  513. { calculate the operator which is more difficult }
  514. firstcomplex(p);
  515. { handling boolean expressions extra: }
  516. if ((p^.left^.resulttype^.deftype=orddef) and
  517. (porddef(p^.left^.resulttype)^.typ in [bool8bit,bool16bit,bool32bit])) or
  518. ((p^.right^.resulttype^.deftype=orddef) and
  519. (porddef(p^.right^.resulttype)^.typ in [bool8bit,bool16bit,bool32bit])) then
  520. begin
  521. if (porddef(p^.left^.resulttype)^.typ=bool8bit) or
  522. (porddef(p^.right^.resulttype)^.typ=bool8bit) then
  523. opsize:=S_B
  524. else
  525. if (porddef(p^.left^.resulttype)^.typ=bool16bit) or
  526. (porddef(p^.right^.resulttype)^.typ=bool16bit) then
  527. opsize:=S_W
  528. else
  529. opsize:=S_L;
  530. case p^.treetype of
  531. andn,
  532. orn : begin
  533. clear_location(p^.location);
  534. p^.location.loc:=LOC_JUMP;
  535. cmpop:=false;
  536. case p^.treetype of
  537. andn : begin
  538. otl:=truelabel;
  539. getlabel(truelabel);
  540. secondpass(p^.left);
  541. maketojumpbool(p^.left);
  542. emitl(A_LABEL,truelabel);
  543. truelabel:=otl;
  544. end;
  545. orn : begin
  546. ofl:=falselabel;
  547. getlabel(falselabel);
  548. secondpass(p^.left);
  549. maketojumpbool(p^.left);
  550. emitl(A_LABEL,falselabel);
  551. falselabel:=ofl;
  552. end;
  553. else
  554. CGMessage(type_e_mismatch);
  555. end;
  556. secondpass(p^.right);
  557. maketojumpbool(p^.right);
  558. end;
  559. unequaln,
  560. equaln,xorn : begin
  561. if p^.left^.treetype=ordconstn then
  562. swaptree(p);
  563. secondpass(p^.left);
  564. set_location(p^.location,p^.left^.location);
  565. {p^.location:=p^.left^.location;
  566. created a bug !!! PM
  567. because symbol was used twice }
  568. { are enough registers free ? }
  569. pushed:=maybe_push(p^.right^.registers32,p);
  570. secondpass(p^.right);
  571. if pushed then restore(p);
  572. goto do_normal;
  573. end
  574. else
  575. CGMessage(type_e_mismatch);
  576. end
  577. end
  578. else
  579. begin
  580. { in case of constant put it to the left }
  581. if (p^.left^.treetype=ordconstn) then
  582. swaptree(p);
  583. secondpass(p^.left);
  584. { this will be complicated as
  585. a lot of code below assumes that
  586. p^.location and p^.left^.location are the same }
  587. {$ifdef test_dest_loc}
  588. if dest_loc_known and (dest_loc_tree=p) and
  589. ((dest_loc.loc=LOC_REGISTER) or (dest_loc.loc=LOC_CREGISTER)) then
  590. begin
  591. set_location(p^.location,dest_loc);
  592. in_dest_loc:=true;
  593. is_in_dest:=true;
  594. end
  595. else
  596. {$endif test_dest_loc}
  597. set_location(p^.location,p^.left^.location);
  598. { are too few registers free? }
  599. pushed:=maybe_push(p^.right^.registers32,p);
  600. secondpass(p^.right);
  601. if pushed then
  602. restore(p);
  603. if (p^.left^.resulttype^.deftype=pointerdef) or
  604. (p^.right^.resulttype^.deftype=pointerdef) or
  605. ((p^.right^.resulttype^.deftype=objectdef) and
  606. pobjectdef(p^.right^.resulttype)^.isclass and
  607. (p^.left^.resulttype^.deftype=objectdef) and
  608. pobjectdef(p^.left^.resulttype)^.isclass
  609. ) or
  610. (p^.left^.resulttype^.deftype=classrefdef) or
  611. (p^.left^.resulttype^.deftype=procvardef) or
  612. (p^.left^.resulttype^.deftype=enumdef) or
  613. ((p^.left^.resulttype^.deftype=orddef) and
  614. (porddef(p^.left^.resulttype)^.typ=s32bit)) or
  615. ((p^.right^.resulttype^.deftype=orddef) and
  616. (porddef(p^.right^.resulttype)^.typ=s32bit)) or
  617. ((p^.left^.resulttype^.deftype=orddef) and
  618. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  619. ((p^.right^.resulttype^.deftype=orddef) and
  620. (porddef(p^.right^.resulttype)^.typ=u32bit)) or
  621. { as well as small sets }
  622. is_set then
  623. begin
  624. do_normal:
  625. mboverflow:=false;
  626. cmpop:=false;
  627. if (p^.left^.resulttype^.deftype=pointerdef) or
  628. (p^.right^.resulttype^.deftype=pointerdef) or
  629. ((p^.left^.resulttype^.deftype=orddef) and
  630. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  631. ((p^.right^.resulttype^.deftype=orddef) and
  632. (porddef(p^.right^.resulttype)^.typ=u32bit)) then
  633. unsigned:=true;
  634. case p^.treetype of
  635. addn : begin
  636. if is_set then
  637. begin
  638. { adding elements is not commutative }
  639. if p^.swaped and (p^.left^.treetype=setelementn) then
  640. swaptree(p);
  641. { are we adding set elements ? }
  642. if p^.right^.treetype=setelementn then
  643. begin
  644. { no range support for smallsets! }
  645. if assigned(p^.right^.right) then
  646. internalerror(43244);
  647. { bts requires both elements to be registers }
  648. if p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  649. begin
  650. ungetiftemp(p^.left^.location.reference);
  651. del_reference(p^.left^.location.reference);
  652. hregister:=getregister32;
  653. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  654. newreference(p^.left^.location.reference),hregister)));
  655. clear_location(p^.left^.location);
  656. p^.left^.location.loc:=LOC_REGISTER;
  657. p^.left^.location.register:=hregister;
  658. set_location(p^.location,p^.left^.location);
  659. end;
  660. if p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  661. begin
  662. ungetiftemp(p^.right^.location.reference);
  663. del_reference(p^.right^.location.reference);
  664. hregister:=getregister32;
  665. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  666. newreference(p^.right^.location.reference),hregister)));
  667. clear_location(p^.right^.location);
  668. p^.right^.location.loc:=LOC_REGISTER;
  669. p^.right^.location.register:=hregister;
  670. end;
  671. op:=A_BTS;
  672. noswap:=true;
  673. end
  674. else
  675. op:=A_OR;
  676. mboverflow:=false;
  677. unsigned:=false;
  678. end
  679. else
  680. begin
  681. op:=A_ADD;
  682. mboverflow:=true;
  683. end;
  684. end;
  685. symdifn : begin
  686. { the symetric diff is only for sets }
  687. if is_set then
  688. begin
  689. op:=A_XOR;
  690. mboverflow:=false;
  691. unsigned:=false;
  692. end
  693. else
  694. CGMessage(type_e_mismatch);
  695. end;
  696. muln : begin
  697. if is_set then
  698. begin
  699. op:=A_AND;
  700. mboverflow:=false;
  701. unsigned:=false;
  702. end
  703. else
  704. begin
  705. if unsigned then
  706. op:=A_MUL
  707. else
  708. op:=A_IMUL;
  709. mboverflow:=true;
  710. end;
  711. end;
  712. subn : begin
  713. if is_set then
  714. begin
  715. op:=A_AND;
  716. mboverflow:=false;
  717. unsigned:=false;
  718. extra_not:=true;
  719. end
  720. else
  721. begin
  722. op:=A_SUB;
  723. mboverflow:=true;
  724. end;
  725. end;
  726. ltn,lten,
  727. gtn,gten,
  728. equaln,unequaln : begin
  729. {$IfNDef NoSetInclusion}
  730. If is_set Then
  731. Case p^.treetype of
  732. lten,gten:
  733. Begin
  734. If p^.treetype = gten then
  735. swaptree(p);
  736. if p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  737. begin
  738. ungetiftemp(p^.left^.location.reference);
  739. del_reference(p^.left^.location.reference);
  740. hregister:=getregister32;
  741. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  742. newreference(p^.left^.location.reference),hregister)));
  743. clear_location(p^.left^.location);
  744. p^.left^.location.loc:=LOC_REGISTER;
  745. p^.left^.location.register:=hregister;
  746. set_location(p^.location,p^.left^.location);
  747. end
  748. else
  749. if p^.left^.location.loc = LOC_CREGISTER Then
  750. {save the register var in a temp register, because
  751. its value is going to be modified}
  752. begin
  753. hregister := getregister32;
  754. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,
  755. p^.left^.location.register,hregister)));
  756. clear_location(p^.left^.location);
  757. p^.left^.location.loc:=LOC_REGISTER;
  758. p^.left^.location.register:=hregister;
  759. set_location(p^.location,p^.left^.location);
  760. end;
  761. {here, p^.left^.location should be LOC_REGISTER}
  762. If p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE] Then
  763. exprasmlist^.concat(new(pai386,op_ref_reg(A_AND,opsize,
  764. newreference(p^.right^.location.reference),p^.left^.location.register)))
  765. Else
  766. exprasmlist^.concat(new(pai386,op_reg_reg(A_AND,opsize,
  767. p^.right^.location.register,p^.left^.location.register)));
  768. {warning: ugly hack ahead: we need a "jne" after the cmp, so
  769. change the treetype from lten/gten to equaln}
  770. p^.treetype := equaln
  771. End;
  772. {no < or > support for sets}
  773. ltn,gtn: CGMessage(type_e_mismatch);
  774. End;
  775. {$EndIf NoSetInclusion}
  776. op:=A_CMP;
  777. cmpop:=true;
  778. end;
  779. xorn : op:=A_XOR;
  780. orn : op:=A_OR;
  781. andn : op:=A_AND;
  782. else
  783. CGMessage(type_e_mismatch);
  784. end;
  785. { filter MUL, which requires special handling }
  786. if op=A_MUL then
  787. begin
  788. popeax:=false;
  789. popedx:=false;
  790. { here you need to free the symbol first }
  791. clear_location(p^.location);
  792. p^.location.register:=getregister32;
  793. p^.location.loc:=LOC_REGISTER;
  794. if not(R_EAX in unused) and (p^.location.register<>R_EAX) then
  795. begin
  796. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,R_EAX)));
  797. popeax:=true;
  798. end;
  799. if not(R_EDX in unused) and (p^.location.register<>R_EDX) then
  800. begin
  801. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,R_EDX)));
  802. popedx:=true;
  803. end;
  804. emitloadord2reg(p^.left^.location,u32bitdef,R_EDI,true);
  805. emitloadord2reg(p^.right^.location,u32bitdef,R_EAX,true);
  806. exprasmlist^.concat(new(pai386,op_reg(A_MUL,S_L,R_EDI)));
  807. emit_reg_reg(A_MOV,S_L,R_EAX,p^.location.register);
  808. if popedx then
  809. exprasmlist^.concat(new(pai386,op_reg(A_POP,S_L,R_EDX)));
  810. if popeax then
  811. exprasmlist^.concat(new(pai386,op_reg(A_POP,S_L,R_EAX)));
  812. SetResultLocation(false,true,p);
  813. exit;
  814. end;
  815. { left and right no register? }
  816. { then one must be demanded }
  817. if (p^.left^.location.loc<>LOC_REGISTER) and
  818. (p^.right^.location.loc<>LOC_REGISTER) then
  819. begin
  820. { register variable ? }
  821. if (p^.left^.location.loc=LOC_CREGISTER) then
  822. begin
  823. { it is OK if this is the destination }
  824. if is_in_dest then
  825. begin
  826. hregister:=p^.location.register;
  827. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  828. hregister);
  829. end
  830. else
  831. if cmpop then
  832. begin
  833. { do not disturb the register }
  834. hregister:=p^.location.register;
  835. end
  836. else
  837. begin
  838. case opsize of
  839. S_L : hregister:=getregister32;
  840. S_B : hregister:=reg32toreg8(getregister32);
  841. end;
  842. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  843. hregister);
  844. end
  845. end
  846. else
  847. begin
  848. ungetiftemp(p^.left^.location.reference);
  849. del_reference(p^.left^.location.reference);
  850. if is_in_dest then
  851. begin
  852. hregister:=p^.location.register;
  853. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  854. newreference(p^.left^.location.reference),hregister)));
  855. end
  856. else
  857. begin
  858. { first give free, then demand new register }
  859. case opsize of
  860. S_L : hregister:=getregister32;
  861. S_W : hregister:=reg32toreg16(getregister32);
  862. S_B : hregister:=reg32toreg8(getregister32);
  863. end;
  864. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  865. newreference(p^.left^.location.reference),hregister)));
  866. end;
  867. end;
  868. clear_location(p^.location);
  869. p^.location.loc:=LOC_REGISTER;
  870. p^.location.register:=hregister;
  871. end
  872. else
  873. { if on the right the register then swap }
  874. if not(noswap) and (p^.right^.location.loc=LOC_REGISTER) then
  875. begin
  876. swap_location(p^.location,p^.right^.location);
  877. { newly swapped also set swapped flag }
  878. p^.swaped:=not(p^.swaped);
  879. end;
  880. { at this point, p^.location.loc should be LOC_REGISTER }
  881. { and p^.location.register should be a valid register }
  882. { containing the left result }
  883. if p^.right^.location.loc<>LOC_REGISTER then
  884. begin
  885. if (p^.treetype=subn) and p^.swaped then
  886. begin
  887. if p^.right^.location.loc=LOC_CREGISTER then
  888. begin
  889. if extra_not then
  890. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  891. emit_reg_reg(A_MOV,opsize,p^.right^.location.register,R_EDI);
  892. emit_reg_reg(op,opsize,p^.location.register,R_EDI);
  893. emit_reg_reg(A_MOV,opsize,R_EDI,p^.location.register);
  894. end
  895. else
  896. begin
  897. if extra_not then
  898. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  899. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  900. newreference(p^.right^.location.reference),R_EDI)));
  901. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,p^.location.register,R_EDI)));
  902. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,R_EDI,p^.location.register)));
  903. ungetiftemp(p^.right^.location.reference);
  904. del_reference(p^.right^.location.reference);
  905. end;
  906. end
  907. else
  908. begin
  909. if (p^.right^.treetype=ordconstn) and
  910. (op=A_CMP) and
  911. (p^.right^.value=0) then
  912. begin
  913. exprasmlist^.concat(new(pai386,op_reg_reg(A_TEST,opsize,p^.location.register,
  914. p^.location.register)));
  915. end
  916. else if (p^.right^.treetype=ordconstn) and
  917. (op=A_ADD) and
  918. (p^.right^.value=1) and
  919. not(cs_check_overflow in aktlocalswitches) then
  920. begin
  921. exprasmlist^.concat(new(pai386,op_reg(A_INC,opsize,
  922. p^.location.register)));
  923. end
  924. else if (p^.right^.treetype=ordconstn) and
  925. (op=A_SUB) and
  926. (p^.right^.value=1) and
  927. not(cs_check_overflow in aktlocalswitches) then
  928. begin
  929. exprasmlist^.concat(new(pai386,op_reg(A_DEC,opsize,
  930. p^.location.register)));
  931. end
  932. else if (p^.right^.treetype=ordconstn) and
  933. (op=A_IMUL) and
  934. (ispowerof2(p^.right^.value,power)) and
  935. not(cs_check_overflow in aktlocalswitches) then
  936. begin
  937. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,opsize,power,
  938. p^.location.register)));
  939. end
  940. else
  941. begin
  942. if (p^.right^.location.loc=LOC_CREGISTER) then
  943. begin
  944. if extra_not then
  945. begin
  946. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,R_EDI);
  947. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  948. emit_reg_reg(A_AND,S_L,R_EDI,
  949. p^.location.register);
  950. end
  951. else
  952. begin
  953. emit_reg_reg(op,opsize,p^.right^.location.register,
  954. p^.location.register);
  955. end;
  956. end
  957. else
  958. begin
  959. if extra_not then
  960. begin
  961. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,newreference(
  962. p^.right^.location.reference),R_EDI)));
  963. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  964. emit_reg_reg(A_AND,S_L,R_EDI,
  965. p^.location.register);
  966. end
  967. else
  968. begin
  969. exprasmlist^.concat(new(pai386,op_ref_reg(op,opsize,newreference(
  970. p^.right^.location.reference),p^.location.register)));
  971. end;
  972. ungetiftemp(p^.right^.location.reference);
  973. del_reference(p^.right^.location.reference);
  974. end;
  975. end;
  976. end;
  977. end
  978. else
  979. begin
  980. { when swapped another result register }
  981. if (p^.treetype=subn) and p^.swaped then
  982. begin
  983. if extra_not then
  984. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.location.register)));
  985. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  986. p^.location.register,p^.right^.location.register)));
  987. swap_location(p^.location,p^.right^.location);
  988. { newly swapped also set swapped flag }
  989. { just to maintain ordering }
  990. p^.swaped:=not(p^.swaped);
  991. end
  992. else
  993. begin
  994. if extra_not then
  995. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.right^.location.register)));
  996. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  997. p^.right^.location.register,
  998. p^.location.register)));
  999. end;
  1000. case opsize of
  1001. S_L : ungetregister32(p^.right^.location.register);
  1002. S_B : ungetregister32(reg8toreg32(p^.right^.location.register));
  1003. end;
  1004. end;
  1005. if cmpop then
  1006. case opsize of
  1007. S_L : ungetregister32(p^.location.register);
  1008. S_B : ungetregister32(reg8toreg32(p^.location.register));
  1009. end;
  1010. { only in case of overflow operations }
  1011. { produce overflow code }
  1012. { we must put it here directly, because sign of operation }
  1013. { is in unsigned VAR!! }
  1014. if mboverflow then
  1015. begin
  1016. if cs_check_overflow in aktlocalswitches then
  1017. begin
  1018. getlabel(hl4);
  1019. if unsigned then
  1020. emitl(A_JNB,hl4)
  1021. else
  1022. emitl(A_JNO,hl4);
  1023. emitcall('FPC_OVERFLOW',true);
  1024. emitl(A_LABEL,hl4);
  1025. end;
  1026. end;
  1027. end
  1028. else
  1029. { Char type }
  1030. if ((p^.left^.resulttype^.deftype=orddef) and
  1031. (porddef(p^.left^.resulttype)^.typ=uchar)) then
  1032. begin
  1033. case p^.treetype of
  1034. ltn,lten,gtn,gten,
  1035. equaln,unequaln :
  1036. cmpop:=true;
  1037. else CGMessage(type_e_mismatch);
  1038. end;
  1039. unsigned:=true;
  1040. { left and right no register? }
  1041. { the one must be demanded }
  1042. if (p^.location.loc<>LOC_REGISTER) and
  1043. (p^.right^.location.loc<>LOC_REGISTER) then
  1044. begin
  1045. if p^.location.loc=LOC_CREGISTER then
  1046. begin
  1047. if cmpop then
  1048. { do not disturb register }
  1049. hregister:=p^.location.register
  1050. else
  1051. begin
  1052. hregister:=reg32toreg8(getregister32);
  1053. emit_reg_reg(A_MOV,S_B,p^.location.register,
  1054. hregister);
  1055. end;
  1056. end
  1057. else
  1058. begin
  1059. del_reference(p^.location.reference);
  1060. { first give free then demand new register }
  1061. hregister:=reg32toreg8(getregister32);
  1062. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_B,newreference(p^.location.reference),
  1063. hregister)));
  1064. end;
  1065. clear_location(p^.location);
  1066. p^.location.loc:=LOC_REGISTER;
  1067. p^.location.register:=hregister;
  1068. end;
  1069. { now p always a register }
  1070. if (p^.right^.location.loc=LOC_REGISTER) and
  1071. (p^.location.loc<>LOC_REGISTER) then
  1072. begin
  1073. swap_location(p^.location,p^.right^.location);
  1074. { newly swapped also set swapped flag }
  1075. p^.swaped:=not(p^.swaped);
  1076. end;
  1077. if p^.right^.location.loc<>LOC_REGISTER then
  1078. begin
  1079. if p^.right^.location.loc=LOC_CREGISTER then
  1080. begin
  1081. emit_reg_reg(A_CMP,S_B,
  1082. p^.right^.location.register,p^.location.register);
  1083. end
  1084. else
  1085. begin
  1086. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_B,newreference(
  1087. p^.right^.location.reference),p^.location.register)));
  1088. del_reference(p^.right^.location.reference);
  1089. end;
  1090. end
  1091. else
  1092. begin
  1093. emit_reg_reg(A_CMP,S_B,p^.right^.location.register,
  1094. p^.location.register);
  1095. ungetregister32(reg8toreg32(p^.right^.location.register));
  1096. end;
  1097. ungetregister32(reg8toreg32(p^.location.register));
  1098. end
  1099. else
  1100. { 64 bit types }
  1101. if is_64bitint(p^.left^.resulttype) then
  1102. begin
  1103. mboverflow:=false;
  1104. cmpop:=false;
  1105. unsigned:=((p^.left^.resulttype^.deftype=orddef) and
  1106. (porddef(p^.left^.resulttype)^.typ=u64bit)) or
  1107. ((p^.right^.resulttype^.deftype=orddef) and
  1108. (porddef(p^.right^.resulttype)^.typ=u64bit));
  1109. case p^.treetype of
  1110. addn : begin
  1111. begin
  1112. op:=A_ADD;
  1113. op2:=A_ADC;
  1114. mboverflow:=true;
  1115. end;
  1116. end;
  1117. subn : begin
  1118. op:=A_SUB;
  1119. op2:=A_SBB;
  1120. mboverflow:=true;
  1121. end;
  1122. ltn,lten,
  1123. gtn,gten,
  1124. equaln,unequaln:
  1125. begin
  1126. op:=A_CMP;
  1127. op2:=A_CMP;
  1128. cmpop:=true;
  1129. end;
  1130. xorn:
  1131. begin
  1132. op:=A_XOR;
  1133. op2:=A_XOR;
  1134. end;
  1135. orn:
  1136. begin
  1137. op:=A_OR;
  1138. op2:=A_OR;
  1139. end;
  1140. andn:
  1141. begin
  1142. op:=A_AND;
  1143. op2:=A_AND;
  1144. end;
  1145. muln:
  1146. ;
  1147. else
  1148. CGMessage(type_e_mismatch);
  1149. end;
  1150. if p^.treetype=muln then
  1151. begin
  1152. release_qword_loc(p^.left^.location);
  1153. release_qword_loc(p^.right^.location);
  1154. p^.location.registerlow:=getexplicitregister32(R_EAX);
  1155. p^.location.registerhigh:=getexplicitregister32(R_EDX);
  1156. pushusedregisters(pushedreg,$ff
  1157. and not($80 shr byte(p^.location.registerlow))
  1158. and not($80 shr byte(p^.location.registerhigh)));
  1159. if cs_check_overflow in aktlocalswitches then
  1160. push_int(1)
  1161. else
  1162. push_int(0);
  1163. emit_pushq_loc(p^.left^.location);
  1164. emit_pushq_loc(p^.right^.location);
  1165. if porddef(p^.resulttype)^.typ=u64bit then
  1166. emitcall('FPC_MUL_QWORD',true)
  1167. else
  1168. emitcall('FPC_MUL_INT64',true);
  1169. emit_reg_reg(A_MOV,S_L,R_EAX,p^.location.registerlow);
  1170. emit_reg_reg(A_MOV,S_L,R_EDX,p^.location.registerhigh);
  1171. popusedregisters(pushedreg);
  1172. p^.location.loc:=LOC_REGISTER;
  1173. end
  1174. else
  1175. begin
  1176. { left and right no register? }
  1177. { then one must be demanded }
  1178. if (p^.left^.location.loc<>LOC_REGISTER) and
  1179. (p^.right^.location.loc<>LOC_REGISTER) then
  1180. begin
  1181. { register variable ? }
  1182. if (p^.left^.location.loc=LOC_CREGISTER) then
  1183. begin
  1184. { it is OK if this is the destination }
  1185. if is_in_dest then
  1186. begin
  1187. hregister:=p^.location.registerlow;
  1188. hregister2:=p^.location.registerhigh;
  1189. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1190. hregister);
  1191. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1192. hregister2);
  1193. end
  1194. else
  1195. if cmpop then
  1196. begin
  1197. { do not disturb the register }
  1198. hregister:=p^.location.registerlow;
  1199. hregister2:=p^.location.registerhigh;
  1200. end
  1201. else
  1202. begin
  1203. hregister:=getregister32;
  1204. hregister2:=getregister32;
  1205. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1206. hregister);
  1207. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerhigh,
  1208. hregister2);
  1209. end
  1210. end
  1211. else
  1212. begin
  1213. ungetiftemp(p^.left^.location.reference);
  1214. del_reference(p^.left^.location.reference);
  1215. if is_in_dest then
  1216. begin
  1217. hregister:=p^.location.registerlow;
  1218. hregister2:=p^.location.registerhigh;
  1219. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1220. newreference(p^.left^.location.reference),hregister)));
  1221. hr:=newreference(p^.left^.location.reference);
  1222. inc(hr^.offset,4);
  1223. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1224. hr,hregister2)));
  1225. end
  1226. else
  1227. begin
  1228. hregister:=getregister32;
  1229. hregister2:=getregister32;
  1230. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1231. newreference(p^.left^.location.reference),hregister)));
  1232. hr:=newreference(p^.left^.location.reference);
  1233. inc(hr^.offset,4);
  1234. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1235. hr,hregister2)));
  1236. end;
  1237. end;
  1238. clear_location(p^.location);
  1239. p^.location.loc:=LOC_REGISTER;
  1240. p^.location.registerlow:=hregister;
  1241. p^.location.registerhigh:=hregister2;
  1242. end
  1243. else
  1244. { if on the right the register then swap }
  1245. if not(noswap) and (p^.right^.location.loc=LOC_REGISTER) then
  1246. begin
  1247. swap_location(p^.location,p^.right^.location);
  1248. { newly swapped also set swapped flag }
  1249. p^.swaped:=not(p^.swaped);
  1250. end;
  1251. { at this point, p^.location.loc should be LOC_REGISTER }
  1252. { and p^.location.register should be a valid register }
  1253. { containing the left result }
  1254. if p^.right^.location.loc<>LOC_REGISTER then
  1255. begin
  1256. if (p^.treetype=subn) and p^.swaped then
  1257. begin
  1258. if p^.right^.location.loc=LOC_CREGISTER then
  1259. begin
  1260. emit_reg_reg(A_MOV,opsize,p^.right^.location.register,R_EDI);
  1261. emit_reg_reg(op,opsize,p^.location.register,R_EDI);
  1262. emit_reg_reg(A_MOV,opsize,R_EDI,p^.location.register);
  1263. end
  1264. else
  1265. begin
  1266. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  1267. newreference(p^.right^.location.reference),R_EDI)));
  1268. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,p^.location.register,R_EDI)));
  1269. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,R_EDI,p^.location.register)));
  1270. ungetiftemp(p^.right^.location.reference);
  1271. del_reference(p^.right^.location.reference);
  1272. end;
  1273. end
  1274. else if cmpop then
  1275. begin
  1276. if (p^.right^.location.loc=LOC_CREGISTER) then
  1277. begin
  1278. emit_reg_reg(A_CMP,S_L,p^.right^.location.registerhigh,
  1279. p^.location.registerhigh);
  1280. emitl(flag_2_jmp[getresflags(p,unsigned)],truelabel);
  1281. emit_reg_reg(A_CMP,S_L,p^.right^.location.registerlow,
  1282. p^.location.registerlow);
  1283. emitl(flag_2_jmp[getresflags(p,unsigned)],truelabel);
  1284. emitl(A_JMP,falselabel);
  1285. end
  1286. else
  1287. begin
  1288. hr:=newreference(p^.right^.location.reference);
  1289. inc(hr^.offset,4);
  1290. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_L,
  1291. hr,p^.location.registerhigh)));
  1292. emitl(flag_2_jmp[getresflags(p,unsigned)],truelabel);
  1293. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_L,newreference(
  1294. p^.right^.location.reference),p^.location.registerlow)));
  1295. emitl(flag_2_jmp[getresflags(p,unsigned)],truelabel);
  1296. emitl(A_JMP,falselabel);
  1297. ungetiftemp(p^.right^.location.reference);
  1298. del_reference(p^.right^.location.reference);
  1299. end;
  1300. end
  1301. else
  1302. begin
  1303. {
  1304. if (p^.right^.treetype=ordconstn) and
  1305. (op=A_CMP) and
  1306. (p^.right^.value=0) then
  1307. begin
  1308. exprasmlist^.concat(new(pai386,op_reg_reg(A_TEST,opsize,p^.location.register,
  1309. p^.location.register)));
  1310. end
  1311. else if (p^.right^.treetype=ordconstn) and
  1312. (op=A_IMUL) and
  1313. (ispowerof2(p^.right^.value,power)) then
  1314. begin
  1315. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,opsize,power,
  1316. p^.location.register)));
  1317. end
  1318. else
  1319. }
  1320. begin
  1321. if (p^.right^.location.loc=LOC_CREGISTER) then
  1322. begin
  1323. emit_reg_reg(op,S_L,p^.right^.location.registerlow,
  1324. p^.location.registerlow);
  1325. emit_reg_reg(op2,S_L,p^.right^.location.registerhigh,
  1326. p^.location.registerhigh);
  1327. end
  1328. else
  1329. begin
  1330. exprasmlist^.concat(new(pai386,op_ref_reg(op,S_L,newreference(
  1331. p^.right^.location.reference),p^.location.registerlow)));
  1332. hr:=newreference(p^.right^.location.reference);
  1333. inc(hr^.offset,4);
  1334. exprasmlist^.concat(new(pai386,op_ref_reg(op2,S_L,
  1335. hr,p^.location.registerhigh)));
  1336. ungetiftemp(p^.right^.location.reference);
  1337. del_reference(p^.right^.location.reference);
  1338. end;
  1339. end;
  1340. end;
  1341. end
  1342. else
  1343. begin
  1344. { when swapped another result register }
  1345. if (p^.treetype=subn) and p^.swaped then
  1346. begin
  1347. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  1348. p^.location.register,p^.right^.location.register)));
  1349. swap_location(p^.location,p^.right^.location);
  1350. { newly swapped also set swapped flag }
  1351. { just to maintain ordering }
  1352. p^.swaped:=not(p^.swaped);
  1353. end
  1354. else if cmpop then
  1355. begin
  1356. exprasmlist^.concat(new(pai386,op_reg_reg(A_CMP,S_L,
  1357. p^.right^.location.registerhigh,
  1358. p^.location.registerhigh)));
  1359. emitl(flag_2_jmp[getresflags(p,unsigned)],truelabel);
  1360. exprasmlist^.concat(new(pai386,op_reg_reg(A_CMP,S_L,
  1361. p^.right^.location.registerlow,
  1362. p^.location.registerlow)));
  1363. emitl(flag_2_jmp[getresflags(p,unsigned)],truelabel);
  1364. emitl(A_JMP,falselabel);
  1365. end
  1366. else
  1367. begin
  1368. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_L,
  1369. p^.right^.location.registerlow,
  1370. p^.location.registerlow)));
  1371. exprasmlist^.concat(new(pai386,op_reg_reg(op2,S_L,
  1372. p^.right^.location.registerhigh,
  1373. p^.location.registerhigh)));
  1374. end;
  1375. ungetregister32(p^.right^.location.registerlow);
  1376. ungetregister32(p^.right^.location.registerhigh);
  1377. end;
  1378. if cmpop then
  1379. begin
  1380. ungetregister32(p^.location.registerlow);
  1381. ungetregister32(p^.location.registerhigh);
  1382. end;
  1383. { only in case of overflow operations }
  1384. { produce overflow code }
  1385. { we must put it here directly, because sign of operation }
  1386. { is in unsigned VAR!! }
  1387. if mboverflow then
  1388. begin
  1389. if cs_check_overflow in aktlocalswitches then
  1390. begin
  1391. getlabel(hl4);
  1392. if unsigned then
  1393. emitl(A_JNB,hl4)
  1394. else
  1395. emitl(A_JNO,hl4);
  1396. emitcall('FPC_OVERFLOW',true);
  1397. emitl(A_LABEL,hl4);
  1398. end;
  1399. end;
  1400. { we have LOC_JUMP as result }
  1401. if cmpop then
  1402. begin
  1403. clear_location(p^.location);
  1404. p^.location.loc:=LOC_JUMP;
  1405. cmpop:=false;
  1406. end;
  1407. end;
  1408. end
  1409. else
  1410. { Floating point }
  1411. if (p^.left^.resulttype^.deftype=floatdef) and
  1412. (pfloatdef(p^.left^.resulttype)^.typ<>f32bit) then
  1413. begin
  1414. { real constants to the left }
  1415. if p^.left^.treetype=realconstn then
  1416. swaptree(p);
  1417. cmpop:=false;
  1418. case p^.treetype of
  1419. addn : op:=A_FADDP;
  1420. muln : op:=A_FMULP;
  1421. subn : op:=A_FSUBP;
  1422. slashn : op:=A_FDIVP;
  1423. ltn,lten,gtn,gten,
  1424. equaln,unequaln : begin
  1425. op:=A_FCOMPP;
  1426. cmpop:=true;
  1427. end;
  1428. else CGMessage(type_e_mismatch);
  1429. end;
  1430. if (p^.right^.location.loc<>LOC_FPU) then
  1431. begin
  1432. floatload(pfloatdef(p^.right^.resulttype)^.typ,p^.right^.location.reference);
  1433. if (p^.left^.location.loc<>LOC_FPU) then
  1434. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  1435. { left was on the stack => swap }
  1436. else
  1437. p^.swaped:=not(p^.swaped);
  1438. { releases the right reference }
  1439. del_reference(p^.right^.location.reference);
  1440. end
  1441. { the nominator in st0 }
  1442. else if (p^.left^.location.loc<>LOC_FPU) then
  1443. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  1444. { fpu operands are always in the wrong order on the stack }
  1445. else
  1446. p^.swaped:=not(p^.swaped);
  1447. { releases the left reference }
  1448. if (p^.left^.location.loc<>LOC_FPU) then
  1449. del_reference(p^.left^.location.reference);
  1450. { if we swaped the tree nodes, then use the reverse operator }
  1451. if p^.swaped then
  1452. begin
  1453. if (p^.treetype=slashn) then
  1454. op:=A_FDIVRP
  1455. else if (p^.treetype=subn) then
  1456. op:=A_FSUBRP;
  1457. end;
  1458. { to avoid the pentium bug
  1459. if (op=FDIVP) and (opt_processors=pentium) then
  1460. exprasmlist^.concat(new(pai386,op_CALL,S_NO,'EMUL_FDIVP')
  1461. else
  1462. }
  1463. { the Intel assemblers want operands }
  1464. if op<>A_FCOMPP then
  1465. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,R_ST,R_ST1)))
  1466. else
  1467. exprasmlist^.concat(new(pai386,op_none(op,S_NO)));
  1468. { on comparison load flags }
  1469. if cmpop then
  1470. begin
  1471. if not(R_EAX in unused) then
  1472. emit_reg_reg(A_MOV,S_L,R_EAX,R_EDI);
  1473. exprasmlist^.concat(new(pai386,op_reg(A_FNSTSW,S_NO,R_AX)));
  1474. exprasmlist^.concat(new(pai386,op_none(A_SAHF,S_NO)));
  1475. if not(R_EAX in unused) then
  1476. emit_reg_reg(A_MOV,S_L,R_EDI,R_EAX);
  1477. if p^.swaped then
  1478. begin
  1479. case p^.treetype of
  1480. equaln : flags:=F_E;
  1481. unequaln : flags:=F_NE;
  1482. ltn : flags:=F_A;
  1483. lten : flags:=F_AE;
  1484. gtn : flags:=F_B;
  1485. gten : flags:=F_BE;
  1486. end;
  1487. end
  1488. else
  1489. begin
  1490. case p^.treetype of
  1491. equaln : flags:=F_E;
  1492. unequaln : flags:=F_NE;
  1493. ltn : flags:=F_B;
  1494. lten : flags:=F_BE;
  1495. gtn : flags:=F_A;
  1496. gten : flags:=F_AE;
  1497. end;
  1498. end;
  1499. clear_location(p^.location);
  1500. p^.location.loc:=LOC_FLAGS;
  1501. p^.location.resflags:=flags;
  1502. cmpop:=false;
  1503. end
  1504. else
  1505. begin
  1506. clear_location(p^.location);
  1507. p^.location.loc:=LOC_FPU;
  1508. end;
  1509. end
  1510. {$ifdef SUPPORT_MMX}
  1511. else
  1512. { MMX Arrays }
  1513. if is_mmx_able_array(p^.left^.resulttype) then
  1514. begin
  1515. cmpop:=false;
  1516. mmxbase:=mmx_type(p^.left^.resulttype);
  1517. case p^.treetype of
  1518. addn : begin
  1519. if (cs_mmx_saturation in aktlocalswitches) then
  1520. begin
  1521. case mmxbase of
  1522. mmxs8bit:
  1523. op:=A_PADDSB;
  1524. mmxu8bit:
  1525. op:=A_PADDUSB;
  1526. mmxs16bit,mmxfixed16:
  1527. op:=A_PADDSB;
  1528. mmxu16bit:
  1529. op:=A_PADDUSW;
  1530. end;
  1531. end
  1532. else
  1533. begin
  1534. case mmxbase of
  1535. mmxs8bit,mmxu8bit:
  1536. op:=A_PADDB;
  1537. mmxs16bit,mmxu16bit,mmxfixed16:
  1538. op:=A_PADDW;
  1539. mmxs32bit,mmxu32bit:
  1540. op:=A_PADDD;
  1541. end;
  1542. end;
  1543. end;
  1544. muln : begin
  1545. case mmxbase of
  1546. mmxs16bit,mmxu16bit:
  1547. op:=A_PMULLW;
  1548. mmxfixed16:
  1549. op:=A_PMULHW;
  1550. end;
  1551. end;
  1552. subn : begin
  1553. if (cs_mmx_saturation in aktlocalswitches) then
  1554. begin
  1555. case mmxbase of
  1556. mmxs8bit:
  1557. op:=A_PSUBSB;
  1558. mmxu8bit:
  1559. op:=A_PSUBUSB;
  1560. mmxs16bit,mmxfixed16:
  1561. op:=A_PSUBSB;
  1562. mmxu16bit:
  1563. op:=A_PSUBUSW;
  1564. end;
  1565. end
  1566. else
  1567. begin
  1568. case mmxbase of
  1569. mmxs8bit,mmxu8bit:
  1570. op:=A_PSUBB;
  1571. mmxs16bit,mmxu16bit,mmxfixed16:
  1572. op:=A_PSUBW;
  1573. mmxs32bit,mmxu32bit:
  1574. op:=A_PSUBD;
  1575. end;
  1576. end;
  1577. end;
  1578. {
  1579. ltn,lten,gtn,gten,
  1580. equaln,unequaln :
  1581. begin
  1582. op:=A_CMP;
  1583. cmpop:=true;
  1584. end;
  1585. }
  1586. xorn:
  1587. op:=A_PXOR;
  1588. orn:
  1589. op:=A_POR;
  1590. andn:
  1591. op:=A_PAND;
  1592. else CGMessage(type_e_mismatch);
  1593. end;
  1594. { left and right no register? }
  1595. { then one must be demanded }
  1596. if (p^.left^.location.loc<>LOC_MMXREGISTER) and
  1597. (p^.right^.location.loc<>LOC_MMXREGISTER) then
  1598. begin
  1599. { register variable ? }
  1600. if (p^.left^.location.loc=LOC_CMMXREGISTER) then
  1601. begin
  1602. { it is OK if this is the destination }
  1603. if is_in_dest then
  1604. begin
  1605. hregister:=p^.location.register;
  1606. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1607. hregister);
  1608. end
  1609. else
  1610. begin
  1611. hregister:=getregistermmx;
  1612. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1613. hregister);
  1614. end
  1615. end
  1616. else
  1617. begin
  1618. del_reference(p^.left^.location.reference);
  1619. if is_in_dest then
  1620. begin
  1621. hregister:=p^.location.register;
  1622. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1623. newreference(p^.left^.location.reference),hregister)));
  1624. end
  1625. else
  1626. begin
  1627. hregister:=getregistermmx;
  1628. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1629. newreference(p^.left^.location.reference),hregister)));
  1630. end;
  1631. end;
  1632. clear_location(p^.location);
  1633. p^.location.loc:=LOC_MMXREGISTER;
  1634. p^.location.register:=hregister;
  1635. end
  1636. else
  1637. { if on the right the register then swap }
  1638. if (p^.right^.location.loc=LOC_MMXREGISTER) then
  1639. begin
  1640. swap_location(p^.location,p^.right^.location);
  1641. { newly swapped also set swapped flag }
  1642. p^.swaped:=not(p^.swaped);
  1643. end;
  1644. { at this point, p^.location.loc should be LOC_MMXREGISTER }
  1645. { and p^.location.register should be a valid register }
  1646. { containing the left result }
  1647. if p^.right^.location.loc<>LOC_MMXREGISTER then
  1648. begin
  1649. if (p^.treetype=subn) and p^.swaped then
  1650. begin
  1651. if p^.right^.location.loc=LOC_CMMXREGISTER then
  1652. begin
  1653. emit_reg_reg(A_MOVQ,S_NO,p^.right^.location.register,R_MM7);
  1654. emit_reg_reg(op,S_NO,p^.location.register,R_EDI);
  1655. emit_reg_reg(A_MOVQ,S_NO,R_MM7,p^.location.register);
  1656. end
  1657. else
  1658. begin
  1659. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1660. newreference(p^.right^.location.reference),R_MM7)));
  1661. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,p^.location.register,
  1662. R_MM7)));
  1663. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVQ,S_NO,
  1664. R_MM7,p^.location.register)));
  1665. del_reference(p^.right^.location.reference);
  1666. end;
  1667. end
  1668. else
  1669. begin
  1670. if (p^.right^.location.loc=LOC_CREGISTER) then
  1671. begin
  1672. emit_reg_reg(op,S_NO,p^.right^.location.register,
  1673. p^.location.register);
  1674. end
  1675. else
  1676. begin
  1677. exprasmlist^.concat(new(pai386,op_ref_reg(op,S_NO,newreference(
  1678. p^.right^.location.reference),p^.location.register)));
  1679. del_reference(p^.right^.location.reference);
  1680. end;
  1681. end;
  1682. end
  1683. else
  1684. begin
  1685. { when swapped another result register }
  1686. if (p^.treetype=subn) and p^.swaped then
  1687. begin
  1688. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1689. p^.location.register,p^.right^.location.register)));
  1690. swap_location(p^.location,p^.right^.location);
  1691. { newly swapped also set swapped flag }
  1692. { just to maintain ordering }
  1693. p^.swaped:=not(p^.swaped);
  1694. end
  1695. else
  1696. begin
  1697. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1698. p^.right^.location.register,
  1699. p^.location.register)));
  1700. end;
  1701. ungetregistermmx(p^.right^.location.register);
  1702. end;
  1703. end
  1704. {$endif SUPPORT_MMX}
  1705. else CGMessage(type_e_mismatch);
  1706. end;
  1707. SetResultLocation(cmpop,unsigned,p);
  1708. end;
  1709. end.
  1710. {
  1711. $Log$
  1712. Revision 1.41 1999-01-20 19:23:10 jonas
  1713. * fixed set1 <= set2 for small sets
  1714. Revision 1.40 1999/01/20 17:39:22 jonas
  1715. + fixed bug0163 (set1 <= set2 support)
  1716. Revision 1.39 1999/01/19 10:18:58 florian
  1717. * bug with mul. of dwords fixed, reported by Alexander Stohr
  1718. * some changes to compile with TP
  1719. + small enhancements for the new code generator
  1720. Revision 1.38 1999/01/05 17:03:36 jonas
  1721. * don't output inc/dec if cs_check_overflow is on, because inc/dec don't change
  1722. the carry flag
  1723. Revision 1.37 1998/12/22 13:10:56 florian
  1724. * memory leaks for ansistring type casts fixed
  1725. Revision 1.36 1998/12/19 00:23:40 florian
  1726. * ansistring memory leaks fixed
  1727. Revision 1.35 1998/12/11 23:36:06 florian
  1728. + again more stuff for int64/qword:
  1729. - comparision operators
  1730. - code generation for: str, read(ln), write(ln)
  1731. Revision 1.34 1998/12/11 00:02:46 peter
  1732. + globtype,tokens,version unit splitted from globals
  1733. Revision 1.33 1998/12/10 11:16:00 florian
  1734. + some basic operations with qwords and int64 added: +, xor, and, or;
  1735. the register allocation works fine
  1736. Revision 1.32 1998/12/10 09:47:13 florian
  1737. + basic operations with int64/qord (compiler with -dint64)
  1738. + rtti of enumerations extended: names are now written
  1739. Revision 1.31 1998/11/30 09:42:59 pierre
  1740. * some range check bugs fixed (still not working !)
  1741. + added DLL writing support for win32 (also accepts variables)
  1742. + TempAnsi for code that could be used for Temporary ansi strings
  1743. handling
  1744. Revision 1.30 1998/11/24 12:52:40 peter
  1745. * sets are not written twice anymore
  1746. * optimize for emptyset+single element which uses a new routine from
  1747. set.inc FPC_SET_CREATE_ELEMENT
  1748. Revision 1.29 1998/11/18 15:44:05 peter
  1749. * VALUEPARA for tp7 compatible value parameters
  1750. Revision 1.28 1998/11/18 09:18:01 pierre
  1751. + automatic loading of profile unit with -pg option
  1752. in go32v2 mode (also defines FPC_PROFILE)
  1753. * some memory leaks removed
  1754. * unreleased temp problem with sets solved
  1755. Revision 1.27 1998/11/17 00:36:38 peter
  1756. * more ansistring fixes
  1757. Revision 1.26 1998/11/16 16:17:16 peter
  1758. * fixed ansistring temp which forgot a reset
  1759. Revision 1.25 1998/11/16 15:35:35 peter
  1760. * rename laod/copystring -> load/copyshortstring
  1761. * fixed int-bool cnv bug
  1762. + char-ansistring conversion
  1763. Revision 1.24 1998/11/07 12:49:30 peter
  1764. * fixed ansicompare which returns signed
  1765. Revision 1.23 1998/10/29 15:42:43 florian
  1766. + partial disposing of temp. ansistrings
  1767. Revision 1.22 1998/10/28 18:26:12 pierre
  1768. * removed some erros after other errors (introduced by useexcept)
  1769. * stabs works again correctly (for how long !)
  1770. Revision 1.21 1998/10/25 23:32:48 peter
  1771. * fixed unsigned mul
  1772. Revision 1.20 1998/10/21 08:39:56 florian
  1773. + ansistring operator +
  1774. + $h and string[n] for n>255 added
  1775. * small problem with TP fixed
  1776. Revision 1.19 1998/10/20 15:09:21 florian
  1777. + binary operators for ansi strings
  1778. Revision 1.18 1998/10/20 08:06:38 pierre
  1779. * several memory corruptions due to double freemem solved
  1780. => never use p^.loc.location:=p^.left^.loc.location;
  1781. + finally I added now by default
  1782. that ra386dir translates global and unit symbols
  1783. + added a first field in tsymtable and
  1784. a nextsym field in tsym
  1785. (this allows to obtain ordered type info for
  1786. records and objects in gdb !)
  1787. Revision 1.17 1998/10/09 11:47:45 pierre
  1788. * still more memory leaks fixes !!
  1789. Revision 1.16 1998/10/09 08:56:21 pierre
  1790. * several memory leaks fixed
  1791. Revision 1.15 1998/10/08 17:17:10 pierre
  1792. * current_module old scanner tagged as invalid if unit is recompiled
  1793. + added ppheap for better info on tracegetmem of heaptrc
  1794. (adds line column and file index)
  1795. * several memory leaks removed ith help of heaptrc !!
  1796. Revision 1.14 1998/09/28 16:57:13 pierre
  1797. * changed all length(p^.value_str^) into str_length(p)
  1798. to get it work with and without ansistrings
  1799. * changed sourcefiles field of tmodule to a pointer
  1800. Revision 1.13 1998/09/17 09:42:09 peter
  1801. + pass_2 for cg386
  1802. * Message() -> CGMessage() for pass_1/pass_2
  1803. Revision 1.12 1998/09/14 10:43:44 peter
  1804. * all internal RTL functions start with FPC_
  1805. Revision 1.11 1998/09/07 18:45:52 peter
  1806. * update smartlinking, uses getdatalabel
  1807. * renamed ptree.value vars to value_str,value_real,value_set
  1808. Revision 1.10 1998/09/04 10:05:04 florian
  1809. * ugly fix for STRCAT, nevertheless it needs more fixing !!!!!!!
  1810. we need an new version of STRCAT which takes a length parameter
  1811. Revision 1.9 1998/09/04 08:41:36 peter
  1812. * updated some error CGMessages
  1813. Revision 1.8 1998/08/28 10:54:18 peter
  1814. * fixed smallset generation from elements, it has never worked before!
  1815. Revision 1.7 1998/08/19 14:56:59 peter
  1816. * forgot to removed some unused code in addset for set<>set
  1817. Revision 1.6 1998/08/18 09:24:35 pierre
  1818. * small warning position bug fixed
  1819. * support_mmx switches splitting was missing
  1820. * rhide error and warning output corrected
  1821. Revision 1.5 1998/08/14 18:18:37 peter
  1822. + dynamic set contruction
  1823. * smallsets are now working (always longint size)
  1824. Revision 1.4 1998/08/10 14:49:42 peter
  1825. + localswitches, moduleswitches, globalswitches splitting
  1826. Revision 1.3 1998/06/25 08:48:04 florian
  1827. * first version of rtti support
  1828. Revision 1.2 1998/06/08 13:13:28 pierre
  1829. + temporary variables now in temp_gen.pas unit
  1830. because it is processor independent
  1831. * mppc68k.bat modified to undefine i386 and support_mmx
  1832. (which are defaults for i386)
  1833. Revision 1.1 1998/06/05 17:44:10 peter
  1834. * splitted cgi386
  1835. }