cgi386ad.inc 56 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. This include file generates i386+ assembler from the parse tree
  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. procedure secondas(var p : ptree);
  19. var
  20. pushed : tpushed;
  21. begin
  22. secondpass(p^.left);
  23. { save all used registers }
  24. pushusedregisters(pushed,$ff);
  25. { push instance to check: }
  26. case p^.left^.location.loc of
  27. LOC_REGISTER,LOC_CREGISTER:
  28. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,
  29. S_L,p^.left^.location.register)));
  30. LOC_MEM,LOC_REFERENCE:
  31. exprasmlist^.concat(new(pai386,op_ref(A_PUSH,
  32. S_L,newreference(p^.left^.location.reference))));
  33. else internalerror(100);
  34. end;
  35. { we doesn't modifiy the left side, we check only the type }
  36. set_location(p^.location,p^.left^.location);
  37. { generate type checking }
  38. secondpass(p^.right);
  39. case p^.right^.location.loc of
  40. LOC_REGISTER,LOC_CREGISTER:
  41. begin
  42. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,
  43. S_L,p^.right^.location.register)));
  44. ungetregister32(p^.right^.location.register);
  45. end;
  46. LOC_MEM,LOC_REFERENCE:
  47. begin
  48. exprasmlist^.concat(new(pai386,op_ref(A_PUSH,
  49. S_L,newreference(p^.right^.location.reference))));
  50. del_reference(p^.right^.location.reference);
  51. end;
  52. else internalerror(100);
  53. end;
  54. emitcall('DO_AS',true);
  55. { restore register, this restores automatically the }
  56. { result }
  57. popusedregisters(pushed);
  58. end;
  59. procedure secondloadvmt(var p : ptree);
  60. begin
  61. p^.location.register:=getregister32;
  62. exprasmlist^.concat(new(pai386,op_csymbol_reg(A_MOV,
  63. S_L,newcsymbol(pobjectdef(pclassrefdef(p^.resulttype)^.definition)^.vmt_mangledname,0),
  64. p^.location.register)));
  65. end;
  66. procedure secondis(var p : ptree);
  67. var
  68. pushed : tpushed;
  69. begin
  70. { save all used registers }
  71. pushusedregisters(pushed,$ff);
  72. secondpass(p^.left);
  73. p^.location.loc:=LOC_FLAGS;
  74. p^.location.resflags:=F_NE;
  75. { push instance to check: }
  76. case p^.left^.location.loc of
  77. LOC_REGISTER,LOC_CREGISTER:
  78. begin
  79. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,
  80. S_L,p^.left^.location.register)));
  81. ungetregister32(p^.left^.location.register);
  82. end;
  83. LOC_MEM,LOC_REFERENCE:
  84. begin
  85. exprasmlist^.concat(new(pai386,op_ref(A_PUSH,
  86. S_L,newreference(p^.left^.location.reference))));
  87. del_reference(p^.left^.location.reference);
  88. end;
  89. else internalerror(100);
  90. end;
  91. { generate type checking }
  92. secondpass(p^.right);
  93. case p^.right^.location.loc of
  94. LOC_REGISTER,LOC_CREGISTER:
  95. begin
  96. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,
  97. S_L,p^.right^.location.register)));
  98. ungetregister32(p^.right^.location.register);
  99. end;
  100. LOC_MEM,LOC_REFERENCE:
  101. begin
  102. exprasmlist^.concat(new(pai386,op_ref(A_PUSH,
  103. S_L,newreference(p^.right^.location.reference))));
  104. del_reference(p^.right^.location.reference);
  105. end;
  106. else internalerror(100);
  107. end;
  108. emitcall('DO_IS',true);
  109. exprasmlist^.concat(new(pai386,op_reg_reg(A_OR,S_B,R_AL,R_AL)));
  110. popusedregisters(pushed);
  111. end;
  112. procedure setaddresult(cmpop,unsigned : boolean;var p :ptree);
  113. var
  114. flags : tresflags;
  115. begin
  116. if (p^.left^.resulttype^.deftype<>stringdef) and
  117. not ((p^.left^.resulttype^.deftype=setdef) and
  118. (psetdef(p^.left^.resulttype)^.settype<>smallset)) then
  119. begin
  120. { this can be useful if for instance length(string) is called }
  121. if (p^.left^.location.loc=LOC_REFERENCE) or
  122. (p^.left^.location.loc=LOC_MEM) then
  123. ungetiftemp(p^.left^.location.reference);
  124. if (p^.right^.location.loc=LOC_REFERENCE) or
  125. (p^.right^.location.loc=LOC_MEM) then
  126. ungetiftemp(p^.right^.location.reference);
  127. end;
  128. { in case of comparison operation the put result in the flags }
  129. if cmpop then
  130. begin
  131. if not(unsigned) then
  132. begin
  133. if p^.swaped then
  134. case p^.treetype of
  135. equaln : flags:=F_E;
  136. unequaln : flags:=F_NE;
  137. ltn : flags:=F_G;
  138. lten : flags:=F_GE;
  139. gtn : flags:=F_L;
  140. gten : flags:=F_LE;
  141. end
  142. else
  143. case p^.treetype of
  144. equaln : flags:=F_E;
  145. unequaln : flags:=F_NE;
  146. ltn : flags:=F_L;
  147. lten : flags:=F_LE;
  148. gtn : flags:=F_G;
  149. gten : flags:=F_GE;
  150. end;
  151. end
  152. else
  153. begin
  154. if p^.swaped then
  155. case p^.treetype of
  156. equaln : flags:=F_E;
  157. unequaln : flags:=F_NE;
  158. ltn : flags:=F_A;
  159. lten : flags:=F_AE;
  160. gtn : flags:=F_B;
  161. gten : flags:=F_BE;
  162. end
  163. else
  164. case p^.treetype of
  165. equaln : flags:=F_E;
  166. unequaln : flags:=F_NE;
  167. ltn : flags:=F_B;
  168. lten : flags:=F_BE;
  169. gtn : flags:=F_A;
  170. gten : flags:=F_AE;
  171. end;
  172. end;
  173. p^.location.loc:=LOC_FLAGS;
  174. p^.location.resflags:=flags;
  175. end;
  176. end;
  177. procedure secondaddstring(var p : ptree);
  178. var
  179. swapp : ptree;
  180. pushedregs : tpushed;
  181. href : treference;
  182. pushed,cmpop : boolean;
  183. begin
  184. { string operations are not commutative }
  185. if p^.swaped then
  186. begin
  187. swapp:=p^.left;
  188. p^.left:=p^.right;
  189. p^.right:=swapp;
  190. { because of jump being produced at comparison below: }
  191. p^.swaped:=not(p^.swaped);
  192. end;
  193. case p^.treetype of
  194. addn :
  195. begin
  196. cmpop:=false;
  197. secondpass(p^.left);
  198. if (p^.left^.treetype<>addn) then
  199. begin
  200. { can only reference be }
  201. { string in register would be funny }
  202. { therefore produce a temporary string }
  203. { release the registers }
  204. del_reference(p^.left^.location.reference);
  205. gettempofsizereference(256,href);
  206. copystring(href,p^.left^.location.reference,255);
  207. ungetiftemp(p^.left^.location.reference);
  208. { does not hurt: }
  209. p^.left^.location.loc:=LOC_MEM;
  210. p^.left^.location.reference:=href;
  211. end;
  212. secondpass(p^.right);
  213. { on the right we do not need the register anymore too }
  214. del_reference(p^.right^.location.reference);
  215. { if p^.right^.resulttype^.deftype=orddef then
  216. begin
  217. pushusedregisters(pushedregs,$ff);
  218. exprasmlist^.concat(new(pai386,op_ref_reg(
  219. A_LEA,S_L,newreference(p^.left^.location.reference),R_EDI)));
  220. exprasmlist^.concat(new(pai386,op_reg_reg(
  221. A_XOR,S_L,R_EBX,R_EBX)));
  222. reset_reference(href);
  223. href.base:=R_EDI;
  224. exprasmlist^.concat(new(pai386,op_ref_reg(
  225. A_MOV,S_B,newreference(href),R_BL)));
  226. exprasmlist^.concat(new(pai386,op_reg(
  227. A_INC,S_L,R_EBX)));
  228. exprasmlist^.concat(new(pai386,op_reg_ref(
  229. A_MOV,S_B,R_BL,newreference(href))));
  230. href.index:=R_EBX;
  231. if p^.right^.treetype=ordconstn then
  232. exprasmlist^.concat(new(pai386,op_const_ref(
  233. A_MOV,S_L,p^.right^.value,newreference(href))))
  234. else
  235. begin
  236. if p^.right^.location.loc in [LOC_CREGISTER,LOC_REGISTER] then
  237. exprasmlist^.concat(new(pai386,op_reg_ref(
  238. A_MOV,S_B,p^.right^.location.register,newreference(href))))
  239. else
  240. begin
  241. exprasmlist^.concat(new(pai386,op_ref_reg(
  242. A_MOV,S_L,newreference(p^.right^.location.reference),R_EAX)));
  243. exprasmlist^.concat(new(pai386,op_reg_ref(
  244. A_MOV,S_B,R_AL,newreference(href))));
  245. end;
  246. end;
  247. popusedregisters(pushedregs);
  248. end
  249. else }
  250. begin
  251. pushusedregisters(pushedregs,$ff);
  252. emitpushreferenceaddr(p^.left^.location.reference);
  253. emitpushreferenceaddr(p^.right^.location.reference);
  254. emitcall('STRCONCAT',true);
  255. maybe_loadesi;
  256. popusedregisters(pushedregs);
  257. end;
  258. set_location(p^.location,p^.left^.location);
  259. ungetiftemp(p^.right^.location.reference);
  260. end;
  261. ltn,lten,gtn,gten,
  262. equaln,unequaln :
  263. begin
  264. cmpop:=true;
  265. { generate better code for s='' and s<>'' }
  266. if (p^.treetype in [equaln,unequaln]) and
  267. (((p^.left^.treetype=stringconstn) and (p^.left^.values^='')) or
  268. ((p^.right^.treetype=stringconstn) and (p^.right^.values^=''))) then
  269. begin
  270. secondpass(p^.left);
  271. { are too few registers free? }
  272. pushed:=maybe_push(p^.right^.registers32,p);
  273. secondpass(p^.right);
  274. if pushed then restore(p);
  275. del_reference(p^.right^.location.reference);
  276. del_reference(p^.left^.location.reference);
  277. { only one node can be stringconstn }
  278. { else pass 1 would have evaluted }
  279. { this node }
  280. if p^.left^.treetype=stringconstn then
  281. exprasmlist^.concat(new(pai386,op_const_ref(
  282. A_CMP,S_B,0,newreference(p^.right^.location.reference))))
  283. else
  284. exprasmlist^.concat(new(pai386,op_const_ref(
  285. A_CMP,S_B,0,newreference(p^.left^.location.reference))));
  286. end
  287. else
  288. begin
  289. pushusedregisters(pushedregs,$ff);
  290. secondpass(p^.left);
  291. del_reference(p^.left^.location.reference);
  292. emitpushreferenceaddr(p^.left^.location.reference);
  293. secondpass(p^.right);
  294. del_reference(p^.right^.location.reference);
  295. emitpushreferenceaddr(p^.right^.location.reference);
  296. emitcall('STRCMP',true);
  297. maybe_loadesi;
  298. popusedregisters(pushedregs);
  299. end;
  300. ungetiftemp(p^.left^.location.reference);
  301. ungetiftemp(p^.right^.location.reference);
  302. end;
  303. else Message(sym_e_type_mismatch);
  304. end;
  305. setaddresult(cmpop,true,p);
  306. end;
  307. procedure secondadd(var p : ptree);
  308. { is also being used for xor, and "mul", "sub, or and comparative }
  309. { operators }
  310. label do_normal;
  311. var
  312. swapp : ptree;
  313. hregister : tregister;
  314. pushed,mboverflow,cmpop : boolean;
  315. op : tasmop;
  316. pushedregs : tpushed;
  317. flags : tresflags;
  318. otl,ofl : plabel;
  319. power : longint;
  320. href : treference;
  321. opsize : topsize;
  322. hl4: plabel;
  323. { true, if unsigned types are compared }
  324. unsigned : boolean;
  325. { is_in_dest if the result is put directly into }
  326. { the resulting refernce or varregister }
  327. { true, if a small set is handled with the longint code }
  328. is_set : boolean;
  329. is_in_dest : boolean;
  330. { true, if for sets subtractions the extra not should generated }
  331. extra_not : boolean;
  332. mmxbase : tmmxtype;
  333. begin
  334. if (p^.left^.resulttype^.deftype=stringdef) then
  335. begin
  336. secondaddstring(p);
  337. exit;
  338. end;
  339. unsigned:=false;
  340. is_in_dest:=false;
  341. extra_not:=false;
  342. opsize:=S_L;
  343. { calculate the operator which is more difficult }
  344. firstcomplex(p);
  345. { handling boolean expressions extra: }
  346. if ((p^.left^.resulttype^.deftype=orddef) and
  347. (porddef(p^.left^.resulttype)^.typ=bool8bit)) or
  348. ((p^.right^.resulttype^.deftype=orddef) and
  349. (porddef(p^.right^.resulttype)^.typ=bool8bit)) then
  350. begin
  351. if (p^.treetype=andn) or (p^.treetype=orn) then
  352. begin
  353. p^.location.loc:=LOC_JUMP;
  354. cmpop:=false;
  355. case p^.treetype of
  356. andn : begin
  357. otl:=truelabel;
  358. getlabel(truelabel);
  359. secondpass(p^.left);
  360. maketojumpbool(p^.left);
  361. emitl(A_LABEL,truelabel);
  362. truelabel:=otl;
  363. end;
  364. orn : begin
  365. ofl:=falselabel;
  366. getlabel(falselabel);
  367. secondpass(p^.left);
  368. maketojumpbool(p^.left);
  369. emitl(A_LABEL,falselabel);
  370. falselabel:=ofl;
  371. end;
  372. else Message(sym_e_type_mismatch);
  373. end;
  374. secondpass(p^.right);
  375. maketojumpbool(p^.right);
  376. end
  377. else if p^.treetype in [unequaln,equaln,xorn] then
  378. begin
  379. opsize:=S_B;
  380. if p^.left^.treetype=ordconstn then
  381. begin
  382. swapp:=p^.right;
  383. p^.right:=p^.left;
  384. p^.left:=swapp;
  385. p^.swaped:=not(p^.swaped);
  386. end;
  387. secondpass(p^.left);
  388. p^.location:=p^.left^.location;
  389. { are enough registers free ? }
  390. pushed:=maybe_push(p^.right^.registers32,p);
  391. secondpass(p^.right);
  392. if pushed then restore(p);
  393. goto do_normal;
  394. end
  395. else Message(sym_e_type_mismatch);
  396. end
  397. else
  398. if (p^.left^.resulttype^.deftype=setdef) and
  399. not(psetdef(p^.left^.resulttype)^.settype=smallset) then
  400. begin
  401. mboverflow:=false;
  402. secondpass(p^.left);
  403. set_location(p^.location,p^.left^.location);
  404. { are too few registers free? }
  405. pushed:=maybe_push(p^.right^.registers32,p);
  406. secondpass(p^.right);
  407. if pushed then restore(p);
  408. { not commutative }
  409. if p^.swaped then
  410. begin
  411. swapp:=p^.left;
  412. p^.left:=p^.right;
  413. p^.right:=swapp;
  414. { because of jump being produced by comparison }
  415. p^.swaped:=not(p^.swaped);
  416. end;
  417. case p^.treetype of
  418. equaln,unequaln:
  419. begin
  420. cmpop:=true;
  421. del_reference(p^.left^.location.reference);
  422. del_reference(p^.right^.location.reference);
  423. pushusedregisters(pushedregs,$ff);
  424. emitpushreferenceaddr(p^.right^.location.reference);
  425. emitpushreferenceaddr(p^.left^.location.reference);
  426. emitcall('SET_COMP_SETS',true);
  427. maybe_loadesi;
  428. popusedregisters(pushedregs);
  429. ungetiftemp(p^.left^.location.reference);
  430. ungetiftemp(p^.right^.location.reference);
  431. end;
  432. addn,symdifn,subn,muln:
  433. begin
  434. cmpop:=false;
  435. del_reference(p^.left^.location.reference);
  436. del_reference(p^.right^.location.reference);
  437. href.symbol:=nil;
  438. pushusedregisters(pushedregs,$ff);
  439. gettempofsizereference(32,href);
  440. emitpushreferenceaddr(href);
  441. { wrong place !! was hard to find out
  442. pushusedregisters(pushedregs,$ff);}
  443. emitpushreferenceaddr(p^.right^.location.reference);
  444. emitpushreferenceaddr(p^.left^.location.reference);
  445. case p^.treetype of
  446. subn:
  447. emitcall('SET_SUB_SETS',true);
  448. addn:
  449. emitcall('SET_ADD_SETS',true);
  450. symdifn:
  451. emitcall('SET_SYMDIF_SETS',true);
  452. muln:
  453. emitcall('SET_MUL_SETS',true);
  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. stringdispose(p^.location.reference.symbol);
  461. p^.location.reference:=href;
  462. end;
  463. else Message(sym_e_type_mismatch);
  464. end;
  465. end
  466. else
  467. begin
  468. { in case of constant put it to the left }
  469. if p^.left^.treetype=ordconstn then
  470. begin
  471. swapp:=p^.right;
  472. p^.right:=p^.left;
  473. p^.left:=swapp;
  474. p^.swaped:=not(p^.swaped);
  475. end;
  476. secondpass(p^.left);
  477. { this will be complicated as
  478. a lot of code below assumes that
  479. p^.location and p^.left^.location are the same }
  480. {$ifdef test_dest_loc}
  481. if dest_loc_known and (dest_loc_tree=p) and
  482. ((dest_loc.loc=LOC_REGISTER) or (dest_loc.loc=LOC_CREGISTER)) then
  483. begin
  484. set_location(p^.location,dest_loc);
  485. in_dest_loc:=true;
  486. is_in_dest:=true;
  487. end
  488. else
  489. {$endif test_dest_loc}
  490. set_location(p^.location,p^.left^.location);
  491. { are too few registers free? }
  492. pushed:=maybe_push(p^.right^.registers32,p);
  493. secondpass(p^.right);
  494. if pushed then restore(p);
  495. if (p^.left^.resulttype^.deftype=pointerdef) or
  496. (p^.right^.resulttype^.deftype=pointerdef) or
  497. ((p^.right^.resulttype^.deftype=objectdef) and
  498. pobjectdef(p^.right^.resulttype)^.isclass and
  499. (p^.left^.resulttype^.deftype=objectdef) and
  500. pobjectdef(p^.left^.resulttype)^.isclass
  501. ) or
  502. (p^.left^.resulttype^.deftype=classrefdef) or
  503. (p^.left^.resulttype^.deftype=procvardef) or
  504. (p^.left^.resulttype^.deftype=enumdef) or
  505. ((p^.left^.resulttype^.deftype=orddef) and
  506. (porddef(p^.left^.resulttype)^.typ=s32bit)) or
  507. ((p^.right^.resulttype^.deftype=orddef) and
  508. (porddef(p^.right^.resulttype)^.typ=s32bit)) or
  509. ((p^.left^.resulttype^.deftype=orddef) and
  510. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  511. ((p^.right^.resulttype^.deftype=orddef) and
  512. (porddef(p^.right^.resulttype)^.typ=u32bit)) or
  513. { as well as small sets }
  514. ((p^.left^.resulttype^.deftype=setdef) and
  515. (psetdef(p^.left^.resulttype)^.settype=smallset)
  516. ) then
  517. begin
  518. do_normal:
  519. mboverflow:=false;
  520. cmpop:=false;
  521. if (p^.left^.resulttype^.deftype=pointerdef) or
  522. (p^.right^.resulttype^.deftype=pointerdef) or
  523. ((p^.left^.resulttype^.deftype=orddef) and
  524. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  525. ((p^.right^.resulttype^.deftype=orddef) and
  526. (porddef(p^.right^.resulttype)^.typ=u32bit)) then
  527. unsigned:=true;
  528. is_set:=p^.resulttype^.deftype=setdef;
  529. case p^.treetype of
  530. addn : begin
  531. if is_set then
  532. begin
  533. op:=A_OR;
  534. mboverflow:=false;
  535. unsigned:=false;
  536. end
  537. else
  538. begin
  539. op:=A_ADD;
  540. mboverflow:=true;
  541. end;
  542. end;
  543. symdifn : begin
  544. { the symetric diff is only for sets }
  545. if is_set then
  546. begin
  547. op:=A_XOR;
  548. mboverflow:=false;
  549. unsigned:=false;
  550. end
  551. else
  552. begin
  553. Message(sym_e_type_mismatch);
  554. end;
  555. end;
  556. muln : begin
  557. if is_set then
  558. begin
  559. op:=A_AND;
  560. mboverflow:=false;
  561. unsigned:=false;
  562. end
  563. else
  564. begin
  565. if unsigned then
  566. op:=A_MUL
  567. else
  568. op:=A_IMUL;
  569. mboverflow:=true;
  570. end;
  571. end;
  572. subn : begin
  573. if is_set then
  574. begin
  575. op:=A_AND;
  576. mboverflow:=false;
  577. unsigned:=false;
  578. extra_not:=true;
  579. end
  580. else
  581. begin
  582. op:=A_SUB;
  583. mboverflow:=true;
  584. end;
  585. end;
  586. ltn,lten,gtn,gten,
  587. equaln,unequaln :
  588. begin
  589. op:=A_CMP;
  590. cmpop:=true;
  591. end;
  592. xorn : op:=A_XOR;
  593. orn : op:=A_OR;
  594. andn : op:=A_AND;
  595. else Message(sym_e_type_mismatch);
  596. end;
  597. { left and right no register? }
  598. { then one must be demanded }
  599. if (p^.left^.location.loc<>LOC_REGISTER) and
  600. (p^.right^.location.loc<>LOC_REGISTER) then
  601. begin
  602. { register variable ? }
  603. if (p^.left^.location.loc=LOC_CREGISTER) then
  604. begin
  605. { it is OK if this is the destination }
  606. if is_in_dest then
  607. begin
  608. hregister:=p^.location.register;
  609. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  610. hregister);
  611. end
  612. else
  613. if cmpop then
  614. begin
  615. { do not disturb the register }
  616. hregister:=p^.location.register;
  617. end
  618. else
  619. begin
  620. case opsize of
  621. S_L : hregister:=getregister32;
  622. S_B : hregister:=reg32toreg8(getregister32);
  623. end;
  624. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  625. hregister);
  626. end
  627. end
  628. else
  629. begin
  630. del_reference(p^.left^.location.reference);
  631. if is_in_dest then
  632. begin
  633. hregister:=p^.location.register;
  634. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  635. newreference(p^.left^.location.reference),hregister)));
  636. end
  637. else
  638. begin
  639. { first give free, then demand new register }
  640. case opsize of
  641. S_L : hregister:=getregister32;
  642. S_B : hregister:=reg32toreg8(getregister32);
  643. end;
  644. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  645. newreference(p^.left^.location.reference),hregister)));
  646. end;
  647. end;
  648. p^.location.loc:=LOC_REGISTER;
  649. p^.location.register:=hregister;
  650. end
  651. else
  652. { if on the right the register then swap }
  653. if (p^.right^.location.loc=LOC_REGISTER) then
  654. begin
  655. swap_location(p^.location,p^.right^.location);
  656. { newly swapped also set swapped flag }
  657. p^.swaped:=not(p^.swaped);
  658. end;
  659. { at this point, p^.location.loc should be LOC_REGISTER }
  660. { and p^.location.register should be a valid register }
  661. { containing the left result }
  662. if p^.right^.location.loc<>LOC_REGISTER then
  663. begin
  664. if (p^.treetype=subn) and p^.swaped then
  665. begin
  666. if p^.right^.location.loc=LOC_CREGISTER then
  667. begin
  668. if extra_not then
  669. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  670. emit_reg_reg(A_MOV,opsize,p^.right^.location.register,R_EDI);
  671. emit_reg_reg(op,opsize,p^.location.register,R_EDI);
  672. emit_reg_reg(A_MOV,opsize,R_EDI,p^.location.register);
  673. end
  674. else
  675. begin
  676. if extra_not then
  677. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  678. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  679. newreference(p^.right^.location.reference),R_EDI)));
  680. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,p^.location.register,R_EDI)));
  681. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,R_EDI,p^.location.register)));
  682. del_reference(p^.right^.location.reference);
  683. end;
  684. end
  685. else
  686. begin
  687. if (p^.right^.treetype=ordconstn) and
  688. (op=A_CMP) and
  689. (p^.right^.value=0) then
  690. begin
  691. exprasmlist^.concat(new(pai386,op_reg_reg(A_TEST,opsize,p^.location.register,
  692. p^.location.register)));
  693. end
  694. else if (p^.right^.treetype=ordconstn) and
  695. (op=A_ADD) and
  696. (p^.right^.value=1) then
  697. begin
  698. exprasmlist^.concat(new(pai386,op_reg(A_INC,opsize,
  699. p^.location.register)));
  700. end
  701. else if (p^.right^.treetype=ordconstn) and
  702. (op=A_SUB) and
  703. (p^.right^.value=1) then
  704. begin
  705. exprasmlist^.concat(new(pai386,op_reg(A_DEC,opsize,
  706. p^.location.register)));
  707. end
  708. else if (p^.right^.treetype=ordconstn) and
  709. (op=A_IMUL) and
  710. (ispowerof2(p^.right^.value,power)) then
  711. begin
  712. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,opsize,power,
  713. p^.location.register)));
  714. end
  715. else
  716. begin
  717. if (p^.right^.location.loc=LOC_CREGISTER) then
  718. begin
  719. if extra_not then
  720. begin
  721. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,R_EDI);
  722. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  723. emit_reg_reg(A_AND,S_L,R_EDI,
  724. p^.location.register);
  725. end
  726. else
  727. begin
  728. emit_reg_reg(op,opsize,p^.right^.location.register,
  729. p^.location.register);
  730. end;
  731. end
  732. else
  733. begin
  734. if extra_not then
  735. begin
  736. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,newreference(
  737. p^.right^.location.reference),R_EDI)));
  738. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  739. emit_reg_reg(A_AND,S_L,R_EDI,
  740. p^.location.register);
  741. end
  742. else
  743. begin
  744. exprasmlist^.concat(new(pai386,op_ref_reg(op,opsize,newreference(
  745. p^.right^.location.reference),p^.location.register)));
  746. end;
  747. del_reference(p^.right^.location.reference);
  748. end;
  749. end;
  750. end;
  751. end
  752. else
  753. begin
  754. { when swapped another result register }
  755. if (p^.treetype=subn) and p^.swaped then
  756. begin
  757. if extra_not then
  758. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.location.register)));
  759. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  760. p^.location.register,p^.right^.location.register)));
  761. swap_location(p^.location,p^.right^.location);
  762. { newly swapped also set swapped flag }
  763. { just to maintain ordering }
  764. p^.swaped:=not(p^.swaped);
  765. end
  766. else
  767. begin
  768. if extra_not then
  769. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.right^.location.register)));
  770. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  771. p^.right^.location.register,
  772. p^.location.register)));
  773. end;
  774. case opsize of
  775. S_L : ungetregister32(p^.right^.location.register);
  776. S_B : ungetregister32(reg8toreg32(p^.right^.location.register));
  777. end;
  778. end;
  779. if cmpop then
  780. case opsize of
  781. S_L : ungetregister32(p^.location.register);
  782. S_B : ungetregister32(reg8toreg32(p^.location.register));
  783. end;
  784. { only in case of overflow operations }
  785. { produce overflow code }
  786. if mboverflow then
  787. { we must put it here directly, because sign of operation }
  788. { is in unsigned VAR!! }
  789. begin
  790. if cs_check_overflow in aktswitches then
  791. begin
  792. getlabel(hl4);
  793. if unsigned then
  794. emitl(A_JNB,hl4)
  795. else
  796. emitl(A_JNO,hl4);
  797. emitcall('RE_OVERFLOW',true);
  798. emitl(A_LABEL,hl4);
  799. end;
  800. end;
  801. end
  802. else if ((p^.left^.resulttype^.deftype=orddef) and
  803. (porddef(p^.left^.resulttype)^.typ=uchar)) then
  804. begin
  805. case p^.treetype of
  806. ltn,lten,gtn,gten,
  807. equaln,unequaln :
  808. cmpop:=true;
  809. else Message(sym_e_type_mismatch);
  810. end;
  811. unsigned:=true;
  812. { left and right no register? }
  813. { the one must be demanded }
  814. if (p^.location.loc<>LOC_REGISTER) and
  815. (p^.right^.location.loc<>LOC_REGISTER) then
  816. begin
  817. if p^.location.loc=LOC_CREGISTER then
  818. begin
  819. if cmpop then
  820. { do not disturb register }
  821. hregister:=p^.location.register
  822. else
  823. begin
  824. hregister:=reg32toreg8(getregister32);
  825. emit_reg_reg(A_MOV,S_B,p^.location.register,
  826. hregister);
  827. end;
  828. end
  829. else
  830. begin
  831. del_reference(p^.location.reference);
  832. { first give free then demand new register }
  833. hregister:=reg32toreg8(getregister32);
  834. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_B,newreference(p^.location.reference),
  835. hregister)));
  836. end;
  837. p^.location.loc:=LOC_REGISTER;
  838. p^.location.register:=hregister;
  839. end;
  840. { now p always a register }
  841. if (p^.right^.location.loc=LOC_REGISTER) and
  842. (p^.location.loc<>LOC_REGISTER) then
  843. begin
  844. swap_location(p^.location,p^.right^.location);
  845. { newly swapped also set swapped flag }
  846. p^.swaped:=not(p^.swaped);
  847. end;
  848. if p^.right^.location.loc<>LOC_REGISTER then
  849. begin
  850. if p^.right^.location.loc=LOC_CREGISTER then
  851. begin
  852. emit_reg_reg(A_CMP,S_B,
  853. p^.right^.location.register,p^.location.register);
  854. end
  855. else
  856. begin
  857. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_B,newreference(
  858. p^.right^.location.reference),p^.location.register)));
  859. del_reference(p^.right^.location.reference);
  860. end;
  861. end
  862. else
  863. begin
  864. emit_reg_reg(A_CMP,S_B,p^.right^.location.register,
  865. p^.location.register);
  866. ungetregister32(reg8toreg32(p^.right^.location.register));
  867. end;
  868. ungetregister32(reg8toreg32(p^.location.register));
  869. end
  870. else if (p^.left^.resulttype^.deftype=floatdef) and
  871. (pfloatdef(p^.left^.resulttype)^.typ<>f32bit) then
  872. begin
  873. { real constants to the left }
  874. if p^.left^.treetype=realconstn then
  875. begin
  876. swapp:=p^.right;
  877. p^.right:=p^.left;
  878. p^.left:=swapp;
  879. p^.swaped:=not(p^.swaped);
  880. end;
  881. cmpop:=false;
  882. case p^.treetype of
  883. addn : op:=A_FADDP;
  884. muln : op:=A_FMULP;
  885. subn : op:=A_FSUBP;
  886. slashn : op:=A_FDIVP;
  887. ltn,lten,gtn,gten,
  888. equaln,unequaln : begin
  889. op:=A_FCOMPP;
  890. cmpop:=true;
  891. end;
  892. else Message(sym_e_type_mismatch);
  893. end;
  894. if (p^.right^.location.loc<>LOC_FPU) then
  895. begin
  896. floatload(pfloatdef(p^.right^.resulttype)^.typ,p^.right^.location.reference);
  897. if (p^.left^.location.loc<>LOC_FPU) then
  898. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  899. { left was on the stack => swap }
  900. else
  901. p^.swaped:=not(p^.swaped);
  902. { releases the right reference }
  903. del_reference(p^.right^.location.reference);
  904. end
  905. { the nominator in st0 }
  906. else if (p^.left^.location.loc<>LOC_FPU) then
  907. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  908. { fpu operands are always in the wrong order on the stack }
  909. else
  910. p^.swaped:=not(p^.swaped);
  911. { releases the left reference }
  912. if (p^.left^.location.loc<>LOC_FPU) then
  913. del_reference(p^.left^.location.reference);
  914. { if we swaped the tree nodes, then use the reverse operator }
  915. if p^.swaped then
  916. begin
  917. if (p^.treetype=slashn) then
  918. op:=A_FDIVRP
  919. else if (p^.treetype=subn) then
  920. op:=A_FSUBRP;
  921. end;
  922. { to avoid the pentium bug
  923. if (op=FDIVP) and (opt_processors=pentium) then
  924. exprasmlist^.concat(new(pai386,op_CALL,S_NO,'EMUL_FDIVP')
  925. else
  926. }
  927. { the Intel assemblers want operands }
  928. if op<>A_FCOMPP then
  929. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,R_ST,R_ST1)))
  930. else
  931. exprasmlist^.concat(new(pai386,op_none(op,S_NO)));
  932. { on comparison load flags }
  933. if cmpop then
  934. begin
  935. if not(R_EAX in unused) then
  936. emit_reg_reg(A_MOV,S_L,R_EAX,R_EDI);
  937. exprasmlist^.concat(new(pai386,op_reg(A_FNSTSW,S_NO,R_AX)));
  938. exprasmlist^.concat(new(pai386,op_none(A_SAHF,S_NO)));
  939. if not(R_EAX in unused) then
  940. emit_reg_reg(A_MOV,S_L,R_EDI,R_EAX);
  941. if p^.swaped then
  942. case p^.treetype of
  943. equaln : flags:=F_E;
  944. unequaln : flags:=F_NE;
  945. ltn : flags:=F_A;
  946. lten : flags:=F_AE;
  947. gtn : flags:=F_B;
  948. gten : flags:=F_BE;
  949. end
  950. else
  951. case p^.treetype of
  952. equaln : flags:=F_E;
  953. unequaln : flags:=F_NE;
  954. ltn : flags:=F_B;
  955. lten : flags:=F_BE;
  956. gtn : flags:=F_A;
  957. gten : flags:=F_AE;
  958. end;
  959. p^.location.loc:=LOC_FLAGS;
  960. p^.location.resflags:=flags;
  961. cmpop:=false;
  962. end
  963. else
  964. p^.location.loc:=LOC_FPU;
  965. end
  966. {$ifdef SUPPORT_MMX}
  967. else if is_mmx_able_array(p^.left^.resulttype) then
  968. begin
  969. cmpop:=false;
  970. mmxbase:=mmx_type(p^.left^.resulttype);
  971. case p^.treetype of
  972. addn : begin
  973. if (cs_mmx_saturation in aktswitches^) then
  974. begin
  975. case mmxbase of
  976. mmxs8bit:
  977. op:=A_PADDSB;
  978. mmxu8bit:
  979. op:=A_PADDUSB;
  980. mmxs16bit,mmxfixed16:
  981. op:=A_PADDSB;
  982. mmxu16bit:
  983. op:=A_PADDUSW;
  984. end;
  985. end
  986. else
  987. begin
  988. case mmxbase of
  989. mmxs8bit,mmxu8bit:
  990. op:=A_PADDB;
  991. mmxs16bit,mmxu16bit,mmxfixed16:
  992. op:=A_PADDW;
  993. mmxs32bit,mmxu32bit:
  994. op:=A_PADDD;
  995. end;
  996. end;
  997. end;
  998. muln : begin
  999. case mmxbase of
  1000. mmxs16bit,mmxu16bit:
  1001. op:=A_PMULLW;
  1002. mmxfixed16:
  1003. op:=A_PMULHW;
  1004. end;
  1005. end;
  1006. subn : begin
  1007. if (cs_mmx_saturation in aktswitches^) then
  1008. begin
  1009. case mmxbase of
  1010. mmxs8bit:
  1011. op:=A_PSUBSB;
  1012. mmxu8bit:
  1013. op:=A_PSUBUSB;
  1014. mmxs16bit,mmxfixed16:
  1015. op:=A_PSUBSB;
  1016. mmxu16bit:
  1017. op:=A_PSUBUSW;
  1018. end;
  1019. end
  1020. else
  1021. begin
  1022. case mmxbase of
  1023. mmxs8bit,mmxu8bit:
  1024. op:=A_PSUBB;
  1025. mmxs16bit,mmxu16bit,mmxfixed16:
  1026. op:=A_PSUBW;
  1027. mmxs32bit,mmxu32bit:
  1028. op:=A_PSUBD;
  1029. end;
  1030. end;
  1031. end;
  1032. {
  1033. ltn,lten,gtn,gten,
  1034. equaln,unequaln :
  1035. begin
  1036. op:=A_CMP;
  1037. cmpop:=true;
  1038. end;
  1039. }
  1040. xorn:
  1041. op:=A_PXOR;
  1042. orn:
  1043. op:=A_POR;
  1044. andn:
  1045. op:=A_PAND;
  1046. else Message(sym_e_type_mismatch);
  1047. end;
  1048. { left and right no register? }
  1049. { then one must be demanded }
  1050. if (p^.left^.location.loc<>LOC_MMXREGISTER) and
  1051. (p^.right^.location.loc<>LOC_MMXREGISTER) then
  1052. begin
  1053. { register variable ? }
  1054. if (p^.left^.location.loc=LOC_CMMXREGISTER) then
  1055. begin
  1056. { it is OK if this is the destination }
  1057. if is_in_dest then
  1058. begin
  1059. hregister:=p^.location.register;
  1060. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1061. hregister);
  1062. end
  1063. else
  1064. begin
  1065. hregister:=getregistermmx;
  1066. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1067. hregister);
  1068. end
  1069. end
  1070. else
  1071. begin
  1072. del_reference(p^.left^.location.reference);
  1073. if is_in_dest then
  1074. begin
  1075. hregister:=p^.location.register;
  1076. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1077. newreference(p^.left^.location.reference),hregister)));
  1078. end
  1079. else
  1080. begin
  1081. hregister:=getregistermmx;
  1082. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1083. newreference(p^.left^.location.reference),hregister)));
  1084. end;
  1085. end;
  1086. p^.location.loc:=LOC_MMXREGISTER;
  1087. p^.location.register:=hregister;
  1088. end
  1089. else
  1090. { if on the right the register then swap }
  1091. if (p^.right^.location.loc=LOC_MMXREGISTER) then
  1092. begin
  1093. swap_location(p^.location,p^.right^.location);
  1094. { newly swapped also set swapped flag }
  1095. p^.swaped:=not(p^.swaped);
  1096. end;
  1097. { at this point, p^.location.loc should be LOC_MMXREGISTER }
  1098. { and p^.location.register should be a valid register }
  1099. { containing the left result }
  1100. if p^.right^.location.loc<>LOC_MMXREGISTER then
  1101. begin
  1102. if (p^.treetype=subn) and p^.swaped then
  1103. begin
  1104. if p^.right^.location.loc=LOC_CMMXREGISTER then
  1105. begin
  1106. emit_reg_reg(A_MOVQ,S_NO,p^.right^.location.register,R_MM7);
  1107. emit_reg_reg(op,S_NO,p^.location.register,R_EDI);
  1108. emit_reg_reg(A_MOVQ,S_NO,R_MM7,p^.location.register);
  1109. end
  1110. else
  1111. begin
  1112. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1113. newreference(p^.right^.location.reference),R_MM7)));
  1114. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,p^.location.register,
  1115. R_MM7)));
  1116. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVQ,S_NO,
  1117. R_MM7,p^.location.register)));
  1118. del_reference(p^.right^.location.reference);
  1119. end;
  1120. end
  1121. else
  1122. begin
  1123. if (p^.right^.location.loc=LOC_CREGISTER) then
  1124. begin
  1125. emit_reg_reg(op,S_NO,p^.right^.location.register,
  1126. p^.location.register);
  1127. end
  1128. else
  1129. begin
  1130. exprasmlist^.concat(new(pai386,op_ref_reg(op,S_NO,newreference(
  1131. p^.right^.location.reference),p^.location.register)));
  1132. del_reference(p^.right^.location.reference);
  1133. end;
  1134. end;
  1135. end
  1136. else
  1137. begin
  1138. { when swapped another result register }
  1139. if (p^.treetype=subn) and p^.swaped then
  1140. begin
  1141. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1142. p^.location.register,p^.right^.location.register)));
  1143. swap_location(p^.location,p^.right^.location);
  1144. { newly swapped also set swapped flag }
  1145. { just to maintain ordering }
  1146. p^.swaped:=not(p^.swaped);
  1147. end
  1148. else
  1149. begin
  1150. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1151. p^.right^.location.register,
  1152. p^.location.register)));
  1153. end;
  1154. ungetregistermmx(p^.right^.location.register);
  1155. end;
  1156. end
  1157. {$endif SUPPORT_MMX}
  1158. else Message(sym_e_type_mismatch);
  1159. end;
  1160. setaddresult(cmpop,unsigned,p);
  1161. end;
  1162. {
  1163. $Log$
  1164. Revision 1.3 1998-04-08 11:34:22 peter
  1165. * nasm works (linux only tested)
  1166. Revision 1.2 1998/03/28 23:09:55 florian
  1167. * secondin bugfix (m68k and i386)
  1168. * overflow checking bugfix (m68k and i386) -- pretty useless in
  1169. secondadd, since everything is done using 32-bit
  1170. * loading pointer to routines hopefully fixed (m68k)
  1171. * flags problem with calls to RTL internal routines fixed (still strcmp
  1172. to fix) (m68k)
  1173. * #ELSE was still incorrect (didn't take care of the previous level)
  1174. * problem with filenames in the command line solved
  1175. * problem with mangledname solved
  1176. * linking name problem solved (was case insensitive)
  1177. * double id problem and potential crash solved
  1178. * stop after first error
  1179. * and=>test problem removed
  1180. * correct read for all float types
  1181. * 2 sigsegv fixes and a cosmetic fix for Internal Error
  1182. * push/pop is now correct optimized (=> mov (%esp),reg)
  1183. Revision 1.1.1.1 1998/03/25 11:18:12 root
  1184. * Restored version
  1185. Revision 1.15 1998/03/10 23:48:36 florian
  1186. * a couple of bug fixes to get the compiler with -OGaxz compiler, sadly
  1187. enough, it doesn't run
  1188. Revision 1.14 1998/03/10 01:17:18 peter
  1189. * all files have the same header
  1190. * messages are fully implemented, EXTDEBUG uses Comment()
  1191. + AG... files for the Assembler generation
  1192. Revision 1.13 1998/03/09 10:44:38 peter
  1193. + string='', string<>'', string:='', string:=char optimizes (the first 2
  1194. were already in cg68k2)
  1195. Revision 1.12 1998/03/06 00:52:16 peter
  1196. * replaced all old messages from errore.msg, only ExtDebug and some
  1197. Comment() calls are left
  1198. * fixed options.pas
  1199. Revision 1.11 1998/03/02 01:48:30 peter
  1200. * renamed target_DOS to target_GO32V1
  1201. + new verbose system, merged old errors and verbose units into one new
  1202. verbose.pas, so errors.pas is obsolete
  1203. Revision 1.10 1998/02/15 21:27:50 florian
  1204. *** empty log message ***
  1205. }