cg386add.pas 99 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166
  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 : 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. secondpass(p^.left);
  638. { if in flags then copy first to register, because the
  639. flags can be destroyed }
  640. if (p^.left^.location.loc=LOC_FLAGS) then
  641. locflags2reg(p^.left^.location,opsize);
  642. set_location(p^.location,p^.left^.location);
  643. pushed:=maybe_push(p^.right^.registers32,p);
  644. secondpass(p^.right);
  645. if pushed then restore(p);
  646. goto do_normal;
  647. end
  648. else
  649. CGMessage(type_e_mismatch);
  650. end
  651. end
  652. else
  653. begin
  654. { in case of constant put it to the left }
  655. if (p^.left^.treetype=ordconstn) then
  656. swaptree(p);
  657. secondpass(p^.left);
  658. { this will be complicated as
  659. a lot of code below assumes that
  660. p^.location and p^.left^.location are the same }
  661. {$ifdef test_dest_loc}
  662. if dest_loc_known and (dest_loc_tree=p) and
  663. ((dest_loc.loc=LOC_REGISTER) or (dest_loc.loc=LOC_CREGISTER)) then
  664. begin
  665. set_location(p^.location,dest_loc);
  666. in_dest_loc:=true;
  667. is_in_dest:=true;
  668. end
  669. else
  670. {$endif test_dest_loc}
  671. set_location(p^.location,p^.left^.location);
  672. { are too few registers free? }
  673. pushed:=maybe_push(p^.right^.registers32,p);
  674. secondpass(p^.right);
  675. if pushed then
  676. restore(p);
  677. if (p^.left^.resulttype^.deftype=pointerdef) or
  678. (p^.right^.resulttype^.deftype=pointerdef) or
  679. ((p^.right^.resulttype^.deftype=objectdef) and
  680. pobjectdef(p^.right^.resulttype)^.isclass and
  681. (p^.left^.resulttype^.deftype=objectdef) and
  682. pobjectdef(p^.left^.resulttype)^.isclass
  683. ) or
  684. (p^.left^.resulttype^.deftype=classrefdef) or
  685. (p^.left^.resulttype^.deftype=procvardef) or
  686. ((p^.left^.resulttype^.deftype=enumdef) and
  687. (p^.left^.resulttype^.size=4)) or
  688. ((p^.left^.resulttype^.deftype=orddef) and
  689. (porddef(p^.left^.resulttype)^.typ=s32bit)) or
  690. ((p^.right^.resulttype^.deftype=orddef) and
  691. (porddef(p^.right^.resulttype)^.typ=s32bit)) or
  692. ((p^.left^.resulttype^.deftype=orddef) and
  693. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  694. ((p^.right^.resulttype^.deftype=orddef) and
  695. (porddef(p^.right^.resulttype)^.typ=u32bit)) or
  696. { as well as small sets }
  697. is_set then
  698. begin
  699. do_normal:
  700. mboverflow:=false;
  701. cmpop:=false;
  702. if (p^.left^.resulttype^.deftype=pointerdef) or
  703. (p^.right^.resulttype^.deftype=pointerdef) or
  704. ((p^.left^.resulttype^.deftype=orddef) and
  705. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  706. ((p^.right^.resulttype^.deftype=orddef) and
  707. (porddef(p^.right^.resulttype)^.typ=u32bit)) then
  708. unsigned:=true;
  709. case p^.treetype of
  710. addn : begin
  711. if is_set then
  712. begin
  713. { adding elements is not commutative }
  714. if p^.swaped and (p^.left^.treetype=setelementn) then
  715. swaptree(p);
  716. { are we adding set elements ? }
  717. if p^.right^.treetype=setelementn then
  718. begin
  719. { no range support for smallsets! }
  720. if assigned(p^.right^.right) then
  721. internalerror(43244);
  722. { bts requires both elements to be registers }
  723. if p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  724. begin
  725. ungetiftemp(p^.left^.location.reference);
  726. del_reference(p^.left^.location.reference);
  727. {!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!}
  728. hregister:=getregister32;
  729. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  730. newreference(p^.left^.location.reference),hregister)));
  731. clear_location(p^.left^.location);
  732. p^.left^.location.loc:=LOC_REGISTER;
  733. p^.left^.location.register:=hregister;
  734. set_location(p^.location,p^.left^.location);
  735. end;
  736. if p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  737. begin
  738. ungetiftemp(p^.right^.location.reference);
  739. del_reference(p^.right^.location.reference);
  740. hregister:=getregister32;
  741. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  742. newreference(p^.right^.location.reference),hregister)));
  743. clear_location(p^.right^.location);
  744. p^.right^.location.loc:=LOC_REGISTER;
  745. p^.right^.location.register:=hregister;
  746. end;
  747. op:=A_BTS;
  748. noswap:=true;
  749. end
  750. else
  751. op:=A_OR;
  752. mboverflow:=false;
  753. unsigned:=false;
  754. end
  755. else
  756. begin
  757. op:=A_ADD;
  758. mboverflow:=true;
  759. end;
  760. end;
  761. symdifn : begin
  762. { the symetric diff is only for sets }
  763. if is_set then
  764. begin
  765. op:=A_XOR;
  766. mboverflow:=false;
  767. unsigned:=false;
  768. end
  769. else
  770. CGMessage(type_e_mismatch);
  771. end;
  772. muln : begin
  773. if is_set then
  774. begin
  775. op:=A_AND;
  776. mboverflow:=false;
  777. unsigned:=false;
  778. end
  779. else
  780. begin
  781. if unsigned then
  782. op:=A_MUL
  783. else
  784. op:=A_IMUL;
  785. mboverflow:=true;
  786. end;
  787. end;
  788. subn : begin
  789. if is_set then
  790. begin
  791. op:=A_AND;
  792. mboverflow:=false;
  793. unsigned:=false;
  794. extra_not:=true;
  795. end
  796. else
  797. begin
  798. op:=A_SUB;
  799. mboverflow:=true;
  800. end;
  801. end;
  802. ltn,lten,
  803. gtn,gten,
  804. equaln,unequaln : begin
  805. {$IfNDef NoSetInclusion}
  806. If is_set Then
  807. Case p^.treetype of
  808. lten,gten:
  809. Begin
  810. If p^.treetype = gten then
  811. swaptree(p);
  812. if p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  813. begin
  814. ungetiftemp(p^.left^.location.reference);
  815. del_reference(p^.left^.location.reference);
  816. hregister:=getregister32;
  817. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  818. newreference(p^.left^.location.reference),hregister)));
  819. clear_location(p^.left^.location);
  820. p^.left^.location.loc:=LOC_REGISTER;
  821. p^.left^.location.register:=hregister;
  822. set_location(p^.location,p^.left^.location);
  823. end
  824. else
  825. if p^.left^.location.loc = LOC_CREGISTER Then
  826. {save the register var in a temp register, because
  827. its value is going to be modified}
  828. begin
  829. hregister := getregister32;
  830. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,
  831. p^.left^.location.register,hregister)));
  832. clear_location(p^.left^.location);
  833. p^.left^.location.loc:=LOC_REGISTER;
  834. p^.left^.location.register:=hregister;
  835. set_location(p^.location,p^.left^.location);
  836. end;
  837. {here, p^.left^.location should be LOC_REGISTER}
  838. If p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE] Then
  839. exprasmlist^.concat(new(pai386,op_ref_reg(A_AND,opsize,
  840. newreference(p^.right^.location.reference),p^.left^.location.register)))
  841. Else
  842. exprasmlist^.concat(new(pai386,op_reg_reg(A_AND,opsize,
  843. p^.right^.location.register,p^.left^.location.register)));
  844. {warning: ugly hack ahead: we need a "jne" after the cmp, so
  845. change the treetype from lten/gten to equaln}
  846. p^.treetype := equaln
  847. End;
  848. {no < or > support for sets}
  849. ltn,gtn: CGMessage(type_e_mismatch);
  850. End;
  851. {$EndIf NoSetInclusion}
  852. op:=A_CMP;
  853. cmpop:=true;
  854. end;
  855. xorn : op:=A_XOR;
  856. orn : op:=A_OR;
  857. andn : op:=A_AND;
  858. else
  859. CGMessage(type_e_mismatch);
  860. end;
  861. { filter MUL, which requires special handling }
  862. if op=A_MUL then
  863. begin
  864. popeax:=false;
  865. popedx:=false;
  866. { here you need to free the symbol first }
  867. clear_location(p^.location);
  868. p^.location.register:=getregister32;
  869. p^.location.loc:=LOC_REGISTER;
  870. if not(R_EAX in unused) and (p^.location.register<>R_EAX) then
  871. begin
  872. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,R_EAX)));
  873. popeax:=true;
  874. end;
  875. if not(R_EDX in unused) and (p^.location.register<>R_EDX) then
  876. begin
  877. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,R_EDX)));
  878. popedx:=true;
  879. end;
  880. emitloadord2reg(p^.left^.location,u32bitdef,R_EDI,true);
  881. emitloadord2reg(p^.right^.location,u32bitdef,R_EAX,true);
  882. exprasmlist^.concat(new(pai386,op_reg(A_MUL,S_L,R_EDI)));
  883. emit_reg_reg(A_MOV,S_L,R_EAX,p^.location.register);
  884. if popedx then
  885. exprasmlist^.concat(new(pai386,op_reg(A_POP,S_L,R_EDX)));
  886. if popeax then
  887. exprasmlist^.concat(new(pai386,op_reg(A_POP,S_L,R_EAX)));
  888. SetResultLocation(false,true,p);
  889. exit;
  890. end;
  891. { Convert flags to register first }
  892. if (p^.left^.location.loc=LOC_FLAGS) then
  893. locflags2reg(p^.left^.location,opsize);
  894. if (p^.right^.location.loc=LOC_FLAGS) then
  895. locflags2reg(p^.right^.location,opsize);
  896. { left and right no register? }
  897. { then one must be demanded }
  898. if (p^.left^.location.loc<>LOC_REGISTER) and
  899. (p^.right^.location.loc<>LOC_REGISTER) then
  900. begin
  901. { register variable ? }
  902. if (p^.left^.location.loc=LOC_CREGISTER) then
  903. begin
  904. { it is OK if this is the destination }
  905. if is_in_dest then
  906. begin
  907. hregister:=p^.location.register;
  908. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  909. hregister);
  910. end
  911. else
  912. if cmpop then
  913. begin
  914. { do not disturb the register }
  915. hregister:=p^.location.register;
  916. end
  917. else
  918. begin
  919. case opsize of
  920. S_L : hregister:=getregister32;
  921. S_B : hregister:=reg32toreg8(getregister32);
  922. end;
  923. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  924. hregister);
  925. end
  926. end
  927. else
  928. begin
  929. ungetiftemp(p^.left^.location.reference);
  930. del_reference(p^.left^.location.reference);
  931. if is_in_dest then
  932. begin
  933. hregister:=p^.location.register;
  934. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  935. newreference(p^.left^.location.reference),hregister)));
  936. end
  937. else
  938. begin
  939. { first give free, then demand new register }
  940. case opsize of
  941. S_L : hregister:=getregister32;
  942. S_W : hregister:=reg32toreg16(getregister32);
  943. S_B : hregister:=reg32toreg8(getregister32);
  944. end;
  945. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  946. newreference(p^.left^.location.reference),hregister)));
  947. end;
  948. end;
  949. clear_location(p^.location);
  950. p^.location.loc:=LOC_REGISTER;
  951. p^.location.register:=hregister;
  952. end
  953. else
  954. { if on the right the register then swap }
  955. if not(noswap) and (p^.right^.location.loc=LOC_REGISTER) then
  956. begin
  957. swap_location(p^.location,p^.right^.location);
  958. { newly swapped also set swapped flag }
  959. p^.swaped:=not(p^.swaped);
  960. end;
  961. { at this point, p^.location.loc should be LOC_REGISTER }
  962. { and p^.location.register should be a valid register }
  963. { containing the left result }
  964. if p^.right^.location.loc<>LOC_REGISTER then
  965. begin
  966. if (p^.treetype=subn) and p^.swaped then
  967. begin
  968. if p^.right^.location.loc=LOC_CREGISTER then
  969. begin
  970. if extra_not then
  971. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  972. emit_reg_reg(A_MOV,opsize,p^.right^.location.register,R_EDI);
  973. emit_reg_reg(op,opsize,p^.location.register,R_EDI);
  974. emit_reg_reg(A_MOV,opsize,R_EDI,p^.location.register);
  975. end
  976. else
  977. begin
  978. if extra_not then
  979. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  980. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  981. newreference(p^.right^.location.reference),R_EDI)));
  982. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,p^.location.register,R_EDI)));
  983. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,R_EDI,p^.location.register)));
  984. ungetiftemp(p^.right^.location.reference);
  985. del_reference(p^.right^.location.reference);
  986. end;
  987. end
  988. else
  989. begin
  990. if (p^.right^.treetype=ordconstn) and
  991. (op=A_CMP) and
  992. (p^.right^.value=0) then
  993. begin
  994. exprasmlist^.concat(new(pai386,op_reg_reg(A_TEST,opsize,p^.location.register,
  995. p^.location.register)));
  996. end
  997. else if (p^.right^.treetype=ordconstn) and
  998. (op=A_ADD) and
  999. (p^.right^.value=1) and
  1000. not(cs_check_overflow in aktlocalswitches) then
  1001. begin
  1002. exprasmlist^.concat(new(pai386,op_reg(A_INC,opsize,
  1003. p^.location.register)));
  1004. end
  1005. else if (p^.right^.treetype=ordconstn) and
  1006. (op=A_SUB) and
  1007. (p^.right^.value=1) and
  1008. not(cs_check_overflow in aktlocalswitches) then
  1009. begin
  1010. exprasmlist^.concat(new(pai386,op_reg(A_DEC,opsize,
  1011. p^.location.register)));
  1012. end
  1013. else if (p^.right^.treetype=ordconstn) and
  1014. (op=A_IMUL) and
  1015. (ispowerof2(p^.right^.value,power)) and
  1016. not(cs_check_overflow in aktlocalswitches) then
  1017. begin
  1018. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,opsize,power,
  1019. p^.location.register)));
  1020. end
  1021. else
  1022. begin
  1023. if (p^.right^.location.loc=LOC_CREGISTER) then
  1024. begin
  1025. if extra_not then
  1026. begin
  1027. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,R_EDI);
  1028. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  1029. emit_reg_reg(A_AND,S_L,R_EDI,
  1030. p^.location.register);
  1031. end
  1032. else
  1033. begin
  1034. emit_reg_reg(op,opsize,p^.right^.location.register,
  1035. p^.location.register);
  1036. end;
  1037. end
  1038. else
  1039. begin
  1040. if extra_not then
  1041. begin
  1042. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,newreference(
  1043. p^.right^.location.reference),R_EDI)));
  1044. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  1045. emit_reg_reg(A_AND,S_L,R_EDI,
  1046. p^.location.register);
  1047. end
  1048. else
  1049. begin
  1050. exprasmlist^.concat(new(pai386,op_ref_reg(op,opsize,newreference(
  1051. p^.right^.location.reference),p^.location.register)));
  1052. end;
  1053. ungetiftemp(p^.right^.location.reference);
  1054. del_reference(p^.right^.location.reference);
  1055. end;
  1056. end;
  1057. end;
  1058. end
  1059. else
  1060. begin
  1061. { when swapped another result register }
  1062. if (p^.treetype=subn) and p^.swaped then
  1063. begin
  1064. if extra_not then
  1065. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.location.register)));
  1066. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  1067. p^.location.register,p^.right^.location.register)));
  1068. swap_location(p^.location,p^.right^.location);
  1069. { newly swapped also set swapped flag }
  1070. { just to maintain ordering }
  1071. p^.swaped:=not(p^.swaped);
  1072. end
  1073. else
  1074. begin
  1075. if extra_not then
  1076. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.right^.location.register)));
  1077. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  1078. p^.right^.location.register,
  1079. p^.location.register)));
  1080. end;
  1081. case opsize of
  1082. S_L : ungetregister32(p^.right^.location.register);
  1083. S_B : ungetregister32(reg8toreg32(p^.right^.location.register));
  1084. end;
  1085. end;
  1086. if cmpop then
  1087. case opsize of
  1088. S_L : ungetregister32(p^.location.register);
  1089. S_B : ungetregister32(reg8toreg32(p^.location.register));
  1090. end;
  1091. { only in case of overflow operations }
  1092. { produce overflow code }
  1093. { we must put it here directly, because sign of operation }
  1094. { is in unsigned VAR!! }
  1095. if mboverflow then
  1096. begin
  1097. if cs_check_overflow in aktlocalswitches then
  1098. begin
  1099. getlabel(hl4);
  1100. if unsigned then
  1101. emitjmp(C_NB,hl4)
  1102. else
  1103. emitjmp(C_NO,hl4);
  1104. emitcall('FPC_OVERFLOW',true);
  1105. emitlab(hl4);
  1106. end;
  1107. end;
  1108. end
  1109. else
  1110. { Char type }
  1111. if ((p^.left^.resulttype^.deftype=orddef) and
  1112. (porddef(p^.left^.resulttype)^.typ=uchar)) or
  1113. { enumeration type 16 bit }
  1114. ((p^.left^.resulttype^.deftype=enumdef) and
  1115. (p^.left^.resulttype^.size=1)) then
  1116. begin
  1117. case p^.treetype of
  1118. ltn,lten,gtn,gten,
  1119. equaln,unequaln :
  1120. cmpop:=true;
  1121. else CGMessage(type_e_mismatch);
  1122. end;
  1123. unsigned:=true;
  1124. { left and right no register? }
  1125. { the one must be demanded }
  1126. if (p^.location.loc<>LOC_REGISTER) and
  1127. (p^.right^.location.loc<>LOC_REGISTER) then
  1128. begin
  1129. if p^.location.loc=LOC_CREGISTER then
  1130. begin
  1131. if cmpop then
  1132. { do not disturb register }
  1133. hregister:=p^.location.register
  1134. else
  1135. begin
  1136. hregister:=reg32toreg8(getregister32);
  1137. emit_reg_reg(A_MOV,S_B,p^.location.register,
  1138. hregister);
  1139. end;
  1140. end
  1141. else
  1142. begin
  1143. del_reference(p^.location.reference);
  1144. { first give free then demand new register }
  1145. hregister:=reg32toreg8(getregister32);
  1146. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_B,newreference(p^.location.reference),
  1147. hregister)));
  1148. end;
  1149. clear_location(p^.location);
  1150. p^.location.loc:=LOC_REGISTER;
  1151. p^.location.register:=hregister;
  1152. end;
  1153. { now p always a register }
  1154. if (p^.right^.location.loc=LOC_REGISTER) and
  1155. (p^.location.loc<>LOC_REGISTER) then
  1156. begin
  1157. swap_location(p^.location,p^.right^.location);
  1158. { newly swapped also set swapped flag }
  1159. p^.swaped:=not(p^.swaped);
  1160. end;
  1161. if p^.right^.location.loc<>LOC_REGISTER then
  1162. begin
  1163. if p^.right^.location.loc=LOC_CREGISTER then
  1164. begin
  1165. emit_reg_reg(A_CMP,S_B,
  1166. p^.right^.location.register,p^.location.register);
  1167. end
  1168. else
  1169. begin
  1170. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_B,newreference(
  1171. p^.right^.location.reference),p^.location.register)));
  1172. del_reference(p^.right^.location.reference);
  1173. end;
  1174. end
  1175. else
  1176. begin
  1177. emit_reg_reg(A_CMP,S_B,p^.right^.location.register,
  1178. p^.location.register);
  1179. ungetregister32(reg8toreg32(p^.right^.location.register));
  1180. end;
  1181. ungetregister32(reg8toreg32(p^.location.register));
  1182. end
  1183. else
  1184. { 16 bit enumeration type }
  1185. if ((p^.left^.resulttype^.deftype=enumdef) and
  1186. (p^.left^.resulttype^.size=2)) then
  1187. begin
  1188. case p^.treetype of
  1189. ltn,lten,gtn,gten,
  1190. equaln,unequaln :
  1191. cmpop:=true;
  1192. else CGMessage(type_e_mismatch);
  1193. end;
  1194. unsigned:=true;
  1195. { left and right no register? }
  1196. { the one must be demanded }
  1197. if (p^.location.loc<>LOC_REGISTER) and
  1198. (p^.right^.location.loc<>LOC_REGISTER) then
  1199. begin
  1200. if p^.location.loc=LOC_CREGISTER then
  1201. begin
  1202. if cmpop then
  1203. { do not disturb register }
  1204. hregister:=p^.location.register
  1205. else
  1206. begin
  1207. hregister:=reg32toreg16(getregister32);
  1208. emit_reg_reg(A_MOV,S_W,p^.location.register,
  1209. hregister);
  1210. end;
  1211. end
  1212. else
  1213. begin
  1214. del_reference(p^.location.reference);
  1215. { first give free then demand new register }
  1216. hregister:=reg32toreg16(getregister32);
  1217. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_W,newreference(p^.location.reference),
  1218. hregister)));
  1219. end;
  1220. clear_location(p^.location);
  1221. p^.location.loc:=LOC_REGISTER;
  1222. p^.location.register:=hregister;
  1223. end;
  1224. { now p always a register }
  1225. if (p^.right^.location.loc=LOC_REGISTER) and
  1226. (p^.location.loc<>LOC_REGISTER) then
  1227. begin
  1228. swap_location(p^.location,p^.right^.location);
  1229. { newly swapped also set swapped flag }
  1230. p^.swaped:=not(p^.swaped);
  1231. end;
  1232. if p^.right^.location.loc<>LOC_REGISTER then
  1233. begin
  1234. if p^.right^.location.loc=LOC_CREGISTER then
  1235. begin
  1236. emit_reg_reg(A_CMP,S_W,
  1237. p^.right^.location.register,p^.location.register);
  1238. end
  1239. else
  1240. begin
  1241. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_W,newreference(
  1242. p^.right^.location.reference),p^.location.register)));
  1243. del_reference(p^.right^.location.reference);
  1244. end;
  1245. end
  1246. else
  1247. begin
  1248. emit_reg_reg(A_CMP,S_W,p^.right^.location.register,
  1249. p^.location.register);
  1250. ungetregister32(reg16toreg32(p^.right^.location.register));
  1251. end;
  1252. ungetregister32(reg16toreg32(p^.location.register));
  1253. end
  1254. else
  1255. { 64 bit types }
  1256. if is_64bitint(p^.left^.resulttype) then
  1257. begin
  1258. mboverflow:=false;
  1259. cmpop:=false;
  1260. unsigned:=((p^.left^.resulttype^.deftype=orddef) and
  1261. (porddef(p^.left^.resulttype)^.typ=u64bit)) or
  1262. ((p^.right^.resulttype^.deftype=orddef) and
  1263. (porddef(p^.right^.resulttype)^.typ=u64bit));
  1264. case p^.treetype of
  1265. addn : begin
  1266. begin
  1267. op:=A_ADD;
  1268. op2:=A_ADC;
  1269. mboverflow:=true;
  1270. end;
  1271. end;
  1272. subn : begin
  1273. op:=A_SUB;
  1274. op2:=A_SBB;
  1275. mboverflow:=true;
  1276. end;
  1277. ltn,lten,
  1278. gtn,gten,
  1279. equaln,unequaln:
  1280. begin
  1281. op:=A_CMP;
  1282. op2:=A_CMP;
  1283. cmpop:=true;
  1284. end;
  1285. xorn:
  1286. begin
  1287. op:=A_XOR;
  1288. op2:=A_XOR;
  1289. end;
  1290. orn:
  1291. begin
  1292. op:=A_OR;
  1293. op2:=A_OR;
  1294. end;
  1295. andn:
  1296. begin
  1297. op:=A_AND;
  1298. op2:=A_AND;
  1299. end;
  1300. muln:
  1301. ;
  1302. else
  1303. CGMessage(type_e_mismatch);
  1304. end;
  1305. if p^.treetype=muln then
  1306. begin
  1307. release_qword_loc(p^.left^.location);
  1308. release_qword_loc(p^.right^.location);
  1309. p^.location.registerlow:=getexplicitregister32(R_EAX);
  1310. p^.location.registerhigh:=getexplicitregister32(R_EDX);
  1311. pushusedregisters(pushedreg,$ff
  1312. and not($80 shr byte(p^.location.registerlow))
  1313. and not($80 shr byte(p^.location.registerhigh)));
  1314. if cs_check_overflow in aktlocalswitches then
  1315. push_int(1)
  1316. else
  1317. push_int(0);
  1318. emit_pushq_loc(p^.left^.location);
  1319. emit_pushq_loc(p^.right^.location);
  1320. if porddef(p^.resulttype)^.typ=u64bit then
  1321. emitcall('FPC_MUL_QWORD',true)
  1322. else
  1323. emitcall('FPC_MUL_INT64',true);
  1324. emit_reg_reg(A_MOV,S_L,R_EAX,p^.location.registerlow);
  1325. emit_reg_reg(A_MOV,S_L,R_EDX,p^.location.registerhigh);
  1326. popusedregisters(pushedreg);
  1327. p^.location.loc:=LOC_REGISTER;
  1328. end
  1329. else
  1330. begin
  1331. { left and right no register? }
  1332. { then one must be demanded }
  1333. if (p^.left^.location.loc<>LOC_REGISTER) and
  1334. (p^.right^.location.loc<>LOC_REGISTER) then
  1335. begin
  1336. { register variable ? }
  1337. if (p^.left^.location.loc=LOC_CREGISTER) then
  1338. begin
  1339. { it is OK if this is the destination }
  1340. if is_in_dest then
  1341. begin
  1342. hregister:=p^.location.registerlow;
  1343. hregister2:=p^.location.registerhigh;
  1344. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1345. hregister);
  1346. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1347. hregister2);
  1348. end
  1349. else
  1350. if cmpop then
  1351. begin
  1352. { do not disturb the register }
  1353. hregister:=p^.location.registerlow;
  1354. hregister2:=p^.location.registerhigh;
  1355. end
  1356. else
  1357. begin
  1358. hregister:=getregister32;
  1359. hregister2:=getregister32;
  1360. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1361. hregister);
  1362. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerhigh,
  1363. hregister2);
  1364. end
  1365. end
  1366. else
  1367. begin
  1368. ungetiftemp(p^.left^.location.reference);
  1369. del_reference(p^.left^.location.reference);
  1370. if is_in_dest then
  1371. begin
  1372. hregister:=p^.location.registerlow;
  1373. hregister2:=p^.location.registerhigh;
  1374. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1375. newreference(p^.left^.location.reference),hregister)));
  1376. hr:=newreference(p^.left^.location.reference);
  1377. inc(hr^.offset,4);
  1378. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1379. hr,hregister2)));
  1380. end
  1381. else
  1382. begin
  1383. hregister:=getregister32;
  1384. hregister2:=getregister32;
  1385. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1386. newreference(p^.left^.location.reference),hregister)));
  1387. hr:=newreference(p^.left^.location.reference);
  1388. inc(hr^.offset,4);
  1389. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1390. hr,hregister2)));
  1391. end;
  1392. end;
  1393. clear_location(p^.location);
  1394. p^.location.loc:=LOC_REGISTER;
  1395. p^.location.registerlow:=hregister;
  1396. p^.location.registerhigh:=hregister2;
  1397. end
  1398. else
  1399. { if on the right the register then swap }
  1400. if not(noswap) and (p^.right^.location.loc=LOC_REGISTER) then
  1401. begin
  1402. swap_location(p^.location,p^.right^.location);
  1403. { newly swapped also set swapped flag }
  1404. p^.swaped:=not(p^.swaped);
  1405. end;
  1406. { at this point, p^.location.loc should be LOC_REGISTER }
  1407. { and p^.location.register should be a valid register }
  1408. { containing the left result }
  1409. if p^.right^.location.loc<>LOC_REGISTER then
  1410. begin
  1411. if (p^.treetype=subn) and p^.swaped then
  1412. begin
  1413. if p^.right^.location.loc=LOC_CREGISTER then
  1414. begin
  1415. emit_reg_reg(A_MOV,opsize,p^.right^.location.register,R_EDI);
  1416. emit_reg_reg(op,opsize,p^.location.register,R_EDI);
  1417. emit_reg_reg(A_MOV,opsize,R_EDI,p^.location.register);
  1418. end
  1419. else
  1420. begin
  1421. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  1422. newreference(p^.right^.location.reference),R_EDI)));
  1423. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,p^.location.register,R_EDI)));
  1424. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,R_EDI,p^.location.register)));
  1425. ungetiftemp(p^.right^.location.reference);
  1426. del_reference(p^.right^.location.reference);
  1427. end;
  1428. end
  1429. else if cmpop then
  1430. begin
  1431. if (p^.right^.location.loc=LOC_CREGISTER) then
  1432. begin
  1433. emit_reg_reg(A_CMP,S_L,p^.right^.location.registerhigh,
  1434. p^.location.registerhigh);
  1435. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1436. emit_reg_reg(A_CMP,S_L,p^.right^.location.registerlow,
  1437. p^.location.registerlow);
  1438. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1439. emitjmp(C_None,falselabel);
  1440. end
  1441. else
  1442. begin
  1443. hr:=newreference(p^.right^.location.reference);
  1444. inc(hr^.offset,4);
  1445. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_L,
  1446. hr,p^.location.registerhigh)));
  1447. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1448. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_L,newreference(
  1449. p^.right^.location.reference),p^.location.registerlow)));
  1450. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1451. emitjmp(C_None,falselabel);
  1452. ungetiftemp(p^.right^.location.reference);
  1453. del_reference(p^.right^.location.reference);
  1454. end;
  1455. end
  1456. else
  1457. begin
  1458. {
  1459. if (p^.right^.treetype=ordconstn) and
  1460. (op=A_CMP) and
  1461. (p^.right^.value=0) then
  1462. begin
  1463. exprasmlist^.concat(new(pai386,op_reg_reg(A_TEST,opsize,p^.location.register,
  1464. p^.location.register)));
  1465. end
  1466. else if (p^.right^.treetype=ordconstn) and
  1467. (op=A_IMUL) and
  1468. (ispowerof2(p^.right^.value,power)) then
  1469. begin
  1470. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,opsize,power,
  1471. p^.location.register)));
  1472. end
  1473. else
  1474. }
  1475. begin
  1476. if (p^.right^.location.loc=LOC_CREGISTER) then
  1477. begin
  1478. emit_reg_reg(op,S_L,p^.right^.location.registerlow,
  1479. p^.location.registerlow);
  1480. emit_reg_reg(op2,S_L,p^.right^.location.registerhigh,
  1481. p^.location.registerhigh);
  1482. end
  1483. else
  1484. begin
  1485. exprasmlist^.concat(new(pai386,op_ref_reg(op,S_L,newreference(
  1486. p^.right^.location.reference),p^.location.registerlow)));
  1487. hr:=newreference(p^.right^.location.reference);
  1488. inc(hr^.offset,4);
  1489. exprasmlist^.concat(new(pai386,op_ref_reg(op2,S_L,
  1490. hr,p^.location.registerhigh)));
  1491. ungetiftemp(p^.right^.location.reference);
  1492. del_reference(p^.right^.location.reference);
  1493. end;
  1494. end;
  1495. end;
  1496. end
  1497. else
  1498. begin
  1499. { when swapped another result register }
  1500. if (p^.treetype=subn) and p^.swaped then
  1501. begin
  1502. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  1503. p^.location.register,p^.right^.location.register)));
  1504. swap_location(p^.location,p^.right^.location);
  1505. { newly swapped also set swapped flag }
  1506. { just to maintain ordering }
  1507. p^.swaped:=not(p^.swaped);
  1508. end
  1509. else if cmpop then
  1510. begin
  1511. exprasmlist^.concat(new(pai386,op_reg_reg(A_CMP,S_L,
  1512. p^.right^.location.registerhigh,
  1513. p^.location.registerhigh)));
  1514. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1515. exprasmlist^.concat(new(pai386,op_reg_reg(A_CMP,S_L,
  1516. p^.right^.location.registerlow,
  1517. p^.location.registerlow)));
  1518. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1519. emitjmp(C_None,falselabel);
  1520. end
  1521. else
  1522. begin
  1523. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_L,
  1524. p^.right^.location.registerlow,
  1525. p^.location.registerlow)));
  1526. exprasmlist^.concat(new(pai386,op_reg_reg(op2,S_L,
  1527. p^.right^.location.registerhigh,
  1528. p^.location.registerhigh)));
  1529. end;
  1530. ungetregister32(p^.right^.location.registerlow);
  1531. ungetregister32(p^.right^.location.registerhigh);
  1532. end;
  1533. if cmpop then
  1534. begin
  1535. ungetregister32(p^.location.registerlow);
  1536. ungetregister32(p^.location.registerhigh);
  1537. end;
  1538. { only in case of overflow operations }
  1539. { produce overflow code }
  1540. { we must put it here directly, because sign of operation }
  1541. { is in unsigned VAR!! }
  1542. if mboverflow then
  1543. begin
  1544. if cs_check_overflow in aktlocalswitches then
  1545. begin
  1546. getlabel(hl4);
  1547. if unsigned then
  1548. emitjmp(C_NB,hl4)
  1549. else
  1550. emitjmp(C_NO,hl4);
  1551. emitcall('FPC_OVERFLOW',true);
  1552. emitlab(hl4);
  1553. end;
  1554. end;
  1555. { we have LOC_JUMP as result }
  1556. if cmpop then
  1557. begin
  1558. clear_location(p^.location);
  1559. p^.location.loc:=LOC_JUMP;
  1560. cmpop:=false;
  1561. end;
  1562. end;
  1563. end
  1564. else
  1565. { Floating point }
  1566. if (p^.left^.resulttype^.deftype=floatdef) and
  1567. (pfloatdef(p^.left^.resulttype)^.typ<>f32bit) then
  1568. begin
  1569. { real constants to the left }
  1570. if p^.left^.treetype=realconstn then
  1571. swaptree(p);
  1572. cmpop:=false;
  1573. case p^.treetype of
  1574. addn : op:=A_FADDP;
  1575. muln : op:=A_FMULP;
  1576. subn : op:=A_FSUBP;
  1577. slashn : op:=A_FDIVP;
  1578. ltn,lten,gtn,gten,
  1579. equaln,unequaln : begin
  1580. op:=A_FCOMPP;
  1581. cmpop:=true;
  1582. end;
  1583. else CGMessage(type_e_mismatch);
  1584. end;
  1585. if (p^.right^.location.loc<>LOC_FPU) then
  1586. begin
  1587. floatload(pfloatdef(p^.right^.resulttype)^.typ,p^.right^.location.reference);
  1588. if (p^.left^.location.loc<>LOC_FPU) then
  1589. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  1590. { left was on the stack => swap }
  1591. else
  1592. p^.swaped:=not(p^.swaped);
  1593. { releases the right reference }
  1594. del_reference(p^.right^.location.reference);
  1595. end
  1596. { the nominator in st0 }
  1597. else if (p^.left^.location.loc<>LOC_FPU) then
  1598. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  1599. { fpu operands are always in the wrong order on the stack }
  1600. else
  1601. p^.swaped:=not(p^.swaped);
  1602. { releases the left reference }
  1603. if (p^.left^.location.loc<>LOC_FPU) then
  1604. del_reference(p^.left^.location.reference);
  1605. { if we swaped the tree nodes, then use the reverse operator }
  1606. if p^.swaped then
  1607. begin
  1608. if (p^.treetype=slashn) then
  1609. op:=A_FDIVRP
  1610. else if (p^.treetype=subn) then
  1611. op:=A_FSUBRP;
  1612. end;
  1613. { to avoid the pentium bug
  1614. if (op=FDIVP) and (opt_processors=pentium) then
  1615. exprasmlist^.concat(new(pai386,op_CALL,S_NO,'EMUL_FDIVP')
  1616. else
  1617. }
  1618. { the Intel assemblers want operands }
  1619. if op<>A_FCOMPP then
  1620. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,R_ST,R_ST1)))
  1621. else
  1622. exprasmlist^.concat(new(pai386,op_none(op,S_NO)));
  1623. { on comparison load flags }
  1624. if cmpop then
  1625. begin
  1626. if not(R_EAX in unused) then
  1627. emit_reg_reg(A_MOV,S_L,R_EAX,R_EDI);
  1628. exprasmlist^.concat(new(pai386,op_reg(A_FNSTSW,S_NO,R_AX)));
  1629. exprasmlist^.concat(new(pai386,op_none(A_SAHF,S_NO)));
  1630. if not(R_EAX in unused) then
  1631. emit_reg_reg(A_MOV,S_L,R_EDI,R_EAX);
  1632. if p^.swaped then
  1633. begin
  1634. case p^.treetype of
  1635. equaln : flags:=F_E;
  1636. unequaln : flags:=F_NE;
  1637. ltn : flags:=F_A;
  1638. lten : flags:=F_AE;
  1639. gtn : flags:=F_B;
  1640. gten : flags:=F_BE;
  1641. end;
  1642. end
  1643. else
  1644. begin
  1645. case p^.treetype of
  1646. equaln : flags:=F_E;
  1647. unequaln : flags:=F_NE;
  1648. ltn : flags:=F_B;
  1649. lten : flags:=F_BE;
  1650. gtn : flags:=F_A;
  1651. gten : flags:=F_AE;
  1652. end;
  1653. end;
  1654. clear_location(p^.location);
  1655. p^.location.loc:=LOC_FLAGS;
  1656. p^.location.resflags:=flags;
  1657. cmpop:=false;
  1658. end
  1659. else
  1660. begin
  1661. clear_location(p^.location);
  1662. p^.location.loc:=LOC_FPU;
  1663. end;
  1664. end
  1665. {$ifdef SUPPORT_MMX}
  1666. else
  1667. { MMX Arrays }
  1668. if is_mmx_able_array(p^.left^.resulttype) then
  1669. begin
  1670. cmpop:=false;
  1671. mmxbase:=mmx_type(p^.left^.resulttype);
  1672. case p^.treetype of
  1673. addn : begin
  1674. if (cs_mmx_saturation in aktlocalswitches) then
  1675. begin
  1676. case mmxbase of
  1677. mmxs8bit:
  1678. op:=A_PADDSB;
  1679. mmxu8bit:
  1680. op:=A_PADDUSB;
  1681. mmxs16bit,mmxfixed16:
  1682. op:=A_PADDSB;
  1683. mmxu16bit:
  1684. op:=A_PADDUSW;
  1685. end;
  1686. end
  1687. else
  1688. begin
  1689. case mmxbase of
  1690. mmxs8bit,mmxu8bit:
  1691. op:=A_PADDB;
  1692. mmxs16bit,mmxu16bit,mmxfixed16:
  1693. op:=A_PADDW;
  1694. mmxs32bit,mmxu32bit:
  1695. op:=A_PADDD;
  1696. end;
  1697. end;
  1698. end;
  1699. muln : begin
  1700. case mmxbase of
  1701. mmxs16bit,mmxu16bit:
  1702. op:=A_PMULLW;
  1703. mmxfixed16:
  1704. op:=A_PMULHW;
  1705. end;
  1706. end;
  1707. subn : begin
  1708. if (cs_mmx_saturation in aktlocalswitches) then
  1709. begin
  1710. case mmxbase of
  1711. mmxs8bit:
  1712. op:=A_PSUBSB;
  1713. mmxu8bit:
  1714. op:=A_PSUBUSB;
  1715. mmxs16bit,mmxfixed16:
  1716. op:=A_PSUBSB;
  1717. mmxu16bit:
  1718. op:=A_PSUBUSW;
  1719. end;
  1720. end
  1721. else
  1722. begin
  1723. case mmxbase of
  1724. mmxs8bit,mmxu8bit:
  1725. op:=A_PSUBB;
  1726. mmxs16bit,mmxu16bit,mmxfixed16:
  1727. op:=A_PSUBW;
  1728. mmxs32bit,mmxu32bit:
  1729. op:=A_PSUBD;
  1730. end;
  1731. end;
  1732. end;
  1733. {
  1734. ltn,lten,gtn,gten,
  1735. equaln,unequaln :
  1736. begin
  1737. op:=A_CMP;
  1738. cmpop:=true;
  1739. end;
  1740. }
  1741. xorn:
  1742. op:=A_PXOR;
  1743. orn:
  1744. op:=A_POR;
  1745. andn:
  1746. op:=A_PAND;
  1747. else CGMessage(type_e_mismatch);
  1748. end;
  1749. { left and right no register? }
  1750. { then one must be demanded }
  1751. if (p^.left^.location.loc<>LOC_MMXREGISTER) and
  1752. (p^.right^.location.loc<>LOC_MMXREGISTER) then
  1753. begin
  1754. { register variable ? }
  1755. if (p^.left^.location.loc=LOC_CMMXREGISTER) then
  1756. begin
  1757. { it is OK if this is the destination }
  1758. if is_in_dest then
  1759. begin
  1760. hregister:=p^.location.register;
  1761. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1762. hregister);
  1763. end
  1764. else
  1765. begin
  1766. hregister:=getregistermmx;
  1767. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1768. hregister);
  1769. end
  1770. end
  1771. else
  1772. begin
  1773. del_reference(p^.left^.location.reference);
  1774. if is_in_dest then
  1775. begin
  1776. hregister:=p^.location.register;
  1777. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1778. newreference(p^.left^.location.reference),hregister)));
  1779. end
  1780. else
  1781. begin
  1782. hregister:=getregistermmx;
  1783. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1784. newreference(p^.left^.location.reference),hregister)));
  1785. end;
  1786. end;
  1787. clear_location(p^.location);
  1788. p^.location.loc:=LOC_MMXREGISTER;
  1789. p^.location.register:=hregister;
  1790. end
  1791. else
  1792. { if on the right the register then swap }
  1793. if (p^.right^.location.loc=LOC_MMXREGISTER) then
  1794. begin
  1795. swap_location(p^.location,p^.right^.location);
  1796. { newly swapped also set swapped flag }
  1797. p^.swaped:=not(p^.swaped);
  1798. end;
  1799. { at this point, p^.location.loc should be LOC_MMXREGISTER }
  1800. { and p^.location.register should be a valid register }
  1801. { containing the left result }
  1802. if p^.right^.location.loc<>LOC_MMXREGISTER then
  1803. begin
  1804. if (p^.treetype=subn) and p^.swaped then
  1805. begin
  1806. if p^.right^.location.loc=LOC_CMMXREGISTER then
  1807. begin
  1808. emit_reg_reg(A_MOVQ,S_NO,p^.right^.location.register,R_MM7);
  1809. emit_reg_reg(op,S_NO,p^.location.register,R_EDI);
  1810. emit_reg_reg(A_MOVQ,S_NO,R_MM7,p^.location.register);
  1811. end
  1812. else
  1813. begin
  1814. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1815. newreference(p^.right^.location.reference),R_MM7)));
  1816. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,p^.location.register,
  1817. R_MM7)));
  1818. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVQ,S_NO,
  1819. R_MM7,p^.location.register)));
  1820. del_reference(p^.right^.location.reference);
  1821. end;
  1822. end
  1823. else
  1824. begin
  1825. if (p^.right^.location.loc=LOC_CREGISTER) then
  1826. begin
  1827. emit_reg_reg(op,S_NO,p^.right^.location.register,
  1828. p^.location.register);
  1829. end
  1830. else
  1831. begin
  1832. exprasmlist^.concat(new(pai386,op_ref_reg(op,S_NO,newreference(
  1833. p^.right^.location.reference),p^.location.register)));
  1834. del_reference(p^.right^.location.reference);
  1835. end;
  1836. end;
  1837. end
  1838. else
  1839. begin
  1840. { when swapped another result register }
  1841. if (p^.treetype=subn) and p^.swaped then
  1842. begin
  1843. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1844. p^.location.register,p^.right^.location.register)));
  1845. swap_location(p^.location,p^.right^.location);
  1846. { newly swapped also set swapped flag }
  1847. { just to maintain ordering }
  1848. p^.swaped:=not(p^.swaped);
  1849. end
  1850. else
  1851. begin
  1852. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1853. p^.right^.location.register,
  1854. p^.location.register)));
  1855. end;
  1856. ungetregistermmx(p^.right^.location.register);
  1857. end;
  1858. end
  1859. {$endif SUPPORT_MMX}
  1860. else CGMessage(type_e_mismatch);
  1861. end;
  1862. SetResultLocation(cmpop,unsigned,p);
  1863. end;
  1864. end.
  1865. {
  1866. $Log$
  1867. Revision 1.50 1999-04-16 13:42:35 jonas
  1868. * more regalloc fixes (still not complete)
  1869. Revision 1.49 1999/04/16 11:44:24 peter
  1870. * better support for flags result
  1871. Revision 1.48 1999/04/14 09:14:45 peter
  1872. * first things to store the symbol/def number in the ppu
  1873. Revision 1.47 1999/04/12 19:09:08 florian
  1874. * comparsions for small enumerations type are now generated
  1875. correct
  1876. Revision 1.46 1999/03/02 18:21:36 peter
  1877. + flags support for add and case
  1878. Revision 1.45 1999/02/25 21:02:20 peter
  1879. * ag386bin updates
  1880. + coff writer
  1881. Revision 1.44 1999/02/22 02:15:02 peter
  1882. * updates for ag386bin
  1883. Revision 1.43 1999/02/16 00:46:30 peter
  1884. * fixed bug 206
  1885. Revision 1.42 1999/02/12 10:43:56 florian
  1886. * internal error 10 with ansistrings fixed
  1887. Revision 1.41 1999/01/20 19:23:10 jonas
  1888. * fixed set1 <= set2 for small sets
  1889. Revision 1.40 1999/01/20 17:39:22 jonas
  1890. + fixed bug0163 (set1 <= set2 support)
  1891. Revision 1.39 1999/01/19 10:18:58 florian
  1892. * bug with mul. of dwords fixed, reported by Alexander Stohr
  1893. * some changes to compile with TP
  1894. + small enhancements for the new code generator
  1895. Revision 1.38 1999/01/05 17:03:36 jonas
  1896. * don't output inc/dec if cs_check_overflow is on, because inc/dec don't change
  1897. the carry flag
  1898. Revision 1.37 1998/12/22 13:10:56 florian
  1899. * memory leaks for ansistring type casts fixed
  1900. Revision 1.36 1998/12/19 00:23:40 florian
  1901. * ansistring memory leaks fixed
  1902. Revision 1.35 1998/12/11 23:36:06 florian
  1903. + again more stuff for int64/qword:
  1904. - comparision operators
  1905. - code generation for: str, read(ln), write(ln)
  1906. Revision 1.34 1998/12/11 00:02:46 peter
  1907. + globtype,tokens,version unit splitted from globals
  1908. Revision 1.33 1998/12/10 11:16:00 florian
  1909. + some basic operations with qwords and int64 added: +, xor, and, or;
  1910. the register allocation works fine
  1911. Revision 1.32 1998/12/10 09:47:13 florian
  1912. + basic operations with int64/qord (compiler with -dint64)
  1913. + rtti of enumerations extended: names are now written
  1914. Revision 1.31 1998/11/30 09:42:59 pierre
  1915. * some range check bugs fixed (still not working !)
  1916. + added DLL writing support for win32 (also accepts variables)
  1917. + TempAnsi for code that could be used for Temporary ansi strings
  1918. handling
  1919. Revision 1.30 1998/11/24 12:52:40 peter
  1920. * sets are not written twice anymore
  1921. * optimize for emptyset+single element which uses a new routine from
  1922. set.inc FPC_SET_CREATE_ELEMENT
  1923. Revision 1.29 1998/11/18 15:44:05 peter
  1924. * VALUEPARA for tp7 compatible value parameters
  1925. Revision 1.28 1998/11/18 09:18:01 pierre
  1926. + automatic loading of profile unit with -pg option
  1927. in go32v2 mode (also defines FPC_PROFILE)
  1928. * some memory leaks removed
  1929. * unreleased temp problem with sets solved
  1930. Revision 1.27 1998/11/17 00:36:38 peter
  1931. * more ansistring fixes
  1932. Revision 1.26 1998/11/16 16:17:16 peter
  1933. * fixed ansistring temp which forgot a reset
  1934. Revision 1.25 1998/11/16 15:35:35 peter
  1935. * rename laod/copystring -> load/copyshortstring
  1936. * fixed int-bool cnv bug
  1937. + char-ansistring conversion
  1938. Revision 1.24 1998/11/07 12:49:30 peter
  1939. * fixed ansicompare which returns signed
  1940. Revision 1.23 1998/10/29 15:42:43 florian
  1941. + partial disposing of temp. ansistrings
  1942. Revision 1.22 1998/10/28 18:26:12 pierre
  1943. * removed some erros after other errors (introduced by useexcept)
  1944. * stabs works again correctly (for how long !)
  1945. Revision 1.21 1998/10/25 23:32:48 peter
  1946. * fixed unsigned mul
  1947. Revision 1.20 1998/10/21 08:39:56 florian
  1948. + ansistring operator +
  1949. + $h and string[n] for n>255 added
  1950. * small problem with TP fixed
  1951. Revision 1.19 1998/10/20 15:09:21 florian
  1952. + binary operators for ansi strings
  1953. Revision 1.18 1998/10/20 08:06:38 pierre
  1954. * several memory corruptions due to double freemem solved
  1955. => never use p^.loc.location:=p^.left^.loc.location;
  1956. + finally I added now by default
  1957. that ra386dir translates global and unit symbols
  1958. + added a first field in tsymtable and
  1959. a nextsym field in tsym
  1960. (this allows to obtain ordered type info for
  1961. records and objects in gdb !)
  1962. Revision 1.17 1998/10/09 11:47:45 pierre
  1963. * still more memory leaks fixes !!
  1964. Revision 1.16 1998/10/09 08:56:21 pierre
  1965. * several memory leaks fixed
  1966. Revision 1.15 1998/10/08 17:17:10 pierre
  1967. * current_module old scanner tagged as invalid if unit is recompiled
  1968. + added ppheap for better info on tracegetmem of heaptrc
  1969. (adds line column and file index)
  1970. * several memory leaks removed ith help of heaptrc !!
  1971. Revision 1.14 1998/09/28 16:57:13 pierre
  1972. * changed all length(p^.value_str^) into str_length(p)
  1973. to get it work with and without ansistrings
  1974. * changed sourcefiles field of tmodule to a pointer
  1975. Revision 1.13 1998/09/17 09:42:09 peter
  1976. + pass_2 for cg386
  1977. * Message() -> CGMessage() for pass_1/pass_2
  1978. Revision 1.12 1998/09/14 10:43:44 peter
  1979. * all internal RTL functions start with FPC_
  1980. Revision 1.11 1998/09/07 18:45:52 peter
  1981. * update smartlinking, uses getdatalabel
  1982. * renamed ptree.value vars to value_str,value_real,value_set
  1983. Revision 1.10 1998/09/04 10:05:04 florian
  1984. * ugly fix for STRCAT, nevertheless it needs more fixing !!!!!!!
  1985. we need an new version of STRCAT which takes a length parameter
  1986. Revision 1.9 1998/09/04 08:41:36 peter
  1987. * updated some error CGMessages
  1988. Revision 1.8 1998/08/28 10:54:18 peter
  1989. * fixed smallset generation from elements, it has never worked before!
  1990. Revision 1.7 1998/08/19 14:56:59 peter
  1991. * forgot to removed some unused code in addset for set<>set
  1992. Revision 1.6 1998/08/18 09:24:35 pierre
  1993. * small warning position bug fixed
  1994. * support_mmx switches splitting was missing
  1995. * rhide error and warning output corrected
  1996. Revision 1.5 1998/08/14 18:18:37 peter
  1997. + dynamic set contruction
  1998. * smallsets are now working (always longint size)
  1999. Revision 1.4 1998/08/10 14:49:42 peter
  2000. + localswitches, moduleswitches, globalswitches splitting
  2001. Revision 1.3 1998/06/25 08:48:04 florian
  2002. * first version of rtti support
  2003. Revision 1.2 1998/06/08 13:13:28 pierre
  2004. + temporary variables now in temp_gen.pas unit
  2005. because it is processor independent
  2006. * mppc68k.bat modified to undefine i386 and support_mmx
  2007. (which are defaults for i386)
  2008. Revision 1.1 1998/06/05 17:44:10 peter
  2009. * splitted cgi386
  2010. }