cg386add.pas 92 KB

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