cg68kmem.pas 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Generate m68k assembler for in memory related nodes
  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 cg68kmem;
  19. interface
  20. uses
  21. tree;
  22. procedure secondloadvmt(var p : ptree);
  23. procedure secondhnewn(var p : ptree);
  24. procedure secondnewn(var p : ptree);
  25. procedure secondhdisposen(var p : ptree);
  26. procedure secondsimplenewdispose(var p : ptree);
  27. procedure secondaddr(var p : ptree);
  28. procedure seconddoubleaddr(var p : ptree);
  29. procedure secondderef(var p : ptree);
  30. procedure secondsubscriptn(var p : ptree);
  31. procedure secondvecn(var p : ptree);
  32. procedure secondselfn(var p : ptree);
  33. procedure secondwith(var p : ptree);
  34. implementation
  35. uses
  36. cobjects,verbose,globals,systems,
  37. symtable,aasm,types,
  38. hcodegen,temp_gen,pass_2,
  39. m68k,cga68k,tgen68k;
  40. {*****************************************************************************
  41. SecondLoadVMT
  42. *****************************************************************************}
  43. procedure secondloadvmt(var p : ptree);
  44. begin
  45. p^.location.loc:=LOC_REGISTER;
  46. p^.location.register:=getregister32;
  47. exprasmlist^.concat(new(pai68k,op_csymbol_reg(A_MOVE,
  48. S_L,newcsymbol(pobjectdef(pclassrefdef(p^.resulttype)^.definition)^.vmt_mangledname,0),
  49. p^.location.register)));
  50. end;
  51. {*****************************************************************************
  52. SecondHNewN
  53. *****************************************************************************}
  54. procedure secondhnewn(var p : ptree);
  55. begin
  56. end;
  57. {*****************************************************************************
  58. SecondNewN
  59. *****************************************************************************}
  60. procedure secondnewn(var p : ptree);
  61. begin
  62. secondpass(p^.left);
  63. if codegenerror then
  64. exit;
  65. p^.location.register:=p^.left^.location.register;
  66. end;
  67. {*****************************************************************************
  68. SecondDisposeN
  69. *****************************************************************************}
  70. procedure secondhdisposen(var p : ptree);
  71. begin
  72. secondpass(p^.left);
  73. if codegenerror then
  74. exit;
  75. clear_reference(p^.location.reference);
  76. case p^.left^.location.loc of
  77. LOC_REGISTER,
  78. LOC_CREGISTER : begin
  79. p^.location.reference.base:=getaddressreg;
  80. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  81. p^.left^.location.register,
  82. p^.location.reference.base)));
  83. end;
  84. LOC_MEM,LOC_REFERENCE :
  85. begin
  86. del_reference(p^.left^.location.reference);
  87. p^.location.reference.base:=getaddressreg;
  88. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,newreference(p^.left^.location.reference),
  89. p^.location.reference.base)));
  90. end;
  91. end;
  92. end;
  93. {*****************************************************************************
  94. SecondNewDispose
  95. *****************************************************************************}
  96. procedure secondsimplenewdispose(var p : ptree);
  97. var
  98. pushed : tpushed;
  99. r : preference;
  100. begin
  101. secondpass(p^.left);
  102. if codegenerror then
  103. exit;
  104. pushusedregisters(pushed,$ffff);
  105. { determines the size of the mem block }
  106. push_int(ppointerdef(p^.left^.resulttype)^.definition^.size);
  107. { push pointer adress }
  108. case p^.left^.location.loc of
  109. LOC_CREGISTER : exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  110. p^.left^.location.register,R_SPPUSH)));
  111. LOC_REFERENCE:
  112. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  113. end;
  114. { call the mem handling procedures }
  115. case p^.treetype of
  116. simpledisposen:
  117. begin
  118. if ppointerdef(p^.left^.resulttype)^.definition^.needs_inittable then
  119. begin
  120. {!!!!!!!}
  121. (* new(r);
  122. reset_reference(r^);
  123. r^.symbol:=stringdup(lab2str(ppointerdef(p^.left^.resulttype)^.definition^.get_rtti_label));
  124. emitpushreferenceaddr(exprasmlist,r^);
  125. { push pointer adress }
  126. case p^.left^.location.loc of
  127. LOC_CREGISTER : exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,
  128. p^.left^.location.register)));
  129. LOC_REFERENCE:
  130. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  131. end;
  132. emitcall('FPC_FINALIZE',true); *)
  133. end;
  134. emitcall('FPC_FREEMEM',true);
  135. end;
  136. simplenewn:
  137. begin
  138. emitcall('FPC_GETMEM',true);
  139. if ppointerdef(p^.left^.resulttype)^.definition^.needs_inittable then
  140. begin
  141. {!!!!!!!}
  142. (* new(r);
  143. reset_reference(r^);
  144. r^.symbol:=stringdup(lab2str(ppointerdef(p^.left^.resulttype)^.definition^.get_rtti_label));
  145. emitpushreferenceaddr(exprasmlist,r^);
  146. { push pointer adress }
  147. case p^.left^.location.loc of
  148. LOC_CREGISTER : exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,
  149. p^.left^.location.register)));
  150. LOC_REFERENCE:
  151. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  152. end;
  153. emitcall('FPC_INITIALIZE',true); *)
  154. end;
  155. end;
  156. end;
  157. popusedregisters(pushed);
  158. { may be load ESI }
  159. maybe_loada5;
  160. end;
  161. {*****************************************************************************
  162. SecondAddr
  163. *****************************************************************************}
  164. procedure secondaddr(var p : ptree);
  165. begin
  166. secondpass(p^.left);
  167. p^.location.loc:=LOC_REGISTER;
  168. p^.location.register:=getregister32;
  169. {@ on a procvar means returning an address to the procedure that
  170. is stored in it.}
  171. { yes but p^.left^.symtableentry can be nil
  172. for example on @self !! }
  173. { symtableentry can be also invalid, if left is no tree node }
  174. if (p^.left^.treetype=loadn) and
  175. assigned(p^.left^.symtableentry) and
  176. (p^.left^.symtableentry^.typ=varsym) and
  177. (Pvarsym(p^.left^.symtableentry)^.definition^.deftype=
  178. procvardef) then
  179. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  180. newreference(p^.left^.location.reference),
  181. p^.location.register)))
  182. else
  183. begin
  184. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  185. newreference(p^.left^.location.reference),R_A0)));
  186. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  187. R_A0,p^.location.register)));
  188. end;
  189. { for use of other segments }
  190. { if p^.left^.location.reference.segment<>R_DEFAULT_SEG then
  191. p^.location.segment:=p^.left^.location.reference.segment;
  192. }
  193. del_reference(p^.left^.location.reference);
  194. end;
  195. {*****************************************************************************
  196. SecondDoubleAddr
  197. *****************************************************************************}
  198. procedure seconddoubleaddr(var p : ptree);
  199. begin
  200. secondpass(p^.left);
  201. p^.location.loc:=LOC_REGISTER;
  202. del_reference(p^.left^.location.reference);
  203. p^.location.register:=getregister32;
  204. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  205. newreference(p^.left^.location.reference),R_A0)));
  206. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,
  207. R_A0,p^.location.register)));
  208. end;
  209. {*****************************************************************************
  210. SecondDeRef
  211. *****************************************************************************}
  212. procedure secondderef(var p : ptree);
  213. var
  214. hr : tregister;
  215. begin
  216. secondpass(p^.left);
  217. clear_reference(p^.location.reference);
  218. case p^.left^.location.loc of
  219. LOC_REGISTER : Begin
  220. hr := getaddressreg;
  221. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hr);
  222. p^.location.reference.base:=hr;
  223. ungetregister(p^.left^.location.register);
  224. end;
  225. LOC_CREGISTER : begin
  226. { ... and reserve one for the pointer }
  227. hr:=getaddressreg;
  228. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hr);
  229. p^.location.reference.base:=hr;
  230. { LOC_REGISTER indicates that this is a
  231. variable register which should not be freed. }
  232. { ungetregister(p^.left^.location.register); }
  233. end;
  234. else
  235. begin
  236. { free register }
  237. del_reference(p^.left^.location.reference);
  238. { ...and reserve one for the pointer }
  239. hr:=getaddressreg;
  240. exprasmlist^.concat(new(pai68k,op_ref_reg(
  241. A_MOVE,S_L,newreference(p^.left^.location.reference),
  242. hr)));
  243. p^.location.reference.base:=hr;
  244. end;
  245. end;
  246. end;
  247. {*****************************************************************************
  248. SecondSubScriptN
  249. *****************************************************************************}
  250. procedure secondsubscriptn(var p : ptree);
  251. var
  252. hr: tregister;
  253. begin
  254. secondpass(p^.left);
  255. if codegenerror then
  256. exit;
  257. { classes must be dereferenced implicit }
  258. if (p^.left^.resulttype^.deftype=objectdef) and
  259. pobjectdef(p^.left^.resulttype)^.isclass then
  260. begin
  261. clear_reference(p^.location.reference);
  262. case p^.left^.location.loc of
  263. LOC_REGISTER:
  264. begin
  265. { move it to an address register...}
  266. hr:=getaddressreg;
  267. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hr);
  268. p^.location.reference.base:=hr;
  269. { free register }
  270. ungetregister(p^.left^.location.register);
  271. end;
  272. LOC_CREGISTER:
  273. begin
  274. { ... and reserve one for the pointer }
  275. hr:=getaddressreg;
  276. emit_reg_reg(A_MOVE,S_L,p^.left^.location.register,hr);
  277. p^.location.reference.base:=hr;
  278. end;
  279. else
  280. begin
  281. { free register }
  282. del_reference(p^.left^.location.reference);
  283. { ... and reserve one for the pointer }
  284. hr:=getaddressreg;
  285. exprasmlist^.concat(new(pai68k,op_ref_reg(
  286. A_MOVE,S_L,newreference(p^.left^.location.reference),
  287. hr)));
  288. p^.location.reference.base:=hr;
  289. end;
  290. end;
  291. end
  292. else
  293. set_location(p^.location,p^.left^.location);
  294. inc(p^.location.reference.offset,p^.vs^.address);
  295. end;
  296. {*****************************************************************************
  297. SecondVecN
  298. *****************************************************************************}
  299. { used D0, D1 as scratch (ok) }
  300. { arrays ... }
  301. { Sets up the array and string }
  302. { references . }
  303. procedure secondvecn(var p : ptree);
  304. var
  305. pushed : boolean;
  306. ind : tregister;
  307. _p : ptree;
  308. procedure calc_emit_mul;
  309. var
  310. l1,l2 : longint;
  311. begin
  312. l1:=p^.resulttype^.size;
  313. case l1 of
  314. 1 : p^.location.reference.scalefactor:=l1;
  315. 2 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,1,ind)));
  316. 4 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,2,ind)));
  317. 8 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,3,ind)));
  318. else
  319. begin
  320. if ispowerof2(l1,l2) then
  321. exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,l2,ind)))
  322. else
  323. begin
  324. { use normal MC68000 signed multiply }
  325. if (l1 >= -32768) and (l1 <= 32767) then
  326. exprasmlist^.concat(new(pai68k,op_const_reg(A_MULS,S_W,l1,ind)))
  327. else
  328. { use long MC68020 long multiply }
  329. if (aktoptprocessor = MC68020) then
  330. exprasmlist^.concat(new(pai68k,op_const_reg(A_MULS,S_L,l1,ind)))
  331. else
  332. { MC68000 long multiply }
  333. begin
  334. exprasmlist^.concat(new(pai68k,op_const_reg(A_MOVE,S_L,l1,R_D0)));
  335. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,ind,R_D1)));
  336. emitcall('FPC_LONGMUL',true);
  337. exprasmlist^.concat(new(pai68k,op_reg_reg(A_MOVE,S_L,R_D0,ind)));
  338. end;
  339. end;
  340. end; { else case }
  341. end; { end case }
  342. end; { calc_emit_mul }
  343. var
  344. extraoffset : longint;
  345. t : ptree;
  346. hp : preference;
  347. tai:pai68k;
  348. reg: tregister;
  349. begin
  350. secondpass(p^.left);
  351. { RESULT IS IN p^.location.reference }
  352. set_location(p^.location,p^.left^.location);
  353. { offset can only differ from 0 if arraydef }
  354. if p^.left^.resulttype^.deftype=arraydef then
  355. dec(p^.location.reference.offset,
  356. p^.resulttype^.size*
  357. parraydef(p^.left^.resulttype)^.lowrange);
  358. if p^.right^.treetype=ordconstn then
  359. begin
  360. { offset can only differ from 0 if arraydef }
  361. if (p^.left^.resulttype^.deftype=arraydef) then
  362. begin
  363. if not(is_open_array(p^.left^.resulttype)) then
  364. begin
  365. if (p^.right^.value>parraydef(p^.left^.resulttype)^.highrange) or
  366. (p^.right^.value<parraydef(p^.left^.resulttype)^.lowrange) then
  367. CGMessage(parser_e_range_check_error);
  368. dec(p^.left^.location.reference.offset,
  369. p^.resulttype^.size*parraydef(p^.left^.resulttype)^.lowrange);
  370. end
  371. else
  372. begin
  373. { range checking for open arrays }
  374. end;
  375. end;
  376. inc(p^.left^.location.reference.offset,
  377. p^.right^.value*p^.resulttype^.size);
  378. p^.left^.resulttype:=p^.resulttype;
  379. disposetree(p^.right);
  380. _p:=p^.left;
  381. putnode(p);
  382. p:=_p;
  383. end
  384. else
  385. begin
  386. { quick hack, to overcome Delphi 2 }
  387. if (�cs_regalloc in aktglobalswitches) and
  388. (p^.left^.resulttype^.deftype=arraydef) then
  389. begin
  390. extraoffset:=0;
  391. if (p^.right^.treetype=addn) then
  392. begin
  393. if p^.right^.right^.treetype=ordconstn then
  394. begin
  395. extraoffset:=p^.right^.right^.value;
  396. t:=p^.right^.left;
  397. putnode(p^.right);
  398. putnode(p^.right^.right);
  399. p^.right:=t
  400. end
  401. else if p^.right^.left^.treetype=ordconstn then
  402. begin
  403. extraoffset:=p^.right^.left^.value;
  404. t:=p^.right^.right;
  405. putnode(p^.right);
  406. putnode(p^.right^.left);
  407. p^.right:=t
  408. end;
  409. end
  410. else if (p^.right^.treetype=subn) then
  411. begin
  412. if p^.right^.right^.treetype=ordconstn then
  413. begin
  414. extraoffset:=p^.right^.right^.value;
  415. t:=p^.right^.left;
  416. putnode(p^.right);
  417. putnode(p^.right^.right);
  418. p^.right:=t
  419. end
  420. else if p^.right^.left^.treetype=ordconstn then
  421. begin
  422. extraoffset:=p^.right^.left^.value;
  423. t:=p^.right^.right;
  424. putnode(p^.right);
  425. putnode(p^.right^.left);
  426. p^.right:=t
  427. end;
  428. end;
  429. inc(p^.location.reference.offset,
  430. p^.resulttype^.size*extraoffset);
  431. end;
  432. { calculate from left to right }
  433. if (p^.location.loc<>LOC_REFERENCE) and
  434. (p^.location.loc<>LOC_MEM) then
  435. CGMessage(cg_e_illegal_expression);
  436. pushed:=maybe_push(p^.right^.registers32,p);
  437. secondpass(p^.right);
  438. if pushed then restore(p);
  439. case p^.right^.location.loc of
  440. LOC_REGISTER : begin
  441. ind:=p^.right^.location.register;
  442. case p^.right^.resulttype^.size of
  443. 1: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  444. $ff,ind)));
  445. 2: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  446. $ffff,ind)));
  447. end;
  448. end;
  449. LOC_CREGISTER : begin
  450. ind:=getregister32;
  451. emit_reg_reg(A_MOVE,S_L,p^.right^.location.register,ind);
  452. case p^.right^.resulttype^.size of
  453. 1: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  454. $ff,ind)));
  455. 2: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  456. $ffff,ind)));
  457. end;
  458. end;
  459. LOC_FLAGS:
  460. begin
  461. ind:=getregister32;
  462. exprasmlist^.concat(new(pai68k,op_reg(flag_2_set[p^.right^.location.resflags],S_B,ind)));
  463. exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,$ff,ind)));
  464. end
  465. else { else outer case }
  466. begin
  467. del_reference(p^.right^.location.reference);
  468. ind:=getregister32;
  469. exprasmlist^.concat(new(pai68k,op_ref_reg(A_MOVE,S_L,
  470. newreference(p^.right^.location.reference),ind)));
  471. {Booleans are stored in an 8 bit memory location, so
  472. the use of MOVL is not correct.}
  473. case p^.right^.resulttype^.size of
  474. 1: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  475. $ff,ind)));
  476. 2: exprasmlist^.concat(new(pai68k,op_const_reg(A_AND,S_L,
  477. $ffff,ind)));
  478. end; { end case }
  479. end; { end else begin }
  480. end;
  481. { produce possible range check code: }
  482. if cs_check_range in aktlocalswitches then
  483. begin
  484. if p^.left^.resulttype^.deftype=arraydef then
  485. begin
  486. new(hp);
  487. reset_reference(hp^);
  488. parraydef(p^.left^.resulttype)^.genrangecheck;
  489. hp^.symbol:=stringdup(parraydef(p^.left^.resulttype)^.getrangecheckstring);
  490. emit_bounds_check(hp^,ind);
  491. end;
  492. end;
  493. { ------------------------ HANDLE INDEXING ----------------------- }
  494. { In Motorola 680x0 mode, displacement can only be of 64K max. }
  495. { Therefore instead of doing a direct displacement, we must first }
  496. { load the new address into an address register. Therefore the }
  497. { symbol is not used. }
  498. if assigned(p^.location.reference.symbol) then
  499. begin
  500. if p^.location.reference.base <> R_NO then
  501. CGMessage(cg_f_secondvecn_base_defined_twice);
  502. p^.location.reference.base:=getaddressreg;
  503. exprasmlist^.concat(new(pai68k,op_csymbol_reg(A_LEA,S_L,newcsymbol(p^.location.reference.symbol^,0),
  504. p^.location.reference.base)));
  505. stringdispose(p^.location.reference.symbol);
  506. end;
  507. if (p^.location.reference.index=R_NO) then
  508. begin
  509. p^.location.reference.index:=ind;
  510. calc_emit_mul;
  511. { here we must check for the offset }
  512. { and if out of bounds for the motorola }
  513. { eg: out of signed d8 then reload index }
  514. { with correct value. }
  515. if p^.location.reference.offset > 127 then
  516. begin
  517. exprasmlist^.concat(new(pai68k,op_const_reg(A_ADD,S_L,p^.location.reference.offset,ind)));
  518. p^.location.reference.offset := 0;
  519. end
  520. else if p^.location.reference.offset < -128 then
  521. begin
  522. exprasmlist^.concat(new(pai68k,op_const_reg(A_SUB,S_L,-p^.location.reference.offset,ind)));
  523. p^.location.reference.offset := 0;
  524. end;
  525. end
  526. { if no index then allways get an address register !! PM }
  527. else if p^.location.reference.base=R_NO then
  528. begin
  529. case p^.location.reference.scalefactor of
  530. 2 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,1,p^.location.reference.index)));
  531. 4 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,2,p^.location.reference.index)));
  532. 8 : exprasmlist^.concat(new(pai68k,op_const_reg(A_LSL,S_L,3,p^.location.reference.index)));
  533. end;
  534. calc_emit_mul;
  535. { we must use address register to put index in base }
  536. { compare with cgi386.pas }
  537. reg := getaddressreg;
  538. p^.location.reference.base := reg;
  539. emit_reg_reg(A_MOVE,S_L,p^.location.reference.index,reg);
  540. ungetregister(p^.location.reference.index);
  541. p^.location.reference.index:=ind;
  542. end
  543. else
  544. begin
  545. reg := getaddressreg;
  546. exprasmlist^.concat(new(pai68k,op_ref_reg(
  547. A_LEA,S_L,newreference(p^.location.reference),
  548. reg)));
  549. ungetregister(p^.location.reference.base);
  550. { the symbol offset is loaded, }
  551. { so release the symbol name and set symbol }
  552. { to nil }
  553. stringdispose(p^.location.reference.symbol);
  554. p^.location.reference.offset:=0;
  555. calc_emit_mul;
  556. p^.location.reference.base:=reg;
  557. ungetregister32(p^.location.reference.index);
  558. p^.location.reference.index:=ind;
  559. end;
  560. end;
  561. end;
  562. {*****************************************************************************
  563. SecondSelfN
  564. *****************************************************************************}
  565. procedure secondselfn(var p : ptree);
  566. begin
  567. clear_reference(p^.location.reference);
  568. p^.location.reference.base:=R_A5;
  569. end;
  570. {*****************************************************************************
  571. SecondWithN
  572. *****************************************************************************}
  573. procedure secondwith(var p : ptree);
  574. var
  575. ref : treference;
  576. symtable : psymtable;
  577. i : longint;
  578. begin
  579. if assigned(p^.left) then
  580. begin
  581. secondpass(p^.left);
  582. ref.symbol:=nil;
  583. gettempofsizereference(4,ref);
  584. exprasmlist^.concat(new(pai68k,op_ref_reg(A_LEA,S_L,
  585. newreference(p^.left^.location.reference),R_A0)));
  586. exprasmlist^.concat(new(pai68k,op_reg_ref(A_MOVE,S_L,
  587. R_A0,newreference(ref))));
  588. del_reference(p^.left^.location.reference);
  589. { the offset relative to (%ebp) is only needed here! }
  590. symtable:=p^.withsymtable;
  591. for i:=1 to p^.tablecount do
  592. begin
  593. symtable^.datasize:=ref.offset;
  594. symtable:=symtable^.next;
  595. end;
  596. { p^.right can be optimize out !!! }
  597. if p^.right<>nil then
  598. secondpass(p^.right);
  599. { clear some stuff }
  600. ungetiftemp(ref);
  601. end;
  602. end;
  603. end.
  604. {
  605. $Log$
  606. Revision 1.8 1998-10-14 11:28:21 florian
  607. * emitpushreferenceaddress gets now the asmlist as parameter
  608. * m68k version compiles with -duseansistrings
  609. Revision 1.7 1998/10/14 08:08:54 pierre
  610. * following Peters remark, removed all ifdef in
  611. the systems unit enums
  612. * last bugs of cg68k removed for sysamiga
  613. (sysamiga assembles with as68k !!)
  614. Revision 1.6 1998/10/06 20:49:00 peter
  615. * m68k compiler compiles again
  616. Revision 1.5 1998/09/17 09:42:28 peter
  617. + pass_2 for cg386
  618. * Message() -> CGMessage() for pass_1/pass_2
  619. Revision 1.4 1998/09/14 10:44:02 peter
  620. * all internal RTL functions start with FPC_
  621. Revision 1.3 1998/09/11 12:29:44 pierre
  622. * removed explicit range_checking as it is buggy
  623. Revision 1.2.2.1 1998/09/11 12:08:59 pierre
  624. * removed explicit range_check was buggy
  625. Revision 1.2 1998/09/07 18:45:57 peter
  626. * update smartlinking, uses getdatalabel
  627. * renamed ptree.value vars to value_str,value_real,value_set
  628. Revision 1.1 1998/09/01 09:07:09 peter
  629. * m68k fixes, splitted cg68k like cgi386
  630. }