cg386mem.pas 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Generate i386 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 cg386mem;
  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,i386,types,
  38. cgi386,cgai386,temp_gen,tgeni386,hcodegen;
  39. {*****************************************************************************
  40. SecondLoadVMT
  41. *****************************************************************************}
  42. procedure secondloadvmt(var p : ptree);
  43. begin
  44. p^.location.register:=getregister32;
  45. exprasmlist^.concat(new(pai386,op_csymbol_reg(A_MOV,
  46. S_L,newcsymbol(pobjectdef(pclassrefdef(p^.resulttype)^.definition)^.vmt_mangledname,0),
  47. p^.location.register)));
  48. end;
  49. {*****************************************************************************
  50. SecondHNewN
  51. *****************************************************************************}
  52. procedure secondhnewn(var p : ptree);
  53. begin
  54. end;
  55. {*****************************************************************************
  56. SecondNewN
  57. *****************************************************************************}
  58. procedure secondnewn(var p : ptree);
  59. begin
  60. secondpass(p^.left);
  61. if codegenerror then
  62. exit;
  63. p^.location.register:=p^.left^.location.register;
  64. end;
  65. {*****************************************************************************
  66. SecondDisposeN
  67. *****************************************************************************}
  68. procedure secondhdisposen(var p : ptree);
  69. begin
  70. secondpass(p^.left);
  71. if codegenerror then
  72. exit;
  73. clear_reference(p^.location.reference);
  74. case p^.left^.location.loc of
  75. LOC_REGISTER,
  76. LOC_CREGISTER:
  77. begin
  78. p^.location.reference.index:=getregister32;
  79. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,S_L,
  80. p^.left^.location.register,
  81. p^.location.reference.index)));
  82. end;
  83. LOC_MEM,LOC_REFERENCE :
  84. begin
  85. del_reference(p^.left^.location.reference);
  86. p^.location.reference.index:=getregister32;
  87. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,newreference(p^.left^.location.reference),
  88. p^.location.reference.index)));
  89. end;
  90. end;
  91. end;
  92. {*****************************************************************************
  93. SecondNewDispose
  94. *****************************************************************************}
  95. procedure secondsimplenewdispose(var p : ptree);
  96. var
  97. pushed : tpushed;
  98. begin
  99. secondpass(p^.left);
  100. if codegenerror then
  101. exit;
  102. pushusedregisters(pushed,$ff);
  103. { determines the size of the mem block }
  104. push_int(ppointerdef(p^.left^.resulttype)^.definition^.size);
  105. { push pointer adress }
  106. case p^.left^.location.loc of
  107. LOC_CREGISTER : exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,
  108. p^.left^.location.register)));
  109. LOC_REFERENCE:
  110. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  111. end;
  112. { call the mem handling procedures }
  113. case p^.treetype of
  114. simpledisposen:
  115. emitcall('FREEMEM',true);
  116. simplenewn:
  117. emitcall('GETMEM',true);
  118. end;
  119. popusedregisters(pushed);
  120. { may be load ESI }
  121. maybe_loadesi;
  122. end;
  123. {*****************************************************************************
  124. SecondAddr
  125. *****************************************************************************}
  126. procedure secondaddr(var p : ptree);
  127. begin
  128. secondpass(p^.left);
  129. p^.location.loc:=LOC_REGISTER;
  130. del_reference(p^.left^.location.reference);
  131. p^.location.register:=getregister32;
  132. {@ on a procvar means returning an address to the procedure that
  133. is stored in it.}
  134. { yes but p^.left^.symtableentry can be nil
  135. for example on @self !! }
  136. { symtableentry can be also invalid, if left is no tree node }
  137. if (p^.left^.treetype=loadn) and
  138. assigned(p^.left^.symtableentry) and
  139. (p^.left^.symtableentry^.typ=varsym) and
  140. (pvarsym(p^.left^.symtableentry)^.definition^.deftype=procvardef) then
  141. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  142. newreference(p^.left^.location.reference),
  143. p^.location.register)))
  144. else
  145. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  146. newreference(p^.left^.location.reference),
  147. p^.location.register)));
  148. { for use of other segments }
  149. if p^.left^.location.reference.segment<>R_DEFAULT_SEG then
  150. p^.location.segment:=p^.left^.location.reference.segment;
  151. end;
  152. {*****************************************************************************
  153. SecondDoubleAddr
  154. *****************************************************************************}
  155. procedure seconddoubleaddr(var p : ptree);
  156. begin
  157. secondpass(p^.left);
  158. p^.location.loc:=LOC_REGISTER;
  159. del_reference(p^.left^.location.reference);
  160. p^.location.register:=getregister32;
  161. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  162. newreference(p^.left^.location.reference),
  163. p^.location.register)));
  164. end;
  165. {*****************************************************************************
  166. SecondDeRef
  167. *****************************************************************************}
  168. procedure secondderef(var p : ptree);
  169. var
  170. hr : tregister;
  171. begin
  172. secondpass(p^.left);
  173. clear_reference(p^.location.reference);
  174. case p^.left^.location.loc of
  175. LOC_REGISTER:
  176. p^.location.reference.base:=p^.left^.location.register;
  177. LOC_CREGISTER:
  178. begin
  179. { ... and reserve one for the pointer }
  180. hr:=getregister32;
  181. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,hr);
  182. p^.location.reference.base:=hr;
  183. end;
  184. else
  185. begin
  186. { free register }
  187. del_reference(p^.left^.location.reference);
  188. { ...and reserve one for the pointer }
  189. hr:=getregister32;
  190. exprasmlist^.concat(new(pai386,op_ref_reg(
  191. A_MOV,S_L,newreference(p^.left^.location.reference),
  192. hr)));
  193. p^.location.reference.base:=hr;
  194. end;
  195. end;
  196. end;
  197. {*****************************************************************************
  198. SecondSubScriptN
  199. *****************************************************************************}
  200. procedure secondsubscriptn(var p : ptree);
  201. var
  202. hr : tregister;
  203. begin
  204. secondpass(p^.left);
  205. if codegenerror then
  206. exit;
  207. { classes must be dereferenced implicit }
  208. if (p^.left^.resulttype^.deftype=objectdef) and
  209. pobjectdef(p^.left^.resulttype)^.isclass then
  210. begin
  211. clear_reference(p^.location.reference);
  212. case p^.left^.location.loc of
  213. LOC_REGISTER:
  214. p^.location.reference.base:=p^.left^.location.register;
  215. LOC_CREGISTER:
  216. begin
  217. { ... and reserve one for the pointer }
  218. hr:=getregister32;
  219. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,hr);
  220. p^.location.reference.base:=hr;
  221. end;
  222. else
  223. begin
  224. { free register }
  225. del_reference(p^.left^.location.reference);
  226. { ... and reserve one for the pointer }
  227. hr:=getregister32;
  228. exprasmlist^.concat(new(pai386,op_ref_reg(
  229. A_MOV,S_L,newreference(p^.left^.location.reference),
  230. hr)));
  231. p^.location.reference.base:=hr;
  232. end;
  233. end;
  234. end
  235. else
  236. set_location(p^.location,p^.left^.location);
  237. inc(p^.location.reference.offset,p^.vs^.address);
  238. end;
  239. {*****************************************************************************
  240. SecondVecN
  241. *****************************************************************************}
  242. procedure secondvecn(var p : ptree);
  243. var
  244. pushed : boolean;
  245. ind,hr : tregister;
  246. _p : ptree;
  247. function get_mul_size:longint;
  248. begin
  249. if p^.memindex then
  250. get_mul_size:=1
  251. else
  252. get_mul_size:=p^.resulttype^.size;
  253. end;
  254. procedure calc_emit_mul;
  255. var
  256. l1,l2 : longint;
  257. begin
  258. l1:=get_mul_size;
  259. case l1 of
  260. 1,2,4,8 : p^.location.reference.scalefactor:=l1;
  261. else
  262. begin
  263. if ispowerof2(l1,l2) then
  264. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,l2,ind)))
  265. else
  266. exprasmlist^.concat(new(pai386,op_const_reg(A_IMUL,S_L,l1,ind)));
  267. end;
  268. end;
  269. end;
  270. var
  271. extraoffset : longint;
  272. t : ptree;
  273. hp : preference;
  274. tai : Pai386;
  275. begin
  276. secondpass(p^.left);
  277. set_location(p^.location,p^.left^.location);
  278. { in ansistrings S[1] is pchar(S)[0] !! }
  279. if is_ansistring(p^.left^.resulttype) then
  280. dec(p^.location.reference.offset);
  281. { offset can only differ from 0 if arraydef }
  282. if p^.left^.resulttype^.deftype=arraydef then
  283. dec(p^.location.reference.offset,
  284. get_mul_size*parraydef(p^.left^.resulttype)^.lowrange);
  285. if p^.right^.treetype=ordconstn then
  286. begin
  287. { offset can only differ from 0 if arraydef }
  288. if (p^.left^.resulttype^.deftype=arraydef) then
  289. begin
  290. if not(is_open_array(p^.left^.resulttype)) then
  291. begin
  292. if (p^.right^.value>parraydef(p^.left^.resulttype)^.highrange) or
  293. (p^.right^.value<parraydef(p^.left^.resulttype)^.lowrange) then
  294. Message(parser_e_range_check_error);
  295. dec(p^.left^.location.reference.offset,
  296. get_mul_size*parraydef(p^.left^.resulttype)^.lowrange);
  297. end
  298. else
  299. begin
  300. { range checking for open arrays }
  301. end;
  302. end;
  303. inc(p^.left^.location.reference.offset,
  304. get_mul_size*p^.right^.value);
  305. if p^.memseg then
  306. p^.left^.location.reference.segment:=R_FS;
  307. p^.left^.resulttype:=p^.resulttype;
  308. disposetree(p^.right);
  309. _p:=p^.left;
  310. putnode(p);
  311. p:=_p;
  312. end
  313. else
  314. begin
  315. { quick hack, to overcome Delphi 2 }
  316. if (cs_maxoptimieren in aktswitches) and
  317. (p^.left^.resulttype^.deftype=arraydef) then
  318. begin
  319. extraoffset:=0;
  320. if (p^.right^.treetype=addn) then
  321. begin
  322. if p^.right^.right^.treetype=ordconstn then
  323. begin
  324. extraoffset:=p^.right^.right^.value;
  325. t:=p^.right^.left;
  326. putnode(p^.right);
  327. putnode(p^.right^.right);
  328. p^.right:=t
  329. end
  330. else if p^.right^.left^.treetype=ordconstn then
  331. begin
  332. extraoffset:=p^.right^.left^.value;
  333. t:=p^.right^.right;
  334. putnode(p^.right);
  335. putnode(p^.right^.left);
  336. p^.right:=t
  337. end;
  338. end
  339. else if (p^.right^.treetype=subn) then
  340. begin
  341. if p^.right^.right^.treetype=ordconstn then
  342. begin
  343. extraoffset:=p^.right^.right^.value;
  344. t:=p^.right^.left;
  345. putnode(p^.right);
  346. putnode(p^.right^.right);
  347. p^.right:=t
  348. end
  349. else if p^.right^.left^.treetype=ordconstn then
  350. begin
  351. extraoffset:=p^.right^.left^.value;
  352. t:=p^.right^.right;
  353. putnode(p^.right);
  354. putnode(p^.right^.left);
  355. p^.right:=t
  356. end;
  357. end;
  358. inc(p^.location.reference.offset,
  359. get_mul_size*extraoffset);
  360. end;
  361. { calculate from left to right }
  362. if (p^.location.loc<>LOC_REFERENCE) and
  363. (p^.location.loc<>LOC_MEM) then
  364. Message(cg_e_illegal_expression);
  365. pushed:=maybe_push(p^.right^.registers32,p);
  366. secondpass(p^.right);
  367. if pushed then restore(p);
  368. case p^.right^.location.loc of
  369. LOC_REGISTER:
  370. begin
  371. ind:=p^.right^.location.register;
  372. case p^.right^.resulttype^.size of
  373. 1:
  374. begin
  375. hr:=reg8toreg32(ind);
  376. emit_reg_reg(A_MOVZX,S_BL,ind,hr);
  377. ind:=hr;
  378. end;
  379. 2:
  380. begin
  381. hr:=reg16toreg32(ind);
  382. emit_reg_reg(A_MOVZX,S_WL,ind,hr);
  383. ind:=hr;
  384. end;
  385. end;
  386. end;
  387. LOC_CREGISTER:
  388. begin
  389. ind:=getregister32;
  390. case p^.right^.resulttype^.size of
  391. 1:
  392. emit_reg_reg(A_MOVZX,S_BL,p^.right^.location.register,ind);
  393. 2:
  394. emit_reg_reg(A_MOVZX,S_WL,p^.right^.location.register,ind);
  395. 4:
  396. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,ind);
  397. end;
  398. end;
  399. LOC_FLAGS:
  400. begin
  401. ind:=getregister32;
  402. exprasmlist^.concat(new(pai386,op_reg(flag_2_set[p^.right^.location.resflags],S_B,reg32toreg8(ind))));
  403. emit_reg_reg(A_MOVZX,S_BL,reg32toreg8(ind),ind);
  404. end
  405. else
  406. begin
  407. del_reference(p^.right^.location.reference);
  408. ind:=getregister32;
  409. { Booleans are stored in an 8 bit memory location, so
  410. the use of MOVL is not correct }
  411. case p^.right^.resulttype^.size of
  412. 1:
  413. tai:=new(pai386,op_ref_reg(A_MOVZX,S_BL,newreference(p^.right^.location.reference),ind));
  414. 2:
  415. tai:=new(Pai386,op_ref_reg(A_MOVZX,S_WL,newreference(p^.right^.location.reference),ind));
  416. 4:
  417. tai:=new(Pai386,op_ref_reg(A_MOV,S_L,newreference(p^.right^.location.reference),ind));
  418. end;
  419. exprasmlist^.concat(tai);
  420. end;
  421. end;
  422. { produce possible range check code: }
  423. if cs_rangechecking in aktswitches then
  424. begin
  425. if p^.left^.resulttype^.deftype=arraydef then
  426. begin
  427. hp:=new_reference(R_NO,0);
  428. parraydef(p^.left^.resulttype)^.genrangecheck;
  429. hp^.symbol:=stringdup('R_'+tostr(parraydef(p^.left^.resulttype)^.rangenr));
  430. exprasmlist^.concat(new(pai386,op_reg_ref(A_BOUND,S_L,ind,hp)));
  431. end;
  432. end;
  433. if p^.location.reference.index=R_NO then
  434. begin
  435. p^.location.reference.index:=ind;
  436. calc_emit_mul;
  437. end
  438. else
  439. begin
  440. if p^.location.reference.base=R_NO then
  441. begin
  442. case p^.location.reference.scalefactor of
  443. 2 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,1,p^.location.reference.index)));
  444. 4 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,2,p^.location.reference.index)));
  445. 8 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,3,p^.location.reference.index)));
  446. end;
  447. calc_emit_mul;
  448. p^.location.reference.base:=p^.location.reference.index;
  449. p^.location.reference.index:=ind;
  450. end
  451. else
  452. begin
  453. exprasmlist^.concat(new(pai386,op_ref_reg(
  454. A_LEA,S_L,newreference(p^.location.reference),
  455. p^.location.reference.index)));
  456. ungetregister32(p^.location.reference.base);
  457. { the symbol offset is loaded, }
  458. { so release the symbol name and set symbol }
  459. { to nil }
  460. stringdispose(p^.location.reference.symbol);
  461. p^.location.reference.offset:=0;
  462. calc_emit_mul;
  463. p^.location.reference.base:=p^.location.reference.index;
  464. p^.location.reference.index:=ind;
  465. end;
  466. end;
  467. if p^.memseg then
  468. p^.location.reference.segment:=R_FS;
  469. end;
  470. end;
  471. {*****************************************************************************
  472. SecondSelfN
  473. *****************************************************************************}
  474. procedure secondselfn(var p : ptree);
  475. begin
  476. clear_reference(p^.location.reference);
  477. if (p^.resulttype^.deftype=classrefdef) or
  478. ((p^.resulttype^.deftype=objectdef)
  479. and pobjectdef(p^.resulttype)^.isclass
  480. ) then
  481. p^.location.register:=R_ESI
  482. else
  483. p^.location.reference.base:=R_ESI;
  484. end;
  485. {*****************************************************************************
  486. SecondWithN
  487. *****************************************************************************}
  488. procedure secondwith(var p : ptree);
  489. var
  490. ref : treference;
  491. symtable : psymtable;
  492. i : longint;
  493. begin
  494. if assigned(p^.left) then
  495. begin
  496. secondpass(p^.left);
  497. ref.symbol:=nil;
  498. gettempofsizereference(4,ref);
  499. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  500. newreference(p^.left^.location.reference),R_EDI)));
  501. exprasmlist^.concat(new(pai386,op_reg_ref(A_MOV,S_L,
  502. R_EDI,newreference(ref))));
  503. del_reference(p^.left^.location.reference);
  504. { the offset relative to (%ebp) is only needed here! }
  505. symtable:=p^.withsymtable;
  506. for i:=1 to p^.tablecount do
  507. begin
  508. symtable^.datasize:=ref.offset;
  509. symtable:=symtable^.next;
  510. end;
  511. { p^.right can be optimize out !!! }
  512. if p^.right<>nil then
  513. secondpass(p^.right);
  514. { clear some stuff }
  515. ungetiftemp(ref);
  516. end;
  517. end;
  518. end.
  519. {
  520. $Log$
  521. Revision 1.3 1998-06-25 08:48:09 florian
  522. * first version of rtti support
  523. Revision 1.2 1998/06/08 13:13:35 pierre
  524. + temporary variables now in temp_gen.pas unit
  525. because it is processor independent
  526. * mppc68k.bat modified to undefine i386 and support_mmx
  527. (which are defaults for i386)
  528. Revision 1.1 1998/06/05 17:44:13 peter
  529. * splitted cgi386
  530. }