cg386add.pas 108 KB

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