cg386add.pas 102 KB

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