cg386add.pas 103 KB

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