cg68kmem.pas 28 KB

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