cg386add.pas 107 KB

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